Sciweavers

783 search results - page 40 / 157
» Compositional Reasoning in Model Checking
Sort
View
CADE
2007
Springer
14 years 9 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
POPL
2005
ACM
14 years 9 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
SIGSOFT
2003
ACM
14 years 9 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
ENTCS
2008
105views more  ENTCS 2008»
13 years 9 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
AUSAI
2005
Springer
14 years 2 months ago
Model Checking for PRS-Like Agents
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
Wayne Wobcke, Marc Chee, Krystian Ji