scientific article
From MaRDI portal
Publication:2763999
zbMath0977.68671MaRDI QIDQ2763999
Cormac Flanagan, K. Rustan M. Leino
Publication date: 22 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2021/20210500
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Abstract data types; algebraic specification (68Q65)
Related Items
Verifying Array Manipulating Programs with Full-Program Induction ⋮ Automatic Inference of Access Permissions ⋮ Guiding Craig interpolation with domain-specific abstractions ⋮ Predicate Abstraction for Program Verification ⋮ An integrated approach to high integrity software verification ⋮ Modular inference of subprogram contracts for safety checking ⋮ SMT-based verification of program changes through summary repair ⋮ Invariant inference with provable complexity from the monotone theory ⋮ SAT-based invariant inference and its relation to concept learning ⋮ RHLE: modular deductive verification of relational \(\forall \exists\) properties ⋮ Automated verification of functional correctness of race-free GPU programs ⋮ A learning-based approach to synthesizing invariants for incomplete verification engines ⋮ Learning inductive invariants by sampling from frequency distributions ⋮ Unbounded procedure summaries from bounded environments ⋮ Verifying relative safety, accuracy, and termination for program approximations ⋮ From invariant checking to invariant inference using randomized search ⋮ Loop summarization using state and transition invariants ⋮ Inferring Loop Invariants Using Postconditions ⋮ Complexity and Algorithms for Monomial and Clausal Predicate Abstraction ⋮ ExplainHoudini: Making Houdini Inference Transparent ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ Programming by predicates: a formal model for interactive synthesis ⋮ Houdini
Uses Software
