Certified Result Checking for Polyhedral Analysis of Bytecode Programs-Reference-Cited by-同舟云学术

Certified Result Checking for Polyhedral Analysis of Bytecode Programs

Published:2010 Issue: Volume: Page:253-267
ISSN:0302-9743
Container-title:Trustworthly Global Computing
language:
Short-container-title:

Author:

Besson Frédéric,Jensen Thomas,Pichardie David,Turpin Tiphaine

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15640-3_17

Reference25 articles.

1. Allen, S.F., Constable, R.L., Howe, D.J., Aitken, W.E.: The semantics of reflected proof. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 95–105. IEEE Computer Society, Los Alamitos (1990)

2. Lecture Notes in Computer Science;G. Barthe,2004

3. Lecture Notes in Computer Science;F. Besson,2006

4. Besson, F., Jensen, T., Pichardie, D., Turpin, T.: Result certification for relational program analysis. Research Report 6333, Inria (2007), http://hal.inria.fr/inria-00166930/

5. Lecture Notes in Computer Science;F. Besson,2007

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Refinement to Certify Abstract Interpretations: Illustrated on Linearization for Polyhedra;Journal of Automated Reasoning;2018-11-10

2. The Verified Polyhedron Library: an Overview;2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2018-09

3. Certifying execution time in multicores;Science of Computer Programming;2015-11

4. Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra;Interactive Theorem Proving;2015

5. Inference of polynomial invariants for imperative programs: A farewell to Gröbner bases;Science of Computer Programming;2014-11