Sciweavers

219 search results - page 27 / 44
» Context-Enhanced Directed Model Checking
Sort
View
PE
2011
Springer
214views Optimization» more  PE 2011»
13 years 2 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
ESORICS
2002
Springer
14 years 7 months ago
Formal Security Analysis with Interacting State Machines
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
David von Oheimb, Volkmar Lotz
CAV
2008
Springer
113views Hardware» more  CAV 2008»
13 years 9 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
FMSB
2008
199views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...
ICFP
2004
ACM
14 years 7 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester