The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
C. A. R. Hoare: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. C. A. R. Hoare
    An Axiomatic Basis for Computer Programming. [Citation Graph (14, 0)][DBLP]
    Commun. ACM, 1969, v:12, n:10, pp:576-580 [Journal]
  2. C. A. R. Hoare
    Monitors: An Operating System Structuring Concept. [Citation Graph (13, 0)][DBLP]
    Commun. ACM, 1974, v:17, n:10, pp:549-557 [Journal]
  3. C. A. R. Hoare
    Communicating Sequential Processes. [Citation Graph (11, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:8, pp:666-677 [Journal]
  4. C. A. R. Hoare
    Proof of Correctness of Data Representations [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:271-281 [Journal]
  5. C. A. R. Hoare, Niklaus Wirth
    An Axiomatic Definition of the Programming Language PASCAL [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:335-355 [Journal]
  6. C. A. R. Hoare
    Quicksort. [Citation Graph (5, 0)][DBLP]
    Comput. J., 1962, v:5, n:1, pp:10-15 [Journal]
  7. C. A. R. Hoare, Peter E. Lauer
    Consistent and Complementary Formal Theories of the Semantics of Programming Languages [Citation Graph (3, 0)][DBLP]
    Acta Inf., 1974, v:3, n:, pp:135-153 [Journal]
  8. C. A. R. Hoare
    An Axiomatic Basis for Computer Programming (Reprint). [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:1, pp:53-56 [Journal]
  9. C. A. R. Hoare
    An Overview of Some Formal Methods for Program Design. [Citation Graph (1, 0)][DBLP]
    IEEE Computer, 1987, v:20, n:9, pp:85-91 [Journal]
  10. Stephen D. Brookes, C. A. R. Hoare, A. W. Roscoe
    A Theory of Communicating Sequential Processes. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:560-599 [Journal]
  11. Jifeng He, C. A. R. Hoare
    Unifying theories of programming. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:97-99 [Conf]
  12. C. A. R. Hoare
    Parallel programming: an axiomatic approach. [Citation Graph (0, 0)][DBLP]
    Language Hierarchies and Interfaces, 1975, pp:11-42 [Conf]
  13. C. A. R. Hoare
    Proof of correctness of data representation. [Citation Graph (0, 0)][DBLP]
    Language Hierarchies and Interfaces, 1975, pp:183-193 [Conf]
  14. C. A. R. Hoare
    The structure of an operating system. [Citation Graph (0, 0)][DBLP]
    Language Hierarchies and Interfaces, 1975, pp:242-265 [Conf]
  15. C. A. R. Hoare
    Workshop on Analysis of Concurrent Systems Attempt at problem 3: The Firing Squad. [Citation Graph (0, 0)][DBLP]
    The Analysis of Concurrent Systems, 1983, pp:115-116 [Conf]
  16. C. A. R. Hoare
    Workshop on Analysis of Concurrent Systems Attempt at Problem 10: The Matrix Switch. [Citation Graph (0, 0)][DBLP]
    The Analysis of Concurrent Systems, 1983, pp:132-133 [Conf]
  17. Carroll Morgan, C. A. R. Hoare
    Specification of a simplified Network Service in CSP. [Citation Graph (0, 0)][DBLP]
    The Analysis of Concurrent Systems, 1983, pp:345-353 [Conf]
  18. Jifeng He, C. A. R. Hoare
    Unifying theories of healthiness condition. [Citation Graph (0, 0)][DBLP]
    APSEC, 2000, pp:70-0 [Conf]
  19. Michael J. Butler, C. A. R. Hoare, Carla Ferreira
    A Trace Semantics for Long-Running Transactions. [Citation Graph (0, 0)][DBLP]
    25 Years Communicating Sequential Processes, 2004, pp:133-150 [Conf]
  20. C. A. R. Hoare
    Towards the Verifying Compiler. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Ole-Johan Dahl, 2004, pp:124-136 [Conf]
  21. C. A. R. Hoare
    Process Algebra: A Unifying Approach. [Citation Graph (0, 0)][DBLP]
    25 Years Communicating Sequential Processes, 2004, pp:36-60 [Conf]
  22. C. A. R. Hoare
    Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle. [Citation Graph (0, 0)][DBLP]
    Correct System Design, 1999, pp:3-28 [Conf]
  23. Cédric Fournet, C. A. R. Hoare, Sriram K. Rajamani, Jakob Rehof
    Stuck-Free Conformance. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:242-254 [Conf]
  24. C. A. R. Hoare
    The Verifying Compiler: A Grand Challenge for Computing Research. [Citation Graph (0, 0)][DBLP]
    CC, 2003, pp:262-272 [Conf]
  25. C. A. R. Hoare
    Unification of Theories: A Challenge for Computing Science. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1995, pp:49-57 [Conf]
  26. C. A. R. Hoare
    Assertions in Modern Software Engineering Practice. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2002, pp:459-462 [Conf]
  27. Roberto Bruni, Michael J. Butler, Carla Ferreira, C. A. R. Hoare, Hernán C. Melgratti, Ugo Montanari
    Comparing Two Approaches to Compensable Flow Composition. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:383-397 [Conf]
  28. C. A. R. Hoare
    Let's Make Models (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:32- [Conf]
  29. C. A. R. Hoare, Jifeng He
    A Trace Model for Pointers and Objects. [Citation Graph (0, 0)][DBLP]
    ECOOP, 1999, pp:1-17 [Conf]
  30. C. A. R. Hoare
    The Verifying Compiler: A Grand Challenge for Computing Research. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2003, pp:1-12 [Conf]
  31. C. A. R. Hoare
    An axiomatic definition of the programming language PASCAL. [Citation Graph (0, 0)][DBLP]
    International Sympoisum on Theoretical Programming, 1972, pp:1-16 [Conf]
  32. Jifeng He, C. A. R. Hoare, Jeff W. Sanders
    Data Refinement Refined. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:187-196 [Conf]
  33. C. A. R. Hoare
    The Verifying Compiler: A Grand Challenge for Computing Research. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:1- [Conf]
  34. C. A. R. Hoare, Jifeng He
    Unifying Theories for Parallel Programming. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:15-30 [Conf]
  35. C. A. R. Hoare
    Programs are Predicates. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:211-218 [Conf]
  36. C. A. R. Hoare, A. W. Roscoe
    Programs as Executable Predicates. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:220-228 [Conf]
  37. C. A. R. Hoare
    How Did Software Get So Reliable Without Proof? [Citation Graph (0, 0)][DBLP]
    FME, 1996, pp:1-17 [Conf]
  38. C. A. R. Hoare
    Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:1-27 [Conf]
  39. C. A. R. Hoare
    The Mathematics of Programming. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:1-18 [Conf]
  40. Jifeng He, C. A. R. Hoare, Martin Fränzle, Markus Müller-Olm, Ernst-Rüdiger Olderog, Michael Schenke, Michael R. Hansen, Anders P. Ravn, Hans Rischel
    Provably Correct Systems. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1994, pp:288-335 [Conf]
  41. Richard Kennaway, C. A. R. Hoare
    A Theory of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:338-350 [Conf]
  42. Ernst-Rüdiger Olderog, C. A. R. Hoare
    Specification-Oriented Semantics for Communicating Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:561-572 [Conf]
  43. Z. C. Chen, C. A. R. Hoare
    Partial Correctness of Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1981, pp:1-12 [Conf]
  44. C. A. R. Hoare
    Legacy Code. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2000, pp:75- [Conf]
  45. Silvija Seres, J. Michael Spivey, C. A. R. Hoare
    Algebra of Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:184-199 [Conf]
  46. C. A. R. Hoare
    Software Engineering: A Keynote Address. [Citation Graph (0, 0)][DBLP]
    ICSE, 1978, pp:1-4 [Conf]
  47. C. A. R. Hoare
    The Role of Formal Techniques: Past, Current and Future or How Did Software Get so Reliable without Proof? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICSE, 1996, pp:233-234 [Conf]
  48. Jifeng He, C. A. R. Hoare
    Linking Theories of Concurrency. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2005, pp:303-317 [Conf]
  49. C. A. R. Hoare
    Data structures in two-level store. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1968, pp:322-329 [Conf]
  50. C. A. R. Hoare
    Assertions. [Citation Graph (0, 0)][DBLP]
    IFM, 2000, pp:1-2 [Conf]
  51. C. A. R. Hoare
    The Verifying Compiler: A Grand Challange for Computing Research. [Citation Graph (0, 0)][DBLP]
    JMLC, 2003, pp:25-35 [Conf]
  52. C. A. R. Hoare, Michael J. C. Gordon
    Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:28-36 [Conf]
  53. Nissim Francez, C. A. R. Hoare, Willem P. de Roever
    Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:191-200 [Conf]
  54. Jifeng He, C. A. R. Hoare
    Categorical Semantics for Programming Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1989, pp:402-417 [Conf]
  55. C. A. R. Hoare
    Mathematical models for computing science. [Citation Graph (0, 0)][DBLP]
    NATO ASI DPD, 1996, pp:115-164 [Conf]
  56. C. A. R. Hoare
    A Theory of Conjunction and Concurrency. [Citation Graph (0, 0)][DBLP]
    PARBASE / Architectures, 1990, pp:18-30 [Conf]
  57. Jim Welsh, W. J. Sneeringer, C. A. R. Hoare
    Ambiguities and Insecurities in Pascal. [Citation Graph (0, 0)][DBLP]
    Pascal - The Language and its Implementation, 1981, pp:5-19 [Conf]
  58. Simon L. Peyton Jones, Alastair Reid, Fergus Henderson, C. A. R. Hoare, Simon Marlow
    A Semantics for Imprecise Exceptions. [Citation Graph (0, 0)][DBLP]
    PLDI, 1999, pp:25-36 [Conf]
  59. C. A. R. Hoare, Innes Page
    Hardware and Software: The Closing Gap. [Citation Graph (0, 0)][DBLP]
    Programming Languages and System Architectures, 1994, pp:49-68 [Conf]
  60. K. T. Sridhar, C. A. R. Hoare
    JSD Expressed in CSP. [Citation Graph (0, 0)][DBLP]
    Data Types and Persistence (Appin), Informal Proceedings, 1985, pp:49-82 [Conf]
  61. C. A. R. Hoare
    Algebra and Models. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 1993, pp:1-8 [Conf]
  62. C. A. R. Hoare
    Assertions in Programming: From Scientific Theory to Engineering Practice. [Citation Graph (0, 0)][DBLP]
    Soft-Ware, 2002, pp:350-351 [Conf]
  63. C. A. R. Hoare
    The Varieties of Programming Language. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:1-18 [Conf]
  64. C. A. R. Hoare
    Towards the Verifying Compiler. [Citation Graph (0, 0)][DBLP]
    10th Anniversary Colloquium of UNU/IIST, 2002, pp:151-160 [Conf]
  65. Jifeng He, C. A. R. Hoare
    CSP Is a Retract of CCS. [Citation Graph (0, 0)][DBLP]
    UTP, 2006, pp:38-62 [Conf]
  66. C. A. R. Hoare
    The Verifying Compiler, a Grand Challenge for Computing Research. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:78-78 [Conf]
  67. C. A. R. Hoare
    Growing Use of Assertions. [Citation Graph (0, 0)][DBLP]
    TOOLS (38), 2001, pp:3- [Conf]
  68. Maurice Clint, C. A. R. Hoare
    Program Proving: Jumps and Functions [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:214-224 [Journal]
  69. C. A. R. Hoare, Jifeng He, Augusto Sampaio
    Normal Form Approach to Compiler Design. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:8, pp:701-739 [Journal]
  70. Ernst-Rüdiger Olderog, C. A. R. Hoare
    Specification-Oriented Semantics for Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:1, pp:9-66 [Journal]
  71. C. A. R. Hoare
    Assertions: A Personal Perspective. [Citation Graph (0, 0)][DBLP]
    IEEE Annals of the History of Computing, 2003, v:25, n:2, pp:14-25 [Journal]
  72. Robert S. Boyer, W. H. J. Feijen, David Gries, C. A. R. Hoare, Jayadev Misra, J. Moore, H. Richards
    In memoriam: Edsger W. Dijkstra 1930-2002. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2002, v:45, n:10, pp:21-22 [Journal]
  73. C. A. R. Hoare
    Algorithm 63: partition. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:7, pp:321- [Journal]
  74. C. A. R. Hoare
    Algorithm 65: find. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:7, pp:321-322 [Journal]
  75. C. A. R. Hoare
    Algorithm 64: Quicksort. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1961, v:4, n:7, pp:321- [Journal]
  76. C. A. R. Hoare
    Proof of a Program: FIND. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1971, v:14, n:1, pp:39-45 [Journal]
  77. C. A. R. Hoare
    The Emperor's Old Clothes. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1981, v:24, n:2, pp:75-83 [Journal]
  78. C. A. R. Hoare
    Communicating Sequential Processes (Reprint). [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:1, pp:100-106 [Journal]
  79. C. A. R. Hoare, Ian J. Hayes, Jifeng He, Carroll Morgan, A. W. Roscoe, Jeff W. Sanders, Ib Holm Sørensen, J. Michael Spivey, Bernard Sufrin
    Laws of Programming. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:8, pp:672-686 [Journal]
  80. H. C. Johnston, C. A. R. Hoare
    Matrix Reduction - An Efficient Method. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:3, pp:141-150 [Journal]
  81. Niklaus Wirth, C. A. R. Hoare
    A contribution to the development of ALGOL. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1966, v:9, n:6, pp:413-432 [Journal]
  82. M. Foley, C. A. R. Hoare
    Proof of a Recursive Program: Quicksort. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1971, v:14, n:4, pp:391-395 [Journal]
  83. C. A. R. Hoare
    Proof of a structured program: 'the sieve of Eratosthenes'. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1972, v:15, n:4, pp:321-325 [Journal]
  84. C. A. R. Hoare
    A Structured Paging System. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1973, v:16, n:3, pp:209-215 [Journal]
  85. A. M. Macnaghten, C. A. R. Hoare
    Fast Fourier Transform Free From Tears. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1977, v:20, n:1, pp:78-83 [Journal]
  86. C. A. R. Hoare
    Parallel Programming: An Axiomatic Approach. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1976, v:1, n:2, pp:151-160 [Journal]
  87. C. A. R. Hoare
    Unifying Theories : A Personal Statement. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:46- [Journal]
  88. C. A. R. Hoare, Donald C. S. Allison
    Incomputability. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1972, v:4, n:3, pp:169-178 [Journal]
  89. Jifeng He, C. A. R. Hoare
    Algebraic Specification and Proof of a Distributed Recovery Algorithm. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1987, v:2, n:1, pp:1-12 [Journal]
  90. Juan Bicarregui, C. A. R. Hoare, J. C. P. Woodcock
    The verified software repository: a step towards the verifying compiler. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:2, pp:143-151 [Journal]
  91. Zhou Chaochen, C. A. R. Hoare
    A Model for Synchronous Switching Circuits and its Theory of Correctness. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1992, v:1, n:1, pp:7-28 [Journal]
  92. Zhou Chaochen, C. A. R. Hoare, Anders P. Ravn
    A Calculus of Durations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:5, pp:269-276 [Journal]
  93. C. A. R. Hoare
    Legacy. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:77, n:2-4, pp:123-129 [Journal]
  94. C. A. R. Hoare
    A General Conservation Law for Queueing Disciplines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:3, pp:82-85 [Journal]
  95. C. A. R. Hoare
    Optimization of Store Size for Garbage Collection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:2, n:6, pp:165-166 [Journal]
  96. C. A. R. Hoare
    Fixed Points of Increasing Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:3, pp:111-112 [Journal]
  97. C. A. R. Hoare, Jifeng He
    The Weakest Prespecification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:127-132 [Journal]
  98. C. A. R. Hoare, Jifeng He, Jeff W. Sanders
    Prespecification in Data Refinement. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:2, pp:71-76 [Journal]
  99. Jifeng He, C. A. R. Hoare
    From Algebra to Operational Semantics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:2, pp:75-80 [Journal]
  100. Burghard von Karger, C. A. R. Hoare
    Sequential Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:3, pp:123-130 [Journal]
  101. Jifeng He, C. A. R. Hoare
    Linking Theories in Probabilistic Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:119, n:3-4, pp:205-218 [Journal]
  102. C. A. R. Hoare
    The verifying compiler: A grand challenge for computing research. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:63-69 [Journal]
  103. C. A. R. Hoare
    Some Properties of Predicate Transformers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:461-480 [Journal]
  104. Nissim Francez, C. A. R. Hoare, Daniel J. Lehmann, Willem P. de Roever
    Semantics of Nondeterminism, Concurrency, and Communication. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:3, pp:290-308 [Journal]
  105. C. A. R. Hoare
    A Hard Act to Follow. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2000, v:13, n:1/2, pp:71-72 [Journal]
  106. C. A. R. Hoare
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1994, v:4, n:3, pp:215-216 [Journal]
  107. C. E. Martin, C. A. R. Hoare, Jifeng He
    Pre-Adjunctions in Order Enriched Categories. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1991, v:1, n:2, pp:141-158 [Journal]
  108. C. A. R. Hoare
    A Calculus of Total Correctness for Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1981, v:1, n:1-2, pp:49-72 [Journal]
  109. C. A. R. Hoare
    Programming: Sorcery or Science? [Citation Graph (0, 0)][DBLP]
    IEEE Software, 1984, v:1, n:2, pp:5-16 [Journal]
  110. W. H. Kaubisch, Ronald H. Perrott, C. A. R. Hoare
    Quasiparallel Programming. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1976, v:6, n:3, pp:341-356 [Journal]
  111. Jim Welsh, W. J. Sneeringer, C. A. R. Hoare
    Ambiguities and Insecurities in Pascal. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1977, v:7, n:6, pp:685-696 [Journal]
  112. Eric C. R. Hehner, C. A. R. Hoare
    A More Complete Model of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:105-120 [Journal]
  113. C. A. R. Hoare
    A Theory for the Derivation of Combinational C-MOS Circuit Designs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:1, pp:235-251 [Journal]
  114. A. W. Roscoe, C. A. R. Hoare
    The Laws of Occam Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:60, n:, pp:177-229 [Journal]

  115. Foundations of Concurrent Kleene Algebra. [Citation Graph (, )][DBLP]


  116. Algebraic derivation of an operational semantics. [Citation Graph (, )][DBLP]


  117. Concurrent Kleene Algebra. [Citation Graph (, )][DBLP]


  118. Viewpoint - Retrospective: an axiomatic basis for computer programming. [Citation Graph (, )][DBLP]


  119. The transputer and occam: A personal story. [Citation Graph (, )][DBLP]


  120. Preface to special issue on software verification. [Citation Graph (, )][DBLP]


  121. The verified software initiative: A manifesto. [Citation Graph (, )][DBLP]


Search in 0.071secs, Finished in 0.078secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002