#### Filter Results:

- Full text PDF available (98)

#### Publication Year

1986

2017

- This year (4)
- Last 5 years (27)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert L. Constable, Stuart F. Allen, +9 authors Scott F. Smith
- 1986

- Rance Cleaveland, Steve Sims
- CAV
- 1996

- Rance Cleaveland
- Acta Informatica
- 1990

This paper describes a procedure, based around the construction of tableau proofs, for determining whether finite-state systems enjoy properties formulated in the propositional mu-calculus. It presents a tableau-based proof system for the logic and proves it sound and complete, and it discusses techniques for the efficient construction of proofs that states… (More)

- Rance Cleaveland, Joachim Parrow, Bernhard Steffen
- ACM Trans. Program. Lang. Syst.
- 1993

The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One… (More)

- Rance Cleaveland, Bernhard Steffen
- CAV
- 1991

We develop a model-checking algorithm for a logic that permits propositions to be deened using greatest and least xed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identiied by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and… (More)

- Girish Bhat, Rance Cleaveland, Orna Grumberg
- LICS
- 1995

This paper gives an on-they algorithm for determining whether a nite-state system satisses a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing \global al-gorithm" for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast… (More)

- Rance Cleaveland, Joachim Parrow, Bernhard Steffen
- Automatic Verification Methods for Finite State…
- 1989

- Bikram Sengupta, Rance Cleaveland
- IEEE Transactions on Software Engineering
- 2002

We propose an extension to Message Sequence Charts called <i>Triggered Message Sequence Charts</i> (TMSCs) that are intended to capture system specifications involving nondeterminism in the form of <i>conditional scenarios.</i> The visual syntax of TMSCs closely resembles that of MSCs; the semantics allows us to translate a TMSC specification into a… (More)

- Rance Cleaveland, Marion Klein, Bernhard Steffen
- CAV
- 1992

- Girish Bhat, Rance Cleaveland, Alex Groce
- CAV
- 2001

This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in which system properties are given. The methodology is based on the “compilation” of temporal formulas into variants of alternating tree automata called alternating Büchi tableau automata (ABTAs). The paper gives an efficient… (More)