activity
20072025
most citedInterpolant-Based Transition Relation Approximation

28 citations · 46 across the 8 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2023

A Case Study in Analytic Protocol Analysis in ACL2

Max von Hippel, Panagiotis Manolios, Kenneth L. McMillan +2

When verifying computer systems we sometimes want to study their asymptotic behaviors, i.e., how they behave in the long run. In such cases, we need real analysis, the area of math…

cs.LO2021

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…

cs.LO2015

Compositional Verification of Procedural Programs using Horn Clauses over Integers and Arrays

Anvesh Komuravelli, Nikolaj Bjorner, Arie Gurfinkel +1

We present a compositional SMT-based algorithm for safety of procedural C programs that takes the heap into consideration as well. Existing SMT-based approaches are either largely…

cs.LO2013★ 16 cited

Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types

Nikolaj Bjorner, Ken McMillan, Andrey Rybalchenko

We report on work in progress on automatic procedures for proving properties of programs written in higher-order functional languages. Our approach encodes higher-order programs di…

cs.LO2007★ 28 cited

Interpolant-Based Transition Relation Approximation

Ranjit Jhala, Kenneth L. McMillan

In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software mode…