33 citations · 102 across the 16 of their papers we have counts for
7 papers · 1 filter
Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems
Oded Padon, Jochen Hoenicke, Kenneth L. McMillan +3
Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imp…
Summing Up Smart Transitions
Neta Elad, Sophie Rain, Neil Immerman +2
Some of the most significant high-level properties of currencies are the sums of certain account balances. Properties of such sums can ensure the integrity of currencies and transa…
Bounded Quantifier Instantiation for Checking Inductive Invariants
Yotam M. Y. Feldman, Oded Padon, Neil Immerman +2
We consider the problem of checking whether a proposed invariant expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code. Whi…
On the automated verification of web applications with embedded SQL
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky +4
A large number of web applications is based on a relational database together with a program, typically a script, that enables the user to interact with the database through embedd…
Simulating reachability using first-order logic with applications to verification of linked data structures
Tal Lev-Ami, Neil Immerman, Thomas Reps +3
This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocat…
A Logic of Reachable Patterns in Linked Data-Structures
Greta Yorsh, Alexander Rabinovich, Mooly Sagiv +2
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The m…