This paper describes a toolkit that assists in the task of generating abstract approximations of process algebraic specifications written in the language μCRL. Abstractions are represented by Modal Labelled Transition Systems, which are mixed transition systems with may and must modalities. The approach permits to infer the satisfaction or refutation of safety and liveness properties expressed in the (action-based) μ-calculus. The tool supports the abstraction of states and action labels, which allows to deal with infinitely branching systems
International audienceModal mu-calculus is an expressive specification formalism for temporal proper...
ion, and Verification: A Uniform Treatment of Quality and Quantity Michael Huth Department of Compu...
Abstract. Abstract interpretation-based model checking provides an approach to verifying properties ...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
AbstractThis paper describes a toolkit that assists in the task of generating abstract approximation...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It...
Abstract. We present a novel algorithm for the automatic construc-tion of modal transition systems a...
CRL is a language for specifying and verifying distributed systems in an algebraic fashion It tar...
We describe a linearization algorithm for ?CRL processes, similar to the one described in [21] for a...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Abstract. We define an action-based extension of the branching-time temporal logic CTL which allows ...
International audienceModal mu-calculus is an expressive specification formalism for temporal proper...
ion, and Verification: A Uniform Treatment of Quality and Quantity Michael Huth Department of Compu...
Abstract. Abstract interpretation-based model checking provides an approach to verifying properties ...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
AbstractThis paper describes a toolkit that assists in the task of generating abstract approximation...
This paper describes a toolkit that assists in the task of generating abstract approximations of pro...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
µCRL [13] is a language for specifying and verifying distributed systems in an algebraic fashion. It...
Abstract. We present a novel algorithm for the automatic construc-tion of modal transition systems a...
CRL is a language for specifying and verifying distributed systems in an algebraic fashion It tar...
We describe a linearization algorithm for ?CRL processes, similar to the one described in [21] for a...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Abstract. We define an action-based extension of the branching-time temporal logic CTL which allows ...
International audienceModal mu-calculus is an expressive specification formalism for temporal proper...
ion, and Verification: A Uniform Treatment of Quality and Quantity Michael Huth Department of Compu...
Abstract. Abstract interpretation-based model checking provides an approach to verifying properties ...