| Publication | Date of Publication | Type |
|---|
| Certified verification for algebraic abstraction | 2024-02-01 | Paper |
| \textsc{CoqCryptoLine}: a verified model checker with certified results | 2024-01-12 | Paper |
Model checking differentially private properties
Programming Languages and Systems | 2023-08-02 | Paper |
Model checking differentially private properties
Theoretical Computer Science | 2023-01-05 | Paper |
Verifying Pufferfish privacy in hidden Markov models
(available as arXiv preprint) | 2022-07-08 | Paper |
| CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver | 2022-03-25 | Paper |
| scientific article; zbMATH DE number 7378548 (Why is no real title available?) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7361373 (Why is no real title available?) | 2021-06-21 | Paper |
scientific article; zbMATH DE number 7361373 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-21 | Paper |
Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
(available as arXiv preprint) | 2018-03-01 | Paper |
Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
Automatically inferring loop invariants via algorithmic learning
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Array theory of bounded elements and its applications
Journal of Automated Reasoning | 2015-06-23 | Paper |
VCS: a verifier for component-based systems
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
| -calculus model checking in Maude | 2013-09-20 | Paper |
A unified framework for DPLL(T) + certificates
Journal of Applied Mathematics | 2013-06-14 | Paper |
Predicate generation for learning-based quantifier-free loop invariant inference
Logical Methods in Computer Science | 2012-10-22 | Paper |
Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
International Journal of Foundations of Computer Science | 2010-04-22 | Paper |
Deriving invariants by algorithmic learning, decision procedures, and predicate abstraction
Lecture Notes in Computer Science | 2010-01-14 | Paper |
AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
Learning Minimal Separating DFA’s for Compositional Verification
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
Implementation and Applications of Automata | 2009-02-12 | Paper |
Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
On the Satisfiability of Modular Arithmetic Formulae
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Complete SAT-Based Model Checking for Context-Free Processes
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
SAT-BASED MODEL CHECKING FOR REGION AUTOMATA
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science | 2005-08-19 | Paper |
| scientific article; zbMATH DE number 1796132 (Why is no real title available?) | 2002-09-04 | Paper |
Deciding a class of path formulas for conflict-free Petri nets
Theory of Computing Systems | 1997-08-24 | Paper |
SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
