Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
Cleaveland R.  1990.  On automatically distinguishing inequivalent processes. Workshop on Computer-Aided Verification.
Cleaveland R, Iyer P, Yankelevich D.  1995.  Optimality in abstractions of model checking. Static Analysis. :51-63.
Cleaveland R, Hennessy M.  1990.  Priorities in process algebras. Information and Computation. 87(1-2):58-77.
Cleaveland R, Yankelevich D.  1994.  An operational framework for value-passing processes. Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. :326-338.
Cleaveland R, Lüttgen G, Natarajan V.  2007.  Priority and abstraction in process algebra. Information and Computation. 205(9):1426-1458.
Cleaveland R, Parrow J, Steffen B.  1990.  The concurrency workbench. Automatic Verification Methods for Finite State Systems. :24-37.
Cleaveland R, L\üttgen G, Natarajan V.  1996.  A process algebra with distributed priorities. CONCUR'96: Concurrency Theory. :34-49.
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.
Cleaveland R, Sims ST.  2002.  Generic tools for verifying concurrent systems. Science of Computer Programming. 42(1):39-47.
Cleaveland R, Smolka S, Zwarico A.  1992.  Testing preorders for probabilistic processes. Automata, Languages and Programming. :708-719.
Cleaveland R, L\üttgen G.  2000.  A semantic theory for heterogeneous system design. FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. :312-324.
Cleaveland R, Natarajan V, Sims S, Luettgen G.  1996.  Modeling and verifying distributed systems using priorities: A case study. Software - Concepts and Tools. 17(2):50-62.
Cleaveland R.  1996.  Semantic theories and system design. ACM Computing Surveys (CSUR). 28(4es):41-41.
Cleaveland R, Sims S.  1996.  The NCSU concurrency workbench. Computer Aided Verification. :394-397.
Cleaveland R, L\üttgen G, Mendler M.  1997.  An algebraic theory of multiple clocks. CONCUR'97: Concurrency Theory. :166-180.
Cleaveland R, Lewis P, Smolka S, Sokolsky O.  1996.  The Concurrency Factory: A development environment for concurrent systems. Computer Aided Verification. :398-401.
Cleaveland R, Parrow J, Steffen B.  1993.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems. 15:36-72.
Cleaveland R.  1993.  An operational semantics of value passing. Proceedings 2nd North American Process Algebra Workshop, Ithaca, New York.
Cleaveland R, Panangaden P.  1988.  Type theory and concurrency. International Journal of Parallel Programming. 17(2):153-206.
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.
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, Madelaine E, Sims S.  1995.  A front-end generator for verification tools. Tools and Algorithms for the Construction and Analysis of Systems. :153-173.
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.
Cleaveland R.  1993.  Analyzing concurrent systems using the Concurrency Workbench. Functional Programming, Concurrency, Simulation and Automated Reasoning. :129-144.

Pages