Sciweavers

1206 search results - page 23 / 242
» Concurrent Abstract Predicates
Sort
View
113
Voted
ISSTA
1998
ACM
15 years 4 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
202
Voted
ICLP
2009
Springer
16 years 1 months ago
Constraint Based Languages for Biological Reactions
In this paper, we study the modelization of biochemical reaction by using concurrent constraint programming idioms. In particular we will consider the stochastic concurrent constra...
Marco Bottalico, Stefano Bistarelli
91
Voted
CAV
2008
Springer
110views Hardware» more  CAV 2008»
15 years 2 months ago
Probabilistic CEGAR
Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the ver...
Holger Hermanns, Björn Wachter, Lijun Zhang
CAV
2006
Springer
157views Hardware» more  CAV 2006»
15 years 4 months ago
Lazy Abstraction with Interpolants
traction with Interpolants K. L. McMillan Cadence Berkeley Labs Abstract. We describe a model checker for infinite-state sequential proased on Craig interpolation and the lazy abst...
Kenneth L. McMillan
81
Voted
SSS
2007
Springer
15 years 6 months ago
Global Predicate Detection in Distributed Systems with Small Faults
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...
Felix C. Freiling, Arshad Jhumka