AbstractWe present a sound and complete tableau proof system for establishing whether a set of elements of an arbitrary transition system model has a property expressed in (a slight extension of) the modal mu-calculus. The proof system, we believe, offers a very general verification method applicable to a wide range of computational systems
In the formal verification of software systems, model-checking is one of the most studied and applie...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
AbstractWe present a sound and complete tableau proof system for establishing whether a set of eleme...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
This article revisits soundness and completeness of proof systems for proving that sets of states in...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
AbstractModel checking is an automatic technique for verifying properties of finite concurrent syste...
This thesis provides a powerful general-purpose proof technique for the verification of systems, wh...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
AbstractIt is known that pushdown processes have a decidable monadic second-order theory (Muller and...
) ? Oleg V. Sokolsky Scott A. Smolka Department of Computer Science SUNY at Stony Brook Stony Broo...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
We provide a model-checking technique for a logic for true concurrency, whose formulae predicate abo...
In the formal verification of software systems, model-checking is one of the most studied and applie...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
AbstractWe present a sound and complete tableau proof system for establishing whether a set of eleme...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
This article revisits soundness and completeness of proof systems for proving that sets of states in...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
AbstractModel checking is an automatic technique for verifying properties of finite concurrent syste...
This thesis provides a powerful general-purpose proof technique for the verification of systems, wh...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
AbstractIt is known that pushdown processes have a decidable monadic second-order theory (Muller and...
) ? Oleg V. Sokolsky Scott A. Smolka Department of Computer Science SUNY at Stony Brook Stony Broo...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
We provide a model-checking technique for a logic for true concurrency, whose formulae predicate abo...
In the formal verification of software systems, model-checking is one of the most studied and applie...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
DOI
Add to ORKG