Rance Cleaveland

Professor

5160 Iribe Center

(301) 405-2739

Academic Web Page

Education:

Ph.D., Cornell University (Computer Science)

Special Awards/Honors:

ONR Young Investigator Award

National Science Foundation (NSF) National Young Investigator

Biography:

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.

Go here to view Cleaveland‘s academic publications on Google Scholar.

Publications

1993

Cleaveland R, Steffen B. 1993. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal methods in system design. 2(2):121-147.

1992

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

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

1991

Stallmann M, Cleaveland R, Hebbar P. 1991. Gdr: A visualization tool for graph algorithms.

Cleaveland R, Steffen B. 1991. Computing behavioural relations, logically. Automata, Languages and Programming. :127-138.

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. :110-119.

1990

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. :440-449.

Cleaveland R. 1990. On automatically distinguishing inequivalent processes. Workshop on Computer-Aided Verification.

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

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

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

Cleaveland R. 1990. Tableau-based model checking in the propositional mu-calculus. Acta Informatica. 27(8):725-747.

1989

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

1988

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