783 search results - page 25 / 157 » Compositional Reasoning in Model Checking |
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We consider the verification of parameterized Boolean proabstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such prog...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
DLOG
2010
13 years 5 months ago
2010
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
ECAI
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
FMSD
2006
13 years 7 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...