ScholarLens Back to search
2009•HAL (Le Centre pour la Communication Scientifique Directe)Open access

On computing invariants for predicate abstraction by SAT-solving

David Monniaux

Open full text 0 citations

Abstract

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

About this research paper

What this paper is about

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

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Key concepts: Predicate abstraction, Modulo, Predicate (mathematical logic), Abstraction, Computer science, Programming language, Satisfiability, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On computing invariants for predicate abstraction by SAT-solving — Research Paper | ScholarLens