| Publication | Date of Publication | Type |
|---|
| Syntactic and semantic soundness of structural dataflow analysis | 2024-04-19 | Paper |
| Verifying numerical programs via iterative abstract testing | 2024-04-19 | Paper |
| Responsibility analysis by abstract interpretation | 2024-04-19 | Paper |
| Abstract semantic dependency | 2024-04-19 | Paper |
Abstract interpretation of graphs
Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems | 2023-08-17 | Paper |
Asynchronous correspondences between hybrid trajectory semantics
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Program analysis is harder than verification: a computability perspective
Computer Aided Verification | 2023-05-05 | Paper |
| Dynamic interval analysis by abstract interpretation | 2023-04-13 | Paper |
On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
Logic-Based Program Synthesis and Transformation | 2022-08-25 | Paper |
Calculational design of a regular model checker by abstract interpretation
Theoretical Computer Science | 2021-05-10 | Paper |
| Principles of abstract interpretation | 2021-04-02 | Paper |
Calculational design of a regular model checker by abstract interpretation
Theoretical Aspects of Computing – ICTAC 2019 | 2019-12-12 | Paper |
Abstract interpretation
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Ogre and Pythia: an invariance proof method for weak consistency models
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
An abstract interpretation-based framework for software watermarking
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
An abstract interpretation framework for termination
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Systematic design of program transformation frameworks by abstract interpretation
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Abstracting induction by extrapolation and interpolation
Lecture Notes in Computer Science | 2015-02-04 | Paper |
A parametric segmentation functor for fully automatic and scalable array content analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
A Galois connection calculus for abstract interpretation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
Theories, solvers and static analysis by abstract interpretation
Journal of the ACM | 2014-02-17 | Paper |
Bi-inductive structural semantics (extended abstract)
Electronic Notes in Theoretical Computer Science | 2014-01-10 | Paper |
A Case Study in Abstract Interpretation Based Program Transformation
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Probabilistic abstract interpretation
Programming Languages and Systems | 2012-06-22 | Paper |
Grammar semantics, analysis and parsing by abstract interpretation
Theoretical Computer Science | 2012-01-04 | Paper |
The reduced product of abstract domains and the combination of decision procedures
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Linear absolute value relation analysis
Programming Languages and Systems | 2011-05-19 | Paper |
Precondition inference from intermittent assertions and application to contracts on collections
Lecture Notes in Computer Science | 2011-02-15 | Paper |
A scalable segmented decision tree abstract domain
Time for Verification | 2010-09-07 | Paper |
Verification by abstract interpretation
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Why does Astrée scale up?
Formal Methods in System Design | 2010-02-05 | Paper |
An abstract domain to discover interval linear equalities
Lecture Notes in Computer Science | 2010-01-14 | Paper |
Abstract interpretation of resolution-based semantics
Theoretical Computer Science | 2009-11-04 | Paper |
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Static Analysis | 2009-08-18 | Paper |
Bi-inductive structural semantics
Information and Computation | 2009-04-14 | Paper |
Fixpoint-Guided Abstraction Refinements
Static Analysis | 2009-03-03 | Paper |
Grammar Analysis and Parsing by Abstract Interpretation
Program Analysis and Compilation, Theory and Practice | 2007-09-24 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
| scientific article; zbMATH DE number 2087567 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087617 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2085260 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2080754 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1953274 (Why is no real title available?) | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1953018 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1903343 (Why is no real title available?) | 2003-05-01 | Paper |
Parsing as abstract interpretation of grammar semantics
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1759702 (Why is no real title available?) | 2002-07-28 | Paper |
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1390341 (Why is no real title available?) | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1231565 (Why is no real title available?) | 1998-12-20 | Paper |
| scientific article; zbMATH DE number 1142325 (Why is no real title available?) | 1998-05-14 | Paper |
``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs
Theoretical Computer Science | 1994-06-02 | Paper |
Abstract Interpretation Frameworks
Journal Of Logic And Computation | 1993-06-29 | Paper |
Abstract interpretation and application to logic programs
The Journal of Logic Programming | 1992-09-27 | Paper |
A language independent proof of the soundness and completeness of generalized Hoare logic
Information and Computation | 1989-01-01 | Paper |
Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
Acta Informatica | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4070286 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3792232 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3675290 (Why is no real title available?) | 1980-01-01 | Paper |
Constructive versions of Tarski's fixed point theorems
Pacific Journal of Mathematics | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3610766 (Why is no real title available?) | 1978-01-01 | Paper |
