| Verification, Model Checking, and Abstract Interpretation - 23rd International Conference, VMCAI 2022, Philadelphia, PA, USA, January 16-18, 2022, Proceedings | 0 | 0.34 | 2022 |
| Local Reasoning for Global Graph Properties. | 0 | 0.34 | 2020 |
| Go with the flow: compositional abstractions for concurrent data structures | 0 | 0.34 | 2018 |
| Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version). | 0 | 0.34 | 2017 |
| Partitioned Memory Models For Program Analysis | 4 | 0.43 | 2017 |
| Full accounting for verifiable outsourcing. | 7 | 0.40 | 2017 |
| The VACCINE Framework for Building DLP Systems. | 0 | 0.34 | 2017 |
| Classifying Bugs with Interpolants. | 5 | 0.42 | 2016 |
| Error Invariants for Concurrent Traces. | 0 | 0.34 | 2016 |
| Crowdsourcing Verifiable Contextual Integrity Norms. | 0 | 0.34 | 2016 |
| VERMEER: A Tool for Tracing and Explaining Faulty C Programs. | 0 | 0.34 | 2015 |
| Deciding Local Theory Extensions Via E-Matching | 7 | 0.43 | 2015 |
| Learning Invariants using Decision Trees. | 0 | 0.34 | 2015 |
| Conflict-Directed Graph Coverage. | 2 | 0.36 | 2015 |
| Automating Separation Logic with Trees and Data. | 26 | 0.75 | 2014 |
| GRASShopper - Complete Heap Verification with Mixed Specifications. | 17 | 0.58 | 2014 |
| Dynamic Package Interfaces | 1 | 0.36 | 2014 |
| Concolic Fault Localization | 0 | 0.34 | 2014 |
| Preface - Invariant Generation | 0 | 0.34 | 2014 |
| Flow-Sensitive Fault Localization | 9 | 0.48 | 2013 |
| Explaining inconsistent code | 4 | 0.41 | 2013 |
| Dynamic Package Interfaces - Extended Version. | 1 | 0.36 | 2013 |
| Complete instantiation-based interpolation | 8 | 0.49 | 2013 |
| Automating separation logic using SMT | 46 | 1.25 | 2013 |
| A Notion of Dynamic Interface for Depth-Bounded Object-Oriented Packages. | 1 | 0.36 | 2013 |
| Structural counter abstraction | 8 | 0.52 | 2013 |
| Deciding functional lists with sublist sets | 3 | 0.39 | 2012 |
| Error Invariants. | 0 | 0.34 | 2012 |
| Ideal abstractions for well-structured transition systems | 15 | 0.62 | 2012 |
| Static scheduling in clouds | 8 | 0.60 | 2011 |
| Scheduling large jobs by abstraction refinement | 6 | 0.55 | 2011 |
| An efficient decision procedure for imperative tree data structures | 12 | 0.58 | 2011 |
| Building a calculus of data structures | 7 | 0.56 | 2010 |
| Doomed program points | 10 | 0.61 | 2010 |
| Forward analysis of depth-bounded processes | 28 | 1.03 | 2010 |
| FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment | 19 | 1.17 | 2010 |
| A marketplace for cloud resources | 13 | 0.70 | 2010 |
| Abstraction Refinement for Quantified Array Assertions | 20 | 0.80 | 2009 |
| Combining theories with shared set operations | 21 | 0.77 | 2009 |
| It's Doomed; We Can Prove It | 16 | 0.80 | 2009 |
| Heap Assumptions on Demand | 13 | 0.85 | 2008 |
| Using first-order theorem provers in the Jahob data structure verification system | 23 | 1.00 | 2007 |
| Shape analysis for composite data structures | 114 | 3.84 | 2007 |
| Field Constraint Analysis | 26 | 1.08 | 2006 |
| On Verifying Complex Properties using Symbolic Shape Analysis | 15 | 0.67 | 2006 |
