Partial model checking is a technique for verifying concurrent systems. It gradually reduces
the verification problem to the final answer by removing concurrent components one-by-one …

In this paper we introduce WMC, a weighted version of the alternation-free modal mu-
calculus for weighted transition systems. WMC subsumes previously studied weighted …

Early work on automated formal verification produced pioneering model-checking
algorithms, in which system computations were modelled either as sequences of …

A common approach in software engineering is to apply during the design phase a variety of
structured techniques like top-down design, decomposition and abstraction, while only …

HORNSAT, model checking, verification and games Page 1 HORNSAT, Model Checking,
Verification and Games* (Extended Abstract) Sandeep K. Shukla 1 Harry B. Hunt III 1 Daniel J …

We present the first compositional proof system for checking processes against formulas in
the modal μ-calculus which is capable of handling general infinite-state processes. The …

Paper discusses some issues related to the utility of finite games for early formal methods
teaching and for validation of automatic tools which implement formal methods. In particular …

An effective algorithm design language should be (1) wide-spectrum in, nature, ie capable of
expressing both abstract specifications and low-level implementations, and …

With the increasing complexity of digital systems, testing of digital systems is becoming
increasingly important. Perhaps, the most popular method for testing hardware is simulation …

LNCS 2890 - Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean
Framework Page 1 Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean …