Rance Cleaveland

4169 A.V. Williams Building
(301) 405-2739
Ph.D., Cornell University (Computer Science)
Special Awards/Honors: 
ONR Young Investigator Award
National Science Foundation (NSF) National Young Investigator

Rance Cleaveland is a professor of computer science.

His research focuses on the area of formal methods for desciption and analysis of concurrent and distributed systems. Specifically, Cleaveland's work includes processing algebra, temporal logic, analysis algorithms for finite-state systems, automatic verification tools, semantic models of system behavior, and operational semantics.

He is the executive and scientific director of the Fraunhofer USA Center for Experimental Software Engineering.

Cleaveland received his doctorate in computer science from Cornell University. Before coming to the University of Maryland, he was a member of the computer science faculty at the State University of New York at Stony Brook.



Cleaveland R.  1993.  An operational semantics of value passing. Proceedings 2nd North American Process Algebra Workshop, Ithaca, New York.


Celikkan U, Cleaveland R.  1992.  Computing diagnostic tests for incorrect processes. Proc. IFIP WG6. 1 12th Intl. Symp. on Protocol Specification, Testing, and Verification.

Cleaveland R, Smolka S, Zwarico A.  1992.  Testing preorders for probabilistic processes. Automata, Languages and Programming.


Cleaveland R, Steffen B.  1991.  Computing behavioural relations, logically. Automata, Languages and Programming.

Cleaveland R, Zwarico AE.  1991.  A theory of testing for real-time. , Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS '91.


Cleaveland R, Hennessy M.  1990.  Testing equivalence as a bisimulation equivalence. Automatic Verification Methods for Finite State Systems.

Cleaveland R, Parrow J, Steffen B.  1990.  The concurrency workbench. Automatic Verification Methods for Finite State Systems.

Cleaveland R, Steffen B.  1990.  A preorder for partial process specifications. CONCUR'90 Theories of Concurrency: Unification and Extension.

Cleaveland R, Steffen B.  1990.  When is `partial' adequate? A logic-based proof technique using partial specifications Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e.


Cleaveland R, Parrow J, Steffen B.  1989.  A semantics based verification tool for finite state systems. Proceedings of the IFIP WG6. 1:287-302.


Cleaveland R, Panangaden P.  1988.  Type theory and concurrency. International Journal of Parallel Programming. 17(2):153-206.