On computing invariants for predicate abstraction by SAT-solving

Preprints, Working Papers, ... Year : 2009

(1)

David Monniaux

VERIMAG

We propose a method for computing invariants in disjunctive predicate abstraction domains using satisfiability modulo theory (SMT) testing.

Programming Languages [cs.PL] Logic in Computer Science [cs.LO]

Fichier principal

predicate_fixpoint.pdf (84.32 Ko)

Origin : Files produced by the author(s)

https://hal.science/hal-00357118

Submitted on : Thursday, January 29, 2009-3:29:55 PM

Last modification on : Thursday, April 4, 2024-6:26:32 PM

Long-term archiving on: Tuesday, June 8, 2010-7:46:32 PM

hal-00357118 , version 1 (29-01-2009)

David Monniaux. On computing invariants for predicate abstraction by SAT-solving. 2009. ⟨hal-00357118⟩

UGA IMAG CNRS VERIMAG ANR

94 View

56 Download