175 search results - page 31 / 35 » Symbolic Model Checking for Asynchronous Boolean Programs |
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
RTA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
ACSD
2001
IEEE
13 years 11 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
FMSD
2002
13 years 7 months ago
2002
Combining verification methods developed separately for software and hardware is motivated by the industry's need for a technology that would make formal verification of reali...
LPNMR
1997
Springer
13 years 11 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...