Publications

Export 7148 results:
[ Author(Desc)] 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, 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, 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, Parrow J, Steffen B.  1989.  A semantics based verification tool for finite state systems. Proceedings of the IFIP WG6. 1:287-302.
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.
Cleaveland R, Smolka S, Sims S.  2008.  An instrumentation-based approach to controller model validation. Model-Driven Development of Reliable Automotive Services. :84-97.
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, Sokolsky O.  2001.  Equivalence and preorder checking for finite-state systems. Handbook of Process Algebra. :391-424.
Cleaveland R, L\üttgen G, Natarajan V, Sims S.  1996.  Priorities for modeling and verifying distributed systems. Tools and Algorithms for the Construction and Analysis of Systems. :278-297.
Cleaveland R, Hennessy M.  1990.  Testing equivalence as a bisimulation equivalence. Automatic Verification Methods for Finite State Systems. :11-23.
Cleaveland R, Iyer PS, Narasimha M.  2005.  Probabilistic temporal logics via the modal mu-calculus. Theoretical Computer Science. 342(2-3):316-350.
Cleaveland R, Du X, Smolka S.  2000.  GCCS: A graphical coordination language for system specification. Coordination Languages and Models. :207-212.
Cleaveland R, Steffen B.  1991.  Computing behavioural relations, logically. Automata, Languages and Programming. :127-138.
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.
Clegg MT, Cummings MP, Durbin ML.  1997.  The evolution of plant nuclear genes. Proc Natl Acad Sci USA. 94(15):7791-7798.
Clemens DT, Jacobs DW.  1991.  Space and time bounds on indexing 3D models from 2D images. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 13(10):1007-1017.

Pages