A partial approach to model checking

DOI10.1006/inco.1994.1035zbMath0806.68079MaRDI QIDQ1327383

Pierre Wolper, Patrice Godefroid

Publication date: 19 June 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/153f45a71e4c09a5484e41174f7c346016803be0

zbMATH Keywords

linear-time temporal logic; Mazurkiewicz's trace; model-checking method

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Model-checking games for fixpoint logics with partial order models, Monadic partition logics and finite automata, A stubborn attack on state explosion, Permutation rewriting and algorithmic verification, Symbolic model checking: \(10^{20}\) states and beyond, A technique of state space search based on unfolding, On projective and separable properties, Petri nets, traces, and local model checking, Deciding global partial-order properties, Using partial orders for the efficient verification of deadlock freedom and safety properties, On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties, Compositional verification of asynchronous concurrent systems using CADP, Partial Order Reduction for Rewriting Semantics of Programming Languages, REASONING ABOUT TRANSFINITE SEQUENCES, Efficiency of automata in semi-commutation verification techniques, An Automata-Theoretic Approach to Infinite-State Systems, Specification Languages for Stutter-Invariant Regular Properties