| Compositional Model Checking for Multi-properties. | 0 | 0.34 | 2021 |
| Topology-Agnostic Runtime Detection of OSPF Routing Attacks | 0 | 0.34 | 2019 |
| An Automata-Theoretic Approach to Model-Checking Systems and Specifications Over Infinite Data Domains | 0 | 0.34 | 2019 |
| Program repair that learns from mistakes. | 0 | 0.34 | 2018 |
| Modular Verification of Concurrent Programs via Sequential Model Checking. | 0 | 0.34 | 2018 |
| Modular Demand-Driven Analysis of Semantic Difference for Program Versions. | 1 | 0.36 | 2017 |
| Formal Black-Box Analysis of Routing Protocol Implementations. | 0 | 0.34 | 2017 |
| An Automata-Theoretic Approach to Modeling Systems and Specifications over Infinite Data. | 2 | 0.38 | 2017 |
| Synergies among Testing, Verification, and Repair for Concurrent Programs (Dagstuhl Seminar 16201). | 0 | 0.34 | 2016 |
| Sound and Complete Mutation-Based Program Repair. | 4 | 0.53 | 2016 |
| Analyzing Internet Routing Security Using Model Checking. | 1 | 0.35 | 2015 |
| Learning-Based Compositional Model Checking of Behavioral UML Systems. | 1 | 0.35 | 2015 |
| Automated Circular Assume-Guarantee Reasoning | 0 | 0.34 | 2015 |
| A Game-Theoretic Approach to Simulation of Data-Parameterized Systems. | 3 | 0.38 | 2014 |
| An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications. | 3 | 0.38 | 2013 |
| Intertwined forward-backward reachability analysis using interpolants | 9 | 0.58 | 2013 |
| Finding security vulnerabilities in a network protocol using parameterized systems | 5 | 0.56 | 2013 |
| Multi-valued model checking games | 13 | 0.75 | 2012 |
| 2010 CAV award announcement | 0 | 0.34 | 2012 |
| Applying Software Model Checking Techniques for Behavioral UML Models. | 2 | 0.36 | 2012 |
| Model checking systems and specifications with parameterized atomic propositions | 7 | 0.47 | 2012 |
| Acquiring word-meaning mappings for natural language interfaces | 14 | 1.44 | 2011 |
| Learning to order BDD variables in verification | 17 | 0.88 | 2011 |
| 2009 CAV award announcement | 0 | 0.34 | 2010 |
| Variable automata over infinite alphabets | 43 | 1.21 | 2010 |
| Hybrid BDD and All-SAT Method for Model Checking | 3 | 0.41 | 2009 |
| A Faithful Semantics for Generalised Symbolic Trajectory Evaluation | 0 | 0.34 | 2009 |
| Interpolation-sequence based model checking | 21 | 1.03 | 2009 |
| 3-Valued Abstraction for (Bounded) Model Checking | 1 | 0.38 | 2009 |
| Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday | 14 | 1.31 | 2009 |
| Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification | 0 | 0.34 | 2009 |
| Antichains for the Automata-Based Approach to Model-Checking | 27 | 1.32 | 2009 |
| Efficient automatic STE refinement using responsibility | 5 | 0.53 | 2008 |
| 3-Valued abstraction: More precision at less cost | 21 | 0.76 | 2008 |
| 25 Years of Model Checking: History, Achievements, Perspectives | 33 | 1.26 | 2008 |
| Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings | 52 | 4.48 | 2007 |
| 3-valued circuit SAT for STE with automatic refinement | 7 | 0.46 | 2007 |
| VeriTech: a framework for translating among model description notations | 3 | 0.45 | 2007 |
| A game-based framework for CTL counterexamples and 3-valued abstraction-refinement | 32 | 1.17 | 2007 |
| A new approach to bounded model checking for branching time logics | 4 | 0.53 | 2007 |
| When not losing is better than winning: Abstraction and refinement for the full mu-calculus | 1 | 0.35 | 2007 |
| Automatic refinement and vacuity detection for symbolic trajectory evaluation | 8 | 0.55 | 2006 |
| A work-efficient distributed algorithm for reachability analysis | 28 | 1.11 | 2006 |
| Achieving speedups in distributed symbolic reachability analysis through asynchronous computation | 18 | 0.76 | 2005 |
| Verifying very large industrial circuits using 100 processes and beyond | 0 | 0.34 | 2005 |
| State/Event software verification for branching-time specifications | 15 | 0.73 | 2005 |
| Bounded model checking of concurrent programs | 59 | 2.43 | 2005 |
| Proof-guided underapproximation-widening for multi-process systems | 35 | 1.55 | 2005 |
| Abstraction and refinement in model checking | 3 | 0.46 | 2005 |
| Combining symmetry reduction and under-approximation for symbolic model checking | 15 | 0.80 | 2005 |
