I4: incremental inference of inductive invariants for verification of distributed protocols
Designing and implementing distributed systems correctly is a very challenging task.
Recently, formal verification has been successfully used to prove the correctness of …
Recently, formal verification has been successfully used to prove the correctness of …
From invariant checking to invariant inference using randomized search
We describe a general framework c2i for generating an invariant inference procedure from
an invariant checking procedure. Given a checker and a language of possible invariants, c2i …
an invariant checking procedure. Given a checker and a language of possible invariants, c2i …
Property-directed inference of universal invariants or proving their absence
We present Universal Property Directed Reachability (PDR∀), a property-directed semi-
algorithm for automatic inference of invariants in a universal fragment of first-order logic …
algorithm for automatic inference of invariants in a universal fragment of first-order logic …
Infinite-state invariant checking with IC3 and predicate abstraction
We address the problem of verifying invariant properties on infinite-state systems. We
present a novel approach, IC3ia, for generalizing the IC3 invariant checking algorithm from …
present a novel approach, IC3ia, for generalizing the IC3 invariant checking algorithm from …
Summary-based context-sensitive data-dependence analysis in presence of callbacks
Building a summary for library code is a common approach to speeding up the analysis of
client code. In presence of callbacks, some reachability relationships between library nodes …
client code. In presence of callbacks, some reachability relationships between library nodes …
Automatically learning shape specifications
H Zhu, G Petri, S Jagannathan - Proceedings of the 37th ACM SIGPLAN …, 2016 - dl.acm.org
This paper presents a novel automated procedure for discovering expressive shape
specifications for sophisticated functional data structures. Our approach extracts potential …
specifications for sophisticated functional data structures. Our approach extracts potential …
A fully verified container library
N Polikarpova, J Tschannen, CA Furia - International Symposium on …, 2015 - Springer
The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …
libraries pose challenges to formal verification that go beyond those of individual benchmark …
A fully verified container library
N Polikarpova, J Tschannen, CA Furia - Formal Aspects of Computing, 2018 - Springer
The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …
libraries pose challenges to formal verification that go beyond those of individual benchmark …
Learning shape analysis
We present a data-driven verification framework to automatically prove memory safety of
heap-manipulating programs. Our core contribution is a novel statistical machine learning …
heap-manipulating programs. Our core contribution is a novel statistical machine learning …
[PDF][PDF] Bounded quantifier instantiation for checking inductive invariants
We consider the problem of checking whether a proposed invariant ϕ expressed in first-
order logic with quantifier alternation is inductive, ie preserved by a piece of code. While the …
order logic with quantifier alternation is inductive, ie preserved by a piece of code. While the …