Export 490 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is C  [Clear All Filters]
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 
Clement T, Don A, Plaisant C, Auvil L, Pape G, Goren V.  2007.  Something that is interesting is interesting then: Using text minig and visualizations to aid interpreting repetition in Gertrude Stein’s The Making of Americans. Proceedings of the Digital Humanities Conference. :40-44.
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.
Clemens DT, Jacobs DW.  1991.  Model group indexing for recognition. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :4-9.
Clegg MT, Cummings MP, Durbin ML.  1997.  The evolution of plant nuclear genes. Proc Natl Acad Sci USA. 94(15):7791-7798.
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, Sokolsky O.  2001.  Equivalence and preorder checking for finite-state systems. Handbook of Process Algebra. :391-424.
Cleaveland R, Iyer P, Yankelevich D.  1995.  Optimality in abstractions of model checking. Static Analysis. :51-63.
Cleaveland R, Panangaden P.  1988.  Type theory and concurrency. International Journal of Parallel Programming. 17(2):153-206.
Cleaveland R.  1993.  Analyzing concurrent systems using the Concurrency Workbench. Functional Programming, Concurrency, Simulation and Automated Reasoning. :129-144.
Cleaveland R.  1990.  On automatically distinguishing inequivalent processes. Workshop on Computer-Aided Verification.
Cleaveland R, Parrow J, Steffen B.  1990.  The concurrency workbench. Automatic Verification Methods for Finite State Systems. :24-37.
Cleaveland R, Sims ST.  2002.  Generic tools for verifying concurrent systems. Science of Computer Programming. 42(1):39-47.
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, 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, Du X, Smolka S.  2000.  GCCS: A graphical coordination language for system specification. Coordination Languages and Models. :207-212.
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, L\üttgen G, Mendler M.  1997.  An algebraic theory of multiple clocks. CONCUR'97: Concurrency Theory. :166-180.
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, Steffen B.  1990.  A preorder for partial process specifications. CONCUR'90 Theories of Concurrency: Unification and Extension. :141-151.
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, 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, 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.  1996.  Semantic theories and system design. ACM Computing Surveys (CSUR). 28(4es):41-41.
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, 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.