His scientific interests lie mostly in Theoretical computer science, Model checking, Concurrency, Programming language and Temporal logic. Rance Cleaveland combines subjects such as Operational semantics and Preorder with his study of Theoretical computer science. His study in Model checking is interdisciplinary in nature, drawing from both Fixed point, Finite-state machine, Calculus, Calculus and Equational system.
Rance Cleaveland carries out multidisciplinary research, doing studies in Concurrency and Workbench. His Formal methods course of study focuses on State and Software engineering. The Calculus of communicating systems study combines topics in areas such as Rotation formalisms in three dimensions, Formal equivalence checking and Communications protocol.
Rance Cleaveland mainly investigates Theoretical computer science, Programming language, Model checking, Process calculus and Concurrency. His Theoretical computer science research includes themes of Finite-state machine, Set, Probabilistic logic and Preorder. His research investigates the connection between Model checking and topics such as Temporal logic that intersect with problems in Linear temporal logic and Time complexity.
His research investigates the connection between Process calculus and topics such as Bisimulation that intersect with issues in Algebra. The concepts of his Concurrency study are interwoven with issues in Concurrent computing and Communications protocol. His work investigates the relationship between Formal specification and topics such as Formal methods that intersect with problems in Software and Runtime verification.
Rance Cleaveland mostly deals with Theoretical computer science, Model checking, Automaton, Set and Programming language. His Theoretical computer science study frequently draws connections between adjacent fields such as Data stream mining. His work carried out in the field of Model checking brings together such families of science as Process calculus and Correctness.
His Set research includes elements of Software system, Linear system, Temporal logic and Directed graph. Fiber Distributed Data Interface, Data structure and Real-time computing is closely connected to Benchmark in his research, which is encompassed under the umbrella topic of Programming language. As a member of one scientific family, Rance Cleaveland mostly works in the field of Mathematical proof, focusing on Algorithm and, on occasion, Discrete mathematics.
His primary areas of investigation include Linear system, Directed graph, Set, Opacity and Automaton. His research in Property intersects with topics in Model checking and Algorithm. While working in this field, Rance Cleaveland studies both Model checking and Power.
His work carried out in the field of Algorithm brings together such families of science as Discrete mathematics and LTI system theory. His studies link Theoretical computer science with Baseline. Rance Cleaveland combines topics linked to Extension with his work on Theoretical computer science.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
Rance Cleaveland;Joachim Parrow;Bernhard Steffen.
ACM Transactions on Programming Languages and Systems (1993)
Using formal specifications to support testing
Robert M. Hierons;Kirill Bogdanov;Jonathan P. Bowen;Rance Cleaveland.
ACM Computing Surveys (2009)
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Rance Cleaveland;Bernhard Steffen.
computer aided verification (1993)
Tableau-based model checking in the propositional mu-calculus
Rance Cleaveland.
Acta Informatica (1990)
The NCSU Concurrency Workbench
Rance Cleaveland;Steve Sims.
computer aided verification (1996)
The Concurrency Workbench
Rance Cleaveland;Joachim Parrow;Bernhard Steffen.
computer aided verification (1990)
Priority in process algebras
Rance Cleaveland;Gerald L "uttgen;V. Natarajan.
Handbook of Process Algebra (1999)
Efficient on-the-fly model checking for CTL
G. Bhat;R. Cleaveland;O. Grumberg.
logic in computer science (1995)
Priorities in process algebras
R. Cleaveland;M. Hennessy.
logic in computer science (1988)
High-confidence medical device software and systems
I. Lee;G.J. Pappas;R. Cleaveland;J. Hatcliff.
IEEE Computer (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Stony Brook University
TU Dortmund University
University of Maryland, College Park
TU Wien
University of Pennsylvania
University of Pennsylvania
University of Pennsylvania
Carnegie Mellon University
Trinity College Dublin
London South Bank University
University of Virginia
University of Zaragoza
Tohoku University
University of Tsukuba
University of Calgary
University of Strathclyde
University of Florida
Universidad de las Américas Puebla
University of North Carolina at Chapel Hill
Leiden University Medical Center
University of Liège
Harvard University
Universität Hamburg
Lancaster University
Shiga University of Medical Science
University of British Columbia