| Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis. | 0 | 0.34 | 2021 |
| SL-COMP: Competition of Solvers for Separation Logic | 0 | 0.34 | 2019 |
| Variant Region Types | 0 | 0.34 | 2018 |
| Automated Modular Verification for Relaxed Communication Protocols. | 0 | 0.34 | 2018 |
| Verification of C Buffer Overflows in C Programs | 1 | 0.36 | 2018 |
| HipTNT+: A Termination and Non-termination Analyzer by Second-Order Abduction - (Competition Contribution). | 0 | 0.34 | 2017 |
| Threads as Resource for Concurrency Verification | 2 | 0.36 | 2015 |
| Expressive program verification via structured specifications | 2 | 0.37 | 2014 |
| A Resource-Based Logic for Termination and Non-termination Proofs. | 5 | 0.40 | 2014 |
| Automatically refining partial specifications for heap-manipulating programs | 6 | 0.44 | 2014 |
| Shape Analysis via Second-Order Bi-Abduction. | 13 | 0.53 | 2014 |
| A Proof Slicing Framework for Program Verification. | 0 | 0.34 | 2013 |
| Automated Specification Discovery via User-Defined Predicates. | 3 | 0.39 | 2013 |
| Verification of Static and Dynamic Barrier Synchronization Using Bounded Permissions. | 6 | 0.47 | 2013 |
| Dual analysis for proving safety and finding bugs | 7 | 0.45 | 2013 |
| Specification, Verification and Inference (Invited Talk). | 0 | 0.34 | 2013 |
| Invariants synthesis over a combined domain for automated program verification | 2 | 0.38 | 2013 |
| Towards Complete Specifications with an Error Calculus. | 4 | 0.41 | 2013 |
| Bi-Abduction with Pure Properties for Specification Inference. | 6 | 0.43 | 2013 |
| An Expressive Framework for Verifying Deadlock Freedom. | 2 | 0.38 | 2013 |
| Loop invariant synthesis in a combined abstract domain | 8 | 0.49 | 2013 |
| Structured Specification for Program Verification | 0 | 0.34 | 2012 |
| Automated verification of shape, size and bag properties via user-defined predicates in separation logic | 62 | 1.51 | 2012 |
| From Verification to Specification Inference | 0 | 0.34 | 2012 |
| Variable permissions for concurrency verification | 2 | 0.36 | 2012 |
| Structured specifications for better verification of heap-manipulating programs | 10 | 0.66 | 2011 |
| Immutable specifications for more concise and precise verification | 4 | 0.45 | 2011 |
| FIXBAG: a fixpoint calculator for quantified bag constraints | 8 | 0.46 | 2011 |
| A specialization calculus for pruning disjunctive predicates to support verification | 5 | 0.43 | 2011 |
| Automatically refining partial specifications for program verification | 7 | 0.55 | 2011 |
| A HIP and SLEEK verification system | 6 | 0.45 | 2011 |
| Discovering Specifications for Unknown Procedures - Work in Progress. | 0 | 0.34 | 2010 |
| Stack Bound Inference for Abstract Java Bytecode | 2 | 0.36 | 2010 |
| Verifying heap-manipulating programs with unknown procedure calls | 0 | 0.34 | 2010 |
| Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion | 2 | 0.41 | 2010 |
| Loop invariant synthesis in a combined domain | 7 | 0.44 | 2010 |
| Verifying pointer safety for programs with unknown calls | 5 | 0.50 | 2010 |
| Completeness of Pointer Program Verification by Separation Logic | 3 | 0.39 | 2009 |
| A rigorous methodology for specification and verification of business processes | 3 | 0.39 | 2009 |
| Memory Usage Verification Using Hip/Sleek | 6 | 0.45 | 2009 |
| Optimizing the parallel computation of linear recurrences using compact matrix representations | 2 | 0.42 | 2009 |
| TASE 2009, Third IEEE International Symposium on Theoretical Aspects of Software Engineering, 29-31 July 2009, Tianjin, China | 57 | 5.17 | 2009 |
| An Interval-Based Inference of Variant Parametric Types | 5 | 0.43 | 2009 |
| Translation and optimization for a core calculus with exceptions | 2 | 0.43 | 2009 |
| A Formal Soundness Proof of Region-Based Memory Management for Object-Oriented Paradigm | 1 | 0.36 | 2008 |
| A practical and precise inference and specializer for array bound checks elimination | 7 | 0.50 | 2008 |
| Enhancing Program Verification with Lemmas | 34 | 1.20 | 2008 |
| A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets | 4 | 0.43 | 2008 |
| A Flow-Sensitive Region Inference for CLI | 3 | 0.40 | 2008 |
| Analysing memory resource bounds for low-level programs | 31 | 1.44 | 2008 |
