Sciweavers

Share
493 search results - page 1 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
LPNMR
2001
Springer
12 years 6 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
CAV
2004
Springer
128views Hardware» more  CAV 2004»
12 years 7 months ago
Proving More Properties with Bounded Model Checking
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsiļ¬cation of properties that were not invariants. In this paper we propose a term...
Mohammad Awedh, Fabio Somenzi
CADE
2007
Springer
13 years 2 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
CORR
2006
Springer
124views Education» more  CORR 2006»
12 years 1 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...
FMCAD
2004
Springer
12 years 7 months ago
Simple Bounded LTL Model Checking
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A...
books