| SL-COMP: Competition of Solvers for Separation Logic | 0 | 0.34 | 2019 |
| Fast BGP Simulation of Large Datacenters. | 1 | 0.39 | 2019 |
| CrystalNet: Faithfully Emulating Large Production Networks. | 19 | 0.77 | 2017 |
| Preface: Special Issue on Interpolation. | 0 | 0.34 | 2016 |
| Cardinalities and universal quantifiers for verifying parameterized systems. | 7 | 0.51 | 2016 |
| Efficient Ctl Verification Via Horn Constraints Solving | 0 | 0.34 | 2016 |
| Horn Clause Solvers for Program Verification. | 23 | 0.72 | 2015 |
| Recursive Games for Compositional Program Synthesis. | 1 | 0.35 | 2015 |
| Symbolic Polytopes For Quantitative Interpolation And Verification | 4 | 0.38 | 2015 |
| (Quantified) Horn Constraint Solving for Program Verification and Synthesis | 0 | 0.34 | 2014 |
| A constraint-based approach to solving games on infinite graphs | 28 | 0.89 | 2014 |
| Reduction for compositional verification of multi-threaded programs | 4 | 0.40 | 2014 |
| From tests to proofs. | 25 | 1.17 | 2013 |
| Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types. | 4 | 0.42 | 2013 |
| On Solving Universally Quantified Horn Clauses. | 47 | 1.16 | 2013 |
| Separation Logic Modulo Theories | 3 | 0.39 | 2013 |
| Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141). | 1 | 0.34 | 2013 |
| Solving existentially quantified horn clauses | 40 | 1.10 | 2013 |
| Threader: A Verifier for Multi-threaded Programs - (Competition Contribution). | 6 | 0.48 | 2013 |
| Automation of Quantitative Information-Flow Analysis. | 2 | 0.37 | 2013 |
| Generalised Interpolation By Solving Recursion-Free Horn Clauses | 3 | 0.38 | 2013 |
| An epistemic perspective on consistency of concurrent computations | 4 | 0.44 | 2013 |
| Binary reachability analysis of higher order functional programs | 5 | 0.44 | 2012 |
| HSF(C): A Software Verifier Based on Horn Clauses - (Competition Contribution). | 13 | 0.57 | 2012 |
| Synthesizing software verifiers from proof rules | 105 | 2.93 | 2012 |
| Program Verification as Satisfiability Modulo Theories. | 26 | 0.79 | 2012 |
| Compositional termination proofs for multi-threaded programs | 19 | 0.82 | 2012 |
| Transition invariants and transition predicate abstraction for program termination | 6 | 0.46 | 2011 |
| Threader: a constraint-based verifier for multi-threaded programs | 24 | 0.98 | 2011 |
| Distributed and predictable software model checking | 7 | 0.46 | 2011 |
| HMC: verifying functional programs using abstract interpreters | 27 | 1.01 | 2011 |
| Solving recursion-free horn clauses over LI+UIF | 27 | 1.28 | 2011 |
| Proving program termination | 50 | 4.65 | 2011 |
| Towards automatic synthesis of software verification tools | 0 | 0.34 | 2011 |
| Separation logic + superposition calculus = heap theorem prover | 25 | 0.83 | 2011 |
| Approximation and Randomization for Quantitative Information-Flow Analysis | 41 | 1.35 | 2010 |
| Thread-modular counterexample-guided abstraction refinement | 8 | 0.49 | 2010 |
| Aligators For Arrays (Tool Paper) | 2 | 0.42 | 2010 |
| Constraint solving for interpolation | 56 | 2.11 | 2010 |
| Refinement type inference via abstract interpretation | 3 | 0.46 | 2010 |
| Applying prolog to develop distributed systems | 3 | 0.45 | 2010 |
| Non-monotonic refinement of control abstraction for concurrent programs | 1 | 0.42 | 2010 |
| Constraint solving for program verification: theory and practice by example | 4 | 0.43 | 2010 |
| Finding heap-bounds for hardware synthesis | 16 | 0.73 | 2009 |
| Subsumer-First: Steering Symbolic Reachability Analysis | 1 | 0.38 | 2009 |
| Cardinality Abstraction for Declarative Networking Applications | 7 | 0.51 | 2009 |
| Operational Semantics for Declarative Networking | 19 | 0.84 | 2009 |
| Summarization for termination: no return! | 14 | 0.91 | 2009 |
| InvGen: An Efficient Invariant Generator | 46 | 1.40 | 2009 |
| Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings | 16 | 1.12 | 2009 |
