A partial approach to model checking
From MaRDI portal
Publication:1327383
DOI10.1006/inco.1994.1035zbMath0806.68079OpenAlexW2129335898MaRDI 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
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
A technique of state space search based on unfolding ⋮ Automata Theory and Model Checking ⋮ Permutation rewriting and algorithmic verification ⋮ Using approximation for the verification of token-scaling models ⋮ LTL under reductions with weaker conditions than stutter invariance ⋮ An application of temporal projection to interleaving concurrency ⋮ On projective and separable properties ⋮ Petri nets, traces, and local model checking ⋮ Partial-order reduction in the weak modal mu-calculus ⋮ Taking Some Burden Off an Explicit CTL Model Checker ⋮ Efficiency of automata in semi-commutation verification techniques ⋮ On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties ⋮ A tableau proof system for a mazurkiewicz trace logic with fixpoints ⋮ Monadic partition logics and finite automata ⋮ Symbolic model checking: \(10^{20}\) states and beyond ⋮ A stubborn attack on state explosion ⋮ Model-checking games for fixpoint logics with partial order models ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Deciding global partial-order properties ⋮ Using partial orders for the efficient verification of deadlock freedom and safety properties ⋮ Specification Languages for Stutter-Invariant Regular Properties ⋮ REASONING ABOUT TRANSFINITE SEQUENCES ⋮ Compositional verification of asynchronous concurrent systems using CADP ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages
This page was built for publication: A partial approach to model checking
