%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.03",
%%%     date            = "09 November 2022",
%%%     time            = "10:14:46 MDT",
%%%     filename        = "hoare-c-a-r.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "11199 19592 90347 926815",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; Communicating
%%%                        Sequential Processes (CSP);
%%%                        Divide-and-conquer; Hoare Axiom System; Hoare
%%%                        Logic; Hoare Type Theory; Inmos; occam;
%%%                        Quicksort; Sir Charles Antony Richard Hoare;
%%%                        Software verification",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of the works of the
%%%                        1980 ACM Turing Awardee and 2000 Kyoto Prize
%%%                        Awardee, Sir Charles Antony Richard Hoare,
%%%                        and publications about him and his works.
%%%                        Other awards include The Harry Goode Memorial
%%%                        Award (1985), the Faraday Medal (1985), the
%%%                        SIGPLAN Distinguised Achievement Award
%%%                        (2011), and the IEEE John von Neumann Medal
%%%                        (2011),
%%%
%%%                        Online resources about C. A. R. Hoare (as he
%%%                        usually names himself in publications,
%%%                        although Tony sometimes replaces his
%%%                        initials) include
%%%
%%%                            https://doi.org/10.1145/3477355
%%%                            https://cs.stanford.edu/people/eroberts/courses/soco/projects/2008-09/tony-hoare/bio.html
%%%                            https://en.wikipedia.org/wiki/Tony_Hoare
%%%                            https://mathgenealogy.org/id.php?id=45760
%%%                            https://www.cs.ox.ac.uk/people/publications/date/Tony.Hoare.html
%%%                            https://www.cs.ox.ac.uk/people/tony.hoare/
%%%                            https://www.genealogy.math.ndsu.nodak.edu/id.php?id=45760
%%%                            https://www.microsoft.com/en-us/research/people/thoare/
%%%
%%%                        All of the entries cited in the DOI above are
%%%                        included in this bibliography, with
%%%                        corrections.
%%%
%%%                        At version 1.03, the year coverage looked
%%%                        like this:
%%%
%%%                             1961 (   4)    1982 (  15)    2003 (   9)
%%%                             1962 (   2)    1983 (  13)    2004 (  12)
%%%                             1963 (   3)    1984 (  14)    2005 (  12)
%%%                             1964 (   3)    1985 (  13)    2006 (   9)
%%%                             1965 (   3)    1986 (  13)    2007 (   9)
%%%                             1966 (   5)    1987 (  18)    2008 (  10)
%%%                             1967 (   0)    1988 (   8)    2009 (  11)
%%%                             1968 (   7)    1989 (  15)    2010 (  13)
%%%                             1969 (   2)    1990 (  21)    2011 (   8)
%%%                             1970 (   4)    1991 (  14)    2012 (  13)
%%%                             1971 (   6)    1992 (   9)    2013 (  11)
%%%                             1972 (  16)    1993 (   9)    2014 (   4)
%%%                             1973 (  10)    1994 (  12)    2015 (   2)
%%%                             1974 (  11)    1995 (   8)    2016 (   6)
%%%                             1975 (  14)    1996 (  19)    2017 (   2)
%%%                             1976 (  19)    1997 (  12)    2018 (   0)
%%%                             1977 (   6)    1998 (   5)    2019 (  14)
%%%                             1978 (   8)    1999 (  10)    2020 (   0)
%%%                             1979 (   5)    2000 (  13)    2021 (  25)
%%%                             1980 (   7)    2001 (  10)    2022 (   2)
%%%                             1981 (  15)    2002 (  14)
%%%                             20xx (   2)
%%%
%%%                             Article:        291
%%%                             Book:            32
%%%                             InCollection:    88
%%%                             InProceedings:  102
%%%                             Misc:             9
%%%                             Proceedings:     36
%%%                             TechReport:      23
%%%                             Unpublished:      8
%%%
%%%                             Total entries:  589
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\let \k = \relax" #
    "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi" #
    "\ifx \undefined \cdprime   \def \cdprime{$''$} \fi" #
    "\ifx \undefined \cprime    \def \cprime{$'$} \fi" #
    "\ifx \undefined \flqq      \def \flqq {\ifmmode \ll
                                           \else \leavevmode \raise 0.2ex \hbox{$\scriptscriptstyle \ll $}\fi}\fi" #
    "\ifx \undefined \frqq      \def \frqq {\ifmmode \gg
                                           \else \leavevmode \raise 0.2ex \hbox{$\scriptscriptstyle \gg $}\fi}\fi" #
    "\ifx \undefined \k         \let \k = \c \fi" #
    "\ifx \undefined \ldquo     \def \ldquo {``} \fi" #
    "\ifx \undefined \mathbb    \def \mathbb #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathfrak  \let \mathfrak = \mathcal \fi" #
    "\ifx \undefined \rdquo     \def \rdquo {''} \fi" #
    "\ifx \undefined \url       \input{path.sty} \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Institution abbreviations:

%%% ====================================================================
%%% Journal abbreviations:

@String{j-ACTA-INFO             = "Acta Informatica"}

@String{j-ADV-APPL-PROB         = "Advances in Applied Probability"}

@String{j-ALGOL-BULLETIN        = "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)"}

@String{j-ALGORITHMICA          = "Algorithmica"}

@String{j-AMER-MATH-MONTHLY     = "American Mathematical Monthly"}

@String{j-ANN-HIST-COMPUT       = "Annals of the History of Computing"}

@String{j-BIOGRAPH-MEMOIRS-FELLOWS-ROY-SOC = "Biographical Memoirs of Fellows of
                                  the Royal Society"}

@String{j-BIT                   = "BIT"}

@String{j-BYTE                  = "Byte Magazine"}

@String{j-CACM                  = "Communications of the ACM"}

@String{j-CAN-J-MATH            = "Canadian Journal of Mathematics =
                                   Journal canadien de
                                   math{\'e}matiques"}

@String{j-CCPE                  = "Concurrency and Computation: Prac\-tice and
                                   Experience"}

@String{j-COMBIN-PROBAB-COMPUT  = "Combinatorics, Probability and Computing"}

@String{j-COMP-J                = "The Computer Journal"}

@String{j-COMP-LANGS            = "Computer Languages"}

@String{j-COMP-PHYS-COMM        = "Computer Physics Communications"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMPUT-BULL           = "The Computer Bulletin"}

@String{j-COMPUT-SCI-ENG        = "Computing in Science and Engineering"}

@String{j-COMPUT-SYST-SCI-ENG   = "Computer Systems Science and Engineering"}

@String{j-COMPUTER              = "Computer"}

@String{j-COMPUTING             = "Computing"}

@String{j-CPE                   = "Concurrency: Prac\-tice and Experience"}

@String{j-DISTRIB-COMPUT        = "Distributed Computing"}

@String{j-ELECT-NOTES-THEOR-COMP-SCI = "Electronic Notes in Theoretical Computer
                                  Science"}

@String{j-ELECTRON-POWER        = "Electronics and Power"}

@String{j-ELECTRONIC-DESIGN     = "Electronic Design"}

@String{j-FORM-ASP-COMPUT       = "Formal Aspects of Computing"}

@String{j-FORM-METHODS-SYST-DES = "Formal Methods in System Design"}

@String{j-FUND-INFO             = "Fundamenta Informaticae"}

@String{j-HIGHER-ORDER-SYMB-COMPUT = "Higher-Order and Symbolic Computation"}

@String{j-IEEE-ANN-HIST-COMPUT  = "IEEE Annals of the History of Computing"}

@String{j-IEEE-INTELL-SYST      = "IEEE Intelligent Systems"}

@String{j-IEEE-SOFTWARE         = "IEEE Software"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-INFO-SCI              = "Information Sciences"}

@String{j-INT-J-COMPUT-INF-SCI  = "International Journal of Computer and
                                  Information Sciences"}

@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations
                                  of Computer Science (IJFCS)"}

@String{j-INT-J-PARALLEL-PROG   = "International Journal of Parallel
                                   Programming"}

@String{j-J-ACM                 = "Journal of the ACM"}

@String{j-J-APPL-PROBAB         = "Journal of Applied Probability"}

@String{j-J-AUTOM-REASON        = "Journal of Automated Reasoning"}

@String{j-J-COMP-SYS-SCI        = "Journal of Computer and System
                                  Sciences"}

@String{j-J-FUNCT-PROGRAM       = "Journal of Functional Programming"}

@String{j-J-LOGIC-ALG-PROG      = "Journal of Logic and Algebraic Programming"}

@String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in Computer Science"}

@String{j-LECT-NOTES-MATH       = "Lecture Notes in Mathematics"}

@String{j-MICROPROC-MICROPROG   = "Microprocessing and Microprogramming"}

@String{j-NAG-NEWSLETTER        = "NAG Newsletter"}

@String{j-NEW-SCIENTIST         = "New Scientist"}

@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}

@String{j-PHILOS-TRANS-R-SOC-LOND-SER-A = "Philosophical Transactions of the
                                  Royal Society A: Mathematical,
                                  Physical, and Engineering Sciences"}

@String{j-PHYS-TODAY            = "Physics Today"}

@String{j-SCI-COMPUT-PROGRAM    = "Science of Computer Programming"}

@String{j-SIAM-NEWS             = "SIAM News"}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

@String{j-SIGSOFT               = "ACM SIGSOFT Software Engineering Notes"}

@String{j-SPE                   = "Soft\-ware\emdash Prac\-tice and Experience"}

@String{j-THEOR-COMP-SCI        = "Theoretical Computer Science"}

@String{j-TISSEC                = "ACM Transactions on Information and System
                                  Security"}

@String{j-TOCL                  = "ACM Transactions on Computational Logic"}

@String{j-TOMS                  = "ACM Transactions on Mathematical Software"}

@String{j-TOPLAS                = "ACM Transactions on Programming
                                  Languages and Systems"}

@String{j-TQC                   = "ACM Transactions on Quantum Computing (TQC)"}

@String{j-Z-MATH-LOGIK-GRUNDL-MATH = "{Zeitschrift f{\"u}r mathematische Logik
                                  und Grundlagen der Mathematik}"}

%%% ====================================================================
%%% Preparation details.

@String{prep-latex              = "Prepared with {\LaTeX}."}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-ATT-BELL            = "AT\&T Bell Laboratories"}
@String{pub-ATT-BELL:adr        = "Murray Hill, NJ 07974, USA"}

@String{pub-AW                  = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr              = "Reading, MA, USA"}

@String{pub-CAMBRIDGE           = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr       = "Cambridge, UK"}

@String{pub-ELSEVIER            = "Elsevier"}
@String{pub-ELSEVIER:adr        = "Amsterdam, The Netherlands"}

@String{pub-IEEE                = "IEEE Computer Society Press"}
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}

@String{pub-IOS                 = "IOS Press"}
@String{pub-IOS:adr             = "Amsterdam, The Netherlands"}

@String{pub-KLUWER              = "Kluwer Academic Publishers Group"}
@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht,
                                  The Netherlands"}

@String{pub-MIT                 = "MIT Press"}
@String{pub-MIT:adr             = "Cambridge, MA, USA"}

@String{pub-NORTH-HOLLAND       = "North-Holland Publishing Co."}
@String{pub-NORTH-HOLLAND:adr   = "Amsterdam, The Netherlands"}

@String{pub-OXFORD              = "Oxford University Press"}
@String{pub-OXFORD:adr          = "Walton Street, Oxford OX2 6DP, UK"}

@String{pub-PERGAMON            = "Pergamon Press"}
@String{pub-PERGAMON:adr        = "New York, NY, USA"}

@String{pub-PH                  = "Pren{\-}tice-Hall"}
@String{pub-PH:adr              = "Upper Saddle River, NJ 07458, USA"}

@String{pub-REIDEL              = "D. Reidel"}
@String{pub-REIDEL:adr          = "Dordrecht, The Netherlands; Boston, MA, USA;
                                  Lancaster, UK; Tokyo, Japan"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}

@String{pub-WILEY               = "John Wiley"}
@String{pub-WILEY:adr           = "New York, NY, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

@String{ser-LNM                 = "Lecture Notes in Mathematics"}

%%% ====================================================================
%%%       Part 1 (of 2) --- Publications of Sir C. A. R. Hoare

%%% Resources;
%%% A bibliography of Tony Hoare's papers with clickable DOIs/URLs where
%%% available (ACM: INSERT URL)
%%% Appendix E of the book provides links to talks and interviews
%%% featuring Tony Hoare (10.1145/3477355.3477376)
%%% The Oxford archive of Hoare's manuscripts:
%%% http://www.cs.ox.ac.uk/people/publications/date/Tony.Hoare.html
%%%
%%% TO DO: Find master's thesis (Merton College, Oxford, 1956) and
%%% doctoral dissertation (Moscow State University, 1960); not listed
%%% in  ProQuest Dissertations & Theses Global

@Article{Hoare:1961:AF,
  author =       "C. A. R. Hoare",
  title =        "{Algorithm 65}: {Find}",
  journal =      j-CACM,
  volume =       "4",
  number =       "7",
  pages =        "321--322",
  month =        jul,
  year =         "1961",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/366622.366647",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:33 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:1961:AP,
  author =       "C. A. R. Hoare",
  title =        "{Algorithm 63}: {Partition}",
  journal =      j-CACM,
  volume =       "4",
  number =       "7",
  pages =        "321--321",
  month =        jul,
  year =         "1961",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/366622.366642",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:33 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:1961:AQ,
  author =       "C. A. R. Hoare",
  title =        "{Algorithm 64}: {Quicksort}",
  journal =      j-CACM,
  volume =       "4",
  number =       "7",
  pages =        "321--321",
  month =        jul,
  year =         "1961",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/366622.366644",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:33 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:1961:MSS,
  author =       "C. A. R. Hoare",
  title =        "A Method of Synthesizing Sentences in Machine
                 Translation on the Basis of Syntagmatic Analysis",
  journal =      "Foreign Developments in Machine Translation and
                 Information Processing, {USSR}",
  volume =       "??",
  number =       "95",
  pages =        "??--??",
  year =         "1961",
  bibdate =      "Sat Jul 30 09:49:56 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Translated from \booktitle{Mashinnii Perevod i
                 Prikladnaya Linguistika} No. 6, pp. 80--88)",
  acknowledgement = ack-nhfb,
  ajournal =     "Foreign Develop. Mach. Translat. Info. Proc.",
}

@Article{Hoare:1962:Q,
  author =       "C. A. R. Hoare",
  title =        "{Quicksort}",
  journal =      j-COMP-J,
  volume =       "5",
  number =       "1",
  pages =        "10--15",
  month =        apr,
  year =         "1962",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/5.1.10",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68.00",
  MRnumber =     "142216",
  MRreviewer =   "C. C. Gotlieb",
  bibdate =      "Tue Dec 4 14:47:28 MST 2012",
  bibsource =    "Database/Graefe.bib;
                 http://comjnl.oxfordjournals.org/content/5/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/5/1/10.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/050010.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/10.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/11.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/12.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/13.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/14.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/15.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_01/tiff/16.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1962:REA,
  author =       "C. A. R. Hoare",
  title =        "Report on the {Elliott ALGOL} translator",
  journal =      j-COMP-J,
  volume =       "5",
  number =       "2",
  pages =        "127--129",
  month =        jul,
  year =         "1962",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/5.2.127",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Fri Sep 29 08:55:38 MDT 2000",
  bibsource =    "http://comjnl.oxfordjournals.org/content/5/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_02/",
  URL =          "http://comjnl.oxfordjournals.org/content/5/2/127.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_02/050127.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_02/tiff/127.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_02/tiff/128.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_02/tiff/129.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1963:BR,
  author =       "C. A. R. Hoare",
  title =        "Book Reviews",
  journal =      j-COMP-J,
  volume =       "6",
  number =       "2",
  pages =        "143--143",
  month =        aug,
  year =         "1963",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/6.2.143",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:30 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/6/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1960.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/6/2/143.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1963:EAI,
  author =       "C. A. R. Hoare",
  title =        "The {Elliott ALGOL} input\slash output system",
  journal =      j-COMP-J,
  volume =       "5",
  number =       "4",
  pages =        "345--348",
  month =        jan,
  year =         "1963",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/5.4.345",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:29 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/5/4.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1960.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/",
  URL =          "http://comjnl.oxfordjournals.org/content/5/4/345.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/050345.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/tiff/345.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/tiff/346.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/tiff/347.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_05/Issue_04/tiff/348.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1964:BRA,
  author =       "C. A. R. Hoare",
  title =        "Book review: {{\booktitle{Algol on the KDF9}}}",
  journal =      j-COMP-J,
  volume =       "7",
  number =       "2",
  pages =        "154--154",
  month =        "????",
  year =         "1964",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/7.2.154",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:31 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/7/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1960.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/7/2/154.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1964:CE,
  author =       "C. A. R. Hoare",
  title =        "Case expressions",
  journal =      j-ALGOL-BULLETIN,
  volume =       "21",
  number =       "??",
  pages =        "20--22",
  month =        "????",
  year =         "1964",
  CODEN =        "ALGOBG",
  DOI =          "https://dl.acm.org/doi/10.5555/1060978.1060988",
  ISSN =         "0084-6198",
  bibdate =      "Tue Aug 09 08:17:15 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)",
  journal-URL =  "http://portal.acm.org/affiliated/ALGOL",
}

@InProceedings{Hoare:1964:EAP,
  author =       "C. A. R. Hoare",
  editor =       "P. Wegner",
  booktitle =    "Introduction to System Programming",
  title =        "The {Elliott ALGOL} programming system",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "156--166",
  year =         "1964",
  bibdate =      "Tue Aug 09 08:19:42 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://archive.org/details/introductiontosy00wegn/page/2",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1965:NIA,
  author =       "C. A. R. Hoare",
  title =        "A note on indirect addressing",
  journal =      j-ALGOL-BULLETIN,
  volume =       "21",
  number =       "??",
  pages =        "63--65",
  month =        nov,
  year =         "1965",
  CODEN =        "ALGOBG",
  ISSN =         "0084-6198",
  bibdate =      "Sat Jul 30 09:52:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://archive.computerhistory.org/resources/text/algol/algol_bulletin/A21/P38.HTM",
  acknowledgement = ack-nhfb,
  fjournal =     "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)",
  journal-URL =  "http://portal.acm.org/affiliated/ALGOL",
}

@Article{Hoare:1965:RH,
  author =       "C. A. R. Hoare",
  title =        "Record handling",
  journal =      j-ALGOL-BULLETIN,
  volume =       "21",
  number =       "??",
  pages =        "39--69",
  month =        "????",
  year =         "1965",
  CODEN =        "ALGOBG",
  DOI =          "https://doi.org/10.5555/1061032.1061041",
  ISSN =         "0084-6198",
  bibdate =      "Tue Aug 09 08:25:55 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/1061032.1061041",
  acknowledgement = ack-nhfb,
  fjournal =     "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)",
  journal-URL =  "http://portal.acm.org/affiliated/ALGOL",
}

@Misc{Hoare:1966:LWM,
  author =       "C. A. R. Hoare",
  title =        "Letter to {WG 2.1} members",
  howpublished = "Unknown",
  year =         "1966",
  bibdate =      "Tue Aug 09 08:30:36 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1966:P,
  author =       "C. A. R. Hoare",
  booktitle =    "{Proceedings of the ACTP Summer School on Software,
                 June 1966}",
  title =        "{PL/I}",
  publisher =    "????",
  address =      "????",
  pages =        "1--25",
  year =         "1966",
  bibdate =      "Sat Jul 30 09:52:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/6072/H66%20-%20PL1.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1966:SPC,
  author =       "C. A. R. Hoare",
  booktitle =    "{Proceedings of the ACTP Summer School on Software,
                 June 1966}",
  title =        "Single pass compilation",
  publisher =    "????",
  address =      "????",
  pages =        "1--12",
  year =         "1966",
  bibdate =      "Sat Jul 30 09:52:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://www.cs.ox.ac.uk/files/6073/H66%20-%20Single.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Wirth:1966:CDA,
  author =       "Niklaus Wirth and C. A. R. Hoare",
  title =        "A Contribution to the Development of {ALGOL}",
  journal =      j-CACM,
  volume =       "9",
  number =       "6",
  pages =        "413--432",
  month =        jun,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:07 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib",
  note =         "See errata \cite{Wirth:1966:ECD}.",
  acknowledgement = ack-nhfb,
  checked =      "4 September 1990",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Wirth:1966:ECD,
  author =       "Niklaus Wirth and C. A. R. Hoare",
  title =        "Errata: {``A Contribution to the Development of
                 ALGOL''}",
  journal =      j-CACM,
  volume =       "9",
  number =       "12",
  pages =        "878--878",
  month =        dec,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Thu Dec 08 10:01:50 2005",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib",
  note =         "See \cite{Wirth:1966:CDA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:1968:CA,
  author =       "C. A. R. Hoare",
  title =        "Critique of {ALGOL 68}",
  journal =      j-ALGOL-BULLETIN,
  volume =       "29",
  number =       "??",
  pages =        "27--29",
  month =        nov,
  year =         "1968",
  CODEN =        "ALGOBG",
  ISSN =         "0084-6198",
  bibdate =      "Sat Jul 30 09:52:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://archive.computerhistory.org/resources/text/algol/algol_bulletin/A29/P34.HTM",
  acknowledgement = ack-nhfb,
  fjournal =     "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)",
  journal-URL =  "http://portal.acm.org/affiliated/ALGOL",
}

@InProceedings{Hoare:1968:DST,
  author =       "C. A. R. Hoare",
  booktitle =    "{Proceedings of the IFIP Congress, Edinburgh, 1968}",
  title =        "Data structures in two-level store",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "322--329",
  year =         "1968",
  bibdate =      "Sat Jul 30 10:00:18 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dblp.org/rec/conf/ifip/Hoare68",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1968:LL,
  author =       "C. A. R. Hoare",
  title =        "Limitations on languages",
  journal =      "Computer Weekly",
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1968",
  CODEN =        "????",
  ISSN =         "0010-4787",
  ISSN-L =       "0010-4787",
  bibdate =      "Sat Jul 30 09:52:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Hoare:1968:LVW,
  author =       "C. A. R. Hoare",
  title =        "Letter to {A. van Wijngaarden}",
  howpublished = "Unknown",
  month =        "????",
  year =         "1968",
  bibdate =      "Tue Aug 09 08:34:51 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Hoare:1968:RDR,
  author =       "C. A. R. Hoare",
  title =        "Recommendation on Draft Report on {ALGOL 68}",
  howpublished = "Unknown",
  month =        "????",
  year =         "1968",
  bibdate =      "Tue Aug 09 08:35:48 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1968:RH,
  author =       "C. A. R. Hoare",
  editor =       "F. Genuys",
  booktitle =    "Programming Languages",
  title =        "Record handling",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "291--347",
  year =         "1968",
  bibdate =      "Sat Jul 30 09:58:58 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1968:SM,
  author =       "C. A. R. Hoare",
  title =        "Set manipulation",
  journal =      j-ALGOL-BULLETIN,
  volume =       "27",
  number =       "??",
  pages =        "29--37",
  month =        "????",
  year =         "1968",
  DOI =          "https://doi.org/10.5555/1061098.1061105",
  bibdate =      "Tue Aug 09 08:36:51 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/1061098.1061105",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1969:ABC,
  author =       "C. A. R. Hoare",
  title =        "An Axiomatic Basis for Computer Programming",
  journal =      j-CACM,
  volume =       "12",
  number =       "10",
  pages =        "576--580, 583",
  month =        oct,
  year =         "1969",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/363235.363259",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:28 MST 2005",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm12.html#Hoare69;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  acknowledgement = ack-nhfb,
  checked =      "24 August 1990",
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "The Queen's Univ., Belfast, UK",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
  keywords =     "computer metatheory; programming",
  oldlabel =     "Hoare69",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare69",
}

@Article{Woodger:1969:MRA,
  author =       "Mike Woodger and W{\l}adis{\l}aw Marek Turski and
                 Edsger W. Dijkstra and C. A. R. Hoare and Brian Randell
                 and Jan V. Garwick and Fraser G. Duncan and Gerhard
                 Seegmueller",
  title =        "Minority Report on {Algol 68}. {The} draft and the
                 final text",
  journal =      j-ALGOL-BULLETIN,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  day =          "17",
  month =        jan,
  year =         "1969",
  bibdate =      "Tue Aug 09 08:38:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://ershov.iis.nsk.su/en/node/805785",
  acknowledgement = ack-nhfb,
  pagecount =    "4",
}

@Article{Dijkstra:1970:NIM,
  author =       "Edsger W. Dijkstra and ?. Duncan and Jan V. Garwick
                 and C. A. R. Hoare and Brian Randell and G. Seegmueller
                 and W{\l}adis{\l}aw M. Turski and Michael Woodger",
  title =        "News Item --- Minority Report",
  journal =      j-ALGOL-BULLETIN,
  volume =       "31",
  pages =        "7--7",
  month =        mar,
  year =         "1970",
  CODEN =        "ALGOBG",
  ISSN =         "0084-6198",
  ISSN-L =       "0084-6198",
  bibdate =      "Wed Mar 18 15:08:05 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Item AB31.1.1.",
  acknowledgement = ack-nhfb,
  fjournal =     "ALGOL Bulletin (Amsterdam: Mathematisch Centrum)",
  journal-URL =  "http://portal.acm.org/affiliated/ALGOL",
  remark =       "This is the rebuttal to the ALGOL 68 report
                 \cite{vanWijngaarden:1969:RAL}, written by eight former
                 members of the ALGOL 68 Committee who disagreed with
                 its final report. The report begins: ``We regard the
                 current Report on Algorithmic Language ALGOL 68 as the
                 fruit of an effort to apply a methodology for language
                 definition to a newly designed programming language. We
                 regard the effort as an experiment and professional
                 honesty compels us to state that in our considered
                 opinion we judge the experiment to be a failure in both
                 respects.''",
}

@Article{Hoare:1970:BR,
  author =       "C. A. R. Hoare",
  title =        "Book Review",
  journal =      j-COMP-J,
  volume =       "13",
  number =       "2",
  pages =        "170--170",
  month =        "????",
  year =         "1970",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/13.2.170",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:45 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/13/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/13/2/170.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Hoare:1970:BRC,
  author =       "C. A. R. Hoare",
  title =        "Book Review: {{\booktitle{Computer languages: a
                 practical guide to the chief programming languages}}:
                 Peter C. Sanderson, M. A. Newnes-Butterworths \pounds
                 2.15s}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "1",
  number =       "6",
  pages =        "477--477",
  month =        dec,
  year =         "1970",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(70)90027-5",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Sat Feb 11 10:52:32 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compphyscomm1960.bib;
                 http://www.math.utah.edu/pub/tex/bib/compphyscomm1970.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465570900275",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@Article{Foley:1971:PRP,
  author =       "M. Foley and C. A. R. Hoare",
  title =        "Proof of a recursive program: {Quicksort}",
  journal =      j-COMP-J,
  volume =       "14",
  number =       "4",
  pages =        "391--395",
  month =        nov,
  year =         "1971",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/14.4.391",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68A05",
  MRnumber =     "371135",
  MRreviewer =   "I. Kaufmann",
  bibdate =      "Tue Dec 4 14:47:48 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/14/4.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/",
  URL =          "http://comjnl.oxfordjournals.org/content/14/4/391.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/140391.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/tiff/391.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/tiff/392.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/tiff/393.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/tiff/394.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_14/Issue_04/tiff/395.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "coded program; computability and decidability; formal
                 methods; informal; mechanical aid; proof; Quicksort;
                 recursive program; rigorous; sorting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1971:PP,
  author =       "C. A. R. Hoare",
  title =        "Proof of a program",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "39--45",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/362452.362489",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
}

@InCollection{Hoare:1971:PPA,
  author =       "C. A. R. Hoare",
  editor =       "E. Engeler",
  booktitle =    "Symposium on Semantics of Algorithmic Languages",
  title =        "Procedures and parameters: an axiomatic approach",
  volume =       "188",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "102--116",
  year =         "1971",
  CODEN =        "LNMAA2",
  DOI =          "https://doi.org/10.1007/BFb0059696",
  ISBN =         "3-540-05377-8 (print), 3-540-36499-4 (e-book)",
  ISBN-13 =      "978-3-540-05377-4 (print), 978-3-540-36499-3
                 (e-book)",
  ISSN =         "0075a-8434 (print), 1617-9692 (electronic)",
  ISSN-L =       "0075-8434",
  MRclass =      "68.00 (94.00)",
  MRnumber =     "0278567",
  MRreviewer =   "A. D. Booth",
  bibdate =      "Fri May 9 19:07:03 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lnm1970.bib",
  series =       ser-LNM,
  URL =          "http://link.springer.com/chapter/10.1007/BFb0059696/",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/BFb0059689",
  book-URL =     "http://www.springerlink.com/content/978-3-540-36499-3",
  fjournal =     "Lecture Notes in Mathematics",
  journal-URL =  "http://link.springer.com/bookseries/304",
}

@Article{Hoare:1971:PPF,
  author =       "C. A. R. Hoare",
  title =        "Proof of a Program: {FIND}",
  journal =      j-CACM,
  volume =       "14",
  number =       "1",
  pages =        "39--45",
  month =        jan,
  year =         "1971",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/362452.362489",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:50:22 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Hoare71;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib",
  URL =          "http://doi.acm.org/",
  abstract =     "An informal description is given of the purpose of the
                 program and the method used. A systematic technique is
                 described for constructing and the program proof during
                 the process of coding it, in such a way as to prevent
                 the intrusion of logical errors. The proof of
                 termination is treated as a separate exercise. Some,
                 conclusions relating to general programming methodology
                 are drawn.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory)",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "algorithm correctness; algorithm theory; CACMA;
                 coding; computers, digital; computers, digital,
                 programming; documentation; FIND; ITI; languages;
                 logical errors intrusion; programming methodology;
                 programming theory; programs proofs",
  oldlabel =     "Hoare71",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare71",
}

@Article{Clint:1972:PPJ,
  author =       "M. Clint and C. A. R. Hoare",
  title =        "Program Proving: Jumps and Functions",
  journal =      j-ACTA-INFO,
  volume =       "1",
  number =       "3",
  pages =        "214--224",
  month =        "????",
  year =         "1972",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/bf00288686",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  note =         "See remarks \cite{Ashcroft:1976:RPP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@InCollection{Dahl:1972:HPS,
  author =       "Ole-Johan Dahl and C. A. R. Hoare",
  title =        "Hierarchical program structures",
  crossref =     "Dahl:1972:SP",
  chapter =      "{III}",
  pages =        "175--220",
  year =         "1972",
  DOI =          "https://doi.org/10.5555/1243380.1243383",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/1243380.1243383",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1972:GEQ,
  author =       "C. A. R. Hoare",
  title =        "Guest Editorial: The quality of software",
  journal =      j-SPE,
  volume =       "2",
  number =       "2",
  pages =        "103--105",
  month =        apr,
  year =         "1972",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380020202",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Wed Sep 10 12:36:39 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/spe.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
}

@Article{Hoare:1972:I,
  author =       "C. A. R. Hoare and D. C. S. Allison",
  title =        "Incomputability",
  journal =      j-COMP-SURV,
  volume =       "4",
  number =       "3",
  pages =        "169--178",
  month =        sep,
  year =         "1972",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356603.356606",
  ISSN =         "0010-4892",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:16:35 MDT 2008",
  bibsource =    "Compendex database;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  abstract =     "Russell's logical paradox, formulated in terms of
                 English adjectives, is considered as a convenient
                 starting point for this discussion of incomputability.
                 It is shown to be impossible, under a wide variety of
                 circumstances, to program a function which will
                 determine whether another function written in the same
                 programming language will terminate. The theory of
                 types is introduced in an attempt to evade the paradox.
                 Finally, it is shown that any language containing
                 conditionals and recursive function definitions, which
                 is powerful enough to program its own interpreter,
                 cannot be used to program its own terminates
                 function.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "computer metatheory --- Formal Logic; computer
                 programming languages; incomputability; logical
                 paradox; recursion",
}

@InCollection{Hoare:1972:NDS,
  author =       "C. A. R. Hoare",
  title =        "Notes on data structuring",
  crossref =     "Dahl:1972:SP",
  chapter =      "{II}",
  pages =        "83--174",
  year =         "1972",
  DOI =          "https://doi.org/10.5555/1243380.1243382",
  bibdate =      "Sat Jul 30 10:07:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/1243380.1243382",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1972:NS,
  author =       "C. A. R. Hoare",
  title =        "A Note on the {{\em For\/}} Statement",
  journal =      j-BIT,
  volume =       "12",
  number =       "3",
  pages =        "334--341",
  month =        sep,
  year =         "1972",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01932305",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  bibdate =      "Wed Jan 4 18:52:12 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=12&issue=3;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/bit.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=12&issue=3&spage=334",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
}

@InProceedings{Hoare:1972:OSTb,
  author =       "C. A. R. Hoare",
  title =        "Operating systems: their purpose, objectives,
                 functions and scope",
  crossref =     "Hoare:1972:OST",
  pages =        "11--28",
  year =         "1972",
  bibdate =      "Sat Jul 30 10:09:33 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1972:PBP,
  author =       "C. A. R. Hoare",
  editor =       "Christma Boon",
  booktitle =    "High level languages: international computer state of
                 the art report",
  title =        "Prospects for a better programming language",
  volume =       "7",
  publisher =    "Infotech Information Ltd.,",
  address =      "Maidenhead, Berkshire, UK",
  bookpages =    "iv + 500",
  pages =        "327--343",
  year =         "1972",
  ISBN =         "0-85539-060-3",
  ISBN-13 =      "978-0-85539-060-0",
  LCCN =         "QA76.7 .H52",
  bibdate =      "Sat Jul 30 10:14:47 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  xxbooktitle =  "Infotech State of the Art Report: High Level
                 Languages",
}

@Article{Hoare:1972:PCD,
  author =       "C. A. R. Hoare",
  title =        "Proof of correctness of data representations",
  journal =      j-ACTA-INFO,
  volume =       "1",
  number =       "4",
  pages =        "271--281",
  month =        nov,
  year =         "1972",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/bf00289507",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/compling.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/algebraic.spec.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  acknowledgement = ack-nhfb,
  annote =       "8 references.",
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  keywords =     "abstract data types; Data Abstraction; functional",
}

@Article{Hoare:1972:PSP,
  author =       "C. A. R. Hoare",
  title =        "Proof of a structured program: ``{The} sieve of
                 {Eratosthenes}''",
  journal =      j-COMP-J,
  volume =       "15",
  number =       "4",
  pages =        "321--325",
  month =        nov,
  year =         "1972",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/15.4.321",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68A05",
  MRnumber =     "331849",
  MRreviewer =   "B. P. Zeigler",
  bibdate =      "Tue Dec 4 14:47:50 MST 2012",
  bibsource =    "Compiler/ml.bib;
                 http://comjnl.oxfordjournals.org/content/15/4.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/",
  URL =          "http://comjnl.oxfordjournals.org/content/15/4/321.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/150321.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/321.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/322.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/323.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/324.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_04/tiff/325.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "programming theory; proof; structured program",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Hoare:1972:SSMa,
  author =       "C. A. R. Hoare and R. M. McKeag",
  title =        "A survey of store management techniques: Part 1",
  crossref =     "Hoare:1972:OST",
  pages =        "117--131",
  year =         "1972",
  bibdate =      "Sat Jul 30 10:09:33 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1972:SSMb,
  author =       "C. A. R. Hoare and R. M. McKeag",
  title =        "A survey of store management techniques: Part 2",
  crossref =     "Hoare:1972:OST",
  pages =        "132--151",
  year =         "1972",
  bibdate =      "Sat Jul 30 10:09:33 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1972:TTP,
  author =       "C. A. R. Hoare",
  title =        "Towards a Theory of Parallel Programming",
  crossref =     "Hoare:1972:OST",
  pages =        "61--71",
  year =         "1972",
  bibdate =      "Sat Jul 30 10:16:32 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1973:ADP,
  author =       "C. A. R. Hoare and Niklaus Wirth",
  title =        "An Axiomatic Definition of the Programming Language
                 {Pascal}",
  journal =      j-ACTA-INFO,
  volume =       "2",
  number =       "4",
  pages =        "335--355",
  month =        dec,
  year =         "1973",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/bf00289504",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Collberg.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  note =         "See addenda and corrigenda \cite{Hoare:1974:ACA}.",
  abstract =     "The axiomatic definition method proposed in reference
                 [5] is extended and applied to define the meaning of
                 the programming language Pascal. The whole language is
                 covered with the exception of real arithmetic and go to
                 statements.",
  acknowledgement = ack-nhfb,
  annote =       "8 references.",
  checked =      "4 January 1994",
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  keywords =     "axiomatic; Pascal; PROGLANG; proof; SEMANTIC",
}

@Article{Hoare:1973:CPE,
  author =       "C. A. R. Hoare",
  title =        "Computer programming as an engineering discipline",
  journal =      j-ELECTRON-POWER,
  volume =       "19",
  number =       "14",
  pages =        "316--320",
  month =        aug,
  year =         "1973",
  CODEN =        "ELPWAQ",
  DOI =          "https://doi.org/10.1049/ep.1973.0381",
  ISSN =         "0013-5127 (print), 2053-7883 (electronic)",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronics and power",
}

@Article{Hoare:1973:GCL,
  author =       "C. A. R. Hoare",
  title =        "A general conservation law for queueing disciplines",
  journal =      j-INFO-PROC-LETT,
  volume =       "2",
  number =       "3",
  pages =        "82--85",
  day =          "??",
  month =        aug,
  year =         "1973",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(73)90006-9",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "general conservation law; queueing disciplines;
                 queueing theory",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{Hoare:1973:HLP,
  author =       "C. A. R. Hoare",
  editor =       "D. Simpson",
  booktitle =    "High Level Programming Languages --- The Way Ahead",
  title =        "High level programming languages, the way behind",
  publisher =    "NCC Publications",
  address =      "Manchester, UK",
  pages =        "??--??",
  year =         "1973",
  bibdate =      "Sat Jul 30 10:19:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1973:HPLa,
  author =       "C. A. R. Hoare",
  title =        "Hints on Programming Language Design",
  type =         "Technical report",
  institution =  "Stanford University",
  address =      "Stanford, CA, USA",
  year =         "1973",
  DOI =          "https://doi.org/10.5555/892013",
  bibdate =      "Tue Aug 09 08:52:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/book/10.5555/892013",
  abstract =     "This paper (based on a keynote address presented at
                 the SIGACT/SIGPLAN Symposium on Principles of
                 Programming Languages, Boston, October 1--3, 1973)
                 presents the view that a programming language is a tool
                 which should assist the programmer in the most
                 difficult aspects of his art, namely program design,
                 documentation, and debugging. It discusses the
                 objective criteria for evaluating a language design,
                 and illustrates them by application to language
                 features of both high level languages and machine code
                 programming. It concludes with an annotated reading
                 list, recommended for all intending language
                 designers.",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1973:HPLb,
  author =       "C. A. R. Hoare",
  title =        "Hints on Programming Language Design",
  type =         "DTIC Document",
  number =       "??",
  institution =  "????",
  address =      "????",
  month =        "????",
  year =         "1973",
  bibdate =      "Tue Aug 09 08:56:32 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Hoare:1973:HPLc,
  author =       "C. A. R. Hoare",
  title =        "Hints on Programming Language Design",
  howpublished = "Invited Address at SIGACT/SIGPLAN Symposium on
                 Principles of Programming Languages, Boston",
  year =         "1973",
  bibdate =      "Tue Aug 09 08:57:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1973:SPS,
  author =       "C. A. R. Hoare",
  title =        "A structured paging system",
  journal =      j-COMP-J,
  volume =       "16",
  number =       "3",
  pages =        "209--215",
  month =        aug,
  year =         "1973",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/16.3.209",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:52 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/16/3.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/",
  URL =          "http://comjnl.oxfordjournals.org/content/16/3/209.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/160209.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/209.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/210.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/211.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/212.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/213.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/214.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_16/Issue_03/tiff/215.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "paging system; structured programming; virtual
                 storage; virtual store",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1973:TMR,
  author =       "C. A. R. Hoare",
  title =        "Tomorrow's men: The role of the university",
  journal =      "Computer Weekly",
  volume =       "7",
  pages =        "??--??",
  month =        jul,
  year =         "1973",
  CODEN =        "????",
  ISSN =         "0010-4787",
  ISSN-L =       "0010-4787",
  bibdate =      "Sat Jul 30 10:21:04 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Educational Supplement",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1974:ACA,
  author =       "C. A. R. Hoare and N. Wirth",
  title =        "Addenda and Corrigenda to {{\em An Axiomatic
                 Definition of the Programming Language Pascal}}",
  journal =      j-ACTA-INFO,
  volume =       "3",
  number =       "3",
  pages =        "296--296",
  day =          "22",
  month =        jul,
  year =         "1974",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/BF00288641",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Fri Oct 08 22:02:37 1999",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  note =         "See \cite{Hoare:1973:ADP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@InProceedings{Hoare:1974:ADP,
  author =       "C. A. R. Hoare",
  title =        "An axiomatic definition of the programming language
                 {PASCAL}",
  crossref =     "Ershov:1974:IST",
  pages =        "1--16",
  year =         "1974",
  MRclass =      "68A05",
  MRnumber =     "0421129",
  MRreviewer =   "David Gries",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1974:CCF,
  author =       "C. A. R. Hoare and Peter E. Lauer",
  title =        "Consistent and Complementary Formal Theories of the
                 Semantics of Programming Languages",
  journal =      j-ACTA-INFO,
  volume =       "3",
  number =       "2",
  pages =        "135--153",
  day =          "22",
  month =        jun,
  year =         "1974",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/BF00264034",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68A05",
  MRnumber =     "0464644",
  MRreviewer =   "W. B. Jones",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/logic.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  acknowledgement = ack-nhfb,
  annote =       "30 references.",
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@InCollection{Hoare:1974:HPL,
  author =       "C. A. R. Hoare",
  editor =       "C. J. Bunyan",
  booktitle =    "State of the Art Report 20: Computer Systems
                 Reliability",
  title =        "Hints on programming language design",
  publisher =    "Pergamon/Infotech",
  address =      "????",
  pages =        "505--534",
  year =         "1974",
  bibdate =      "Sat Jul 30 10:22:21 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1974:MOS,
  author =       "C. A. R. Hoare",
  title =        "Monitors: an Operating System Structuring Concept",
  journal =      j-CACM,
  volume =       "17",
  number =       "10",
  pages =        "549--557",
  month =        oct,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:50:23 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Hoare74;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib",
  note =         "Erratum in {\em Communications of the ACM}, Vol. 18,
                 No. 2 (February), p. 95, 1975. This paper contains one
                 of the first solutions to the Dining Philosophers
                 problem.",
  URL =          "https://www.classes.cs.uchicago.edu/archive/2020/winter/33100-1/papers/hoare-monitors.pdf",
  abstract =     "This paper develops Brinch-Hansen's concept of a
                 monitor as a method of structuring an operating system.
                 It introduces a form of synchronization, describes a
                 possible method of implementation in terms of
                 semaphores and gives a suitable proof rule.
                 Illustrative examples include a single resource
                 scheduler, a bounded buffer, an alarm clock, a buffer
                 pool, a disk head optimizer, and a version of the
                 problem of readers and writers.",
  acknowledgement = ack-nhfb,
  annote =       "Monitors",
  checked =      "7 April 1989",
  classcodes =   "C6150J (Operating systems)",
  classification = "722; 723",
  corpsource =   "Queen's Univ. Belfast, UK",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "alarm clock; bounded buffer; buffer pool; CACM
                 synchronization communication semaphores; computer
                 operating systems; disc; exclusion; head optimizer;
                 monitors; multiprogramming; mutual; operating system
                 structuring concept; operating systems (computers);
                 proof rule; readers; scheduler; scheduling; semaphores;
                 single resource; structured multiprogramming;
                 structuring; synchronization; writers",
  oldlabel =     "Hoare74",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare74",
}

@Article{Hoare:1974:OSS,
  author =       "C. A. R. Hoare",
  title =        "Optimization of store size for garbage collection",
  journal =      j-INFO-PROC-LETT,
  volume =       "2",
  number =       "6",
  pages =        "165--166",
  day =          "??",
  month =        apr,
  year =         "1974",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(74)90005-2",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1970.bib",
  acknowledgement = ack-nhfb,
  classification = "B0260 (Optimisation techniques); C1180 (Optimisation
                 techniques); C4240 (Programming and algorithm theory);
                 C6120 (File organisation)",
  corpsource =   "Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "dynamic storage allocation; garbage collection;
                 garbage collection cost; LISP; minimisation; minimizing
                 cost; optimisation; programming theory; scan mark
                 garbage collection; storage management; store
                 allocation strategies; store size",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1974:SDP,
  author =       "C. A. R. Hoare",
  title =        "Software design: a parable",
  journal =      "Software World",
  volume =       "5",
  number =       "9--10",
  pages =        "53--56",
  month =        "????",
  year =         "1974",
  CODEN =        "SOFWBG",
  ISSN =         "0038-0652",
  ISSN-L =       "0038-0652",
  bibdate =      "Sat Jul 30 10:23:59 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://people.dsv.su.se/~jpalme/s1/hoare.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. world",
}

@TechReport{Enslow:1975:ILRa,
  author =       "P. H. Enslow and C. A. R. Hoare and J. Palme and D.
                 Parnas and I. Pyle",
  title =        "Implementation Languages for Real-Time Systems ---
                 {I}. {Standardisation} --- its Implementation and
                 Acceptance",
  type =         "Report",
  number =       "ERO-2-75-Vol-1",
  institution =  "Euro. Res. Office",
  address =      "London, UK",
  year =         "1975",
  bibdate =      "Sat Jul 30 10:25:16 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://apps.dtic.mil/sti/citations/ADA008977",
  acknowledgement = ack-nhfb,
}

@TechReport{Enslow:1975:ILRb,
  author =       "P. H. Enslow and C. A. R. Hoare and J. Palme and D.
                 Parnas and I. Pyle",
  title =        "Implementation Languages for Real-Time Systems --
                 {II}. Language Design --- General Comments",
  type =         "Report",
  number =       "ERO-2-75-Vol-2",
  institution =  "Euro. Res. Office",
  address =      "London, UK",
  year =         "1975",
  bibdate =      "Sat Jul 30 10:25:16 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://apps.dtic.mil/sti/citations/ADA008978",
  acknowledgement = ack-nhfb,
}

@TechReport{Enslow:1975:ILRc,
  author =       "P. H. Enslow and C. A. R. Hoare and J. Palme and D.
                 Parnas and I. Pyle",
  title =        "Implementation Languages for Real-Time Systems ---
                 {III}. Command and Control Languages --- Specific
                 Comments",
  type =         "Report",
  number =       "ERO-2-75-Vol-3",
  institution =  "Euro. Res. Office",
  address =      "London, UK",
  year =         "1975",
  bibdate =      "Sat Jul 30 10:25:16 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://apps.dtic.mil/sti/citations/ADA009081",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1975:DR,
  author =       "C. A. R. Hoare",
  title =        "Data reliability",
  journal =      j-SIGPLAN,
  volume =       "10",
  number =       "6",
  pages =        "528--533",
  month =        jun,
  year =         "1975",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/390016.808476",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan1970.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6120
                 (File organisation)",
  conflocation = "Los Angeles, CA, USA; 21-23 April 1975",
  conftitle =    "International Conference on Reliable Software",
  corpsource =   "Dept. of Computer Sci., Queen's Univ. of Belfast,
                 Belfast, Ireland",
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "data reliability; data structures; data structuring;
                 direct product; fault tolerant computing; fault
                 tolerant computing data structuring; mapping;
                 programming; recursion; sequence; software reliability;
                 topdown design; type; union",
  sponsororg =   "IEEE; ACM; et al",
  treatment =    "A Application; P Practical",
}

@InCollection{Hoare:1975:HDP,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Implementation Languages for Real-Time Systems: {II}.
                 {Language} Design--General Comments",
  title =        "Hints on the design of a programming language for
                 real-time command and control",
  volume =       "ERO-2-75",
  publisher =    "????",
  address =      "????",
  year =         "1975",
  ISBN =         "????",
  ISBN-13 =      "????",
  bibdate =      "Tue Aug 09 09:03:31 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1975:PCP,
  author =       "C. A. R. Hoare",
  editor =       "B. Shaw",
  booktitle =    "{Formal Aspects of Computing Science, Newcastle upon
                 Tyne, 3--6 September, 1974}",
  title =        "Program correctness proofs",
  publisher =    "University of Newcastle-upon-Tyne",
  address =      "Newcastle-upon-Tyne, UK",
  pages =        "7--45",
  year =         "1975",
  bibdate =      "Sat Jul 30 10:28:11 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1975:PPA,
  author =       "C. A. R. Hoare",
  title =        "Parallel programming: an axiomatic approach",
  journal =      j-COMP-LANGS,
  volume =       "1",
  number =       "2",
  pages =        "151--160",
  month =        jun,
  year =         "1975",
  CODEN =        "COLADA",
  DOI =          "https://doi.org/10.1016/0096-0551(75)90014-4",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C6110 (Systems analysis
                 and programming)",
  corpsource =   "Dept. of Computer Sci., Queen's Univ., Belfast,
                 Ireland",
  fjournal =     "Computer Languages",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  keywords =     "axiomatic proof; communication; competition;
                 cooperating sequential processes; cooperation; disjoint
                 processes; parallel processing; parallel programming;
                 parallelism; programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1975:RDS,
  author =       "C. A. R. Hoare",
  title =        "Recursive data structures",
  journal =      j-INT-J-COMPUT-INF-SCI,
  volume =       "4",
  number =       "2",
  pages =        "105--132",
  month =        jun,
  year =         "1975",
  CODEN =        "IJCIAH",
  DOI =          "https://doi.org/10.1007/bf00976239",
  ISSN =         "0091-7036",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation)",
  corpsource =   "Dept. of Computer Sci., Queen's Univ. of Belfast,
                 Belfast, UK",
  fjournal =     "International Journal of Computer and Information
                 Sciences",
  journal-URL =  "http://link.springer.com/journal/10766",
  keywords =     "axiomatic proof rules; data structures; dynamic
                 storage allocation; efficiency; high level programming
                 language; programming language; recursive data
                 structures; recursive functions; storage allocation;
                 symbol manipulation; treelike data structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1975:SE,
  author =       "C. A. R. Hoare",
  title =        "Software engineering",
  journal =      j-COMPUT-BULL,
  volume =       "2",
  number =       "6",
  pages =        "6--7",
  month =        dec,
  year =         "1975",
  CODEN =        "COBUAH",
  ISSN =         "0010-4531 (print), 1464-357X (electronic)",
  ISSN-L =       "0010-4531",
  bibdate =      "Sat Jul 30 10:29:57 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Bulletin",
}

@Article{Johnston:1975:MRE,
  author =       "H. C. Johnston and C. A. R. Hoare",
  title =        "Matrix Reduction --- an Efficient Method (school
                 timetables)",
  journal =      j-CACM,
  volume =       "18",
  number =       "3",
  pages =        "141--150",
  month =        mar,
  year =         "1975",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/360680.360683",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "65K05",
  MRnumber =     "52 2203 (0381306)",
  MRreviewer =   "P. Brock",
  bibdate =      "Mon Jan 22 06:53:01 MST 2001",
  bibsource =    "Compendex database;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#JohnstonH75;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib",
  abstract =     "The paper describes an efficient method for reduction
                 of the binary matrices which arise in some school
                 time-tabling problems. It is a development of that
                 described by John Lions. It has been generalized and
                 adapted to fit into the complete timetabling process;
                 to use a more compact data representation and more
                 efficient processing techniques; to take fuller
                 advantage of possible available previous knowledge
                 about the matrix. And it is designed as a structured
                 program, which can readily be coded by the reader in
                 the high level or low level programming language of his
                 choice. Practical tests of the method have shown it to
                 be a good basis for a realistic timetabling
                 algorithm.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C7110
                 (Educational administration)",
  classification = "921",
  corpsource =   "Queen's Univ. of Belfast, UK",
  fjournal =     "Communications of the Association for Computing
                 Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "binary matrices; data representation; educational
                 administrative data processing; high level programming
                 language; low level programming language; mathematical
                 techniques; matrix algebra; matrix reduction; problems;
                 processing techniques; school time tabling; school
                 timetable construction; structured program; structured
                 programming; tight set; timetabling algorithm",
  oldlabel =     "JohnstonH75",
  treatment =    "A Application; T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JohnstonH75",
  xxDOI =        "https://doi.org/10.1145/3051092",
}

@Article{Ashcroft:1976:RPP,
  author =       "E. A. Ashcroft and M. Clint and C. A. R. Hoare",
  title =        "Remarks on {{\em Program Proving: Jumps and
                 Functions}} by {M. Clint} and {C. A. R. Hoare}",
  journal =      j-ACTA-INFO,
  volume =       "6",
  number =       "3",
  pages =        "317--318",
  day =          "10",
  month =        aug,
  year =         "1976",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/bf00288660",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  note =         "See \cite{Clint:1972:PPJ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@Article{Hoare:1976:CST,
  author =       "C. A. R. Hoare",
  title =        "Computer Science and Technology and their
                 application",
  journal =      j-COMP-J,
  volume =       "19",
  number =       "2",
  pages =        "172--172",
  month =        may,
  year =         "1976",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/19.2.172",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:57 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/19/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/19/2/172.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@InCollection{Hoare:1976:F,
  author =       "C. A. R. Hoare",
  title =        "Foreword",
  crossref =     "Dijkstra:1976:DP",
  pages =        "xi--xi",
  year =         "1976",
  bibdate =      "Thu Aug 04 07:59:16 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1976:HCP,
  author =       "C. A. R. Hoare",
  title =        "The high cost of programming languages",
  crossref =     "Anonymous:1976:SSE",
  pages =        "413--429",
  year =         "1976",
  bibdate =      "Sat Jul 30 10:33:28 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1976:HDP,
  author =       "C. A. R. Hoare",
  editor =       "J. P. Spencer",
  booktitle =    "Real-time Software: International State of the Art
                 Report",
  title =        "Hints on the design of a programming language for
                 real-time command and control",
  publisher =    "Infotech International",
  address =      "????",
  pages =        "685--699",
  year =         "1976",
  bibdate =      "Sat Jul 30 10:37:45 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1976:PCD,
  author =       "C. A. R. Hoare",
  title =        "Proof of correctness of data representations",
  crossref =     "Bauer:1976:LHI",
  pages =        "183--193",
  year =         "1976",
  bibdate =      "Thu Aug 04 17:20:15 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1976:PPA,
  author =       "C. A. R. Hoare",
  title =        "Parallel programming: An axiomatic approach",
  crossref =     "Bauer:1976:LHI",
  pages =        "11--42",
  year =         "1976",
  bibdate =      "Thu Aug 04 17:20:15 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1976:SOS,
  author =       "C. A. R. Hoare",
  title =        "The structure of an operating system",
  crossref =     "Bauer:1976:LHI",
  pages =        "242--265",
  year =         "1976",
  bibdate =      "Sat Jul 30 10:39:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1976:SPI,
  author =       "C. A. R. Hoare",
  title =        "Structured programming in introductory programming
                 courses",
  crossref =     "Bates:1976:SPI",
  pages =        "255--263",
  year =         "1976",
  bibdate =      "Sat Jul 30 10:40:18 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Kaubisch:1976:QP,
  author =       "W. H. Kaubisch and R. H. Perrott and C. A. R. Hoare",
  title =        "Quasiparallel Programming",
  journal =      j-SPE,
  volume =       "6",
  number =       "3",
  pages =        "341--356",
  month =        jul # "\slash " # sep,
  year =         "1976",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380060307",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/spe.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
}

@Article{Hoare:1977:BR,
  author =       "C. A. R. Hoare",
  title =        "Book Review",
  journal =      j-COMP-J,
  volume =       "20",
  number =       "2",
  pages =        "180--180",
  month =        "????",
  year =         "1977",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/20.2.180-a",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:59 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/20/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/20/2/180.2.full.pdf+html",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@InProceedings{Hoare:1977:I,
  author =       "C. A. R. Hoare",
  editor =       "R. H. Perrott",
  booktitle =    "Software Engineering --- Proceedings of a Symposium
                 held at the {Queen's University of Belfast} 1976",
  title =        "Introduction",
  volume =       "14",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "7--14",
  year =         "1977",
  bibdate =      "Sat Jul 30 10:41:45 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "A P I C Studies in Data Processing",
  acknowledgement = ack-nhfb,
}

@Article{Macnaghten:1977:FFT,
  author =       "A. M. Macnaghten and C. A. R. Hoare",
  title =        "Fast {Fourier} Transform Free from Tears",
  journal =      j-COMP-J,
  volume =       "20",
  number =       "1",
  pages =        "78--83",
  month =        feb,
  year =         "1977",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/20.1.78",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:47:59 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/20/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/20/1/78.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/78.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/79.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/80.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/81.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/82.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_01/tiff/83.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  classification = "723; 921",
  corpsource =   "Dept. of Computer Sci., Queen's Univ. Belfast,
                 Belfast, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algorithm; computer programming --- Subroutines;
                 descriptions; fast Fourier transform; fast Fourier
                 transforms; mathematical transformations; reasoning;
                 simplicity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Welsh:1977:AIP,
  author =       "J. Welsh and W. J. Sneeringer and C. A. R. Hoare",
  title =        "Ambiguities and Insecurities in {Pascal}",
  journal =      j-SPE,
  volume =       "7",
  number =       "6",
  pages =        "685--696",
  month =        nov # "\slash " # dec,
  year =         "1977",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380070604",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 http://www.math.utah.edu/pub/tex/bib/spe.bib",
  note =         "See also
                 \cite{Kernighan:1981:WPM,Kernighan:1984:WPM}.",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
}

@InProceedings{Francez:1978:SNC,
  author =       "Nissim Francez and C. A. R. Hoare and Willem P. de
                 Roever",
  booktitle =    "Mathematical foundations of computer science, 1978
                 ({Proc. Seventh Sympos., Zakopane, 1978})",
  title =        "Semantics of nondeterminism, concurrency and
                 communication",
  volume =       "64",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "191--200",
  year =         "1978",
  MRclass =      "68B10",
  MRnumber =     "519838",
  MRreviewer =   "David B. Benson",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1978:CCS,
  author =       "C. A. R. Hoare",
  title =        "Corrigendum: {``Communicating Sequential
                 Processes''}",
  journal =      j-CACM,
  volume =       "21",
  number =       "11",
  pages =        "958--958",
  month =        nov,
  year =         "1978",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Jan 18 15:39:32 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "See \cite{Hoare:1978:CSPb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@InProceedings{Hoare:1978:CSPa,
  author =       "C. A. R. Hoare",
  editor =       "B. Shaw",
  booktitle =    "{Digital Systems Design. Proceedings of the Joint IBM
                 University of Newcastle upon Tyne Seminar, 6--9
                 September 1977}",
  title =        "Communicating sequential processes",
  publisher =    "Newcastle University",
  address =      "Newcastle upon Tyne, UK",
  pages =        "145--56",
  year =         "1978",
  bibdate =      "Sat Jul 30 10:45:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1978:CSPb,
  author =       "C. A. R. Hoare",
  title =        "Communicating Sequential Processes",
  journal =      j-CACM,
  volume =       "21",
  number =       "8",
  pages =        "666--677",
  month =        aug,
  year =         "1978",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/359576.359585",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:50:24 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Hoare78;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "See corrigendum \cite{Hoare:1978:CCS}.",
  abstract =     "This paper suggests that input and output are basic
                 primitives of programming and that parallel composition
                 of communicating sequential processes is a fundamental
                 program structuring method. When combined with a
                 development of Dijkstra's guarded command, these
                 concepts are surprisingly versatile. \par concepts are
                 surprisingly versatile. \par

                 Their use is illustrated by sample solutions of a
                 variety of familiar programming exercises.",
  acknowledgement = ack-nhfb,
  annote =       "This paper is now expanded into an excellent book
                 detailed by Hoare and published by Prentice-Hall. This
                 paper is reproduced in Kuhn and Padua's (1981, IEEE)
                 survey ``Tutorial on Parallel Processing.'' Reproduced
                 in ``Distributed Computing: Concepts and
                 Implementations'' edited by McEntire, O'Reilly and
                 Larson, IEEE, 1984. Somewhat dated.",
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723",
  corpsource =   "Queen's Univ., Belfast, UK",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
  journalabr =   "Commun ACM",
  keywords =     "4.22; 4.32 maeder biblio: synchronisation and
                 concurrency in processes; ak; bhibbard grecommended91;
                 classes; computer programming; concurrency; conditional
                 critical regions; coroutines; CR categories: 4.20; CSP;
                 data representations; Dijkstra's guarded command;
                 guarded commands; hcc; input; iterative arrays;
                 k-concurrency; k-csp; k-guarded-commands; monitors;
                 multiple entries; multiple exits; nondeterminacy;
                 output; parallel composition; parallel programming;
                 primitives; procedures; program; program structures;
                 programming; Programming; programming languages;
                 programming primitives; recursion; sequential
                 processes; structured programming; structuring method",
  oldlabel =     "Hoare78",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare78",
}

@InCollection{Hoare:1978:ESS,
  author =       "C. A. R. Hoare",
  booktitle =    "Programming Methodology",
  title =        "The Engineering of Software: a Startling
                 Contradiction",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "37--41",
  year =         "1978",
  DOI =          "https://doi.org/10.1007/978-1-4612-6315-9_5",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1978:SEK,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "{3rd International Conference on Software Engineering,
                 Atlanta, GA., USA, 10--12 May}",
  title =        "Software engineering: a keynote address",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "1--4",
  year =         "1978",
  DOI =          "https://doi.org/10.5555/800099.803183",
  bibdate =      "Sat Jul 30 10:46:50 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/800099.803183",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1978:SPP,
  author =       "C. A. R. Hoare",
  title =        "Some Properties of Predicate Transformers",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "3",
  pages =        "461--480",
  month =        jul,
  year =         "1978",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322077.322088",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "68F05",
  MRnumber =     "498568",
  bibdate =      "Thu Oct 27 00:18:37 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Francez:1979:SNC,
  author =       "Nissim Francez and C. A. R. Hoare and Daniel J.
                 Lehmann and Willem P. de Roever",
  title =        "Semantics of nondeterminism, concurrency, and
                 communication",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "19",
  number =       "3",
  pages =        "290--308",
  month =        dec,
  year =         "1979",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(79)90006-0",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  MRclass =      "68F20 (68B10)",
  MRnumber =     "556606",
  bibdate =      "Tue Jan 29 15:25:41 MST 2019",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000079900060",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Hoare:1979:CGW,
  author =       "A. H. M. Hoare",
  title =        "Coinitial graphs and {Whitehead} automorphisms",
  journal =      j-CAN-J-MATH,
  volume =       "31",
  number =       "??",
  pages =        "112--123",
  month =        "????",
  year =         "1979",
  CODEN =        "CJMAAB",
  DOI =          "https://doi.org/10.4153/CJM-1979-012-x",
  ISSN =         "0008-414X (print), 1496-4279 (electronic)",
  ISSN-L =       "0008-414X",
  bibdate =      "Sat Sep 10 15:38:52 MDT 2011",
  bibsource =    "http://cms.math.ca/cjm/v31/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/canjmath1970.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Canadian Journal of Mathematics = Journal canadien de
                 math{\'e}matiques",
  journal-URL =  "http://cms.math.ca/cjm/",
}

@Article{Hoare:1980:HP,
  author =       "C. A. R. Hoare",
  title =        "{Hoare} on programming",
  journal =      "Computer World UK",
  volume =       "??",
  number =       "??",
  pages =        "??--???",
  month =        "????",
  year =         "1980",
  bibdate =      "Sat Jul 30 10:48:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Text of an interview",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1980:MCSa,
  author =       "C. A. R. Hoare",
  title =        "A model for communicating sequential processes",
  type =         "Working paper",
  number =       "80-1",
  institution =  "Wollongong University",
  address =      "Wollongong, NSW, Australia",
  pages =        "27 + 14 handwritten",
  year =         "1980",
  bibdate =      "Tue Aug 09 09:11:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://ro.uow.edu.au/compsciwp/14",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1980:MCSb,
  author =       "C. A. R. Hoare",
  editor =       "R. M. McKeag and A. M. MacNaghten",
  booktitle =    "On the Construction of Programs",
  title =        "A model for communicating sequential processes",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "229--254",
  year =         "1980",
  bibdate =      "Sat Jul 30 10:49:18 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  xxeditor =     "R. M. McKeag and A. M. MacNaughten",
}

@InCollection{Hoare:1980:SPP,
  author =       "C. A. R. Hoare",
  editor =       "F. K. Hanna",
  booktitle =    "Advanced Techniques for Microprocessor Systems",
  title =        "Synchronisation of parallel processes",
  publisher =    "Peter Peregrinus",
  address =      "????",
  pages =        "108--111",
  year =         "1980",
  bibdate =      "Sat Jul 30 10:51:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1980:TND,
  author =       "C. A. R. Hoare and J. R. Kennaway",
  editor =       "????",
  booktitle =    "Proceedings ICALP '80",
  title =        "A theory of non-determinism",
  volume =       "85",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "338--350",
  year =         "1980",
  DOI =          "https://doi.org/10.1007/3-540-10003-2_82",
  bibdate =      "Sat Jul 30 10:52:15 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Kennaway:1980:TN,
  author =       "J. R. Kennaway and C. A. R. Hoare",
  booktitle =    "Automata, languages and programming ({Proc. Seventh
                 Internat. Colloq., Noordwijkerhout, 1980})",
  title =        "A theory of nondeterminism",
  volume =       "85",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "338--350",
  year =         "1980",
  DOI =          "https://doi.org/10.1007/3-540-10003-2_82",
  MRclass =      "68C01 (68D25)",
  MRnumber =     "589015",
  MRreviewer =   "Siegmar Gerber",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1981:CTCa,
  author =       "C. A. R. Hoare",
  title =        "A calculus of total correctness for communicating
                 processes",
  type =         "Technical monograph",
  number =       "PRG-23",
  institution =  "Oxford University. Computing Laboratory. Programming
                 Research Group",
  address =      "Oxford, UK",
  pages =        "??",
  year =         "1981",
  bibdate =      "Wed Aug 10 16:43:03 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1981:CTCb,
  author =       "C. A. R. Hoare",
  title =        "A Calculus of Total Correctness for Communicating
                 Processes",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "1",
  number =       "1--2",
  pages =        "49--72",
  month =        oct,
  year =         "1981",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1016/0167-6423(81)90005-8",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68B05",
  MRnumber =     "83d:68008 (644620)",
  bibdate =      "Sun Oct 10 08:24:00 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423",
}

@Article{Hoare:1981:EOC,
  author =       "Charles Antony Richard Hoare",
  title =        "The {Emperor}'s Old Clothes",
  journal =      j-CACM,
  volume =       "24",
  number =       "2",
  pages =        "75--83",
  year =         "1981",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/358549.358561",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:50:25 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm24.html#Hoare81;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  note =         "This is the 1980 ACM Turing Award Lecture, delivered
                 at ACM'80, Nashville, Tennessee, October 27, 1980.",
  URL =          "https://www.cs.fsu.edu/~engelen/courses/COP4610/hoare.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  oldlabel =     "Hoare81",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare81",
}

@TechReport{Hoare:1981:MCS,
  author =       "C. A. R. Hoare",
  title =        "A model for communicating sequential processes",
  type =         "Technical Report",
  number =       "PRG-22",
  institution =  "Programming Research Group, Oxford University",
  address =      "Oxford, UK",
  pages =        "iv + 28",
  month =        jun,
  year =         "1981",
  bibdate =      "Tue Aug 09 10:52:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/publications/publication3766-abstract.html",
  abstract =     "A previous paper (Hoare, 1978b) has suggested that
                 parallel composition and communication should be
                 accepted as primitive concepts in programming. This
                 paper supports the suggestion by giving a simplified
                 mathematical model for processes, using traces (Hoare,
                 1978a) of the possible interactions between a process
                 and its environment.",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1981:P,
  author =       "C. A. R. Hoare",
  title =        "Professionalism",
  journal =      j-COMPUT-BULL,
  volume =       "2",
  number =       "29",
  pages =        "2--4",
  month =        "????",
  year =         "1981",
  CODEN =        "COBUAH",
  ISSN =         "0010-4531 (print), 1464-357X (electronic)",
  ISSN-L =       "0010-4531",
  bibdate =      "Sat Jul 30 10:54:34 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Invited Talk given at BCS 81.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Bulletin",
}

@TechReport{Hoare:1981:PCC,
  author =       "C. A. R. Hoare and Chaochen Zhou",
  title =        "Partial Correctness of Communicating Processes and
                 Protocols",
  type =         "Technical Report",
  number =       "PRG 20",
  institution =  "Programming Research Group, Oxford University
                 Computing Laboratory",
  address =      "Oxford, UK",
  pages =        "ii + 23",
  month =        may,
  year =         "1981",
  bibdate =      "Tue Aug 09 10:55:57 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://www.cs.ox.ac.uk/files/3241/PRG20.pdf",
  abstract =     "This monograph contains two closely related papers.
                 The first was presented at the Second International
                 COQference on Distributed Computing Systems in Paris on
                 8th April, 1981. The second was presented at the
                 INWG/NPL Workshop on Protocol testing --- towards
                 proofs? at Teddington on 28th May, 1981.",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1981:TMB,
  author =       "C. A. R. Hoare",
  title =        "Is there a mathematical basis for computer
                 programming?",
  journal =      j-NAG-NEWSLETTER,
  volume =       "2",
  pages =        "6--15",
  year =         "1981",
  CODEN =        "????",
  ISSN =         "0269-0780",
  ISSN-L =       "0269-0780",
  bibdate =      "Sat Jul 30 10:53:55 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "NAG Newsletter",
}

@InProceedings{Zhou:1981:PCC,
  author =       "Chaochen Zhou and C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Proceedings of {2nd International Conference on
                 Distributed Computing Systems}",
  title =        "Partial correctness of communicating sequential
                 processes",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "1--12",
  year =         "1981",
  bibdate =      "Sat Jul 30 10:55:27 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1982:CCT,
  author =       "C. A. R. Hoare and C. C. Zhou",
  title =        "The consistency of the calculus of total correctness
                 for communicating processes",
  type =         "Technical Monograph",
  number =       "PRG-26",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  month =        feb,
  year =         "1982",
  bibdate =      "Sat Jul 30 11:01:56 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/3292/PRG26.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1982:SOS,
  author =       "C. A. R. Hoare and R. M. McKeag",
  editor =       "M. Broy and G. Schmidt",
  booktitle =    "Theoretical Foundations of Programming Methodology --
                 Lecture Notes of an {International Summer School,
                 Germany, 1981}",
  title =        "Structure of an Operating System",
  publisher =    pub-REIDEL,
  address =      pub-REIDEL:adr,
  pages =        "643--658",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-94-009-7893-5_18",
  bibdate =      "Sat Jul 30 10:58:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1982:SPI,
  author =       "C. A. R. Hoare",
  title =        "Specifications, programs and implementations",
  type =         "Technical Monograph",
  number =       "PRG-29",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  pages =        "iv + 29",
  month =        jun,
  year =         "1982",
  bibdate =      "Sat Jul 30 10:57:31 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/3295/PRG29.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1982:VTO,
  author =       "C. A. R. Hoare",
  title =        "Variations on a Theme: an Open Letter to {C. A. R.
                 Hoare}",
  crossref =     "Dijkstra:1982:SWC",
  pages =        "132--140",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-1-4612-5695-3_23",
  bibdate =      "Thu Mar 12 14:08:07 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-1-4612-5695-3_23",
  acknowledgement = ack-nhfb,
}

@InCollection{Kaubisch:1982:DES,
  author =       "W. H. Kaubisch and C. A. R. Hoareo",
  editor =       "M. Broy and G. Schmidt",
  booktitle =    "Theoretical Foundations of Programming Methodology --
                 Lecture Notes of an {International Summer School,
                 Germany, 1981}",
  title =        "Discrete Event Simulation Based on Communicating
                 Sequential Processes",
  publisher =    pub-REIDEL,
  address =      pub-REIDEL:adr,
  pages =        "625--642",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-94-009-7893-5_17",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hehner:1983:MCM,
  author =       "E. C. R. Hehner and C. A. R. Hoare",
  title =        "A more complete model of communicating processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "26",
  number =       "1--2",
  pages =        "105--120",
  month =        sep,
  year =         "1983",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(83)90081-6",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  MRclass =      "68Q60 (68Q10)",
  MRnumber =     "726914",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Computer Systems Res. Group, Univ. of Toronto,
                 Toronto, Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "communicating processes; complete model; partial
                 recursive functions; programming theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1983:ABC,
  author =       "C. A. R. Hoare",
  title =        "An Axiomatic Basis for Computer Programming
                 (Reprint)",
  journal =      j-CACM,
  volume =       "26",
  number =       "1",
  pages =        "53--56",
  month =        jan,
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 27 13:09:18 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "Reprint of \cite{Hoare:1969:ABC}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:1983:CSP,
  author =       "C. A. R. Hoare",
  title =        "{Communicating Sequential Processes} (Reprint)",
  journal =      j-CACM,
  volume =       "26",
  number =       "1",
  pages =        "100--106",
  year =         "1983",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:50:27 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm26.html#Hoare83a;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "Reprint of \cite{Hoare:1978:CSPb}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "Communicating Sequential Processes (CSP)",
  oldlabel =     "Hoare83a",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Hoare83a",
}

@TechReport{Hoare:1983:NCS,
  author =       "C. A. R. Hoare",
  title =        "Notes on communicating sequential processes",
  type =         "Technical Monograph",
  number =       "PRG-33",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  pages =        "ii + 23",
  month =        aug,
  year =         "1983",
  bibdate =      "Sat Jul 30 11:06:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/3301/PRG33.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1983:PEP,
  author =       "C. A. R. Hoare",
  editor =       "P. J. L. Wallis",
  booktitle =    "State of the Art Report 11, No 3: Software
                 Engineering",
  title =        "Programming is an engineering profession",
  publisher =    "Pergamon/Infotech",
  address =      "????",
  pages =        "77--84",
  year =         "1983",
  bibdate =      "Sat Jul 30 11:08:04 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Oxford Technical Monograph PRG-27",
  URL =          "http://www.cs.ox.ac.uk/files/3293/PRG27.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1983:TF,
  author =       "C. A. R. Hoare",
  title =        "1983 technology forecast",
  journal =      j-ELECTRONIC-DESIGN,
  volume =       "??",
  number =       "??",
  pages =        "??--??",
  month =        jan,
  year =         "1983",
  CODEN =        "ELODAW",
  ISSN =         "0013-4872 (print), 1944-9550 (electronic)",
  ISSN-L =       "0013-4872",
  bibdate =      "Sat Jul 30 11:05:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Design",
}

@InProceedings{Olderog:1983:SOS,
  author =       "Ernest-R{\"u}diger Olderog and C. A. R. Hoare",
  editor =       "J. Diaz",
  booktitle =    "Automata, Languages and Programming --- Proceedings of
                 the {10th International Colloquium, Barcelona July
                 18--22}",
  title =        "Specification-oriented semantics for communicating
                 processes",
  volume =       "154",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "561--572",
  year =         "1983",
  DOI =          "https://doi.org/10.1007/BFb0036937",
  MRclass =      "68Q55 (03B70 68Q10 68Q60)",
  MRnumber =     "727683",
  MRreviewer =   "W. Damm",
  bibdate =      "Sat Jul 30 11:09:54 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Brookes:1984:TCS,
  author =       "S. D. Brookes and C. A. R. Hoare and A. W. Roscoe",
  title =        "A Theory of Communicating Sequential Processes",
  journal =      j-J-ACM,
  volume =       "31",
  number =       "3",
  pages =        "560--599",
  month =        jul,
  year =         "1984",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/828.833",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  MRclass =      "68Q10",
  MRnumber =     "819158",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/dbase.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A mathematical model for communicating sequential
                 processes is given, and a number of its interesting and
                 useful properties are stated and proved. The
                 possibilities of nondeterminism are fully taken into
                 account.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Carnegie-Mellon Univ, Dep of Computer Science,
                 Pittsburgh, PA, USA",
  classification = "723; 921",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "asynchrony; communicating sequential processes;
                 computer metatheory; computer programming languages;
                 deadlock; liveness; mathematical models;
                 nondeterminism; parallelism; pcalc equivalence binder
                 (csp); safety; synchrony; Theory; theory",
}

@InProceedings{Hoare:1984:PEP,
  author =       "C. A. R. Hoare and A. W. Roscoe",
  editor =       "????",
  booktitle =    "Proceedings of the International Conference on Fifth
                 Generation Computer Systems, November 6--9 1984, Tokyo,
                 Japan",
  title =        "Programs as executable predicates",
  publisher =    "Institute for New Generation Computer Technology",
  address =      "Tokyo, Japan",
  pages =        "220--228",
  year =         "1984",
  bibdate =      "Sat Jul 30 11:11:56 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  xxaddress =    "????",
  xxpublisher =  "ICOT",
}

@Article{Hoare:1984:PP,
  author =       "C. A. R. Hoare",
  title =        "Programs are predicates",
  journal =      j-PHILOS-TRANS-R-SOC-LOND-SER-A,
  volume =       "312",
  number =       "1522",
  pages =        "475--489",
  year =         "1984",
  CODEN =        "PTRMAD, PTMSFB",
  DOI =          "https://doi.org/10.1098/rsta.1984.0071",
  ISSN =         "0080-4614",
  ISSN-L =       "1364-503X",
  MRclass =      "68Q10 (03B70 68Q55)",
  MRnumber =     "776270",
  MRreviewer =   "T. M{\"{u}}ldner",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "With discussion, Mathematical logic and programming
                 languages",
  acknowledgement = ack-nhfb,
  fjournal =     "Philosophical Transactions of the Royal Society of
                 London. Series A. Mathematical and Physical Sciences",
  journal-URL =  "http://rsta.royalsocietypublishing.org/",
}

@Article{Hoare:1984:PSS,
  author =       "C. A. R. Hoare",
  title =        "Programming: Sorcery or Science?",
  journal =      j-IEEE-SOFTWARE,
  volume =       "1",
  number =       "2",
  pages =        "5--12, 15--16",
  month =        apr,
  year =         "1984",
  CODEN =        "IESOEG",
  DOI =          "https://doi.org/10.1109/ms.1984.234042",
  ISSN =         "0740-7459 (print), 1937-4194 (electronic)",
  ISSN-L =       "0740-7459",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/ieeesoft.bib",
  acknowledgement = ack-nhfb,
  classification = "723; 901",
  fjournal =     "IEEE Software",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=52",
  journalabr =   "IEEE Software",
  keywords =     "computer programming; engineering --- Professional
                 Aspects; information services",
}

@Article{Hoare:1985:CNP,
  author =       "C. A. R. Hoare",
  title =        "A couple of novelties in the propositional calculus",
  journal =      j-Z-MATH-LOGIK-GRUNDL-MATH,
  volume =       "31",
  number =       "2",
  pages =        "173--178",
  month =        "????",
  year =         "1985",
  CODEN =        "ZMLGAQ",
  DOI =          "https://doi.org/10.1002/malq.19850310905",
  ISSN =         "0044-3050",
  MRclass =      "03B05",
  MRnumber =     "786294",
  bibdate =      "Sat Jul 30 11:15:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Z. Math. Logik Grundlag. Math.",
  fjournal =     "{Zeitschrift f{\"u}r mathematische Logik und
                 Grundlagen der Mathematik}",
}

@InProceedings{Hoare:1985:MP,
  author =       "C. A. R. Hoare",
  booktitle =    "Foundations of software technology and theoretical
                 computer science ({New Delhi}, 1985)",
  title =        "The mathematics of programming",
  volume =       "206",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "1--18",
  year =         "1985",
  DOI =          "https://doi.org/10.1007/3-540-16042-6_1",
  MRclass =      "68N05 (68Q99)",
  MRnumber =     "827500",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "https://dl.acm.org/doi/10.5555/646823.706892",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1985:NCS,
  author =       "C. A. R. Hoare",
  editor =       "Manfred Broy",
  booktitle =    "Control Flow and Data Flow: Concepts of Distributed
                 Programming. Proceedings of {NATO Advanced Study
                 Institute International Summer School, Marktoberdorf,
                 31 July--12 August, 1984}",
  title =        "Notes on communicating sequential systems",
  volume =       "14",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "123--204",
  year =         "1985",
  MRclass =      "68Q10 (68Q55)",
  MRnumber =     "813088",
  MRreviewer =   "Ryszard Janicki",
  bibdate =      "Sat Jul 30 11:17:51 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci.",
  acknowledgement = ack-nhfb,
  xxtitle =      "Notes on communicating systems",
}

@InCollection{Hoare:1985:PP,
  author =       "C. A. R. Hoare",
  title =        "Programs are predicates",
  crossref =     "Hoare:1985:MLP",
  pages =        "141--155",
  year =         "1985",
  DOI =          "https://doi.org/10.5555/3721.3729",
  bibdate =      "Sat Jul 30 11:20:53 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/abs/10.5555/3721.3729",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1985:SSN,
  author =       "C. A. R. Hoare and C. C. Morgan",
  editor =       "B. T. Denvir and W. T. Harwood and M. I. Jackson",
  booktitle =    "{he Analysis of Concurrent Systems, Cambridge,
                 September 1983, Proceedings}",
  title =        "Specification of a simplified network service in
                 {CSP}",
  volume =       "207",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "345--353",
  year =         "1985",
  DOI =          "https://doi.org/10.5555/647694.731194",
  bibdate =      "Sat Jul 30 11:21:51 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "https://dl.acm.org/doi/10.5555/647694.731194",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1985:WP,
  author =       "C. A. R. Hoare and Jifeng He",
  title =        "Weakest Prespecification",
  type =         "Technical Monograph",
  number =       "PRG-44",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  pages =        "iii + 60",
  month =        jun,
  year =         "1985",
  bibdate =      "Tue Aug 09 11:14:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/3320/PRG44.pdf",
  abstract =     "For, aside from the fact that the concepts occurring
                 in this calculus possess an objective importance and
                 ere in these times almost indispensable in any
                 scientific discussion, the calculus of relations has an
                 intrinsic charm and beauty which makes it a source of
                 intellectual delight to all who become acquainted with
                 it. Alfred Tarski [6j",
  acknowledgement = ack-nhfb,
}

@TechReport{Sridhar:1985:JEC,
  author =       "K. T. Sridhar and C. A. R. Hoare",
  title =        "{JSD} expressed in {CSP}",
  type =         "Technical monograph",
  number =       "PRG-51",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  pages =        "40",
  year =         "1985",
  bibdate =      "Wed Aug 10 17:14:12 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{He:1986:DRR,
  author =       "J. He and C. A. R. Hoare and J. W. Sanders",
  booktitle =    "{ESOP} 86",
  title =        "Data refinement refined resume",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "187--196",
  year =         "1986",
  DOI =          "https://doi.org/10.1007/3-540-16442-1_14",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1986:MAS,
  author =       "C. A. R. Hoare",
  title =        "Maths add safety to computer programs",
  journal =      j-NEW-SCIENTIST,
  volume =       "??",
  number =       "1526",
  pages =        "53--59",
  month =        "????",
  year =         "1986",
  CODEN =        "NWSCAL",
  ISSN =         "0262-4079 (print), 1364-8500 (electronic)",
  ISSN-L =       "0262-4079",
  bibdate =      "Tue Aug 09 11:19:45 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "New Scientist",
  journal-URL =  "http://www.sciencedirect.com/science/journal/02624079",
  remark =       "Volumes before 191 (2006) are missing from publisher
                 Web site.",
}

@Article{Hoare:1986:MP,
  author =       "C. A. R. Hoare",
  title =        "Mathematics of Programming",
  journal =      j-BYTE,
  volume =       "10",
  number =       "8",
  pages =        "115--149",
  month =        aug,
  year =         "1986",
  CODEN =        "BYTEDJ",
  ISSN =         "0360-5280 (print), 1082-7838 (electronic)",
  ISSN-L =       "0360-5280",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "/usr/local/src/bib/bibliography/Misc/IMMD_IV.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/byte1980.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "BYTE Magazine",
  keywords =     "Verification",
}

@InCollection{Hoare:1986:NCS,
  author =       "C. A. R. Hoare",
  editor =       "Manfred Broy",
  booktitle =    "Control Flow and Data Flow: Concepts of Distributed
                 Programming: Concepts of Distributed Programming.
                 Proceedings of {NATO Advanced Study Institute
                 International Summer School, Marktoberdorf, 31 July--12
                 August 1984}",
  title =        "Notes on Communicating Sequential Systems",
  volume =       "14",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "123--204",
  year =         "1986",
  DOI =          "https://doi.org/10.1007/978-3-642-82921-5_4",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Springer Study Edition",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1986:P,
  author =       "C. A. R. Hoare",
  title =        "Preface",
  journal =      j-DISTRIB-COMPUT,
  volume =       "1",
  number =       "1",
  pages =        "1--1",
  month =        mar,
  year =         "1986",
  CODEN =        "DICOEB",
  DOI =          "https://doi.org/10.1007/BF01843564",
  ISSN =         "0178-2770 (print), 1432-0452 (electronic)",
  ISSN-L =       "0178-2770",
  bibdate =      "Mon Aug 1 08:49:02 MDT 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/distribcomput.bib",
  URL =          "https://link.springer.com/article/10.1007/BF01843564",
  acknowledgement = ack-nhfb,
  ajournal =     "Distrib. comput.",
  fjournal =     "Distributed Computing",
  journal-URL =  "https://link.springer.com/journal/446",
}

@Article{Hoare:1986:WPa,
  author =       "C. A. R. Hoare and Jifeng He",
  title =        "The weakest prespecification. {I}",
  journal =      j-FUND-INFO,
  volume =       "9",
  number =       "1",
  pages =        "51--84",
  month =        mar,
  year =         "1986",
  CODEN =        "FUMAAJ",
  ISSN =         "0169-2968 (print), 1875-8681 (electronic)",
  ISSN-L =       "0169-2968",
  MRclass =      "68Q99 (68N05)",
  MRnumber =     "848211",
  MRreviewer =   "Bernhard Josko",
  bibdate =      "Sat Jul 30 11:28:21 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Fundamenta Informaticae",
  journal-URL =  "http://content.iospress.com/journals/fundamenta-informaticae",
  xxfjournal =   "Roczniki Polskiego Towarzystwa Matematycznego. Seria
                 IV. Fundamenta Informaticae",
}

@Article{Hoare:1986:WPb,
  author =       "C. A. R. Hoare and Jifeng He",
  title =        "The weakest prespecification. {II}",
  journal =      j-FUND-INFO,
  volume =       "9",
  number =       "2",
  pages =        "217--252",
  month =        "????",
  year =         "1986",
  CODEN =        "FUMAAJ",
  ISSN =         "0169-2968 (print), 1875-8681 (electronic)",
  ISSN-L =       "0169-2968",
  MRclass =      "68Q99 (68N05)",
  MRnumber =     "848217",
  MRreviewer =   "Bernhard Josko",
  bibdate =      "Sat Jul 30 11:28:21 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Fundamenta Informaticae",
  journal-URL =  "http://content.iospress.com/journals/fundamenta-informaticae",
  xxfjournal =   "Roczniki Polskiego Towarzystwa Matematycznego. Seria
                 IV. Fundamenta Informaticae",
  xxpages =      "217--251",
}

@Article{Olderog:1986:SOS,
  author =       "Ernst-R{\"u}diger R. Olderog and C. A. R. Hoare",
  title =        "Specification-Oriented Semantics for Communicating
                 Processes",
  journal =      j-ACTA-INFO,
  volume =       "23",
  number =       "1",
  pages =        "9--66",
  month =        mar,
  year =         "1986",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/BF00268075",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68N05 (68N25 68Q10 68Q55)",
  MRnumber =     "87j:68018 (845623)",
  MRreviewer =   "Manfred Broy",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  keywords =     "CCS; concurrent; CSP; parallel; pcalc safety
                 binder(csp); semantics; specification",
}

@TechReport{Roscoe:1986:LOP,
  author =       "A. W. Roscoe and C. A. R. Hoare",
  title =        "Laws of occam programming",
  type =         "Technical Monograph",
  number =       "PRG-53",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  month =        feb,
  year =         "1986",
  bibdate =      "Sat Jul 30 11:06:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Enikeev:1987:MTC,
  author =       "A. I. Enikeev and C. A. R. Hoare and A. Teruel",
  title =        "Model of a theory of communicating sequential
                 processes for menu-dialog systems",
  journal =      "Mathematica",
  volume =       "3",
  number =       "??",
  pages =        "??--??",
  month =        "????",
  year =         "1987",
  bibdate =      "Sat Jul 30 11:31:23 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  language =     "Russian",
}

@Article{He:1987:ASP,
  author =       "Jifeng He and C. A. R. Hoare",
  title =        "Algebraic specification and proof of a distributed
                 recovery algorithm",
  journal =      j-DISTRIB-COMPUT,
  volume =       "2",
  number =       "1",
  pages =        "1--12",
  month =        mar,
  year =         "1987",
  CODEN =        "DICOEB",
  DOI =          "https://doi.org/10.1007/BF01786251",
  ISSN =         "0178-2770 (print), 1432-0452 (electronic)",
  ISSN-L =       "0178-2770",
  bibdate =      "Sat Jul 30 11:32:23 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/distribcomput.bib",
  URL =          "https://link.springer.com/article/10.1007/BF01786251",
  acknowledgement = ack-nhfb,
  ajournal =     "Distrib. comput.",
  fjournal =     "Distributed Computing",
  journal-URL =  "https://link.springer.com/journal/446",
}

@InProceedings{Hoare:1987:ASP,
  author =       "C. A. R. Hoare",
  editor =       "Manfred Broy",
  booktitle =    "Logic of programming and calculi of discrete design
                 ({Marktoberdorf}, 1986)",
  title =        "Algebraic Specifications and Proofs for Communicating
                 Sequential Processes",
  volume =       "36",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "277--301",
  year =         "1987",
  DOI =          "https://doi.org/10.1007/978-3-642-87374-4_11",
  MRclass =      "68Q10 (03B70)",
  MRnumber =     "922515",
  MRreviewer =   "T. M{\"{u}}ldner",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci.",
  acknowledgement = ack-nhfb,
  xxpages =      "277--300",
}

@Article{Hoare:1987:CLP,
  author =       "C. A. R. Hoare and I. J. Hayes and Jifeng He and C. C.
                 Morgan and A. W. Roscoe and J. W. Sanders and I. H.
                 Sorensen and J. M. Spivey and B. A. Sufrin",
  title =        "Corrigenda: {``Laws of programming'' [Comm. ACM {\bf
                 30} (1987), no. 8, 672--686]}",
  journal =      j-CACM,
  volume =       "30",
  number =       "9",
  pages =        "770--770",
  month =        sep,
  year =         "1987",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/30401.30407",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68N05",
  MRnumber =     "904 132",
  bibdate =      "Tue Dec 26 13:35:07 1995",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "See \cite{Hoare:1987:LP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/30407.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "languages",
  subject =      "{\bf D.2.0}: Software, SOFTWARE ENGINEERING,
                 General.",
}

@InProceedings{Hoare:1987:DPM,
  author =       "C. A. R. Hoare and J. He",
  editor =       "O. Friesen and F. Golshani",
  booktitle =    "{6th Annual International Phoenix Conference on
                 Computers and Communications --- Conference Proceedings
                 Scottsdale, AZ, USA 25--27 February, 1987}",
  title =        "Design and proof of a mail service",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "272--275",
  year =         "1987",
  DOI =          "https://doi.org/10.5555/107155.107170",
  bibdate =      "Sat Jul 30 14:27:00 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/107155.107170",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1987:EOC,
  author =       "Charles Antony Richard Hoare",
  title =        "The emperor's old clothes",
  crossref =     "Ashenhurst:1987:ATA",
  pages =        "143--161",
  year =         "1987",
  DOI =          "https://doi.org/10.1145/1283920.1283936",
  bibdate =      "Tue Jun 21 11:01:04 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib",
  note =         "ACM Turing Award lecture.",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1987:LP,
  author =       "C. A. R. Hoare and I. J. Hayes and Jifeng He and C. C.
                 Morgan and A. W. Roscoe and J. W. Sanders and I. H.
                 S{\o}rensen and J. M. Spivey and B. A. Sufrin",
  title =        "Laws of programming",
  journal =      j-CACM,
  volume =       "30",
  number =       "8",
  pages =        "672--686",
  month =        aug,
  year =         "1987",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/27651.27653",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68N05",
  MRnumber =     "899 396",
  bibdate =      "Sat Apr 06 08:06:23 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/math.prog.construction.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/procos-wg.bib;
                 http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "See corrigendum \cite{Hoare:1987:CLP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/27653.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "design; languages; theory; verification",
  subject =      "{\bf D.1.4}: Software, PROGRAMMING TECHNIQUES,
                 Sequential Programming. {\bf D.3.1}: Software,
                 PROGRAMMING LANGUAGES, Formal Definitions and Theory,
                 Semantics. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Optimization. {\bf F.1.2}:
                 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Modes of Computation. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Pre- and post-conditions. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Specification techniques. {\bf F.3.2}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
                 of Programming Languages, Algebraic approaches to
                 semantics. {\bf I.2.2}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Automatic Programming, Program
                 transformation.",
}

@Article{Hoare:1987:OSF,
  author =       "C. A. R. Hoare",
  title =        "An Overview of Some Formal Methods for Program
                 Design",
  journal =      j-COMPUTER,
  volume =       "20",
  number =       "9",
  pages =        "85--91",
  month =        sep,
  year =         "1987",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.1987.1663697",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Sat Jul 30 14:20:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1980.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Hoare:1987:PDR,
  author =       "C. A. R. Hoare and Jifeng He and J. W. Sanders",
  title =        "Prespecification in data refinement",
  journal =      j-INFO-PROC-LETT,
  volume =       "25",
  number =       "2",
  pages =        "71--76",
  day =          "6",
  month =        may,
  year =         "1987",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(87)90224-9",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q65",
  MRnumber =     "88j:68115 (896148)",
  MRreviewer =   "A. V. An\={\i}s\={\i}mov",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Oxford Univ, Oxford, Engl",
  classification = "723; C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "computer metatheory --- Programming Theory; computer
                 programming; concrete data type; data refinement; data
                 structures; data type; nondeterministic procedural
                 programming language; postspecification;
                 prespecification; programming theory; set theory;
                 Theory; theory; verification; weakest specification",
  pubcountry =   "Netherlands A01",
  subject =      "D.3.3 Software, PROGRAMMING LANGUAGES, Language
                 Constructs, Abstract data types \\ D.3.3 Software,
                 PROGRAMMING LANGUAGES, Language Constructs, Data types
                 and structures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1987:WP,
  author =       "C. A. R. Hoare and Jifeng He",
  title =        "The weakest prespecification",
  journal =      j-INFO-PROC-LETT,
  volume =       "24",
  number =       "2",
  pages =        "127--132",
  day =          "30",
  month =        jan,
  year =         "1987",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(87)90106-2",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q99 (68N05)",
  MRnumber =     "88f:68118 (882642)",
  MRreviewer =   "Bernhard Josko",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Oxford Univ, Computing Lab, Oxford, Engl",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "algebraic properties of prespecification; calculus of
                 relations; computer metatheory; guarded command;
                 program components; program correctness; programming
                 language; programming theory; sequential composition;
                 specification; theory; weakest precondition; weakest
                 prespecification",
  pubcountry =   "Netherlands A11",
  subject =      "F.3.1 Theory of Computation, LOGICS AND MEANINGS OF
                 PROGRAMS, Specifying and Verifying and Reasoning about
                 Programs",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Hoare:1988:PCC,
  author =       "C. A. R. Hoare and M. J. C. Gordon",
  title =        "Partial correctness of {C-MOS} switching circuits: an
                 exercise in applied logic",
  crossref =     "IEEE:1988:ASL",
  pages =        "28--36",
  year =         "1988",
  DOI =          "https://doi.org/10.1109/lics.1988.5098",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Roscoe:1988:LOP,
  author =       "A. W. Roscoe and C. A. R. Hoare",
  title =        "The laws of occam programming",
  journal =      j-THEOR-COMP-SCI,
  volume =       "60",
  number =       "2",
  pages =        "177--229",
  month =        sep,
  year =         "1988",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(88)90049-7",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  MRclass =      "68Q10 (68N05 68Q55 68Q60)",
  MRnumber =     "963440",
  MRreviewer =   "W. Richard Stark",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6140D
                 (High level languages)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "algebraic laws; high level languages; normal form;
                 occam; occam programming; programming theory;
                 semantics; WHILE- free programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1989:FMC,
  author =       "C. A. R. Hoare",
  title =        "Formal methods in computer system design",
  journal =      j-COMP-PHYS-COMM,
  volume =       "57",
  number =       "1--3",
  pages =        "206--210",
  day =          "2",
  month =        dec,
  year =         "1989",
  CODEN =        "CPHCBZ",
  DOI =          "https://doi.org/10.1016/0010-4655(89)90213-0",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 10:28:30 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compphyscomm1980.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0010465589902130",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
}

@InProceedings{Hoare:1989:NAC,
  author =       "C. A. R. Hoare",
  editor =       "Manfred Broy",
  booktitle =    "Constructive methods in computing science
                 ({Marktoberdorf}, 1988)",
  title =        "Notes on an Approach to Category Theory for Computer
                 Scientists",
  volume =       "55",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "245--305",
  year =         "1989",
  DOI =          "https://doi.org/10.1007/978-3-642-74884-4_9",
  MRclass =      "68Q55 (18B20 68-01)",
  MRnumber =     "1035537",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci.",
  acknowledgement = ack-nhfb,
  xxpages =      "245--310",
}

@InProceedings{Hoare:1989:VPL,
  author =       "C. A. R. Hoare",
  editor =       "Josep D{\'\i}az and Fernando Orejas",
  booktitle =    "{TAPSOFT '89: Proceedings of the International Joint
                 Conference on Theory and Practice of Software
                 Development, Barcelona, Spain, March 13-17, 1989 Volume
                 1: Advanced Seminar on Foundations of Innovative
                 Software Development I and Colloquium on Trees in
                 Algebra and Programming (CAAP '89)}",
  title =        "The varieties of programming language",
  volume =       "351",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "1--18",
  year =         "1989",
  DOI =          "https://doi.org/10.1007/3-540-50939-9_121",
  MRclass =      "68Q55",
  MRnumber =     "1035021",
  bibdate =      "Sat Jul 30 14:31:57 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/content/pdf/10.1007/3-540-50939-9_121.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Josephs:1989:TAP,
  author =       "M. B. Josephs and C. A. R. Hoare and J. He",
  title =        "A theory of asynchronous processes",
  type =         "Technical Report",
  number =       "TR-6-89",
  institution =  "Oxford University Computing Laboratory",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  year =         "1989",
  bibdate =      "Sat Jul 30 11:06:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:1990:CSP,
  author =       "Jifeng He and C. A. R. Hoare",
  booktitle =    "Mathematical foundations of programming semantics
                 ({New Orleans}, {LA}, 1989)",
  title =        "Categorical semantics for programming languages",
  volume =       "442",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "402--417",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/BFb0040271",
  MRclass =      "68Q55 (18B99)",
  MRnumber =     "1076409",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@TechReport{He:1990:DRC,
  author =       "Jifeng He and C. A. R. Hoare",
  title =        "Data refinement in a categorical setting",
  type =         "Technical Monograph",
  number =       "PRG-90",
  institution =  "Oxford University Computing Laboratory, Programming
                 Research Group",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  pages =        "15",
  year =         "1990",
  ISBN =         "0-902928-68-6",
  ISBN-13 =      "978-0-902928-68-8",
  bibdate =      "Wed Aug 10 17:17:03 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{He:1990:TSA,
  author =       "J. He and C. A. R. Hoare and M. B. Josephs",
  editor =       "????",
  booktitle =    "Programming Concepts and Methods",
  title =        "A theory of synchrony and asynchrony",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "459--478",
  year =         "1990",
  bibdate =      "Sat Jul 30 14:36:01 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1990:AAV,
  author =       "C. A. R. Hoare and J. He and J. P. Bowen and P. K.
                 Pandya",
  editor =       "????",
  booktitle =    "{ESPRIT '90} Conference Proceedings",
  title =        "An algebraic approach to verifiable compiling
                 specification and prototyping of the {ProCoS} level 0
                 programming language",
  publisher =    pub-KLUWER,
  address =      pub-KLUWER:adr,
  pages =        "804--818",
  year =         "1990",
  bibdate =      "Sat Jul 30 14:47:09 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1990:CSP,
  author =       "C. A. R. Hoare and J. He",
  editor =       "????",
  booktitle =    "Mathematical Foundations of Programming Semantics",
  title =        "Categorical semantics for programming languages",
  volume =       "442",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "1990",
  bibdate =      "Sat Jul 30 14:40:28 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1990:DRC,
  author =       "C. A. R. Hoare",
  title =        "Data refinement in a categorical setting",
  type =         "Technical Monograph",
  number =       "PRG-90",
  institution =  "Oxford University Computing Laboratory",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  year =         "1990",
  bibdate =      "Sat Jul 30 11:06:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1990:FPI,
  author =       "C. A. R. Hoare",
  title =        "Fixed points of increasing functions",
  journal =      j-INFO-PROC-LETT,
  volume =       "34",
  number =       "3",
  pages =        "111--112",
  day =          "9",
  month =        apr,
  year =         "1990",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(90)90087-E",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "06A06 (68Q22)",
  MRnumber =     "1059973",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Computing Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Metatheory; Computer Programming--Theory;
                 Fixed Points; fixed points; functional composition;
                 Increasing Functions; increasing functions; Parallel
                 Composition; parallel composition; partial order;
                 Programming Theory; programming theory; Sequential
                 Composition",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Hoare:1990:LMM,
  author =       "C. A. R. Hoare",
  title =        "Let's make models: Keynote address",
  crossref =     "Baeten:1990:CTC",
  volume =       "458",
  pages =        "32--32",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/bfb0039049",
  bibdate =      "Sat Jul 30 14:38:53 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1990:MSS,
  author =       "C. A. R. Hoare and Chao Chen Zhou",
  editor =       "????",
  booktitle =    "Designing Correct Circuits",
  title =        "A model for synchronous switching circuits and its
                 theory of correctness",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "196--211",
  year =         "1990",
  bibdate =      "Sat Jul 30 14:52:45 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Hoare:1990:RAPa,
  author =       "C. A. R. Hoare and J. He",
  title =        "Refinement algebra proves correctness of compiling
                 specifications",
  type =         "Technical Report",
  number =       "TR-6-90",
  institution =  "Oxford University Computing Laboratory",
  address =      "Wolfson Building, Parks Road, Oxford, OX1 3QD, UK",
  year =         "1990",
  bibdate =      "Sat Jul 30 11:06:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1990:RAPb,
  author =       "C. A. R. Hoare and J. He",
  editor =       "????",
  booktitle =    "Lecture Notes of {International Summer School at
                 Markorbdorf, 1990}",
  title =        "Refinement algebra proves correctness of compiling
                 specifications: Keynote Address",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "??--??",
  year =         "1990",
  bibdate =      "Sat Jul 30 14:42:06 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Published in colloboration with the British Computer
                 Society, London.",
  acknowledgement = ack-nhfb,
  xxbooktitle =  "{BCS} Refinement Workshop, Workshops in Computing",
}

@InProceedings{Hoare:1990:TCC,
  author =       "C. A. R. Hoare",
  title =        "A theory of conjunction and concurrency",
  crossref =     "Rishe:1990:PIC",
  pages =        "304--309",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/parbse.1990.77155",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1990:TDC,
  author =       "C. A. R. Hoare",
  title =        "A theory for the derivation of {C-MOS} circuit
                 designs",
  crossref =     "Feijen:1990:BOB",
  chapter =      "22",
  pages =        "193--205",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/978-1-4612-4476-9_23",
  bibdate =      "Sun Mar 27 17:53:57 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Reprinted in \cite{Hoare:1991:TDCa}",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1991:ASP,
  author =       "C. A. R. Hoare",
  title =        "Algebraic specifications and proofs for communicating
                 sequential processes",
  crossref =     "Hoare:1991:DCC",
  pages =        "??--??",
  year =         "1991",
  bibdate =      "Wed Aug 10 08:23:00 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1991:DPM,
  author =       "C. A. R. Hoare and He Jifeng",
  title =        "Design and proof of a mail service",
  crossref =     "Hoare:1991:DCC",
  pages =        "??--??",
  year =         "1991",
  bibdate =      "Wed Aug 10 08:23:00 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1991:TCC,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Parallel Architectures ({Parbase '90})",
  title =        "A theory of conjunction and concurrency: Keynote
                 Address",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "18--27",
  year =         "1991",
  bibdate =      "Sat Jul 30 14:50:52 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1991:TDCa,
  author =       "C. A. R. Hoare",
  editor =       "D. Bj{\o}rner and V. Kotov",
  booktitle =    "Images of Programming: Dedicated to the Memory of {A.
                 P. Ershov}: Papers Collected Under the Auspices of
                 {IFIP TC2}",
  title =        "A theory for the derivation of combinational {C-MOS}
                 circuit designs",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  bookpages =    "x + 78 + 270",
  pages =        "??--??",
  year =         "1991",
  bibdate =      "Tue Aug 09 11:38:16 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1991:TDCb,
  author =       "C. A. R. Hoare",
  title =        "A theory for the derivation of combinational {C-MOS}
                 circuit designs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "90",
  number =       "1",
  pages =        "235--251",
  day =          "11",
  month =        nov,
  year =         "1991",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(91)90309-p",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  note =         "Reprint of \cite{Hoare:1990:TDC}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4230B (Combinatorial
                 switching theory)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "C-MOS; calculus of design; combinational switching
                 circuits; combinatorial circuits; formal logic;
                 propositional logic",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hoare:1991:TOP,
  author =       "C. A. R. Hoare",
  title =        "The Transputer and occam: a Personal Story",
  journal =      j-CPE,
  volume =       "3",
  number =       "4",
  pages =        "249--264",
  month =        aug,
  year =         "1991",
  CODEN =        "CPEXEI",
  DOI =          "https://doi.org/10.1002/cpe.4330030403",
  ISSN =         "1040-3108 (print), 1096-9128 (electronic)",
  ISSN-L =       "1040-3108",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cpe.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Concurrency, practice and experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1532-0634/issues",
}

@Article{Martin:1991:PAO,
  author =       "C. E. Martin and C. A. R. Hoare and Jifeng He",
  title =        "Pre-adjunctions in order enriched categories",
  journal =      "Mathematical Structures in Computer Science",
  volume =       "1",
  number =       "2",
  pages =        "141--158",
  month =        "????",
  year =         "1991",
  DOI =          "https://doi.org/10.1017/S0960129500001262",
  ISSN =         "0960-1295",
  MRclass =      "68Q55 (18D05 68Q60)",
  MRnumber =     "1132145",
  MRreviewer =   "V. Yu. Me\u{\i}tus",
  bibdate =      "Sat Jul 30 14:53:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Math. Structures Comput. Sci.",
  fjournal =     "Mathematical Structures in Computer Science. A Journal
                 in the Applications of Categorical, Algebraic and
                 Geometric Methods in Computer Science",
}

@Article{Zhou:1991:CD,
  author =       "Chaochen Zhou and C. A. R. Hoare and Anders P. Ravn",
  title =        "A calculus of durations",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "269--276",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(91)90122-X",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68T27",
  MRnumber =     "92i:68162 (1148468)",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "722; 723; 921; 922; C4180 (Integral equations);
                 C4210 (Formal logic); C6110B (Software engineering
                 techniques)",
  corpsource =   "Oxford Univ. Comput. Lab., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "calculus of durations; Computer Metatheory --- Binary
                 Sequences; Computer Programming --- Logic Programming;
                 Computer Software --- Software Engineering; Computer
                 Systems, Digital; duration integrals; gas burner;
                 integral equations; interval temporal logic; leakage;
                 Mathematical Models; Mathematical Techniques; Real Time
                 Operation; Real Time Systems; real-time systems;
                 reasoning; software engineering; Specification
                 Languages; Temporal Logic; temporal logic;
                 time-critical systems",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{Hoare:1992:LP,
  author =       "C. A. R. Hoare and I. J. Hayes and He Jifeng and C. C.
                 Morgan and A. W. Roscoe and J. W. Sanders and I. H.
                 Sorenson and J. M. Spivey and B. A. Sufrin",
  editor =       "Manfred Broy",
  booktitle =    "Programming and Mathematical Method",
  title =        "Laws of Programming",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "95--122",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/978-3-642-77572-7_7",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1992:RAP,
  author =       "C. A. R. Hoare and Jifeng He",
  editor =       "Manfred Broy",
  booktitle =    "Programming and mathematical method ({Marktoberdorf},
                 1990)",
  title =        "Refinement algebra proves correctness of compilation",
  volume =       "88",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "245--269",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/978-3-642-77572-7_12",
  MRclass =      "68Q60 (68N20)",
  MRnumber =     "1252699",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO ASI Series F: Computer and Systems Sciences",
  acknowledgement = ack-nhfb,
}

@Article{Zhou:1992:MSS,
  author =       "Chaochen Zhou and C. A. R. Hoare",
  title =        "A model for synchronous switching circuits and its
                 theory of correctness",
  journal =      j-FORM-METHODS-SYST-DES,
  volume =       "1",
  number =       "1",
  pages =        "7--28",
  month =        jul,
  year =         "1992",
  CODEN =        "FMSDE6",
  DOI =          "https://doi.org/10.1007/bf00464355",
  ISSN =         "0925-9856 (print), 1572-8102 (electronic)",
  ISSN-L =       "0925-9856",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Methods in System Design",
  journal-URL =  "https://dl.acm.org/loi/fmsd",
}

@Article{He:1993:AOS,
  author =       "Jifeng He and C. A. R. Hoare",
  title =        "From algebra to operational semantics",
  journal =      j-INFO-PROC-LETT,
  volume =       "45",
  number =       "2",
  pages =        "75--80",
  day =          "26",
  month =        feb,
  year =         "1993",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(93)90219-Y",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (68N05 68N15 68Q55)",
  MRnumber =     "94i:68182 (1209741)",
  MRreviewer =   "E. Ray Lucas",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ Computing Lab",
  affiliationaddress = "Oxford, Engl",
  classification = "721.1; 723.1.1; 921.1; C4210 (Formal logic)",
  corpsource =   "Comput. Lab., Oxford Univ., UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; algebraic reasoning; Algebraic semantics;
                 communicating sequential processes; Computer
                 programming languages; CSP; Dijkstra Language;
                 Dijkstra's language; formal languages; formal
                 semantics; inequation; Occam; operational semantics;
                 Operational semantics; programming language;
                 Programming language theory; transition relation;
                 transputer language",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hoare:1993:AMa,
  author =       "C. A. R. Hoare",
  title =        "Algebra and models",
  journal =      j-SIGSOFT,
  volume =       "18",
  number =       "5",
  pages =        "1--8",
  month =        dec,
  year =         "1993",
  CODEN =        "SFENDP",
  DOI =          "https://doi.org/10.1145/167049.167053",
  ISSN =         "0163-5948 (print), 1943-5843 (electronic)",
  ISSN-L =       "0163-5948",
  bibdate =      "Wed Aug 1 17:12:50 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigsoft1990.bib",
  abstract =     "Science makes progress by constructing mathematical
                 models, deducing their observable consequences, and
                 testing them by experiment. Successful theoretical
                 models are later taken as the basis for engineering
                 methods and codes of practice for design of reliable
                 and useful products. Models can play a similar central
                 role in the progress and practical application of
                 Computing Science.A model of a computational paradigm
                 starts with choice of a carrier set of potential direct
                 or indirect observations that can be made of a
                 computational process. A particular process is modelled
                 as the subset of observations to which it can give
                 rise. Process composition is modelled by relating
                 observations of a composite process to those of its
                 components. Indirect observations play an essential
                 role in such compositions. Algebraic properties of the
                 composition operators are derived with the aid of the
                 simple theory of sets and relations. Feasibility is
                 checked by a mapping from a more operational model.A
                 model constructed as a family of sets is easily adapted
                 as a calculus of design for total correctness. A
                 specification is given by an arbitrary set containing
                 all observations permitted in the required product. It
                 should be expressed as clearly as possible with the aid
                 of the full power of mathematics and logic. A product
                 meets a specification if its potential observations
                 form a subset of its permitted observations. This
                 principle requires that all envisaged failure modes of
                 a product are modelled as indirect observations, so
                 that their avoidance can be proved. Specifications of
                 components can be composed mathematically by the same
                 operators as the components themselves. This permits
                 top-down proof of correctness of designs even before
                 their implementation begins. Algebraic properties and
                 reasoning are helpful throughout development.
                 Non-determinism is seen as no problem, but rather as a
                 part of the solution.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGSOFT Software Engineering Notes",
  journal-URL =  "https://dl.acm.org/citation.cfm?id=J728",
}

@InCollection{Hoare:1993:AMb,
  author =       "C. A. R. Hoare",
  booktitle =    "Program Design Calculi",
  title =        "Algebra and Models",
  volume =       "118",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "161--195",
  year =         "1993",
  DOI =          "https://doi.org/10.1007/978-3-662-02880-3_6",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO ASI Series (Series F: Computer and Systems
                 Sciences)",
  acknowledgement = ack-nhfb,
  xxpages =      "161--196",
}

@InCollection{Hoare:1993:MPM,
  author =       "C. A. R. Hoare",
  editor =       "T. R. Colburn and J. H. Fetzer and T. L. Rankin",
  booktitle =    "Program Verification: Fundamental Issues in Computer
                 Science",
  title =        "Mathematics of Programming: Mathematical Laws Help
                 Programmers Control the Complexity of Tasks",
  volume =       "14",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  bookpages =    "xiii + 458",
  pages =        "135--154",
  year =         "1993",
  DOI =          "https://doi.org/10.1007/978-94-011-1793-7_7",
  ISBN =         "94-010-4789-8; 94-011-1793-4",
  ISBN-13 =      "978-94-010-4789-0; 978-94-011-1793-7",
  LCCN =         "QA76.76.V47 .P764 1993",
  bibdate =      "Sat Jul 30 15:00:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Studies in Cognitive Systems",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/978-94-011-1793-7",
  bookitle =     "Mathematics of Programming",
}

@Article{Hoare:1993:NFA,
  author =       "C. A. R. Hoare and Jifeng He and A. C. A. Sampaio",
  title =        "Normal Form Approach to Compiler Design",
  journal =      j-ACTA-INFO,
  volume =       "30",
  number =       "8",
  pages =        "701--739",
  month =        nov,
  year =         "1993",
  CODEN =        "AINFA2",
  DOI =          "https://doi.org/10.1007/BF01191809",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68Q60 (68N20)",
  MRnumber =     "94m:68128 (1256294)",
  MRreviewer =   "David B. Benson",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/procos-wg.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/procos2.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  ajournal =     "Acta Inform.",
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  xxmonth =      aug,
}

@Article{Hoare:1993:PP,
  author =       "C. A. R. Hoare",
  title =        "Programs are predicates",
  journal =      "ICOT Journal",
  volume =       "38",
  number =       "??",
  pages =        "2--15",
  month =        "????",
  year =         "1993",
  ISSN =         "0910-707X",
  ISSN-L =       "0910-707X",
  bibdate =      "Sat Jul 30 15:05:15 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Invited Lecture",
  acknowledgement = ack-nhfb,
  remark =       "Japanese IT journal.",
  xxjournal =    "New Gen. Comp.",
}

@Article{Hoare:1993:PPT,
  author =       "C. A. R. Hoare and I. Page and M. Giles and R.
                 McLatchie",
  title =        "Parallel processing: Theoretical foundations",
  journal =      "Oxford Innovation News",
  volume =       "8",
  pages =        "2--11",
  month =        "Winter",
  year =         "1993",
  bibdate =      "Tue Aug 09 11:51:40 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.cs.ox.ac.uk/files/6115/H93%20-%20Parallel.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1993:WSE,
  author =       "C. A. R. Hoare",
  editor =       "D. E. N. Davies and C. Hilsum and A. W. Rudge",
  booktitle =    "Communications After {AD 2000}",
  title =        "Why software engineering at a communications
                 meeting?",
  publisher =    "The Royal Society and Chapman Hall",
  address =      "????",
  pages =        "215--224",
  year =         "1993",
  bibdate =      "Sat Jul 30 15:06:23 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Dale:1994:CST,
  author =       "Tony Dale and C. A. R. Hoare",
  title =        "A conversation with {Sir Tony Hoare}",
  howpublished = "Web site",
  year =         "1994",
  bibdate =      "Tue Aug 09 11:54:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://www.infoq.com/interviews/tony-hoare-qcon-interview/",
  acknowledgement = ack-nhfb,
}

@Article{He:1994:PCS,
  author =       "Jifeng He and C. A. R. Hoare and Martin Fr{\"a}nzle
                 and Markus M{\"u}ller-Olm and Ernst-R{\"u}diger Olderog
                 and Michael Schenke and Michael R. Hansen and Anders P.
                 Ravn and Hans Rischel",
  title =        "Provably Correct Systems",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "863",
  pages =        "288--335",
  year =         "1994",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-58468-4_171",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1994.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@TechReport{Hoare:1994:ACO,
  author =       "C. A. R. Hoare and A. Sampaio",
  title =        "An Algebraic Characterisation of Operational
                 Semantics",
  type =         "Technical Report",
  number =       "????",
  institution =  "Oxford University Computing Laboratory",
  address =      "Oxford, UK",
  year =         "1994",
  bibdate =      "Tue Aug 09 11:58:12 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1994:F,
  author =       "C. A. R. Hoare",
  editor =       "J. P. Bowen",
  booktitle =    "Real-Time Safety Critical Systems: Towards Verified
                 Systems",
  title =        "Foreword",
  volume =       "2",
  publisher =    pub-ELSEVIER,
  address =      pub-ELSEVIER:adr,
  pages =        "xvii--xviii",
  year =         "1994",
  bibdate =      "Sat Jul 30 15:09:53 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1994:GE,
  author =       "C. A. R. Hoare",
  title =        "Guest editorial",
  journal =      "Journal of Logic and Computation",
  volume =       "4",
  number =       "3",
  pages =        "215--216",
  year =         "1994",
  CODEN =        "JLCOEU",
  ISSN =         "0955-792X (print), 1465-363X (electronic)",
  ISSN-L =       "0955-792X",
  bibdate =      "Sat Jul 30 15:12:06 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1994:HSCa,
  author =       "C. A. R. Hoare and Innes Page",
  editor =       "J{\"u}rg Gutknecht",
  booktitle =    "Programming Languages and System Architectures:
                 {International Conference, Zurich, Switzerland, March
                 2--4, 1994. Proceedings}",
  title =        "Hardware and Software: The Closing Gap",
  volume =       "782",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "49--68",
  year =         "1994",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-57840-4_24",
  ISBN =         "3-540-57840-4 (paperback), 3-540-48356-X (e-book)",
  ISBN-13 =      "978-3-540-57840-6 (paperback), 978-3-540-48356-4 a
                 (e-book)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1994.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Hoare:1994:HSCb,
  author =       "C. A. R. Hoare and I. Page",
  title =        "Hardware and software: The closing gap",
  journal =      "Transputer Communications",
  volume =       "2",
  number =       "2",
  pages =        "69--90",
  month =        jun,
  year =         "1994",
  CODEN =        "TCOMET",
  ISSN =         "1070-454X",
  ISSN-L =       "1070-454X",
  bibdate =      "Sat Jul 30 15:12:56 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Hoare:1994:UTP,
  author =       "C. A. R. Hoare",
  title =        "Unified Theories of Programming",
  howpublished = "Draft manuscript later published in
                 \cite{Hoare:1997:UTPa}.",
  year =         "1994",
  bibdate =      "Tue Aug 09 11:56:55 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1995:AM,
  author =       "C. A. R. Hoare",
  editor =       "I. Wand and Robin Milner",
  booktitle =    "Computing Tomorrow",
  title =        "Algebra and models",
  publisher =    pub-CAMBRIDGE,
  address =      pub-CAMBRIDGE:adr,
  pages =        "158--187",
  year =         "1995",
  bibdate =      "Sat Jul 30 15:14:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  xxyear =       "1996",
}

@Article{vonKarger:1995:SC,
  author =       "Burghard von Karger and C. A. R. Hoare",
  title =        "Sequential calculus",
  journal =      j-INFO-PROC-LETT,
  volume =       "53",
  number =       "3",
  pages =        "123--130",
  day =          "10",
  month =        feb,
  year =         "1995",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/0020-0190(94)00205-D",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B70 68Q10)",
  MRnumber =     "95k:68147 (1315194)",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Kiel Univ",
  affiliationaddress = "Kiel, Ger",
  classification = "721.1; 722.4; 723.1; 723.1.1; 723.2; 921.1; C4210
                 (Formal logic)",
  corpsource =   "Inst. for Comput. Sci., Kiel Univ., Germany",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algebra; Algebraic calculus; algebraic calculus;
                 calculus; Computation theory; Computer hardware
                 description languages; Computer programming; Concurrent
                 systems; Data structures; Formal logic; General
                 converse operation; Programming calculi; Reactive
                 systems; reactive systems; Real time systems;
                 Reasoning; relational algebra; Relational calculus;
                 relational calculus; Sequential calculus; sequential
                 calculus; Sequential phenomena; specification
                 languages; Temporal logic; temporal logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bowen:1996:PIP,
  author =       "J. P. Bowen and C. A. R. Hoare and H. Langmaack and
                 E-R Olderog and A. P. Ravn",
  title =        "A {Procos II} project final report: {Esprit} basic
                 research project 7071",
  journal =      "Bulletin of the European Association for Theoretical
                 Computer Science (EATCS)",
  volume =       "59",
  pages =        "??--??",
  month =        "????",
  year =         "1996",
  ISSN =         "0252-9742",
  ISSN-L =       "0252-9742",
  bibdate =      "Sat Jul 30 15:15:33 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Cleaveland:1996:SDC,
  author =       "Rance Cleaveland and Scott A. Smolka and Rajeev Alur
                 and Jos Baeten and Jan A. Bergstra and Eike Best and
                 Rocco {De Nicola} and Helen Gill and Roberto Gorrieri
                 and Mohamed G. Gouda and Jan Friso Groote and Tom A.
                 Henzinger and C. A. R. Hoare and Maj. David Luginbuhl
                 and Albert Meyer and Dale Miller and Jayadev Misra and
                 Faron Moller and Ugo Montanari and Amir Pnueli and
                 Sanjiva Prasad and Vaughan R. Pratt and Joseph Sifakis
                 and Bernhard Steffen and Bent Thomsen and Frits
                 Vaandrager and Moshe Vardi and Pierre Wolper",
  title =        "Strategic directions in concurrency research",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4",
  pages =        "607--625",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242223.242252",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:54:52 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p607-cleaveland/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@InCollection{Hoare:1996:AM,
  author =       "C. A. R. Hoare",
  booktitle =    "Computing tomorrow",
  title =        "Algebra and models",
  publisher =    "Cambridge Univ. Press, Cambridge",
  pages =        "158--187",
  year =         "1996",
  DOI =          "https://doi.org/10.1017/CBO9780511605611.010",
  MRclass =      "68Q60 (68Q10 68Q55)",
  MRnumber =     "1441318",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1996:HDS,
  author =       "C. A. R. Hoare",
  editor =       "Marie-Claude Gaudel and James Woodcock",
  booktitle =    "{FME'96}: Industrial Benefit and Advances in Formal
                 Methods",
  title =        "How did Software get so Reliable Without Proof?",
  volume =       "1051",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "1--17",
  year =         "1996",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-60973-3_77",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1996:LED,
  author =       "C. A. R. Hoare",
  title =        "The logic of engineering design",
  journal =      j-MICROPROC-MICROPROG,
  volume =       "41",
  number =       "8-9",
  pages =        "525--539",
  month =        apr,
  year =         "1996",
  CODEN =        "MMICDT",
  DOI =          "https://doi.org/10.1016/0165-6074(96)00009-9",
  ISSN =         "0165-6074 (print), 1878-7061 (electronic)",
  ISSN-L =       "0165-6074",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Microprocessing and Microprogramming",
}

@InProceedings{Hoare:1996:MMC,
  author =       "C. A. R. Hoare",
  title =        "Mathematical models for computing science",
  crossref =     "Broy:1996:DPD",
  pages =        "115--164",
  year =         "1996",
  bibdate =      "Tue Aug 09 12:00:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1996:PAB,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Great Papers in Computer Science",
  title =        "Preface to {An axiomatic basis for computer
                 programming}",
  chapter =      "137",
  publisher =    "West Publishing Co.",
  address =      "????",
  pages =        "??--??",
  year =         "1996",
  bibdate =      "Sat Jul 30 15:24:07 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1996:PPA,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Great Papers in Computer Science",
  title =        "Preface to {Preface to An axiomatic definition of the
                 programming language}",
  chapter =      "139",
  publisher =    "West Publishing Co.",
  address =      "????",
  pages =        "??--??",
  year =         "1996",
  bibdate =      "Sat Jul 30 15:24:07 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1996:PPC,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Great Papers in Computer Science",
  title =        "Preface to {Proof of correctness of data
                 representations}",
  chapter =      "138",
  publisher =    "West Publishing Co.",
  address =      "????",
  pages =        "??--??",
  year =         "1996",
  bibdate =      "Sat Jul 30 15:24:07 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:1996:PQ,
  author =       "C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Great Papers in Computer Science",
  title =        "Preface to {Quicksort}",
  chapter =      "140",
  publisher =    "West Publishing Co.",
  address =      "????",
  pages =        "??--??",
  year =         "1996",
  bibdate =      "Sat Jul 30 15:24:07 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1996:UTC,
  author =       "C. A. R. Hoare",
  editor =       "Magne Haveraaen and Olaf Owe and Ole-Johan Dahl",
  booktitle =    "Recent Trends in Data Type Specification ({11th
                 Workshop on Specification of Abstract Data Types
                 1995})",
  title =        "Unification of Theories: a Challenge for Computing
                 Science",
  volume =       "1130",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "49--57",
  year =         "1996",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-61629-2_35",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Oct 29 14:12:39 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1996b.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:1996:UTP,
  author =       "C. A. R. Hoare",
  title =        "Unifying theories: a personal statement",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "46:1--46:??",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/242224.242282",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:56:39 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a46-hoare/",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@InProceedings{He:1997:LTP,
  author =       "Jifeng He and C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Proceeding of SBLP'97",
  title =        "Linking theories in probabilistic programming",
  publisher =    "????",
  address =      "????",
  pages =        "??--??",
  year =         "1997",
  bibdate =      "Sat Jul 30 15:32:06 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "See also \cite{He:1999:LTP}.",
  acknowledgement = ack-nhfb,
  remark =       "I cannot yet find this in library catalogs.",
}

@InCollection{Hoare:1997:ADO,
  author =       "C. A. R. Hoare and Jifeng He and A. Sampiao",
  editor =       "????",
  booktitle =    "{Milner's Festschrift}",
  title =        "Algebraic derivation of an operational semantics",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "??--??",
  year =         "1997",
  bibdate =      "Sat Jul 30 15:29:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1997:UTC,
  author =       "C. A. R. Hoare and Jifeng He",
  editor =       "C. Lengauer and M. Griebl",
  booktitle =    "{Europar 97} Parallel Processing",
  title =        "Unifying theories of concurrency: Key address",
  volume =       "1300",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "??--??",
  year =         "1997",
  bibdate =      "Sat Jul 30 15:27:31 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1997:UTPa,
  author =       "C. A. R. Hoare",
  booktitle =    "Mathematical methods in program development
                 ({Marktoberdorf}, 1996)",
  title =        "Unified Theories of Programming",
  volume =       "158",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "313--367",
  year =         "1997",
  DOI =          "https://doi.org/10.1007/978-3-642-60858-2_21",
  MRclass =      "68Q60 (68Q55)",
  MRnumber =     "1613042",
  MRreviewer =   "Annabelle McIver",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1997:UTPb,
  author =       "C. A. R. Hoare and Jifeng He",
  editor =       "C. Lengauer and M. Griebl",
  booktitle =    "{Euro-Par'97} Parallel Processing",
  title =        "Unifying Theories for Parallel Programming",
  volume =       "1300",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "15--30",
  year =         "1997",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/bfb0002714",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{He:1999:LTP,
  author =       "Jifeng He and C. A. R. Hoare",
  title =        "Linking theories in probabilistic programming",
  journal =      j-INFO-SCI,
  volume =       "119",
  number =       "3--4",
  pages =        "205--218",
  month =        oct,
  year =         "1999",
  CODEN =        "ISIJBC",
  DOI =          "https://doi.org/10.1016/s0020-0255(99)00015-8",
  ISSN =         "0020-0255 (print), 1872-6291 (electronic)",
  ISSN-L =       "0020-0255",
  MRclass =      "68Q60 (68N30 68Q10 68Q55)",
  MRnumber =     "1729772",
  MRreviewer =   "Gabriel Ciobanu",
  bibdate =      "Sat Jul 30 15:32:06 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://doi.org/10.1016/s0020-0255%2899%2900015-8",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200255",
  remark =       "See also \cite{He:1997:LTP}.",
}

@InProceedings{Hoare:1999:TMPa,
  author =       "C. A. R. Hoare and He Jifeng",
  booktitle =    "Calculational system design ({Marktoberdorf}, 1998)",
  title =        "A trace model for pointers and objects",
  volume =       "173",
  publisher =    "IOS, Amsterdam",
  pages =        "3--23",
  year =         "1999",
  MRclass =      "68N19 (68Q60 68Q85)",
  MRnumber =     "1785825",
  MRreviewer =   "Luming Lai",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Sci. Ser. F Comput. Syst. Sci.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:1999:TMPb,
  author =       "C. A. R. Hoare and Jifeng He",
  editor =       "R. Guerraoui",
  booktitle =    "{ECOOP' 99} --- Object-Oriented Programming",
  title =        "A Trace Model for Pointers and Objects",
  volume =       "1628",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "1--18",
  year =         "1999",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-48743-3_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Feb 5 11:54:16 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1628.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1999b.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1628/16280001.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1628/16280001.pdf",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/bookseries/558",
  xxauthor =     "C. A. R. Hoare and He Jifeng",
}

@InProceedings{Hoare:1999:TPT,
  author =       "C. A. R. Hoare",
  booktitle =    "International Symposium on Formal Methods--FM'99",
  title =        "Theories of Programming: Top-Down and Bottom-Up and
                 Meeting in the Middle",
  volume =       "1708",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "1--27",
  year =         "1999",
  DOI =          "https://doi.org/10.1007/3-540-48119-2_1",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Jones:1999:SIE,
  author =       "Simon Peyton Jones and Alastair Reid and Fergus
                 Henderson and Tony Hoare and Simon Marlow",
  title =        "A semantics for imprecise exceptions",
  journal =      j-SIGPLAN,
  volume =       "34",
  number =       "5",
  pages =        "25--36",
  month =        may,
  year =         "1999",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:18:03 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan1990.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
}

@Article{PeytonJones:1999:SIE,
  author =       "Simon {Peyton Jones} and Alastair Reid and Tony Hoare
                 and Simon Marlow and Fergus Henderson",
  title =        "A Semantics for Imprecise Exceptions",
  journal =      j-SIGPLAN,
  volume =       "34",
  number =       "5",
  pages =        "25--36",
  month =        may,
  year =         "1999",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/301631.301637",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html;
                 http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html;
                 http://www.cs.rutgers.edu/pldi99/program.html;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan1990.bib",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p25-peyton_jones/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "This appears in the issue with the PLDI'99 proceedings
                 \cite{Ryder:1999:PAS}.",
}

@InProceedings{Seres:1999:ALP,
  author =       "Silvija Seres and Michael Spivey and Tony Hoare",
  booktitle =    "Proceedings of the 1999 international conference on
                 Logic programming, {November 1999 (Las Cruces, NM)}",
  title =        "Algebra of logic programming",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "184--199",
  year =         "1999",
  DOI =          "https://doi.org/10.5555/341176.341200",
  MRclass =      "68N17",
  MRnumber =     "1749837",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "MIT Press Ser. Logic Program.",
  URL =          "https://dl.acm.org/doi/10.5555/341176.341200",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:2000:UTH,
  author =       "Jifeng He and C. A. R. Hoare",
  title =        "Unifying theories of healthiness condition",
  crossref =     "IEEE:2000:PSA",
  pages =        "70--81",
  year =         "2000",
  DOI =          "https://doi.org/10.1109/apsec.2000.896685",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2000:A,
  author =       "Tony Hoare",
  editor =       "Wolfgang Grieskamp and Thomas Santen and Bill
                 Stoddart",
  booktitle =    "Integrated Formal Methods: Second International
                 Conference, {IFM 2000, Dagstuhl Castle, Germany,
                 November 1--3, 2000 Proceedings}",
  title =        "Assertions",
  volume =       "1945",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  bookpages =    "x + 446",
  pages =        "1--2",
  year =         "2000",
  DOI =          "https://doi.org/10.1007/3-540-40911-4_1",
  ISBN =         "3-540-40911-4 (e-book), 3-540-41196-8 (Paper)",
  ISBN-13 =      "978-3-540-40911-3 (e-book), 978-3-540-41196-3
                 (Paper)",
  LCCN =         "QA76.9.F67 .G754 2000",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/3-540-40911-4",
  remark =       "Invited talk.",
}

@InCollection{Hoare:2000:ADO,
  author =       "C. A. R. Hoare and He Jifeng and Augusto Sampaio",
  editor =       "Gordon Plotkin and Colin Stirling and Mads Tofte",
  booktitle =    "Proof, language, and interaction: Essays in Honour of
                 {Robin Milner}",
  title =        "Algebraic derivation of an operational semantics",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  bookpages =    "xiv + 722",
  pages =        "77--98",
  year =         "2000",
  MRclass =      "68Q55",
  MRnumber =     "1773452",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Found. Comput. Ser.",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2000:HAF,
  author =       "C. A. R. Hoare",
  title =        "A Hard Act to Follow",
  journal =      j-HIGHER-ORDER-SYMB-COMPUT,
  volume =       "13",
  number =       "1--2",
  pages =        "71--72",
  month =        apr,
  year =         "2000",
  CODEN =        "LSCOEX",
  DOI =          "https://doi.org/10.1023/A:1010053724918",
  ISSN =         "1388-3690 (print), 2212-0793 (electronic)",
  ISSN-L =       "1388-3690",
  bibdate =      "Wed Jul 6 15:50:30 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=13&issue=1;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib;
                 http://www.wkap.nl/issuetoc.htm/v13-n1-2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=13&issue=1&spage=71;
                 http://www.wkap.nl/oasis.htm/258019",
  acknowledgement = ack-nhfb,
  fjournal =     "Higher-Order and Symbolic Computation",
  journal-URL =  "http://link.springer.com/journal/10990",
}

@InProceedings{Hoare:2000:LC,
  author =       "C. A. R. Hoare",
  booktitle =    "{ICFEM 2000. Third IEEE International Conference on
                 Formal Engineering Methods}",
  title =        "Legacy code [invited talk]",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "75--75",
  year =         "2000",
  bibdate =      "Tue Aug 09 12:27:28 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://ieeexplore.ieee.org/document/873807",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2000:SLI,
  author =       "C. A. R. Hoare",
  booktitle =    "Kyoto Prizes and Inamori Grants 2000",
  title =        "Stories from a life in interesting times",
  publisher =    "The Inamori Foundation",
  address =      "Kyoto, Japan",
  pages =        "112--138",
  year =         "2000",
  ISBN =         "4-900663-16-6",
  ISBN-13 =      "978-4-900663-16-9",
  bibdate =      "Tue Aug 09 12:29:59 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Japanese and English side-by-side.",
  URL =          "https://www.kyotoprize.org/wp-content/uploads/2019/07/2000_A.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2001:ABC,
  author =       "C. A. R. Hoare",
  title =        "An Axiomatic Basis for Computer Programming",
  crossref =     "Broy:2001:PTC",
  pages =        "419--438",
  year =         "2001",
  DOI =          "https://doi.org/10.1007/978-3-642-48354-7_17",
  bibdate =      "Wed Mar 18 15:40:02 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-48354-7_17/",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2001:L,
  author =       "Tony Hoare",
  title =        "Legacy",
  journal =      j-INFO-PROC-LETT,
  volume =       "77",
  number =       "2--4",
  pages =        "123--129",
  day =          "28",
  month =        feb,
  year =         "2001",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/s0020-0190(00)00209-x",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc2000.bib",
  URL =          "http://www.elsevier.nl/gej-ng/10/23/20/68/29/34/abstract.html;
                 http://www.elsevier.nl/gej-ng/10/23/20/68/29/34/article.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
}

@InProceedings{Hoare:2001:PCD,
  author =       "C. A. R. Hoare",
  title =        "Proof of Correctness of Data Representations",
  crossref =     "Broy:2001:PTC",
  pages =        "439--451",
  year =         "2001",
  DOI =          "https://doi.org/10.1007/978-3-642-48354-7_18",
  bibdate =      "Wed Mar 18 15:40:02 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-48354-7_18/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2001:UTL,
  author =       "C. A. R. Hoare and Jifeng He",
  title =        "Unifying theories for logic programming",
  crossref =     "Hoare:2001:ETS",
  pages =        "??--??",
  year =         "2001",
  bibdate =      "Tue Aug 09 12:38:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Jones:2001:PRR,
  author =       "S. P. Jones and A. Tolmach and C. A. R. Hoare",
  editor =       "????",
  booktitle =    "Haskell Workshop",
  title =        "Playing by the rules: Rewriting as a practical
                 optimisation technique",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "1--13",
  year =         "2001",
  DOI =          "https://doi.org/10.1.1.22.1486",
  bibdate =      "Tue Aug 09 13:51:01 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1486",
  acknowledgement = ack-nhfb,
  xxpages =      "203--233",
}

@Article{Boyer:2002:MEW,
  author =       "R. S. Boyer and W. Feijen and D. Gries and C. A. R.
                 Hoare and J. Misra and J. Moore and H. Richards",
  title =        "In memoriam: {Edsger W. Dijkstra} 1930--2002",
  journal =      j-CACM,
  volume =       "45",
  number =       "10",
  pages =        "21--22",
  month =        oct,
  year =         "2002",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/570907.570921",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
}

@InProceedings{Hoare:2002:AMS,
  author =       "Tony Hoare",
  title =        "Assertions in modern software engineering practice",
  crossref =     "IEEE:2002:AIC",
  pages =        "459--459",
  year =         "2002",
  DOI =          "https://doi.org/10.1109/cmpsac.2002.1045044",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2002:APS,
  author =       "{Professor Sir Tony} Hoare",
  editor =       "D. Bustard and W. Liu and R. Sterritt",
  booktitle =    "{Soft-Ware 2002}: Computing in an Imperfect World",
  title =        "Assertions in Programming: From Scientific Theory to
                 Engineering Practice",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2311",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "350--351",
  year =         "2002",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-46019-5_27",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:09:25 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2311.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2002a.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2311/23110350.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2311/23110350.pdf",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@InCollection{Hoare:2002:CSP,
  author =       "C. A. R. Hoare",
  title =        "Communicating Sequential Processes",
  crossref =     "BrinchHansen:2002:OCP",
  pages =        "413--443",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-1-4757-3472-0_16",
  bibdate =      "Sat Jul 23 07:01:09 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2002:LLU,
  author =       "Charles Antony Richard Hoare",
  title =        "Learning to love uncertainty",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1529",
  pages =        "26--26",
  day =          "??",
  month =        "????",
  year =         "2002",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@InCollection{Hoare:2002:MOS,
  author =       "C. A. R. Hoare",
  title =        "Monitors: an Operating System Structuring Concept",
  crossref =     "BrinchHansen:2002:OCP",
  pages =        "272--294",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-1-4757-3472-0_10",
  bibdate =      "Sat Jul 23 07:01:09 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2002:TTP,
  author =       "C. A. R. Hoare",
  title =        "Towards a Theory of Parallel Programming",
  crossref =     "BrinchHansen:2002:OCP",
  pages =        "231--244",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-1-4757-3472-0_6",
  bibdate =      "Sat Jul 23 07:01:09 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://doi.org/10.1007/978-1-4757-3472-0_6",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2003:A,
  author =       "C. A. R. Hoare",
  title =        "Assertions",
  crossref =     "Broy:2003:MAL",
  pages =        "291--316",
  year =         "2003",
  bibdate =      "Tue Aug 09 14:04:06 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2003:APP,
  author =       "C. A. R. Hoare",
  title =        "Assertions: a Personal Perspective",
  journal =      j-IEEE-ANN-HIST-COMPUT,
  volume =       "25",
  number =       "2",
  pages =        "14--25",
  month =        apr # "\slash " # jun,
  year =         "2003",
  CODEN =        "IAHCEX",
  DOI =          "https://doi.org/10.1109/MAHC.2003.1203056",
  ISSN =         "1058-6180 (print), 1934-1547 (electronic)",
  ISSN-L =       "1058-6180",
  MRclass =      "68-03 (68Q60)",
  MRnumber =     "1978993",
  MRreviewer =   "Manfred Broy",
  bibdate =      "Sat Nov 29 16:19:47 MST 2003",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
  URL =          "http://csdl.computer.org/dl/mags/an/2003/02/a2014.htm;
                 http://csdl.computer.org/dl/mags/an/2003/02/a2014.pdf;
                 http://csdl.computer.org/dl/mags/an/2003/02/a2014abs.htm",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Annals of the History of Computing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}

@Article{Hoare:2003:EWD,
  author =       "Tony Hoare",
  title =        "{Edsger Wybe Dijkstra}",
  journal =      j-PHYS-TODAY,
  volume =       "56",
  number =       "3",
  pages =        "96, 98",
  month =        mar,
  year =         "2003",
  CODEN =        "PHTOAD",
  DOI =          "https://doi.org/10.1063/1.1570789",
  ISSN =         "0031-9228 (print), 1945-0699 (electronic)",
  ISSN-L =       "0031-9228",
  bibdate =      "Wed Aug 10 16:52:55 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Physics Today",
  journal-URL =  "http://www.physicstoday.org/",
}

@Article{Hoare:2003:KTK,
  author =       "Charles Antony Richard Hoare",
  title =        "King toppled by knights in quest for computing holy
                 grail",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1575",
  pages =        "26--26",
  day =          "??",
  month =        "????",
  year =         "2003",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@InCollection{Hoare:2003:TVC,
  author =       "Tony Hoare",
  booktitle =    "Formal Methods at the Crossroads. From Panacea to
                 Foundational Support",
  title =        "Towards the Verifying Compiler",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "151--160",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/978-3-540-40007-3_10",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2003:VC,
  author =       "Tony Hoare",
  title =        "The verifying compiler",
  journal =      j-J-ACM,
  volume =       "50",
  number =       "1",
  pages =        "63--69",
  month =        jan,
  year =         "2003",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/602382.602403",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InCollection{Hoare:2003:VCGa,
  author =       "Tony Hoare",
  booktitle =    "Compiler Construction",
  title =        "The Verifying Compiler: a Grand Challenge for
                 Computing Research",
  volume =       "2622",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "262--272",
  year =         "2003",
  DOI =          "https://doi.org/10.1007/3-540-36579-6_19",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "ser-LNCS",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2003:VCGb,
  author =       "Tony Hoare",
  title =        "The verifying compiler: a grand challenge for
                 computing research",
  journal =      j-J-ACM,
  volume =       "50",
  number =       "1",
  pages =        "63--69",
  month =        jan,
  year =         "2003",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/602382.602403",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Mar 26 13:35:00 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@InCollection{Fournet:2004:SFC,
  author =       "C{\'e}dric Fournet and Tony Hoare and Sriram K.
                 Rajamani and Jakob Rehof",
  booktitle =    "Computer aided verification",
  title =        "Stuck-free conformance",
  volume =       "3114",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "242--254",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/978-3-540-27813-9_19",
  MRclass =      "68Q60 (68Q85)",
  MRnumber =     "2164821",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2004:AA,
  author =       "Charles Antony Richard Hoare",
  title =        "From an amp to an atom",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1608",
  pages =        "28--28",
  day =          "??",
  month =        "????",
  year =         "2004",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@TechReport{Hoare:2004:EHDa,
  author =       "Tony Hoare and Cliff Jones and Brian Randell",
  title =        "Extending the horizons of {DSE (GC6)}",
  type =         "Technical Report",
  number =       "CS-TR-853",
  institution =  "University of Newcastle upon Tyne, School of Computing
                 Science",
  address =      "Claremont Tower, Claremont Road, Newcastle upon Tyne,
                 NE1 7RU, UK.",
  pages =        "6",
  day =          "5",
  month =        feb,
  year =         "2004",
  bibdate =      "Wed Aug 10 16:15:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://homepages.cs.ncl.ac.uk/cliff.jones/publications/NU-TRs/CS-TR-853.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "DSE (Dependable Systems Evolution)",
}

@InCollection{Hoare:2004:EHDb,
  author =       "C. A. R. Hoare and C. B. Jones and B. Randell",
  booktitle =    "Grand Challenges. {UKCRC}",
  title =        "Extending the horizons of {DSE}",
  publisher =    "????",
  pages =        "??--??",
  year =         "2004",
  bibdate =      "Tue Aug 09 14:16:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://www.nesc.ac.uk/esi/events/Grand_Challenges/gcconf04/submissions/23.pdf",
  acknowledgement = ack-nhfb,
  remark =       "I cannot yet find a CRC Press volume with this
                 title.",
}

@Article{Hoare:2004:FSP,
  author =       "Charles Antony Richard Hoare",
  title =        "Fractional shifts produce sweet sound of spheres",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1640",
  pages =        "29--29",
  day =          "??",
  month =        "????",
  year =         "2004",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@InCollection{Hoare:2004:GCC,
  author =       "Tony Hoare",
  booktitle =    "Monographs in Computer Science",
  title =        "Grand Challenges for Computing Research",
  crossref =     "Herbert:2004:CST",
  pages =        "117--123",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/0-387-21821-1_18",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2004:RMN,
  author =       "Tony Hoare and Maurice V. Wilkes",
  title =        "{Roger Michael Needham CBE FREng. 9 February 1935--1
                 March 2003}",
  journal =      j-BIOGRAPH-MEMOIRS-FELLOWS-ROY-SOC,
  volume =       "50",
  pages =        "183--199",
  month =        jan,
  year =         "2004",
  CODEN =        "BMFRA3",
  DOI =          "https://doi.org/10.1098/rsbm.2004.0014",
  ISSN =         "0080-4606 (print), 1748-8494 (electronic)",
  ISSN-L =       "0080-4606",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Biographical Memoirs of Fellows of the Royal Society",
  journal-URL =  "http://www.jstor.org/journals/00804606.html",
}

@InCollection{Hoare:2004:TVC,
  author =       "Tony Hoare",
  title =        "Towards the Verifying Compiler",
  crossref =     "Owe:2004:OOF",
  pages =        "124--136",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/978-3-540-39993-3_8",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2004:VIF,
  author =       "Charles Antony Richard Hoare",
  title =        "Visions of {Iris} flitting through the universe with a
                 peeled grape",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1621",
  pages =        "22--22",
  day =          "??",
  month =        "????",
  year =         "2004",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@Article{Hoare:2004:YWT,
  author =       "Charles Antony Richard Hoare",
  title =        "Yes we think, but not like a machine does",
  journal =      "Times Higher Education Supplement",
  volume =       "??",
  number =       "1663",
  pages =        "26--26",
  day =          "??",
  month =        "????",
  year =         "2004",
  ISSN =         "0049-3929",
  ISSN-L =       "0049-3929",
  bibdate =      "Wed Aug 10 17:22:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Check: is this the same Hoare that is the subject of
                 this bibliography?",
}

@InProceedings{Bruni:2005:CTA,
  author =       "Roberto Bruni and Michael Butler and Carla Ferreira
                 and Tony Hoare and Hern{\'a}n Melgratti and Ugo
                 Montanari",
  title =        "Comparing two approaches to compensable flow
                 composition",
  crossref =     "Abadi:2005:CCT",
  pages =        "383--397",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11539452_30",
  MRclass =      "68U35 (68Q85)",
  MRnumber =     "2198072",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Butler:2005:TSL,
  author =       "Michael Butler and Tony Hoare and Carla Ferreira",
  title =        "A Trace Semantics for Long-Running Transactions",
  crossref =     "Abdallah:2005:CSP",
  pages =        "133--150",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11423348_8",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{He:2005:LTC,
  author =       "Jifeng He and C. A. R. Hoare",
  editor =       "Dang Van Hung and Martin Wirsing",
  booktitle =    "{Theoretical Aspects of Computing --- ICTAC 2005
                 Second International Colloquium Hanoi Vietnam October
                 17--21 2005 Proceeding}",
  title =        "Linking theories of concurrency",
  volume =       "3722",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "303--317",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11560647_20",
  MRclass =      "68Q85",
  MRnumber =     "2217436",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  xxbooktitle =  "International Colloquium on Theoretical Aspects of
                 Computing --- {ICTAC 2005}",
}

@Article{Hoare:2005:GCC,
  author =       "Tony Hoare and Robin Milner",
  title =        "Grand Challenges for Computing Research",
  journal =      j-COMP-J,
  volume =       "48",
  number =       "1",
  pages =        "49--52",
  month =        jan,
  year =         "2005",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/48.1.49",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Jun 28 17:48:35 MDT 2005",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj2000.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/bxh065.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/pdf/bxh065.pdf",
  abstract =     "What are the major research challenges that face the
                 world of computing today? Are there any of them that
                 match the grandeur of well-known challenges in other
                 branches of science? This article is a report on an
                 exercise by the Computing Research Community in the UK
                 to answer these questions, and includes a summary of
                 the outcomes of a BCS-sponsored conference held in
                 Newcastle-upon-Tyne from 29 to 31 March this year.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@InProceedings{Hoare:2005:PAUa,
  author =       "Tony Hoare",
  title =        "Process Algebra: a Unifying Approach",
  crossref =     "Abdallah:2005:CSP",
  pages =        "36--60",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11423348_3",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2005:PAUb,
  author =       "Tony Hoare",
  title =        "Process Algebra: a Unifying Approach",
  crossref =     "Broy:2005:ETS",
  pages =        "257--283",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/1-4020-3532-2_11",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://link.springer.com/content/pdf/10.1007/1-4020-3532-2_9.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2005:TSO,
  author =       "Tony Hoare and Galen Menzel and Jayadev Misra",
  title =        "A Tree Semantics of an Orchestration Language",
  crossref =     "Broy:2005:ETS",
  pages =        "331--350",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/1-4020-3532-2_11",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2005:VCG,
  author =       "C. A. R. Hoare",
  booktitle =    "Verification, model checking, and abstract
                 interpretation",
  title =        "The verifying compiler, a grand challenge for
                 computing research",
  volume =       "3385",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "78",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/978-3-540-30579-8_5",
  MRclass =      "68N01 (68N30)",
  MRnumber =     "2166821",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Beckert:2006:ISF,
  author =       "Bernhard Beckert and Tony Hoare and Reiner Hahnle and
                 Douglas Smith and Cordell Green and Silvio Ranise and
                 Cesare Tinelli and Thomas Ball and Sriram Rajamani",
  title =        "Intelligent Systems and Formal Methods in Software
                 Engineering",
  journal =      j-IEEE-INTELL-SYST,
  volume =       "21",
  number =       "6",
  pages =        "71--81",
  month =        nov,
  year =         "2006",
  DOI =          "https://doi.org/10.1109/mis.2006.117",
  ISSN =         "1541-1672 (print), 1941-1294 (electronic)",
  ISSN-L =       "1541-1672",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Intelligent Systems",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=9670",
}

@Article{Bicarregui:2006:VSR,
  author =       "J. C. Bicarregui and C. A. R. Hoare and J. C. P.
                 Woodcock",
  title =        "The verified software repository: a step towards the
                 verifying compiler",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "18",
  number =       "2",
  pages =        "143--151",
  month =        jun,
  year =         "2006",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/s00165-005-0079-4",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Tue Mar 17 20:58:20 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/s00165-005-0079-4",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@InCollection{Hoare:2006:IVS,
  author =       "Tony Hoare",
  booktitle =    "Computer aided verification",
  title =        "The ideal of verified software (invited talk)",
  volume =       "4144",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "5--16",
  year =         "2006",
  DOI =          "https://doi.org/10.1007/11817963_4",
  MRnumber =     "2301149",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2006:WEC,
  author =       "Tony Hoare",
  title =        "Why ever {CSP}?",
  journal =      j-ELECT-NOTES-THEOR-COMP-SCI,
  volume =       "162",
  pages =        "209--215",
  month =        sep,
  year =         "2006",
  DOI =          "https://doi.org/10.1016/j.entcs.2006.01.031",
  ISSN =         "1571-0661",
  ISSN-L =       "1571-0661",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Notes in Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/15710661",
}

@InProceedings{Vafeiadis:2006:PCH,
  author =       "Viktor Vafeiadis and Maurice Herlihy and Tony Hoare
                 and Marc Shapiro",
  booktitle =    "Proceedings of the eleventh {ACM SIGPLAN symposium on
                 Principles and practice of parallel programming ---
                 PPoPP '06}",
  title =        "Proving correctness of highly-concurrent linearisable
                 objects",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "129--136",
  year =         "2006",
  DOI =          "https://doi.org/10.1145/1122971.1122992",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2007:CT,
  author =       "Tony Hoare",
  title =        "Compensable Transactions",
  crossref =     "Broy:2007:SSR",
  pages =        "116--134",
  year =         "2007",
  bibdate =      "Wed Aug 10 18:04:30 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2007:IPC,
  author =       "Tony Hoare",
  title =        "The Ideal of Program Correctness: {Third
                 \booktitle{Computer Journal} Lecture}",
  journal =      j-COMP-J,
  volume =       "50",
  number =       "3",
  pages =        "254--260",
  month =        may,
  year =         "2007",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxl078",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Wed Apr 28 14:33:33 MDT 2010",
  bibsource =    "http://comjnl.oxfordjournals.org/content/vol50/issue3/index.dtl;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj2000.bib",
  note =         "See \cite{Anonymous:2007:DIPa,Anonymous:2007:DIPb}",
  URL =          "http://comjnl.oxfordjournals.org/cgi/content/full/50/3/254;
                 http://comjnl.oxfordjournals.org/cgi/reprint/50/3/254",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@InProceedings{Hoare:2007:SEC,
  author =       "Tony Hoare",
  booktitle =    "37th Annual {IEEE}/{IFIP} International Conference on
                 Dependable Systems and Networks ({DSN}'07)",
  title =        "Science and Engineering: a Collusion of Cultures",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "2--9",
  month =        jun,
  year =         "2007",
  DOI =          "https://doi.org/10.1109/dsn.2007.87",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2008:SLS,
  author =       "Tony Hoare and Peter O'Hearn",
  title =        "Separation Logic Semantics for Communicating
                 Processes",
  journal =      j-ELECT-NOTES-THEOR-COMP-SCI,
  volume =       "212",
  pages =        "3--25",
  month =        apr,
  year =         "2008",
  DOI =          "https://doi.org/10.1016/j.entcs.2008.04.050",
  ISSN =         "1571-0661",
  ISSN-L =       "1571-0661",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Notes in Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/15710661",
}

@Article{Hoare:2008:VFG,
  author =       "Tony Hoare",
  title =        "Verification of fine-grain concurrent programs",
  journal =      j-ELECT-NOTES-THEOR-COMP-SCI,
  volume =       "209",
  pages =        "165--171",
  year =         "2008",
  DOI =          "https://doi.org/10.1016/j.entcs.2008.04.010",
  ISSN =         "1571-0661",
  ISSN-L =       "1571-0661",
  MRclass =      "68Q85 (68Q60)",
  MRnumber =     "2459966",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Electronic Notes in Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/15710661",
  xxbooktitle =  "Proceedings of the {LIX} {Colloquium} on {Emerging}
                 {Trends} in {Concurrency} {Theory} ({LIX} 2006)",
}

@InProceedings{Hoare:2008:VST,
  author =       "Tony Hoare and Jay Misra",
  title =        "Verified Software: Theories, Tools, Experiments Vision
                 of a Grand Challenge Project",
  crossref =     "Meyer:2008:VST",
  pages =        "1--18",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-3-540-69149-5_1",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2009:CKA,
  author =       "C. A. R. Hoare and Bernhard M{\"o}ller and Georg
                 Struth and Ian Wehrman",
  editor =       "Mario Bravetti and Gianluigi Zavattaro",
  booktitle =    "{CONCUR 2009 --- Concurrency Theory: 20th
                 International Conference, CONCUR 2009, Bologna, Italy,
                 September 1--4, 2009, Proceedings}",
  title =        "Concurrent {Kleene} algebra",
  volume =       "5710",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "399--414",
  year =         "2009",
  DOI =          "https://doi.org/10.1007/978-3-642-04081-8_27",
  MRclass =      "68Q85 (68Q45)",
  MRnumber =     "2556899",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2009:FCK,
  author =       "C. A. R. Hoare and Bernhard M{\"o}ller and Georg
                 Struth and Ian Wehrman",
  title =        "Foundations of concurrent {Kleene} algebra",
  crossref =     "Berghammer:2009:RKA",
  pages =        "166--186",
  year =         "2009",
  DOI =          "https://doi.org/10.1007/978-3-642-04639-1_12",
  MRclass =      "68Q65 (03G25 68Q85)",
  MRnumber =     "2781233",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2009:PSI,
  author =       "C. A. R. Hoare and Jayadev Misra",
  title =        "Preface to special issue on software verification",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "18:1--18:3",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592435",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Hoare:2009:VRA,
  author =       "C. A. R. Hoare",
  title =        "Viewpoint: Retrospective: an axiomatic basis for
                 computer programming",
  journal =      j-CACM,
  volume =       "52",
  number =       "10",
  pages =        "30--32",
  month =        oct,
  year =         "2009",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/1562764.1562779",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Oct 23 15:01:50 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm2000.bib",
  abstract =     "C.A.R. Hoare revisits his past {\em Communications\/}
                 article on the axiomatic approach to programming and
                 uses it as a touchstone for the future.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Hoare:2009:VSI,
  author =       "C. A. R. Hoare and Jayadev Misra and Gary T. Leavens
                 and Natarajan Shankar",
  title =        "The verified software initiative: a manifesto",
  journal =      j-COMP-SURV,
  volume =       "41",
  number =       "4",
  pages =        "22:1--22:8",
  month =        oct,
  year =         "2009",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/1592434.1592439",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Wed Oct 7 08:29:52 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Wehrman:2009:GMS,
  author =       "Ian Wehrman and C. A. R. Hoare and Peter W. O'Hearn",
  title =        "Graphical models of separation logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "109",
  number =       "17",
  pages =        "1001--1004",
  day =          "16",
  month =        aug,
  year =         "2009",
  CODEN =        "IFPLAT",
  DOI =          "https://doi.org/10.1016/j.ipl.2009.06.003",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (05C90 68Q85)",
  MRnumber =     "2547572",
  bibdate =      "Thu Mar 31 15:53:40 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{He:2010:CRC,
  author =       "Jifeng He and Tony Hoare",
  title =        "{CSP} is a retract of {CCS}",
  journal =      j-THEOR-COMP-SCI,
  volume =       "411",
  number =       "11--13",
  pages =        "1311--1337",
  day =          "6",
  month =        mar,
  year =         "2010",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2009.12.012",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  MRclass =      "68Q60",
  MRnumber =     "2642822",
  MRreviewer =   "Luca Aceto",
  bibdate =      "Mon Mar 28 17:10:25 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@InCollection{Hoare:2010:CT,
  author =       "Tony Hoare",
  title =        "Compensable Transactions",
  crossref =     "Muller:2010:ALS",
  pages =        "21--40",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-13010-6_2",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "Page numbers 116--134 in \cite{Jones:2021:LTH} are
                 wrong for this paper.",
}

@InCollection{Hoare:2010:FGCa,
  author =       "Tony Hoare",
  title =        "Fine-Grain Concurrency",
  crossref =     "Muller:2010:ALS",
  pages =        "1--20",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-13010-6_1",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2010:FGCb,
  author =       "Tony Hoare",
  title =        "Fine-grain concurrency",
  journal =      j-CCPE,
  volume =       "22",
  number =       "8",
  pages =        "912--934",
  day =          "10",
  month =        jun,
  year =         "2010",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.1457",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Mon Dec 5 10:08:44 MST 2011",
  bibsource =    "http://www.interscience.wiley.com/jpages/1532-0626;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/ccpe.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurrency Computat., Pract. Exper.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
  onlinedate =   "21 Aug 2009",
}

@InProceedings{Hoare:2010:MJD,
  author =       "C. A. R. Hoare",
  editor =       "B. Nuseibeh and P. Zave",
  booktitle =    "Software Requirements and Design: The Work of {Michael
                 Jackson}",
  title =        "The {Michael Jackson} design technique: A study of the
                 theory with applications",
  publisher =    "Good Friends Publishing Company",
  pages =        "??--??",
  year =         "2010",
  bibdate =      "Tue Aug 09 15:31:28 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://www.semanticscholar.org/paper/The-Michael-Jackson-Design-Technique-%3A-A-study-of-Hoare/eac2a5102a065f176d3b4dfbe5edc11299a5676d?p2df",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2010:TPH,
  author =       "C. A. R. Hoare",
  title =        "Testing and proving, hand in hand",
  crossref =     "Bottaci:2010:TAI",
  pages =        "5--6",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-15585-7_2",
  bibdate =      "Tue Aug 09 15:21:58 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/abs/10.5555/1885930.1885933",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2010:UCT,
  author =       "Tony Hoare and Natarajan Shankar",
  title =        "Unraveling a Card Trick",
  crossref =     "Manna:2010:TVE",
  pages =        "195--201",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-13754-9_10",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Rehof:2010:ADS,
  author =       "Niels Jakob Rehof and Anthony D. Andrews and Sriram K.
                 Rajamani and Charles Antony Richard Hoare and
                 C{\'e}dric Fournet",
  title =        "Analysis of distributed software systems via
                 specification substitution",
  howpublished = "US Patent number 7,797,669.",
  day =          "14",
  month =        sep,
  year =         "2010",
  bibdate =      "Wed Aug 10 16:46:14 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Patent filed 13 February 2004.",
  URL =          "https://patents.google.com/patent/US7797669",
  abstract =     "A distributed software system of communicating
                 software components can be tested for undesirable
                 behavior. A specification of a component can be
                 substituted in place of the component when testing a
                 model of the distributed software system. Thus, the
                 system can be checked to see if it exhibits undesirable
                 behavior without having code for all components of the
                 system. Also, a component can be checked to see if it
                 is in conformance with its specification. If models
                 built with respective components and substituted
                 specifications indicate that the system does not
                 exhibit undesirable behavior, and the components
                 conform to their specifications, then a system
                 assembled from the components will not exhibit the
                 undesirable behavior. Thus, collaborative testing can
                 be achieved, even if no one entity has access to code
                 for the entire distributed syste",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2011:CKA,
  author =       "Tony Hoare and Bernhard M{\"o}ller and Georg Struth
                 and Ian Wehrman",
  title =        "Concurrent {Kleene} algebra and its foundations",
  journal =      j-J-LOGIC-ALG-PROG,
  volume =       "80",
  number =       "6",
  pages =        "266--296",
  year =         "2011",
  DOI =          "https://doi.org/10.1016/j.jlap.2011.04.005",
  ISSN =         "1567-8326 (print), 1873-5940 (electronic)",
  ISSN-L =       "1567-8326",
  MRclass =      "68Q60 (03B70)",
  MRnumber =     "2887701",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "The Journal of Logic and Algebraic Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/15678326",
}

@InProceedings{Hoare:2011:LEL,
  author =       "C. A. R. Hoare and Akbar Hussain and Bernhard
                 M{\"o}ller and Peter W. O'Hearn and Rasmus Lerchedahl
                 Petersen and Georg Struth",
  editor =       "Joost-Pieter Katoen and Barbara K{\"o}nig",
  booktitle =    "{CONCUR 2011}---{Concurrency} theory: {22nd
                 International Conference, CONCUR 2011, Aachen, Germany,
                 September 6-9, 2011, Proceedings}",
  title =        "On locality and the exchange law for concurrent
                 processes",
  volume =       "6901",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "250--264",
  year =         "2011",
  DOI =          "https://doi.org/10.1007/978-3-642-23217-6_17",
  MRnumber =     "2878400",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2011:RB,
  author =       "Tony Hoare",
  title =        "Recovery Blocks",
  crossref =     "Jones:2011:DHC",
  pages =        "261--266",
  year =         "2011",
  DOI =          "https://doi.org/10.1007/978-3-642-24541-1_19",
  MRclass =      "68Q60",
  MRnumber =     "2875008",
  bibdate =      "Thu Mar 5 11:41:15 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2011a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-24541-1_19/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2011:UMD,
  author =       "C. A. R. Hoare and J. Wickerson",
  title =        "Unifying models of data flow",
  crossref =     "Broy:2011:SSS",
  pages =        "211--230",
  year =         "2011",
  DOI =          "https://doi.org/10.3233/978-1-60750-711-6-211",
  bibdate =      "Tue Aug 09 15:46:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2012:LPU,
  author =       "Tony Hoare and Stephan van Staden",
  title =        "The Laws of Programming Unify Process Calculi",
  crossref =     "Gibbons:2012:MPC",
  pages =        "7--22",
  year =         "2012",
  DOI =          "https://doi.org/10.1007/978-3-642-31113-0_2",
  MRclass =      "68N19",
  MRnumber =     "2988039",
  MRreviewer =   "Sergey Nikolayevich Baranov",
  bibdate =      "Wed Dec 19 15:20:29 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-31113-0_2/",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2012:MT,
  author =       "Tony Hoare",
  editor =       "John Field and Michael Hicks",
  booktitle =    "Proceedings of the {39th annual ACM SIGPLAN-SIGACT
                 symposium on Principles of programming languages ---
                 POPL '12, Philadelphia, Pennsylvania, USA, January
                 22--28, 2012}",
  title =        "Message of thanks: On the receipt of the {2011 ACM
                 SIGPLAN Distinguished Achievement Award}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "3--6",
  year =         "2012",
  DOI =          "https://doi.org/10.1145/2103656.2103659",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2012:MTR,
  author =       "Tony Hoare",
  title =        "Message of thanks: on the receipt of the {2011 ACM
                 SIGPLAN} distinguished achievement award",
  journal =      j-SIGPLAN,
  volume =       "47",
  number =       "1",
  pages =        "3--6",
  month =        jan,
  year =         "2012",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2103621.2103659",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Thu Mar 15 18:16:55 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "POPL '12 conference proceedings.",
}

@InProceedings{Hoare:2012:NMC,
  author =       "Tony Hoare",
  title =        "Net Models for Concurrent Object Behaviour",
  crossref =     "Haddad:2012:ATP",
  pages =        "1--2",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-31131-4_1",
  bibdate =      "Wed Dec 19 15:20:35 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
  URL =          "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-31131-4_1",
}

@Article{Hoare:2012:PA,
  author =       "Tony Hoare and Stephan van Staden",
  title =        "In praise of algebra",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "24",
  number =       "4--6",
  pages =        "423--431",
  month =        jul,
  year =         "2012",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/s00165-012-0249-0",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  MRclass =      "68Q85 (68Q45 68Q60)",
  MRnumber =     "2947260",
  bibdate =      "Tue Mar 17 20:58:43 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/s00165-012-0249-0",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@InProceedings{Hoare:2013:GML,
  author =       "Tony Hoare",
  title =        "Generic Models of the Laws of Programming",
  crossref =     "Liu:2013:TPF",
  pages =        "213--226",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-3-642-39698-4_13",
  bibdate =      "Mon Aug 1 11:42:42 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2013:LPC,
  author =       "Tony Hoare",
  title =        "Laws of programming with concurrency",
  crossref =     "Jones:2013:ICC",
  pages =        "1--1",
  year =         "2013",
  DOI =          "https://doi.org/10.4230/OASICS.ICCSW.2013.1",
  bibdate =      "Mon Aug 1 11:50:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Invited talk.",
  URL =          "http://drops.dagstuhl.de/opus/volltexte/2013/4284/",
  acknowledgement = ack-nhfb,
  keywords =     "Computer Science, 000 Computer science, knowledge,
                 general works",
}

@InCollection{Hoare:2013:USC,
  author =       "Tony Hoare",
  booktitle =    "Computation, Logic, Games, and Quantum Foundations.
                 {The} Many Facets of {Samson Abramsky}",
  title =        "Unifying semantics for concurrent programming",
  volume =       "7860",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "139--149",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-3-642-38164-5_10",
  MRclass =      "68Q55",
  MRnumber =     "3093090",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{vanStaden:2013:AUO,
  author =       "Stephan van Staden and Tony Hoare",
  title =        "Algebra Unifies Operational Calculi",
  crossref =     "Wolff:2013:UTP",
  pages =        "88--104",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-3-642-35705-3_4",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2014:DCK,
  author =       "Tony Hoare and Stephan van Staden and Bernhard
                 M{\"o}ller and Georg Struth and Jules Villard and
                 Huibiao Zhu and Peter O'Hearn",
  title =        "Developments in concurrent {Kleene} algebra",
  crossref =     "Hofner:2014:RAM",
  pages =        "1--18",
  year =         "2014",
  DOI =          "https://doi.org/10.1007/978-3-319-06251-8_1",
  MRclass =      "68Q85 (03G25 68Q45)",
  MRnumber =     "3199273",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  xxbooktitle =  "Concurrent {Kleene} Algebras and Related Formalisms",
}

@Article{Hoare:2014:LCP,
  author =       "Tony Hoare",
  title =        "Laws of concurrent programming",
  journal =      j-SIGPLAN,
  volume =       "49",
  number =       "6",
  pages =        "168--168",
  month =        jun,
  year =         "2014",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2666356.2604002",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Fri Sep 26 07:38:28 MDT 2014",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "The talk extends the Laws of Programming [1] by four
                 laws governing concurrent composition of programs. This
                 operator is associative and commutative and
                 distributive through union; and it has the same unit
                 (do nothing) as sequential composition. Furthermore,
                 sequential and concurrent composition distribute
                 through each other, in accordance with an exchange law;
                 this permits an implementation of concurrency by
                 partial interleaving.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  received =     "PLDI '14 conference proceedings.",
}

@Article{Hoare:2014:LPU,
  author =       "Tony Hoare and Stephan van Staden",
  title =        "The laws of programming unify process calculi",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "85",
  number =       "(part B)",
  pages =        "102--114",
  day =          "1",
  month =        jun,
  year =         "2014",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1007/978-3-642-31113-0_2",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Wed Mar 26 16:41:19 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0167642313002207",
  acknowledgement = ack-nhfb,
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
}

@InCollection{Moller:2015:EIM,
  author =       "Bernhard M{\"o}ller and Tony Hoare",
  booktitle =    "Mathematics of program construction",
  title =        "Exploring an interface model for {CKA}",
  volume =       "9129",
  publisher =    "Springer, Cham",
  pages =        "1--29",
  year =         "2015",
  DOI =          "https://doi.org/10.1007/978-3-319-19797-5_1",
  MRclass =      "68Q85",
  MRnumber =     "3419976",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{Hoare:2016:DCK,
  author =       "Tony Hoare and Stephan van Staden and Bernhard
                 M{\"o}ller and Georg Struth and Huibiao Zhu",
  title =        "Developments in concurrent {Kleene} algebra",
  journal =      "J. Log. Algebr. Methods Program.",
  volume =       "85",
  number =       "4",
  pages =        "617--636",
  year =         "2016",
  DOI =          "https://doi.org/10.1016/j.jlamp.2015.09.012",
  ISSN =         "2352-2208",
  MRclass =      "68Q70 (68Q65 68Q85)",
  MRnumber =     "3506601",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Logical and Algebraic Methods in
                 Programming",
}

@Misc{Hoare:2016:PST,
  author =       "C. A. R. Hoare and Cliff B. Jones",
  title =        "{Professor Sir Tony Hoare: ACM Turing Award Winner
                 1980}",
  howpublished = "Online video interview.",
  pages =        "29",
  day =          "24",
  month =        nov,
  year =         "2016",
  bibdate =      "Tue Aug 09 16:30:27 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://amturing.acm.org/pdf/HoareTuringTranscript.pdf",
  acknowledgement = ack-nhfb,
  remark =       "The interview discusses how Tony Hoare learned Russian
                 well enough to serve as a translator between that
                 language and English..",
}

@InCollection{Hoare:2019:CSTa,
  author =       "Tony Hoare and Georg Struth and Jim Woodcock",
  booktitle =    "Unifying theories of programming",
  title =        "A calculus of space, time, and causality: its algebra,
                 geometry, logic",
  volume =       "11885",
  publisher =    "Springer, Cham",
  pages =        "3--21",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_1",
  MRclass =      "68Q85",
  MRnumber =     "4025921",
  MRreviewer =   "Siva Anantharaman",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2021:ATA,
  author =       "Tony Hoare",
  title =        "The {1980 ACM Turing Award Lecture}",
  crossref =     "Jones:2021:TPL",
  pages =        "1--22",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477357",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2021:CSP,
  author =       "C. A. R. Hoare",
  title =        "Communicating Sequential Processes",
  crossref =     "Jones:2021:TPL",
  pages =        "157--186",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477364",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2021:E,
  author =       "Tony Hoare",
  title =        "Envoi",
  crossref =     "Jones:2021:TPL",
  pages =        "347--356",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477371",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2021:PSI,
  author =       "C. A. R. Hoare and Jayadev Misra",
  title =        "Preface to Special Issue on Software Verification",
  crossref =     "Jones:2021:TPL",
  pages =        "77--80",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477360",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2021:VSI,
  author =       "Tony Hoare and Jayadev Misra and Gary T. Leavens and
                 Natarajan Shankar",
  title =        "The {Verified Software Initiative}: a Manifesto",
  crossref =     "Jones:2021:TPL",
  pages =        "81--92",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477361",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hoare:2022:FYE,
  author =       "Tony Hoare",
  booktitle =    "{Edsger Wybe Dijkstra}: His Life, Work, and Legacy",
  title =        "Forty Years with {Edsger}",
  crossref =     "Apt:2022:EWD",
  chapter =      "25",
  pages =        "411--422",
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3544585.3544612",
  bibdate =      "Wed Aug 10 15:56:25 2022",
  bibsource =    "dblp computer science bibliography;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 https://dblp.org",
  acknowledgement = ack-nhfb,
  biburl =       "https://dblp.org/rec/books/mc/22/Hoare22.bib",
  timestamp =    "Wed Nov  9 10:14:46 2022",
}

%%% ====================================================================
%%% Part 2 (of 2) --- Publications about Sir C. A. R. Hoare and his works

@Article{Baer:1965:RPP,
  author =       "R. M. Baer",
  title =        "Recent Publications and Presentations: {{\em The
                 Theory of Mathematical Machines}}, by {Yu. Ya.
                 Bazilevskii and C. A. R. Hoare}",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "72",
  number =       "2",
  pages =        "207--207",
  month =        feb,
  year =         "1965",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  bibdate =      "Thu Jul 8 18:23:41 MDT 1999",
  bibsource =    "http://www.jstor.org/journals/00029890.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "American Mathematical Monthly",
  journal-URL =  "http://www.jstor.org/page/journal/amermathmont/about.html",
}

@Unpublished{Dijkstra:1970:LPC,
  author =       "Edsger W. Dijkstra",
  title =        "Letter to professor {C. A. R. Hoare} (31 {August}
                 1970)",
  month =        aug,
  year =         "1970",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd02xx/EWD292.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "123 KB",
  oldlabel =     "EWD:EWD292",
}

@Article{Dijkstra:1971:HOS,
  author =       "Edsger W. Dijkstra",
  title =        "Hierarchical Ordering of Sequential Processes",
  journal =      j-ACTA-INFO,
  volume =       "1",
  number =       "2",
  pages =        "115--138",
  month =        oct,
  year =         "1971",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68A05",
  MRnumber =     "0324939 (48 \#3288)",
  MRreviewer =   "K. H. V. Booth",
  bibdate =      "Sun Jan 15 17:52:42 1984",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Os/os.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib",
  note =         "Reprinted in {\em Operating Systems Techniques\/}, C.
                 A. R. Hoare and R. H. Perrot, Eds., Academic Press,
                 1972, pp. 72--93. This paper introduces the classical
                 synchronization problem of Dining Philosophers.",
  abstract =     "One of the primary functions of an operating system is
                 to rebuild a machine that must be regarded as
                 non-deterministic (on account of cycle stealing and
                 interrupts) into a more or less deterministic
                 automaton. Taming the degree of indeterminacy in steps
                 will lead to a layered operating system. A bottom layer
                 will be discussed and so will the adequacy of the
                 interface it presents. An analysis of the requirements
                 of the correctness proofs will give us an insight into
                 the logical issues at hand. A `director-secretary'
                 relationship will be introduced to reflect a possible
                 discipline in the use of sequencing primitives.",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  keywords =     "Deadlocks; operating systems synchronization
                 communication; Semaphore",
}

@InCollection{Dijkstra:1972:NSP,
  author =       "Edsger W. Dijkstra",
  title =        "Notes on structured programming",
  crossref =     "Dahl:1972:SP",
  chapter =      "I",
  pages =        "1--82",
  year =         "1972",
  bibdate =      "Mon Aug 01 16:58:43 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Brockhaus:1973:BRC,
  author =       "M. Brockhaus",
  title =        "{Book review: C. A. R. Hoare und R. H. Perrot (Hrsg.),
                 Operating Systems Techniques}",
  journal =      j-COMPUTING,
  volume =       "11",
  number =       "1",
  pages =        "99--99",
  month =        mar,
  year =         "1973",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Thu Jan 04 08:48:01 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computing.bib",
  acknowledgement = ack-ec,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Article{Barth:1974:BRJ,
  author =       "W. Barth",
  title =        "Book Review: {O. J. Dahl, W. Dijkstra und C. A. R.
                 Hoare, Structured Programming}",
  journal =      j-COMPUTING,
  volume =       "12",
  number =       "3",
  pages =        "285--285",
  month =        sep,
  year =         "1974",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Thu Jan 04 08:49:27 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computing.bib",
  acknowledgement = ack-ec,
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
}

@Unpublished{Dijkstra:1974:LCR,
  author =       "Edsger W. Dijkstra",
  title =        "[A letter to {C. A. R. Hoare}, 13 {July} 1974]",
  month =        jul,
  year =         "1974",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd04xx/EWD432.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "88 KB",
  oldlabel =     "EWD:EWD432",
}

@Article{Lloyd:1974:BRS,
  author =       "Cliff Lloyd",
  title =        "Book Review: {{\booktitle{Structured programming}}, by
                 O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare}",
  journal =      j-COMP-J,
  volume =       "17",
  number =       "2",
  pages =        "186--186",
  month =        may,
  year =         "1974",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/17.2.186",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Sat Oct 07 10:23:37 2000",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1970.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_17/Issue_02/tiff/186.tif",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Barron:1975:BRS,
  author =       "D. W. Barron",
  title =        "Book Review: {{\booktitle{Structured Programming}},
                 O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare, Academic
                 Press, London, 1972. No. of pages: 220. Price: \pounds
                 4.20}",
  journal =      j-SPE,
  volume =       "5",
  number =       "3",
  pages =        "314--315",
  month =        jul,
  year =         "1975",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380050313",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Wed Sep 10 12:36:39 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/spe.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
}

@Unpublished{Dijkstra:1975:VTO,
  author =       "Edsger W. Dijkstra",
  title =        "Variations on a theme: an open letter to {C. A. R.
                 Hoare}",
  month =        jul,
  year =         "1975",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Published as \cite{Dijkstra:1982:VTO}.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd05xx/EWD501.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "285 KB",
  oldlabel =     "EWD:EWD501",
}

@Article{Floyd:1975:AAA,
  author =       "Robert W. Floyd and Ronald L. Rivest",
  title =        "{ACM Algorithm 489}: The Algorithm {SELECT} --- for
                 Finding the $i$-th Smallest of $n$ Elements [{M1}]",
  journal =      j-CACM,
  volume =       "18",
  number =       "3",
  pages =        "173--173",
  month =        mar,
  year =         "1975",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:40:04 MST 2001",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#FloydR75a;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib",
  note =         "See also \cite{Brown:1976:RAA}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Computer Sci. Dept., Stanford Univ., Stanford, CA,
                 USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "algorithm SELECT; Hoare's algorithm FIND; mathematics;
                 sampling; subroutines",
  oldlabel =     "FloydR75a",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/FloydR75a",
}

@Article{Brown:1976:RAA,
  author =       "Theodore Brown",
  title =        "Remark on ``{Algorithm 489: The Algorithm SELECT ---
                 for Finding the $i$-th Smallest of $n$ Elements
                 [M1]}''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "301--304",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500 (print), 1557-7295 (electronic)",
  ISSN-L =       "0098-3500",
  bibdate =      "Tue Feb 06 05:26:24 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1970.bib",
  note =         "See \cite{Floyd:1975:AAA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Mathematical Software",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J782",
}

@InProceedings{Pratt:1976:SCF,
  author =       "Vaughn R. Pratt",
  title =        "Semantical considerations on {Floyd--Hoare} logic",
  crossref =     "IEEE:1976:ASF",
  pages =        "109--121",
  year =         "1976",
  bibdate =      "Thu Aug 04 11:01:31 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wand:1976:NIR,
  author =       "Mitchell Wand",
  title =        "A new incompleteness result for {Hoare}'s system",
  crossref =     "ACM:1976:SPE",
  pages =        "87--91",
  year =         "1976",
  DOI =          "https://doi.org/10.1145/800113.803635",
  bibdate =      "Wed Feb 20 18:33:30 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/stoc1970.bib",
  acknowledgement = ack-nhfb,
}

@Unpublished{Dijkstra:1977:MSM,
  author =       "Edsger W. Dijkstra",
  title =        "On making solutions more and more fine-grained (In
                 gratitude dedicated to {C. A. R. Hoare}, {D. E. Knuth},
                 and {J. F. Traub}.)",
  month =        may,
  year =         "1977",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Published as \cite{Dijkstra:1982:MSMa}.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd06xx/EWD622.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "482 KB",
  oldlabel =     "EWD:EWD622",
}

@Article{Neuhold:1977:UHM,
  author =       "E. J. Neuhold and R. Studer",
  title =        "The use of {Hoare}'s method of program verification
                 for the {Quicksort} algorithm",
  journal =      j-COMPUTING,
  volume =       "18",
  number =       "4",
  pages =        "281--293",
  month =        dec,
  year =         "1977",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:53 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computing.bib;
                 INSPEC Axiom database (1968--date)",
  note =         "See coments \cite{Pritchard:1979:CPJ}.",
  ZMnumber =     "361.68012",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of Stuttgart, Stuttgart, West Germany",
  classification = "C4240; C6130",
  description =  "programming theory; sorting",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "Hoare's method; program verification; Quicksort
                 algorithm",
}

@Article{Wand:1978:NIR,
  author =       "Mitchell Wand",
  title =        "A new Incompleteness Result for {Hoare}'s System",
  journal =      j-J-ACM,
  volume =       "25",
  number =       "1",
  pages =        "168--175",
  month =        jan,
  year =         "1978",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322047.322062",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
}

@Article{Cherniavsky:1979:CCH,
  author =       "John C. Cherniavsky and Samuel N. Kamin",
  title =        "A Complete and Consistent {Hoare} Axiomatics for a
                 Simple Programming Language",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "119--128",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322108.322120",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "A simple programming language $ L_m $ is defined for
                 which a complete axiomatics is obtainable. Completeness
                 is shown by presenting a relatively complete Hoare
                 axiomatics, demonstrating, by direct construction, that
                 the first-order theory of addition $ P_+ $ is
                 expressive, and noting that $ P_+ $ is complete. It is
                 then shown that $ L_m $ is maximal with this property.
                 Further, a notion of complexity of a Hoare system is
                 introduced based upon the lengths of proofs
                 (disregarding proofs in the underlying logic), and the
                 system $ L_m $, $ P_+ $ is shown to have polynomial
                 complexity. The notion is shown to be nontrivial by
                 presenting a language for which any Hoare axiom system
                 has exponential complexity.",
  acknowledgement = ack-nhfb,
  classification = "723",
  conference =   "ACM Symp on Princ of Program Lang, 5th, Pap",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
  meetingaddress = "Tucson, AZ, USA",
  meetingdate =  "Jan 23--25 1978",
  meetingdate2 = "01/23--25/78",
}

@Article{Clarke:1979:PLC,
  author =       "Edmund Melson {Clarke, Jr.}",
  title =        "Programming Language Constructs for Which It Is
                 Impossible To Obtain Good {Hoare} Axiom Systems",
  journal =      j-J-ACM,
  volume =       "26",
  number =       "1",
  pages =        "129--147",
  month =        jan,
  year =         "1979",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322108.322121",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "Hoare axiom systems for establishing partial
                 correctness of programs may fail to be complete because
                 of (a) incompleteness of the assertion language
                 relative to the underlying interpretation or (b)
                 inability of the assertion language to express the
                 invariants of loops. S. A. Cook has shown that if there
                 is a complete proof system for the assertion language
                 (i.e. all true formulas of the assertion language) and
                 if the assertion language satisfies a natural
                 expressibility condition then a sound and complete
                 axiom system for a large subset of Algol may be
                 devised. Programming language constructs are exhibited
                 for which it is impossible to obtain sound and complete
                 sets of Hoare axioms even in this special sense of
                 Cook's. These constructs include (i) recursive
                 procedures with procedure parameters in a programming
                 language which uses static scope of identifiers and
                 (ii) coroutines in a language which allows
                 parameterless recursive procedures. Modifications of
                 these constructs for which sound and complete systems
                 of axioms may be obtained are also discussed.",
  acknowledgement = ack-nhfb,
  classification = "723",
  conference =   "ACM Symp on Princ of Program Lang, 5th, Pap",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
  meetingaddress = "Tucson, AZ, USA",
  meetingdate =  "Jan 23--25 1978",
  meetingdate2 = "01/23--25/78",
}

@Article{Pritchard:1979:CPJ,
  author =       "P. Pritchard",
  title =        "Comments on a paper by {E. J. Neuhold} and {R.
                 Studer}: {``The use of Hoare's method of program
                 verification for the quick-sort algorithm'' [Computing
                 {\bf 18} (1977), no. 4, 281--293; MR {\bf 56}
                 \#13753]}",
  journal =      j-COMPUTING,
  volume =       "22",
  number =       "3",
  pages =        "279--282",
  month =        sep,
  year =         "1979",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "68B10",
  MRnumber =     "82j:68008",
  bibdate =      "Tue Jan 2 17:40:54 MST 2001",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computing.bib;
                 INSPEC Axiom database (1968--date); MathSciNet
                 database",
  note =         "See \cite{Neuhold:1977:UHM}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Computer Sci., Univ. of Queensland, Brisbane,
                 Qld., Australia",
  classification = "C6110",
  description =  "programming",
  fjournal =     "Computing",
  journal-URL =  "http://link.springer.com/journal/607",
  keywords =     "Boolean expressions; program verification",
}

@Article{Lamport:1980:HLC,
  author =       "Leslie Lamport",
  title =        "The ``{Hoare} Logic'' of Concurrent Programs",
  journal =      j-ACTA-INFO,
  volume =       "14",
  number =       "1",
  pages =        "21--37",
  month =        jun,
  year =         "1980",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68B10 (68C01)",
  MRnumber =     "81f:68024",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.2.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  enteredby =    "Glenn S Benson (benson@dove)",
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
  keywords =     "concurrent programs; Hoare logic",
  timestamp =    "Tue Aug 9 14:01:06 2022",
}

@Article{Apt:1981:TYH,
  author =       "Krzysztof R. Apt",
  title =        "Ten Years of {Hoare}'s Logic: a Survey --- {Part I}",
  journal =      j-TOPLAS,
  volume =       "3",
  number =       "4",
  pages =        "431--483",
  month =        oct,
  year =         "1981",
  CODEN =        "ATPSDT",
  DOI =          "https://doi.org/10.1145/357146.357150",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "Compiler/prog.lang.theory.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  note =         "See also Part II \cite{Apt:1984:TYH}.",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
}

@Article{Csirmaz:1981:PPV,
  author =       "L. Csirmaz",
  title =        "Programs and program verifications in a general
                 setting",
  journal =      j-THEOR-COMP-SCI,
  volume =       "16",
  number =       "2",
  pages =        "199--210",
  month =        nov,
  year =         "1981",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(81)90076-1",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Math. Inst., Hungarian Acad. of Sci., Budapest,
                 Hungary",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; Floyd-Hoare derivability; halting
                 configurations; Peano models; program testing; program
                 verifications; programming theory; standard programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ekanadham:1981:MN,
  author =       "K. Ekanadham and A. Mahjoub",
  title =        "Microcomputer Networks",
  journal =      j-COMP-J,
  volume =       "24",
  number =       "1",
  pages =        "17--24",
  month =        feb,
  year =         "1981",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/24.1.17",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:09 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/24/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/24/1/17.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/17.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/18.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/19.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/20.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/21.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/22.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/23.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/24.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "B6210L (Computer communications); C5250 (Microcomputer
                 techniques); C5620 (Computer networks and techniques)",
  classification = "723",
  corpsource =   "Dept. of Computer Sci., State Univ. of New York, Stony
                 Brook, NY, USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "2-dimensional network; computer networks; computers,
                 microprocessor; distributed kernel; Hoare command;
                 Input/Output commands; message; message handling;
                 microcomputers; transfer delays",
  treatment =    "N New Development",
}

@Article{Greif:1981:SSW,
  author =       "Irene Greif and Albert R. Meyer",
  title =        "Specifying the Semantics of while Programs: a Tutorial
                 and Critique of a Paper by {Hoare} and {Lauer}",
  journal =      j-TOPLAS,
  volume =       "3",
  number =       "4",
  pages =        "484--507",
  month =        oct,
  year =         "1981",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
}

@TechReport{Kernighan:1981:WPM,
  author =       "Brian W. Kernighan",
  title =        "Why {Pascal} is not my favorite programming language",
  type =         "Computer Science Report",
  number =       "100",
  institution =  pub-ATT-BELL,
  address =      pub-ATT-BELL:adr,
  month =        jul,
  year =         "1981",
  bibdate =      "Tue May 24 05:47:36 2005",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  note =         "Published in \cite{Kernighan:1984:WPM}. See also
                 \cite{Welsh:1977:AIP}",
  URL =          "http://cm.bell-labs.com/cm/cs/cstr/100.ps.gz",
  acknowledgement = ack-nhfb,
}

@Article{Olderog:1981:SCH,
  author =       "Ernst-R{\"u}diger Olderog",
  title =        "Sound and Complete {Hoare}-like Calculi Based on Copy
                 Rules",
  journal =      j-ACTA-INFO,
  volume =       "16",
  number =       "2",
  pages =        "161--197",
  month =        oct,
  year =         "1981",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68B10",
  MRnumber =     "83c:68018",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@Article{Silberschatz:1981:PDC,
  author =       "A. Silberschatz",
  title =        "Port Directed Communication",
  journal =      j-COMP-J,
  volume =       "24",
  number =       "1",
  pages =        "78--82",
  month =        feb,
  year =         "1981",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/24.1.78",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:09 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/24/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/24/1/78.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/78.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/79.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/80.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/81.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_24/Issue_01/tiff/82.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C5620 (Computer networks and techniques)",
  classification = "723",
  corpsource =   "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
                 USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "communicating; communication; computer networks;
                 computers, digital; distributed storage; Hoare command;
                 sequential process; synchronisation",
  treatment =    "A Application",
}

@Article{Bergstra:1982:ECH,
  author =       "J. A. Bergstra and J. V. Tucker",
  title =        "Expressiveness and the completeness of {Hoare}'s
                 logic",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "25",
  number =       "3",
  pages =        "267--284",
  month =        dec,
  year =         "1982",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(82)90013-7",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Tue Jan 29 15:25:48 MST 2019",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000082900137",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Bergstra:1982:SNS,
  author =       "J. A. Bergstra and J. V. Tucker",
  title =        "Some natural structures which fail to possess a sound
                 and decidable {Hoare}-like logic for their
                 while-programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "17",
  number =       "3",
  pages =        "303--315",
  month =        mar,
  year =         "1982",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(82)90027-5",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Leiden, Leiden,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; decidable
                 Hoare-like logic; formal logic; natural structures;
                 partial correctness; programming language; programming
                 theory; structural properties; while-programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bergstra:1982:TTA,
  author =       "J. A. Bergstra and J. V. Tucker",
  title =        "Two Theorems About the Completeness of {Hoare}'s
                 Logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "15",
  number =       "4",
  pages =        "143--149",
  day =          "31",
  month =        oct,
  year =         "1982",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68B10 (03B45)",
  MRnumber =     "84f:68008",
  MRreviewer =   "Stephen L. Bloom",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  acknowledgement = ack-nhfb,
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Leiden, Leiden,
                 Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "completeness; completion theorem; computer metatheory
                 --- Programming Theory; computer programming; data type
                 specifications; Hoare's logic; normal form theorem;
                 partial correctness; Peano arithmetic; programming
                 theory; refinements; strongest post condition; while-
                 programs; while-programs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cocco:1982:MEH,
  author =       "N. Cocco and S. Dulli",
  title =        "A mechanism for exception handling and its
                 verification rules",
  journal =      j-COMP-LANGS,
  volume =       "7",
  number =       "2",
  pages =        "89--102",
  month =        "????",
  year =         "1982",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages)",
  corpsource =   "Seminario Matematico, Univ. di Padova, Padova, Italy",
  fjournal =     "Computer Languages",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  keywords =     "components; control structure; correctness; design
                 errors; exception handling; formal; hardware; high
                 level languages; Hoare type verification rules;
                 modularity; procedure-oriented language; recovery
                 mechanism; specification; structured programming;
                 system recovery; verification",
  treatment =    "P Practical",
}

@InCollection{Dijkstra:1982:MSMa,
  author =       "Prof. Dr. Edsger W. Dijkstra",
  title =        "On Making Solutions More and More Fine-Grained ({In}
                 gratitude dedicated to {C. A. R. Hoare}, {D. E. Knuth},
                 and {J. F. Traub})",
  crossref =     "Dijkstra:1982:SWC",
  pages =        "292--307",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-1-4612-5695-3_53",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-1-4612-5695-3_53",
  acknowledgement = ack-nhfb,
  oldlabel =     "EWD:EWD622pub",
}

@Unpublished{Dijkstra:1982:PTP,
  author =       "Edsger W. Dijkstra",
  title =        "From predicate transformers to predicates ({Dedicated}
                 by the {Tuesday Afternoon Club} to {C. A. R. Hoare} at
                 the occasion of his being elected {Fellow of the Royal
                 Society})",
  month =        apr,
  year =         "1982",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd08xx/EWD821.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "40 KB",
  oldlabel =     "EWD:EWD821",
}

@InCollection{Dijkstra:1982:VTO,
  author =       "Edsger W. Dijkstra",
  title =        "Variations on a theme: an open letter to {C. A. R.
                 Hoare}",
  crossref =     "Dijkstra:1982:SWC",
  pages =        "132--140",
  year =         "1982",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  oldlabel =     "EWD:EWD501pub",
}

@Article{Kirkerud:1982:CHC,
  author =       "Bj{\o}rn Kirkerud",
  title =        "Completeness of {Hoare}-calculi revisited",
  journal =      j-BIT,
  volume =       "22",
  number =       "4",
  pages =        "401--418",
  month =        dec,
  year =         "1982",
  CODEN =        "BITTEL, NBITAB",
  DOI =          "https://doi.org/10.1007/BF01934406",
  ISSN =         "0006-3835 (print), 1572-9125 (electronic)",
  ISSN-L =       "0006-3835",
  MRclass =      "68B10 (03B60)",
  MRnumber =     "84g:68013",
  MRreviewer =   "P. Ecsedi-T{\'o}th",
  bibdate =      "Wed Jan 4 18:52:17 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=22&issue=4;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/bit.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=22&issue=4&spage=401",
  acknowledgement = ack-nhfb,
  fjournal =     "BIT (Nordisk tidskrift for informationsbehandling)",
  journal-URL =  "http://link.springer.com/journal/10543",
  xxpages =      "402--418??",
}

@Article{ODonnell:1982:CFH,
  author =       "M. J. O'Donnell",
  title =        "A Critique of the Foundations of {Hoare} Style
                 Programming Logics",
  journal =      j-CACM,
  volume =       "25",
  number =       "12",
  pages =        "927--934",
  month =        dec,
  year =         "1982",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  abstract =     "Much recent discussion in computing journals has been
                 devoted to arguments about the feasibility and
                 usefulness of formal verification methods. Too little
                 attention has been given to precise criticism of
                 specific proposed systems for reasoning about programs.
                 Wether such systems are to be used for formal
                 verification, by hand or automatically, or as a
                 rigorous foundation for informal reasoning, it is
                 essential that they be logically sound. Several popular
                 rules in the Hoare language are, in fact, not sound.
                 These rules have been accepted because they have not
                 been subjected to sufficiently strong standards of
                 correctness. This paper attempts to clarify the
                 different technical definitions of correctness of a
                 logic, to show that only the strongest of these
                 definitions is acceptable for Hoare logic, and to
                 correct some of the unsound rules that have appeared in
                 the literature. The corrected rules are given merely to
                 show that it is possible to do so. Convenient and
                 elegant rules for reasoning about certain programming
                 constructs will probably require a more flexible
                 notation than Hoare's.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Bergstra:1983:HLP,
  author =       "J. A. Bergstra and J. V. Tucker",
  title =        "{Hoare}'s logic and {Peano}'s arithmetic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "22",
  number =       "3",
  pages =        "265--284",
  month =        feb,
  year =         "1983",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(83)90107-X",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Leiden, Leiden,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "formal logic; Hoare's logic; partial correctness;
                 Peano's arithmetic; programming theory; proof theory;
                 strongest postcondition calculus; while-programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Clarke:1983:EAH,
  author =       "Edmund M. {Clarke, Jr.} and Steven M. German and
                 Joseph Y. Halpern",
  title =        "Effective Axiomatizations of {Hoare} Logics",
  journal =      j-J-ACM,
  volume =       "30",
  number =       "3",
  pages =        "612--636",
  month =        jul,
  year =         "1983",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/322108.322121",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Wed Jan 15 18:12:53 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  abstract =     "For a wide class of programming languages P and
                 expressive interpretatIons I, it is shown that there
                 exist sound and relatively complete Hoare logics for
                 both partial-correctness and termination assertions. In
                 fact, under mild assumptions on P and I it is shown
                 that the assertions of the I ARE uniformly decidable in
                 the theory of I (Th(I)) if the halting problem for P is
                 decidable for finite interpretations. Moreover the set
                 of true termination assertions is uniformity
                 recursively enumerable in Th(I) even if the halting
                 problem for P is not decidable for finite
                 interpretations. Since total-correctness assertions
                 coincide with termination assertions for deterministic
                 programming languages, this last result unexpectedly
                 suggests that good axiom systems for total correctness
                 may exist for a wider spectrum of languages than is the
                 case for partial correctness.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "computer programming languages",
}

@Article{Damm:1983:SRH,
  author =       "Werner Damm and Bernhard Josko",
  title =        "A Sound and Relatively $^*$Complete {Hoare}-Logic for
                 a Language With Higher Type Procedures",
  journal =      j-ACTA-INFO,
  volume =       "20",
  number =       "1",
  pages =        "59--101",
  month =        oct,
  year =         "1983",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68Q60 (03B70)",
  MRnumber =     "85c:68048",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@InProceedings{Olderog:1983:CHL,
  author =       "Ernst-R{\"u}diger Olderog",
  title =        "A characterization of {Hoare}'s logic for programs
                 with {Pascal-like} procedures",
  crossref =     "ACM:1983:PFA",
  pages =        "320--329",
  year =         "1983",
  bibdate =      "Thu Feb 21 06:51:34 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
  acknowledgement = ack-nhfb,
}

@Article{Olderog:1983:NER,
  author =       "Ernest-R{\"u}diger Olderog",
  title =        "On the notion of expressiveness and the rule of
                 adaptation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "24",
  number =       "3",
  pages =        "337--347",
  month =        aug,
  year =         "1983",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(83)90009-9",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. fur Informatik und Praktische Math.,
                 Christian-Albrechts-Univ. Kiel, Kiel, West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "assertion language; completeness; expressiveness;
                 formal logic; Hoarelike proof systems; rule of
                 adaptation; soundness",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Apt:1984:TYH,
  author =       "K. R. Apt",
  title =        "Ten years of Hoares logic: a survey. {II}.
                 Nondeterminism",
  journal =      j-THEOR-COMP-SCI,
  volume =       "28",
  number =       "1--2",
  pages =        "83--109",
  month =        jan,
  year =         "1984",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(83)90066-X",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  note =         "See also Part I \cite{Apt:1981:TYH}.",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "LITP Univ. Paris, Paris, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "correctness; fairness; formal logic; Hoares logic;
                 nondeterministic programs; survey",
  pubcountry =   "Netherlands",
  treatment =    "G General Review",
}

@Article{Bergstra:1984:ASP,
  author =       "Jan A. Bergstra and J. V. Tucker",
  title =        "The Axiomatic Semantics of Programs Based on {Hoare}'s
                 Logic",
  journal =      j-ACTA-INFO,
  volume =       "21",
  number =       "3",
  pages =        "293--320",
  month =        oct,
  year =         "1984",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68Q55 (03B70)",
  MRnumber =     "86g:68105",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/actainfo.bib;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://link.springer.com/journal/236",
}

@Article{Bergstra:1984:HLP,
  author =       "J. A. Bergstra and J. V. Tucker",
  title =        "{Hoare}'s logic for programming languages with two
                 data types",
  journal =      j-THEOR-COMP-SCI,
  volume =       "28",
  number =       "1--2",
  pages =        "215--221",
  month =        jan,
  year =         "1984",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(83)90072-5",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Computer Sci., Math. Centre, Amsterdam,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Boolean functions; Boolean variables; completeness;
                 counters; data types; first-order assertion language;
                 formal languages; Hoare's logic; programming languages;
                 while-programs",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bergstra:1984:PPI,
  author =       "J. A. Bergstra and J. W. Klop",
  title =        "Proving program inclusion using {Hoare}'s logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "30",
  number =       "1",
  pages =        "1--48",
  month =        apr,
  year =         "1984",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(84)90065-3",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Leiden, Leiden,
                 Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "conservative refinements; formal logic; Hoare's logic;
                 program correctness; program inclusion; programming
                 theory; proof theory; specifications",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dasgupta:1984:UHL,
  author =       "Subrata Dasgupta and Alan Wagner",
  title =        "The use of {Hoare} logic in the verification of
                 horizontal microprograms",
  journal =      j-INT-J-COMPUT-INF-SCI,
  volume =       "13",
  number =       "6",
  pages =        "461--490",
  month =        dec,
  year =         "1984",
  CODEN =        "IJCIAH",
  ISSN =         "0091-7036",
  MRclass =      "68Q60 (03B70)",
  MRnumber =     "87a:68118",
  MRreviewer =   "W. Damm",
  bibdate =      "Sat Apr 26 14:03:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Center for Adv. Comput. Studies, Southwestern
                 Louisiana Univ., Lafayette, LA, USA",
  fjournal =     "International Journal of Computer and Information
                 Sciences",
  journal-URL =  "http://link.springer.com/journal/10766",
  keywords =     "axiomatic definition; firmware verification; formal
                 languages; formal verification; Hoare logic; horizontal
                 microprograms; inductive assertion method; machine
                 dependent microprogramming language; microprogramming;
                 Nanodata QM-1; program verification; S*(QM-1)",
  treatment =    "T Theoretical or Mathematical",
}

@InCollection{Kernighan:1984:WPM,
  author =       "Brian W. Kernighan",
  title =        "Why {Pascal} is Not My Favorite Programming Language",
  crossref =     "Feuer:1984:CAP",
  pages =        "170--186",
  year =         "1984",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib",
  note =         "See also \cite{Welsh:1977:AIP,Kernighan:1981:WPM}.",
  acknowledgement = ack-nhfb,
  xxURL =        "http://doc.cat-v.org/bell_labs/why_pascal/why_pascal_is_not_my_favorite_language.pdf",
}

@Article{Lamport:1984:HLC,
  author =       "Leslie Lamport and Fred B. Schneider",
  title =        "The ``{Hoare} Logic'' of {CSP}, and All That",
  journal =      j-TOPLAS,
  volume =       "6",
  number =       "2",
  pages =        "281--296",
  month =        apr,
  year =         "1984",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
}

@Article{Lifschitz:1984:VPG,
  author =       "Vladimir Lifschitz",
  title =        "On verification of programs with {GOTO} statements",
  journal =      j-INFO-PROC-LETT,
  volume =       "18",
  number =       "4",
  pages =        "221--225",
  day =          "14",
  month =        may,
  year =         "1984",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B70)",
  MRnumber =     "86h:68120",
  MRreviewer =   "Andrzej Blikle",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Computer Sci. Dept., Univ. of Texas, El Paso, TX,
                 USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "annotated program; complete proofs; correctness proof;
                 de Bruin; equivalence; GOTO statements; Hoare's logic;
                 informal proof; intermittent assertions; programming
                 theory; programs; syntax",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Olderog:1984:CPP,
  author =       "Ernest-R{\"u}diger Olderog",
  title =        "Correctness of programs with {PASCAL}-like procedures
                 without global variables",
  journal =      j-THEOR-COMP-SCI,
  volume =       "30",
  number =       "1",
  pages =        "49--90",
  month =        apr,
  year =         "1984",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(84)90066-5",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C6140D (High level languages)",
  corpsource =   "Inst. fur Informatik und Praktische Math.,
                 Christian-Albrechts-Univ. Kiel, Kiel, West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "blockstructured programs; formal computation trees;
                 formal logic; global variables; high level languages;
                 Hoare-like system; L/sub Pas/; partial correctness;
                 PASCAL-like procedures; programming language; programs
                 correctness",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Morgan:1985:SSN,
  author =       "C. C. Morgan and C. A. R. Hoare",
  editor =       "B. T. Denvir and W. T. Harwood and M. I. Jackson",
  booktitle =    "{he Analysis of Concurrent Systems, Cambridge,
                 September 1983, Proceedings}",
  title =        "Specification of a simplified network service in {Z}",
  volume =       "207",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "345--353",
  year =         "1985",
  bibdate =      "Sat Jul 30 11:23:44 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Article{RodriguezArtalejo:1985:SQA,
  author =       "M. {Rodriguez Artalejo}",
  title =        "Some questions about expressiveness and relative
                 completeness in {Hoare}'s logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "39",
  number =       "2--3",
  pages =        "189--206",
  month =        aug,
  year =         "1985",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(85)90138-0",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. de Ecuaciones Funcionales, Univ. Complutense,
                 Madrid, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness; expressiveness; formal logic; Hoare
                 logic; strong relative incompleteness; true partial
                 correctness assertion; unwind property;
                 while-programs",
  pubcountry =   "Netherlands A07",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonHenke:1985:RHS,
  author =       "Friedrich W. von Henke",
  title =        "Reasoning with {Hoare} sentences",
  journal =      j-SIGSOFT,
  volume =       "10",
  number =       "4",
  pages =        "84--84",
  month =        aug,
  year =         "1985",
  CODEN =        "SFENDP",
  DOI =          "https://doi.org/10.1145/1012497.1012531",
  ISSN =         "0163-5948 (print), 1943-5843 (electronic)",
  ISSN-L =       "0163-5948",
  bibdate =      "Wed Aug 1 17:11:59 MDT 2018",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigsoft1980.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGSOFT Software Engineering Notes",
  journal-URL =  "https://dl.acm.org/citation.cfm?id=J728",
  remark =       "Proceedings of VERkshop III --- a formal verification
                 workshop.",
}

@Article{Winskel:1985:PM,
  author =       "G. Winskel",
  title =        "On powerdomains and modality",
  journal =      j-THEOR-COMP-SCI,
  volume =       "36",
  number =       "1",
  pages =        "127--137",
  month =        mar,
  year =         "1985",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(85)90037-4",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Comput. Lab., Cambridge Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Hoare power domain; modal assertions; modality;
                 nondeterministic computations; nondeterministic
                 program; partial correctness; Plotkin power domain;
                 powerdomains; programming theory; Smyth power domain",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@InProceedings{Hoare:1986:ASP,
  author =       "C. A. R. Hoare and J. He",
  editor =       "L. Meertens",
  booktitle =    "{IFIP WG 2.1 Working Conference on Program
                 Specification and Transformations, Bad-T{\"o}lz, W.
                 Germany 15--17 April}",
  title =        "Algebraic specification and proof of properties of a
                 mail service",
  publisher =    pub-NORTH-HOLLAND,
  address =      pub-NORTH-HOLLAND:adr,
  pages =        "??--?",
  year =         "1986",
  DOI =          "https://doi.org/10.5555/28195.28214",
  bibdate =      "Sat Jul 30 11:26:39 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/10.5555/28195.28214",
  acknowledgement = ack-nhfb,
}

@Article{Nguyen:1986:GOMa,
  author =       "Van Nguyen and Brent Hailpern",
  title =        "A generalized object model",
  journal =      j-SIGPLAN,
  volume =       "21",
  number =       "10",
  pages =        "78--87",
  month =        oct,
  year =         "1986",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:15:04 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming); C6120
                 (File organisation)",
  conflocation = "Yorktown Heights, NY, USA; 9-13 June 1986",
  conftitle =    "Object-Orientated Programming Workshop",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "class hierarchy; communicating processes; data
                 structures; formal semantics; generalized; generalized
                 object model; Hoare's CSP language; message-passing;
                 multidimensional inheritance; object-oriented
                 programming; programming",
  pubcountry =   "USA A08",
  sponsororg =   "ACM",
  treatment =    "P Practical",
}

@Article{vanDiepen:1986:PDT,
  author =       "N. W. P. {van Diepen} and W. P. {de Roever}",
  title =        "Program Derivation Through Transformations: the
                 Evolution of List-Copying Algorithms",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "6",
  number =       "3",
  pages =        "213--272",
  month =        may,
  year =         "1986",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Sun Oct 10 09:12:09 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423",
  acknowledgement = ack-nhfb,
  affiliation =  "Cent for Mathematics \& Computer Science, Amsterdam,
                 Neth",
  classification = "723; 921",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "computer metatheory --- Probabilistic Logics; computer
                 programming; correctness proofs; Hoare logic;
                 list-copying algorithms; mathematical techniques ---
                 Graph Theory; program transformation; small sequential
                 programs",
}

@Article{Anonymous:1987:BRC,
  author =       "Anonymous",
  title =        "Book Review: {{\booktitle{Communicating Sequential
                 Processes}}, By C. A. R. Hoare. Prentice-Hall
                 International, London, 1985, viii + 256 pages}",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "9",
  number =       "1",
  pages =        "101--105",
  month =        aug,
  year =         "1987",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1016/0167-6423(87)90028-1",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Tue Dec 3 07:40:48 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167642387900281",
  acknowledgement = ack-nhfb,
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
}

@Article{Fokkinga:1987:CPS,
  author =       "Maarten M. Fokkinga",
  title =        "A correctness proof of sorting by means of formal
                 procedures",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "9",
  number =       "3",
  pages =        "263--270 (or 263--269??)",
  month =        dec,
  year =         "1987",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68Q20 (68P10 68Q60)",
  MRnumber =     "915 538",
  bibdate =      "Sun Oct 10 09:12:09 MDT 1999",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/Ciancarini.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Twente, Enschede, Neth",
  classification = "721; 723",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "automata theory --- Recursive Functions; computer
                 programming --- Algorithms; computer systems
                 programming; correctness proof; Hoare-style pre- and
                 postassertions; recursive sorting algorithm",
}

@Article{Joseph:1987:PRF,
  author =       "Mathai Joseph and Abha Moitra and Neelam
                 Soundararajan",
  title =        "Proof Rules for Fault Tolerant Distributed Programs",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "8",
  number =       "1",
  pages =        "43--67",
  month =        feb,
  year =         "1987",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68Q60 (03B70 68M10 68Q10)",
  MRnumber =     "88b:68131",
  bibdate =      "Sun Oct 10 09:12:09 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Tata Inst of Fundamental Research, Bombay, India",
  classification = "723",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "communicating sequential process (CSP); computer
                 programming; computer systems, digital --- Distributed;
                 computers --- Data Communication Systems; fault
                 tolerant distributed programs; Hoare's CSP; proof
                 rules",
}

@Article{Nielson:1987:HLP,
  author =       "Hanne Riis Nielson",
  title =        "A {Hoare}-like proof system for analysing the
                 computation time of programs",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "9",
  number =       "2",
  pages =        "107--136",
  month =        oct,
  year =         "1987",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68Q60 (03B70 68N05 68P10)",
  MRnumber =     "89i:68097",
  bibdate =      "Sun Oct 10 09:12:09 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Aalborg Univ Cent, Aalborg, Den",
  classification = "723",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "bubble sorting algorithm; computation time of programs
                 analysis; computer programming; computer programming
                 --- Algorithms; computer systems programming ---
                 Sorting; Hoare-like proof system; total correctness
                 properties",
}

@Article{Sokolowski:1987:SHL,
  author =       "Stefan Soko{\l}owski",
  title =        "Soundness of {Hoare}'s Logic: an Automated Proof Using
                 {LCF}",
  journal =      j-TOPLAS,
  volume =       "9",
  number =       "1",
  pages =        "100--120",
  month =        jan,
  year =         "1987",
  CODEN =        "ATPSDT",
  DOI =          "https://doi.org/10.1145/9758.11326",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/11326.html",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
  keywords =     "theory; verification",
  subject =      "{\bf F.3.1}: Theory of Computation, LOGICS AND
                 MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs. {\bf F.4.1}: Theory of
                 Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
                 Mathematical Logic. {\bf I.2.3}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
                 Theorem Proving.",
}

@Article{Takaoka:1987:DRH,
  author =       "Tadao Takaoka",
  title =        "A decomposition rule for the {Hoare} logic",
  journal =      j-INFO-PROC-LETT,
  volume =       "26",
  number =       "4",
  pages =        "205--208",
  day =          "4",
  month =        dec,
  year =         "1987",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q60 (03B35 03B70)",
  MRnumber =     "89a:68152",
  MRreviewer =   "Michal Grabowski",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Inf. Sci., Ibaraki Univ., Japan",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "complexity; decomposition rule; formal logic; Hoare
                 logic; program segment; program verification;
                 programming theory; theorem proving; theory;
                 verification",
  pubcountry =   "Netherlands A06",
  subject =      "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND
                 FORMAL LANGUAGES, Mathematical Logic, Logic
                 programming",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Verjus:1987:PDA,
  author =       "J. Pierre Verjus",
  title =        "On the proof of a distributed algorithm",
  journal =      j-INFO-PROC-LETT,
  volume =       "25",
  number =       "3",
  pages =        "145--147",
  day =          "29",
  month =        may,
  year =         "1987",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  note =         "See comments
                 \cite{VanGasteren:1990:CPD,Pettersson:1991:LEC}.",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Inst de Recherche en Informatique et
                 Syst{\`e}mes Al{\'e}atoires, Rennes, Fr",
  classification = "723; C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. de Recherche en Inf. et Syst. Al{\'e}atoires,
                 Rennes, France",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "ad absurdum reasoning; algorithm theory; Algorithms;
                 algorithms; computer programming; computer systems,
                 digital --- Distributed; correctness proof; distributed
                 algorithm; distributed processing; elementary automata;
                 invariance property; reductio ad absurdum; termination
                 detection; theorem proving; theory; verification",
  pubcountry =   "Netherlands A02",
  subject =      "C.2.1 Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design, Distributed networks \\ F.2.2 Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Complexity of proof procedures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Broy:1988:BBC,
  author =       "Manfred Broy",
  title =        "Broadcasting Buffering Communication",
  journal =      j-COMP-LANGS,
  volume =       "13",
  number =       "1",
  pages =        "31--47",
  month =        "????",
  year =         "1988",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Univ Passau, Passau, West Ger",
  classcodes =   "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming); C6140D (High level
                 languages)",
  classification = "722; 723",
  corpsource =   "Fakultat fur Math. und Inf., Passau Univ., West
                 Germany",
  fjournal =     "Computer Languages",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "BBC systems; broadcasting buffering communicating;
                 broadcasting buffering communication; calculus of;
                 Church; communicating sequential; communicating
                 systems; computer programming languages; computer
                 systems, digital --- Distributed; concurrency;
                 denotational semantics; high level languages; Hoare;
                 lambda-calculus; language; loosely coupled
                 communicating systems; mathematical; Milner;
                 operational semantics; parallel programming; processes;
                 programming; systems; theory",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Fetzer:1988:PVV,
  author =       "James H. Fetzer",
  title =        "Program verification: the very idea",
  journal =      j-CACM,
  volume =       "31",
  number =       "9",
  pages =        "1048--1063",
  month =        sep,
  year =         "1988",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/48529.48530",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Sat Apr 06 08:06:27 1996",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib;
                 http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm1980.bib",
  note =         "Comment 1 by Schlenk, Sun May 21 18:41:04 1989.
                 Discusses two views: Programs can be derived from specs
                 through mathematical methods (Hoare) versus
                 verification as a social process (DeMillo, Lipton,
                 Perlis). There is a response to this paper in CACM
                 April 89.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0001-0782/48530.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "algorithms; experimentation; human factors;
                 performance; reliability; verification",
  review =       "ACM CR 8905-0309",
  subject =      "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program
                 Verification, Validation. {\bf D.2.1}: Software,
                 SOFTWARE ENGINEERING, Requirements/Specifications,
                 Methodologies. {\bf D.2.5}: Software, SOFTWARE
                 ENGINEERING, Testing and Debugging, Diagnostics. {\bf
                 F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Complexity of proof procedures. {\bf F.1.3}:
                 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
                 Complexity Classes, Relations among complexity
                 classes.",
}

@Article{Mancini:1988:HLD,
  author =       "Luigi Mancini and Giuseppe Pappalardo",
  title =        "{Hoare} logic of distributed redundant systems",
  journal =      j-COMPUT-SYST-SCI-ENG,
  volume =       "3",
  number =       "4",
  pages =        "171--180",
  month =        oct,
  year =         "1988",
  CODEN =        "CSSEEI",
  ISSN =         "0267-6192",
  bibdate =      "Wed Jul 28 08:43:24 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computsystscieng.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Pisa",
  affiliationaddress = "Pisa, Italy",
  classification = "723",
  fjournal =     "Computer Systems Science and Engineering",
  journal-URL =  "http://www.crlpublishing.co.uk/csse",
  journalabr =   "Comput Syst Sci Eng",
  keywords =     "Byzantine Agreement; Computer Metatheory--Formal
                 Logic; Computer Software; Computer Systems,
                 Digital--Fault Tolerant Capability; Distributed
                 Redundant Systems; Hoare Logic; N-Modular Redundancy;
                 N-Version Programming; SafeJoin Algorithm",
}

@Article{Stirling:1988:GOG,
  author =       "Colin Stirling",
  title =        "A generalization of {Owicki--Gries}'s {Hoare} logic
                 for a concurrent while language",
  journal =      j-THEOR-COMP-SCI,
  volume =       "58",
  number =       "1--3",
  pages =        "347--359",
  month =        jun,
  year =         "1988",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(88)90033-3",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Edinburgh",
  affiliationaddress = "Edinburgh, Scotl",
  classification = "723; C4210 (Formal logic)",
  conference =   "Thirteenth International Colloquium on Automata,
                 Languages and Programming",
  conflocation = "Rennes, France; 15-19 July 1986",
  conftitle =    "Thirteenth International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Dept. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Computer Programming Languages; Computer Systems,
                 Digital--Parallel Processing; Concurrent While
                 Language; concurrent while language; first-order
                 formulas; formal languages; formal logic; Hoare
                 asserted programs; Hoare Logic; Hoare logic;
                 Operational Semantics; operational semantics; potential
                 computations; sets of invariants; syntax-directed
                 generalization; Theory",
  meetingaddress = "Rennes, Fr",
  meetingdate =  "Jul 1986",
  meetingdate2 = "07/86",
  pubcountry =   "Netherlands",
  sponsororg =   "Eur. Assoc. Theor. Comput. Sci",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weiss:1988:BOP,
  author =       "Eric A. Weiss",
  title =        "Biographies: Oh, Pioneers!",
  journal =      j-ANN-HIST-COMPUT,
  volume =       "10",
  number =       "4",
  pages =        "348--361",
  month =        oct # "\slash " # dec,
  year =         "1988",
  CODEN =        "AHCOE5",
  ISSN =         "0164-1239",
  ISSN-L =       "0164-1239",
  bibdate =      "Fri Nov 1 15:29:13 MST 2002",
  bibsource =    "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/annhistcomput.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/super.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/cryptography.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/a/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/l/lovelace-ada-augusta.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/r/rutishauser-heinz.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/annhistcomput.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Parallel/super.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/adabooks.bib;
                 http://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography.bib;
                 http://www.math.utah.edu/pub/tex/bib/fibquart.bib;
                 http://www.math.utah.edu/pub/tex/bib/super.bib",
  URL =          "http://dlib.computer.org/an/books/an1988/pdf/a4348.pdf;
                 http://www.computer.org/annals/an1988/a4348abs.htm",
  acknowledgement = ack-nhfb,
  annote =       "This paper contains a brief summary of the
                 contributions of 261 individuals to the development of
                 computing.",
  fjournal =     "Annals of the History of Computing",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5488650",
  keywords =     "A. Porter; Aard van Wijngaarden; Adin D. Falkoff; Alan
                 J. Perlis; Alan Kay; Alan M. Turing; Allen Newell;
                 Allen W. M. Coombes; Alonzo Church; Alston Scott
                 Householder; Amedee Mannheim; Andrei P. Ershov; Andrew
                 Donald Booth; Andrew Fluegelman; Arnold A. Cohen;
                 Arthur C. Clarke; Arthur Lee Samuel; Arthur Walter
                 Burks; Arturo Rosenblueth; Augusta Ada King (nee
                 Gordon); B. M. Derfee; Blaise Pascal; Bob O. Evans;
                 Brian Havens; Brian Josephson; Brian Randell; Bruce G.
                 Oldfield; C. Gordon Bell; C. J. Date; C. Sheldon
                 Roberts; Carl Adam Petri; Carver Mead; Charles A.
                 Phillips; Charles Antony Richard Hoare; Charles
                 Babbage; Charles Bachman; Charles Xavier Thomas (Thomas
                 de Colmar); Christopher S. Strachey; Clair D. Lake;
                 Claude Elwood Shannon; Clifford E. Berry; Cuthbert C.
                 Hurd; D. W. Davies; Dana Scott; Daniel Delbert
                 McCracken; David J. Wheeler; David Packard; David
                 Sarnoff; Dennis M. Ritchie; Derrick Henry Lehmer;
                 Dionysius Lardner; Donald Ervin Knuth; Donald Lewis
                 Shell; Donald Michie; Donn B. Parker; Dorr E. Felt;
                 Douglas R. Hartree; E. H. Lennaerts; E. T. Irons; Earl
                 R. Larson; Edgar F. Codd; Edmund C. Berkeley; Edsger W.
                 Dijkstra; Edward E. Feigenbaum; Edward Joseph
                 McCluskey; Edward L. (Ted) Glaser; Emil L. Post; Ernest
                 R. Moore; Erwin Tomash; Eugene Kleiner; Fairchild Eight
                 (Julius Blank, Victor H. Grinich, Jean A. Hoerni,
                 Eugene Kleiner, Jay T. Last, Gordon E. Moore, Robert N.
                 Noyce, and C. Sheldon Roberts); Fernando J.
                 Corbat{\'o}; Fletcher Jones; Frances Elizabeth (Betty)
                 Snyder Holberton; Francis Joseph Murray; Frank E.
                 Hamilton; Frank Gray; Frank Rosenblatt; Frederic
                 Calland Williams; Frederick P. Brooks, Jr.; Friedrich
                 L. Bauer; G. B. Grant; G. Truman Hunter; Gene M.
                 Amdahl; Georg and Edvard Scheub; George Bernard
                 Dantzig; George Boole; George Elmer Forsythe; George H.
                 Philbrick; George Robert Stibitz; Gerald M. Weinberg;
                 Gerard Salton; Gordon E. Moore; Gottfried Wilhelm
                 Leibniz; Grace Murray Hopper; Harlan D. Mills; Harlan
                 L. Herrick; Harold Chestnut; Harry Douglas Huskey;
                 Harry H. Goode; Heinz Rutishauser; Helmut Schreyer;
                 Henry Briggs; Henry P. Babbage; Herbert A. Simon;
                 Herbert Leo Gelernter; Herbert R. J. Grosch; Herbert S.
                 Bright; Herman Heine Goldstine; Herman Hollerith;
                 Herman Lukoff; Howard Bromberg; Howard Hathaway Aiken;
                 I. J. Good; Irven Travis; Isaac L. Auerbach; Ivan
                 Edward Sutherland; J. Daniel Cougar; J. Presper Eckert,
                 Jr.; Jack St. Clair Kilby; Jack Tramiel; Jackson
                 Granholm [``kludge'']; James Hardy Wilkinson; James M.
                 Henry; James William Cooley; Jan Aleksander Rajchman;
                 Jay T. Last; Jay W. Forrester; Jean A. Hoerni; Jean E.
                 Sammet; Jeffrey Chuan Chu; Jerrier A. Haddad; Jim
                 Pommerene; John Bardeen; John Burns; John C. McPherson;
                 John Clifford Shaw; John Diebold; John George Kemeny;
                 John Grist Brainerd; John H. Curtiss; John McCarthy;
                 John Napier; John Powers; John R. Pierce; John Todd;
                 John Vincent Atanasoff; John von Neumann; John Warner
                 Backus; John Weber Carr, III; John Wilder Tukey; John
                 William Mauchly; Jonathan Swift; Joseph Carl Robnett
                 Licklider; Joseph Chedaker; Joseph Clement; Joseph
                 Frederick Traub; Joseph Marie Jacquard; Joseph
                 Weizenbaum; Jules I. Schwartz; Julian Bigelow; Julius
                 Blank; Karl Karlstrom; Ken Thompson; Kenneth Eugene
                 Iverson; Kenneth H. Olsen; Konrad Zuse; L. F. Meabrea;
                 Lejaren A. Hiller; Leonardo of Pisa a.k.a. Fibonacci;
                 Leonardo Torres y Quevedo; Leslie John Comrie; Lord
                 Kelvin (William Thomson); Louis Couffignal; Lynn
                 Conway; L{\'e}on Boll{\'e}e; Marian Rejewski; Marvin L.
                 Minsky; Maurice Howard Halstead; Maurice V. Wilkes; Max
                 Palevsky; Maxwell H. A. Newman; Michael O. Rabin;
                 Michael Woodger; Mina Rees; Mitchell D. Kapor; Mohammed
                 ibn Musa Al-Khowarizmi; Morton Michael Astrahan;
                 Nathaniel Rochester; Nicholas Constantine Metropolis;
                 Niklaus Wirth; Noam Chomsky; Nolan Bushnell; Norbert
                 Wiener; Oliver G. Selfridge; Orrin Edison Taulbee; Paul
                 Allen; Percy Ludgate; Perry O. Crawford; Peter Naur;
                 Ralph E. Gomory; Richard Clippinger; Richard Courant;
                 Richard Ernest Bellman; Richard J. Canning; Richard M.
                 Bloch; Richard P. Feynman; Richard Snyder; Richard V.
                 D. Campbell; Richard Wesley Hamming; Robert H. Dennard;
                 Robert N. Noyce; Robert R. Everett; Robert S. Barton;
                 Robert Sarnoff; Robert W. Bemer; Robert W. Floyd; Roy
                 Nutt; S. B. Williams; Samuel H. Caldwell; Samuel
                 Morland; Samuel N. Alexander; Saul Rosen; Seymour
                 Papert; Seymour R. Cray; Sidney Fernbach; Stanley Gill;
                 Stephen A. Cook; Stephen Frank Baldwin; Stephen
                 Wozniak; Steven Jobs; T. Vincent Learson; Thomas Eugene
                 Kurtz; Thomas H. Flowers; Thomas J. Watson, Jr.; Thomas
                 J. Watson, Sr.; Thomas Kite Sharpless; Tom Kilburn;
                 Vannevar E Bush; Victor H. Grinich; Vladimar Zworykin;
                 W. J. Deerhake; W. Renwick; W. T. Odhner; Wallace J,
                 Eckert; Walter Pitts; Warren Sturgis McCulloch; Warren
                 Weaver; Wassily Leontieff; Watson Davis; Werner
                 Buchholz; Wilhelm Schickard; William C. Norris; William
                 F. McClelland; William Gates; William Hewlett; William
                 Leybourn; William Orchard-Hays; William Oughtred;
                 William P. Heising; William Seward Burroughs",
  remark =       "This paper contains a brief summary of the
                 contributions of 261 individuals to the development of
                 computing. Norbert Wiener appears incorrectly as
                 Norbert Weiner in this article.",
  subject-dates = "Claude Elwood Shannon (1916--2001); Friedrich
                 (``Fritz'') Ludwig Bauer (10 June 1924--26 March 2015);
                 Heinz Rutishauser (30 January 1918--10 November 1970)",
}

@Article{Chisholm:1989:ARP,
  author =       "G. H. Chisholm and B. T. Smith and A. S. Wojcik",
  title =        "An automated reasoning problem associated with proving
                 claims about programs using {Floyd--Hoare} inductive
                 assertion methods",
  journal =      j-J-AUTOM-REASON,
  volume =       "5",
  number =       "4",
  pages =        "533--540",
  month =        dec,
  year =         "1989",
  CODEN =        "JAREEW",
  DOI =          "https://doi.org/10.1007/BF00243137",
  ISSN =         "0168-7433 (print), 1573-0670 (electronic)",
  ISSN-L =       "0168-7433",
  bibdate =      "Sat Apr 2 10:49:25 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
  URL =          "http://link.springer.com/article/10.1007/BF00243137",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Autom. Reason.",
  fjournal =     "Journal of Automated Reasoning",
  journal-URL =  "http://link.springer.com/journal/10817",
}

@Unpublished{Dijkstra:1989:ETH,
  author =       "Edsger W. Dijkstra",
  title =        "On an exercise of {Tony Hoare}'s",
  month =        sep,
  year =         "1989",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd10xx/EWD1062.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "45 KB",
  oldlabel =     "EWD:EWD1062",
}

@Article{Horning:1989:BRE,
  author =       "J. J. Horning",
  title =        "Book Review: {{\booktitle{Essays in computing
                 science}}, by C. A. R. Hoare and C. B. Jones, ed.,
                 Prentice-Hall International, Hemel Hempstead, United
                 Kingdom, 1989, Price \pounds 32.95 (hardback), ISBN
                 0-13-284027-8}",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "12",
  number =       "3",
  pages =        "267--270",
  month =        sep,
  year =         "1989",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1016/0167-6423(89)90010-5",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Tue Dec 3 07:20:49 MST 2013",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423",
  URL =          "http://www.sciencedirect.com/science/article/pii/0167642389900105",
  acknowledgement = ack-nhfb,
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
}

@Article{Hortala-Gonzalez:1989:HLN,
  author =       "M. T. Hortala-Gonzalez and M. Rodriguez-Artalejo",
  title =        "{Hoare}'s logic for nondeterministic regular programs:
                 a nonstandard approach",
  journal =      j-THEOR-COMP-SCI,
  volume =       "68",
  number =       "3",
  pages =        "277--302",
  day =          "12",
  month =        nov,
  year =         "1989",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(89)90165-5",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. de Inf. y Autom., Fac. de Matematicas, Univ.
                 Complutense de Madrid, Spain",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "completeness theorem; continuous semantics; formal
                 logic; Hoare logic; infinitely long computations;
                 nondeterministic regular programs; nondeterministic
                 systems; nonstandard dynamic logic; normal form;
                 program verification; regular programs; unbounded
                 nondeterminism",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Makowsky:1989:WSO,
  author =       "J. A. Makowsky and I. Sain",
  title =        "Weak second order characterizations of various program
                 verification systems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "66",
  number =       "3",
  pages =        "299--321",
  day =          "26",
  month =        aug,
  year =         "1989",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(89)90156-4",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Technion-Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "comprehension axiom; Floyd-Hoare Logic; logic
                 programming; nonstandard logics of programs; program
                 verification; program verification systems; weak second
                 order characterisations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Page:1989:SME,
  author =       "I. P. Page and R. T. Jacob",
  title =        "The solution of mutual exclusion problems which can be
                 described graphically",
  journal =      j-COMP-J,
  volume =       "32",
  number =       "1",
  pages =        "45--54",
  month =        feb,
  year =         "1989",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/32.1.45",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:26 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/32/1.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/32/1/45.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/45.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/46.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/47.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/48.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/49.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/50.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/51.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/52.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/53.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/54.tif",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Texas Univ.",
  affiliationaddress = "Richardson, TX, USA",
  classcodes =   "C6150J (Operating systems)",
  classification = "722; 723; 921; 922; C6150J (Operating systems)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Richardson, TX,
                 USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "blocked processes; Blocked processes; blocked-queue
                 binary semaphores; Blocked-queue binary semaphores;
                 Computer Programming--Algorithms; Dijkstra semaphores;
                 disciplines; Distributed; free solutions; graph
                 representations; Hoare monitor; Hoare monitor, Computer
                 Systems, Digital; Mathematical Techniques--Graph
                 Theory; mutual exclusion problems; Mutual exclusion
                 problems; Mutual Exclusion Programs; operating systems
                 (computers); parallel programming;
                 Probability--Queueing Theory; queue; Queue disciplines;
                 queueing theory; starvation-; Starvation-free
                 solutions; synchronisation; undirected; Undirected
                 graph representations; Undirected Graphs; weak binary
                 semaphores; Weak binary semaphores",
  thesaurus =    "Operating systems [computers]; Parallel programming;
                 Queueing theory; Synchronisation",
  treatment =    "P Practical",
}

@Article{Wing:1989:VAD,
  author =       "Jeannette M. Wing",
  title =        "Verifying atomic data types",
  journal =      j-INT-J-PARALLEL-PROG,
  volume =       "18",
  number =       "5",
  pages =        "315--357",
  month =        oct,
  year =         "1989",
  CODEN =        "IJPPE5",
  DOI =          "https://doi.org/10.1007/BF01379184",
  ISSN =         "0885-7458 (print), 1573-7640 (electronic)",
  ISSN-L =       "0885-7458",
  bibdate =      "Wed Jul 6 16:39:44 MDT 2005",
  bibsource =    "Compendex database;
                 http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=5;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=5&spage=315",
  acknowledgement = ack-nhfb,
  affiliation =  "Carnegie Mellon Univ",
  affiliationaddress = "Pittsburgh, PA, USA",
  ajournal =     "Int. J. Parallel Prog.",
  classification = "722; 723; C6120 (File organisation); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Sch. of Comput. Sci., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "International Journal of Parallel Programming",
  journal-URL =  "http://link.springer.com/journal/10766",
  journalabr =   "Int J Parallel Program",
  keywords =     "Abstract Data Types; atomic data types verification;
                 atomic queue; atomic transactions; Atomic Transactions;
                 Computer Software --- Software Engineering; Computer
                 Systems, Digital; Data Processing --- Data Structures;
                 data structures; distributed processing; Distributed
                 Systems; Fault Tolerant Capability; fault tolerant
                 computing; fault-tolerant distributed systems; Hoare's
                 abstraction function; Program Verification; program
                 verification; programming language Avalon/C++; typed
                 data objects",
  treatment =    "P Practical",
}

@Article{Flannery:1990:HSP,
  author =       "Kevin E. Flannery and Johannes J. Martin",
  title =        "The {Hoare} and {Smyth} power domain constructors
                 commute under composition",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "40",
  number =       "2",
  pages =        "125--135",
  month =        apr,
  year =         "1990",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/0022-0000(90)90008-9",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  bibdate =      "Tue Jan 29 15:26:15 MST 2019",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/0022000090900089",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
}

@Article{Milner:1990:IOC,
  author =       "Robin Milner",
  title =        "Interpreting one concurrent calculus in another",
  journal =      j-THEOR-COMP-SCI,
  volume =       "75",
  number =       "1--2",
  pages =        "3--13",
  day =          "25",
  month =        sep,
  year =         "1990",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(90)90059-Q",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988",
  conftitle =    "International Conference on Fifth Generation Computer
                 Systems 1988",
  corpsource =   "Dept. of Comput. Sci., Edinburgh Univ., UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "applied calculus; calculus; communicating systems;
                 concurrent calculus; formal logic; Hoare logic;
                 imperative concurrent programming language;
                 interpretation; logic programming; parallel
                 programming; programming theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Qian:1990:ASD,
  author =       "Xiaolei Qian",
  key =          "Qian",
  title =        "An Axiom System for Database Transactions",
  journal =      j-INFO-PROC-LETT,
  volume =       "36",
  number =       "4",
  pages =        "183--189",
  day =          "15",
  month =        nov,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Stanford Univ",
  affiliationaddress = "Stanford, CA, USA",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6110B (Software engineering techniques); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "axiom system; Axion Systems; complete Hoare axiom
                 system; Computer Metatheory--Programming Theory;
                 Computer Programming--Theory; data manipulation
                 language; database integrity; database management
                 systems; Database Programming; Database Systems;
                 database transactions; databases; first-order definable
                 database updates; formal semantics; formal
                 specification; optimization; program correctness;
                 Program Correctness; Program Specification; program
                 specifications; program verification; reasoning;
                 synthesis; Theory; transaction processing; transaction
                 verification; verification",
  owner =        "robyn",
  treatment =    "P Practical",
}

@Article{VanGasteren:1990:CPD,
  author =       "A. J. M. {Van Gasteren} and G. Tel",
  title =        "Comments on {``On the proof of a distributed
                 algorithm''}: always-true is not invariant {[Inform.
                 Process. Lett. {\bf 25}(3), 29 May 1987, pp.
                 145--147]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "35",
  number =       "6",
  pages =        "277--279",
  day =          "15",
  month =        sep,
  year =         "1990",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib",
  note =         "See \cite{Verjus:1987:PDA,Pettersson:1991:LEC}.",
  acknowledgement = ack-nhfb,
  affiliation =  "Utrecht Univ",
  affiliationaddress = "Utrecht, Neth",
  classification = "723; C4240 (Programming and algorithm theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; Computer Programming; Computer Systems,
                 Digital --- Distributed; distributed algorithm;
                 Distributed Algorithms; distributed processing;
                 induction method; invariance proofs; Invariance Proofs;
                 program verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bloom:1991:FHL,
  author =       "Stephen L. Bloom and Zolt{\'a}n {\'E}sik",
  title =        "{Floyd--Hoare} Logic in Iteration Theories",
  journal =      j-J-ACM,
  volume =       "38",
  number =       "4",
  pages =        "887--934",
  month =        oct,
  year =         "1991",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/115234.115352",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jacm.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/115352.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  keywords =     "algorithms; correction assertions; Hoare logic; Logic;
                 theory",
  subject =      "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Logic
                 programming. {\bf F.3.1}: Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Specifying and Verifying and
                 Reasoning about Programs, Assertions. {\bf I.1.2}:
                 Computing Methodologies, ALGEBRAIC MANIPULATION,
                 Algorithms, Algebraic algorithms.",
}

@Article{Hoofman:1991:WEM,
  author =       "R. Hoofman",
  title =        "Weakly expressive models for {Hoare} logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "82",
  number =       "2",
  pages =        "409--418",
  day =          "31",
  month =        may,
  year =         "1991",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(91)90232-Q",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "definable; domain; formal logic; Hoare logic; models;
                 programming theory; weak expressivity; weakly
                 expressive",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pettersson:1991:LEC,
  author =       "Jimmi S. Pettersson",
  title =        "Letter to the Editor: Comments on {``Always-true is
                 not invariant''}: Assertional reasoning about
                 invariance {[Inform. Process. Lett. {\bf 35}(6), 15
                 September 1990, pp. 277--279]}",
  journal =      j-INFO-PROC-LETT,
  volume =       "40",
  number =       "5",
  pages =        "231--233",
  day =          "13",
  month =        dec,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1980.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  note =         "See \cite{Verjus:1987:PDA,VanGasteren:1990:CPD}.",
  acknowledgement = ack-nhfb,
  affiliation =  "TEL",
  affiliationaddress = "Horsholm, Den",
  classification = "723; 731; 922; C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "TFL, Horsholm, Denmark",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  journalabr =   "Inf Process Lett",
  keywords =     "Always-True; always-true; Assertional Reasoning;
                 assertional reasoning; Computer Metatheory ---
                 Programming Theory; Computer Programming --- Program
                 Debugging; Control Systems; formal logic; Hoare logic;
                 Invariance; invariance; Invariant; Mathematical Models
                 --- Theory; Program Composition; Program Correctness;
                 program correctness; program verification; programming
                 theory; Sanders' Theorem; UNITY reasoning",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Szczepanska:1991:HLV,
  author =       "D. Szczepanska",
  title =        "A {Hoare}-like verification system for a language with
                 an exception handling mechanism",
  journal =      j-THEOR-COMP-SCI,
  volume =       "80",
  number =       "2",
  pages =        "319--335",
  day =          "29",
  month =        mar,
  year =         "1991",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(91)90393-G",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6130 (Data handling
                 techniques); C6140D (High level languages); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational linguistics; copy rule; correctness
                 proof; error handling; exception handling mechanism;
                 handler responses; high level languages; Hoare-like
                 verification system; program verification; recursive
                 procedures; resumption; robust programs; semantics;
                 termination; typical statements",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

@Article{Tennent:1991:CPW,
  author =       "R. D. Tennent and J. K. Tobin",
  title =        "Continuations in possible-world semantics",
  journal =      j-THEOR-COMP-SCI,
  volume =       "85",
  number =       "2",
  pages =        "283--303",
  day =          "12",
  month =        aug,
  year =         "1991",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(91)90184-4",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Queen's Univ.,
                 Kingston., Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "ALGOL 60-like languages; block expressions; formal
                 languages; formal logic; Hoare's logic; jumps;
                 local-variable declarations; modelling; noninterference
                 specifications; possible-world semantics",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@InProceedings{Boyer:1992:ACP,
  author =       "R. S. Boyer and Yuan Yu",
  title =        "Automated correctness proofs of machine code programs
                 for a commercial microprocessor",
  crossref =     "Kapur:1992:ADC",
  pages =        "416--430",
  month =        "",
  year =         "1992",
  bibdate =      "Wed Oct 30 05:59:54 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/gnu.bib",
  abstract =     "The authors have formally specified a substantial
                 subset of the MC68020, a widely used microprocessor
                 built by Motorola, within the mathematical logic of the
                 automated reasoning system Nqthm i.e. the Boyer--Moore
                 Theorem Prover. Using this MC68020 specification, the
                 authors have mechanically checked the correctness of
                 MC68020 machine code programs for Euclid's GCD, Hoare's
                 Quick Sort, binary search, and other well-known
                 algorithms. The machine code for these examples was
                 generated using the GNU C and the Verdix Ada compilers.
                 The authors have developed an extensive library of
                 proven lemmas to facilitate automated reasoning about
                 machine code programs. The authors describe a two stage
                 methodology they use to do their machine code proofs.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci. and Math., Texas Univ., Austin,
                 TX, USA",
  classification = "C4210 (Formal logic); C5130 (Microprocessor chips);
                 C6110B (Software engineering techniques); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  keywords =     "Automated reasoning system Nqthm; Automatic
                 correctness proofs; Binary search; Boyer--Moore Theorem
                 Prover; Commercial microprocessor; GCD; GNU C; Hoare's
                 Quick Sort; Machine code programs; Mathematical logic;
                 MC68020; Verdix Ada compilers",
  thesaurus =    "Formal specification; Microprocessor chips; Program
                 verification; Theorem proving",
}

@InProceedings{Hoare:1992:AM,
  author =       "C. A. R. Hoare",
  editor =       "Manfred Broy",
  booktitle =    "Program Design Calculi",
  title =        "Algebra and models",
  volume =       "118",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "161--195",
  year =         "1992",
  bibdate =      "Sat Jul 30 14:55:45 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Advanced Science Institutes Series F",
  acknowledgement = ack-nhfb,
}

@Article{Hooman:1992:CVR,
  author =       "J. Hooman",
  title =        "Compositional Verification of Real-Time Systems Using
                 Extended {Hoare} Triples",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "600",
  pages =        "252--??",
  year =         "1992",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:46:24 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1992.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Knijnenburg:1992:CIP,
  author =       "P. M. W. Knijnenburg and F. Nordemann",
  title =        "A Categorical Interpretation of Partial Function Logic
                 and {Hoare} Logic",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "620",
  pages =        "229--??",
  year =         "1992",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:46:24 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1992.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Shankar:1993:IAR,
  author =       "A. Udaya Shankar",
  title =        "An Introduction to Assertional Reasoning for
                 Concurrent Systems",
  journal =      j-COMP-SURV,
  volume =       "25",
  number =       "3",
  pages =        "225--262",
  month =        sep,
  year =         "1993",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/158439.158441",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 19 09:44:33 MDT 2008",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
                 http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compsurv.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0360-0300/158441.html",
  abstract =     "This is a tutorial introduction to assertional
                 reasoning based on temporal logic. The objective is to
                 provide a working familiarity with the technique. We
                 use a simple system model and a simple proof system,
                 and we keep to a minimum the treatment of issues such
                 as soundness, completeness, compositionality, and
                 abstraction. We model a concurrent system by a state
                 transition system and fairness requirements. We reason
                 about such systems using Hoare logic and a subset of
                 linear-time temporal logic, specifically, invariant
                 assertions and leads-to assertions. We apply the method
                 to several examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "assertional reasoning; generation of preconditions;
                 Hoare logic; invariants; leads-to; progress properties;
                 safety properties; state transition systems;
                 verification; weakest preconditions",
  subject =      "{\bf D.2.4}: Software, SOFTWARE ENGINEERING, Program
                 Verification, Correctness proofs. {\bf D.3.3}:
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs, Assertions.
                 {\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Specifying and Verifying and Reasoning
                 about Programs, Invariants. {\bf F.3.1}: Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Specifying and Verifying and Reasoning about Programs,
                 Logics of programs. {\bf F.3.1}: Theory of Computation,
                 LOGICS AND MEANINGS OF PROGRAMS, Specifying and
                 Verifying and Reasoning about Programs, Pre- and
                 post-conditions.",
}

@Article{Groote:1994:PAG,
  author =       "Jan Friso Groote and Alban Ponse",
  title =        "Process algebra with guards: Combining {Hoare} logic
                 with process algebra",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "6",
  number =       "2",
  pages =        "115--164",
  month =        mar,
  year =         "1994",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/BF01221097",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Tue Mar 17 20:57:37 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01221097",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Hooman:1994:EHL,
  author =       "Jozef Hooman",
  title =        "Extending {Hoare} logic to real-time",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "6",
  number =       "1S",
  pages =        "801--825",
  year =         "1994",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/BF01213604",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Wed Mar 18 06:37:03 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01213604",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Kapur:1994:OTP,
  author =       "D. Kapur and X. Nie and D. R. Musser",
  title =        "An overview of the {Tecton} proof system",
  journal =      j-THEOR-COMP-SCI,
  volume =       "133",
  number =       "2",
  pages =        "307--340",
  day =          "24",
  month =        oct,
  year =         "1994",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(94)90192-9",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:29 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=133&issue=2;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=133&issue=2&aid=1712",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic); C6110B (Software engineering techniques)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "case analysis; first-order logic formulas; formal
                 logic; formal specification; generalization inference
                 mechanisms; generic software; graphical
                 representations; hardware components; Hoare's axiomatic
                 proof formalism; hypertext links; induction; inference
                 mechanisms; interactive proof construction; linear
                 arithmetic decision procedure; multiple proof attempts;
                 program specifications; proof forest; rewriting; Tecton
                 proof system; theorem proving",
  pubcountry =   "Netherlands",
  treatment =    "B Bibliography; P Practical",
}

@Article{Coenen:1995:HLV,
  author =       "J. Coenen",
  title =        "{Hoare}'s logic and {VDM}",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "7",
  number =       "1",
  pages =        "91--105",
  month =        jan,
  year =         "1995",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/BF01214625",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Tue Mar 17 20:57:42 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/BF01214625",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Gardiner:1995:APC,
  author =       "P. H. B. Gardiner",
  title =        "Algebraic proofs of consistency and completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "161--191",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(94)00211-Z",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=150&issue=1&aid=1845",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic); C4240 (Programming
                 and algorithm theory); C6110F (Formal methods); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Formal Syst. Eur. Ltd., Oxford, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "algebraic proofs; arbitrary predicate transformer;
                 calculus of refinement; completeness; consistency;
                 direct translation; floor-like operator; formal logic;
                 Galois connection; Hoare logic inference rules;
                 inference mechanisms; natural ordering; nearest
                 embedded relation; predicate transformers; program
                 refinement; program verification; relational calculus;
                 set theory; soundness; weak algebraic set theory;
                 weakest prespecification operator",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Homeier:1995:MVV,
  author =       "Peter V. Homeier and David F. Martin",
  title =        "A mechanically verified verification condition
                 generator",
  journal =      j-COMP-J,
  volume =       "38",
  number =       "2",
  pages =        "131--141",
  month =        "????",
  year =         "1995",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/38.2.131",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:43 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/38/2.toc;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj1990.bib;
                 http://www3.oup.co.uk/computer_journal/Volume_38/Issue_02/Vol38_02.index.html",
  URL =          "http://comjnl.oxfordjournals.org/content/38/2/131.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/Volume_38/Issue_02/Vol38_02.body.html#AbstractHomeier",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  classcodes =   "C6110F (Formal methods); C6150G (Diagnostic, testing,
                 debugging and evaluating systems); C4240 (Programming
                 and algorithm theory); C4210L (Formal languages and
                 computational linguistics); C6115 (Programming
                 support)",
  classification = "C4210L (Formal languages and computational
                 linguistics); C4240 (Programming and algorithm theory);
                 C6110F (Formal methods); C6115 (Programming support);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Los Angeles,
                 CA, USA",
  email-1 =      "homeier@cs.ucla.edu",
  email-2 =      "dmartin@cs.ucla.edu",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "computational linguistics; effects; expressions;
                 Expressions; Hoare-style axiomatic semantics; HOL
                 theorem proving; HOL theorem proving system; inference;
                 Inference; language; mechanically verified verification
                 condition generator; Mechanically verified verification
                 condition generator; program correctness; Program
                 correctness proving; program verification; programming;
                 Programming language; proving; side; Side effects;
                 software; standard while-loop language; Standard
                 while-loop language; structural operational semantics;
                 Structural operational semantics; system; theorem
                 proving; tools; VCG tool correctness proving;
                 verification condition generator tools; Verification
                 condition generator tools",
  thesaurus =    "Computational linguistics; Program verification;
                 Software tools; Theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Naumann:1995:PTH,
  author =       "David A. Naumann",
  title =        "Predicate transformers and higher-order programs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "111--159",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(94)00247-G",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=150&issue=1&aid=1881",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6110F (Formal methods)",
  corpsource =   "Math. and Comput. Sci., Southwestern Univ.,
                 Georgetown, TX, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "categorial axiomatizations; categories; coexponents;
                 formal logic; formal specification; higher-order
                 programs; Hoare logic; monotonic predicate
                 transformers; parameter passing; powersets; predicate
                 transformers; preordered category; program constructs;
                 program specifications; programming theory; refinement
                 calculus; total deterministic programs",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Prodinger:1995:MQH,
  author =       "Helmut Prodinger",
  title =        "{Multiple Quickselect} --- {Hoare}'s {Find} algorithm
                 for several elements",
  journal =      j-INFO-PROC-LETT,
  volume =       "56",
  number =       "3",
  pages =        "123--129",
  day =          "10",
  month =        nov,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68P10",
  MRnumber =     "96h:68041",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140Z (Other topics in statistics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.
                 Wien, Austria",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "average comparisons; average passes; corollaries; find
                 algorithm; multiple Quickselect; order statistics;
                 search problems; specified order statistics;
                 statistics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stoller:1995:VPU,
  author =       "Scott D. Stoller and Fred B. Schneider",
  title =        "Verifying programs that use causally-ordered
                 message-passing",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "24",
  number =       "2",
  pages =        "105--128",
  month =        apr,
  year =         "1995",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68Q60",
  MRnumber =     "96c:68122",
  bibdate =      "Sun Oct 10 09:12:09 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  acknowledgement = ack-nhfb,
  affiliation =  "Cornell Univ",
  affiliationaddress = "Ithaca, USA",
  classification = "721.1; 723.1; 723.5",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "Algorithms; Causally ordered delivery; Computer
                 programming; Computer simulation; Hoare style proof
                 system; Invariance; Invariant based verification;
                 Message passing; Program verification; Programming
                 theory; Theorem proving",
}

@Article{Boyer:1996:APO,
  author =       "Robert S. Boyer and Yuan Yu",
  title =        "Automated proofs of object code for a widely used
                 microprocessor",
  journal =      j-J-ACM,
  volume =       "43",
  number =       "1",
  pages =        "166--192",
  month =        jan,
  year =         "1996",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/227595.227603",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Tue Sep 28 07:51:05 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
                 http://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Texas at Austin",
  affiliationaddress = "Austin, USA",
  classification = "721.1; 722.4; 723.1; 723.1.1; 921; 921.5",
  fjournal =     "Journal of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J401",
  journalabr =   "J Assoc Comput Mach",
  keywords =     "Ada (programming language); Algorithms; Artificial
                 intelligence; Automated proofs; Binary codes; Binary
                 search; Boyer--Moore Theorem prover; C (programming
                 language); Common Lisp; Formal languages; Functions;
                 Hoare's Quick sort; Lisp (programming language);
                 Mathematical programming; Microprocessor chips; Object
                 code; Program compilers; Theorem proving; UNIX",
}

@Article{Engelhardt:1996:SSS,
  author =       "K. Engelhardt and W.-P. {De Roever}",
  title =        "Simulation of specification statements in {Hoare}
                 logic",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1113",
  pages =        "324--335",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Aug 25 16:49:05 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1996b.bib",
  acknowledgement = ack-nhfb,
  annote =       "Also known as MFCS '96",
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "computer science; informatics; mathematical
                 foundations; MFCS",
}

@Article{Gritzner:1996:RAM,
  author =       "Thomas F. Gritzner and Rudolf Berghammer",
  title =        "A relation algebraic model of robust correctness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "159",
  number =       "2",
  pages =        "245--270",
  day =          "03",
  month =        jun,
  year =         "1996",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/0304-3975(96)88664-6",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=159&issue=2;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=159&issue=2&aid=2001",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C6110F (Formal methods);
                 C6160D (Relational databases)",
  corpsource =   "Fakultat f{\"u}r Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "abstract relational approach; demonic nondeterminism;
                 Dijkstra's wp-calculus; flat lattices; formal
                 specification; Hoare's chaos semantics; Morgan's
                 specification statement; programs refinement;
                 refinement relation; relation algebraic model;
                 relational algebra; robust correctness",
  pubcountry =   "Netherlands",
  treatment =    "A Application; P Practical",
}

@Article{Grubel:1996:ADT,
  author =       "Rudolf Gr{\"u}bel and Uwe R{\"o}sler",
  title =        "Asymptotic Distribution Theory for {Hoare}'s Selection
                 Algorithm",
  journal =      j-ADV-APPL-PROB,
  volume =       "28",
  number =       "1",
  pages =        "252--269",
  month =        mar,
  year =         "1996",
  CODEN =        "AAPBBD",
  DOI =          "https://doi.org/10.2307/1427920",
  ISSN =         "0001-8678 (print), 1475-6064 (electronic)",
  ISSN-L =       "0001-8678",
  bibdate =      "Sat May 3 07:42:21 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i262309;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/advapplprob.bib",
  URL =          "http://www.jstor.org/stable/1427920",
  acknowledgement = ack-nhfb,
  ajournal =     "Adv. Appl. Probab.",
  fjournal =     "Advances in Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00018678.html",
}

@Article{LeGuyadec:1996:SLP,
  author =       "Y. {Le Guyadec} and B. Virot",
  title =        "Sequential-like proofs of data-parallel programs",
  journal =      j-PARALLEL-PROCESS-LETT,
  volume =       "6",
  number =       "3",
  pages =        "415--426",
  month =        sep,
  year =         "1996",
  CODEN =        "PPLTEE",
  ISSN =         "0129-6264",
  bibdate =      "Mon Apr 14 09:48:53 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240P (Parallel programming
                 and algorithm theory)",
  corpsource =   "Lab. d'Inf. Fondamentale, Orleans Univ., France",
  countrypub =   "Singapore",
  fjournal =     "Parallel Processing Letters",
  journal-URL =  "http://www.worldscientific.com/loi/ppl",
  keywords =     "conditioning constructs; control transfers;
                 data-parallel break; data-parallel languages; formal
                 logic; formal specification; non-local; parallel
                 languages; parallel programming; proof system;
                 sequential Hoare Logic; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sun:1996:TRH,
  author =       "Yong Sun",
  title =        "Term rewriting and {Hoare} logic --- {Coded}
                 rewriting",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "5",
  pages =        "237--242",
  day =          "8",
  month =        dec,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q42 (68Q60)",
  MRnumber =     "1 435 842",
  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/infoproc1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C4210L (Formal languages and
                 computational linguistics)",
  corpsource =   "Dept. of Comput. Sci., Queen's Univ., Belfast, UK",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190/",
  keywords =     "algebra; coded algebra; coded rewriting; derivations;
                 dual objects; formal logic; Hoare logic; morphisms;
                 programs; proofs; rewrite rules; rewriting system;
                 rewriting systems; term rewriting; transitive-reflexive
                 closure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DeBoer:1997:HSC,
  author =       "F. S. {De Boer} and U. Hannemann and W.-P. {De
                 Roever}",
  title =        "{Hoare}-style compositional proof systems for reactive
                 shared variable concurrency",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1346",
  pages =        "267--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1346.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1346/13460267.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1346/13460267.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  xxauthor =     "F. S. de Boer and U. Hannemann and W.-P. de Roever",
}

@Article{Gozum:1997:LWC,
  author =       "Marvine E. Gozum and Sorel Reisman",
  title =        "Letters: {Windows CE} Success",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "5",
  pages =        "10--10",
  month =        may,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Tue May 06 16:45:11 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib",
  note =         "Response to \cite{Lewis:1997:BCI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Lewis:1997:BCI,
  author =       "Ted Lewis",
  title =        "Binary Critic: If {Java} Is the Answer, What Was the
                 Question?",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "3",
  pages =        "136, 133--135",
  month =        mar,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Apr 29 17:58:51 1999",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib",
  note =         "See responses
                 \cite{Gozum:1997:LWC,Olsen:1997:LWJ,McReynolds:1997:LBS,Struble:1997:LDJ,Welch:1997:LEI}.",
  acknowledgement = ack-nhfb,
  classification = "C5620W (Other computer networks); C6110J
                 (Object-oriented programming); C6140D (High level
                 languages); C6150N (Distributed systems software)",
  corpsource =   "Naval Postgraduate Sch., Monterey, CA, USA",
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  keywords =     "C/C++; computer industry; information networks; Java
                 adoption curve; Java language; object- oriented
                 programming; object-oriented languages; product hype;
                 software engineering challenges",
  treatment =    "P Practical",
}

@Article{McReynolds:1997:LBS,
  author =       "David McReynolds",
  title =        "Letters: {Brooks} Said It Ten Years Ago",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "5",
  pages =        "9--10",
  month =        may,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Tue May 06 16:45:11 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib",
  note =         "Response to \cite{Lewis:1997:BCI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Olsen:1997:LWJ,
  author =       "Kurt Olsen",
  title =        "Letters: Why {Java} Isn't Watered Down {C++}",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "5",
  pages =        "9--9",
  month =        may,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Fri Jul 11 09:44:48 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib",
  note =         "Response to \cite{Lewis:1997:BCI}. See also
                 \cite{Welch:1997:LEI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Struble:1997:LDJ,
  author =       "Craig A. Struble and Ted Lewis",
  title =        "Letters: Deadlocks, and {Java}",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "5",
  pages =        "10--10",
  month =        may,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Tue May 06 16:45:11 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib",
  note =         "Response to \cite{Lewis:1997:BCI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Welch:1997:LEI,
  author =       "Peter Welch",
  title =        "Letters to the Editor: Ignore the Monitor Methods!",
  journal =      j-COMPUTER,
  volume =       "30",
  number =       "7",
  pages =        "7, 9",
  month =        jul,
  year =         "1997",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Wed Aug 13 09:51:45 1997",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer1990.bib;
                 http://www.math.utah.edu/pub/tex/bib/java.bib",
  note =         "Comments on \cite{Lewis:1997:BCI}, and raises concerns
                 about the inadequacy of the Java threads model, and
                 points to
                 \path=http://www.cs.bris.ac.uk/~alan/javappp.html= as a
                 source for Java classes implementing C. A. R. Hoare's
                 Communicating Sequential Processes. See also
                 \cite{Olsen:1997:LWJ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}

@Article{Grubel:1998:HSA,
  author =       "Rudolf Gr{\"u}bel",
  title =        "{Hoare}'s Selection Algorithm: a {Markov} Chain
                 Approach",
  journal =      j-J-APPL-PROBAB,
  volume =       "35",
  number =       "1",
  pages =        "36--45",
  month =        mar,
  year =         "1998",
  CODEN =        "JPRBAM",
  DOI =          "https://doi.org/10.2307/3215544",
  ISSN =         "0021-9002 (print), 1475-6072 (electronic)",
  ISSN-L =       "0021-9002",
  bibdate =      "Sat May 3 07:43:47 MDT 2014",
  bibsource =    "http://www.jstor.org/stable/i361370;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/japplprobab.bib",
  URL =          "http://www.jstor.org/stable/3215544",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Appl. Probab.",
  fjournal =     "Journal of Applied Probability",
  journal-URL =  "http://www.jstor.org/journals/00219002.html",
}

@Article{Kirschenhofer:1998:CHF,
  author =       "Peter Kirschenhofer and Helmut Prodinger",
  title =        "Comparisons in {Hoare}'s {\tt find} Algorithm",
  journal =      j-COMBIN-PROBAB-COMPUT,
  volume =       "7",
  number =       "1",
  pages =        "111--120",
  month =        mar,
  year =         "1998",
  CODEN =        "CPCOFG",
  DOI =          "https://doi.org/10.1017/S0963548397003325",
  ISSN =         "0963-5483 (print), 1469-2163 (electronic)",
  ISSN-L =       "0963-5483",
  bibdate =      "Mon Jul 7 15:38:04 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/combinprobabcomput.bib",
  URL =          "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=7&issueId=01",
  acknowledgement = ack-nhfb,
  ajournal =     "Combin. Probab. Comput.",
  fjournal =     "Combinatorics, Probability and Computing",
  journal-URL =  "http://journals.cambridge.org/action/displayBackIssues?jid=CPC",
}

@Article{vanAmmers:1998:PCC,
  author =       "Eric W. van Ammers",
  title =        "Program construction by context independent
                 refinements",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "30",
  number =       "3",
  pages =        "251--286",
  day =          "2",
  month =        mar,
  year =         "1998",
  CODEN =        "SCPGD4",
  DOI =          "https://doi.org/10.1016/S0167-6423(97)00018-X",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  MRclass =      "68Q60 (68N05)",
  MRnumber =     "1 609 698",
  bibdate =      "Mon Oct 11 18:07:02 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.elsevier.com/cgi-bin/cas/tree/store/scico/cas_free/browse/browse.cgi?year=1998&volume=30&issue=3;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423;
                 MathSciNet database",
  URL =          "http://www.elsevier.com/cas/tree/store/scico/sub/1998/30/3/527.pdf",
  acknowledgement = ack-nhfb,
  affiliation =  "Wageningen Agricultural Univ",
  affiliationaddress = "Neth",
  classification = "723.1",
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
  journalabr =   "Sci Comput Program",
  keywords =     "Computer programming; Data flow analysis; Generalized
                 Hoare-triplets; Sorting; Stepwise refinements",
}

@Unpublished{Dijkstra:1999:FWT,
  author =       "Edsger W. Dijkstra",
  title =        "A formula is worth a thousand pictures (dedicated to
                 {Charles Antony Richard Hoare})",
  month =        jun,
  year =         "1999",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd12xx/EWD1280a.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "350 KB",
  oldlabel =     "EWD:EWD1280a",
}

@Article{Kleymann:1999:HLA,
  author =       "Thomas Kleymann",
  title =        "{Hoare} Logic and Auxiliary Variables",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "11",
  number =       "5",
  pages =        "541--566",
  month =        dec,
  year =         "1999",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/s001650050057",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Tue Mar 17 20:58:04 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/s001650050057",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Cipra:2000:BCE,
  author =       "Barry A. Cipra",
  title =        "The Best of the {20th Century}: Editors Name Top 10
                 Algorithms",
  journal =      j-SIAM-NEWS,
  volume =       "33",
  number =       "4",
  pages =        "1--2",
  month =        may,
  year =         "2000",
  ISSN =         "0036-1437",
  ISSN-L =       "0036-1437",
  bibdate =      "Thu Sep 03 19:34:45 2020",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/m/metropolis-nicholas.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/s/stiefel-eduard.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/tukey-john-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/u/ulam-stanislaw-m.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
                 http://www.math.utah.edu/pub/bibnet/subjects/fastmultipole.bib;
                 http://www.math.utah.edu/pub/tex/bib/fortran3.bib",
  URL =          "https://archive.siam.org/pdf/news/637.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM News",
  journal-URL =  "http://www.siam.org/news/",
  keywords =     "1946: Monte Carlo method (John von Neumann, Stan Ulam,
                 and Nick Metropolis); 1947: simplex method for linear
                 programming (George Dantzig); 1950: Krylov subspace
                 iteration methods and conjugate gradient (Magnus
                 Hestenes, Eduard Stiefel, and Cornelius Lanczos); 1951:
                 decompositional approach to matrix computations (Alston
                 Householder); 1957: Fortran optimizing compiler (John
                 Backus); 1959--1961: QR algorithm (J. G. F. Francis);
                 1962: Quicksort (Tony Hoare); 1965: Fast Fourier
                 Transform (James Cooley and John Tukey); 1977: integer
                 relation detection algorithm (Helaman Ferguson and
                 Rodney Forcade); 1987: fast multipole algorithm (Leslie
                 Greengard and Vladimir Rokhlin)",
  subject-dates = "Alston Scott Householder (5 May 1904--4 July 1993);
                 Cornelius Lanczos (2 February 1893--25 June 1974);
                 Eduard Stiefel (21 April 1909--25 November 1978);
                 George Bernard Dantzig (8 November 1914--13 May 2005);
                 James William Cooley (1926--June 29, 2016); John Warner
                 Backus (3 December 1924--17 March 2007); John Wilder
                 Tukey (16 June 1915--26 July 2000); Magnus Rudolph
                 Hestenes (13 February 1906--31 May 1991); Neumann
                 J{\'a}nos (28 December 1903--8 February 1957); Nicholas
                 Constantine Metropolis (11 June 1915--17 October 1999);
                 Stanis{\l}aw Marcin Ulam (13 April 1909--13 May 1984)",
}

@Article{Cohen:2000:NCP,
  author =       "Ernie Cohen and Dexter Kozen",
  title =        "A note on the complexity of propositional {Hoare}
                 logic",
  journal =      j-TOCL,
  volume =       "1",
  number =       "1",
  pages =        "171--174",
  month =        jul,
  year =         "2000",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/343369.343404",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Fri Oct 13 11:28:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tocl/2000-1-1/p171-cohen/",
  abstract =     "We provide a simpler alternative proof of the {\em
                 PSPACE\/} -hardness of propositional Hoare logic
                 (PHL).",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
  keywords =     "Hoare logic; specification",
  subject =      "Software --- Software Engineering --- Design Tools and
                 Techniques (D.2.2): {\bf Structured programming**};
                 Software --- Software Engineering --- Software/Program
                 Verification (D.2.4): {\bf Correctness proofs};
                 Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Control
                 structures}; Theory of Computation --- Logics and
                 Meanings of Programs --- Specifying and Verifying and
                 Reasoning about Programs (F.3.1): {\bf Assertions};
                 Theory of Computation --- Logics and Meanings of
                 Programs --- Specifying and Verifying and Reasoning
                 about Programs (F.3.1): {\bf Invariants}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Logics of programs}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Mechanical verification}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Pre- and post-conditions}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Specification techniques}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2): {\bf
                 Algebraic approaches to semantics}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Studies of Program Constructs (F.3.3): {\bf Control
                 primitives}; Computing Methodologies --- Artificial
                 Intelligence --- Automatic Programming (I.2.2): {\bf
                 Program verification}",
}

@Article{Huisman:2000:JPV,
  author =       "Marieke Huisman and Bart Jacobs",
  title =        "{Java} Program Verification via a {Hoare} Logic with
                 Abrupt Termination",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1783",
  pages =        "284--??",
  year =         "2000",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-46428-X_20",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Feb 1 09:16:14 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t1783.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/1783/17830284.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/1783/17830284.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{JaJa:2000:PQ,
  author =       "Joseph JaJa",
  title =        "A Perspective on Quicksort",
  journal =      j-COMPUT-SCI-ENG,
  volume =       "2",
  number =       "1",
  pages =        "43--49",
  month =        jan # "\slash " # feb,
  year =         "2000",
  CODEN =        "CSENFA",
  DOI =          "https://doi.org/10.1109/5992.814657",
  ISSN =         "1521-9615 (print), 1558-366X (electronic)",
  ISSN-L =       "1521-9615",
  bibdate =      "Fri Oct 13 14:31:09 2000",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/computscieng.bib",
  URL =          "http://dlib.computer.org/cs/books/cs2000/pdf/c1043.pdf;
                 http://www.computer.org/cse/cs1999/c1043abs.htm",
  abstract =     "This article introduces the basic Quicksort algorithm
                 and gives a flavor of the richness of its complexity
                 analysis. The author also provides a glimpse of some of
                 its generalizations to parallel algorithms and
                 computational geometry.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computing in Science and Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992",
}

@Article{Kozen:2000:HLK,
  author =       "Dexter Kozen",
  title =        "On {Hoare} logic and {Kleene} algebra with tests",
  journal =      j-TOCL,
  volume =       "1",
  number =       "1",
  pages =        "60--76",
  month =        jul,
  year =         "2000",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/343369.343378",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Fri Oct 13 11:28:38 MDT 2000",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/tocl/2000-1-1/p60-kozen/",
  abstract =     "We show that Kleene algebra with tests (KAT) subsumes
                 propositional Hoare logic (PHL). Thus the specialized
                 syntax and deductive apparatus of Hoare logic are
                 inessential and can be replaced by simple equational
                 reasoning. In addition, we show that all relationally
                 valid inference rules are derivable in KAT and that
                 deciding the relational validity of such rules is {\em
                 PSPACE}-complete.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
  keywords =     "dynamic logic; Hoare logic; Kleene algebra; Kleene
                 algebra with tests; specification",
  subject =      "Software --- Software Engineering --- Design Tools and
                 Techniques (D.2.2): {\bf Structured programming**};
                 Software --- Software Engineering --- Software/Program
                 Verification (D.2.4): {\bf Correctness proofs};
                 Software --- Programming Languages --- Language
                 Constructs and Features (D.3.3): {\bf Control
                 structures}; Theory of Computation --- Logics and
                 Meanings of Programs --- Specifying and Verifying and
                 Reasoning about Programs (F.3.1): {\bf Assertions};
                 Theory of Computation --- Logics and Meanings of
                 Programs --- Specifying and Verifying and Reasoning
                 about Programs (F.3.1): {\bf Invariants}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Logics of programs}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Mechanical verification}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Pre- and post-conditions}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Specifying and Verifying and Reasoning about Programs
                 (F.3.1): {\bf Specification techniques}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Semantics of Programming Languages (F.3.2): {\bf
                 Algebraic approaches to semantics}; Theory of
                 Computation --- Logics and Meanings of Programs ---
                 Studies of Program Constructs (F.3.3): {\bf Control
                 primitives}; Computing Methodologies --- Symbolic and
                 Algebraic Manipulation --- Expressions and Their
                 Representation (I.1.1): {\bf Simplification of
                 expressions}; Computing Methodologies --- Symbolic and
                 Algebraic Manipulation --- Languages and Systems
                 (I.1.3): {\bf Special-purpose algebraic systems};
                 Computing Methodologies --- Artificial Intelligence ---
                 Automatic Programming (I.2.2): {\bf Program
                 modification}; Computing Methodologies --- Artificial
                 Intelligence --- Automatic Programming (I.2.2): {\bf
                 Program transformation}; Computing Methodologies ---
                 Artificial Intelligence --- Automatic Programming
                 (I.2.2): {\bf Program synthesis}; Computing
                 Methodologies --- Artificial Intelligence --- Automatic
                 Programming (I.2.2): {\bf Program verification}",
}

@Article{Blass:2001:ICL,
  author =       "Andreas Blass and Yuri Gurevich",
  title =        "Inadequacy of computable loop invariants",
  journal =      j-TOCL,
  volume =       "2",
  number =       "1",
  pages =        "1--11",
  year =         "2001",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/371282.371285",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Wed Jul 25 07:10:50 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/tocl/2001-2-1/p1-blass/p1-blass.pdf;
                 http://www.acm.org/pubs/citations/journals/tocl/2001-2-1/p1-blass/",
  abstract =     "Hoare logic is a widely recommended verification tool.
                 There is, however, a problem of finding easily
                 checkable loop invariants; it is known that decidable
                 assertions do not suffice to verify while programs,
                 even when the pre- and postconditions are decidable. We
                 show here a stronger result: decidable invariants do
                 not suffice to verify single-loop programs. We also
                 show that this problem arises even in extremely simple
                 contexts. Let $N$ be the structure consisting of the
                 set of natural numbers together with the functions $
                 S(x) = x + 1$, $ D(x) = 2 (x) = *** x / 2 ***$. There
                 is a single-loop program *** using only three variables
                 $ x, y, z$ such that the asserted program $ x = y = z =
                 0$ *** false is partially correct on $N$ but any loop
                 invariant $ I(x, y, z)$ for this asserted program is
                 undecidable.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Computational Logic",
  generalterms = "Algorithms; Theory; Verification",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
  keywords =     "assertion; automated deduction; automated reasoning;
                 Hoare logic; loop invariants; postcondition
                 uncomputable; precondition; recursive inseparability",
  subject =      "Theory of Computation --- Logics and Meanings of
                 Programs --- Specifying and Verifying and Reasoning
                 about Programs (F.3.1): {\bf Invariants}",
}

@Article{Reus:2001:HCV,
  author =       "Bernhard Reus and Martin Wirsing and Rolf Hennicker",
  title =        "A {Hoare} Calculus for Verifying {Java} Realizations
                 of {OCL}-Constrained Design Models",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2029",
  pages =        "300--??",
  year =         "2001",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45314-8_22",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Feb 2 13:03:46 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2029.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2001a.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2029/20290300.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2029/20290300.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{vonOheimb:2001:HLJ,
  author =       "David von Oheimb",
  title =        "{Hoare} logic for {Java} in {Isabelle\slash HOL}",
  journal =      j-CCPE,
  volume =       "13",
  number =       "13",
  pages =        "1173--1214",
  month =        nov,
  year =         "2001",
  CODEN =        "CCPEBO",
  DOI =          "https://doi.org/10.1002/cpe.598",
  ISSN =         "1532-0626 (print), 1532-0634 (electronic)",
  ISSN-L =       "1532-0626",
  bibdate =      "Mon Feb 25 14:51:24 MST 2002",
  bibsource =    "http://www.interscience.wiley.com/jpages/1532-0626;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/ccpe.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www3.interscience.wiley.com/journalfinder.html",
  URL =          "http://www3.interscience.wiley.com/cgi-bin/abstract/88011338/START;
                 http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=88011338&PLACEBO=IE.pdf",
  acknowledgement = ack-nhfb,
  ajournal =     "Concurrency Computat., Pract. Exper.",
  fjournal =     "Concurrency and Computation: Practice and Experience",
  journal-URL =  "http://www.interscience.wiley.com/jpages/1532-0626",
}

@Article{deBoer:2002:HLD,
  author =       "F. S. de Boer",
  title =        "A {Hoare} logic for dynamic networks of asynchronously
                 communicating deterministic processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "274",
  number =       "1--2",
  pages =        "3--41",
  day =          "6",
  month =        mar,
  year =         "2002",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/S0304-3975(00)00304-2",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed Feb 27 09:05:24 MST 2002",
  bibsource =    "http://www.elsevier.com/locate/issn/03043975;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
  URL =          "http://www.elsevier.com/gej-ng/10/41/16/227/27/28/abstract.html",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@TechReport{Frana:2002:ICA,
  author =       "Philip Frana",
  title =        "An Interview with {Charles Antony Richard Hoare}",
  number =       "OH 357",
  institution =  "Charles Babbage Institute Center for the History of
                 Information Processing University of Minnesota",
  address =      "Minneapolis, MN, USA",
  pages =        "43",
  day =          "17",
  month =        jul,
  year =         "2002",
  bibdate =      "Wed Aug 10 16:26:50 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://pascal.hansotten.com/uploads/hoare/oh357th.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Hartog:2002:VPP,
  author =       "J. I. D. Hartog and E. P. D. Vink",
  title =        "Verifying Probabilistic Programs Using a {Hoare} Like
                 Logic",
  journal =      j-INT-J-FOUND-COMP-SCI,
  volume =       "13",
  number =       "3",
  pages =        "315--??",
  year =         "2002",
  CODEN =        "IFCSEN",
  ISSN =         "0129-0541 (print), 1793-6373 (electronic)",
  ISSN-L =       "0129-0541",
  bibdate =      "Tue Jan 27 08:06:52 MST 2004",
  bibsource =    "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Foundations of Computer
                 Science (IJFCS)",
  journal-URL =  "http://www.worldscientific.com/loi/ijfcs",
}

@Article{Nipkow:2002:HLR,
  author =       "Tobias Nipkow",
  title =        "{Hoare} Logics for Recursive Procedures and Unbounded
                 Nondeterminism",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2471",
  pages =        "103--119",
  year =         "2002",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45793-3_8",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:11:24 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2471.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2002d.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2471/24710103.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2471/24710103.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{vonOheimb:2002:HLN,
  author =       "David von Oheimb and Tobias Nipkow",
  title =        "{Hoare} Logic for {NanoJava}: Auxiliary Variables,
                 Side Effects, and Virtual Methods Revisited",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2391",
  pages =        "89--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-45614-7_6",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Sep 10 19:10:10 MDT 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2391.htm;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2002c.bib",
  URL =          "http://link.springer-ny.com/link/service/series/0558/bibs/2391/23910089.htm;
                 http://link.springer-ny.com/link/service/series/0558/papers/2391/23910089.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Santini:2005:WSI,
  author =       "Simone Santini",
  title =        "We Are Sorry to Inform You \ldots{}",
  journal =      j-COMPUTER,
  volume =       "38",
  number =       "12",
  pages =        "128, 126--127",
  month =        dec,
  year =         "2005",
  CODEN =        "CPTRB4",
  DOI =          "https://doi.org/10.1109/MC.2005.423",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Fri Jul 4 17:16:19 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
                 http://www.math.utah.edu/pub/tex/bib/computer2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  remark =       "With a byline of `How much damage could be caused by a
                 peer reviewer having a bad day?', this article is an
                 amusing collection of spoofed referee reports that
                 might have been written to reject some of the most
                 famous papers in computer science: E. W. Dijkstra,
                 \booktitle{Goto Statement Considered Harmful}; E. F.
                 Codd, \booktitle{A Relational Model of Data for Large
                 Shared Data Banks}; A. Turing, \booktitle{On Computable
                 Numbers, with an Application to the
                 Entscheidungsproblem}; C. E. Shannon, \booktitle{A
                 Mathematical Theory of Communication}; C. A. R. Hoare,
                 \booktitle{An Axiomatic Basis for Computer
                 Programming}; R. L. Rivest, A. Shamir, and L. Adelman,
                 \booktitle{A Method for Obtaining Digital Signatures
                 and Public-Key Cryptosystems}.",
  subject-dates = "Claude Elwood Shannon (1916--2001)",
}

@Article{Nanevski:2006:PSH,
  author =       "Aleksandar Nanevski and Greg Morrisett and Lars
                 Birkedal",
  title =        "Polymorphism and separation in {Hoare} type theory",
  journal =      j-SIGPLAN,
  volume =       "41",
  number =       "9",
  pages =        "62--73",
  month =        sep,
  year =         "2006",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1159803.1159812",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 10:46:22 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "In previous work, we proposed a Hoare Type Theory
                 (HTT) which combines effectful higher-order functions,
                 dependent types and Hoare Logic specifications into a
                 unified framework. However, the framework did not
                 support polymorphism, and failed to provide a modular
                 treatment of state in specifications. In this paper, we
                 address these shortcomings by showing that the addition
                 of polymorphism alone is sufficient for capturing
                 modular state specifications in the style of Separation
                 Logic. Furthermore, we argue that polymorphism is an
                 essential ingredient of the extension, as the treatment
                 of higher-order functions requires operations not
                 encodable via the spatial connectives of Separation
                 Logic.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "Hoare logic; separation logic; type theory",
}

@Article{Ni:2006:CAP,
  author =       "Zhaozhong Ni and Zhong Shao",
  title =        "Certified assembly programming with embedded code
                 pointers",
  journal =      j-SIGPLAN,
  volume =       "41",
  number =       "1",
  pages =        "320--333",
  month =        jan,
  year =         "2006",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1111037.1111066",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 10:39:41 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "Embedded code pointers (ECPs) are stored handles of
                 functions and continuations commonly seen in low-level
                 binaries as well as functional or higher-order
                 programs. ECPs are known to be very hard to support
                 well in Hoare-logic style verification systems. As a
                 result, existing proof-carrying code (PCC) systems have
                 to either sacrifice the expressiveness or the
                 modularity of program specifications, or resort to
                 construction of complex semantic models. In Reynolds's
                 LICS'02 paper, supporting ECPs is listed as one of the
                 main open problems for separation logic. In this paper
                 we present a simple and general technique for solving
                 the ECP problem for Hoare-logic-based PCC systems. By
                 adding a small amount of syntax to the assertion
                 language, we show how to combine semantic consequence
                 relation with syntactic proof techniques. The result is
                 a new powerful framework that can perform modular
                 reasoning on ECPs while still retaining the
                 expressiveness of Hoare logic. We show how to use our
                 techniques to support polymorphism, closures, and other
                 language extensions and how to solve the ECP problem
                 for separation logic. Our system is fully mechanized.
                 We give its complete soundness proof and a full
                 verification of Reynolds's CPS-style 'list-append'
                 example in the Coq proof assistant.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "embedded code pointers; higher-order functions; Hoare
                 logic; proof-carrying code",
}

@Article{Shapiro:2006:PPC,
  author =       "Marc Shapiro",
  title =        "Practical proofs of concurrent programs",
  journal =      j-SIGPLAN,
  volume =       "41",
  number =       "9",
  pages =        "123--123",
  month =        sep,
  year =         "2006",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1159803.1159819",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 10:46:22 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "assertions; concurrent programming; Hoare logic;
                 program proofs; rely-guarantee",
}

@Article{Thielecke:2006:FRA,
  author =       "Hayo Thielecke",
  title =        "Frame rules from answer types for code pointers",
  journal =      j-SIGPLAN,
  volume =       "41",
  number =       "1",
  pages =        "309--319",
  month =        jan,
  year =         "2006",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1111037.1111065",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 10:39:41 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "We define a type system, which may also be considered
                 as a simple Hoare logic, for a fragment of an assembly
                 language that deals with code pointers and jumps. The
                 typing is aimed at local reasoning in the sense that
                 only the type of a code pointer is needed, and there is
                 no need to know the whole code itself. The main
                 features of the type system are separation logic
                 connectives for describing the heap, and polymorphic
                 answer types of continuations for keeping track of
                 jumps. Specifically, we address an interaction between
                 separation and answer types: frame rules for local
                 reasoning in the presence of jumps are recovered by
                 instantiating the answer type. However, the
                 instantiation of answer types is not sound for all
                 types. To guarantee soundness, we restrict
                 instantiation to closed types, where the notion of
                 closedness arises from biorthogonality (in a sense
                 inspired by Krivine and Pitts). A machine state is
                 orthogonal to a disjoint heap if their combination does
                 not lead to a fault. Closed types are sets of machine
                 states that are orthogonal to a set of heaps. We use
                 closed types as well-behaved answer types.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "code pointers; continuations; Hoare logic;
                 polymorphism; typed assembly language",
}

@Article{Anonymous:2007:DIPa,
  author =       "Anonymous",
  title =        "Discussion on {``The Ideal of Program Correctness''}
                 by {Tony Hoare}",
  journal =      j-COMP-J,
  volume =       "50",
  number =       "3",
  pages =        "261--268",
  month =        may,
  year =         "2007",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxl079",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Wed Apr 28 14:33:33 MDT 2010",
  bibsource =    "http://comjnl.oxfordjournals.org/content/vol50/issue3/index.dtl;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj2000.bib",
  note =         "See \cite{Hoare:2007:IPC,Anonymous:2007:DIPb}.",
  URL =          "http://comjnl.oxfordjournals.org/cgi/content/full/50/3/261;
                 http://comjnl.oxfordjournals.org/cgi/reprint/50/3/261",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Anonymous:2007:DIPb,
  author =       "Anonymous",
  title =        "Discussion on {``The Ideal of Program Correctness''}:
                 Responses from {Tony Hoare}",
  journal =      j-COMP-J,
  volume =       "50",
  number =       "3",
  pages =        "269--273",
  month =        may,
  year =         "2007",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/bxl080",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Wed Apr 28 14:33:33 MDT 2010",
  bibsource =    "http://comjnl.oxfordjournals.org/content/vol50/issue3/index.dtl;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/compj2000.bib",
  note =         "See \cite{Hoare:2007:IPC,Anonymous:2007:DIPa}",
  URL =          "http://comjnl.oxfordjournals.org/cgi/content/full/50/3/269;
                 http://comjnl.oxfordjournals.org/cgi/reprint/50/3/269",
  acknowledgement = ack-nhfb,
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
}

@Article{Cai:2007:CSM,
  author =       "Hongxu Cai and Zhong Shao and Alexander Vaynberg",
  title =        "Certified self-modifying code",
  journal =      j-SIGPLAN,
  volume =       "42",
  number =       "6",
  pages =        "66--77",
  month =        jun,
  year =         "2007",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1250734.1250743",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 10:55:30 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "Self-modifying code (SMC), in this paper, broadly
                 refers to any program that loads, generates, or mutates
                 code at runtime. It is widely used in many of the
                 world's critical software systems to support runtime
                 code generation and optimization, dynamic loading and
                 linking, OS boot loader, just-in-time compilation,
                 binary translation,or dynamic code encryption and
                 obfuscation. Unfortunately, SMC is also extremely
                 difficult to reason about: existing formal verification
                 techniques-including Hoare logic and type
                 system-consistently assume that program code stored in
                 memory is fixed and immutable; this severely limits
                 their applicability and power.\par

                 This paper presents a simple but novel Hoare-logic-like
                 framework that supports modular verification of general
                 von-Neumann machine code with runtime code
                 manipulation. By dropping the assumption that code
                 memory is fixed and immutable, we are forced to apply
                 local reasoning and separation logic at the very
                 beginning, and treat program code uniformly as regular
                 data structure. We address the interaction between
                 separation and code memory and show how to establish
                 the frame rules for local reasoning even in the
                 presence of SMC. Our framework is realistic, but
                 designed to be highly generic, so that it can support
                 assembly code under all modern CPUs (including both x86
                 and MIPS). Our system is expressive and fully
                 mechanized. We prove its soundness in the Coq proof
                 assistant and demonstrate its power by certifying a
                 series of realistic examples and applications-all of
                 which can directly run on the SPIM simulator or any
                 stock x86 hardware.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "assembly code verification; Hoare logic; modular
                 verification; runtime code manipulation; self-modifying
                 code",
}

@Article{Saabas:2007:CNS,
  author =       "Ando Saabas and Tarmo Uustalu",
  title =        "A compositional natural semantics and {Hoare} logic
                 for low-level languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "373",
  number =       "3",
  pages =        "273--302",
  day =          "5",
  month =        apr,
  year =         "2007",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2006.12.020",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Mar 29 08:55:40 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2005.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Shaner:2007:MVH,
  author =       "Steve M. Shaner and Gary T. Leavens and David A.
                 Naumann",
  title =        "Modular verification of higher-order methods with
                 mandatory calls specified by model programs",
  journal =      j-SIGPLAN,
  volume =       "42",
  number =       "10",
  pages =        "351--368",
  month =        oct,
  year =         "2007",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1297105.1297053",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 11:00:28 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "What we call a ''higher-order method' (HOM) is a
                 method that makes mandatory calls to other
                 dynamically-dispatched methods. Examples include
                 template methods as in the Template method design
                 pattern and notify methods in the Observer pattern.
                 HOMs are particularly difficult to reason about,
                 because standard pre- and postcondition specifications
                 cannot describe the mandatory calls. For reasoning
                 about such methods, existing approaches use either
                 higher order logic or traces, but both are complex and
                 verbose.\par

                 We describe a simple, concise, and modular approach to
                 specifying HOMs We show how to verify calls to HOMs and
                 their code using first-order verification conditions,
                 in a sound and modular way.\par

                 Verification of client code that calls HOMs can take
                 advantage of the client's knowledge about the mandatory
                 calls to make strong conclusions. Our verification
                 technique validates and explains traditional
                 documentation practice for HOMs, which typically shows
                 their code. However, specifications do not have to
                 expose all of the code to clients, but only enough to
                 determine how the HOM makes its mandatory calls.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "grey-box approach; higher order method; Hoare logic;
                 mandatory call; model program; refinement calculus;
                 specification languages; verification",
}

@Article{Brotherston:2008:CPP,
  author =       "James Brotherston and Richard Bornat and Cristiano
                 Calcagno",
  title =        "Cyclic proofs of program termination in separation
                 logic",
  journal =      j-SIGPLAN,
  volume =       "43",
  number =       "1",
  pages =        "101--112",
  month =        jan,
  year =         "2008",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1328897.1328453",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 11:02:13 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "We propose a novel approach to proving the termination
                 of heap-manipulating programs, which combines
                 separation logic with cyclic proof within a Hoare-style
                 proof system. Judgements in this system express
                 (guaranteed) termination of the program when started
                 from a given line in the program and in a state
                 satisfying a given precondition, which is expressed as
                 a formula of separation logic. The proof rules of our
                 system are of two types: logical rules that operate on
                 preconditions; and symbolic execution rules that
                 capture the effect of executing program
                 commands.\par

                 Our logical preconditions employ inductively defined
                 predicates to describe heap properties, and proofs in
                 our system are cyclic proofs: cyclic derivations in
                 which some inductive predicate is unfolded infinitely
                 often along every infinite path, thus allowing us to
                 discard all infinite paths in the proof by an infinite
                 descent argument. Moreover, the use of this soundness
                 condition enables us to avoid the explicit construction
                 and use of ranking functions for termination. We also
                 give a completeness result for our system, which is
                 relative in that it relies upon completeness of a proof
                 system for logical implications in separation logic. We
                 give examples illustrating our approach, including one
                 example for which the corresponding ranking function is
                 non-obvious: termination of the classical algorithm for
                 in-place reversal of a (possibly cyclic) linked list.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "cyclic proof; Hoare logic; inductive definitions;
                 program verification; separation logic; termination",
}

@Article{denHartog:2008:TMC,
  author =       "Jerry den Hartog",
  title =        "Towards mechanized correctness proofs for
                 cryptographic algorithms: {Axiomatization} of a
                 probabilistic {Hoare} style logic",
  journal =      j-SCI-COMPUT-PROGRAM,
  volume =       "74",
  number =       "1--2",
  pages =        "52--63",
  day =          "1",
  month =        dec,
  year =         "2008",
  CODEN =        "SCPGD4",
  ISSN =         "0167-6423 (print), 1872-7964 (electronic)",
  ISSN-L =       "0167-6423",
  bibdate =      "Fri Apr 1 18:39:23 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib;
                 http://www.sciencedirect.com/science/journal/01676423",
  acknowledgement = ack-nhfb,
  fjournal =     "Science of Computer Programming",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01676423/",
}

@InProceedings{Gardner:2008:LHR,
  author =       "Philippa A. Gardner and Gareth D. Smith and Mark J.
                 Wheelhouse and Uri D. Zarfaty",
  title =        "Local {Hoare} reasoning about {DOM}",
  crossref =     "Lenzerini:2008:PTS",
  pages =        "261--270",
  year =         "2008",
  DOI =          "https://doi.org/10.1145/1376916.1376953",
  bibdate =      "Fri Jun 20 14:17:29 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/pods.bib",
  abstract =     "The W3C Document Object Model (DOM) specifies an XML
                 update library. DOM is written in English, and is
                 therefore not compositional and not complete. We
                 provide a first step towards a compositional
                 specification of DOM. Unlike DOM, we are able to work
                 with a minimal set of commands and obtain a complete
                 reasoning for straight-line code. Our work transfers
                 O'Hearn, Reynolds and Yang's local Hoare reasoning for
                 analysing heaps to XML, viewing XML as an in-place
                 memory store as does DOM. In particular, we apply
                 recent work by Calcagno, Gardner and Zarfaty on local
                 Hoare reasoning about simple tree update to this
                 real-world DOM application. Our reasoning not only
                 formally specifies a significant subset of DOM Core
                 Level 1, but can also be used to verify, for example,
                 invariant properties of simple Javascript programs.",
  acknowledgement = ack-nhfb,
  keywords =     "context logic; dom; local Hoare reasoning; XML",
}

@Article{Nanevski:2008:HTT,
  author =       "Aleksandar Nanevski and Greg Morrisett and Lars
                 Birkedal",
  title =        "{Hoare} type theory, polymorphism and separation",
  journal =      j-J-FUNCT-PROGRAM,
  volume =       "18",
  number =       "5",
  pages =        "865--911",
  month =        sep,
  year =         "2008",
  CODEN =        "JFPRES",
  DOI =          "https://doi.org/10.1017/S0956796808006953",
  ISSN =         "0956-7968 (print), 1469-7653 (electronic)",
  ISSN-L =       "0956-7968",
  bibdate =      "Tue Jul 11 18:07:53 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib",
  URL =          "https://www.cambridge.org/core/product/D6B10CE5025B4C895C2FC7438393195E",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Funct. Program.",
  fjournal =     "Journal of Functional Programming",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=JFP",
  onlinedate =   "02 September 2008",
}

@Article{Nanevski:2008:YDT,
  author =       "Aleksandar Nanevski and Greg Morrisett and Avraham
                 Shinnar and Paul Govereau and Lars Birkedal",
  title =        "{Ynot}: dependent types for imperative programs",
  journal =      j-SIGPLAN,
  volume =       "43",
  number =       "9",
  pages =        "229--240",
  month =        sep,
  year =         "2008",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1411204.1411237",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Tue Sep 23 17:31:25 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/hash.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "We describe an axiomatic extension to the Coq proof
                 assistant, that supports writing, reasoning about, and
                 extracting higher-order, dependently-typed programs
                 with {\em side-effects}. Coq already includes a
                 powerful functional language that supports dependent
                 types, but that language is limited to pure, total
                 functions. The key contribution of our extension, which
                 we call Ynot, is the added support for computations
                 that may have effects such as non-termination,
                 accessing a mutable store, and throwing/catching
                 exceptions.\par

                 The axioms of Ynot form a small trusted computing base
                 which has been formally justified in our previous work
                 on Hoare Type Theory (HTT). We show how these axioms
                 can be combined with the powerful type and abstraction
                 mechanisms of Coq to build higher-level reasoning
                 mechanisms which in turn can be used to build
                 realistic, verified software components. To
                 substantiate this claim, we describe here a
                 representative series of modules that implement
                 imperative finite maps, including support for a
                 higher-order (effectful) iterator. The implementations
                 range from simple (e.g., association lists) to complex
                 (e.g., hash tables) but share a common interface which
                 abstracts the implementation details and ensures that
                 the modules properly implement the finite map
                 abstraction.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "Hoare logic; monads; separation logic; type theory",
}

@Article{Arthan:2009:GFS,
  author =       "Rob Arthan and Ursula Martin and Erik A. Mathiesen and
                 Paulo Oliva",
  title =        "A general framework for sound and complete
                 {Floyd-Hoare} logics",
  journal =      j-TOCL,
  volume =       "11",
  number =       "1",
  pages =        "7:1--7:??",
  month =        oct,
  year =         "2009",
  CODEN =        "????",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Tue Mar 16 08:57:54 MDT 2010",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tocl/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
}

@Article{Barthe:2009:FCC,
  author =       "Gilles Barthe and Benjamin Gr{\'e}goire and Santiago
                 Zanella B{\'e}guelin",
  title =        "Formal certification of code-based cryptographic
                 proofs",
  journal =      j-SIGPLAN,
  volume =       "44",
  number =       "1",
  pages =        "90--101",
  month =        jan,
  year =         "2009",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1480881.1480894",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Fri Oct 9 08:40:38 MDT 2009",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "As cryptographic proofs have become essentially
                 unverifiable, cryptographers have argued in favor of
                 developing techniques that help tame the complexity of
                 their proofs. Game-based techniques provide a popular
                 approach in which proofs are structured as sequences of
                 games and in which proof steps establish the validity
                 of transitions between successive games. Code-based
                 techniques form an instance of this approach that takes
                 a code-centric view of games, and that relies on
                 programming language theory to justify proof steps.
                 While code-based techniques contribute to formalize the
                 security statements precisely and to carry out proofs
                 systematically, typical proofs are so long and involved
                 that formal verification is necessary to achieve a high
                 degree of confidence. We present Certicrypt, a
                 framework that enables the machine-checked construction
                 and verification of code-based proofs. Certicrypt is
                 built upon the general-purpose proof assistant Coq, and
                 draws on many areas, including probability, complexity,
                 algebra, and semantics of programming languages.
                 Certicrypt provides certified tools to reason about the
                 equivalence of probabilistic programs, including a
                 relational Hoare logic, a theory of observational
                 equivalence, verified program transformations, and
                 game-based techniques such as reasoning about failure
                 events. The usefulness of Certicrypt is demonstrated
                 through various examples, including a proof of semantic
                 security of OAEP (with a bound that improves upon
                 existing published results), and a proof of existential
                 unforgeability of FDH signatures. Our work provides a
                 first yet significant step towards Halevi's ambitious
                 programme of providing tool support for cryptographic
                 proofs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "coq proof assistant; cryptographic proofs;
                 observational equivalence; program transformations;
                 relational Hoare logic",
}

@Article{Ridge:2009:VDS,
  author =       "Thomas Ridge",
  title =        "Verifying distributed systems: the operational
                 approach",
  journal =      j-SIGPLAN,
  volume =       "44",
  number =       "1",
  pages =        "429--440",
  month =        jan,
  year =         "2009",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/1594834.1480934",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Fri Oct 9 08:40:38 MDT 2009",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2000.bib",
  abstract =     "This work develops an integrated approach to the
                 verification of behaviourally rich programs, founded
                 directly on operational semantics. The power of the
                 approach is demonstrated with a state-of-the-art
                 verification of a core piece of distributed
                 infrastructure, involving networking, a filesystem, and
                 concurrent OCaml code. The formalization is in
                 higher-order logic and proof support is provided by the
                 HOL4 theorem prover.\par

                 Difficult verification problems demand a wide range of
                 techniques. Here these include ground and symbolic
                 evaluation, local reasoning, separation, invariants,
                 Hoare-style assertional reasoning, rely/guarantee,
                 inductive reasoning about protocol correctness,
                 multiple refinement, and linearizability. While each of
                 these techniques is useful in isolation, they are even
                 more so in combination. The first contribution of this
                 paper is to present the operational approach and
                 describe how existing techniques, including all those
                 mentioned above, may be cleanly and precisely
                 integrated in this setting.\par

                 The second contribution is to show how to combine
                 verifications of individual library functions with
                 arbitrary and unknown user code in a compositional
                 manner, focusing on the problems of private state and
                 encapsulation.\par

                 The third contribution is the example verification
                 itself. The infrastructure must behave correctly under
                 arbitrary patterns of host and network failure, whilst
                 for performance reasons the code also includes data
                 races on shared state. Both features make the
                 verification particularly challenging.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "distributed; ground and symbolic evaluation;
                 Hoare-style assertions; HOL; inductive reasoning;
                 infrastructure; invariants; linearizability; local
                 reasoning; network protocol; OCAML; operational
                 semantics; persistent queue; refinement;
                 rely/guarantee; separation",
}

@Article{Shustek:2009:IIC,
  author =       "Len Shustek",
  title =        "Interview: an interview with {C. A. R. Hoare}",
  journal =      j-CACM,
  volume =       "52",
  number =       "3",
  pages =        "38--41",
  month =        mar,
  year =         "2009",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/1467247.1467261",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Wed Feb 25 09:20:24 MST 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm2000.bib",
  abstract =     "C. A. R. Hoare, developer of the Quicksort algorithm
                 and a lifelong contributor to the theory and design of
                 programming languages, discusses the practical
                 application of his theoretical ideas.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Becker:2010:LSM,
  author =       "Moritz Y. Becker and Sebastian Nanz",
  title =        "A logic for state-modifying authorization policies",
  journal =      j-TISSEC,
  volume =       "13",
  number =       "3",
  pages =        "20:1--20:??",
  month =        jul,
  year =         "2010",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1805974.1805976",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Wed Jul 28 14:57:15 MDT 2010",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "Administering and maintaining access control systems
                 is a challenging task, especially in environments with
                 complex and changing authorization requirements. A
                 number of authorization logics have been proposed that
                 aim at simplifying access control by factoring the
                 authorization policy out of the hard-coded resource
                 guard. However, many policies require the authorization
                 state to be updated after a granted access request, for
                 example, to reflect the fact that a user has activated
                 or deactivated a role. Current authorization languages
                 cannot express such state modifications; these still
                 have to be hard-coded into the resource guard. We
                 present a logic for specifying policies where access
                 requests can have effects on the authorization state.
                 The logic is semantically defined by a mapping to
                 Transaction Logic. Using this approach, updates to the
                 state are factored out of the resource guard, thus
                 enhancing maintainability and facilitating more
                 expressive policies that take the history of access
                 requests into account. We also present a sound and
                 complete proof system for reasoning about sequences of
                 access requests. This gives rise to a goal-oriented
                 algorithm for finding minimal sequences that lead to a
                 specified target authorization state.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "access control; Authorization; Hoare logic; policy",
}

@Article{Borgstrom:2011:RSH,
  author =       "Johannes Borgstr{\"o}m and Andrew D. Gordon and
                 Riccardo Pucella",
  title =        "Roles, stacks, histories: a triple for {Hoare}",
  journal =      j-J-FUNCT-PROGRAM,
  volume =       "21",
  number =       "2",
  pages =        "159--207",
  month =        mar,
  year =         "2011",
  CODEN =        "JFPRES",
  DOI =          "https://doi.org/10.1017/S0956796810000134",
  ISSN =         "0956-7968 (print), 1469-7653 (electronic)",
  ISSN-L =       "0956-7968",
  bibdate =      "Wed Jul 12 06:49:18 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib",
  URL =          "https://www.cambridge.org/core/product/23F4063DD70B051277741864576BF603",
  acknowledgement = ack-nhfb,
  ajournal =     "J. Funct. Program.",
  fjournal =     "Journal of Functional Programming",
  journal-URL =  "http://journals.cambridge.org/action/displayJournal?jid=JFP",
  onlinedate =   "22 September 2010",
}

@Article{Ying:2011:FHL,
  author =       "Mingsheng Ying",
  title =        "{Floyd--Hoare} logic for quantum programs",
  journal =      j-TOPLAS,
  volume =       "33",
  number =       "6",
  pages =        "19:1--19:49",
  month =        dec,
  year =         "2011",
  CODEN =        "ATPSDT",
  DOI =          "https://doi.org/10.1145/2049706.2049708",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Thu Dec 29 16:28:40 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toplas/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  abstract =     "Floyd--Hoare logic is a foundation of axiomatic
                 semantics of classical programs, and it provides
                 effective proof techniques for reasoning about
                 correctness of classical programs. To offer similar
                 techniques for quantum program verification and to
                 build a logical foundation of programming methodology
                 for quantum computers, we develop a full-fledged
                 Floyd--Hoare logic for both partial and total
                 correctness of quantum programs. It is proved that this
                 logic is (relatively) complete by exploiting the power
                 of weakest preconditions and weakest liberal
                 preconditions for quantum programs.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
}

@Article{Barthe:2012:PRH,
  author =       "Gilles Barthe and Benjamin Gr{\'e}goire and Santiago
                 Zanella B{\'e}guelin",
  title =        "Probabilistic Relational {Hoare} Logics for
                 Computer-Aided Security Proofs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "7342",
  pages =        "1--6",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-31113-0_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Dec 19 15:20:29 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-31113-0_1/",
  acknowledgement = ack-nhfb,
  book-DOI =     "https://doi.org/10.1007/978-3-642-31113-0",
  book-URL =     "http://www.springerlink.com/content/978-3-642-31113-0",
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
}

@Article{Black:2012:PSD,
  author =       "Andrew P. Black and Peter W. O'Hearn",
  title =        "Presentation of the {SIGPLAN} distinguished
                 achievement award to {Sir Charles Antony Richard Hoare,
                 FRS, FREng, FBCS}; and interview",
  journal =      j-SIGPLAN,
  volume =       "47",
  number =       "1",
  pages =        "1--2",
  month =        jan,
  year =         "2012",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2103621.2103658",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Thu Mar 15 18:16:55 MDT 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "POPL '12 conference proceedings.",
}

@InCollection{Daylight:2012:THM,
  author =       "Edgar G. Daylight",
  title =        "{Tony Hoare} and mathematical logic",
  crossref =     "Daylight:2012:DSE",
  chapter =      "4",
  pages =        "79--104",
  year =         "2012",
  bibdate =      "Wed Aug 10 12:18:49 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Fouz:2012:SAQ,
  author =       "Mahmoud Fouz and Manfred Kufleitner and Bodo Manthey
                 and Nima Zeini Jahromi",
  title =        "On Smoothed Analysis of {Quicksort} and {Hoare}'s
                 {Find}",
  journal =      j-ALGORITHMICA,
  volume =       "62",
  number =       "3--4",
  pages =        "879--905",
  month =        apr,
  year =         "2012",
  CODEN =        "ALGOEJ",
  DOI =          "https://doi.org/10.1007/s00453-011-9490-9",
  ISSN =         "0178-4617 (print), 1432-0541 (electronic)",
  ISSN-L =       "0178-4617",
  bibdate =      "Wed Apr 11 09:16:53 MDT 2012",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=62&issue=3;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/algorithmica.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=62&issue=3&spage=879",
  acknowledgement = ack-nhfb,
  fjournal =     "Algorithmica",
  journal-URL =  "http://link.springer.com/journal/453",
}

@Article{Poskitt:2012:HSV,
  author =       "Christopher M. Poskitt and Detlef Plump",
  title =        "{Hoare}-Style Verification of Graph Programs",
  journal =      j-FUND-INFO,
  volume =       "118",
  number =       "1--2",
  pages =        "135--175",
  month =        jan,
  year =         "2012",
  CODEN =        "FUMAAJ",
  DOI =          "https://doi.org/10.3233/FI-2012-708",
  ISSN =         "0169-2968 (print), 1875-8681 (electronic)",
  ISSN-L =       "0169-2968",
  bibdate =      "Sat Mar 5 17:15:25 MST 2016",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/fundinfo2010.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Fundamenta Informaticae",
  journal-URL =  "http://content.iospress.com/journals/fundamenta-informaticae",
}

@Article{Arthan:2013:HLL,
  author =       "Rob Arthan and Ursula Martin and Paulo Oliva",
  title =        "A {Hoare} logic for linear systems",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "25",
  number =       "3",
  pages =        "345--363",
  month =        may,
  year =         "2013",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/s00165-011-0180-9",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Wed Mar 18 05:35:14 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/s00165-011-0180-9",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Chlipala:2013:BSP,
  author =       "Adam Chlipala",
  title =        "The bedrock structured programming system: combining
                 generative metaprogramming and {Hoare} logic in an
                 extensible program verifier",
  journal =      j-SIGPLAN,
  volume =       "48",
  number =       "9",
  pages =        "391--402",
  month =        sep,
  year =         "2013",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2544174.2500592",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Nov 27 18:32:10 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "We report on the design and implementation of an
                 extensible programming language and its intrinsic
                 support for formal verification. Our language is
                 targeted at low-level programming of infrastructure
                 like operating systems and runtime systems. It is based
                 on a cross-platform core combining characteristics of
                 assembly languages and compiler intermediate languages.
                 From this foundation, we take literally the saying that
                 C is a ``macro assembly language'': we introduce an
                 expressive notion of certified low-level macros,
                 sufficient to build up the usual features of C and
                 beyond as macros with no special support in the core.
                 Furthermore, our macros have integrated support for
                 strongest postcondition calculation and verification
                 condition generation, so that we can provide a
                 high-productivity formal verification environment
                 within Coq for programs composed from any combination
                 of macros. Our macro interface is expressive enough to
                 support features that low-level programs usually only
                 access through external tools with no formal
                 guarantees, such as declarative parsing or SQL-inspired
                 querying. The abstraction level of these macros only
                 imposes a compile-time cost, via the execution of
                 functional Coq programs that compute programs in our
                 intermediate language; but the run-time cost is not
                 substantially greater than for more conventional C
                 code. We describe our experiences constructing a full
                 C-like language stack using macros, with some
                 experiments on the verifiability and performance of
                 individual programs running on that stack.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "ICFP '13 conference proceedings.",
}

@Article{Delbianco:2013:HSR,
  author =       "Germ{\'a}n Andr{\'e}s Delbianco and Aleksandar
                 Nanevski",
  title =        "{Hoare}-style reasoning with (algebraic)
                 continuations",
  journal =      j-SIGPLAN,
  volume =       "48",
  number =       "9",
  pages =        "363--376",
  month =        sep,
  year =         "2013",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2544174.2500593",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Nov 27 18:32:10 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "Continuations are programming abstractions that allow
                 for manipulating the ``future'' of a computation.
                 Amongst their many applications, they enable
                 implementing unstructured program flow through
                 higher-order control operators such as callcc. In this
                 paper we develop a Hoare-style logic for the
                 verification of programs with higher-order control, in
                 the presence of dynamic state. This is done by
                 designing a dependent type theory with first class
                 callcc and abort operators, where pre- and
                 postconditions of programs are tracked through types.
                 Our operators are algebraic in the sense of Plotkin and
                 Power, and Jaskelioff, to reduce the annotation burden
                 and enable verification by symbolic evaluation. We
                 illustrate working with the logic by verifying a number
                 of characteristic examples.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "ICFP '13 conference proceedings.",
}

@Article{Turon:2013:URH,
  author =       "Aaron Turon and Derek Dreyer and Lars Birkedal",
  title =        "Unifying refinement and {Hoare}-style reasoning in a
                 logic for higher-order concurrency",
  journal =      j-SIGPLAN,
  volume =       "48",
  number =       "9",
  pages =        "377--390",
  month =        sep,
  year =         "2013",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2544174.2500600",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Nov 27 18:32:10 MST 2013",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "Modular programming and modular verification go hand
                 in hand, but most existing logics for concurrency
                 ignore two crucial forms of modularity: *higher-order
                 functions*, which are essential for building reusable
                 components, and *granularity abstraction*, a key
                 technique for hiding the intricacies of fine-grained
                 concurrent data structures from the clients of those
                 data structures. In this paper, we present CaReSL, the
                 first logic to support the use of granularity
                 abstraction for modular verification of higher-order
                 concurrent programs. After motivating the features of
                 CaReSL through a variety of illustrative examples, we
                 demonstrate its effectiveness by using it to tackle a
                 significant case study: the first formal proof of
                 (partial) correctness for Hendler et al.'s ``flat
                 combining'' algorithm.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "ICFP '13 conference proceedings.",
}

@Article{Jacobs:2015:DHM,
  author =       "Bart Jacobs",
  title =        "{Dijkstra} and {Hoare} monads in monadic computation",
  journal =      j-THEOR-COMP-SCI,
  volume =       "604",
  number =       "??",
  pages =        "30--45",
  day =          "2",
  month =        nov,
  year =         "2015",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2015.03.020",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Thu Nov 5 12:08:52 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397515002364",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Mamouras:2016:HLD,
  author =       "Konstantinos Mamouras",
  title =        "The {Hoare} Logic of Deterministic and
                 Nondeterministic Monadic Recursion Schemes",
  journal =      j-TOCL,
  volume =       "17",
  number =       "2",
  pages =        "13:1--13:??",
  month =        mar,
  year =         "2016",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/2835491",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Mon Jun 20 09:19:30 MDT 2016",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tocl/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  abstract =     "The equational theory of deterministic monadic
                 recursion schemes is known to be decidable by the
                 result of S{\'e}nizergues on the decidability of the
                 problem of DPDA equivalence. In order to capture some
                 properties of the domain of computation, we augment
                 equations with certain hypotheses. This preserves the
                 decidability of the theory, which we call simple
                 implicational theory. The asymptotically fastest
                 algorithm known for deciding the equational theory, and
                 also for deciding the simple implicational theory, has
                 a running time that is nonelementary. We therefore
                 consider a restriction of the properties about schemes
                 to check: instead of arbitrary equations $ f \equiv g $
                 between schemes, we focus on propositional Hoare
                 assertions $ \{ p \} f \{ q \} $, where $f$ is a scheme
                 and $p$, $q$ are tests. Such Hoare assertions have a
                 straightforward encoding as equations. For this
                 subclass of program properties, we can also handle
                 nondeterminism at the syntactic and/or at the semantic
                 level, without increasing the complexity of the
                 theories. We investigate the Hoare theory of monadic
                 recursion schemes, that is, the set of valid
                 implications whose conclusions are Hoare assertions and
                 whose premises are of a certain simple form. We present
                 a sound and complete Hoare-style calculus for this
                 theory. We also show that the Hoare theory can be
                 decided in exponential time, and that it is complete
                 for this class.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
}

@Article{Sergey:2016:HSS,
  author =       "Ilya Sergey and Aleksandar Nanevski and Anindya
                 Banerjee and Germ{\'a}n Andr{\'e}s Delbianco",
  title =        "{Hoare}-style specifications as correctness conditions
                 for non-linearizable concurrent objects",
  journal =      j-SIGPLAN,
  volume =       "51",
  number =       "10",
  pages =        "92--110",
  month =        oct,
  year =         "2016",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/3022671.2983999",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sat Sep 16 10:18:13 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "Designing efficient concurrent objects often requires
                 abandoning the standard specification technique of
                 linearizability in favor of more relaxed correctness
                 conditions. However, the variety of alternatives makes
                 it difficult to choose which condition to employ, and
                 how to compose them when using objects specified by
                 different conditions. In this work, we propose a
                 uniform alternative in the form of Hoare logic, which
                 can explicitly capture--in the auxiliary state--the
                 interference of environment threads. We demonstrate the
                 expressiveness of our method by verifying a number of
                 concurrent objects and their clients, which have so far
                 been specified only by non-standard conditions of
                 concurrency-aware linearizability, quiescent, and
                 quantitative quiescent consistency. We report on the
                 implementation of the ideas in an existing Coq-based
                 tool, providing the first mechanized proofs for all the
                 examples in the paper.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "OOPSLA '16 conference proceedings.",
}

@Article{Sousa:2016:CHL,
  author =       "Marcelo Sousa and Isil Dillig",
  title =        "{Cartesian} {Hoare} logic for verifying $k$-safety
                 properties",
  journal =      j-SIGPLAN,
  volume =       "51",
  number =       "6",
  pages =        "57--69",
  month =        jun,
  year =         "2016",
  CODEN =        "SINODQ",
  DOI =          "https://doi.org/10.1145/2980983.2908092",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Mon Sep 5 07:32:25 MDT 2016",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan2010.bib",
  abstract =     "Unlike safety properties which require the absence of
                 a ``bad'' program trace, k-safety properties stipulate
                 the absence of a ``bad'' interaction between $k$
                 traces. Examples of $k$-safety properties include
                 transitivity, associativity, anti-symmetry, and
                 monotonicity. This paper presents a sound and
                 relatively complete calculus, called Cartesian Hoare
                 Logic (CHL), for verifying $k$-safety properties. We
                 also present an automated verification algorithm based
                 on CHL and implement it in a tool called DESCARTES. We
                 use DESCARTES to analyze user-defined relational
                 operators in Java and demonstrate that DESCARTES is
                 effective at verifying (or finding violations of)
                 multiple $k$-safety properties.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  remark =       "PLDI '16 conference proceedings.",
}

@Article{Xu:2016:CHL,
  author =       "Zhaowei Xu and Yuefei Sui and Wenhui Zhang",
  title =        "Completeness of {Hoare} logic with inputs over the
                 standard model",
  journal =      j-THEOR-COMP-SCI,
  volume =       "612",
  number =       "??",
  pages =        "23--28",
  day =          "25",
  month =        jan,
  year =         "2016",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2015.03.020",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Tue Dec 15 11:08:21 MST 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S0304397515007239",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

@Article{Chajed:2017:CFS,
  author =       "Tej Chajed and Haogang Chen and Adam Chlipala and M.
                 Frans Kaashoek and Nickolai Zeldovich and Daniel
                 Ziegler",
  title =        "Certifying a file system using {Crash Hoare} logic:
                 correctness in the presence of crashes",
  journal =      j-CACM,
  volume =       "60",
  number =       "4",
  pages =        "75--84",
  month =        apr,
  year =         "2017",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/3051092",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Mar 28 10:12:40 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/cacm2010.bib",
  URL =          "http://cacm.acm.org/magazines/2017/4/215044/fulltext",
  abstract =     "FSCQ is the first file system with a machine-checkable
                 proof that its implementation meets a specification,
                 even in the presence of fail-stop crashes. FSCQ
                 provably avoids bugs that have plagued previous file
                 systems, such as performing disk writes without
                 sufficient barriers or forgetting to zero out directory
                 blocks. If a crash happens at an inopportune time,
                 these bugs can lead to data loss. FSCQ's theorems prove
                 that, under any sequence of crashes followed by
                 reboots, FSCQ will recover its state correctly without
                 losing data. To state FSCQ's theorems, this paper
                 introduces the Crash Hoare logic (CHL), which extends
                 traditional Hoare logic with a crash condition, a
                 recovery procedure, and logical address spaces for
                 specifying disk states at different abstraction levels.
                 CHL also reduces the proof effort for developers
                 through proof automation. Using CHL, we developed,
                 specified, and proved the correctness of the FSCQ file
                 system. Although FSCQ's design is relatively simple,
                 experiments with FSCQ as a user-level file system show
                 that it is sufficient to run Unix applications with
                 usable performance. FSCQ's specifications and proofs
                 required significantly more work than the
                 implementation, but the work was manageable even for a
                 small team of a few researchers.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}

@Article{Kojima:2017:HLG,
  author =       "Kensuke Kojima and Atsushi Igarashi",
  title =        "A {Hoare} Logic for {GPU} Kernels",
  journal =      j-TOCL,
  volume =       "18",
  number =       "1",
  pages =        "3:1--3:??",
  month =        apr,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3001834",
  ISSN =         "1529-3785 (print), 1557-945X (electronic)",
  ISSN-L =       "1529-3785",
  bibdate =      "Thu Apr 13 17:53:54 MDT 2017",
  bibsource =    "http://www.acm.org/pubs/contents/journals/tocl/;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/multithreading.bib;
                 http://www.math.utah.edu/pub/tex/bib/pvm.bib;
                 http://www.math.utah.edu/pub/tex/bib/tocl.bib",
  abstract =     "We study a Hoare Logic to reason about parallel
                 programs executed on graphics processing units (GPUs),
                 called GPU kernels. During the execution of GPU
                 kernels, multiple threads execute in lockstep, that is,
                 execute the same instruction simultaneously. When the
                 control branches, the two branches are executed
                 sequentially, but during the execution of each branch
                 only those threads that take it are enabled; after the
                 control converges, all the threads are enabled and
                 again execute in lockstep. In this article, we first
                 consider a semantics in which all threads execute in
                 lockstep (this semantics simplifies the actual
                 execution model of GPUs) and adapt Hoare Logic to this
                 setting by augmenting the usual Hoare triples with an
                 additional component representing the set of enabled
                 threads. It is determined that the soundness and
                 relative completeness of the logic do not hold for all
                 programs; a difficulty arises from the fact that one
                 thread can invalidate the loop termination condition of
                 another thread through shared memory. We overcome this
                 difficulty by identifying an appropriate class of
                 programs for which the soundness and relative
                 completeness hold. Additionally, we discuss thread
                 interleaving, which is present in the actual execution
                 of GPUs but not in the lockstep semantics mentioned
                 above. We show that if a program is race free, then the
                 lockstep and interleaving semantics produce the same
                 result. This implies that our logic is sound and
                 relatively complete for race-free programs, even if the
                 thread interleaving is taken into account.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "ACM Transactions on Computational Logic",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J773",
}

@InProceedings{Aichernig:2019:TPA,
  author =       "Bernhard K. Aichernig",
  title =        "A Testing Perspective on Algebraic, Denotational, and
                 Operational Semantics",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "22--38",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_2",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{Apt:2019:FYH,
  author =       "Krzysztof R. Apt and Ernst-R{\"u}diger Olderog",
  title =        "Fifty years of {Hoare}'s logic",
  journal =      j-FORM-ASP-COMPUT,
  volume =       "31",
  number =       "6",
  pages =        "751--807",
  month =        dec,
  year =         "2019",
  CODEN =        "FACME5",
  DOI =          "https://doi.org/10.1007/s00165-019-00501-3",
  ISSN =         "0934-5043 (print), 1433-299X (electronic)",
  ISSN-L =       "0934-5043",
  bibdate =      "Sat Jul 25 06:45:29 MDT 2020",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
  URL =          "http://link.springer.com/article/10.1007/s00165-019-00501-3",
  acknowledgement = ack-nhfb,
  fjournal =     "Formal Aspects of Computing",
  journal-URL =  "http://link.springer.com/journal/165",
}

@Article{Bernot:2019:GMH,
  author =       "G. Bernot and J.-P. Comet and Z. Khalis and A. Richard
                 and O. Roux",
  title =        "A genetically modified {Hoare} logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "765",
  number =       "??",
  pages =        "145--157",
  day =          "18",
  month =        apr,
  year =         "2019",
  CODEN =        "TCSCDI",
  DOI =          "https://doi.org/10.1016/j.tcs.2018.02.003",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Jun 15 10:14:18 MDT 2019",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tcs2015.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/S030439751830080X",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
}

@InProceedings{Butterfield:2019:IOA,
  author =       "Andrew Butterfield",
  title =        "The Inner and Outer Algebras of Unified Concurrency",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "157--175",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_8",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Foster:2019:HRI,
  author =       "Simon Foster",
  title =        "Hybrid Relations in Isabelle/{UTP}",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "130--153",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_7",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Guttmann:2019:CFC,
  author =       "Walter Guttmann",
  title =        "Connecting Fixpoints of Computations with Strict
                 Progress",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "62--79",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_4",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hayes:2019:DAR,
  author =       "Ian J. Hayes and Larissa A. Meinicke",
  title =        "Developing an Algebra for Rely\slash Guarantee
                 Concurrency: Design Decisions and Challenges",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "176--197",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_9",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Hoare:2019:CST,
  author =       "Tony Hoare and Georg Struth and Jim Woodcock",
  title =        "A Calculus of Space, Time, and Causality: Its Algebra,
                 Geometry, Logic",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "3--21",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_1",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Naumann:2019:WSP,
  author =       "David A. Naumann and Minh Ngo",
  title =        "Whither Specifications as Programs",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "39--61",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_3",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Woodcock:2019:PSR,
  author =       "Jim Woodcock and Ana Cavalcanti and Simon Foster and
                 Alexandre Mota and Kangfeng Ye",
  title =        "Probabilistic Semantics for {RoboChart}",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "80--105",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_5",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Wu:2019:USC,
  author =       "Xi Wu and Huibiao Zhu and Wanling Xie",
  title =        "{UTP} Semantics of a Calculus for Mobile Ad Hoc
                 Networks",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "198--216",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_10",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Zhan:2019:UGC,
  author =       "Haolan Zhan and Qianqian Lin and Shuling Wang and
                 Jean-Pierre Talpin and Xiong Xu and Naijun Zhan",
  title =        "Unified Graphical Co-modelling of Cyber-Physical
                 Systems Using {AADL} and {Simulink\slash Stateflow}",
  crossref =     "Ribeiro:2019:UTP",
  pages =        "109--129",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7_6",
  bibdate =      "Sat Jul 30 15:47:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/matlab.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Apt:2021:ASI,
  author =       "Krzysztof R. Apt and Ernst-R{\"u}diger Olderog",
  title =        "Assessing the Success and Impact of {Hoare}'s Logic",
  crossref =     "Jones:2021:TPL",
  pages =        "41--76",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477359",
  bibdate =      "Sat Jul 30 08:16:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Brookes:2021:CPP,
  author =       "Stephen D. Brookes and A. W. Roscoe",
  title =        "{CSP}: a Practical Process Algebra",
  crossref =     "Jones:2021:TPL",
  pages =        "187--222",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477365",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Article{deBoer:2021:CCR,
  author =       "Frank S. de Boer and Hans-Dieter A. Hiep",
  title =        "Completeness and Complexity of Reasoning about
                 Call-by-Value in {Hoare} Logic",
  journal =      j-TOPLAS,
  volume =       "43",
  number =       "4",
  pages =        "17:1--17:35",
  month =        dec,
  year =         "2021",
  CODEN =        "ATPSDT",
  DOI =          "https://doi.org/10.1145/3477143",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Dec 17 15:53:27 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3477143",
  abstract =     "We provide a sound and relatively complete Hoare logic
                 for reasoning about partial correctness of recursive
                 procedures in presence of local variables and the
                 call-by-value parameter mechanism and in which the
                 correctness proofs support contracts and are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "https://dl.acm.org/loi/toplas",
}

@Article{Feng:2021:QHL,
  author =       "Yuan Feng and Mingsheng Ying",
  title =        "Quantum {Hoare} Logic with Classical Variables",
  journal =      j-TQC,
  volume =       "2",
  number =       "4",
  pages =        "16:1--16:43",
  month =        dec,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3456877",
  ISSN =         "2643-6809 (print), 2643-6817 (electronic)",
  ISSN-L =       "2643-6809",
  bibdate =      "Fri Dec 24 06:40:33 MST 2021",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3456877",
  abstract =     "Hoare logic provides a syntax-oriented method to
                 reason about program correctness and has been proven
                 effective in the verification of classical and
                 probabilistic programs. Existing proposals for quantum
                 Hoare logic either lack completeness or support
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "ACM Transactions on Quantum Computing (TQC)",
  journal-URL =  "https://dl.acm.org/loi/tqc",
}

@InCollection{Gray:2021:OR,
  author =       "Margaret Gray",
  title =        "Online Resources",
  crossref =     "Jones:2021:TPL",
  pages =        "411--412",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477376",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Hayes:2021:SS,
  author =       "Ian J. Hayes and Steve King",
  title =        "Software Specification",
  crossref =     "Jones:2021:TPL",
  pages =        "251--270",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477367",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:ABI,
  author =       "Cliff B. Jones and Jayadev Misra",
  title =        "Authors' Biographies\slash Index",
  crossref =     "Jones:2021:TPL",
  pages =        "413--420",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477377",
  bibdate =      "Sat Jul 30 08:16:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:AI,
  author =       "Cliff B. Jones and Jayadev Misra",
  title =        "{ACM} Interview",
  crossref =     "Jones:2021:TPL",
  pages =        "359--386",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477372",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:DS,
  author =       "Cliff B. Jones and Jayadev Misra",
  title =        "Doctoral Students",
  crossref =     "Jones:2021:TPL",
  pages =        "393--394",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477374",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:FEA,
  author =       "Cliff Jones and Jayadev Misra",
  title =        "Finding Effective Abstractions",
  crossref =     "Jones:2021:TPL",
  pages =        "23--40",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477358",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:LTH,
  author =       "Cliff Jones",
  title =        "List of {Tony Hoare}'s Publications",
  crossref =     "Jones:2021:TPL",
  pages =        "395--410",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477375",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Jones:2021:P,
  author =       "Cliff Jones and Jayadev Misra",
  title =        "Preface",
  crossref =     "Jones:2021:TPL",
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477356",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{May:2021:COI,
  author =       "David May",
  title =        "{CSP}, occam, and {Inmos}",
  crossref =     "Jones:2021:TPL",
  pages =        "271--284",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477368",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Misra:2021:C,
  author =       "Jayadev Misra",
  title =        "{CV}",
  crossref =     "Jones:2021:TPL",
  pages =        "387--392",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477373",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Mller:2021:FFY,
  author =       "Peter M{\"u}ller and Natarajan Shankar",
  title =        "The First Fifteen Years of the {Verified Software
                 Project}",
  crossref =     "Jones:2021:TPL",
  pages =        "93--124",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477362",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Struth:2021:THA,
  author =       "Georg Struth",
  title =        "Trimming the Hedges: an Algebra to Tame Concurrency",
  crossref =     "Jones:2021:TPL",
  pages =        "317--346",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477370",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Sufrin:2021:TBO,
  author =       "Bernard Sufrin",
  title =        "Teaching at {Belfast} and {Oxford}",
  crossref =     "Jones:2021:TPL",
  pages =        "223--250",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477366",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Woodcock:2021:HHU,
  author =       "Jim Woodcock",
  title =        "{Hoare} and {He}'s Unifying Theories of Programming",
  crossref =     "Jones:2021:TPL",
  pages =        "285--316",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477369",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@InCollection{Woodcock:2021:VGC,
  author =       "Jim Woodcock and Janet Barnes and Rod Chapman and
                 Simon Foster and Thomas Santen",
  title =        "Verification in the {Grand Challenge}",
  crossref =     "Jones:2021:TPL",
  pages =        "125--156",
  month =        oct,
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355.3477363",
  bibdate =      "Mon Aug 1 11:02:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
}

@Misc{Anonymous:20xx:THE,
  author =       "Anonymous",
  title =        "{Tony Hoare}: Emeritus Researcher",
  howpublished = "Microsoft Web site.",
  year =         "20xx",
  bibdate =      "Wed Aug 10 16:30:47 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://www.microsoft.com/en-us/research/people/thoare/",
  acknowledgement = ack-nhfb,
}

@Unpublished{Dijkstra:20xx:ERC,
  author =       "Edsger W. Dijkstra",
  title =        "An Experiment with the ``record class'' as suggested
                 by {C. A. R. Hoare}",
  year =         "20xx",
  bibdate =      "Mon Mar 16 08:14:00 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Circulated privately.",
  URL =          "http://www.cs.utexas.edu/users/EWD/ewd01xx/EWD132.PDF",
  acknowledgement = ack-nhfb,
  filesize =     "304 KB",
  oldlabel =     "EWD:EWD132",
}

%%% ====================================================================
%%% Conference proceedings and cross-referenced works must come last:

@Book{Bazilevskii:1963:TMM,
  editor =       "Jurij Jakovlevi{\v{c}} Bazilevskii",
  booktitle =    "Theory of Mathematical Machines",
  title =        "Theory of Mathematical Machines",
  publisher =    pub-PERGAMON,
  address =      pub-PERGAMON:adr,
  pages =        "xii + 264",
  year =         "1963",
  bibdate =      "Tue Aug 09 08:10:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Translation from Russian by C. A. R. Hoare.
                 Translation edited by J. M. Jackson.",
  acknowledgement = ack-nhfb,
  remark =       "Entry \cite{Jones:2021:LTH} says Basilevskii and 1961,
                 but multiple library catalogs say Bazilevskii 1963.
                 Transliterated title of Russian original: Voprosy
                 teorii matemati{\v{c}}eskich ma{\v{s}}in. No ISBN
                 retroactively assigned, and no tableofcontents data
                 found.",
  xxyear =       "1961",
}

@Book{Hoare:1971:CSI,
  author =       "C. A. R. Hoare",
  booktitle =    "Computer science: an inaugural lecture delivered
                 before the {Queen's University of Belfast} on {10
                 February 1971}",
  title =        "Computer science: an inaugural lecture delivered
                 before the {Queen's University of Belfast} on {10
                 February 1971}",
  volume =       "62",
  publisher =    "The Queen's University",
  address =      "Belfast, Northern Ireland",
  pages =        "17",
  year =         "1971",
  ISBN =         "0-85389-051-X",
  ISBN-13 =      "978-0-85389-051-5",
  LCCN =         "AS122.B4 A3 no. 62 QA76",
  bibdate =      "Sat Jul 30 10:02:35 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Inaugural lecture, 10.2.1971.",
  series =       "New Lecture",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data available.",
}

@Book{Dahl:1972:SP,
  editor =       "Ole-Johan Dahl and Edsger W. Dijkstra and C. A. R.
                 (Charles Antony Richard) Hoare",
  booktitle =    "Structured Programming",
  title =        "Structured Programming",
  volume =       "8",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  edition =      "Third",
  pages =        "viii + 220",
  year =         "1972",
  DOI =          "https://doi.org/10.5555/1243380",
  ISBN =         "0-12-200550-3 (hardcover), 0-12-200556-2 (paperback)",
  ISBN-13 =      "978-0-12-200550-3 (hardcover), 978-0-12-200556-5
                 (paperback)",
  LCCN =         "QA76.6 .D33 1972",
  MRclass =      "68A05",
  MRnumber =     "0433938",
  MRreviewer =   "C. A. Ellis",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/bevan.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/math.prog.construction.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/semantics.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Database/Wiederhold/Pre.1975.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/Matrix.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Math/sparse.linear.systems.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/leavens.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/rwebber.bib;
                 http://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/TUBScsd/1972.bib",
  note =         "Second printing",
  series =       "A.P.I.C. Studies in Data Processing",
  URL =          "https://dl.acm.org/doi/pdf/10.5555/1243380",
  acknowledgement = ack-nhfb,
  annote =       "See Knuth's comments in STAN-CS-73-371.",
  descriptor =   "Datenstruktur, Hierarchische Programmstruktur,
                 Programmstruktur, Strukturierte Programmierung,
                 Strukturiertes Programmieren",
  library =      "Uni of Newcastle, Auchmuty Library - 005 DAHL",
  tableofcontents = "I. E. W. Dijkstra / Notes on structured programming
                 / 1--82 \\
                 II. C. A. R. Hoare / Notes on data structuring /
                 83--174 \\
                 III. O.-J. Dahl and C. A. R. Hoare: Hierarchical
                 program structures / 175--220",
}

@Proceedings{Hoare:1972:OST,
  editor =       "C. A. R. Hoare and Ronald H. Perrott",
  booktitle =    "{Operating Systems Techniques, Proceedings of a
                 Seminar at Queen's University, Belfast, Northern
                 Ireland, August--September 1971}",
  title =        "{Operating Systems Techniques, Proceedings of a
                 Seminar at Queen's University, Belfast, Northern
                 Ireland, August--September 1971}",
  volume =       "9",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xii + 390",
  year =         "1972",
  ISBN =         "0-12-350650-6",
  ISBN-13 =      "978-0-12-350650-4",
  LCCN =         "QA76.6 .I57 1971; TA168",
  bibdate =      "Tue Mar 17 10:58:34 MDT 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "A.P.I.C. studies in data processing",
  URL =          "http://brinch-hansen.net/papers/1971a.pdf",
  abstract =     "The seminar formed a part of a continuing research
                 project, the purpose of which is to investigate,
                 classify and evaluate the practical techniques which
                 have been used in the implementation of successful
                 operating systems. It is hoped to relate each technique
                 to its objective, and to the range of circumstances in
                 which it is applicable; and thus produce a reliable
                 guide upon which an operating system designer can base
                 their decisions.",
  acknowledgement = ack-nhfb,
  meetingname =  "International Seminar on Operating Systems Techniques
                 (1971: Queen's University of Belfast)",
  remark =       "Held 30 August--3 September, 1971; sponsored by
                 International Computers Limited and the Advanced
                 Computer Technology Project.",
  subject =      "Operating systems (Computers); Congresses",
  tableofcontents = "Operating system requirements \\
                 Some user reactions to operating systems: a selective
                 survey / G. F. Coulouris and J. K. Broadbent \\
                 Operating systems: their purpose, objectives, functions
                 and scope / C. A. R. Hoare \\
                 Operating system principles \\
                 An outline of a course on operating system principles /
                 P. Brinch Hansen \\
                 On the meaning of names in programming systems / A. G.
                 Fraser \\
                 Operating system structure \\
                 Towards a theory of parallel programming / C. A. R.
                 Hoare \\
                 Hierarchical ordering of sequential processes / E. W.
                 Dijkstra \\
                 Some basic principles in structuring operating systems
                 / G. Goos \\
                 Monitors (special discussion) \\
                 Store management techniques \\
                 A survey of store management techniques: parts one and
                 two / C. A. R. Hoare and R. M. McKeag \\
                 Thrashing in a multiprogrammed paging system / A.
                 Alderson, W. C. Lynch and B. Randell \\
                 Allocation of virtual store in the T.H.E.
                 multiprogramming system / C. Bron \\
                 Job scheduling techniques (discussion) \\
                 Process dispatching techniques (discussion) \\
                 Resource allocation techniques (discussion) \\
                 Input/output control techniques (discussion) \\
                 Filing systems techniques \\
                 File integrity in a disc-based multi-access system / A.
                 G. Fraser \\
                 Miscellaneous topics (discussion) \\
                 The user's problem (discussion) \\
                 Titan operating system \\
                 Techniques in the Titan supervisor / D. F. Hartley \\
                 Tuning the Titan operating system / R. M. Needham \\
                 CDC operating systems \\
                 Batch processing with 6000-series scope / H. Lipps \\
                 Burroughs operating systems \\
                 Burroughs B5500 MCP and time-sharing MCP / D. J. Roche
                 \\
                 B6700 ``working set'' memory allocation / D. P. Fenton
                 \\
                 Miscellaneous operating systems 1 \\
                 Experience with the Eldon operating system for KDF9 /
                 A. L. Hillman and B. A. Wichmann \\
                 An operating system designed for the computer utility
                 environment / W. C. Lynch \\
                 The structure of a time-sharing system / J. R. Thomas
                 \\
                 Miscellaneous operating systems 2 \\
                 A re-appraisal of certain design features of the Atlas
                 1 supervisory system / D. J. Howarth \\
                 On unifying a batch system with a multi-access system /
                 H. P. Goodman",
}

@Proceedings{Ershov:1974:IST,
  editor =       "Andrei Ershov and Valery Aleksandrovich Nepomniaschy",
  booktitle =    "{International Symposium on Theoretical Programming
                 [held in Novosibirsk, Aug. 7--11, 1972]}",
  title =        "{International Symposium on Theoretical Programming
                 [held in Novosibirsk, Aug. 7--11, 1972]}",
  volume =       "5",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 407",
  year =         "1974",
  DOI =          "https://doi.org/10.1007/3-540-06720-5",
  ISBN =         "0-387-06720-5 (New York paperback), 3-540-06720-5
                 (Berlin paperback)",
  ISBN-13 =      "978-0-387-06720-9 (New York paperback),
                 978-3-540-06720-7 (Berlin paperback)",
  LCCN =         "QA76 .I5798 1972",
  MRclass =      "68A05",
  MRnumber =     "0421129",
  MRreviewer =   "David Gries",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  tableofcontents = "An axiomatic definition of the programming language
                 PASCAL \\
                 The logic of ``can do'' \\
                 Copying in commutation \\
                 Operator schemata \\
                 On synthesizing programs given by examples \\
                 Central technical issues in programming language design
                 \\
                 Sur quelques syst{\'y}emes de programmation pour les
                 recherches scientifiques \\
                 Decision problems in computational models \\
                 Non-determined algorithm schemata or R-schemata \\
                 Equivalence and optimization of programs \\
                 On the average speed of automaton with terminal state
                 \\
                 Logical-termal equivalence of program schemata \\
                 On universal classes of program schemas \\
                 Certain decompositions of G{\'y}odel numbering and the
                 semantics of programming languages \\
                 Criteria for the algorithmic completeness of the
                 systems of operations \\
                 Data flow schemas \\
                 Operation patterns \\
                 Looking for an approach to a theory of models for
                 parallel computation \\
                 Configurable computers: A new class of general purpose
                 machines \\
                 A method for determining program data relationships \\
                 Towards automatical construction of parallel programs
                 \\
                 A calculus for the mathematical theory of computation
                 \\
                 Admissibility of fixed-point induction in first-order
                 logic of typed theories \\
                 A formal approximation theory of semantic data types
                 \\
                 Some features of a language for a proof-checking
                 programming system",
  xxbooktitle =  "{International Symposium on Theoretical Programming
                 (Novosibirsk, 1972)}",
}

@Book{Dahl:1975:CSP,
  editor =       "Ole-Johan Dahl and Edsger Dijkstra and C. A. R.
                 Hoare",
  booktitle =    "{{\cyr Strukturnoe programmirovanie}}",
  title =        "{{\cyr Strukturnoe programmirovanie}}",
  publisher =    "Izdat. ``Mir''",
  address =      "Moscow, USSR",
  pages =        "247",
  year =         "1975",
  ISBN =         "2-01-507541-0",
  ISBN-13 =      "978-2-01-507541-9",
  MRclass =      "68A05",
  MRnumber =     "0433939",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Translated from the English by S. D.
                 Zelenecki{\u{\i}}, V. V. Martynjuk and L. V. Uhov,
                 Edited by {\`E}. Z. Ljubimski{\u{\i}} and V. V.
                 Martynjuk.",
  series =       "\cyr Matematicheskoe Obespechenie \`EVM. [Monographs
                 in Mathematical Computer Software]",
  acknowledgement = ack-nhfb,
  language =     "Russian",
  xxeditor =     "U. Dal and E. De{\u{\i}}kstra and K. Khoor.",
}

@Proceedings{ACM:1976:SPE,
  editor =       "ACM",
  booktitle =    "{STOC '76: Proceedings of the eighth annual ACM
                 symposium on Theory of computing}",
  title =        "{STOC '76: Proceedings of the eighth annual ACM
                 symposium on Theory of computing}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "iv + 246",
  year =         "1976",
  DOI =          "https://doi.org/10.1145/800113",
  ISBN =         "1-4503-7414-X",
  ISBN-13 =      "978-1-4503-7414-9",
  LCCN =         "QA 76.6 A12 1976",
  bibdate =      "Thu Dec 3 07:11:18 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/stoc1970.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=800113",
  acknowledgement = ack-nhfb,
  keywords =     "computational complexity --- congresses; electronic
                 digital computers --- programming --- congresses",
  tableofcontents = "Some Complexity Results for the Traveling Salesman
                 Problem / Christos H. Papadimitriou and Kenneth
                 Steiglitz / 1 \\
                 Some NP-Complete Geometric Problems / M. R. Garey, R.
                 L. Graham, and D. S. Johnson / 10 \\
                 NP-Complete Decision Problems for Quadratic Polynomials
                 / Kenneth Manders and Leonard Adleman / 23 \\
                 On Isomorphisms and Density of NP and Other Complete
                 Sets / J. Hartmanis and L. Berman / 30 \\
                 Complexity of Decision Problems Based on Finite
                 Two-Person Perfect-Information Games / Thomas J.
                 Schaefer / 41 \\
                 Exponential Space Complete Problems for Petri Nets and
                 Commutative Subgroups / E. Cardoza, R. Lipton and A. R.
                 Meyer / 50 \\
                 Parallel Algorithms for the Transitive Closure and the
                 Connected Component Problems / D. S. Hirshberg / 55 \\
                 Sorting on a Mesh-Connected Parallel Computer / C. D.
                 Thompson and H. T. Kung / 58 \\
                 On Abstractions of Parallel Programs / Thomas W.
                 Doeppner, Jr / 65 \\
                 A Consistent and Complete Deductive System for the
                 Verification of Parallel Programs / Susan Owicki / 73
                 \\
                 A New Incompleteness Result for Hoare's System /
                 Mitchell Wand / 87 \\
                 An Algebraic System for Process Structuring and
                 Interprocess Communication / Takayuki Kimura / 92 \\
                 On Structuring Flowcharts / S. Rao Kosaraju / 101 \\
                 On Line Context Free Language Recognition in Less than
                 Cubic Time / Susan L. Graham, Michael A. Harrison, and
                 Walter L. Ruzzo / 112 \\
                 Finding the Depth of a Flow Graph / Amelia C. Fong and
                 Jeffrey D. Ullman / 121 \\
                 Dichotomization, Reachability, and the Forbidden
                 Subgraph Problem / H. B. Hunt III and T. G. Szymanski /
                 126 \\
                 A Useful Device for Showing the Solvability of Some
                 Decision Problems / Oscar H. Ibarra and Chul E. Kim /
                 135 \\
                 On Deterministic Context-Free Languages, Multihead
                 Automata, and the Power of an Auxiliary Pushdown Store
                 / I. H. Sudborough / 141 \\
                 Space Bounds for a Game on Graphs / Wolfgang J. Paul,
                 Robert E. Tarjan and James R. Celoni / 149 \\
                 Real-Time Algorithms for String-Matching and Palindrome
                 Recognition / Zvi Galil / 161 \\
                 Evaluation of Polynomials with Super-Preconditioning /
                 Richard J. Lipton and Larry J. Stockmeyer / 174 \\
                 Linear Unification / M. S. Paterson and M. N. Wegman /
                 181 \\
                 The Analysis of Double Hashing / Leo J. Guibas and
                 Endre Szemeredi / 187 \\
                 On the Average Behavior of Set Merging Algorithms /
                 Andrew C. Yao / 192 \\
                 Universal Circuits / Leslie G. Valiant / 196 \\
                 The Realization of Monotone Boolean Functions /
                 Nicholas Pippenger / 204 \\
                 Associative Retrieval Trie Hash-Coding / Walter A.
                 Burkhard / 211 \\
                 Divide-and-Conquer in Multidimensional Space / Jon L.
                 Bentley and Michael I. Shamos / 220 \\
                 Location of a Point in a Planar Subdivision and its
                 Applications / D. T. Lee and F. P. Preparata / 231 \\
                 Simple G{\"o}del Numberings, Translations, and the
                 P-Hierarchy: Preliminary Report / Michael Machtey and
                 Paul Young / 236 \\
                 Index / 244",
  xxbooktitle =  "Conference record of the eighth annual {ACM} Symposium
                 on Theory of Computing: papers presented at the
                 Symposium, Hershey, Pennsylvania, May 3--5, 1976",
  xxISBN =       "none",
  xxtitle =      "Conference record of the eighth annual {ACM} Symposium
                 on Theory of Computing: papers presented at the
                 Symposium, Hershey, Pennsylvania, May 3--5, 1976",
}

@Proceedings{Anonymous:1976:SSE,
  editor =       "Anonymous",
  booktitle =    "{Software systems engineering: (papers presented at
                 the European computing conference, part of EUROCOMP ;
                 London, September 1976)}",
  title =        "{Software systems engineering: (papers presented at
                 the European computing conference, part of EUROCOMP ;
                 London, September 1976)}",
  publisher =    "Online Conferences Ktd,",
  address =      "Uxbridge, UK",
  pages =        "544",
  year =         "1976",
  ISBN =         "0-903796-15-5",
  ISBN-13 =      "978-0-903796-15-6",
  LCCN =         "QA76.6 .E97 1976; TK5104 S98 1976",
  bibdate =      "Wed Aug 10 15:22:33 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  abstract =     "Papers presented at the European Computing Conference
                 on Software Systems Engineering, London, 1976, held as
                 part of EUROCOMP, with additional papers.",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data found in numerous library
                 catalogs.",
}

@Book{Bates:1976:SPI,
  editor =       "David Bates",
  booktitle =    "Structured Programming: {Infotech} State of the Art
                 Report",
  title =        "Structured Programming: {Infotech} State of the Art
                 Report",
  publisher =    "Infotech International Limited",
  address =      "Maidenhead, Berkshire, UK",
  pages =        "viii + 495",
  year =         "1976",
  ISBN =         "0-85539-270-3",
  ISBN-13 =      "978-0-85539-270-3",
  LCCN =         "QA76.6 .S85",
  bibdate =      "Wed Aug 10 15:39:23 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data found in numerous library
                 catalogs.",
}

@Proceedings{Bauer:1976:LHI,
  editor =       "Friedrich Ludwig Bauer and Klaus Samelson",
  booktitle =    "{Language hierarchies and interfaces: international
                 summer school [held July 23 to August 2, 1975 in
                 Marktoberdorf]}",
  title =        "{Language hierarchies and interfaces: international
                 summer school [held July 23 to August 2, 1975 in
                 Marktoberdorf]}",
  volume =       "46",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 428",
  year =         "1976",
  DOI =          "https://doi.org/10.1007/3-540-07994-7",
  ISBN =         "0-387-07994-7 (New York), 3-540-07994-7 (Berlin),
                 3-540-37972-X (e-book)",
  ISBN-13 =      "978-0-387-07994-3 (New York), 978-3-540-07994-1
                 (Berlin), 978-3-540-37972-0 (e-book)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.6 .L335",
  bibdate =      "Fri Aug 21 09:24:18 MDT 2020",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t0046.htm;
                 http://www.springerlink.com/content/978-0-387-07994-3;
                 http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-07994-1;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=46",
  ZMID =         "03518718",
  ZMnumber =     "0332.00007",
  abstract =     "Papers prepared by experts for an International Summer
                 School, held in July 1976. Focuses on program
                 development, concurrency, operating systems structures,
                 and programming systems structures.",
  acknowledgement = ack-nhfb,
  editor-dates = "Friedrich (``Fritz'') Ludwig Bauer (10 June 1924--26
                 March 2015)",
  remark =       "The International Summer School took place from July
                 23 to August 2,1975, in Marktoberdorf. This Summer
                 School was organised under the auspices of the
                 Technical University Munich, and was sponsored by the
                 NATO Scientific Affairs Division under the 1975
                 Advanced Study Institutes programme.",
  subject =      "Computer programming; Congresses; Programming
                 languages (Electronic computers); Computer
                 programming.; Programming languages (Electronic
                 computers)",
  tableofcontents = "Introduction \\
                 On the teaching of programming, i.e., on the teaching
                 of thinking / E. W. Dijkstra / 1--10 \\
                 Chapter 1: Concurrency \\
                 Parallel programming: An axiomatic approach / C. A. R.
                 Hoare / 11--42 \\
                 On-the-fly garbage collection: an exercise in
                 cooperation / E. W. Dijkstra / 43--56 \\
                 An exercise in proving parallel programs correct / D.
                 Gries / 57--81 \\
                 The programming language Concurrent Pascal / P. Brinch
                 Hansen / 82--110 \\
                 Chapter 2: Program Development \\
                 Guarded commands, non-determinacy and a calculus for
                 the derivation of programs / E. W. Dijkstra / 111--124
                 \\
                 Program production by successive transformation / M.
                 Griffiths / 125--152 \\
                 Programming as an evolutionary process / F. L. Bauer /
                 153--182 \\
                 Proof of correctness of data representations / C. A. R.
                 Hoare / 183--193 \\
                 Appendix: A philosophy of programming / F. L. Bauer /
                 194--241 \\
                 Chapter 3: Operating System Structure \\
                 The structure of an operating system / C. A. R. Hoare /
                 242--265 \\
                 Language aspects in operating systems / G.
                 Seegm{\"u}ller / 266--292 \\
                 Structured programming in the basic layers of an
                 operating system / W. A. Wulf / 293--344 \\
                 A time-wise hierarchy imposed upon the use of a
                 two-level store / E. W. Dijkstra / 345--357 \\
                 Chapter 4: Programming Systems Structure \\
                 Problems in many-language systems / A. P. Ershov /
                 358--428",
}

@Book{Dijkstra:1976:DP,
  author =       "Edsger W. Dijkstra",
  booktitle =    "A discipline of programming",
  title =        "A discipline of programming",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xvii + 217",
  year =         "1976",
  ISBN =         "0-13-215871-X",
  ISBN-13 =      "978-0-13-215871-8",
  LCCN =         "QA76.6 .D54",
  MRclass =      "68A05",
  MRnumber =     "0660283 (58 \#31999)",
  MRreviewer =   "H. Kilov",
  bibdate =      "Thu Mar 12 07:01:09 2015",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hamming-richard-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "With a foreword by C. A. R. Hoare.",
  series =       "Prentice-Hall Series in Automatic Computation",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / ix \\
                 Preface / xiii \\
                 0. Executional Abstraction / 1 \\
                 1. The Role of Programming Languages / 7 \\
                 2. States and Their Characterization / 10 \\
                 3. The Characterization of Semantics / 15 \\
                 4. The Semantic Characterization of a Programming
                 Language / 24 \\
                 5. Two Theorems / 37 \\
                 6. On the Design of Properly Terminating Constructs /
                 41 \\
                 7. Euclid's Algorithm Revisited / 45 \\
                 8. The Formal Treatment of Some Small Examples / 51 \\
                 9. On Nondeterminacy Being Bounded / 72 \\
                 10. An Essay On the Notion: the Scope of Variables / 79
                 \\
                 11. Array Variables / 94 \\
                 12. The Linear Search Theorem / 105 \\
                 13. The Problem of the Next Permutation / 107 \\
                 14. The Problem of the Dutch National Flag / 111 \\
                 15. Updating a Sequential File / 117 \\
                 16. Merging Problems Revisited / 123 \\
                 17. An Exercise Attributed to R. W. Hamming / 129 \\
                 18. The Pattern Matching Problem / 135 \\
                 19. Writing a Number as the Sum of Two Squares / 140
                 \\
                 20. The Problem of the Smallest Prime Factor of a Large
                 Number / 143 \\
                 21. The Problem of the Most Isolated Villages / 149 \\
                 22. The Problem of the Shortest Subspanning Tree / 154
                 \\
                 23. Rem's Algorithm For the Recording of Equivalence
                 Classes / 161 \\
                 24. The Problem of the Convex Hull in Three Dimensions
                 / 168 \\
                 25. Finding the Maximal Strong Components in a Directed
                 Graph / 192 \\
                 26. On Manuals and Implementations / 201 \\
                 27. In Retrospect / 209",
}

@Proceedings{IEEE:1976:ASF,
  editor =       "{IEEE}",
  booktitle =    "17th annual Symposium on Foundations of Computer
                 Science, October 25--27, 1976, Houston, Texas",
  title =        "17th annual Symposium on Foundations of Computer
                 Science, October 25--27, 1976, Houston, Texas",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "v + 276",
  year =         "1976",
  CODEN =        "ASFPDV",
  ISBN =         "????",
  ISBN-13 =      "????",
  ISSN =         "0272-5428",
  LCCN =         "QA75.5 .S97 1976",
  bibdate =      "Thu Dec 3 07:11:18 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/focs.bib",
  note =         "IEEE catalog number CH1133-8 C.",
  URL =          "https://ieeexplore.ieee.org/xpl/conhome/4567877/proceeding?isnumber=4567878",
  acknowledgement = ack-nhfb,
  keywords =     "electronic data processing --- congresses; electronic
                 digital computers --- programming --- congresses;
                 machine theory --- congresses",
  remark =       "No ISBN recorded in library catalogs or in IEEE Xplore
                 database.",
  tableofcontents = "The Mutual Exclusion Problem for Unreliable
                 Processes / Ronald R. Rivest and Vaughan R. Pratt / 1
                 \\
                 Characterization of the Synchronization Languages for
                 PV Systems / Peter B. Henderson and Yechezkel Zalcstein
                 / 9 \\
                 Concurrency Control for Database Systems / R. E.
                 Stearns, P. M. Lewis II, and D. J. Rosenkrantz / 19 \\
                 A Linear Time Algorithm for Deciding Security / A. K.
                 Jones, R. J. Lipton, and L. Snyder / 33 \\
                 Graph Grammars and Global Program Data Flow Analysis /
                 R. Farrow, K. Kennedy, and L. Zucconi / 42 \\
                 Assignment Commands and Array Structures / Peter J.
                 Downey and Ravi Sethi / 57 \\
                 $K + 1$ Heads are Better than $K$ / Andrew C. Yao and
                 Ronald L. Rivest / 67 \\
                 A Second Step Toward the Polynomial Hierarchy /
                 Theodore P. Baker and Alan L. Selman / 71 \\
                 On the Structure of Complete Sets: Almost Everywhere
                 Complexity and Infinitely Often Speedup / Leonard
                 Berman / 76 \\
                 Diophantine Complexity / Leonard Adleman and Kenneth
                 Manders / 81 \\
                 On Parallelism in Turing Machines / Dexter Kozen / 89
                 \\
                 Alternation / Ashok K. Chandra and Larry J. Stockmeyer
                 / 98 \\
                 Semantical Considerations on Floyd-Hoare Logic /
                 Vaughan R. Pratt / 109 \\
                 Categories for Fixpoint-Semantics / Daniel Lehmann /
                 122 \\
                 An Algebraic Formulation of Knuthian Semantics /
                 Laurian M. Chirica and David F. Martin / 127 \\
                 Algebraic Families of Interpretations / Bruno Courcelle
                 and Maurice Nivat / 137 \\
                 Rational Algebraic Theories and Fixed-Point Solutions /
                 J. B. Wright, J. A. Goguen, J. W. Thatcher, and E. G.
                 Wagner / 147 \\
                 Simple Languages and Free Schemes / Emily P. Friedman /
                 159 \\
                 Self-Organizing Binary Search Trees / Brian Allen and
                 Ian Munro / 166 \\
                 The Complexity of Searching an Ordered Random Table /
                 Andrew C. Yao and F. Frances Yao / 173 \\
                 Using Comparison Trees to Derive Lower Bounds for
                 Selection Problems / Frank Fussenegger and Harold N.
                 Gabow / 178 \\
                 The Analysis of Hashing Algorithms that Exhibit k-Ary
                 Clustering / Leo J. Guibas / 183 \\
                 Complexity of Trie Index Construction / Douglas Comer
                 and Ravi Sethi / 197 \\
                 Geometric Intersection Problems / Michael Ian Shamos
                 and Dan Hoey / 208 \\
                 Approximation Algorithms for Some Routing Problems /
                 Greg N. Frederickson, Matthew S. Hecht, and Chul E. Kim
                 / 216 \\
                 Variations of a New Machine Model / Jan van Leeuwen /
                 228 \\
                 Recognizing Certain Repetitions and Reversals Within
                 Strings / Zvi Galil and Joel Seiferas : / 236 \\
                 Parenthesis Generators / L. Boasson and M. Nivat / 253
                 \\
                 On the Evaluation of Powers and Related Problems /
                 Nicholas John Pippenger / 258 \\
                 Some Polynomial and Integer Divisibility Problems are
                 NP-Hard / David A. Plaisted / 264 \\
                 Lower Bounds from Complex Function Theory / Michael Ian
                 Shamos and Gideon Yuval / 268 \\
                 Index / 274",
}

@Book{Dijkstra:1982:SWC,
  author =       "Edsger Wybe Dijkstra",
  booktitle =    "Selected Writings on Computing: a Personal
                 Perspective",
  title =        "Selected Writings on Computing: a Personal
                 Perspective",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 362",
  year =         "1982",
  DOI =          "https://doi.org/10.1007/978-1-4612-5695-3",
  ISBN =         "0-387-90652-5 (New York), 3-540-90652-5 (Berlin)",
  ISBN-13 =      "978-0-387-90652-2 (New York), 978-3-540-90652-0
                 (Berlin)",
  LCCN =         "QA76.24 .D54 1982",
  MRclass =      "68-00 (00A25 01A75 68N05)",
  MRnumber =     "677672 (85d:68001)",
  MRreviewer =   "Kh. I. Kilov",
  bibdate =      "Tue Dec 14 22:47:28 1993",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib",
  note =         "Including a paper co-authored by C. S. Sch{\"o}lten.",
  series =       "Texts and Monographs in Computer Science",
  acknowledgement = ack-nhfb,
  tableofcontents = "EWD227 Stepwise Program Construction / Edsger W.
                 Dijkstra / 1--14 \\
                 EWD338 Parallelism in Multi-Record Transactions / E. W.
                 Dijkstra and C. S. Sch{\"o}lten / 15--21 \\
                 EWD376 Finding the Maximum Strong Components in a
                 Directed Graph / Edsger W. Dijkstra / 22--30 \\
                 EWD385 Trip Report E. W. Dijkstra, Summer School
                 Munich, July 25 to August 4, 1973 / Dr. Edsger W.
                 Dijkstra / 31--33 \\
                 EWD386 The Solution to a Cyclic Relaxation Problem /
                 Dr. Edsger W. Dijkstra / 34--35 \\
                 EWD387 Trip Report IBM Seminar ``Communication and
                 Computers'', Newcastle, Sept. 1973 / Dr. Edsger W.
                 Dijkstra / 36--40 \\
                 EWD391 Self-Stabilization in Spite of Distributed
                 Control / Edsger W. Dijkstra / 41--46 \\
                 EWD407 Acceptance Speech for the AFIPS Harry Goode
                 Memorial Award 1974 / Prof. Dr. Edsger W. Dijkstra /
                 47--49 \\
                 EWD427 Speech at the Occasion of an Anniversary /
                 Edsger W. Dijkstra / 50--53 \\
                 EWD442 Inside ``Mathematics Inc.'' / Edsger W. Dijkstra
                 / 54--55 \\
                 EWD443 A Multidisciplinary Approach to Mathematics /
                 Edsger W. Dijkstra / 56--59 \\
                 EWD447 On the Role of Scientific Thought / Prof. Dr.
                 Edsger W. Dijkstra / 60--66 \\
                 EWD462 A Time-Wise Hierarchy Imposed upon the Use of a
                 Two-Level Store / Prof. Dr. Edsger W. Dijkstra / 67--78
                 \\
                 EWD464 A New Elephant Built from Mosquitoes Humming in
                 Harmony / Prof. Dr. Edsger W. Dijkstra / 79--83 \\
                 EWD465 Monotonic Replacement Algorithms and Their
                 Implementation / Prof. Dr. Edsger W. Dijkstra / 84--88
                 \\
                 EWD466 Trip Report E. W. Dijkstra, Meeting IFIP
                 W.G.2.3, Munich, 8---14 December 1974 / Prof. Dr.
                 Edsger W. Dijkstra / 89--94 \\
                 EWD474 Trip Report Visit ETH Z{\"u}rich, 3--4 February
                 1975 by E. W. Dijkstra / Edsger W. Dijkstra / 95--98
                 \\
                 EWD475 A Letter to My Old Friend Jonathan / Edsger W.
                 Dijkstra / 99--103 \\
                 EWD480 ``Craftsman or Scientist?'' / Prof. Dr. Edsger
                 W. Dijkstra / 104--109 \\
                 EWD482 Exercises in Making Programs Robust / Prof. Dr.
                 Edsger W. Dijkstra / 110--119 \\
                 EWD494 Trip Report E. W. Dijkstra 16th April / 7th May,
                 1975, U.S.A. and Canada / Prof. Dr. Edsger W. Dijkstra
                 / 120--128 \\
                 EWD498 How Do We Tell Truths that Might Hurt? / Prof.
                 Dr. Edsger W. Dijkstra / 129--131 \\
                 EWD501 Variations on a Theme: an Open Letter to C. A.
                 R. Hoare / Professor C. A. R. Hoare / 132--140 \\
                 EWD503 A Post-Scriptum to EWD501 / Edsger / 141--144
                 \\
                 EWD504 Erratum and Embellishments of EWD503 / Prof. Dr.
                 Edsger W. Dijkstra / 145--146 \\
                 EWD508 A Synthesis Emerging? / Prof. Dr. Edsger W.
                 Dijkstra / 147--160 \\
                 EWD512 Comments at a Symposium / Edsger W. Dijkstra /
                 161--164 \\
                 EWD513 Trip Report E. W. Dijkstra, Newcastle, 8--12
                 September 1975 / Prof. Dr. Edsger W. Dijkstra /
                 165--168 \\
                 EWD525 On a Warning from E. A. Hauck / Prof. Dr. Edsger
                 W. Dijkstra / 169--171 \\
                 EWD528 More on Hauck's Warning / Prof. Dr. Edsger W.
                 Dijkstra / 172--173 \\
                 EWD538 A Collection of Beautiful Proofs / Edsger W.
                 Dijkstra / 174--183 \\
                 EWD539 Mathematics Inc., a Private Letter from Its
                 Chairman / Prof. Dr. Edsger W. Dijkstra / 184--187 \\
                 EWD554 A Personal Summary of the Gries--Owicki Theory /
                 Prof. Dr. Edsger W. Dijkstra / 188--199 \\
                 EWD561 A ``Non Trip Report'' from E. W. Dijkstra /
                 Prof. Dr. Edsger W. Dijkstra / 200--204 \\
                 EWD563 Formal Techniques and Sizeable Programs / Edsger
                 W. Dijkstra / 205--214 \\
                 EWD570 An Exercise for Dr. R. M. Burstall / Prof. Dr.
                 Edsger W. Dijkstra / 215--216 \\
                 EWD573 A Great Improvement / Prof. Dr. Edsger W.
                 Dijkstra / 217--219 \\
                 EWD575 To H. D. Mills, Chairman Software Methodology
                 Panel / Prof. Dr. Edsger W. Dijkstra / 220--222 \\
                 EWD576 On Subgoal Induction / Prof. Dr. Edsger W.
                 Dijkstra / 223--224 \\
                 EWD577 Trip Report E. W. Dijkstra, ECI-Conference 9--12
                 August 1976, Amsterdam / Prof. Dr. Edsger W. Dijkstra /
                 225--229 \\
                 EWD578 More About the Function ``tt fusc'' (A Sequel to
                 EWD570) / Prof. Dr. Edsger W. Dijkstra / 230--232 \\
                 EWD582A Proof of a Theorem Communicated to Us by S.
                 Ghosh / Prof. Dr. Edsger W. Dijkstra and Drs. C. S.
                 Scholten / 233--234 \\
                 EWD584 Trip Report E. W. Dijkstra, Poland and USSR,
                 4--25 September 1976 / Prof. Dr. Edsger W. Dijkstra /
                 235--244 \\
                 EWD585 Trip Report E. W. Dijkstra, Tokyo, 28 Sept--3
                 Oct. 1976 / Prof. Dr. Edsger W. Dijkstra / 245--250 \\
                 EWD594 A Parable / Prof. Dr. Edsger W. Dijkstra /
                 251--252 \\
                 EWD603 Trip Report E. W. Dijkstra, St.
                 Pierre-de-Chartreuse, 12--19 Dec. 1976 / Prof. Dr.
                 Edsger W. Dijkstra / 253--258 \\
                 EWD607 A Correctness Proof for Communicating Processes:
                 A Small Exercise / Prof. Dr. Edsger W. Dijkstra /
                 259--263 \\
                 EWD608 An Elephant Inspired by the Dutch National Flag
                 / Prof. Dr. Edsger W. Dijkstra / 264--267 \\
                 EWD611 On the Fact that the Atlantic Ocean Has Two
                 Sides / Prof. Dr. Edsger W. Dijkstra / 268--276 \\
                 EWD613 Trip Report E. W. Dijkstra, Australia, 16
                 February 1977--21 March 1977 / Prof. Dr. Edsger W.
                 Dijkstra / 277--283 \\
                 EWD614 A Somewhat Open Letter to EAA or: Why I Proved
                 the Boundedness of the Nondeterminacy in the Way I Did
                 / Prof. Dr. Edsger W. Dijkstra / 284--287 \\
                 EWD618 On Webster, Users, Bugs, and Aristotle / Prof.
                 Dr. Edsger W. Dijkstra / 288--291 \\
                 EWD622 On Making Solutions More and More Fine-Grained /
                 Prof. Dr. Edsger W. Dijkstra / 292--307 \\
                 EWD623 The Mathematics Behind the Banker's Algorithm /
                 Prof. Dr. Edsger W. Dijkstra / 308--312 \\
                 EWD629 On Two Beautiful Solutions Designed by Martin
                 Rem / Prof. Dr. Edsger W. Dijkstra / 313--318 \\
                 EWD635 Trip Report E. W. Dijkstra, Newcastle-upon-Tyne,
                 5--10 Sept. 1977 / Prof. Dr. Edsger W. Dijkstra /
                 319--323 \\
                 EWD636 Why Naive Program Transformation Systems Are
                 Unlikely to Work / Prof. Dr. Edsger W. Dijkstra /
                 324--328 \\
                 EWD637 The Three Golden Rules for Successful Scientific
                 Research / Prof. Dr. Edsger W. Dijkstra / 329--330 \\
                 EWD639 The Introduction of MAES / Prof. Dr. Edsger W.
                 Dijkstra / 331--333 \\
                 EWD643 A Class of Simple Communication Patterns / C. S.
                 Scholten and Prof. Dr. Edsger W. Dijkstra / 334--337
                 \\
                 EWD648 ``Why is Software So Expensive?'' An Explanation
                 to the Hardware Designer / Prof. Dr. Edsger W. Dijkstra
                 / 338--348 \\
                 EWD650 A Theorem about Odd Powers of Odd Integers /
                 Prof. Dr. Edsger W. Dijkstra / 349--350 \\
                 EWD671 Program Inversion / Prof. Dr. Edsger W. Dijkstra
                 / 351--354 \\
                 EWD673 On Weak and Strong Termination / Prof. Dr.
                 Edsger W. Dijkstra / 355--357 \\
                 EWD675 The Equivalence of Bounded Nondeterminacy and
                 Continuity / Prof. Dr. Edsger W. Dijkstra / 358--359
                 \\
                 EWD678 A Story that Starts with a Very Good Computer /
                 Prof. Dr. Edsger W. Dijkstra / 360--362",
}

@Proceedings{ACM:1983:PFA,
  editor =       "{ACM}",
  booktitle =    "{Proceedings of the fifteenth annual ACM Symposium on
                 Theory of Computing, Boston, Massachusetts, April
                 25--27, 1983}",
  title =        "{Proceedings of the fifteenth annual ACM Symposium on
                 Theory of Computing, Boston, Massachusetts, April
                 25--27, 1983}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "v + 487",
  year =         "1983",
  ISBN =         "0-89791-099-0",
  ISBN-13 =      "978-0-89791-099-6",
  LCCN =         "QA75.5.A14 1983",
  bibdate =      "Thu Dec 3 07:11:18 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/stoc1980.bib",
  note =         "ACM order no. 508830.",
  acknowledgement = ack-nhfb,
  annote =       "Sponsored by the ACM Special Interest Group for
                 Automata and Computability Theory.",
  keywords =     "computational complexity --- congresses; electronic
                 digital computers --- programming --- congresses",
  tableofcontents = "An $O(n \log n)$ Sorting Network / M. Ajtai, J.
                 Koml{\'o}s, E. Szemer{\'e}di / 1 \\
                 A Logarithmic Time Sort for Linear Size Networks / J.
                 H. Reif, L. G. Valiant / 10 \\
                 Parallel Algorithms for Algebraic Problems / J. von zur
                 Gathen / 17 \\
                 Topological Matching / Q. F. Stout / 24 \\
                 Reliable Computation with Cellular Automata / P.
                 G{\'a}cs / 32 \\
                 Superconcentrators, Generalizers and Generalized
                 Connectors with Limited Depth / D. Dolev, C. Dwork, N.
                 Pippenger, A. Wigderson / 42 \\
                 Unbounded Fan-in Circuits and Associative Functions /
                 A. K. Chandra, S. Fortune, R. Lipton / 52 \\
                 Borel Sets and Circuit Complexity / M. Sipser / 61 \\
                 A Polynomial Linear Search Algorithm for the
                 n-Dimensional Knapsack Problem / F. Meyer auf der Heide
                 / 70 \\
                 Lower Bounds for Algebraic Computation Trees / M.
                 Ben-Or / 80 \\
                 Bounds for Width Two Branching Programs / A. Borodin,
                 D. Dolev, F. E. Fieh, W. Paul / 87 \\
                 Multi-Party Protocols / A. K. Chandra, M. L. Furst, R.
                 J. Lipton / 94 \\
                 New Bounds for Parallel Prefix Circuits / F. E. Fich /
                 100 \\
                 Exponential Lower Bounds for Restricted Monotone
                 Circuits / L. G. Valiant / 110 \\
                 The Complexity of Approximate Counting / L. Stockmeyer
                 / 118 \\
                 Two Nonlinear Lower Bounds / P. D{\'u}ri{\'s}, Z.
                 Galil, W. Paul, R. Reischuk / 127 \\
                 On Notions of Information Transfer in VLSI Circuits /
                 A. V. Aho, J. D. Ullman, M. Yannakakis / 133 \\
                 Solvability by Radicals is in Polynomial Time / S.
                 Landau, G. L. Miller / 140 \\
                 On the Diameter of Permutation Groups / J. R. Driscoll,
                 M. L. Furst / 152 \\
                 Normal Forms for Trivalent Graphs and Graphs of Bounded
                 Valence / M. F{\"u}rer, W. Schnyder, E. Specker / 161
                 \\
                 Canonical Labeling of Graphs / L. Bahai, E. M. Luks /
                 171 \\
                 How to Generate Random Integers with Known
                 Factorization / E. Bach / 184 \\
                 Factoring Multivariate Polynomials over Finite Fields /
                 A. K. Lenstra / 189 \\
                 Improved Algorithms for Integer Programming and Related
                 Lattice Problems / R. Kannan / 193 \\
                 Retraction: A New Approach to Motion-Planning / C.
                 O'D{\'u}nlaing, M. Sharir, C. K. Yap / 207 \\
                 Primitives for the Manipulation of General Subdivisions
                 and the Computation of Voronoi Diagrams / L. J. Guibas,
                 J. Stolfi / 221 \\
                 Self-Adjusting Binary Trees / D. D. Sleator, R. E.
                 Tarjan / 235 \\
                 A Linear-Time Algorithm for a Special Case of Disjoint
                 Set Union / H. N. Gabow, R. E. Tarjan / 246 \\
                 Data Structures for On-Line Updating of Minimum
                 Spanning Trees / G. N. Frederickson / 252 \\
                 A 3-Space Partition and its Applications / F. F. Yao /
                 258 \\
                 Unary Inclusion Dependencies Have Polynomial Time
                 Inference Problems / P. C. Kandlakis, S. S. Cosmadakis,
                 M. Y. Vardi / 264 \\
                 On the Extremely Fair Treatment of Probabilistic
                 Algorithms / A. Pnueli / 278 \\
                 A Probabilistic PDL / D. Kozen / 291 \\
                 A Decidable Propositional Probabilistic Dynamic Logic /
                 Y. A. Feldman / 298 \\
                 A Logic to Reason about Likelihood / J. Y. Halpern, M.
                 O. Rabin / 310 \\
                 A Characterization of Hoare's Logic for Programs with
                 Pascal-Like Procedures / Ernest-R{\"u}diger Olderog /
                 320 \\
                 A ComplexitY Theoretic Approach to Randomness / M.
                 Sipser / 330 \\
                 Speedups of Deterministic Machines by Synchronous
                 Parallel Machines / P. W. Dymond, M. Tompa / 336 \\
                 Alternation and the Power of Nondeterminism / R. Kannan
                 / 344 \\
                 Languages which Capture Complexity Classes / N.
                 Immerman / 347 \\
                 The Random Access Hierarchy / D. Myers / 355 \\
                 Iterated Pushdown Automata and Complexity Classes / J.
                 Engelfriet / 365 \\
                 Unique Decomposability of Shuffled Strings: A Formal
                 Treatment of Asynchronous Time-Multiplexed
                 Communication / K. Iwama / 374 \\
                 SparseSets in NP-P: EXPTIME versus NEXPTIME / J.
                 Hartmanis, V. Sewelson, N. Immerman / 382 \\
                 Some Structural Properties of Polynomial Reducibilities
                 and Sets in NP / P. Young / 392 \\
                 On Breaking Generalized Knapsack Public Key
                 Cryptosystems / L. M. Adleman / 402 \\
                 How Discreet is the Discrete Log? / D. L. Long, A.
                 Wigderson : / 413 \\
                 On the Cryptographic Security of Single RSA Bits / M.
                 Ben-Or, B. Chor, A. Shamir / 421 \\
                 Strong Signature Schemes / S. Goldwasser, S. Micali, A.
                 Yao / 431 \\
                 How to Exchange (Secret) Keys / M. Blum / 440 \\
                 An Efficient Reduction Technique for Degree-Constrained
                 Subgrapb and Bidirected Network Flow Problems / H. N.
                 Gabow / 448 \\
                 Transitive Orientation in $O(n^2)$ Time / J. Spinrad /
                 457 \\
                 Probabilistic Analysis of Bandwidth Minimization
                 Algorithms / J. Turner / 467 \\
                 An Approximation Algorithm for Manhattan Routing / B.
                 S. Baker, S. N. Bhatt, F. T. Leighton / 477 Author
                 Index / 487",
}

@Book{Feuer:1984:CAP,
  editor =       "Alan R. Feuer and Narain Gehani",
  booktitle =    "Comparing and Assessing Programming Languages: {Ada},
                 {C}, and {Pascal}",
  title =        "Comparing and Assessing Programming Languages: {Ada},
                 {C}, and {Pascal}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xiv + 271",
  year =         "1984",
  ISBN =         "0-13-154840-9 (paperback), 0-13-154857-3 (hardcover)",
  ISBN-13 =      "978-0-13-154840-4 (paperback), 978-0-13-154857-2
                 (hardcover)",
  LCCN =         "QA76.73.A35 C66 1984",
  bibdate =      "Tue May 24 05:49:12 MDT 2005",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 http://www.math.utah.edu/pub/tex/bib/unix.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "Prentice-Hall software series",
  acknowledgement = ack-nhfb,
  subject =      "Ada (Computer program language); C (Computer program
                 language); Pascal (Computer program language)",
  tableofcontents = "Comparing programming languages \\
                 A comparison of the programming languages C and Pascal
                 / Alan R. Feuer and Narain H. Gehani \\
                 Pascal versus C: a subjective comparison / Prabhaker
                 Mateti \\
                 A comparison of Pascal and Ada / B. A. Wichmann \\
                 A comparison of programming languages: Ada, Pascal, C /
                 Arthur Evans, Jr. \\
                 Assessing programming languages \\
                 An assessment of the programming language Pascal /
                 Niklaus Wirth \\
                 UNIX time-sharing system: the C programming language /
                 D. M. Ritchie, S. C. Johnson, M. E. Leek, and B. W.
                 Kernighan \\
                 An early assessment of the Ada programming language /
                 Narain H. Gehani \\
                 Language criticisms \\
                 Critical comments on the programming language Pascal /
                 A. N. Habermann \\
                 More comments on the programming language Pascal / O.
                 Lecarme and P. Desjardins \\
                 Why Pascal is not my favorite programming language /
                 Brian W. Kernighan \\
                 Type syntax in the language C: an object lesson in
                 syntactic innovation / Bruce Anderson \\
                 Methodology for comparing and assessing languages \\
                 A methodology for comparing programming languages /
                 Alan R. Feuer and Narain H. Gehani \\
                 A comparison of programming languages for software
                 engineering / Mary Shaw, Guy T. Almes, Joseph M.
                 Newcomer, Brian K. Reid, and William A. Wulf \\
                 A critical comparison of several programming language
                 implementations / H. J. Boom and E. De Jong \\
                 Programming languages: what to demand and how to assess
                 them / Niklaus Wirth",
}

@Book{Hoare:1985:CSP,
  author =       "C. A. R. Hoare",
  booktitle =    "Communicating Sequential Processes",
  title =        "Communicating Sequential Processes",
  publisher =    "Prentice-Hall International",
  address =      "Englewood Cliffs, NJ, USA and London, UK",
  pages =        "viii + 256",
  year =         "1985",
  DOI =          "https://doi.org/10.5555/3921",
  ISBN =         "0-13-153271-5 (hardcover), 0-13-153289-8 (paperback)",
  ISBN-13 =      "978-0-13-153271-7 (hardcover), 978-0-13-153289-2
                 (paperback)",
  LCCN =         "QA76.6 .H57 1985",
  MRclass =      "68-02 (68Q05 68Q10)",
  MRnumber =     "805324",
  MRreviewer =   "Ryszard Janicki",
  bibdate =      "Sat Jul 30 11:13:34 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "With a foreword by Edsger W. Dijkstra",
  series =       "Prentice Hall International Series in Computer
                 Science",
  URL =          "https://dl.acm.org/doi/book/10.5555/3921",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / iii \\
                 Preface / v \\
                 Summary / ix \\
                 Acknowledgements / xiii \\
                 Glossary of Symbols / xv \\
                 1 Processes / 1 \\
                 1.1 Introduction / 1 \\
                 1.2 Pictures / 12 \\
                 1.3 Laws / 14 \\
                 1.4 Implementation of processes / 16 \\
                 1.5 Traces / 19 \\
                 1.6 Operations on traces / 21 \\
                 1.7 Implementation of traces / 26 \\
                 1.8 Traces of a process / 27 \\
                 1.9 More operations on traces / 34 \\
                 1.10 Specifications / 37 \\
                 2 Concurrency / 45 \\
                 2.1 Introduction / 45 \\
                 2.2 Interaction / 45 \\
                 2.3 Concurrency / 48 \\
                 2.4 Pictures / 54 \\
                 2.5 Example: The Dining Philosophers / 55 \\
                 2.6 Change of symbol / 61 \\
                 2.7 Specifications / 71 \\
                 2.8 Mathematical theory of deterministic processes / 72
                 \\
                 3 Nondeterminism / 81 \\
                 3.1 Introduction / 81 \\
                 3.2 Nondeterministic or / 82 \\
                 3.3 General choice / 86 \\
                 3.4 Refusals / 88 \\
                 3.5 Concealment / 90 \\
                 3.6 Interleaving / 99 \\
                 3.7 Specifications / 101 \\
                 3.8 Divergence / 105 \\
                 3.9 Mathematical theory of non-deterministic processes
                 / 108 \\
                 4 Communication / 113 \\
                 4.1 Introduction / 113 \\
                 4.2 Input and output / 113 \\
                 4.3 Communications / 122 \\
                 4.4 Pipes / 131 \\
                 4.5 Subordination / 142 \\
                 5 Sequential Processes / 153 \\
                 5.1 Introduction / 153 \\
                 5.2 Laws / 157 \\
                 5.3 Mathematical treatment / 158 \\
                 5.4 Interrupts / 161 \\
                 5.5 Assignment / 167 \\
                 6 Shared Resources / 181 \\
                 6.1 Introduction / 181 \\
                 6.2 Sharing by interleaving / 182 \\
                 6.3 Shared storage / 187 \\
                 6.4 Multiple resources / 189 \\
                 6.5 Operating systems / 198 \\
                 6.6 Scheduling / 204 \\
                 7 Discussion / 207 \\
                 7.1 Introduction / 207 \\
                 7.2 Shared storage / 207 \\
                 7.3 Communication / 218 \\
                 7.4 Mathematical models / 226 \\
                 Select Bibliography / 233 \\
                 Index / 235",
}

@Book{Hoare:1985:MLP,
  editor =       "C. A. R. Hoare and J. C. Shepherdson",
  booktitle =    "Mathematical Logic and Programming Languages",
  title =        "Mathematical Logic and Programming Languages",
  publisher =    "Prentice-Hall International",
  address =      "Englewood Cliffs, NJ, USA",
  bookpages =    "184",
  pages =        "184",
  year =         "1985",
  ISBN =         "0-13-561465-1",
  ISBN-13 =      "978-0-13-561465-5",
  LCCN =         "QA76.6 .M3646 1985",
  bibdate =      "Sat Jul 30 11:19:12 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "A Discussion Meeting of the Royal Society of London.",
  acknowledgement = ack-nhfb,
  tableofcontents = "The relation between logic programming and logic
                 specification \\
                 Functional programs as executable specifications \\
                 Mechanical proofs about computer programs \\
                 The use of machines to assist in rigorous proof \\
                 The characterization problem for Hoare logics \\
                 Deductive learning \\
                 Programming as a mathematical exercise \\
                 Programs are predicates \\
                 Invariance and non-determinacy \\
                 Constructive mathematics and computer programming",
}

@Book{Hoare:1986:MPI,
  author =       "C. A. R. Hoare",
  booktitle =    "The mathematics of programming: an inaugural lecture
                 delivered before the {University of Oxford} on {17th
                 October 1985}",
  title =        "The mathematics of programming: an inaugural lecture
                 delivered before the {University of Oxford} on {17th
                 October 1985}",
  publisher =    pub-OXFORD,
  address =      pub-OXFORD:adr,
  pages =        "25",
  year =         "1986",
  ISBN =         "0-19-951550-6 (paperback)",
  ISBN-13 =      "978-0-19-951550-9 (paperback)",
  LCCN =         "QA76.6 .H573 1986",
  bibdate =      "Sat Jul 30 11:25:46 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data found in numerous library
                 catalogs.",
}

@Book{Ashenhurst:1987:ATA,
  editor =       "Robert L. Ashenhurst",
  booktitle =    "{ACM Turing Award Lectures}: the first twenty years,
                 1966--1985",
  title =        "{ACM Turing Award Lectures}: the first twenty years,
                 1966--1985",
  publisher =    pub-ACM # " and " # pub-AW,
  address =      pub-ACM:adr # " and " # pub-AW:adr,
  pages =        "xviii + 483",
  year =         "1987",
  ISBN =         "0-201-07794-9",
  ISBN-13 =      "978-0-201-07794-0",
  LCCN =         "QA76.24 .A33 1987",
  bibdate =      "Tue Jun 21 11:01:04 2011",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       "ACM Press anthology series",
  acknowledgement = ack-nhfb,
  subject =      "Electronic data processing; Computers",
  tableofcontents = "The synthesis of algorithmic systems / Alan J.
                 Perlis \\
                 Computers then and now / Maurice V. Wilkes \\
                 One man's view of computer science / R. W. Hamming \\
                 Form and content in computer science / Marvin Minsky
                 \\
                 Some comments from a numerical analyst / J. H.
                 Wilkinson \\
                 Generality in artificial intelligence / John McCarthy
                 \\
                 The humble programmer / Edsger W. Dijkstra \\
                 The programmer as navigator / Charles W. Bachman \\
                 Computer programming as an art / Donald E. Knuth \\
                 Computer science as empirical inquiry: symbols and
                 search / Allen Newell and Herbert A. Simon \\
                 Complexity of computations / Michael O. Rabin \\
                 Logic and programming languages / Dana S. Scott \\
                 Can programming be liberated from the von Neumann
                 style?: a functional style and its algebra of programs
                 / John Backus \\
                 The paradigms of programming / Robert W. Floyd \\
                 Notation as a tool of thought / Kenneth E. Iverson \\
                 The emperor's old clothes / Charles Antony Richard
                 Hoare \\
                 Relational database: a practical foundation for
                 productivity / E. F. Codd \\
                 An overview of computational complexity / Stephen A.
                 Cook \\
                 Reflections on software research / Dennis M. Ritchie
                 \\
                 Reflections on trusting trust / Ken Thompson \\
                 From programming language design to computer
                 construction / Niklaus Wirth \\
                 Combinatorics, complexity, and randomness / Richard M.
                 Karp \\
                 Algorithm design / Robert E. Tarjan \\
                 Computer science: the emergence of a discipline / John
                 E. Hopcroft \\
                 The search for performance in scientific processors /
                 John Cocke \\
                 Micropipelines / Ivan E. Sutherland \\
                 On building systems that will fail / Fernando J.
                 Corbat{\'o} \\
                 Elements of interaction / Robin Milner \\
                 Turing Award Lecture: it's time to reconsider time /
                 Richard Edwin Stearns \\
                 Turing Award Lecture: on computational complexity and
                 the nature of computer science / Juris Hartmanis \\
                 How the `what' becomes the `how' / Edward A. Feigenbaum
                 \\
                 To dream the possible dream / Raj Reddy \\
                 The Early Days of RSA: History and Lessons / Ronald L.
                 Rivest \\
                 Pre-RSA Days: History and Lessons / Leonard Adleman \\
                 Cryptography: State of the science / Adi Shamir \\
                 Turing Award Lecture / Alan Kay \\
                 Assessing the Internet: Lessons Learned, Strategies for
                 Evolution, and Future Possibilities / Vinton Cerf,
                 Robert E. Kahn \\
                 Computing vs. Human Thinking / Peter Naur \\
                 Compiling for Performance: a Personal Tour / Frances
                 Allen \\
                 Model checking: my 27-year quest to overcome the state
                 explosion problem / Edmund M. Clarke \\
                 Model checking: a Personal Perspective / E. Allen
                 Emerson \\
                 The Quest for Correctness Beyond Verification / Joseph
                 Sifakis \\
                 The Power of Abstraction / Barbara Liskov \\
                 Improving the Future by Examining the Past / Charles P.
                 Thacker",
}

@Proceedings{IEEE:1988:ASL,
  editor =       "{IEEE}",
  booktitle =    "{3rd Annual Symposium on Logic in Computer Science:
                 proceedings, July 5--8, 1988, Edinburgh, Scotland}",
  title =        "{3rd Annual Symposium on Logic in Computer Science:
                 proceedings, July 5--8, 1988, Edinburgh, Scotland}",
  publisher =    "Computer Society Press",
  address =      "Washington, DC, USA",
  pages =        "xi + 436",
  year =         "1988",
  ISBN =         "0-8186-0853-6 (paperback); 0-8186-4853-8
                 (microfiche)",
  ISBN-13 =      "978-0-8186-0853-7 (paperback); 978-0-8186-4853-3
                 (microfiche)",
  LCCN =         "QA76.9.M35 S94 1988",
  bibdate =      "Mon Aug 1 15:26:34 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Computer Society order number 853. IEEE catalog number
                 88CH2608-8.",
  abstract =     "Forty papers contributed to the IEEE symposium held in
                 Edinburgh, July 1988",
  acknowledgement = ack-nhfb,
  meetingname =  "Symposium on Logic in Computer Science (3rd 1988
                 (Edinburgh))",
  subject =      "Electronic data processing; Mathematics; Congresses.;
                 Logic, Symbolic and mathematical",
  tableofcontents = "0-1 laws and decision problems for fragments of
                 second-order logic / P. G. Kolaitis and M. Y. Vardi /
                 2--11 \\
                 An algebra and a logic for NC$^1$ / K. J. Compton and
                 C. Laflamme / 12--21 \\
                 Proving unprovability / M. Tiomkin / 22--26 \\
                 Partial correctness of C-MOS switching circuits: an
                 exercise in applied logic / C. A. R. Hoare and M. J. C.
                 Gordon / 28--36 \\
                 A modest model of records, inheritance and bounded
                 quantification / K. B. Bruce and G. Longo / 38--50 \\
                 A fixed point of the second order lambda-calculus:
                 observable equivalences and models / R. M. Amadio /
                 51--60 \\
                 Characterization of typings in polymorphic type
                 discipline / P. Giannini and S. R. Della Rocca / 61--70
                 \\
                 On the computational power of universally polymorphic
                 recursion / A. J. Kfoury and J. Tiuryn and P. Urzczyn /
                 72--81 \\
                 Combining algebra and higher-order types / V.
                 Breazu-Tannen / 82--90 \\
                 Characterizing X-separability and one-side
                 invertibility in lambda--beta--Omega -calculus / C.
                 Bohm and A. Piperno / 91--101 \\
                 Proof-theoretic techniques for term rewriting theory /
                 N. Dershowitz and M. Okada / 104--111 \\
                 Efficient parallel algorithms for anti-unification and
                 relative complement / G. M. Kuper and K. W. McAloon and
                 K. V. Palem and K. J. Perry / 112--120 \\
                 Unification in free extensions of Boolean rings and
                 Abelian groups / A. Boudet and J.-P. Jouannaud and M.
                 Schmidt-Schauss / 121--130 \\
                 Corrigendum: complete type interference for simple
                 objects / M. Wand / 132 \\
                 On the consistency of 'truly concurrent' operational
                 and denotational semantics / P. Degano and R. De Nicola
                 and U. Montanari / 133--141 \\
                 A category of labelled Petri nets and compositional
                 proof system / G. Winskel / 142--154 \\
                 Petri nets are monoids: a new algebraic foundation for
                 net theory / J. Meseguer and U. Montanari / 155--164
                 \\
                 The existence of refinement mappings / M. Abadi and L.
                 Lamport / 165--175 \\
                 Relevance logic and concurrent composition / M. Dam /
                 178--185 \\
                 Bisimulations and divergence / D. J. Walker / 186--192
                 \\
                 Priorities in process algebras / R. Cleaveland and M.
                 Hennessy / 193--202 \\
                 A modal process logic / K. G. Larsen and B. Thomsen /
                 203--210 \\
                 On the arithmetic inexpressiveness of term rewriting
                 systems / S. G. Vorobyov / 212--217 \\
                 Rigid E-unification is NP-complete / J. Gallier and W.
                 Snyder and P. Narendran and D. Plaisted / 218--227 \\
                 Proof by consistency in equational theories / L.
                 Bachmair / 228--233 \\
                 Semantical paradigms: notes for an invited lecture / A.
                 R. Meyer and S. S. Cosmadakis / 236--253 \\
                 Categories of embeddings / T. Coquand / 256--263 \\
                 A categorical semantics of constructions / T. Ehrhard /
                 264--273 \\
                 Semantic parametricity in polymorphic lambda calculus /
                 P. J. Freyd and J.-Y. Girard and A. Scedrov and P. J.
                 Scott / 274--279 \\
                 Can LCF be topped? Flat lattice models of typed lambda
                 calculus / B. Bloom / 282--295 \\
                 The topology of program termination / R. Cartwright and
                 A. Demers / 296--308 \\
                 Coherence and consistency in domains / D. A. Gunter and
                 A. Jung / 309--317 \\
                 Fully abstract denotational semantics for flat
                 Concurrent Prolog / R. Gerth and M. Codish and Y.
                 Lichtenstein and E. Shapiro / 320--335 \\
                 Proving termination properties of Prolog programs: a
                 semantic approach / M. Baudinet / 336--347 \\
                 Complete axiomatizations of the algebras of finite,
                 rational and infinite trees / M. J. Maher / 348--357
                 \\
                 Computational foundations of basic recursive function
                 theory / R. L. Constable and S. F. Smith / 360--371 \\
                 Notational definition-a formal account / T. G. Griffin
                 / 372--383 \\
                 The strength of the subset type in Martin-L{\"o}f's
                 type theory / A. Salveson and J. M. Smith / 384--391
                 \\
                 The notion of a framework and a framework for LTC / P.
                 F. Mendler and P. Aczel / 392--399 \\
                 Fixed points vs. infinite generation / D. Niwinski /
                 402--409 \\
                 A logic for reasoning about probabilities / R. Fagin
                 and J. Y. Halpern and N. Megiddo / 410--421 \\
                 Weak alternating automata give a simple explanation of
                 why most temporal and dynamic logics are decidable in
                 exponential time / D. E. Muller and A. Saoudi and P. E.
                 Schupp / 422--427 \\
                 On the existence of effective Hoare logics / M.
                 Grabowski and H. Hungar / 428--435",
}

@Book{Elliott:1989:SAM,
  editor =       "R. J. (Roger J.) Elliott and C. A. R. (Charles Antony
                 Richard) Hoare",
  booktitle =    "Scientific Applications of Multiprocessors",
  title =        "Scientific Applications of Multiprocessors",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "vi + 143",
  year =         "1989",
  ISBN =         "0-13-795774-2",
  ISBN-13 =      "978-0-13-795774-3",
  LCCN =         "Q183.9 .S29 1989",
  bibdate =      "Wed Aug 10 17:45:27 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data found in numerous library
                 catalogs.",
  remark =       "Actes del Royal Society Discussion Meeting, celebrat
                 el 9 i 10 de desembre, 1987. The papers in this book
                 were first published in the Philosophical Transactions
                 of the Royal Society, Series A, volume 326, 1988.",
  subject =      "Multiprocessadors; Congressos",
}

@Book{Hoare:1989:ECS,
  author =       "C. A. R. Hoare",
  booktitle =    "Essays in Computing Science",
  title =        "Essays in Computing Science",
  publisher =    "Prentice Hall International",
  address =      "Englewood Cliffs, NJ, USA",
  pages =        "xii + 412",
  year =         "1989",
  DOI =          "https://doi.org/10.5555/63445",
  ISBN =         "0-13-284027-8",
  ISBN-13 =      "978-0-13-284027-9",
  LCCN =         "QA76 .H56 1989",
  MRclass =      "68-02 (01A75 68-06)",
  MRnumber =     "1042756",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "With a foreword by David Gries, Edited and with a
                 preface by C. B. Jones",
  series =       "Prentice Hall International Series in Computer
                 Science",
  URL =          "https://dl.acm.org/doi/10.5555/63445",
  acknowledgement = ack-nhfb,
  tableofcontents = "Foreword / ix \\
                 Preface / xi \\
                 ONE \\
                 The Emperor's old clothes / 1 \\
                 TWO \\
                 Quicksort / 19 \\
                 THREE \\
                 A contribution to the development of ALGOL / 31 \\
                 FOUR \\
                 An axiomatic basis for computer programming / 45 \\
                 FIVE \\
                 Proof of a program: Find / 59 \\
                 SIX \\
                 Procedures and parameters: an axiomatic approach / 75
                 \\
                 SEVEN \\
                 Computer science / 89 \\
                 EIGHT \\
                 Proof of correctness of data representations / 103 \\
                 NINE \\
                 Proof of a structured program: the Sieve of
                 Eratosthenes / 117 \\
                 TEN \\
                 A structured paging system / 133 \\
                 ELEVEN \\
                 An axiomatic definition of the programming language
                 Pascal / 153 \\
                 TWELVE \\
                 Monitors: an operating system structuring concept / 171
                 \\
                 THIRTEEN \\
                 Hints on programming-language design / 193 \\
                 FOURTEEN \\
                 Recursive data structures / 217 \\
                 FIFTEEN \\
                 Parallel programming: an axiomatic approach / 245 \\
                 SIXTEEN \\
                 Communicating sequential processes / 259 \\
                 SEVENTEEN \\
                 A calculus of total correctness for communicating
                 sequential processes / 289 \\
                 EIGHTEEN \\
                 Programming is an engineering profession / 315 \\
                 NINETEEN \\
                 A couple of novelties in the propositional calculus /
                 325 \\
                 TWENTY \\
                 Programs are predicates / 333 \\
                 TWENTY-ONE \\
                 The mathematics of programming / 351 \\
                 TWENTY-TWO \\
                 An overview of some formal methods for program design /
                 371 \\
                 Envoi / 389 \\
                 References / 393 \\
                 Bibliography of works by C. A. R. Hoare / 398 \\
                 Index / 405",
}

@Book{Khoar:1989:CVC,
  author =       "Ch. Khoar",
  booktitle =    "{{\cyr Vzaimode{\u{i}}}} {\cyr stvuyushchie
                 posledovatel\cprime nye protsessy}",
  title =        "{{\cyr Vzaimode{\u{i}}}} {\cyr stvuyushchie
                 posledovatel\cprime nye protsessy}",
  publisher =    "``Mir'', Moscow",
  pages =        "264",
  year =         "1989",
  ISBN =         "5-03-001043-2",
  ISBN-13 =      "978-5-03-001043-4",
  MRclass =      "68-02 (68Q10)",
  MRnumber =     "991745",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Translated from the English by A. A. Bul\cprime
                 onkova, Translation edited and with a foreword by A. P.
                 Ershov",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents in Russian original text.",
}

@Book{Spivey:1989:ZNR,
  author =       "J. M. Spivey",
  booktitle =    "The {Z} notation: a reference manual",
  title =        "The {Z} notation: a reference manual",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 155",
  year =         "1989",
  ISBN =         "0-13-983768-X (paperback)",
  ISBN-13 =      "978-0-13-983768-5 (paperback)",
  LCCN =         "QA76.73.Z2 S66 1989",
  bibdate =      "Wed Aug 10 18:11:15 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Based on work by Jean-Raymond Abrial.",
  series =       "Prentice-Hall International series in computer
                 science",
  ZMnumber =     "0777.68003",
  acknowledgement = ack-nhfb,
  remark =       "No tableofcontents data found in numerous library
                 catalogs.",
  series-editor = "C. A. R. Hoare",
  subject =      "Z; Programmiersprache",
}

@Book{Baeten:1990:CTC,
  editor =       "J. C. M. Baeten and J. W. Klop",
  booktitle =    "{CONCUR '90} --- Theories of Concurrency: Unification
                 and Extension",
  title =        "{CONCUR '90} --- Theories of Concurrency: Unification
                 and Extension",
  volume =       "458",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vii + 536",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/bfb0039045",
  ISBN =         "0-387-53048-7, 3-540-53048-7, 3-540-46395-X (e-book)",
  ISBN-13 =      "978-0-387-53048-2, 978-3-540-53048-0,
                 978-3-540-46395-5 (e-book)",
  ISSN =         "0302-9743",
  LCCN =         "QA267 .C5927 1990",
  bibdate =      "Mon Aug 1 15:07:48 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  abstract =     "This volume gives the proceedings of the conference
                 CONCUR '90. This is the first conference organized by
                 ESPRIT Basic Research Action 3006, CONCUR (Theories of
                 Concurrency: Unification and Extension), started in
                 September 1989. The principal aims of the action are to
                 explore the relationships among the different
                 approaches to algebraic concurrency theory, and to
                 develop a formalism applicable to a wide range of case
                 studies. The articles in this volume describe the state
                 of the art in concurrency, the theory of communicating
                 concurrent (or distributed) systems.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Partial order semantics of concurrent programs \\
                 SCONE: a simple calculus of nets \\
                 Value-passing in process algebras \\
                 Let's make models \\
                 Ideal specification formalism = expressivity +
                 compositionality + decidability + testability +
                 \ldots{} \\
                 An axiomatization of Lamport's temporal logic of
                 actions \\
                 Convergence of iteration systems \\
                 Process algebra with a zero object \\
                 On the asynchronous nature of communication in
                 concurrent logic languages: a fully abstract model
                 based on sequences \\
                 Verifying temporal properties of processes \\
                 Testing equivalences and fully abstract models for
                 probabilistic processes \\
                 A preorder for partial process specifications \\
                 Back and forth bisimulations \\
                 Reduction and design of well-behaved concurrent systems
                 \\
                 Synthesis rules for Petri nets, and how they lead to
                 new results \\
                 The need for headers: an impossibility result for
                 communication over unreliable channels \\
                 A temporal approach to algebraic specifications \\
                 Superimposition for interacting processes \\
                 An implementation of a translational semantics for an
                 imperative language \\
                 CCSR: a calculus for communicating shared resources \\
                 The linear time \\
                 branching time spectrum \\
                 A programming logic for formal concurrent systems \\
                 A new strategy for proving?-completeness applied to
                 process algebra \\
                 Transition system specifications with negative premises
                 \\
                 Delay-insensitive circuits: an algebraic approach to
                 their design \\
                 Equivalences, congruences, and complete axiomatizations
                 for probabilistic processes \\
                 Rewriting as a unified model of concurrency \\
                 A temporal calculus of communicating systems \\
                 Proving termination of communicating programs \\
                 Factorization of finite state machines under
                 observational equivalence \\
                 Partial order logics for elementary net systems: State-
                 and event-approaches \\
                 Priority as extremal probability \\
                 A synchronous calculus of relative frequency \\
                 On the compositional checking of validity \\
                 Real-time behaviour of asynchronous agents \\
                 Effective solutions to domain equations an approach to
                 effective denotational semantics",
}

@Proceedings{Bjorner:1990:VVZ,
  editor =       "Dines Bj{\o}rner and C. A. R. Hoare and Hans
                 Langmaack",
  booktitle =    "{VDM '90: VDM and Z: formal methods in software
                 development: Third International Symposium of VDM
                 Europe, Kiel, FRG, April 17--21, 1990: proceedings}",
  title =        "{VDM '90: VDM and Z: formal methods in software
                 development: Third International Symposium of VDM
                 Europe, Kiel, FRG, April 17--21, 1990: proceedings}",
  volume =       "428",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 579",
  year =         "1990",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/3-540-52513-0",
  ISBN =         "0-8186-0853-6 (paperback), 0-8186-4853-8 (microfiche),
                 0-8186-8853-X (case)",
  ISBN-13 =      "978-0-8186-0853-7 (paperback), 978-0-8186-4853-/ 3 \\
                 (microfiche), 978-0-8186-8853-9 (case)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.76.D47 V36 1990",
  bibdate =      "Fri Apr 12 07:14:52 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer-ny.com/link/service/series/0558/tocs/t0428.htm;
                 http://www.springerlink.com/content/978-0-387-52513-6;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=428;
                 https://link.springer.com/book/10.1007/3-540-52513-0",
  acknowledgement = ack-nhfb,
  keywords =     "computer software --- development --- congresses",
  tableofcontents = "Object orientation and formal techniques /
                 Ole-Johan Dahl / 1--11 \\
                 An algebraic approach to refinement / Joseph A. Goguen
                 / 12--28 \\
                 Modal logic programming / D. Kato, T. Kikuchi, R.
                 Nakajima, J. Sawada, H. Tsuiki / 29--40 \\
                 Z specification of an object manager / Patrice Chalin,
                 Peter Grogono / 41--71 \\
                 Correctness in the small / Peter Haastrup, Christian
                 Gram / 72--98 \\
                 A formal approach to hypertext using post-prototype
                 formal specification / Danny B. Lange / 99--121 \\
                 Programming with VDM domains / Uwe Schmidt, Hans-Martin
                 H{\"o}rcher / 122--134 \\
                 A buffering system implementation using VDM / Debora
                 Weber-Wulff / 135--149 \\
                 Formal specifications as reusable frameworks / David
                 Garlan, Norman Delisle / 150--163 \\
                 Z and the refinement calculus / Steve King / 164--188
                 \\
                 Modularizing the formal description of a database
                 system / J. S. Fitzgerald, C. B. Jones / 189--210 \\
                 Modular extensions to Z / Augusto Sampaio, Silvio Meira
                 / 211--232 \\
                 Adding abstract datatypes to Meta-IV / J.
                 Steensgaard-Madsen / 233--243 \\
                 Towards a semantics for object-Z / David Duke, Roger
                 Duke / 244--261 \\
                 HOOD and Z for the development of complex software
                 systems / R. Di Giovanni, P. L. Iachini / 262--289 \\
                 Using Z as a specification calculus for object-oriented
                 systems / Anthony Hall / 290--318 \\
                 Specifying open distributed systems with Z / Reinhard
                 Gotzhein / 319--339 \\
                 Refinement of state-based concurrent systems / J. C. P.
                 Woodcock, Carroll Morgan / 340--351 \\
                 Refining data to processes / Job Zwiers / 352--369 \\
                 Two approaches towards the formalisation of VDM /
                 Christine Lafontaine, Yves Ledru, Pierre-Yves Schobbens
                 / 370--398 \\
                 Type checking BSI/VDM-SL ; Nico Plat, Ronald Huijsman,
                 Jan van Katwijk, Gertjan van Oosten, Kees Pronk, Hans
                 Toetenel / 399--425 \\
                 Type inference in Z / J. M. Spivey, B. A. Sufrin /
                 426--451 \\
                 Recursive definitions revisited / Marek A. Bednarczyk,
                 Andrzej M. Borzyszkowski, Wies{\l}aw Paw{\l}owski /
                 452--476 \\
                 Towards the semantics of the definitional language of
                 MetaSoft / Marek A. Bednarczyk, Andrzej M.
                 Borzyszkowski, Wies{\l}aw Paw{\l}owski / 477--503 \\
                 On conservative extensions of syntax in the process of
                 system development / Andrzej Blikle, Mikkel Thorup /
                 504--525 \\
                 A formal semantics for Z and the link between Z and the
                 relational algebra / M. J. van Diepen, K. M. van Hee /
                 526--551 \\
                 A naive domain universe for VDM / Andrzej Tarlecki,
                 Morten Wieth / 552--579",
}

@Book{Feijen:1990:BOB,
  editor =       "W. H. J. Feijen and A. J. M. van Gasteren and David
                 Gries and J. Misra",
  booktitle =    "Beauty is our Business: a Birthday Salute to {Edsger
                 W. Dijkstra}",
  title =        "Beauty is our Business: a Birthday Salute to {Edsger
                 W. Dijkstra}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xix + 453",
  year =         "1990",
  DOI =          "https://doi.org/10.1007/978-1-4612-4476-9",
  ISBN =         "0-387-97299-4, 3-540-97299-4, 1-4612-8792-8 (print),
                 1-4612-4476-5 (online)",
  ISBN-13 =      "978-0-387-97299-2, 978-3-540-97299-0,
                 978-1-4612-8792-6 (print), 978-1-4612-4476-9 (online)",
  ISSN =         "0172-603X",
  ISSN-L =       "0172-603X",
  LCCN =         "QA76 .B326 1990",
  bibdate =      "Thu Mar 24 09:27:40 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/fparith.bib;
                 http://www.math.utah.edu/pub/tex/bib/ibmjrd.bib;
                 http://www.math.utah.edu/pub/tex/bib/master.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook3.bib",
  URL =          "http://www.zentralblatt-math.org/zmath/en/search/?an=0718.68004",
  acknowledgement = ack-nhfb,
  tableofcontents = "Anonymous / Front Matter / i--xix \\
                 Krzysztof R. Apt, Frank S. de Boer, Ernst-R{\"u}diger
                 Olderog / Proving Termination of Parallel Programs /
                 1--6 / doi:10.1007/978-1-4612-4476-9_1 \\
                 Roland C. Backhouse / On a Relation on Functions /
                 7--18 / doi:10.1007/978-1-4612-4476-9_2 \\
                 F. L. Bauer / Efficient Solution of a Non--Monotonic
                 Inverse Problem / 19--26 /
                 doi:10.1007/978-1-4612-4476-9_3 \\
                 A. Bijlsma / Semantics of Quasi--Boolean Expressions /
                 27--35 / doi:10.1007/978-1-4612-4476-9_4 \\
                 Richard S. Bird / Small Specification Exercises /
                 36--43 / doi:10.1007/978-1-4612-4476-9_5 \\
                 Maarten Boasson / Architecture of Real--Time Systems /
                 44--53 / doi:10.1007/978-1-4612-4476-9_6 \\
                 Robert S. Boyer, Milton W. Green, J Strother Moore /
                 The Use of a Formal Simulator to Verify a Simple Real
                 Time Control Program / 54--66 /
                 doi:10.1007/978-1-4612-4476-9_7 \\
                 Donald W. Braben / Exploring the Future: Trends and
                 Discontinuities / 67--75 /
                 doi:10.1007/978-1-4612-4476-9_8 \\
                 Coen Bron / On a Renewed Visit to the Banker and a
                 Remarkable Analogy / 76--82 /
                 doi:10.1007/978-1-4612-4476-9_9 \\
                 Manfred Broy / On Bounded Buffers: Modularity,
                 Robustness, and Reliability in Reactive Systems /
                 83--93 / doi:10.1007/978-1-4612-4476-9_10 \\
                 K. Mani Chandy, Stephen Taylor / Examples in Program
                 Composition / 94--101 /
                 doi:10.1007/978-1-4612-4476-9_11 \\
                 Albert J. Dijkstra / On the Mechanism of the
                 Hydrogenation of Edible Oils / 102--111 /
                 doi:10.1007/978-1-4612-4476-9_12 \\
                 W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, J.
                 Misra / The Problem of the Majority Network / 112--118
                 / doi:10.1007/978-1-4612-4476-9_13 \\
                 W. H. J. Feijen / A Little Exercise in Deriving
                 Multiprograms / 119--126 /
                 doi:10.1007/978-1-4612-4476-9_14 \\
                 A. J. M. van Gasteren / Experimenting with a Refinement
                 Calculus / 127--134 / doi:10.1007/978-1-4612-4476-9_15
                 \\
                 Mohamed G. Gouda / Serializable Programs,
                 Parallelizable Assertions: a Basis for Interleaving /
                 135--140 / doi:10.1007/978-1-4612-4476-9_16 \\
                 David Gries / Binary to Decimal, One More Time /
                 141--148 / doi:10.1007/978-1-4612-4476-9_17 \\
                 A. N. Habermann / Rotate and Double / 149--162 /
                 doi:10.1007/978-1-4612-4476-9_18 \\
                 Eric C. R. Hehner / Beautifying G{\"o}del / 163--172 /
                 doi:10.1007/978-1-4612-4476-9_19 \\
                 G. Helmberg / A Striptease of Entropy / 173--175 /
                 doi:10.1007/978-1-4612-4476-9_20 \\
                 Ted Herman / On a Theorem of Jacobson / 176--181 /
                 doi:10.1007/978-1-4612-4476-9_21 \\
                 Wim H. Hesselink / Modalities of Nondeterminacy /
                 182--192 / doi:10.1007/978-1-4612-4476-9_22 \\
                 C. A. R. Hoare / A Theory for the Derivation of C-MOS
                 Circuit Designs / 193--205 /
                 doi:10.1007/978-1-4612-4476-9_23 \\
                 Rob Hoogerwoord / On Mathematical Induction and the
                 Invariance Theorem / 206--211 /
                 doi:10.1007/978-1-4612-4476-9_24 \\
                 J. J. Horning / Formalizing Some Classic
                 Synchronization Primitives / 212--219 /
                 doi:10.1007/978-1-4612-4476-9_25 \\
                 Cliff B. Jones / Consequences / 220--225 /
                 doi:10.1007/978-1-4612-4476-9_26 \\
                 Anne Kaldewaij / Shortest and Longest Segments /
                 226--232 / doi:10.1007/978-1-4612-4476-9_27 \\
                 Donald E. Knuth / A Simple Program Whose Proof Isn't /
                 233--242 / doi:10.1007/978-1-4612-4476-9_28 \\
                 Vadim E. Kotov / Binding Structure and Behaviour in
                 ``Whole Net'' Concurrency Semantics / 243--250 /
                 doi:10.1007/978-1-4612-4476-9_29 \\
                 F. E. J. Kruseman Aretz / Maximal Strong Components: An
                 Exercise in Program Presentation / 251--261 /
                 doi:10.1007/978-1-4612-4476-9_30 \\
                 Christian Lengauer, Duncan G. Hudson / A Systolic
                 Program for Gauss--Jordan Elimination / 262--273 /
                 doi:10.1007/978-1-4612-4476-9_31 \\
                 J. H. van Lint / Coding for Channels with Localized
                 Errors / 274--279 / doi:10.1007/978-1-4612-4476-9_32
                 \\
                 Johan J. Lukkien, Jan L. A. van de Snepscheut /
                 Topology-Independent Algorithms Based on Spanning Trees
                 / 280--288 / doi:10.1007/978-1-4612-4476-9_33 \\
                 Zohar Manna, Amir Pnueli / An Exercise in the
                 Verification of Multi--Process Programs / 289--301 /
                 doi:10.1007/978-1-4612-4476-9_34 \\
                 Alain J. Martin / The Limitations to
                 Delay--Insensitivity in Asynchronous Circuits /
                 302--311 / doi:10.1007/978-1-4612-4476-9_35 \\
                 Jayadev Misra / A Simple Proof of a Simple Consensus
                 Algorithm / 312--318 / doi:10.1007/978-1-4612-4476-9_36
                 \\
                 Carroll Morgan / Of wp and {CSP} / 319--326 /
                 doi:10.1007/978-1-4612-4476-9_37 \\
                 Joseph M. Morris / Programming by Expression
                 Refinement: the {KMP} Algorithm / 327--338 /
                 doi:10.1007/978-1-4612-4476-9_38 \\
                 Greg Nelson / Methodical Competitive Snoopy--Caching /
                 339--345 / doi:10.1007/978-1-4612-4476-9_39 \\
                 Peter G. Neumann / Beauty and the Beast of Software
                 Complexity Elegance versus Elephants / 346--351 /
                 doi:10.1007/978-1-4612-4476-9_40 \\
                 W. Peremans / A Note on Feasibility / 352--355 /
                 doi:10.1007/978-1-4612-4476-9_41 \\
                 Karel A. Post / A Curious Property of Points and
                 Circles in the Plane / 356--357 /
                 doi:10.1007/978-1-4612-4476-9_42 \\
                 Paul Pritchard / A Problem Involving Subsequences /
                 358--364 / doi:10.1007/978-1-4612-4476-9_43 \\
                 Martin Rem / A Personal Perspective of the
                 Alpern--Schneider Characterization of Safety and
                 Liveness / 365--372 / doi:10.1007/978-1-4612-4476-9_44
                 \\
                 Fred B. Schneider / Simpler Proofs for Concurrent
                 Reading and Writing / 373--379 /
                 doi:10.1007/978-1-4612-4476-9_45 \\
                 Carel S. Scholten / Goodbye Junctivity? / 380--385 /
                 doi:10.1007/978-1-4612-4476-9_46 \\
                 Henk C. A. van Tilborg / An Assignment Problem for the
                 Vertices of a Cycle / 386--389 /
                 doi:10.1007/978-1-4612-4476-9_47 \\
                 D. A. Turner / Duality and De Morgan Principles for
                 Lists / 390--398 / doi:10.1007/978-1-4612-4476-9_48 \\
                 W. M. Turski / The Quest for Timeless Specifications
                 Leads to Non--Stepping Automata / 399--409 /
                 doi:10.1007/978-1-4612-4476-9_49 \\
                 Jan Tijmen Udding / The Maximum Length of a Palindrome
                 in a Sequence / 410--416 /
                 doi:10.1007/978-1-4612-4476-9_50 \\
                 Lincoln A. Wallen / On Form, Formalism and Equivalence
                 / 417--426 / doi:10.1007/978-1-4612-4476-9_51 \\
                 N. Wirth / Drawing Lines, Circles, and Ellipses in a
                 Raster / 427--434 / doi:10.1007/978-1-4612-4476-9_52
                 \\
                 Jaap van der Woude / Calculations with Relations, an
                 Example / 435--441 / doi:10.1007/978-1-4612-4476-9_53
                 \\
                 Heinz Zemanek / Two Proofs for Pythagoras / 442--447 /
                 doi:10.1007/978-1-4612-4476-9_54 \\
                 Anonymous / Back Matter / 448--453",
  xxnote =       "Contains important treatment of accurate
                 binary-to-decimal conversion
                 \cite{Gries:1990:BDO,Knuth:1990:SPW}.",
}

@Proceedings{Rishe:1990:PIC,
  editor =       "Naphtali Rishe and Sham Navathe and Doren Tal",
  booktitle =    "{PARBASE-90: International conference on databases,
                 parallel architectures, and their applications, March
                 7--9, 1990, Miami Beach, Florida: proceedings}",
  title =        "{PARBASE-90: International conference on databases,
                 parallel architectures, and their applications, March
                 7--9, 1990, Miami Beach, Florida: proceedings}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xiv + 570",
  year =         "1990",
  DOI =          "https://doi.org/10.1109/PARBSE.1990",
  ISBN =         "0-8186-2035-8 (hardcover), 0-8186-6035-X
                 (microfiche)",
  ISBN-13 =      "978-0-8186-2035-5 (paperback), 978-0-8186-6035-1
                 (microfiche)",
  LCCN =         "QA76.9.D3 P3473 199",
  bibdate =      "Mon Aug 1 15:32:31 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  abstract =     "Proceedings of the March 1990 meeting held in Miami
                 Beach, Florida. Thirty-three full papers and 50 short
                 papers were selected from almost 200.",
  acknowledgement = ack-nhfb,
  subject =      "Parallel Processing (Electronic Computers); Computers;
                 Systems Architecture; Distributed Systems and
                 Computing",
  tableofcontents = "Throttling and speculating on parallel
                 architectures / D. DeGroot / 2--4 \\
                 Efficient processing of distributed set queries / M. E.
                 El-Sharkawi, Y. Kambayashi / 6--13 \\
                 Range search in parallel using distributed data
                 structures / R. Sridhar, S. S. Iyengar, S.
                 Rajanarayanan / 14--19 \\
                 Supporting temporal capabilities in a multicomputer
                 database system / S. Karimi, M. Bassiouni, A. Orooji /
                 20--26 \\
                 Sorting and joining relations with duplicate attribute
                 values / M. Abdelguerfi, A. K. Sood / 30--36 \\
                 A parallel processing strategy for computing transitive
                 closure of a database relation / K.-C. Guh, J.
                 Charvarria / 37--43 \\
                 Graph modeling and analysis of linear recursive queries
                 / D. L. Lee, W. Lu / 44--53 \\
                 Scheduling on parallel processing systems using
                 parallel primitives / H.-A. Choi, B. Narahari, S.
                 Rotenstreich, A. Youssef / 56--65 \\
                 Dynamic scheduling of DOACROSS loops for
                 multiprocessors / V. P. Krothapalli, P. Sadayappan /
                 66--75 \\
                 Concurrent message passing in communicating sequential
                 processes / M. Ahuja, A. B. Sinha / 76--84 \\
                 Impact of large memory on the performance of optimistic
                 concurrency control schemes / P. S. Yu, D. M. Dias /
                 86--90 \\
                 Entity-relationship database support for real-time
                 adaptation / P. Gopinath, R. Ramnath, K. Schwan /
                 91--93 \\
                 Properties of physical storage models for
                 object-oriented databases / M. J. Willshire, H.-J. Kim
                 / 94--99 \\
                 Development of an efficient data structure for solving
                 semantic queries related to cartographic database / B.
                 B. Pal, S. Bhattacharya / 100--102 \\
                 The use of integrity constraints to perform query
                 transformations in relational databases / J. P. Cardiff
                 / 103--106 \\
                 Database partitioning techniques to support reload in a
                 main memory database system: MARS / L. Gruenwald, M. H.
                 Eich / 107--109 \\
                 Parallel function invocation in a dynamic
                 argument-fetching dataflow architecture / G. R. Gao, H.
                 H. J. Hum, Y.-B. Wong / 112--116 \\
                 Will 2D meshes replace hypercubes? S. Chittor, R.
                 Enbody / 117--119 \\
                 A reconfigurable real-time RISC computer system / D. P.
                 Gluch, B. Furht, G. Coville, J. Green, G. Heikkinen, C.
                 Raeuber, G. Spicker, A. Alberto, S. Correll, S. Geffin,
                 M. Guerrero, B. Routt, W. Sitterberg / 120--122 \\
                 New designs for priority queue machine / M. R. Meybodi
                 / 123--128 \\
                 A data flow architecture for parallel computation / P.
                 Abellard, G. Nolibe, N. Razafindrakoto / 129--131 \\
                 Prolog oriented architecture using RISC concepts / H.
                 A. Aboalsamh / 132--134 \\
                 Concept of checking integrity constraints in cellular
                 network relational databases / J. A. Chudziak /
                 136--138 \\
                 The multibackend database system (MDBS): a performance
                 study / J. E. Hall, D. K. Hsiao, M. N. Kamel / 139--143
                 \\
                 Effect of data compression hardware on the performance
                 of a relational database machine / N. Ranganathan, H.
                 N. Srinidhi / 144--146 \\
                 A vectorization technique of hashing and its
                 application to several sorting algorithms / Y. Kanada /
                 147--151 \\
                 Parallel transitive closure and transitive reduction
                 algorithms / P. Chang, L. J. Henschen / 152--154 \\
                 Time-space optimal parallel set operations / X. Guan,
                 M. A. Langston / 155--157 \\
                 Future architectures for information processing systems
                 / G. Wiederhold / 160--176 \\
                 Performing logical database design using an E-R graph
                 rewriting system / C. J. Breiteneder, T. Muck /
                 178--187 \\
                 Space efficient list merging on a multiprocessor ring /
                 A. F. Dickinson, R. K. Guha / 188--194 \\
                 A high speed KDL-RAM file system for parallel computers
                 / S. Pramanik, C. Severance, T. Rosenau / 195--203 \\
                 An optimal fault-tolerant broadcasting algorithm for a
                 cube-connected cycles multiprocessor / J. E. Jang /
                 206--215 \\
                 Fault-tolerant multiprocessor networks through an
                 extended G-network / J. Wu, E. B. Fernandez / 216--220
                 \\
                 Fault tolerance of message delivery with cascading
                 copies / H. Al-Jaber, S. Rotenstreich / 221--230 \\
                 Design considerations of a fault tolerance distributed
                 database system by inference technique / W. W. Chu, A.
                 Y. Hwang, H. Hecht, A. Tai / 232--232 \\
                 Inference techniques for fault tolerant distributed
                 database systems / W. W. Chu, A. Y. Hwang / 233--234
                 \\
                 Capture database semantics by rule induction / W. W.
                 Chu, R. C. Lee / 235--235 \\
                 Design and analysis of multiple-bus arbiters with
                 different priority schemes / Q. Yang, R. Ravi /
                 238--247 \\
                 Performance analysis of a cache-coherent multiprocessor
                 based on hierarchical multiple buses / Q. Yang /
                 248--257 \\
                 Analysis and simulation of multistage interconnection
                 networks under non-uniform traffic / S. Chalasani, A.
                 Varma / 258--265 \\
                 The outstanding problem for today's database technology
                 / N. Prabhakaran, C. K. Baru, D. S. Batory, D. K.
                 Hsiao, H. V. Jagadish, C. Pu, S. Navathe / 268--273 \\
                 An efficient multiprocessor merge algorithm / P. J.
                 Varman, B. R. Iyer, D. J. Haderle / 276--283 \\
                 Multidimensional Fourier transforms by systolic
                 architectures / T. D. Roziner / 284--292 \\
                 A perfect speedup parallel algorithm for the assignment
                 problem on complete weighted bipartite graphs / C. N.
                 K. Osiakwan, S. G. Akl / 293--301 \\
                 A theory of conjunction and concurrency / C. A. R.
                 Hoare / 304--309 \\
                 Concurrent access to B-trees / W. de Jonge, A. Schijf /
                 312--320 \\
                 2PC Agent method: achieving serializability in presence
                 of failures in a heterogeneous multidatabase / A.
                 Wolski, J. Veijalainen / 321--330 \\
                 Comparison of immediate-update and workspace
                 transactions: serializability and failure tolerance /
                 S. Turc / 331--340 \\
                 An architecture for parallel search of large, full-text
                 databases / N. Tavakoli, H. Modaress-Razavi / 342--349
                 \\
                 OSCAR: an architecture for weak-consistency replication
                 / A. R. Downing, I. B. Greenberg, J. M. Peha / 350--358
                 \\
                 Associative memory designs for VLSI implementation / B.
                 Parhami / 359--366 \\
                 An operational approach to the integration of
                 distributed heterogeneous environments / R. Gagliardi,
                 M. Caneve, G. Oldano / 368--377 \\
                 Object migration mechanisms to support updates in
                 object-oriented databases / M. E. El-Sharkawi, Y.
                 Kambayashi / 378--387 \\
                 Distributed heterogeneous information systems and
                 schema transformation / M. P. Papazoglou, L. Marinos,
                 N. G. Bourbakis / 388--397 \\
                 A machine-independent approach to parallel programming
                 / G. Riccardi, B. Traversat, U. Chandra / 400--407 \\
                 Implementation and evaluation of a parallel PMS
                 simulator / M. Rao, Z. Segall / 408--416 \\
                 Logic of knowledge and belief in the design of a
                 distributed integrity kernel / S. Ramanna, J. F.
                 Peters, E. A. Unger / 418--420 \\
                 Database design according to user views / G. Pernul, P.
                 Moser, G. Luef / 421--423 \\
                 A predicate-calculus based language for semantic
                 databases / N. Rishe / 424--429 \\
                 The architecture and implementation of ENLI:
                 example-based natural language-assisted interface / M.
                 E. El-Sharkawi, Y. Kambayashi / 430--432 \\
                 KIWIS: advanced knowledge-base environments for large
                 database systems / E. Laenens, D. Vermeir / 433--434
                 \\
                 A methodology for integration of binary-relationship
                 conceptual schemas / P. Shoval / 435--437 \\
                 Reverse data engineering of E-R-designed relational
                 schemas / F. Springsteel, C. Kou / 438--440 \\
                 Structured evaluation of database management systems /
                 G. L. Schaps, N. Rishe / 441--446 \\
                 A semantic database approach for tilings / N.
                 Prabhakaran, D. Tal, M. Lenart / 447--452 \\
                 VLSI parallel and distributed processing algorithms for
                 multidimensional discrete cosine transforms / Tze-Yun
                 Sung / 454--456 \\
                 Parallel image generation for a 3D display / T. A.
                 Theoharis, A. R. L. Travis, N. E. Wiseman / 457--459
                 \\
                 Optimization of distributed processing by using a
                 flexible data distribution mechanism / S. Jablonski, T.
                 Ruf, H. Wedekind / 460--462 \\
                 An efficient, reference weight-based garbage collection
                 method for distributed systems / H. Corporaal, T.
                 Veldman, A. J. van de Goor / 463--465 \\
                 Embedding shuffle networks in hypercubes / R.
                 Varadarajan / 466--468 \\
                 Choosing a leader on a hypercube / S. Robbins, K. A.
                 Robbins / 469--471 \\
                 On-the-fly processing of continuous data streams with a
                 pipeline of microprocessors / S. Berkovich, Z. Kitov,
                 A. Meltzer / 472--474 \\
                 Shape recognition on a parallel architecture / A. V.
                 Sahiner / 475--478 \\
                 Specification of synchronization by means of
                 constraints / C. Boksembaum, P. Mauran / 479--484 \\
                 Effect of different arbitration priority strategies on
                 throughput of a memory-coupled multiprocessor with HBO
                 / P. W. Dandekar, P. Reage, M. Chandwani, P. C. Sharma
                 / 485--487 \\
                 Distributed optimistic concurrency control for high
                 performance transaction processing / E. Rahm, A.
                 Thomasian / 490--495 \\
                 Optimization of response time in parallel pipelined
                 n-joins / N. Roussopoulos, L. Tong / 496--498 \\
                 The Entity System: distribution and persistence / S. C.
                 Crawley / 499--504 \\
                 Massively parallel implementation of two operations:
                 unification and inheritance / C. Constantinescu /
                 505--509 \\
                 Exploiting coarse grained parallelism in database
                 applications / A. S. Grimshaw, J. L. Pfaltz, J. C.
                 French, S. H. Son / 510--512 \\
                 A comparison of transaction restart techniques in a
                 distributed database environment / M. Rusinkiewicz, E.
                 L. Leiss, R. Dubash / 513--515 \\
                 On the design, implementation, and evaluation of a
                 portable parallel database system / O. Frieder, P.
                 Jackson / 516--518 \\
                 A parallel free-text search system with indexing / N.
                 Asokan, S. Ranka, O. Frieder / 519--521 \\
                 Performance evaluation of a new optimistic concurrency
                 control algorithm / J. Addess, E. Gudes, D. Tal, N.
                 Rishe / 522--525 \\
                 A vector dataflow architecture / H. Ahmed / 528--528
                 \\
                 The Siftsort algorithm / J. Bentin, J. J. Modi /
                 529--529 \\
                 Message-passing database machines / L. Bic / 530--530
                 \\
                 Extending n-version programming to concurrent software
                 / P. C. Buechler, E. B. Fernandez / 531--531 \\
                 Optimistic multi-level concurrency control for nested
                 typed objects / M. Cart, J. Ferrie, H. Richy / 532--532
                 \\
                 Conformance of Chinese text to Zipf's law / J. L.
                 Clark, K. T. Lua, J. McCallum / 533--533 \\
                 A parallel architecture for stock cutting problem / C.
                 H. Dagli, A. Hajakbari / 534--534 \\
                 Algorithm choice for multiple-query evaluation / M. H.
                 Kang, H. G. Dietz / 535--535 \\
                 Modeling interconnection networks using a hardware
                 description language / L. R. Freytag / 536--536 \\
                 Parallelism: using the right tool for the right
                 job-examples from database / O. Frieder / 537--538 \\
                 A view based near optimal design of pointer access
                 structures in relational databases / T. Gundem, E. F.
                 Ecklund / 539--539 \\
                 Semantic addressing / F. Hacquin / 540--540 \\
                 On modelling a type of communications in some
                 communications intensive applications / Y.-N. Huang /
                 541--541 \\
                 Parallel architectures and object-oriented databases /
                 J. G. Hughes / 542--542 \\
                 Reconfigurable systolic architectures for hashing / G.
                 Panneerselvam, G. A. Jullien, S. Bandyopadhyay, W. C.
                 Miller / 543--543 \\
                 Using SIMD parallelism to support rule-based systems /
                 N. N. Kamel / 544--544 \\
                 The semantics of commutativity in the execution of
                 concurrent transactions / L. Latour, R. Tindell /
                 545--545 \\
                 Logic approach of data models: data logic / T. Miura,
                 H. Arisawa / 546--546 \\
                 Structured data in structured logic programming
                 environment / S. Nurcan, J. Kouloumdjian / 547--547 \\
                 Parallel processing of deductive databases on a
                 commercial multiprocessor / M. Nussbaum, M. Annaratone,
                 R. Holliger / 548--548 \\
                 Distributed database architectures / M. P. Papazoglou /
                 549--549 \\
                 Molecular dynamics on transputer arrays / J. W. Perram,
                 H. G. Petersen / 550--550 \\
                 Parallel computing system with communication memory /
                 N. Petrova, V. Velev / 551--551 \\
                 Aftran: Array Fortran programming language / G. A.
                 Riccardi, U. Chandra, J. C. Vagi / 552--552 \\
                 A time-stamp based concurrency control mechanism for
                 redundant computing systems / K. Saisho, Y. Kambayashi
                 / 553--553 \\
                 Net hierarchies / U. Schiel / 554--554 \\
                 Extending and configuring the PRIMA database management
                 system kernel / H. Schoning, A. Sikeler / 555--555 \\
                 Extending object-oriented databases with rules / P.
                 Soupos, S. Goutas, D. Christodoulakis / 556--557 \\
                 Dynamic alternation between receiver-initiated and
                 sender-initiated load sharing / A. Svensson / 558--558
                 \\
                 An accelerating processor for relational operations /
                 H. Takeda, T. Satoh / 559--559 \\
                 Load balancing and multiprogramming in the Flagship
                 Parallel Reduction Machine / G. Tan, V. Woods /
                 560--560 \\
                 A comparison of scanning algorithms / C. van den Berg,
                 M. Kersten, K. Blom / 561--561 \\
                 Pipelining in query execution / A. N. Wilschut, P. M.
                 G. Apers / 562--562 \\
                 Transform a NIAM conceptual schema into a EKNE
                 relational database scheme / Y. Zhang, M. E. Orlowska /
                 563--563 \\
                 Real-time classification of chromosomes in slit scan
                 flow cytometry using NERV-a MIMD supercomputer / P.
                 Zuse, R. Hauser, R. Manner, M. Hausmann, C. Cremer /
                 564--564 \\
                 Use of mesh connected processors for realizing fault
                 tolerant relational database operations / S.
                 Chakravarthy, I. V. Ramakrishnan / 568--570 \\
                 PARBASE-90 International Conference on Databases,
                 Parallel Architectures and Their Applications (Cat.
                 No.90CH2728-4) / 0\_1",
  xxeditor =     "Naphtali Rishe and Sham Navathe and Doron Tal",
}

@Book{Hoare:1991:DCC,
  editor =       "C. A. R. Hoare",
  booktitle =    "Developments in Concurrency and Communication",
  title =        "Developments in Concurrency and Communication",
  publisher =    pub-AW,
  address =      pub-AW:adr,
  pages =        "xiv + 336",
  year =         "1991",
  ISBN =         "0-201-17232-1",
  ISBN-13 =      "978-0-201-17232-4",
  LCCN =         "QA76.58 .D48 1991",
  bibdate =      "Tue Dec 14 23:03:02 1993",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook2.bib",
  note =         prep-latex,
  acknowledgement = ack-mz,
  tableofcontents = "Programming in VLSI: from communicating processes
                 to delay-insensitive circuits / Alain J. Martin \\
                 Occam and the transputer / David May \\
                 Compiling occam in silicon / David May \\
                 Use of formal methods by a silicon manufacturer / David
                 May \\
                 Multicomputer / Charles L. Seitz \\
                 Specification and design of the X.25 protocol: a case
                 study in CSP / He Jifeng \\
                 Specifying security properties / J. L. Jacob \\
                 Transaction-processing primitives and CSP / J. C. P.
                 Woodcock \\
                 Algebraic specifications and proofs for communicating
                 sequential processes / C. A. R. Hoare \\
                 Design and proof of a mail service / C. A. R. Hoare and
                 He Jifeng \\
                 Proof of distributed algorithms: an exercise / K. Mani
                 Chandy and Jayadev Misra",
}

@Book{Gordon:1992:MRH,
  author =       "M. J. C. Gordon and Charles A. R. Hoare",
  booktitle =    "Mechanized reasoning and hardware design: a
                 discussion; (meeting held at the {Royal Society on 3
                 and 4 October 1991})",
  title =        "Mechanized reasoning and hardware design: a
                 discussion; (meeting held at the {Royal Society on 3
                 and 4 October 1991})",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "151",
  year =         "1992",
  ISBN =         "0-13-572405-8",
  ISBN-13 =      "978-0-13-572405-7",
  LCCN =         "TK7895.M5 M4 1992",
  bibdate =      "Wed Aug 10 17:40:23 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Prentice-Hall international series in computer
                 science",
  URL =          "http://www.gbv.de/dms/bowker/toc/9780135724057.pdf",
  acknowledgement = ack-nhfb,
  remark =       "Also in: Philosophical transactions of the Royal
                 Society of London, Ser. A, vol. 339.1992.",
  tableofcontents = "Designing chips that work / 3 \\
                 Will proof replace simulation? / 21 \\
                 A formal HDL and its use in the FM9001 verification /
                 35 \\
                 Using Nuprl for the verification and synthesis of
                 hardware / 49 \\
                 20BJ: a metalogical framework theorem prover based on
                 equational logic / 69 \\
                 Esterel on hardware / 87 \\
                 Automatic verification of sequential circuit designs /
                 105 \\
                 Dependent types and formal synthesis / 121 \\
                 Occam in the specification and verification of
                 microprocessors / 137",
}

@Proceedings{Kapur:1992:ADC,
  editor =       "Deepak Kapur",
  booktitle =    "{Automated deduction, CADE-11: 11th International
                 Conference on Automated Deduction, Saratoga Springs,
                 NY, USA, June 15--18, 1992: proceedings}",
  title =        "{Automated deduction, CADE-11: 11th International
                 Conference on Automated Deduction, Saratoga Springs,
                 NY, USA, June 15--18, 1992: proceedings}",
  volume =       "607",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 793",
  year =         "1992",
  DOI =          "https://doi.org/10.1007/3-540-55602-8",
  ISBN =         "3-540-55602-8",
  ISBN-13 =      "978-3-540-55602-2",
  LCCN =         "QA76.9.A96I57 1992",
  bibdate =      "Wed Oct 30 05:59:54 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/gnu.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathematica.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  confdate =     "15--18 June 1992",
  conflocation = "Saratoga Springs, NY, USA",
  pubcountry =   "Germany",
  tableofcontents = "The impossibility of the automation of logical
                 reasoning / Larry Wos / 1--3 \\
                 Automatic proofs in mathematical logic and analysis /
                 Kurt Ammon / 4--19 \\
                 Proving geometry statements of constructive type /
                 Shang-Ching Chou, Xiao-Shan Gao / 20--34 \\
                 The central variable strategy of str$\.+$ve / L. M.
                 Hines / 35--49 \\
                 Unification in the union of disjoint equational
                 theories: Combining decision procedures / Franz Baader,
                 Klaus U. Schulz / 50--65 \\
                 Reduction and unification in Lambda calculi with
                 subtypes / Tobias Nipkow, Zhenyu Qian / 66--78 \\
                 A combinatory logic approach to higher-order
                 E-unification (extended abstract) / Daniel J.
                 Dougherty, Patricia Johann / 79--93 \\
                 Cycle unification / Wolfgang Bibel, Steffen
                 H{\"o}lldobler, J{\"o}rg W{\"u}rtz / 94--108 \\
                 A parallel completion procedure for term rewriting
                 systems / Katherine A. Yelick, Stephen J. Garland /
                 109--123 \\
                 Grammar rewriting / David McAllester / 124--138 \\
                 Polynomial interpretations and the complexity of
                 algorithms / Adam Cichon, Pierre Lescanne / 139--147
                 \\
                 Uniform traversal combinators: Definition, use and
                 properties / Leonidas Fegaras, Tim Sheard, David
                 Stemple / 148--162 \\
                 Sorted unification using set constraints / Tom{\'a}s E.
                 Uribe / 163--177 \\
                 An abstract view of sorted unification / Alan M.
                 Frisch, Anthony G. Cohn / 178--192 \\
                 Unification in order-sorted algebras with overloading /
                 Alexandre Boudet / 193--207 \\
                 Puzzles and paradoxes / Raymond M. Smullyan / 208--208
                 \\
                 Experiments in automated deduction with condensed
                 detachment / William McCune, Larry Wos / 209--223 \\
                 Caching and lemmaizing in model elimination theorem
                 provers / Owen L. Astrachan, Mark E. Stickel / 224--238
                 \\
                 LIM+ challenge problems by RUE hyper-resolution /
                 Vincent J. Digricoli, Eugene Kochendorfer / 239--252
                 \\
                 Computing prime implicates incrementally / Peter
                 Jackson / 253--267 \\
                 Linear-input subset analysis / Geoff Sutcliffe /
                 268--280 \\
                 Theoretical study of symmetries in propositional
                 calculus and applications / Belaid Benhamou, Lakhdar
                 Sais / 281--294 \\
                 Difference matching / David Basin, Toby Walsh /
                 295--309 \\
                 Using middle-out reasoning to control the synthesis of
                 tail-recursive programs / Jane Hesketh, Alan Bundy,
                 Alan Smaill / 310--324 \\
                 The use of proof plans to sum series / Toby Walsh, Alex
                 Nunes, Alan Bundy / 325--339 \\
                 Disproving conjectures / Martin Protzen / 340--354 \\
                 An interval-based temporal logic in a multivalued
                 setting / Mathias Bauer / 355--369 \\
                 A normal form for first-order temporal formulae /
                 Michael Fisher / 370--384 \\
                 Semantic entailment in non classical logics based on
                 proofs found in classical logic / Ricardo Caferra,
                 St{\'e}phane Demri / 385--399 \\
                 Embedding negation as failure into a model generation
                 theorem prover / Katsumi Inoue, Miyuki Koshimura, Ryuzo
                 Hasegawa / 400--415 \\
                 Automated correctness proofs of machine code programs
                 for a commercial microprocessor / Robert S. Boyer, Yuan
                 Yu / 416--430 \\
                 Proving the Chinese remainder theorem by the cover set
                 induction / Hantao Zhang, Xin Hua / 431--445 \\
                 Automatic program optimization through proof
                 transformation / Peter Madden / 446--460 \\
                 Proof search theory and practice in the (former) USSR
                 (Tentative) / Grigori Mints / 461--461 \\
                 Basic paramodulation and superposition / Leo Bachmair,
                 Harald Ganzinger, Christopher Lynch, Wayne Snyder /
                 462--476 \\
                 Theorem proving with ordering constrained clauses /
                 Robert Nieuwenhuis, Albert Rubio / 477--491 \\
                 The special-relation rules are incomplete / Zohar
                 Manna, Richard Waldinger / 492--506 \\
                 An improved method for adding equality to free variable
                 semantic tableaux / Bernhard Beckert, Reiner H{\"a}hnle
                 / 507--521 \\
                 Proof search in the intuitionistic sequent calculus /
                 N. Shankar / 522--536 \\
                 Implementing the meta-theory of deductive systems /
                 Frank Pfenning, Ekkehard Rohwedder / 537--551 \\
                 Tactic-based theorem proving and knowledge-based
                 forward chaining: An experiment with Nuprl and Ontic /
                 Wilfred Z. Chen / 552--566 \\
                 Little theories / William M. Farmer, Joshua D. Guttman,
                 F. Javier Thayer / 567--581 \\
                 Some termination criteria for narrowing and E-narrowing
                 / Jim Christian / 582--588 \\
                 Decidable matching for convergent systems / Nachum
                 Dershowitz, Subrata Mitra, G. Sivakumar / 589--602 \\
                 Free sequentially in orthogonal order-sorted rewriting
                 systems with constructors / Delia Kesner / 603--617 \\
                 Programming with equations: A framework for lazy
                 parallel evaluation / R. C. Sekar, I. V. Ramakrishnan /
                 618--632 \\
                 A many sorted logic with possibly empty sorts / A. G.
                 Cohn / 633--647 \\
                 Theorem proving in non-standard logics based on the
                 inverse method / Andrei Voronkov / 648--662 \\
                 One more logic with uncertainty and resolution
                 principle for it / Konstantine Vershinin, Igor
                 Romanenko / 663--667 \\
                 A natural deduction automated theorem proving system /
                 Li Dafa / 668--672 \\
                 Isabelle-91 / Tobias Nipkow, Lawrence C. Paulson /
                 673--676 \\
                 The semantically guided linear deduction system / Geoff
                 Sutcliffe / 677--680 \\
                 The Shunyata system / Kurt Ammon / 681--685 \\
                 A geometry theorem prover for Macintoshes / Shang-Ching
                 Chou / 686--690 \\
                 FRI: Failure-resistant induction in RRL / Xin Hua,
                 Hantao Zhang / 691--695 \\
                 Herky: High performance rewriting in RRL / Hantao Zhang
                 / 696--700 \\
                 IMPS: System description / William M. Farmer, Joshua D.
                 Guttman, F. Javier Thayer / 701--705 \\
                 Proving equality theorems with hyper-linking / Geoffrey
                 D. Alexander, David A. Plaisted / 706--710 \\
                 Xpnet: A graphical interface to proof nets with an
                 efficient proof checker / Jawahar Chirimar, Carl A.
                 Gunter, Myra VanInwegen / 711--715 \\
                 &: Automated natural deduction / Dave Barker-Plummer,
                 Sidney C. Bailin, Andrew S. Merrill / 716--720 \\
                 An overview of Frapps 2.0: A framework for
                 resolution-based automated proof procedure systems /
                 Tom{\'a}s E. Uribe, Alan M. Frisch, Michael K. Mitchell
                 / 721--725 \\
                 The GAZER theorem prover / Dave Barker-Plummer, Alex
                 Rothenberg / 726--730 \\
                 ROO: A parallel theorem prover / Ewing L. Lusk, William
                 W. McCune, John Slaney / 731--734 \\
                 RVF: An automated formal verification system / T. C.
                 Wang, Allen Goldberg / 735--739 \\
                 KPROP An AND-parallel theorem prover for propositional
                 logic implemented in KL1 system abstract / Johann M.
                 Ph. Schumann / 740--742 \\
                 A report on ICL HOL / K. Blackburn / 743--747 \\
                 PVS: A prototype verification system / S. Owre, J. M.
                 Rushby, N. Shankar / 748--752 \\
                 The KIV system: Systematic construction of verified
                 software / Wolfgang Reif / 753--757 \\
                 The tableau-based theorem prover 3 T A P for
                 multiple-valued logics / Bernhard Beckert, Reiner
                 H{\"a}hnle, Stefan Gerberding, Werner Kernig / 758--760
                 \\
                 Analytica: A theorem prover in Mathematica / Edmund
                 Clarke, Xudong Zhao / 761--765 \\
                 The FAUST prover / Klaus Schneider, Ramayya Kumar,
                 Thomas Kropf / 766--770 \\
                 Eves system description / Dan Craigen, Sentot
                 Kromodimoeljo, Irwin Meisels, Bill Pase, Mark Saaltink
                 / 771--775 \\
                 MGTP: A parallel theorem prover based on lazy model
                 generation / Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi
                 Fujita / 776--780 \\
                 Benchmark problems in which equality plays the major
                 role / E. Lusk, L. Wos / 781--785 \\
                 Computing transitivity tables: A challenge for
                 automated theorem provers / D. A. Randell, A. G. Cohn,
                 Z. Cui / 786--790",
}

@Book{Roscoe:1994:CME,
  editor =       "A. W. Roscoe",
  booktitle =    "{{\em A Classical Mind}, essays in honour of C. A. R.
                 Hoare}",
  title =        "{{\em A Classical Mind}, essays in honour of C. A. R.
                 Hoare}",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xii + 451",
  year =         "1994",
  ISBN =         "0-13-294844-3",
  ISBN-13 =      "978-0-13-294844-9",
  LCCN =         "QA76.C484 1994",
  bibdate =      "Sun Dec 04 12:06:03 1994",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "1. Interaction Categories and Communicating
                 Sequential Processes / Samson Abramsky \\
                 2. Relational Program Derivation and Context-free
                 Language Recognition / Richard Bird and Oege de Moor
                 \\
                 3. Formal Model of Robots: Geometry and kinematics /
                 Dines Bj{\o}rner \\
                 4. Fair Communicating Processes / Stephen Brookes \\
                 5. Hiding and Behaviour: An institutional approach /
                 Rod Burstall and Razvan Diaconescu \\
                 6. Monitors Revisited / Ole-Johan Dahl \\
                 7. On the Design of Calculational Proofs / Edsger W.
                 Dijkstra \\
                 8. Proof of Correctness of Object Representations /
                 Joseph A. Goguen and Grant Malcolm \\
                 9. A Mechanized Hoare Logic of State Transitions / Mike
                 Gordon \\
                 10. Constant-space Quicksort / David Gries \\
                 11. From CSP to Hybrid Systems / He Jifeng \\
                 12. Abstractions of Time / Eric C. R. Hehner \\
                 13. Software Development Method / M. A. Jackson \\
                 14. Process Algebra Arguments about an Object-based
                 Design Notation / C. B. Jones \\
                 15. Bracket Notation for the `Coefficient of' Operator
                 / Donald E. Knuth / 247--258 \\
                 16. Implementing Coherent Memory / Butler W. Lampson
                 \\
                 17. How to Design a Parallel Computer / David May \\
                 18. Powerlist: A structure for parallel recursion /
                 Jayadev Misra \\
                 19. The Cuppest Capjunctive Capping, and Galois /
                 Carroll Morgan \\
                 20. The Advantages of Free Choice: A symmetric and
                 fully distributed solution for the dining philosophers
                 problem / Michael O. Rabin and Daniel Lehmann \\
                 21. Model-checking CSP / A. W. Roscoe \\
                 22. The Semantics of Id / J. E. Stoy \\
                 23. Correctness of Data Representations in Algol-like
                 Languages / R. D. Tennent \\
                 24. Software is History! / Jim Welsh \\
                 25. A Mean Value Calculus of Durations / Zhou Chaochen
                 and Li Xiaoshan",
}

@Proceedings{Broy:1996:DPD,
  editor =       "Manfred Broy",
  booktitle =    "Deductive program design: proceedings of the {NATO
                 Advanced Study Institute on Deductive Program Design,
                 held in Marktoberdorf, Germany, July 26--August 7,
                 1994}",
  title =        "Deductive program design: proceedings of the {NATO
                 Advanced Study Institute on Deductive Program Design,
                 held in Marktoberdorf, Germany, July 26--August 7,
                 1994}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 467",
  year =         "1996",
  ISBN =         "3-540-60947-4 (hardcover)",
  ISBN-13 =      "978-3-540-60947-6 (hardcover)",
  LCCN =         "QA76.9.D5 D38 1996",
  bibdate =      "Tue Aug 09 12:00:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "On Traditions in Marktoberdorf (Banquet Speech) /
                 F. B. Schneider \\
                 Fibonacci and the Greatest Common Divisor (EWD1077) /
                 E. W. Dijkstra \\
                 The Balance and the Coins (EWD1083) / E. W. Dijkstra
                 \\
                 Bulterman's Theorem on Shortest Trees (EWD1131) / E. W.
                 Dijkstra \\
                 A Prime is in at Most 1 Way the Sum of 2 Squares
                 (EWD1155a) / E. W. Dijkstra \\
                 A Bagatelle on Euclid's Algorithm (EWD1158) / E. W.
                 Dijkstra \\
                 On Two Equations that Have the Same Extreme Solution
                 (EWD1168) / E. W. Dijkstra \\
                 An Alternative of the ETAC to EWD1163 (EWD1169) / E. W.
                 Dijkstra \\
                 The Argument about the Arithmetic Mean and the
                 Geometric Mean, Heuristics Included (EWD1171) / E. W.
                 Dijkstra \\
                 Interaction Categories and the Foundations of Typed
                 Concurrent Programming / S. Abramsky, S. Gay and R.
                 Nagarajan \\
                 Mathematical Models for Computing Science / C. A. R.
                 Hoare \\
                 The Algebra of Programming / R. Bird and O. de Moor \\
                 Data Refinement and the Transform / D. Gries",
}

@Book{Hoare:1998:SCE,
  author =       "Tony Hoare and Jan A. Bergstra",
  booktitle =    "The science of computing and the engineering of
                 software",
  title =        "The science of computing and the engineering of
                 software",
  publisher =    "Nederlandse Organisatie voor Wetenschappelijke
                 Onderzoek",
  address =      "The Hague, The Netherlands",
  pages =        "50",
  year =         "1998",
  ISBN =         "????",
  ISBN-13 =      "????",
  bibdate =      "Sat Jul 30 15:33:14 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  note =         "Huygens Lecture.",
  acknowledgement = ack-nhfb,
  remark =       "No ISBN assigned. No tableofcontents data found.",
  subject =      "Computer science; Computer programming; Software
                 engineering; Electronic data processing; Informatique;
                 Programmation (Informatique); G{\'y}enie logiciel; data
                 processing.; computer science.; computer programming.;
                 Electronic data processing.; Computer programming.;
                 Computer science.; Software engineering.",
}

@Book{Hoare:1998:UTP,
  author =       "C. A. R. Hoare and Jifeng He",
  booktitle =    "Unifying Theories of Programming",
  title =        "Unifying Theories of Programming",
  publisher =    "Prentice Hall",
  address =      "London, UK",
  pages =        "xix + 298",
  year =         "1998",
  ISBN =         "0-13-458761-8 (paperback)",
  ISBN-13 =      "978-0-13-458761-5 (paperback)",
  LCCN =         "QA76.6.H5735 1998",
  bibdate =      "Tue Aug 9 12:11:12 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Prentice Hall Series in Computer Science",
  acknowledgement = ack-nhfb,
  subject =      "Computer programming; Programmation (Informatique);
                 computer programming.; Computer programming",
  tableofcontents = "0: Challenge of Unification \\
                 1: Logic of Engineering Design \\
                 2: Relations \\
                 3: Designs \\
                 4: Linking Theories \\
                 5: Algebra of Programs \\
                 6: Implementation \\
                 7: Concurrency \\
                 8: Communication \\
                 9: High Order Programming \\
                 10: Operational Semantics \\
                 App. 0: Alphabets \\
                 App. 1: Shared Variables \\
                 App. 2: Primitives \\
                 App. 3: Healthiness Conditions",
}

@Proceedings{Ryder:1999:PAS,
  editor =       "Barbara G. Ryder",
  booktitle =    "{Proceedings of the ACM SIGPLAN '99 Conference on
                 Programming Language Design and Implementation (PLDI
                 '99), Atlanta, Georgia, 2--4 May 1999}",
  title =        "{Proceedings of the ACM SIGPLAN '99 Conference on
                 Programming Language Design and Implementation (PLDI
                 '99), Atlanta, Georgia, 2--4 May 1999}",
  volume =       "34(5)",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "x + 304",
  year =         "1999",
  DOI =          "https://doi.org/10.1145/301618",
  ISBN =         "1-58113-094-5 (paperback), 1-58113-094-5 (e-book)",
  ISBN-13 =      "978-1-58113-094-2 (paperback), 978-1-58113-094-2
                 (e-book)",
  LCCN =         "QA76.7 .A35 1999",
  bibdate =      "Thu Apr 27 07:12:05 2000",
  bibsource =    "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html;
                 http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html;
                 http://www.cs.rutgers.edu/pldi99/program.html;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java.bib;
                 http://www.math.utah.edu/pub/tex/bib/sigplan1990.bib",
  series =       j-SIGPLAN,
  URL =          "https://dl.acm.org/doi/proceedings/10.1145/301618",
  acknowledgement = ack-nhfb,
  tableofcontents = "Cache-conscious structure layout / Trishul M.
                 Chilimbi, Mark D. Hill, and James R. Larus / 1--12 /
                 https://doi.org/10.1145/301618.301633 \\
                 Cache-conscious structure definition / Trishul M.
                 Chilimbi, Bob Davidson, and James R. Larus / 13--24 /
                 https://doi.org/10.1145/301618.301635 \\
                 A semantics for imprecise exceptions / Simon {Peyton
                 Jones}, Alastair Reid, Tony Hoare, Simon Marlow, and
                 Fergus Henderson / 25--36 /
                 https://doi.org/10.1145/301618.301637 \\
                 The design of a class mechanism for Moby / Kathleen
                 Fisher, John Reppy / 37--49 /
                 https://doi.org/10.1145/301618.301638 \\
                 What is a recursive module? / Karl Crary, Robert
                 Harper, Sidd Puri / 50--63 /
                 https://doi.org/10.1145/301618.301641 \\
                 Load-reuse analysis: design and evaluation / Rastislav
                 Bod{\'\i}k, Rajiv Gupta, Mary Lou Soffa / 64--76 /
                 https://doi.org/10.1145/301618.301643 \\
                 Pointer analysis for multithreaded programs / Radu
                 Rugina, Martin Rinard / 77--90 /
                 https://doi.org/10.1145/301618.301645 \\
                 Pointer analysis for programs with structures and
                 casting / Suan Hsi Yong, Susan Horwitz, Thomas Reps /
                 91--103 / https://doi.org/10.1145/301618.301647 \\
                 On bounding time and space for multiprocessor garbage
                 collection / Guy E. Blelloch, Perry Cheng / 104--117 /
                 https://doi.org/10.1145/301618.301648 \\
                 Support for garbage collection at every instruction in
                 a Java compiler / James M. Stichnoth, Guei-Yuan Lueh,
                 and Micha{\l} Cierniak / 118--127 /
                 https://doi.org/10.1145/301618.301652 \\
                 Storage assignment optimizations to generate compact
                 and efficient code on embedded DSPs / Amit Rao, Santosh
                 Pande / 128--138 /
                 https://doi.org/10.1145/301618.301653 \\
                 Enhanced code compression for embedded RISC processors
                 / Keith D. Cooper, Nathaniel McIntosh / 139--149 /
                 https://doi.org/10.1145/301618.301655 \\
                 Using node merging to enhance graph coloring / Steven
                 R. Vegdahl / 150--154 /
                 https://doi.org/10.1145/301618.301657 \\
                 Control CPR: a branch height reduction optimization for
                 EPIC architectures / Michael Schlansker, Scott Mahlke,
                 and Richard Johnson / 155--168 /
                 https://doi.org/10.1145/301618.301659 \\
                 A fast Fourier transform compiler / Matteo Frigo /
                 169--180 / https://doi.org/10.1145/301618.301661 \\
                 A new framework for debugging globally optimized code /
                 Le-Chun Wu, Rajiv Mirani, Harish Patil, Bruce Olsen,
                 and Wen-mei W. Hwu / 181--191 /
                 https://doi.org/10.1145/301618.301663 \\
                 A theory of type qualifiers / Jeffrey S. Foster, Manuel
                 F{\"a}hndrich, and Alexander Aiken / 192--203 /
                 https://doi.org/10.1145/301618.301665 \\
                 Static single assignment form for machine code / Allen
                 Leung, Lal George / 204--214 /
                 https://doi.org/10.1145/301618.301667 \\
                 New tiling techniques to improve cache temporal
                 locality / Yonghong Song, Zhiyuan Li / 215--228 /
                 https://doi.org/10.1145/301618.301668 \\
                 Improving cache performance in dynamic applications
                 through data and computation reorganization at run time
                 / Chen Ding, Ken Kennedy / 229--241 /
                 https://doi.org/10.1145/301618.301670 \\
                 Automatic inference of models for statistical code
                 compression / Christopher W. Fraser / 242--246 /
                 https://doi.org/10.1145/301618.301672 \\
                 Compressing Java class files / William Pugh / 247--258
                 / https://doi.org/10.1145/301618.301676 \\
                 Whole program paths / James R. Larus / 259--269 /
                 https://doi.org/10.1145/301618.301678 \\
                 Finite-state code generation / Christopher W. Fraser,
                 Todd A. Proebsting / 270--280 /
                 https://doi.org/10.1145/301618.301680 \\
                 Efficient incremental run-time specialization for free
                 / Renaud Marlet, Charles Consel, and Philippe Boinot /
                 281--292 / https://doi.org/10.1145/301618.301681 \\
                 An evaluation of staged run-time optimizations in DyC /
                 Brian Grant, Matthai Philipose, Markus Mock, Craig
                 Chambers, and Susan J. Eggers / 293--304 /
                 https://doi.org/10.1145/301618.301683",
}

@Proceedings{Davies:2000:MPC,
  editor =       "Jim Davies and A. W. Roscoe and Jim Woodcock",
  booktitle =    "{Millennial perspectives in computer science:
                 proceedings of the 1999 Oxford--Microsoft Symposium in
                 honour of Professor Sir Antony Hoare}",
  title =        "{Millennial perspectives in computer science:
                 proceedings of the 1999 Oxford--Microsoft Symposium in
                 honour of Professor Sir Antony Hoare}",
  publisher =    "Palgrave",
  address =      "Basingstoke, UK",
  pages =        "xiii + 416",
  year =         "2000",
  ISBN =         "0-333-92230-1",
  ISBN-13 =      "978-0-333-92230-9",
  LCCN =         "QA75.5 .O8 2000",
  bibdate =      "Fri Jan 13 15:27:47 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/mathcw.bib;
                 http://www.math.utah.edu/pub/tex/bib/prng.bib;
                 library.ox.ac.uk:210/ADVANCE",
  acknowledgement = ack-nhfb,
  remark =       "St. Catherine's College, Oxford, 13--15 September
                 1999.",
  subject =      "Computer science Congresses; computer science; Hoare",
  tableofcontents = "Preface / J. Woodcock \\
                 Concurrent Interaction Games / S. Abramsky \\
                 Program Optimisation Naturally / R. Bird, J. Gibbons
                 and G. Jones \\
                 The Binary Euclidean Algorithm / R. P. Brent \\
                 Domain Modelling / D. Bjorner Communicating Parallel
                 Processes / S. Brookes \\
                 Computing with Shapes / S. Cameron \\
                 Predicate Transformers for Competition / K. M. Chandy
                 and M. Charpentier \\
                 A Note on Monitor Versions / O.-J. Dahl \\
                 A Formula is Worth a Thousand Pictures / E. W. Dijkstra
                 \\
                 Linking Higher Order Logic to Binary Decision Diagrams
                 / M. Gordon \\
                 Substitution of Equals for Equals / D. Gries and F. B.
                 Schneider \\
                 Advanced Features of the Duration Calculus / H. Jifeng
                 and X. Qiwen \\
                 Formalism and the Variable / E. C. R. Hehner \\
                 The Real World / Michael Jackson \\
                 Compositionality, Inference and Concurrency / C. B.
                 Jones \\
                 Dancing Links / D. E. Knuth \\
                 The Transputer Revised / D. May \\
                 Principles of Language Design and Evolution / B. Meyer
                 \\
                 Computing and Communication --- What's the Difference?
                 / Robin Milner \\
                 Generating-functions of Interconnection Networks / J.
                 Misra \\
                 Probably Hoare? Hoare Probably! / C. Morgan, A. McIver
                 and J. W. Sanders \\
                 Distributed Computing: Opportunity, Challenge or
                 Misfortune? / R. M. Needham \\
                 A Linear-time Algorithm for Verifying MLL Proof Nets
                 via Essential Nets / A. S. Murawski and C.-H. L. Ong
                 \\
                 Intuitionistic Reasoning about Shared Mutable Data
                 Structure / J. C. Reynolds \\
                 The Successes and Failures of Behavioural Models / A.
                 W. Roscoe, G. M. Reed and R. Forster \\
                 The Algebra of Searching / M. Spivey and S. Seres \\
                 Modeless Structure Editing / B. Sufrin and O. de Moor
                 \\
                 A Chaos-free Failures-divergences Semantics with
                 Applications to Verification / A. Valmari \\
                 Records, Modules, Objects, Classes, Components / N.
                 Wirth Abstract \\
                 Data Types and Processes / J. Woodcock, J. Davies and
                 C. Bolton \\
                 A Higher-order Duration Calculus / Z. Chaochen, D. P.
                 Guelev and Z. Naijun",
}

@Proceedings{IEEE:2000:PSA,
  editor =       "{IEEE}",
  booktitle =    "{Proceedings Seventh Asia-Pacific Software Engeering
                 Conference. APSEC 2000}",
  title =        "{Proceedings Seventh Asia-Pacific Software Engeering
                 Conference. APSEC 2000}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xiv + 495",
  year =         "2000",
  ISBN =         "0-7695-0915-0, 0-7695-0916-9 (casebound),
                 0-7695-0917-7 (microfiche)",
  ISBN-13 =      "978-0-7695-0915-0, 978-0-7695-0916-7 (casebound),
                 978-0-7695-0917-4 (microfiche)",
  ISSN =         "1530-1362",
  ISSN-L =       "1530-1362",
  LCCN =         "QA76.758 .A77 2000",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Advanced OO Modeling: Metamodels and Notations /
                 Brian Henderson-Sellers \\
                 Beyond RUP / Brian Henderson-Sellers \\
                 Two-Stage Derivation of System Architectures / Fergus
                 O'Brien \\
                 Future of Software Engineering / Paul Layzell \\
                 Survivability Analysis of Networked Systems / Jeannette
                 M. Wing \\
                 Co-development of Real-Time Systems and Their
                 Environments / K. Kang, J. Lee and H. Kim \\
                 Reasoning about Real-Time Programs Using Idle-Invariant
                 Assertions / I. Hayes \\
                 Pareto-Based Soft Real-Time Task Scheduling in
                 Multiprocessor Systems / J. Oh, H. Bahn and C. Wu / [et
                 al.] \\
                 Transatlantic Project Courses in a University
                 Environment / B. Bruegge, A. Dutoit and R. Kobylinski /
                 [et al.] \\
                 Supporting Collaboration in Distributed Software
                 Engineering Teams / P. Layzell, O. Brereton and A.
                 French \\
                 Bloodshot Eyes: Workload Issues in Computer Science
                 Project Courses / J. Brown \\
                 LAST Project: Development of a Formal Method for
                 IS-Specification and of a CASE-Tool for IS-Design / J.
                 Jimenez and L. Jimenez \\
                 Process Logic for Distributed System Synthesis / Y.
                 Isobe and K. Ohmaki \\
                 Unifying Theories of Healthiness Condition / H. Jifeng
                 and C. Hoare \\
                 Verification of a Wireless ATM Medium-Access Protocol /
                 N. Sidorova and M. Steffen \\
                 Monitoring Facilities in Languages Supporting
                 Development of Concurrent Self-Measurement Programs /
                 Y. Nonaka, K. Ushijima and J. Cheng \\
                 Evaluation of Inspector's Defect Estimation Accuracy
                 for a Requirements Document after Individual Inspection
                 / S. Biffl, T. Grechenig and M. Kohle \\
                 Concept of Path-Closed Subsets and Its Use in Software
                 Functional Design / S. Kundu \\
                 Pragmatic Data Modeling and Design for End Users / C.
                 Churcher, T. McLennan and A. McKinnon \\
                 Requirements Engineering and Strategic Decision
                 Exploration: an Area for Interdisciplinary Research
                 /Analysis of the Impact of Reading Technique and
                 Inspector Capability on Individual Inspection
                 Performance / S. Biffl \\
                 Deriving Test Cases Using Class Vectors / K. Leung and
                 W. Wong \\
                 Checking Compositions of UML Sequence Diagrams for
                 Timing Inconsistency / X. Li and J. Lilius \\
                 Consistency Checks for UML / P. Krishnan \\
                 Support Tool for Highly Reliable Component-Based
                 Software Development / M. Matsumoto and K. Futarsugi
                 \\
                 Formal Specification of Catalysis Frameworks / J.
                 Filipe, K.-K. Lau and M. Ornaghi / [et al.] \\
                 Distributed Component Architecture for a Large
                 Telecommunication Application / H. Hermansson, M.
                 Johansson and L. Lundberg \\
                 Accessing Software Component Documentation during
                 Design: an Observational Study / A. Pohthong and D.
                 Budgen \\
                 Framework of Requirements Tracing Using UML / T.
                 Tsumaki and Y. Morisawa \\
                 Service-Based Software: The Future for Flexible
                 Software / K. Bennett, P. Layzell and D. Budgen / [et
                 al.] \\
                 Translating Descriptions of a Viewpoint among Different
                 Representations / N. Stanger \\
                 Fuzzy Concepts and Formal Methods: Some Illustrative
                 Examples / C. Matthews and P. Swatman \\
                 Integrated Framework with UML and Object-Z for
                 Developing a Precise Specification: The Light Control
                 Case Study / S.-K. Kim and D. Carrington \\
                 Semantic Model of a Small Typed Functional Language
                 Using Object-Z / W. Tan \\
                 [mu]-charts and Z: Examples and Extensions / G. Reeve
                 and S. Reeves \\
                 Fusing Ambiguous Domain Knowledge Slices in a Reverse
                 Engineering Process / Y. Li, H. Yang and W. Chu \\
                 Formal Approach to Program Modification / L. Groves \\
                 Comparative Evaluation of Techniques for Syntactic
                 Level Source Code Analysis / A. Cox and C. Clarke \\
                 Case Study of Horizontal Reuse in a Project-Driven
                 Organization / H. Christensen and H. Ron \\
                 PMF/GRIP: a Framework for the Development and
                 Implementation of Reuse Models / V. Schroeter \\
                 Adaptive Distributed Workflow System Framework / M.
                 Purvis, M. Purvis and S. Lemalu \\
                 Goal Based Agent-Oriented Software Modeling / K. Park,
                 J. Kim and S. Park \\
                 Issues in Object Orienting the ST Microelectronic
                 Manufacturing Model / V. Carchiolo, S. D'Ambra and A.
                 Longheu / [et al.] \\
                 Extending Statecharts with ad lib and Multi-Thread
                 Features / K. Leung \\
                 Enterprise Modeling Using Class and Instance Models /
                 R. Agarwal, G. Bruno and M. Torchiano \\
                 CIMO \\
                 Component Integration Model / Y. Xia, A. Ho and Y.
                 Zhang \\
                 Component-Based Application Development on Architecture
                 of a Model, UI and Components / T. Chusho, H. Ishigure
                 and N. Konda / [et al.] \\
                 Tailoring Test Process by Using the Component-Based
                 Development Paradigm and the XML Technology / J. Seo
                 and B. Choi \\
                 Reusable Integrated Components of Inter-related
                 Patterns for Software Development / D. Ram and M.
                 Sreekanth \\
                 Component-Based Software Engineering: Technologies,
                 Development Frameworks, and Quality Assurance / X. Cai,
                 M. Lyu and K.-F. Wong / [et al.] \\
                 Experiences in Systems Evolution: Practical Aspects and
                 Cautionary Tales / G. Hoffnagle \\
                 Selecting an Object-Oriented Process for Student
                 Analysts / G. Costain \\
                 Education Support System of Information System Design
                 and Implementation and Lessons Learned from Its
                 Application / A. Hazeyama, K. Osada and Y. Miyadera /
                 [et al.] \\
                 Implementation of a Software Engineering Course for
                 Computer Science Students / I. Crnkovic, M. Larsson and
                 F. Luders \\
                 Preliminary Comparison of Computer Mediated Training
                 Tools / J. Paynter, J. Ong and L. Frazer \\
                 Behavioral Specification of GOF Design Patterns with
                 LOTOS / M. Saeki \\
                 Combining Case-Based and Model-Based Reasoning: A
                 Formal Specification / L. Shuguang, J. Qing and C.
                 George \\
                 GUI and Testing Tool for SOFL / S. Liu, T. Fukuzaki and
                 K. Miyamoto \\
                 Third Generation OO Processes: a Critique of RUP and
                 OPEN from a Project Management Perspective / B.
                 Henderson-Sellers, R. Due and I. Graham / [et al.] \\
                 Creating a Process for Transitioning to Object
                 Technology / B. Henderson-Sellers and M. Serour \\
                 Framework for Risk Analysis in Software Engineering /
                 G. Roy and T. Woodings \\
                 Virtual Worlds for Web Site Visualization / D. Hartley,
                 N. Churcher and G. Albertson \\
                 Predicting Class Libraries Interface Evolution: An
                 Investigation into Machine Learning Approaches / H.
                 Sahraoui, A. Boukadoum and H. Lounis / [et al.] \\
                 Coherence Equals Cohesion \\
                 Or Does It? / V. Misic \\
                 Visualizing the Influence of Data Structure Choice on
                 the Performance of a Distributed System / C. Churcher,
                 A. McKinnon and R. Jarquin \\
                 Platforms for Agent-Oriented Software Engineering / M.
                 Nowostawski, G. Bush and M. Purvis / [et al.] \\
                 Study on Static Analysis in Network of Synchronizing
                 FSMs / J. Chen",
}

@Proceedings{Broy:2001:PTC,
  editor =       "Manfred Broy and Ernst Denert",
  booktitle =    "{Pioneers and Their Contributions to Software
                 Engineering: sd\&m Conference on Software Pioneers,
                 Bonn, June 28\slash 29, 2001, Original Historic
                 Contributions}",
  title =        "{Pioneers and Their Contributions to Software
                 Engineering: sd\&m Conference on Software Pioneers,
                 Bonn, June 28\slash 29, 2001, Original Historic
                 Contributions}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "vi + 569",
  year =         "2001",
  DOI =          "https://doi.org/10.1007/978-3-642-48354-7",
  ISBN =         "3-540-42290-0 (print), 3-642-48354-2 (e-book)",
  ISBN-13 =      "978-3-540-42290-7 (print), 978-3-642-48354-7
                 (e-book)",
  LCCN =         "QA76.758",
  bibdate =      "Wed Mar 18 16:02:44 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Friedrich (``Fritz'') Ludwig Bauer (10 June 1924--26
                 March 2015)",
  remark =       "Sonderausgabe: Buch nicht im Handel erh{\"a}ltlich
                 (special edition: book is not available in stores).
                 This conference was the last occasion at which Edsger
                 Dijkstra spoke publicly. He died 13 months later",
  subject =      "Computer science; Software engineering; Computer
                 science; Software engineering.",
  tableofcontents = "K. Samelson, F. L. Bauer / Sequentielle
                 Formel{\"u}bersetzung / 3 \\
                 Friedrich L. Bauer / Verfahren zur automatischen
                 Verarbeitung von kodierten Daten und Rechenmaschinen
                 zur Aus{\"u}bung des Verfahrens / 31 \\
                 Rudolf Bayer, E. McCreight / Organization and
                 Maintenance of Large Ordered Indexes / 43 \\
                 E. F. Codd / A Relational Model of Data for Large
                 Shared Data Banks / 63 \\
                 Barry Boehm / Software Engineering Economics / 101 \\
                 Fred Brooks, G. H. Mealy, B. I. Witt, W. A. Clark / The
                 Functional Structure of OS/360 / 153 \\
                 Peter Chen / The Entity Relationship Model --- Toward a
                 Unified View of Data / 207 \\
                 Ole-Johan Dahl, Kristen Nygaard / Class and Subclass
                 Declarations / 237 \\
                 Tom DeMarco / Structure Analysis and System
                 Specification / 257 \\
                 Edsger Dijkstra / Solution of a Problem in Concurrent
                 Programming Control / 291 \\
                 Edsger Dijkstra / Go To Statement Considered Harmful /
                 297 \\
                 Michael Fagan / Design and Code Inspections to Reduce
                 Errors in Program Development / 303 \\
                 Michael Fagan / Advances in Software Inspections / 337
                 \\
                 Erich Gamma, Richard Helm, Ralph Johnson, John
                 Vlissides / Design Patterns: Abstraction and Reuse of
                 Object-Oriented Design / 363 \\
                 John Guttag / Abstract Data Types and the Development
                 of Data Structures / 391 \\
                 C. A. R. Hoare / An Axiomatic Basis for Computer
                 Programming / 421 \\
                 C. A. R. Hoare / Proof of Correctness of Data
                 Representations / 441 \\
                 Michael Jackson / Constructive Methods of Program
                 Design / 455 \\
                 David L. Parnas / On the Criteria to Be Used in
                 Decomposing Systems into Modules / 481 \\
                 David L. Parnas / On a 'Buzzword': Hierarchical
                 Structure / 501 \\
                 Niklaus Wirth / The Programming Language Pascal / 517
                 \\
                 Niklaus Wirth / Program Development by Stepwise
                 Refinement / 547",
}

@Proceedings{Hoare:2001:ETS,
  editor =       "C. A. R. Hoare and Manferd Broy and Ralf
                 Steinbr{\"u}ggen",
  booktitle =    "Engineering Theories of Software Construction. {NATO
                 Science Series III: Computer and Systems Sciences.
                 Proceedings of the 2000 Marktoberdorf Summer School. 25
                 July--6 August 2000}",
  title =        "Engineering Theories of Software Construction. {NATO
                 Science Series III: Computer and Systems Sciences.
                 Proceedings of the 2000 Marktoberdorf Summer School. 25
                 July--6 August 2000}",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "ix + 357",
  year =         "2001",
  ISBN =         "1-58603-172-4 (IOS Press), 4-274-90435-0 (Ohmsha)",
  ISBN-13 =      "978-1-58603-172-5 (IOS Press), 978-4-274-90435-6
                 (Ohmsha)",
  LCCN =         "QA76.758 .E55 2001",
  bibdate =      "Tue Aug 09 12:38:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / vii \\
                 Problem Structure and Specification \\
                 Problem Analysis and Structure / 3 \\
                 Unifying Theories for Logic Programming / 21 \\
                 Tackling the Awkward Squad: Monadic Input/Output,
                 Concurrency, Exceptions, and Foreign-Language Calls in
                 Haskell / 47 \\
                 Adaptation in HOT Languages: Comparing Polymorphism,
                 Modules, and Objects / 97 \\
                 Modelling Reactive Systems \\
                 Programming for Behaviour / 135 \\
                 From States to Histories: Relating State and History
                 Views onto Systems / 149 \\
                 The [pi]-Calculus: An Introduction / 187 \\
                 Performance Modelling Using Probabilistic Process
                 Algebra / 223 \\
                 System and Program Verification \\
                 Taming the Infinite: Verification of Infinite-State
                 Reactive Systems by Finitary Means / 261 \\
                 Extended Static Checking / 301 \\
                 Software Model Checking / 309 \\
                 Author Index / 357",
}

@Book{BrinchHansen:2002:OCP,
  editor =       "Per {Brinch Hansen}",
  booktitle =    "The Origin of Concurrent Programming: From Semaphores
                 to Remote Procedure Calls",
  title =        "The Origin of Concurrent Programming: From Semaphores
                 to Remote Procedure Calls",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 534",
  year =         "2002",
  DOI =          "https://doi.org/10.1007/978-1-4757-3472-0",
  ISBN =         "0-387-95401-5, 1-4419-2986-X, 1-4757-3472-7,
                 1-4757-3472-7",
  ISBN-13 =      "978-0-387-95401-1, 978-1-4419-2986-0,
                 978-1-4757-3472-0, 978-1-4757-3473-7",
  LCCN =         "QA76.642 .O75 2002",
  bibdate =      "Thu Jul 21 15:50:51 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "http://link.springer.com/10.1007/978-1-4757-3472-0",
  abstract =     "One cannot build or understand a modern operating
                 system unless one knows the principles of concurrent
                 programming. This volume is a collection of 19 original
                 papers on the invention and origins of concurrent
                 programming, illustrating the major breakthroughs in
                 the field from the mid 1960s to the late 1970s. All of
                 them are written by the pioneers in concurrent
                 programming, including Brinch Hansen himself, and have
                 introductions added that summarize the papers and put
                 them in perspective. This anthology is an essential
                 reference for professional programmers, researchers,
                 and students of electrical engineering and computer
                 science. A familiarity with operating system principles
                 is assumed.",
  acknowledgement = ack-nhfb,
  subject =      "Programming Techniques",
  tableofcontents = "The invention of concurrent programming / Per
                 Brinch Hansen \\
                 Cooperating sequential processes \\
                 The structure of the multiprogramming system / Edsger
                 W. Dijkstra \\
                 RC 4000 software: multiprogramming system / Per Brinch
                 Hansen \\
                 Hierarchical ordering of sequential processes / Edsger
                 W. Dijkstra \\
                 Towards a theory of parallel programming / C. A. R.
                 Hoare \\
                 An outline of a course on operating system principles
                 \\
                 Structured multiprogramming \\
                 Shared classes / Per Brinch Hansen \\
                 Monitors: an operating system structuring concept / C.
                 A. R. Hoare \\
                 The programming language concurrent Pascal \\
                 The Solo operating system: a concurrent Pacal program
                 \\
                 The Solo operating system: processes, monitors and
                 classes \\
                 Design principles / Per Brinch Hansen \\
                 A synthesis emerging? / Edsger W. Dijkstra \\
                 Communicating sequential processes / C. A. R. Hoare \\
                 Distributed processes: a concurrent programming concept
                 \\
                 Joyce: a programming language for distributed systems
                 \\
                 SuperPascal: a publication language for parallel
                 scientific computing \\
                 Efficient parallel recursion / Per Brinch Hansen",
}

@Proceedings{IEEE:2002:AIC,
  editor =       "{IEEE}",
  booktitle =    "{26th Annual International Computer Software and
                 Applications Conference: 26--29 August 2002, Oxford,
                 England}",
  title =        "{26th Annual International Computer Software and
                 Applications Conference: 26--29 August 2002, Oxford,
                 England}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxiii + 1185",
  year =         "2002",
  DOI =          "https://doi.org/10.1109/CMPSAC.2002",
  ISBN =         "0-7695-1727-7 (paperback), 0-7695-1728-5 (case),
                 0-7695-1729-3 (microfiche)",
  ISBN-13 =      "978-0-7695-1727-8 (paperback), 978-0-7695-1728-5
                 (case), 978-0-7695-1729-2 (microfiche)",
  LCCN =         "QA76.6 I615 2002",
  bibdate =      "Mon Aug 1 15:21:36 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib",
  URL =          "http://ieeexplore.ieee.org/servlet/opac?punumber=8094",
  abstract =     "Collects the 172 papers presented during the August
                 2002 conference with the theme of ``Prolonging software
                 life: development and redevelopment.'' The main
                 subjects of the 38 sessions are component based
                 software development, software process, quality
                 control, testing, software evolution, web based
                 systems, formal methods, and management. Topics include
                 a distributed agent architecture for seaport
                 automation, using XML to integrate existing software
                 systems into the web, slice based dynamic memory
                 modeling, and object identification in legacy code as a
                 grouping problem. The four workshops address web
                 security, on-line upgrading of distributed systems,
                 cooperative support for distributed software
                 engineering processes, and data mining via granular and
                 rough computing.",
  acknowledgement = ack-nhfb,
  meetingname =  "COMPSAC (26th: 2002: Oxford, England)",
  subject =      "Computer programming; Congresses; Programming
                 languages (Electronic computers); Computer networks;
                 Programmation (Informatique); Congr{\'e}s; R{\'e}seaux
                 d'ordinateurs; Computer networks.; Computer
                 programming.; Programming languages (Electronic
                 computers)",
  tableofcontents = "26th Annual International Computer Software and
                 Applications Conference [front matter] / / iii--xviii
                 \\
                 Prolonging software life / T. M. S. Heng / 3--3 \\
                 Optimal resource allocation and reliability analysis
                 for component-based software applications / Jung-Hua
                 Lo, Sy-Yen Kuo, M. R. Lyu, Chin-Yu Huang / 7--12 \\
                 Process-oriented, consistent integration of software
                 components / R. Depke, G. Engels, S. Thone, M. Langham,
                 B. Lutkemeier / 13--18 \\
                 Open reuse of component designs in OPM/Web / I.
                 Reinhartz-Berger, D. Dori, S. Katz / 19--24 \\
                 Quantitative aspects of requirements evolution / S.
                 Anderson, M. Felici / 27--32 \\
                 Supporting evolution and maintenance of components
                 using a remote service architecture / S. Thomason, P.
                 Brereton / 33--38 \\
                 Requirements specification evolution in a
                 multi-perspective environment / A. B.
                 Barragans-Martinez, J. Garcia-Duque, J. J. Pazos-Arias,
                 A. Fernandez-Vilas, R. P. Diaz-Redondo / 39--44 \\
                 The software engineering global model / C. Toffolon, S.
                 Dakhli / 47--52 \\
                 Resource instantiation policies for software process
                 environments / C. A. L. Reis, R. Q. Reis, H. Schlebbe,
                 D. J. Nunes / 53--58 \\
                 Case study: componentization of an industrial control
                 system / F. Luders, I. Crnkovic, A. Sjogren / 67--74
                 \\
                 Requirements specification and architecture design for
                 Internet-based control systems / S. H. Yang, L. S. Tan,
                 X. Chen / 75--80 \\
                 Distributed agent architecture for port automation / T.
                 Thurston, Huosheng Hu / 81--87 \\
                 FORTEST: formal methods and testing / J. P. Bowen, K.
                 Bogdanov, J. A. Clark, M. Harman, R. M. Hierons, P.
                 Krause / 91--101 \\
                 Rights protection for digital contents redistribution
                 over the Internet / S. C. Cheung, H. Curreem / 105--110
                 \\
                 Internet emulation for Java applications through socket
                 factories / M. Avvenuti, A. Vecchio / 111--116 \\
                 Gigabit packet classification by using lookahead
                 caching / Pi-Chung Wang, Wei-Chun Tseng, Chia-Tai Chan,
                 Yaw-Chung Chen / 117--121 \\
                 Requirements driven quality control / S. Szejko /
                 125--130 \\
                 A fuzzy logic framework to improve the performance and
                 interpretation of rule-based quality prediction models
                 for OO software / H. A. Sahraoui, M. Boukadoum, H. M.
                 Chawiche, Gang Mai, M. Serhani / 131--138 \\
                 Application of hazard analysis to software quality
                 modelling / Hong Zhu, Yanlong Zhang, Qingning Huo, S.
                 Greenwood / 139--144 \\
                 A toolset for supporting UML static and dynamic model
                 checking / Wuwei Shen, K. Compton, J. Huggins /
                 147--152 \\
                 From MSC and UML to SDL / S. Bourduas, F. Khendek, D.
                 Vincent / 153--158 \\
                 Do actors call use cases?--solving the problems of
                 OOSE/UML use-case relationships / S. Isoda / 159--164
                 \\
                 Using XML to integrate existing software systems into
                 the Web / H. M. Sneed / 167--172 \\
                 XVIP: an XML-based video information processing system
                 / C. H. Ngai, P. W. Chan, E. Yau, M. R. Lyu / 173--178
                 \\
                 The cooperative web: a complement to the semantic web /
                 D. G. Avello, D. A. Gutierrez / 179--183 \\
                 Personalized redirection of communication / Yuping
                 Yang, M. H. Williams / 187--192 \\
                 Design and implementation of a network application
                 architecture for thin clients / Chia-Chen Kuo, Ping
                 Ting, Ming-Syan Chen, Jeng-Chun Chen / 193--198 \\
                 Distributed checkpointing using synchronized clocks /
                 S. Neogy, A. Sinha, P. K. Das / 199--204 \\
                 Case study: implementing a web based auction system
                 using UML and component-based programming / F. T.
                 Sheldon, K. Jerath, Young-Jik Kwon, Young-Wook Baik /
                 211--216 \\
                 A UML profile to support the formal presentation of
                 software architecture / A. Hudaib, C. Montangero /
                 217--223 \\
                 Transformation and integration method of scenarios / A.
                 Ohnishi, Zhang Hong Hui, H. Fujimoto / 224--229 \\
                 Development of situation-aware application software for
                 ubiquitous computing environments / S. S. Yau, Yu Wang,
                 F. Karim / 233--238 \\
                 On bootstrapping replicated CORBA applications / W.
                 Zhao, L. E. Moser, P. M. Melliar-Smith / 239--245 \\
                 Strategies for integration of a non-OO EIS and the J2EE
                 framework / Shengru Tu, Gongqin Li, P. Augustin /
                 246--251 \\
                 Closing the circle on software engineering
                 professionalism and free movement of labour / J. B.
                 Thompson / 255--264 \\
                 Towards an MDA-oriented methodology / M. P. Gervais /
                 265--270 \\
                 Reducing risks of widespread faults and attacks for
                 commercial software applications: towards diversity of
                 software components / M. Casassa Mont, A. Baldwin, Y.
                 Beres, K. Harrison, M. Sadler, S. Shiu / 271--276 \\
                 Requirement capturing and 3CR approach / S. Baranov, V.
                 Kotlyarov, J. Kapitonova, A. Letichevsky, V. Volkov /
                 279--283 \\
                 Constructing an EJB application in a WFMS / Jian-Wei
                 Wang, Ta-Chun Lin, Huai-Jong Hsu, Feng-Jian Wang /
                 284--286 \\
                 Suitability of evolutionary algorithms for evolutionary
                 testing / J. Wegener, A. Baresel, H. Sthamer / 287--289
                 \\
                 C program editor through voice input / M. Yamamoto /
                 290--292 \\
                 Preliminary case study on software reuse with object
                 persistency framework / H. Suganuma, N. Kijima, T. Nii,
                 K. Nakamura / 293--295 \\
                 Evaluating software maintenance cost using functional
                 redundancy metrics / T. Imai, Y. Kataoka, T. Fukaya /
                 299--306 \\
                 Measuring distance between program features / W. E.
                 Wong, S. S. Gokhale, J. R. Horgan / 307--312 \\
                 The quest for software components quality / M. Goulao,
                 F. Brito e Abreu / 313--318 \\
                 Adaptive scenario-based object-oriented test frameworks
                 for testing embedded systems / W. T. Tsai, Y. Na, R.
                 Paul, F. Lu, A. Saimi / 321--326 \\
                 Metamorphic testing of programs on partial differential
                 equations: a case study / T. Y. Chen, Jianqiang Feng,
                 T. H. Tse / 327--333 \\
                 Expanding an extended finite state machine to aid
                 testability / R. M. Hierons, T.-H. Kim, H. Ural /
                 334--339 \\
                 Are we at last seeing global movements towards software
                 engineering professionalism? / J. B. Thompson /
                 343--343 \\
                 The software engineering code of ethics and
                 professional practice: a case for being proactive / S.
                 Rogerson / 344--345 \\
                 Software engineering licenses in Texas / D. B. Simmons
                 / 346--346 \\
                 Software engineering professionalism: is the end of
                 constraints and conflicts in sight? / T. H. Tse /
                 347--348 \\
                 Slice-based dynamic memory modelling--a case study /
                 Yoga Sivagurunathan, Mark Harman, Bala Sivagurunathan /
                 351--356 \\
                 Program slicing via FermaT transformations / M. P. Ward
                 / 357--362 \\
                 A graphically based language for constructing,
                 executing and analysing models of software systems / R.
                 J. Walters / 363--369 \\
                 Early experiences on promoting explicit separation of
                 details to improve software process reusability / R.
                 Quites Reis, C. A. Lima Reis, H. Schlebbe, D. Jos Nunes
                 / 373--378 \\
                 A typed generic process model for product focused
                 process improvement / M. Satpathy, R. Harrison /
                 379--384 \\
                 A method to combine any process algebra with an
                 algebraic specification language: the /spl pi/-calculus
                 example / G. Salaun, M. Allemand, C. Attiogbe /
                 385--390 \\
                 The application of case-based reasoning to early Web
                 project cost estimation / E. Mendes, N. Mosley, S.
                 Counsell / 393--398 \\
                 Tolerating changes in a design psychology based web
                 page wrapper / Yang Li, Zhan Cui, Hongji Yang, H. C.
                 Jiau / 399--404 \\
                 Reliability assessment of web applications / V. S.
                 Alagar, O. Ormandjieva / 405--412 \\
                 Renaissance: a method to support software system
                 evolution / I. Warren, J. Ransom / 415--420 \\
                 Investigating large software system evolution: the
                 Linux kernel / E. Merlo, M. Dagenais, P. Bachand, J. S.
                 Sormani, S. Gradara, G. Antoniol / 421--426 \\
                 From system comprehension to program comprehension / C.
                 Tjortjis, N. Gold, P. Layzell, K. Bennett / 427--432
                 \\
                 Software application platforms: from product
                 architecture to integrated application strategy / M.
                 Saaksjarvi / 435--443 \\
                 A distributed architecture for cooperative and
                 adaptative multimedia applications / P. Roose, M.
                 Dalmau, F. Luthon / 444--449 \\
                 An architecture-based approach for component-oriented
                 development / Feng Chen, Qianxiang Wang, Hong Mei,
                 Fuqing Yang / 450--455 \\
                 Assertions in modern software engineering practice / T.
                 Hoare / 459--459 \\
                 Dependency analysis and visualization as tools to
                 prolong system life / D. McComb, S. Robe, S. Hoare, S.
                 Crawford-Hines / 463--465 \\
                 TRIZ for software process improvement / T. Stanbrook /
                 / 466--468 \\
                 A reusable software architecture model for manufactory
                 management information system / He Guo, Feng Chen,
                 Yuxin Wang, Yuanyuan Sun / 469--471 \\
                 Managing software quality with defects / D. N. Card /
                 472--474 \\
                 ToolManager: a tool for management of CASE tools / S.
                 R. B. Oliveira, A. M. L. de Vasconcelos, A. C. Rouiller
                 / 475--477 \\
                 An approach to identify duplicated web pages / G. A. Di
                 Lucca, M. Di Penta, A. R. Fasolino / 481--486 \\
                 Web document classification based on fuzzy association
                 / C. Haruechaiyasak, Mei-Ling Shyu, Shu-Ching Chen /
                 487--492 \\
                 Application assembly using Web services / J. van Zyl /
                 / 493--498 \\
                 Software as a service: a negotiation perspective / A.
                 Elfatatry, P. Layzell / 501--506 \\
                 Trust services: a framework for service-based solutions
                 / A. Baldwin, S. Shiu, M. C. Mont / 507--513 \\
                 Autonomous real-time navigation based on work load
                 situation in demand-oriented information service system
                 / T. Zenmyo, H. Arfaoui, K. Mori / 514--521 \\
                 Knowledge transfer from university to industry:
                 problems and lessons learned--an overview / S. Rogerson
                 / 525--525 \\
                 Knowledge transfer: what are we transferring and where
                 are we transferring it? / A. Adam / 526--527 \\
                 Knowledge transfer from university to industry:
                 problems and lessons learned / S. Szejko / 530--531 \\
                 Quality models reuse: experimentation on field / A.
                 Bianchi, D. Caivano, G. Visaggio / 535--540 \\
                 The method of software reliability growth models choice
                 using assumptions matrix / V. S. Kharchenko, O. M.
                 Tarasyuk, V. V. Sklyar, V. Yu. Dubnitsky / 541--546 \\
                 A persistent programming environment for teaching
                 object-oriented concepts / C. J. Harrison, O. M.
                 Sallabi / 547--554 \\
                 Component based system framework for dynamic B2B
                 interaction / Jinmin Hu, P. Grefen / 557--562 \\
                 Mining legacy systems for business components: an
                 architecture for an integrated toolkit / P. D. Johnson
                 / 563--571 \\
                 Control-driven coordination based assembling of
                 components / A. Chimaris, G. A. Papadopoulos / 572--577
                 \\
                 MADSS: a multi-agent based distributed scripting system
                 / Jim-Min Lin, Zeng-Wei Hong, Guo-Ming Fang / 581--586
                 \\
                 Extending applications using reflective assistant
                 agents / A. Di Stefano, G. Pappalardo, C. Santoro, E.
                 Tramontana / 587--594 \\
                 Supporting event based traceability through high-level
                 recognition of change events / J. Cleland-Huang, C. K.
                 Chang, Yujia Ge / 595--600 \\
                 WWM: a practical methodology for Web application
                 modeling / C. Kaewkasi, W. Rivepiboon / 603--608 \\
                 Developing Web-based applications through e-prototyping
                 / W.-G. Bleek, M. Jeenicke, R. Klischewski / 609--614
                 \\
                 A process for framework construction based on a pattern
                 language / R. T. V. Braga, P. C. Masiero / 615--620 \\
                 Defining the problems of framework reuse / D. Kirk, M.
                 Roper, M. Wood / 623--626 \\
                 An application framework for TCP/IP applications / A.
                 Kumazaki, M. Noro, Han-Myung Chang, Y. Hachisu /
                 627--634 \\
                 Design and implementation of the concurrency control
                 manager in the main-memory DBMS Tachyon / Sang-Wook
                 Kim, Wan Choi, Byoung-Ho Kim / 635--641 \\\ A formal
                 method for analyzing software architecture models in
                 SAM / Huiqun Yu, Xudong He, Yi Deng, Lian Mo / 645--652
                 \\
                 The semantics of extended SOFL / Jin Song Dong,
                 Shaoying Liu / 653--658 \ Formalizing incremental
                 design in real-time area: SCTL/MUS-T / A. F. Vilas, J.
                 J. P. Arias, R. P. D. Redondo, A. B. B. Martinez /
                 659--664 \\
                 MoCha: a middleware based on mobile channels / F.
                 Arbab, F. de Boer, J. G. Scholten, M. Bonsangue /
                 667--673 \\
                 Towards a software architecture for distributed and
                 mobile collaborative systems / S. Dustdar, H. Gall /
                 674--679 \\
                 A QoS-sensitive content adaptation system for mobile
                 computing / W. Y. Lum, F. C. M. Lau / 680--685 \\
                 Object identification in legacy code as a grouping
                 problem / H. Sahraoui, P. Valtchev, I. Konkobo,
                 Shiqiang Shen / 689--696 \\
                 Software maintainability improvement: integrating
                 standards and models / W. C. Chu, Chih-Wei Lu,
                 Chih-Hung Chang, Yeh-Ching Chung, Yueh-Min Huang,
                 Baowen Xu / 697--702 \\
                 Understanding SQL through iconic interfaces / L.
                 Aversano, G. Canfora, A. De Lucia, S. Stefanucci /
                 703--708 \\
                 Specification and verification of spatial data types
                 with B-Toolkit / Kim Yong Chun, Dang Van Hung /
                 711--716 \\
                 Toward efficient algorithms for generating compact
                 Petri nets from labeled transition systems / U. Buy, G.
                 Singal / 717--722 \\
                 A tableau-based procedure for model checking programs /
                 A. Santone, G. Vaglini / 723--728 \\
                 An investigation: reengineering sequential
                 procedure-driven software into object-oriented
                 event-driven software through UML diagrams / R. Millham
                 / 731--733 \\
                 Process diagnostics / V. S. Phanindra, M. Murugappan,
                 G. Keeni / 734--737 \\
                 Interaction-driven definition of e-business processes /
                 C. Zirpins, G. Piccinelli / 738--740 \\
                 Reviving Pacbase COBOL-generated code / J.-P. Bernardy
                 / 741--743 \\
                 A data collection case study supporting requirements
                 oriented prediction and management in software
                 developments / K. Boness, R. Harrison / 744--746 \\
                 Framework for goal driven system design / J.
                 Savolainen, J. Kuusela / 749--756 \\
                 A nested invocation suppression framework for active
                 replication fault-tolerant CORBA / Deron Liang,
                 Chen-Liang Fang, Chyouhwa Chen, JiChiang Tsai /
                 757--762 \\
                 A simple mathematically based framework for rule
                 extraction from an arbitrary programming language / F.
                 V. Ramsey, J. J. Alpigini / 763--770 \\
                 ContentP2P: a peer-to-peer content management system /
                 G. Canfora, S. Manzo, V. F. Rollo, M. L. Villani /
                 773--778 \\
                 An investigation of prediction models for project
                 management / D. Rodriguez, R. Harrison, M. Satpathy, J.
                 Dolado / 779--784 \\
                 A shared information system architecture for
                 integrating risk management tools: a case study /
                 Shaosong Xu, Hoh Peter In, M. S. Feather / 785--790 \\
                 SIFA: a scalable file system with intelligent file
                 allocation / Hsiao-Ping Tsai, Jiun-Long Huang,
                 Cheng-Ming Chao, Ming-Syan Chen, Cheen Liao / 793--798
                 \\
                 A file naming scheme using hierarchical-keywords / H.
                 Tada, O. Honda, M. Higuchi / 799--804 \\
                 Private information retrieval in the presence of
                 malicious failures / E. Y. Yang, Jie Xu, K. H. Bennett
                 / 805--810 \\
                 Engineering of computer based systems (ECBS), panel
                 introduction / S. F. White / 813--813 \\
                 Towards reusable and reconfigurable models for the WWW
                 / W. Buchanan, E. Brown / 814--815 \\
                 Component-based software engineering: Building systems
                 from software components / I. Crnkovic / 816--817 \\
                 HTML / Systemic issues in functional and
                 extra-functional performance / D. B. Mulcare / 818--819
                 \\
                 Temporal modeling of software test coverage / S.
                 Sedigh-Ali, A. Ghafoor, R. A. Paul / 823--828 \\
                 Hypothesis testing for module test in software
                 development / T. Yamaura, A. K. Onoma, Wei-Tek Tsai /
                 829--834 \\
                 Class specification implementation graphs and their
                 application in regression testing / S. Beydeda, V.
                 Gruhn / 835--840 \\
                 Concurrency control with Java and relational databases
                 / S. Soares, P. Borba / 843--849 \\
                 Using standard verifier to check secure information
                 flow in Java bytecode / C. Bernardeschi, N. De
                 Francesco, G. Lettieri / 850--855 \\
                 Generating a pattern-based application development
                 environment for Enterprise JavaBeans / I. Hammouda, K.
                 Koskimies / 856--864 \\
                 A log compression algorithm for operation-based version
                 control systems / Haifeng Shen, Chengzheng Sun /
                 867--872 \\
                 A dictionary-based compressed pattern matching
                 algorithm / Meng-Hang Ho, Hsu-Chun Yen / 873--878 \\
                 Parallel genetic algorithms with schema migration /
                 Baowen Xu, Yu Guan, Zhenqiang Chen, K. R. P. H. Leung /
                 / 879--884 \\
                 Multi-criteria preference analysis for systematic
                 requirements negotiation / H. P. In, D. Olson, T.
                 Rodgers / 887--892 \\
                 Enhanced intranet management in a DHCP-enabled
                 environment / Jenq-Haur Wang, Tzao-Lin Lee / 893--898
                 \\
                 Achieving scalability in hierarchical location services
                 / M. van Steen, G. Ballintijn / 899--904 \\
                 An investigation into the effects of code coupling on
                 team dynamics and productivity / J. W. Cain, R. J.
                 McCrindle / 907--913 \\
                 An effective content-based visual image retrieval
                 system / Xiuqi Li, Shu-Ching Chen, Mei-Ling Shyu, B.
                 Furht / 914--919 \\
                 New model and scheduling protocol for transactional
                 workflows / Ke Ding, Beihong Jin, Jun Wei, Yulin Feng /
                 / 920--927 \\
                 Web and information security / B. Thuraisingham, E.
                 Ferrari / 933--933 \ An application of directory
                 service markup language (DSML) for role-based access
                 control (RBAC) / Dongwan Shin, Gail-Joon Ahn, J. S.
                 Park / 934--939 \\
                 A Chinese Wall approach to privacy policies for the Web
                 / F. A. Lategan, M. S. Olivier / 940--944 \\
                 MaX: an access control system for digital libraries and
                 the Web / E. Bertino, E. Ferrari, A. Perego / 945--950
                 \\
                 Hybrid role hierarchy for generalized temporal role
                 based access control model / J. B. D. Joshi, E.
                 Bertino, A. Ghafoor / 951--956 \\
                 On the response policy of software decoys: Conducting
                 software-based deception in the cyber battlespace / J.
                 B. Michael / 957--962 \\
                 Data and applications security: developments and
                 directions / B. Thuraisingham / 963--965 \\
                 Placing the Chinese Walls on the boundary of
                 conflicts--analysis of symmetric binary relations / T.
                 Y. Lin / 966--971 \\
                 Dependable on-line upgrading of distributed systems /
                 A. Romanovsky, I. Smith / 975--976 \\
                 HTML /\ Online software upgrading: new research
                 directions and practical considerations / M. E. Segal /
                 / 977--981 \\
                 Online upgrades become standard / L. E. Moser, P. M.
                 Melliar-Smith, L. A. Tewksbury / 982--988 \\
                 Improving service availability via low-outage upgrades
                 / C. Dislis / 989--993 \\
                 Dynamic on-line object update in the Grumps system / H.
                 Evans / 994--999 \\
                 A structured approach to handling on-line interface
                 upgrades / C. Jones, A. Romanovsky, I. Welch /
                 1000--1005 \\
                 Using RAIC for dependable on-line upgrading of
                 distributed systems / Chang Liu, D. J. Richardson /
                 1006--1011 \\
                 The architecture of a dynamically updatable,
                 component-based system / R. P. Bialek / 1012--1016 \\
                 Metadata support for safe component upgrades / P. Brada
                 / 1017--1021 \\
                 Dynamically evolvable distributed systems / R. Pandey,
                 S. Malabarba, T. Stapko, B. Hashii / 1022--1027 \\
                 A case study of dependable software upgrade with
                 distributed components / J. J. Li, Xueshan Shan /
                 1028--1033 \\
                 A dynamic upgrade mechanism based on publish/subscribe
                 interaction / F. Van De Laar, M. R. V. Chaudron /
                 1034--1037 \\
                 Towards upgrading actively replicated servers
                 on-the-fly / M. Solarski, H. Meling / 1038--1043 \\
                 Workshop on cooperative supports for distributed
                 software engineering processes / G. Canfora, A. De
                 Lucia / 1047--1048 \\
                 Generalised environment for process management in
                 cooperative software engineering / M. Gaeta, P.
                 Ritrovato / 1049--1053 \\
                 FlowManager: a workflow management system based on
                 Petri nets / L. Aversano, A. Cimitile, P. Gallucci, M.
                 L. Villani / 1054--1059 \\
                 Applying workflow management to support massive
                 maintenance / L. Aversano, S. Betti, E. Pompella, S.
                 Stefanucci / 1060--1064 \\
                 A unified process support framework for global software
                 development / Jin Sa, E. Maslova / 1065--1070 \\
                 Tool support for distributed inspection / F. Lanubile,
                 T. Mallardo / 1071--1076 \\
                 Maintenance in joint software development / P. F. Tiako
                 / 1077--1080 \\
                 Active artefact management for distributed software
                 engineering / C. Boldyreff, D. Nutter, S. Rank /
                 1081--1086 \\
                 Designing a distributed software development support
                 system using a peer-to-peer architecture / S. Bowen, F.
                 Maurer / 1087--1092 \\
                 Palantir: coordinating distributed workspaces / A.
                 Sarma, A. van der Hoek / 1093--1097 \\
                 A decision model supporting cooperative work as an
                 experience package / M. T. Baldassarre, D. Caivano, C.
                 A. Visaggio, G. Visaggio / 1098--1103 \\
                 A model for selecting CSCW technologies for distributed
                 software maintenance teams in virtual organisations /
                 C. Tjortjis, G. Dafoulas, P. Layzell, L. Macaulay /
                 1104--1108 \\
                 An actor-oriented approach to distributed product
                 management systems / Ping Jiang, Q. Mair / 1109--1114
                 \\
                 MOTION: a peer-to-peer platform for mobile teamwork
                 support / E. Kirda, H. Gall, P. Fenkam, G. Reif /
                 1115--1117 \\
                 Process support and knowledge management for virtual
                 teams doing agile software development / S. Bowen, F.
                 Maurer / 1118--1120 \\
                 Foundations of data mining via granular and rough
                 computing / S. Tsumoto, T. Y. Lin, J. F. Peters /
                 1123--1124 \\
                 Theorize with data using rough sets / Z. Pawlak /
                 1125--1128 \\
                 Mining decision-rule preference model from rough
                 approximation of preference relation / R. Slowinski, S.
                 Greco, B. Matarazzo / 1129--1134 \\
                 A rough set approach to measuring information granules
                 / J. F. Peters, Z. Pawlak, A. Skowron / 1135--1139 \\
                 Software quality knowledge discovery: a rough set
                 approach / S. Ramanna, J. F. Peters, T. Ahn /
                 1140--1145 \\
                 Postprocessing of rule sets induced from a melanoma
                 data set / J. W. Grzymala-Busse, Z. S. Hippe /
                 1146--1151 \\
                 Issues in modeling for data mining / Tsau Young Lin /
                 1152--1157 \\
                 Association rules and non-classical logics / T. Murai,
                 M. Nakata, Y. Sato / 1158--1163 \\
                 Logic-based granular prototyping / A. Bargiela, W.
                 Pedrycz, K. Hirota / 1164--1169 \\
                 On similarity measures for cluster analysis in clinical
                 laboratory examination databases / S. Hirano, Xiaoguang
                 Sun, S. Tsumoto / 1170--1175 \\
                 Rule and matroid theory / S. Tsumoto / 1176--1181 \\
                 Author index / / 1182--1183",
}

@Proceedings{Broy:2003:MAL,
  editor =       "Manfred Broy and Markus Pizka",
  booktitle =    "Models, Algebras and Logic of Engineering Software",
  title =        "Models, Algebras and Logic of Engineering Software",
  volume =       "191",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "xi + 403",
  year =         "2003",
  ISBN =         "1-58603-342-5, 4-274-90589-6 (Ohmsha)",
  ISBN-13 =      "978-1-58603-342-2, 978-4-274-90589-6 (Ohmsha)",
  LCCN =         "QA76.76.D47 N37 2002",
  bibdate =      "Tue Aug 9 13:59:21 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO science series. Series III, Computer and systems
                 sciences",
  URL =          "http://books.google.com/books?id=TK1QAAAAYAAJ;
                 http://books.google.com/books?id=U6VQAAAAMAAJ;
                 http://catalog.hathitrust.org/api/volumes/oclc/53998323.html",
  acknowledgement = ack-nhfb,
  meetingname =  "NATO Advanced Study Institute on Models, Algebras and
                 Logic of Engineering Software (2002 : Marktoberdorf,
                 Germany)",
  subject =      "Computer software; Development; Congresses; Software
                 engineering; Mathematics; G{\'e}nie logiciel;
                 Congr{\'e}s; Logiciels; D{\'e}veloppement;
                 Math{\'e}matiques; Software engineering.; Development.;
                 Mathematics.",
  tableofcontents = "Unifying Models and Engineering Theories of
                 Composed Software Systems / Manfred Broy \\
                 Abstract Specification Theory: An Overview / Andrzej
                 Tarlecki \\
                 Unifying Theories of Parallel Programming / Jim
                 Woodcock \\
                 Algorithmic and Deductive Verification Methods for CTL
                 / Amir Pnueli and Yonit Kesten \\
                 Software Specification and Verification in Rewriting
                 Logic / Jose Meseguer \\
                 Exploiting Independence for Verification, Refinement
                 and Modularity / Shmuel Katz \\
                 On Translating Models and Properties / Shmuel Katz \\
                 Proving Theorems about Java and the JVM with ACL2 / J.
                 Strother Moore \\
                 Assertions / Tony Hoare \\
                 From Play-In Scenarios to Code: Capturing and Analyzing
                 Reactive Behavior / David Harel \\
                 Micromodels of Software / Daniel Jackson \\
                 Modeling and Verifying a Lego Car Using Hybrid I/O
                 Automata / Ansgar Fehnker, Frits Vaandrager and
                 Miaomiao Zhang",
}

@Book{Herbert:2004:CST,
  editor =       "Andrew Herbert and Karen Sp{\"a}rck Jones",
  booktitle =    "Computer Systems: Theory, Technology, and
                 Applications; a tribute to {Roger Needham}",
  title =        "Computer Systems: Theory, Technology, and
                 Applications; a tribute to {Roger Needham}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xvii + 338",
  year =         "2004",
  DOI =          "https://doi.org/10.1007/b97622",
  ISBN =         "0-387-20170-X",
  ISBN-13 =      "978-0-387-20170-2",
  LCCN =         "QA76.9.S88 H45 2004",
  bibdate =      "Mon Aug 1 14:54:14 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  abstract =     "An invited collection of peer-reviewed papers
                 surveying key areas of Roger Needham's distinguished
                 research career at Cambridge University and Microsoft
                 Research. From operating systems to distributed
                 computing, many of the world's leading researchers
                 provide insight into the latest concepts and
                 theoretical insights --- many of which are based upon
                 Needham's pioneering research work. A critical
                 collection of edited-survey research papers spanning
                 the entire range of Roger Needham's distinguished
                 scientific career, from operating systems to
                 distributed computing and security. Many of the world's
                 leading researchers survey their topics' latest
                 developments and acknowledge the theoretical
                 foundations of Needham's work. Introduction to book
                 written by Rick Rashid, Director of Microsoft Research
                 Worldwide.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / xi \\
                 Roger Needham: 50 + 5 Meeting Programme / xiii \\
                 Contributors / xv \\
                 Introduction: Roger Needham / Rick Rashid / 1 \\
                 1 On Access Control, Data Integration, and Their
                 Languages / Mart{\'\i}n Abadi / 9 \\
                 2 Protocol Analysis, Composability and Computation /
                 Ross Anderson, Michael Bond / 15 \\
                 3 Access Control in Distributed Systems / Jean Bacon,
                 Ken Moody / 21 \\
                 4 Implementing Condition Variables with Semaphores /
                 Andrew D. Birrell / 29 \\
                 5 Clumps, Clusters and Classification / Christopher M.
                 Bishop / 39 \\
                 6 How to Implement Unnecessary Mutexes / Mike Burrows /
                 51 \\
                 7 Bioware Languages / Luca Cardelli / 59 \\
                 8 The Economics of Open Systems / David D. Clark / 67
                 \\
                 9 From Universe to Global Internet / Jon Crowcroft / 73
                 \\
                 10 Needham--Schroeder Goes to Court / Dorothy E.
                 Denning / 77 \\
                 11 The Design of Reliable Operating Systems / Peter
                 Denning / 79 \\
                 12 An Historical Connection between Time-Sharing and
                 Virtual Circuits / Sandy Fraser / 85 \\
                 13 On Cross-Platform Security / Li Gong / 89 \\
                 14 Distributed Computing Economics / Jim Gray / 93 \\
                 15 The Titan Influence / David Hartley / 103 \\
                 16 Middleware? Muddleware? / Andrew Herbert / 109 \\
                 17 Grand Challenges for Computing Research / Tony Hoare
                 / 117 \\
                 18 Sentient Computing / Andy Hopper / 125 \\
                 19 Cyber Security in Open Systems / Anita Jones / 133
                 \\
                 20 Software Components: Only the Giants Survive /
                 Butler W. Lampson / 137 \\
                 21 Security Protocols: Who Knows What Exactly? / Peter
                 Landrock / 147 \\
                 22 Volume Rendering by Ray-Casting in Shear-Image Order
                 / Hugh C. Lauer, Yin Wu, Vishal Bhatia, Larry Seiler /
                 153 \\
                 23 A Conceptual Authorization Model for Web Services /
                 Paul J. Leach, Chris Kaler, Blair Dillaway, Praerit
                 Garg, Brian LaMacchia, Butler Lampson, John Manferdelli
                 Rick Rashid, John Shewchuk, Dan Simon, Richard Ward /
                 165 \\
                 24 The Trouble with Standards / E. Stewart Lee / 173
                 \\
                 25 Novelty in the Nemesis Operating System / Ian Leslie
                 / 177 \\
                 26 A Technology Transfer Retrospective / Roy Levin /
                 185 \\
                 27 An Optical LAN / Derek McAuley / 195 \\
                 28 What's in a Name? / Robin Milner / 205 \\
                 29 The Cryptographic Role of the Cleaning Lady / Bob
                 Morris / 211 \\
                 30 Real Time in a Real Operating System / Sape J.
                 Mullender, Pierre G. Jansen / 213 \\
                 31 Zen and the Art of Research Management / John
                 Naughton, Robert W. Taylor / 223 \\
                 32 The Descent of BAN / Lawrence C. Paulson / 225 \\
                 33 Brief Encounters / Brian Randell / 229 \\
                 34 Retrieval System Models: What's New? / Stephen
                 Robertson, Karen Sp{\"a}rck Jones / 237 \\
                 35 Slammer: An Urgent Wake-Up Call / Jerome H. Saltzer
                 / 243 \\
                 36 Caching Trust Rather Than Content / M.
                 Satyanarayanan / 249 \\
                 37 Least Privilege and More / Fred B. Schneider / 253
                 \\
                 38 Using Sharing to Simplify System Management /
                 Michael D. Schroeder / 259 \\
                 39 An RSA-Related Number-Theoretic Surprise / Gustavus
                 J. Simmons / 269 \\
                 40 Application-Private Networks / Jonathan M. Smith /
                 273 \\
                 41 Using the CORAL System to Discover Attacks on
                 Security Protocols / Graham Steel, Alan Bundy, Ewen
                 Denney / 279 \\
                 42 On the Role of Binding and Rate Adaptation in Packet
                 Networks / David Tennenhouse / 287 \\
                 43 Technologies for Portable Computing / Chuck Thacker
                 / 295 \\
                 44 Multiple Alternative Voting / David Wheeler / 305
                 \\
                 45 The Semiotics of Umbrellas / John Wilkes / 311 \\
                 46 Computers for Specialized Application Areas /
                 Maurice Wilkes / 317 \\
                 Computer Security? / Roger Needham / 319 \\
                 Roger Needham: Publications / Karen Sp{\"a}rck Jones /
                 327",
}

@Book{Owe:2004:OOF,
  editor =       "Olaf Owe and Stein Krogdahl and Tom Lyche",
  booktitle =    "From Object-Orientation to Formal Methods: Essays in
                 Memory of {Ole-Johan Dahl}",
  title =        "From Object-Orientation to Formal Methods: Essays in
                 Memory of {Ole-Johan Dahl}",
  volume =       "2635",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "2004",
  DOI =          "https://doi.org/10.1007/b96089",
  ISBN =         "3-540-21366-X, 3-540-39993-3 (e-book)",
  ISBN-13 =      "978-3-540-21366-6, 978-3-540-39993-3 (e-book)",
  LCCN =         "QA76.758",
  bibdate =      "Tue Aug 9 14:08:20 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer.com/10.1007/b96089",
  abstract =     "After Ole-Johan's retirement at the beginning of the
                 new millennium, some of us had thought and talked about
                 making a ``Festschrift'' in his honor. When Donald
                 Knuth took the initiative by sending us the first
                 contribution, the process began to roll! In early 2002
                 an editing group was formed, including Kristen Nygaard,
                 who had known Ole-Johan since their student days, and
                 with whom he had developed the Simula language. Then we
                 invited a number of prominent researchers familiar with
                 Ole-Johan to submit contributions for a book honoring
                 Ole-Johan on the occasion of his 70th birthday.
                 Invitees included several members of the IFIP 2.3
                 working group, a forum that Ole-Johan treasured and
                 enjoyed participating in throughout his career. In
                 spite of the short deadline, the response to the
                 invitations was overwhelmingly positive. The original
                 idea was to complete the book rather quickly to make it
                 a gift he could read and enjoy, because by then he had
                 had cancer for three years, and his health was
                 gradually deteriorating. Kristen had been regularly
                 visiting Ole-Johan, who was in the hospital at that
                 time, and they were working on their Turing award
                 speech. Ole-Johan was gratified to hear about the
                 contributions to this book, but modestly expressed the
                 feeling that there was no special need to undertake a
                 book project on his behalf. Peacefully accepting his
                 destiny, Ole-Johan died on June 29, 2002.",
  acknowledgement = ack-nhfb,
  series-editor = "Gerhard Goos and Juris Hartmanis and Jan {Van
                 Leeuwen}",
  tableofcontents = "A Biography of Ole-Johan Dahl \\
                 A Bibliography of Ole-Johan Dahl \\
                 The Birth of Object Orientation: the Simula Languages
                 \\
                 An Algebraic Theory of Actors and Its Application to a
                 Simple Object-Based Language \\
                 Towards Posit and Prove Calculi for Requirements
                 Engineering and Software Design \\
                 Distributed Concurrent Object-Oriented Software \\
                 Composing Hidden Information Modules over Inclusive
                 Institutions \\
                 Towards the Verifying Compiler \\
                 Object-Oriented Specification and Open Distributed
                 Systems \\
                 SIMULA and Super-Object-Oriented Programming \\
                 Efficient Coroutine Generation of Constrained Gray
                 Sequences \\
                 Consistency of Inheritance in Object-Oriented Languages
                 and of Static, ALGOL-like Binding \\
                 The Power of Abstraction, Reuse, and Simplicity: An
                 Object-Oriented Library for Event-Driven Design \\
                 Iterative Synthesis of Control Guards Ensuring
                 Invariance and Inevitability in Discrete-Decision Games
                 \\
                 Incremental Reasoning for Object Oriented Systems \\
                 Pure Type Systems in Rewriting Logic: Specifying Typed
                 Higher-Order Languages in a First-Order Logical
                 Framework \\
                 Building Optimal Binary Search Trees from Sorted Values
                 in O(N) Time",
}

@Proceedings{Abadi:2005:CCT,
  editor =       "Mart{\'\i}n Abadi and Luca de Alfaro",
  booktitle =    "{CONCUR 2005---concurrency theory: 16th International
                 Conference, CONCUR 2005, San Francisco, CA, USA, August
                 23--26, 2005, Proceedings}",
  title =        "{CONCUR 2005---concurrency theory: 16th International
                 Conference, CONCUR 2005, San Francisco, CA, USA, August
                 23--26, 2005, Proceedings}",
  volume =       "3653",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 578",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/11539452",
  ISBN =         "3-540-28309-9 (paperback), 3-540-31934-4 (e-book)",
  ISBN-13 =      "978-3-540-28309-6, 978-3-540-31934-4 (e-book)",
  LCCN =         "QA76.58 .I53 2005",
  MRclass =      "68U35 (68Q85)",
  MRnumber =     "2198072",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  abstract =     "This volume contains the papers presented at CONCUR
                 2005, the 16th International Conference on Concurrency
                 Theory. The purpose of the CONCUR series of conferences
                 is to bring together researchers,developers, and
                 students in order to advance the theory of concurrency
                 and to promote its applications. This year's conference
                 was in San Francisco, California, from August 23 to
                 August 26. We received 100 submissions in response to a
                 call for papers. Each submission was assigned to at
                 least three members of the Program Committee; in many
                 cases, reviews were solicited from outside experts. The
                 Program Committee discussed the submissions
                 electronically, judging them on their perceived
                 importance, originality, clarity, and appropriateness
                 to the expected audience. The Program Committee
                 selected 38 papers for presentation. Because of the
                 format of the conference and the high number of
                 submissions, many good papers could not be included.
                 Although submissions were read and evaluated, the
                 papers that appear in this volume may differ in form
                 and contents from the corresponding submissions. It is
                 expected that many of the papers will be further
                 revised and submitted to refereed archival journals for
                 publication.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Invited Lectures \\
                 Static Analysis Versus Model Checking for Bug Finding /
                 Dawson Engler / 1--1 \\
                 The Benefits of Exposing Calls and Returns / Rajeev
                 Alur / 2--3 \\
                 A Compositional Approach to the Stochastic Dynamics of
                 Gene Networks / Luca Cardelli / 4--4 \\
                 Contributed Papers \\
                 Games Other People Play / Christos H. Papadimitriou /
                 5--5 \\
                 Type-Directed Concurrency / Deepak Garg, Frank Pfenning
                 / 6--20 \\
                 Multiport Interaction Nets and Concurrency / Damiano
                 Mazza / 21--35 \\
                 Model Checking for $\pi$-Calculus Using Proof Search /
                 Alwen Tiu / 36--50 \\
                 A Game Semantics of the Asynchronous $\pi$-Calculus /
                 Jim Laird / 51--65 \\
                 Efficient On-the-Fly Algorithms for the Analysis of
                 Timed Games / Franck Cassez, Alexandre David, Emmanuel
                 Fleury, Kim G. Larsen, Didier Lime / 66--80 \\
                 Modal Logics for Timed Control / Patricia Bouyer,
                 Franck Cassez, Fran{\c{c}}ois Laroussinie / 81--94 \\
                 Timed Shuffle Expressions / C{\u{a}}t{\u{a}}lin Dima /
                 95--109 \\
                 A New Modality for Almost Everywhere Properties in
                 Timed Automata / Houda Bel Mokadem, B{\'e}atrice
                 B{\'e}rard, Patricia Bouyer, Fran{\c{c}}ois Laroussinie
                 / 110--124 \\
                 The Coarsest Congruence for Timed Automata with
                 Deadlines Contained in Bisimulation / Pedro R.
                 D'Argenio, Biniam Gebremichael / 125--140 \\
                 A Behavioural Pseudometric for Metric Labelled
                 Transition Systems / Franck van Breugel / 141--155 \\
                 On Probabilistic Program Equivalence and Refinement /
                 Andrzej S. Murawski, Jo{\"e}l Ouaknine / 156--170 \\
                 Probabilistic Anonymity / Mohit Bhargava, Catuscia
                 Palamidessi / 171--185 \\
                 Secrecy Despite Compromise: Types, Cryptography, and
                 the Pi-Calculus / Andrew D. Gordon, Alan Jeffrey /
                 186--201 \\
                 Timed Spi-Calculus with Types for Secrecy and
                 Authenticity / Christian Haack, Alan Jeffrey / 202--216
                 \\
                 Selecting Theories and Recursive Protocols / Tomasz
                 Truderung / 217--232 \\
                 Constraint Solving for Contract-Signing Protocols /
                 Detlef K{\"a}hler, Ralf K{\"u}sters / 233--247 \\
                 A Ground-Complete Axiomatization of Finite State
                 Processes in Process Algebra / Jos C. M. Baeten, Mario
                 Bravetti / 248--262 \\
                 Decomposition and Complexity of Hereditary History
                 Preserving Bisimulation on BPP / Sibylle Fr{\"o}schle,
                 S{\l}awomir Lasota / 263--277 \\
                 Bisimulations Up-to for the Linear Time Branching Time
                 Spectrum / David de Frutos Escrig, Carlos Gregorio
                 Rodr{\'\i}guez / 278--292 \\
                 Deriving Weak Bisimulation Congruences from Reduction
                 Systems / Roberto Bruni, Fabio Gadducci, Ugo Montanari,
                 Pawe{\l} Soboci{\'n}ski / 293--307 \\
                 SOS for Higher Order Processes / MohammadReza Mousavi,
                 Murdoch J. Gabbay, Michel A. Reniers / 308--322 \\
                 The Individual and Collective Token Interpretations of
                 Petri Nets / Robert Jan van Glabbeek / 323--337 \\
                 Merged Processes --- A New Condensed Representation of
                 Petri Net Behaviour / Victor Khomenko, Alex Kondratyev,
                 Maciej Koutny, Walter Vogler / 338--352 \\
                 Concurrent Clustered Programming / Vijay Saraswat,
                 Radha Jagadeesan / 353--367 \\
                 A Theory of System Behaviour in the Presence of Node
                 and Link Failures / Adrian Francalanza, Matthew
                 Hennessy / 368--382 \\
                 Comparing Two Approaches to Compensable Flow
                 Composition / Roberto Bruni, Michael Butler, Carla
                 Ferreira, Tony Hoare, Hern{\'a}n Melgratti, Ugo
                 Montanari / 383--397 \\
                 Transactions in RCCS / Vincent Danos, Jean Krivine /
                 398--412 \\
                 Two-Player Nonzero-Sum $\omega$-Regular Games /
                 Krishnendu Chatterjee / 413--427 \\
                 Games Where You Can Play Optimally Without Any Memory /
                 Hugo Gimbert, Wies{\l}aw Zielonka / 428--442 \\
                 On Implementation of Global Concurrent Systems with
                 Local Asynchronous Controllers / Blaise Genest /
                 443--457 \\
                 Defining Fairness / Hagen V{\"o}lzer, Daniele Varacca,
                 Ekkart Kindler / 458--472 \\
                 Regular Symbolic Analysis of Dynamic Networks of
                 Pushdown Systems / Ahmed Bouajjani, Markus
                 M{\"u}ller-Olm, Tayssir Touili / 473--487 \\
                 Termination Analysis of Integer Linear Loops / Aaron R.
                 Bradley, Zohar Manna, Henny B. Sipma / 488--502 \\
                 A Practical Application of Geometric Semantics to
                 Static Analysis of Concurrent Programs / Eric Goubault,
                 Emmanuel Haucourt / 503--517 \\
                 Verification of Qualitative $\mathbb{Z}$ Constraints /
                 St{\'e}phane Demri, R{\'e}gis Gascon / 518--532 \\
                 Uniform Satisfiability Problem for Local Temporal
                 Logics over Mazurkiewicz Traces / Paul Gastin, Dietrich
                 Kuske / 533--547 \\
                 Taming Interface Specifications / Tiziana Margaria, A.
                 Prasad Sistla, Bernhard Steffen, Lenore D. Zuck /
                 548--561 \\
                 Synthesis of Distributed Systems from Knowledge-Based
                 Specifications / Ron van der Meyden, Thomas Wilke /
                 562--576",
  xxpages =      "xxiv + 1280",
}

@Proceedings{Abdallah:2005:CSP,
  editor =       "Ali E. Abdallah and Cliff B. Jones and Jeff W.
                 Sanders",
  booktitle =    "{Communicating sequential processes. the first 25
                 years: symposium on the occasion of 25 years of CSP,
                 London, UK, July 7--8, 2004. Revised invited papers}",
  title =        "{Communicating sequential processes. the first 25
                 years: symposium on the occasion of 25 years of CSP,
                 London, UK, July 7--8, 2004. Revised invited papers}",
  volume =       "3525",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 320",
  year =         "2005",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/b136154",
  ISBN =         "3-540-25813-2 (paperback), 3-540-32265-5 (e-book)",
  ISBN-13 =      "978-3-540-25813-1 (paperback), 978-3-540-32265-8
                 (e-book)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.73.C75 S96 2004eb",
  bibdate =      "Thu Jun 2 09:16:18 MDT 2005",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       ser-LNCS,
  URL =          "http://www.springerlink.com/content/978-3-540-25813-1;
                 http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3525;
                 http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b136154",
  abstract =     "This volume, like the symposium CSP25 which gave rise
                 to it, commemorates the semi-jubilee of Communicating
                 Sequential Processes. 1 Tony Hoare's paper
                 ``Communicating Sequential Processes'' is today widely
                 regarded as one of the most influential papers in
                 computer science. To comm- orate it, an event was
                 organized under the auspices of BCS-FACS (the British
                 Computer Society's Formal Aspects of Computing Science
                 specialist group). CSP25 was one of a series of such
                 events organized to highlight the use of formal
                 methods, emphasize their relevance to modern computing
                 and promote their wider application. BCS-FACS is proud
                 that Tony Hoare presented his original ideas on CSP at
                 one of its first meetings, in 1978. The two-day event,
                 7-8 July 2004, was hosted by London South Bank
                 University's Institute for Computing Research, Faculty
                 of Business, Computing and Information Management. The
                 intention was to celebrate, reflect upon and look
                 beyond the first quarter-century of CSP's contributions
                 to computer science. The meeting examined the impact of
                 CSP on many areas stretching from semantics
                 (mathematical models for understanding concurrency and
                 communications) and logic (for reasoning about
                 behavior), through the design of parallel programming
                 languages (I/O, parallelism, synchronization and
                 threads) to applications varying from distributed
                 software and parallel computing to information
                 security, Web services and concurrent hardware
                 circuits. It included a panel discussion with panelists
                 Brookes, Hoare, de Roever and Roscoe (chaired by Jeff
                 Sanders), poster presentations by PhD students and
                 others, featured a fire alarm (requiring evacuation in
                 the rain!) and concluded with the presentation of a
                 fountain pen to Prof. Sir C. A. R. Hoare.",
  acknowledgement = ack-nhfb,
  keywords =     "C. A. R. (Charles Antony Richard) Hoare",
  remark =       "The symposium CSP25 \ldots{} commemorates the
                 semi-jubilee of \ldots{} Tony Hoare's paper
                 'Communicating sequential processes. Semantic
                 foundations --- Refinement and simulation --- Hardware
                 synthesis --- Transactions --- Concurrent programming
                 --- Linking theories --- Security --- Automated
                 development and model checking --- Industrial-strength
                 CSP",
  subject =      "CSP (Computer program language); Congresses; Parallel
                 programming (Computer science); Congresses; Sequential
                 processing (Computer Science); Congresses; Computer
                 programming; Congresses; Parallel processing
                 (Electronic computers); Congresses",
  tableofcontents = "Semantic Foundations \\
                 Retracing the Semantics of CSP / Stephen Brookes / 1
                 \\
                 Seeing Beyond Divergence / A. W. Roscoe / 15 \\
                 Refinement and Simulation \\
                 Process Algebra: A Unifying Approach / Tony Hoare / 36
                 \\
                 Linking Theories of Concurrency / He Jifeng / 61 \\
                 Hardware Synthesis \\
                 CSP, occam and Transputers / David May / 75 \\
                 Models for Data-Flow Sequential Processes / Mark B.
                 Josephs / 85 \\
                 Implementation of Handshake Components / Ad Peeters /
                 98 \\
                 Transactions \\
                 A Trace Semantics for Long-Running Transactions /
                 Michael Butler, Tony Hoare, Carla Ferreira / 133 \\
                 Practical Application of CSP and FDR to Software Design
                 / Jonathan Lawrence / 151 \\
                 Concurrent Programming \\
                 Communicating Mobile Processes / Peter H. Welch,
                 Frederick R. M. Barnes / 175 \\
                 Model-Based Design of Concurrent Programs / Jeff Magee,
                 Jeff Kramer / 211 \\
                 Linking Theories \\
                 Of Probabilistic wp and CSP --- and Compositionality /
                 Carroll Morgan / 220 \\
                 Order, Topology, and Recursion Induction in CSP / Mike
                 Reed / 242 \\
                 Security \\
                 Verifying Security Protocols: An Application of CSP /
                 Steve Schneider, Rob Delicata / 243 \\
                 Shedding Light on Haunted Corners of Information
                 Security / Peter Ryan / 264 \\
                 Automated Development and Model Checking \\
                 Operational Semantics for Fun and Profit / Michael
                 Goldsmith / 265 \\
                 On Model Checking Data-Independent Systems with Arrays
                 with Whole-Array Operations / Ranko Lazi{\'c}, Tom
                 Newcomb, A. W. Roscoe / 275 \\
                 Industrial-Strength CSP \\
                 Industrial-Strength CSP: Opportunities and Challenges
                 in Model-Checking / Sadie Creese / 292 \\
                 Applied Formal Methods --- From CSP to Executable
                 Hybrid Specifications / Jan Peleska / 293 \\
                 Author Index / 321",
}

@Proceedings{Broy:2005:ETS,
  editor =       "Manfred Broy and Johannes Gr{\"u}nbauer and David
                 Harel and Tony Hoare",
  booktitle =    "Engineering Theories of Software Intensive Systems",
  title =        "Engineering Theories of Software Intensive Systems",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "ix + 404",
  year =         "2005",
  DOI =          "https://doi.org/10.1007/1-4020-3532-2",
  ISBN =         "1-4020-3530-6 (hardcover), 1-4020-3531-4 (paperback),
                 1-4020-3532-2 (e-book), 1-280-28396-3",
  ISBN-13 =      "978-1-4020-3530-2 (hardcover), 978-1-4020-3531-9
                 (paperback), 978-1-4020-3532-6 (e-book),
                 978-1-280-28396-3",
  LCCN =         "QA76.758 .N385 2004",
  bibdate =      "Mon Aug 1 15:02:41 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  abstract =     "Software engineering has over the years been applied
                 in many different fields, ranging from
                 telecommunications to embedded systems in car and
                 aircraft industry as well as in production engineering
                 and computer networks. Foundations in software
                 technology lie in models allowing to capture
                 application domains, detailed requirements, but also to
                 understand the structure and working of software
                 systems like software architectures and programs. These
                 models have to be expressed in techniques based on
                 discrete mathematics, algebra and logics. However,
                 according to the very specific needs in applications of
                 software technology, formal methods have to serve the
                 needs and the quality of advanced software engineering
                 methods, especially taking into account security
                 aspects in Information Technology. This book presents
                 mathematical foundations of software engineering and
                 state-of-the-art engineering methods in their
                 theoretical substance in the step towards practical
                 applications to examine software engineering techniques
                 and foundations used for industrial tasks. The
                 contributions in this volume emerged from lectures of
                 the 25th International Summer School on Engineering
                 Theories of Software Intensive Systems, held at
                 Marktoberdorf, Germany from August 3 to August 15,
                 2004.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Part I. Architectures, design and interfaces: \\
                 Incremental software construction with refinement
                 diagrams / Ralph-Johan Back \\
                 Service-oriented systems engineering: specification and
                 design of services and layered architectures / Manfred
                 Broy \\
                 Interface-based design / Luca de Alfaro, Thomas A.
                 Henzinger \\
                 The dependent delegate dilemma / Betrand Meyer \\
                 Part II. System and program verification, model
                 checking and theorem proving: \\
                 Formalizing counterexample-driven refinement with
                 weakest preconditions / Thomas Ball \\
                 A mechanically checked proof of a comparator sort
                 algorithm / J. Strother Moore, Bishop Brock \\
                 Keys in formal verification / Amir Pnueli \\
                 On the utility of canonical abstraction / Mooly Sagiv,
                 Thomas W. Reps, Reinhard Wilhelm, Eran Yahav \\
                 Part III. Process algebras and experimental calculi:
                 \\
                 Process algebra: a unifying approach / Tony Hoare \\
                 Computation orchestration / Jayadev Misra \\
                 A tree semantics of an orchestration language / Tony
                 Hoare, Galen Menzel, Jayadev Misra \\
                 Part IV. Security, system development and special
                 aspects: \\
                 Model driven security / David Basin, J{\"u}rgen Doser,
                 Torsten Lodderstedt \\
                 Some challenges for system development: reactive
                 animation, smart play-out and olfaction / David Harel",
}

@Proceedings{Broy:2007:SSR,
  editor =       "Manfred Broy and Johannes Grunbauer and Tony Hoare",
  booktitle =    "Software System Reliability and Security",
  title =        "Software System Reliability and Security",
  volume =       "9",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "ix + 417",
  year =         "2007",
  ISBN =         "1-4294-9223-6 (e-book), 1-4337-0874-4, 1-58603-731-5
                 (hardcover)",
  ISBN-13 =      "978-1-4294-9223-2 (e-book), 978-1-4337-0874-9,
                 978-1-58603-731-4 (hardcover)",
  ISSN =         "1574-5589 (print), 1879-8284 (electronic)",
  ISSN-L =       "1574-5589",
  LCCN =         "QA76.76R44 S66",
  bibdate =      "Wed Aug 10 17:50:39 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO security through science series. D, Information
                 and communication security",
  URL =          "http://catdir.loc.gov/catdir/toc/fy0802/2007922976.html",
  abstract =     "To make communication and computation secure against
                 catastrophic failure and malicious interference, it is
                 essential to build secure software systems and methods
                 for their development. This book describes the ideas on
                 how to meet these challenges in software engineering.",
  acknowledgement = ack-nhfb,
  remark =       "Published in cooperation with NATO Public Diplomacy
                 Division. The contributions in this volume have emerged
                 from lectures of the 27th International Summer School
                 on Software System Reliability and Security, held at
                 Marktoberdorf from August 1 to August 13, 2006.",
  subject =      "Software para computadora; Confiabilidad; Congresos;
                 Seguridad inform{\'y}atica",
  tableofcontents = "Preface / v \\
                 Logics and Automata for Software Model-Checking /
                 Rajeev Alur and Swarat Chaudhuri / 1 \\
                 Specifying, Relating and Composing Object Oriented
                 Interfaces, Components and Architectures / Manfred Broy
                 / 22 \\
                 Using Invariants to Reason About Cryptographic
                 Protocols / Ernie Cohen / 73 \\
                 Verified Interoperable Implementations of Security
                 Protocols / Karthikeyan Bhargavan, C{\'e}dric Fournet,
                 Andrew D. Gordon and Stephen Tse / 87 \\
                 Compensable Transactions / Tony Hoare / 116 \\
                 Automata on Infinite Words and Their Applications in
                 Formal Verification / Orna Kupferman / 135 \\
                 Practical Principles for Computer Security / Butler
                 Lampson / 151 \\
                 Engineering Requirements for System Reliability and
                 Security / Axel van Lamsweerde / 196 \\
                 Pervasive Verification of Distributed Real-Time Systems
                 / Steffen Knapp and Wolfgang Paul / 239 \\
                 Verification and Synthesis of Reactive Programs / Amir
                 Pnueli / 298 \\
                 Security, Privacy, Usability and Reliability (SPUR) in
                 Mobile Networked Embedded Systems: The Case of Modern
                 Automobiles / K. Venkatesh Prasad and T.J. Giuli / 341
                 \\
                 A Verifying Compiler for a Multi-Threaded
                 Object-Oriented Language / K. Rustan, M. Leino and
                 Wolfram Schulte / 351 \\
                 Author Index / 417",
  xxtableofcontents = "Cover \\
                 Preface \\
                 Contents \\
                 Logics and Automata for Software Model-Checking \\
                 Specifying, Relating and Composing Object Oriented
                 Interfaces, Components and Architectures \\
                 Using Invariants to Reason About Cryptographic
                 Protocols \\
                 Verified Interoperable Implementations of Security
                 Protocols \\
                 Compensable Transactions \\
                 Automata on Infinite Words and Their Applications in
                 Formal Verification \\
                 Practical Principles for Computer Security \\
                 Engineering Requirements for System Reliability and
                 Security \\
                 Pervasive Verification of Distributed Real-Time Systems
                 \\
                 Verification and Synthesis of Reactive Programs \\
                 Security, Privacy, Usability and Reliability (SPUR) in
                 Mobile Networked Embedded Systems: The Case of Modern
                 Automobiles \\
                 A Verifying Compiler for a Multi-Threaded
                 Object-Oriented Language \\
                 Author Index",
  yytableofcontents = "Title page / i--iv (4 pages) \\
                 Preface / v--viii (4 pages) \\
                 Contents / ix--x (2 pages) \\
                 Logics and Automata for Software Model-Checking / 1--21
                 (21 pages) \\
                 Specifying, Relating and Composing Object Oriented
                 Interfaces, Components and Architectures / 22--72 (51
                 pages) \\
                 Using Invariants to Reason About Cryptographic
                 Protocols / 73--86 (14 pages) \\
                 Verified Interoperable Implementations of Security
                 Protocols / 87--115 (29 pages) \\
                 Compensable Transactions / 116--134 (19 pages) \\
                 Automata on Infinite Words and Their Applications in
                 Formal Verification / 135--150 (16 pages) \\
                 Practical Principles for Computer Security / 151--195
                 (45 pages) \\
                 Engineering Requirements for System Reliability and
                 Security / 196--238 (43 pages) \\
                 Pervasive Verification of Distributed Real-Time Systems
                 / 239--297 (59 pages) \\
                 Verification and Synthesis of Reactive Programs /
                 298--340 (43 pages) \\
                 Security, Privacy, Usability and Reliability (SPUR) in
                 Mobile Networked Embedded Systems: The Case of Modern
                 Automobiles / 341--350 (10 pages) \\
                 A Verifying Compiler for a Multi-Threaded
                 Object-Oriented Language / 351--416 (66 pages) \\
                 Author Index / 417--418 (2 pages)",
}

@Proceedings{Lenzerini:2008:PTS,
  editor =       "Maurizio Lenzerini and Domenico Lembo",
  booktitle =    "{Proceedings of the Twenty-Seventh ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS'08, Vancouver, BC, Canada, June
                 9--11, 2008}",
  title =        "{Proceedings of the Twenty-Seventh ACM
                 SIGMOD-SIGACT-SIGART Symposium on Principles of
                 Database Systems: PODS'08, Vancouver, BC, Canada, June
                 9--11, 2008}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xi + 313",
  year =         "2008",
  ISBN =         "1-60560-932-3, 1-60558-108-9",
  ISBN-13 =      "978-1-60560-932-4, 978-1-60558-108-8",
  LCCN =         "QA76.9.D3",
  bibdate =      "Fri Jun 20 13:10:29 MDT 2008",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib;
                 http://www.math.utah.edu/pub/tex/bib/pagerank.bib;
                 http://www.math.utah.edu/pub/tex/bib/pods.bib;
                 z3950.loc.gov:7090/Voyager",
  acknowledgement = ack-nhfb,
  tableofcontents = "PODS 2008 Symposium Organization / viii \\
                 PODS 2008 External Reviewers / ix \\
                 PODS 2008 Sponsors & Supporters / xi \\
                 Session 1: Invited Talk \\
                 Session Chair: Phokion Kolaitis (IBM Almaden Research
                 Center) \\
                 Curated Databases / Peter Buneman, James Cheney
                 (University of Edinburgh), Wang-Chiew Tan (University
                 of California at Santa Cruz), Stijn Vansummeren
                 (Hasselt University and Transnational University of
                 Limburg) / 1 \\
                 Session 2: Schema Mappings \\
                 Session Chair: Alin Deutsch (University of California,
                 San Diego) \\
                 The Recovery of a Schema Mapping: Bringing Exchanged
                 Data Back / Marcelo Arenas, Jorge P{\'e}rez, Cristian
                 Riveros (PUC Chile) / 13 \\
                 On the Complexity of Deriving Schema Mappings from
                 Database Instances / Pierre Senellart (INRIA Saclay -
                 {\^I}le-de-France \& Universit{\'e} Paris-Sud), Georg
                 Gottlob (Oxford University) / 23 \\
                 Towards a Theory of Schema-Mapping Optimization /
                 Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian
                 Popa (IBM Almaden Research Center) / 33 \\
                 Session 3: Best Newcomer Award \& Invited Tutorial / 1
                 \\
                 Session Chair: Leonid Libkin (University of Edinburgh)
                 \\
                 Best Newcomer Award: Evaluating Rank Joins with Optimal
                 Cost / Karl Schnaitter, Neok{\l}is Polyzotis
                 (University of California at Santa Cruz) / 43 \\
                 Invited Tutorial 1: Effective Characterizations of Tree
                 Logics / Miko{\l}aj Boja{\'n}czyk (Warsaw University) /
                 53 \\
                 Session 4: Mendelzon Test-of-Time Award \\
                 Session Chair: Catriel Beeri (Hebrew University) \\
                 The PODS Alberto O. Mendelzon Test-of-Time-Award 2008 /
                 / 67 \\
                 Session 5: Streaming Data \& Best Paper Award \\
                 Session Chair: Foto Afrati (National Technical
                 University of Athens) \\
                 Best Paper Award: Estimating PageRank on Graph Streams
                 / Atish Das Sarma (Georgia Institute of Technology),
                 Sreenivas Gollapudi, Rina Panigrahy (Microsoft
                 Research) / 69 \\
                 A Generic Flow Algorithm for Shared Filter Ordering
                 Problems / Zhen Liu, Srinivasan Parthasarathy, Anand
                 Ranganathan, Hao Yang (IBM T.J. Watson Research Center)
                 / 79 \\ Time-Decaying Aggregates in Out-of-order
                 Streams / Graham Cormode, Flip Korn (AT\&T Labs
                 Research), Srikanta Tirthapura (Iowa State University)
                 / 89 \\
                 Session 6: Uncertain \& Probabilistic Data \\
                 Session Chair: Val Tannen (University of Pennsylvania)
                 \\
                 Approximating Predicates and Expressive Queries on
                 Probabilistic Databases / Christoph Koch 99 \\
                 Incorporating Constraints in Probabilistic XML / Sara
                 Cohen, Benny Kimelfeld, Yehoshua Sagiv (The Hebrew
                 University of Jerusalem) / 109 \\
                 Query Evaluation with Soft-Key Constraints / Abhay Jha,
                 Vibhor Rastogi, Dan Suciu (University of Washington) /
                 119 \\
                 Session 7: Data Exchange \\
                 Session Chair: Georg Gottlob (Oxford University) \\
                 Answering Aggregate Queries in Data Exchange / Foto
                 Afrati (National Technical University of Athens),
                 Phokion G. Kolaitis (IBM Almaden Research Center) / 129
                 \\
                 Data Exchange and Schema Mappings in Open and Closed
                 Worlds / Leonid Libkin, Cristina Sirangelo (University
                 of Edinburgh) / 139 \\
                 The Chase Revisited / Alin Deutsch (University of
                 California at San Diego), Alan Nash (IBM Research
                 Almaden), Jeff Remmel (University of California at San
                 Diego) / 149 \\
                 Session 8: Data Quality (including Invited Tutorial 2)
                 \& Data Privacy \\
                 Session Chair: Dan Suciu (Microsoft \& University of
                 Washington) \\
                 Invited Tutorial 2: Dependencies Revisited for
                 Improving Data Quality / Wenfei Fan (University of
                 Edinburgh \& Bell Laboratories) / 159 \\
                 Epistemic Privacy / 171 \\
                 Alexandre Evfimievski, Ronald Fagin, David Woodruff
                 (IBM Almaden Research Center) \\
                 Session 9: Searching \& Clustering \\
                 Session Chair: Christoph Koch (Cornell University) \\
                 On Searching Compressed String Collections
                 Cache-Obliviously / Paolo Ferragina, Roberto Grossi
                 (Universit{\`a} di Pisa), Ankur Gupta (Butler
                 University), Rahul Shah (Louisiana State University),
                 Jeffrey Scott Vitter (Purdue University) / 181 \\
                 Approximation Algorithms for Clustering Uncertain Data
                 / Graham Cormode (AT\&T Labs Research), Andrew McGregor
                 (University of California at San Diego) / 191 \\
                 Approximation Algorithms for Co-Clustering / Aris
                 Anagnostopoulos, Anirban Dasgupta, Ravi Kumar (Yahoo!
                 Research) / 201 \\
                 The Power of Two Min-Hashes for Similarity Search among
                 Hierarchical Data Objects / Sreenivas Gollapudi, Rina
                 Panigrahy (Microsoft Research) / 211 \\
                 Session 10: Data \& Services \\
                 Session Chair: Jianwen Su (University of California at
                 Santa Barbara) \\
                 Static Analysis of Active XML Systems / Serge Abiteboul
                 (INRIA-Saclay \& University Paris Sud), Luc Segoufin
                 (INRIA \& LSV - ENS Cachan), Victor Vianu (University
                 of California at San Diego) / 221 \\
                 Complexity and Composition of Synthesized Web Services
                 / Wenfei Fan (University of Edinburgh \& Bell
                 Laboratories), Floris Geerts (University of Edinburgh),
                 Wouter Gelade, Frank Neven (Hasselt University \&
                 Transnational University of Limburg), Antonella Poggi
                 (Sapienza Universit{\`a} di Roma) / 231 \\
                 Session 11: XML \& Hierarchical Data \\
                 Session Chair: Marcelo Arenas (Pontifical Catholic
                 University of Chile) \\
                 XPath Evaluation in Linear Time / Miko{\l}aj
                 Boja{\'n}czyk, Pawe{\l} Parys (Warsaw University) / 241
                 \\
                 XPath, Transitive Closure Logic, and Nested Tree
                 Walking Automata / Balder ten Cate (Universiteit van
                 Amsterdam), Luc Segoufin (INRIA) / 251 \\
                 Local Hoare Reasoning about DOM / Philippa A. Gardner,
                 Gareth D. Smith, Mark J. Wheelhouse, Uri D. Zarfaty
                 (Imperial College London) / 261 \\
                 Annotated XML: Queries and Provenance / J. Nathan
                 Foster, Todd J. Green, Val Tannen (University of
                 Pennsylvania) / 271 \\
                 Session 12: Query Processing \& Optimization \\
                 Session Chair: Graham Cormode (AT\&T Labs) \\
                 Near-Optimal Dynamic Replication in Unstructured
                 Peer-to-Peer Networks / Mauro Sozio, Thomas Neumann,
                 Gerhard Weikum (Max-Planck-Institut f{\"u}r Informatik)
                 / 281 \\
                 Type Inference for Datalog and Its Application to Query
                 Optimisation / Oege de Moor, Damien Sereni, Pavel
                 Avgustinov, Mathieu Verbaere (Semmle Ltd.) / 291 \\
                 Shape Sensitive Geometric Monitoring / Izchak Sharfman,
                 Assaf Schuster (Technion), Daniel Keren (Haifa
                 University) / 301 \\
                 Tree-Width and Functional Dependencies in Databases /
                 Isolde Adler (Humboldt Universit{\"a}t) / 311 \\
                 Author Index / 320",
  xxISBN =       "1-59593-685-8",
  xxisbn-13 =    "978-1-59593-685-1",
  xxnote =       "There is library confusion about the ISBN: I found
                 1-60558-152-6 (tagged invalid in catalog),
                 1-605-60932-3, 1-59593-685-9, 1-59593-685-X (invalid
                 checksum).",
}

@Proceedings{Meyer:2008:VST,
  editor =       "Bertrand Meyer and Jim Woodcock",
  booktitle =    "Verified Software: Theories, Tools, Experiments: First
                 {IFIP TC 2\slash WG 2.3 Conference, VSTTE 2005, Zurich,
                 Switzerland, October 10--13, 2005, Revised Selected
                 Papers and Discussions}",
  title =        "Verified Software: Theories, Tools, Experiments: First
                 {IFIP TC 2\slash WG 2.3 Conference, VSTTE 2005, Zurich,
                 Switzerland, October 10--13, 2005, Revised Selected
                 Papers and Discussions}",
  volume =       "4171",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xxiii + 546",
  year =         "2008",
  DOI =          "https://doi.org/10.1007/978-3-540-69149-5",
  ISBN =         "3-540-69147-2 (paperback), 3-540-69149-9 (e-book)",
  ISBN-13 =      "978-3-540-69147-1 (paperback), 978-3-540-69149-5
                 (e-book)",
  ISSN =         "0302-9743",
  LCCN =         "QA76.76.V47 V78 2008eb",
  bibdate =      "Tue Aug 9 15:02:59 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2000.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer.com/openurl?genre=book\%26isbn=978-3-540-69147-1;
                 http://VH7QX3XE2P.search.serialssolutions.com/?V=1.0\%26L=VH7QX3XE2P\%26S=JCs\%26C=TC0000320630\%26T=marc\%26tab=BOOKS",
  abstract =     "This state-of-the-art survey is an outcome of the
                 first IFIP TC 2/WG 2.3 working conference on Verified
                 Software: Theories, Tools, Experiments, VSTTE 2005,
                 held in Zurich, Switzerland, in October 2005. This was
                 a historic event gathering many top international
                 experts on systematic methods for specifying, building
                 and verifying high-quality software. The book includes
                 32 revised full papers and 27 revised position papers,
                 preceded by a general introduction to the area, which
                 also presents the vision of a grand challenge project:
                 the ``verifying compiler''. Most contributions are
                 followed by a transcription of the vivid discussion
                 that ensued between the author and the audience. The
                 papers have been organized in topical sections on
                 verification tools, guaranteeing correctness, software
                 engineering aspects, verifying object-oriented
                 programming, programming language and methodology
                 aspects, components, static analysis, design, analysis
                 and tools, as well as formal techniques.",
  acknowledgement = ack-nhfb,
  meetingname =  "VSTTE (Conference) (1st : 2005 : Zurich,
                 Switzerland)",
  subject =      "Computer programs; Verification; Congresses;
                 Logiciels; V{\'e}rification; Congr{\`e}s;
                 Verification",
  tableofcontents = "Introduction \\
                 Verified Software: Theories, Tools, Experiments Vision
                 of a Grand Challenge Project / Tony Hoare, Jay Misra /
                 1--18 \\
                 Verification Tools \\
                 Towards a Worldwide Verification Technology / Wolfgang
                 Paul / 19--25 \\
                 It Is Time to Mechanize Programming Language Metatheory
                 / Benjamin C. Pierce, Peter Sewell, Stephanie Weirich,
                 Steve Zdancewic / 26--30 \\
                 Methods and Tools for Formal Software Engineering /
                 Zhiming Liu, R. Venkatesh / 31--41 \\
                 Guaranteeing Correctness \\
                 The Verified Software Challenge: A Call for a Holistic
                 Approach to Reliability / Thomas Ball / 42--48 \\
                 A Mini Challenge: Build a Verifiable Filesystem /
                 Rajeev Joshi, Gerard J. Holzmann / 49--56 \\
                 A Constructive Approach to Correctness, Exemplified by
                 a Generator for Certified Java Card Applets /
                 Alessandro Coglio, Cordell Green / 57--63 \\
                 Some Interdisciplinary Observations about Getting the
                 ``Right'' Specification / Cliff B. Jones / 64--69 \\
                 Software Engineering Aspects \\
                 Software Verification and Software Engineering a
                 Practitioner's Perspective / Anthony Hall / 70--73 \\
                 Decomposing Verification Around End-User Features /
                 Kathi Fisler, Shriram Krishnamurthi / 74--81 \\
                 Verifying Object-Oriented Programming \\
                 Automatic Verification of Strongly Dynamic Software
                 Systems / N. Dor, J. Field, D. Gopan, T. Lev-Ami, A.
                 Loginov, R. Manevich et al. / 82--92 \\
                 Reasoning about Object Structures Using Ownership /
                 Peter M{\"u}ller / 93--104 \\
                 Modular Reasoning in Object-Oriented Programming /
                 David A. Naumann / 105--115 \\
                 Scalable Specification and Reasoning: Challenges for
                 Program Logic / Peter W. O'Hearn / 116--133 \\
                 Programming Language and Methodology Aspects \\
                 Lessons from the JML Project / Gary T. Leavens, Curtis
                 Clifton / 134--143 \\
                 The Spec# Programming System: Challenges and Directions
                 / Mike Barnett, Robert DeLine, Manuel F{\"a}hndrich,
                 Bart Jacobs, K. Rustan M. Leino, Wolfram Schulte et al.
                 / 144--152 \\
                 Integrating Static Checking and Interactive
                 Verification: Supporting Multiple Theories and Provers
                 in Verification / Joseph R. Kiniry, Patrice Chalin,
                 Cl{\'e}ment Hurlin / 153--160 \\
                 Components \\
                 Automated Test Generation and Verified Software / John
                 Rushby / 161--172 \\
                 Generating Programs Plus Proofs by Refinement / Douglas
                 R. Smith / 182--188 \\
                 Static Analysis \\
                 The Verification Grand Challenge and Abstract
                 Interpretation / Patrick Cousot / 189--201 \\
                 WYSINWYX: What You See Is Not What You eXecute / G.
                 Balakrishnan, T. Reps, D. Melski, T. Teitelbaum /
                 202--213 \\
                 Implications of a Data Structure Consistency Checking
                 System / Viktor Kuncak, Patrick Lam, Karen Zee, Martin
                 Rinard / 214--226 \\
                 Towards the Integration of Symbolic and Numerical
                 Static Analysis / Arnaud Venet / 227--236 \\
                 Design, Analysis and Tools \\
                 Reliable Software Systems Design: Defect Prevention,
                 Detection, and Containment / Gerard J. Holzmann, Rajeev
                 Joshi / 237--244 \\
                 Trends and Challenges in Algorithmic Software
                 Verification / Rajeev Alur / 245--250 \\
                 Model Checking: Back and Forth between Hardware and
                 Software / Edmund Clarke, Anubhav Gupta, Himanshu Jain,
                 Helmut Veith / 251--255 \\
                 Computational Logical Frameworks and Generic Program
                 Analysis Technologies / Jos{\'e} Meseguer, Grigore
                 Ro{\c{s}}u / 256--267 \\
                 Formal Techniques \\
                 A Mechanized Program Verifier / J. Strother Moore /
                 268--276 \\
                 Verifying Design with Proof Scores / Kokichi Futatsugi,
                 Joseph A. Goguen, Kazuhiro Ogata / 277--290 \\
                 Integrating Theories and Techniques for Program
                 Modelling, Design and Verification / Bernard K.
                 Aichernig, He Jifeng, Zhiming Liu, Mike Reed / 291--300
                 \\
                 Eiffel as a Framework for Verification / Bertrand Meyer
                 / 301--307 \\
                 Position Papers \\
                 Can We Build an Automatic Program Verifier? Invariant
                 Proofs and Other Challenges / Myla Archer / 308--317
                 \\
                 Verified Software: The Real Grand Challenge / Ramesh
                 Bharadwaj / 318--324 \\
                 Linking the Meaning of Programs to What the Compiler
                 Can Verify / Egon B{\"o}rger / 325--336 \\
                 Scalable Software Model Checking Using Design for
                 Verification / Tevfik Bultan, Aysu Betin-Can / 337--346
                 \\
                 Model-Checking Software Using Precise Abstractions /
                 Marsha Chechik, Arie Gurfinkel / 347--353 \\
                 Toasters, Seat Belts, and Inferring Program Properties
                 / David Evans / 354--361 \\
                 On the Formal Development of Safety-Critical Software /
                 Andy Galloway, Frantz Iwu, John McDermid, Ian Toyn /
                 362--373 \\
                 Verify Your Runs / Klaus Havelund, Allen Goldberg /
                 374--383 \\
                 Specified Blocks / Eric C. R. Hehner / 384--391 \\
                 A Case for Specification Validation / Mats P. E.
                 Heimdahl / 392--402 \\
                 Some Verification Issues at NASA Goddard Space Flight
                 Center / Michael G. Hinchey, James L. Rash, Christopher
                 A. Rouff / 403--412 \\
                 Performance Validation on Multicore Mobile Devices /
                 Thomas Hubbard, Raimondas Lencevicius, Edu Metz, Gopal
                 Raghavan / 413--421 \\
                 Tool Integration for Reasoned Programming / Andrew
                 Ireland / 422--427 \\
                 Decision Procedures for the Grand Challenge / Daniel
                 Kroening / 428--437 \\
                 The Challenge of Hardware-Software Co-verification /
                 Panagiotis Manolios / 438--447 \\
                 From the How to the What / Tiziana Margaria, Bernhard
                 Steffen / 448--459 \\
                 An Overview of Separation Logic / John C. Reynolds /
                 460--469 \\
                 A Perspective on Program Verification / Willem-Paul de
                 Roever / 470--477 \\
                 Meta-Logical Frameworks and Formal Digital Libraries /
                 Carsten Sch{\"u}rmann / 478--485 \\
                 Languages, Ambiguity, and Verification / The SPARK Team
                 / 486--490 \\
                 The Importance of Non-theorems and Counterexamples in
                 Program Verification / Graham Steel / 491--495 \\
                 Regression Verification - A Practical Way to Verify
                 Programs / Ofer Strichman, Benny Godlin / 496--501 \\
                 Programming with Proofs: Language-Based Approaches to
                 Totally Correct Software / Aaron Stump / 502--509 \\
                 The Role of Model-Based Testing / Mark Utting /
                 510--517 \\
                 Abstraction of Graph Transformation Systems by Temporal
                 Logic and Its Verification / Mitsuharu Yamamoto,
                 Yoshinori Tanabe, Koichi Takahashi, Masami Hagiya /
                 518--527 \\
                 Program Verification by Using DISCOVERER / Lu Yang,
                 Naijun Zhan, Bican Xia, Chaochen Zhou / 528--538 \\
                 Constraint Solving and Symbolic Execution / Jian Zhang
                 / 539--544",
}

@Proceedings{Berghammer:2009:RKA,
  editor =       "Rudolf Berghammer and Ali Mohamed Jaoua and Bernhard
                 M{\"o}ller",
  booktitle =    "Relations and {Kleene} algebra in computer science:
                 {11th International Conference on Relational Methods in
                 Computer Science, RelMiCS 2009, and 6th International
                 Conference on Applications of Kleene Algebra, AKA 2009,
                 Doha, Qatar, November 1--5, 2009, Proceedings}",
  title =        "Relations and {Kleene} algebra in computer science:
                 {11th International Conference on Relational Methods in
                 Computer Science, RelMiCS 2009, and 6th International
                 Conference on Applications of Kleene Algebra, AKA 2009,
                 Doha, Qatar, November 1--5, 2009, Proceedings}",
  volume =       "5827",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 365",
  year =         "2009",
  DOI =          "https://doi.org/10.1007/978-3-642-04639-1",
  ISBN =         "3-642-04638-X, 3-642-04639-8 (e-book)",
  ISBN-13 =      "978-3-642-04638-4, 978-3-642-04639-1 (e-book)",
  LCCN =         "QA10 .I58 2009",
  MRclass =      "68Q65 (03G25 68Q85)",
  MRnumber =     "2781233",
  bibdate =      "Sat Jul 30 16:27:05 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  tableofcontents = "Knowledge and Structure in Social Algorithms \\
                 Computational Social Choice Using Relation Algebra and
                 RelView \\
                 A Model of Internet Routing Using Semi-modules \\
                 Visibly Pushdown Kleene Algebra and Its Use in
                 Interprocedural Analysis of (Mutually) Recursive
                 Programs \\
                 Towards Algebraic Separation Logic \\
                 Domain and Antidomain Semigroups \\
                 Composing Partially Ordered Monads \\
                 A Relation-Algebraic Approach to Liveness of
                 Place/Transition Nets \\
                 $\star$-Continuous Idempotent Left Semirings and Their
                 Ideal Completion \\
                 A Semiring Approach to Equivalences, Bisimulations and
                 Control \\
                 General Correctness Algebra \\
                 Foundations of Concurrent Kleene Algebra / C. A. R.
                 Hoare, Bernhard M{\"o}ller, Georg Struth, Ian Wehrman /
                 166--186 \\
                 Armstrong's Inference Rules in Dedekind Categories \\
                 Data Mining, Reasoning and Incremental Information
                 Retrieval through Non Enlargeable Rectangular Relation
                 Coverage \\
                 Collagories for Relational Adhesive Rewriting \\
                 Cardinal Addition in Distributive Allegories \\
                 Relational Methods in the Analysis of While Loops:
                 Observations of Versatility \\
                 Modalities, Relations, and Learning \\
                 The Cube of Kleene Algebras and the Triangular Prism of
                 Multirelations \\
                 Discrete Duality for Relation Algebras and Cylindric
                 Algebras \\
                 Contact Relations with Applications \\
                 A While Program Normal Form Theorem in Total
                 Correctness \\
                 Complements in Distributive Allegories \\
                 On the Skeleton of Stonian $p$-Ortholattices",
}

@Proceedings{Bottaci:2010:TAI,
  editor =       "Leonardo Bottaci and G. Fraser",
  booktitle =    "{Testing: Academic and Industrial Conference ---
                 Practice and Research Techniques: 5th International
                 Conference, TAIC PART 2010, Windsor, UK, September
                 4--6, 2010, Proceedings}",
  title =        "{Testing: Academic and Industrial Conference ---
                 Practice and Research Techniques: 5th International
                 Conference, TAIC PART 2010, Windsor, UK, September
                 4--6, 2010, Proceedings}",
  volume =       "6303",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 218",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-15585-7",
  ISBN =         "3-642-15584-7 (paperback), 3-642-15585-5 (e-book)",
  ISBN-13 =      "978-3-642-15584-0 (paperback), 978-3-642-15585-7
                 (e-book)",
  LCCN =         "QA76.76.T48 T47 2010",
  bibdate =      "Tue Aug 09 15:21:58 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/java2010.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  tableofcontents = "Keynote Addresses \\
                 Automatic Testing and Fixing for Eiffel / Bertrand
                 Meyer / 1--4 \\
                 Testing and Proving, Hand-in-Hand / Sir Tony Hoare /
                 5--6 \\
                 Microsoft's Protocol Documentation Program: A Success
                 Story for Model-Based Testing / Wolfgang Grieskamp /
                 7--7 \\
                 Full Papers \\
                 Masking Boundary Value Coverage: Effectiveness and
                 Efficiency / P. Vijay Suman, Tukaram Muske, Prasad
                 Bokil, Ulka Shrotri, R. Venkatesh / 8--22 \\
                 Model-Checking Erlang --- A Comparison between EtomCRL2
                 and McErlang / Qiang Guo, John Derrick, Clara Benac
                 Earle, Lars-{\AA}ke Fredlund / 23--38 \\
                 Bad Pairs in Software Testing / Daniel Hoffman, Chien
                 Chang, Gary Bazdell, Brett Stevens, Kevin Yoo / 39--55
                 \\
                 Localizing Defects in Multithreaded Programs by Mining
                 Dynamic Call Graphs / Frank Eichinger, Victor
                 Pankratius, Philipp W. L. Gro{\ss}e, Klemens B{\"o}hm /
                 56--71 \\
                 Filtering Test Models to Support Incremental Testing /
                 Antti J{\"a}{\"a}skel{\"a}inen / 72--87 \\
                 Does Testing Help to Reduce the Number of Potentially
                 Faulty Statements in Debugging? / Mihai Nica, Simona
                 Nica, Franz Wotawa / 88--103 \\
                 Linguistic Security Testing for Text Communication
                 Protocols / Ben W. Y. Kam, Thomas R. Dean / 104--117
                 \\
                 Tool Papers \\
                 An Open-Source Tool for Automated Generation of
                 Black-Box xUnit Test Code and Its Industrial Evaluation
                 / Christian Wiederseiner, Shahnewaz A. Jolly, Vahid
                 Garousi, Matt M. Eskandar / 118--128 \\
                 TeCReVis: A Tool for Test Coverage and Test Redundancy
                 Visualization / Negar Koochakzadeh, Vahid Garousi /
                 129--136 \\
                 A Fault Injection Tool for Testing Web Services
                 Composition / Fay{\c{c}}al Bessayah, Ana Cavalli,
                 Willian Maja, Eliane Martins, Andre Willik Valenti /
                 137--146 \\
                 Synthesis of On-Line Planning Tester for
                 Non-deterministic EFSM Models / Marko
                 K{\"a}{\"a}ramees, J{\"u}ri Vain, Kullo Raiend /
                 147--154 \\
                 A Generic Approach to Run Mutation Analysis / Siamak
                 Haschemi, Stephan Wei{\ss}leder / 155--164 \\
                 Challenge Paper \\
                 The Practical Assessment of Test Sets with Inductive
                 Inference Techniques / Neil Walkinshaw / 165--172 \\
                 Experience Reports \\
                 Mining API Popularity / Yana Momchilova Mileva,
                 Valentin Dallmeier, Andreas Zeller / 173--180 \\
                 Automatic Discovery of Unspecified Behaviors in
                 Automotive Control Software / Muzammil Shahbaz, Robert
                 Eschbach / 181--188 \\
                 Fast Abstracts \\
                 An Empirical Evaluation to Study Benefits of Visual
                 versus Textual Test Coverage Information / Vahid
                 Garousi, Negar Koochakzadeh / 189--193 A Multi-criteria
                 Decision Making Framework for Real Time Model-Based
                 Testing / Mohammad Saeed Abou Trab, Bachar Alrouh,
                 Steve Counsell, Rob M. Hierons, George Ghinea /
                 194--197 \\
                 Improved Testing through Refactoring: Experience from
                 the ProTest Project / Huiqing Li, Simon Thompson /
                 198--202 \\
                 Towards Run-Time Monitoring of Web Services Conformance
                 to Business-Level Agreements / Konstantinos Bratanis,
                 Dimitris Dranidis, Anthony J. H. Simons / 203--206 \\
                 A New Approach for Software Testability / Lydie du
                 Bousquet / 207--210 \\
                 DOM Transactions for Testing JavaScript / Phillip
                 Heidegger, Annette Bieniusa, Peter Thiemann / 211--214
                 \\
                 The GZoltar Project: A Graphical Debugger Interface /
                 Andr{\'e} Riboira, Rui Abreu / 215--218",
}

@Book{Jones:2010:RWC,
  editor =       "Cliff B. Jones and A. W. Roscoe and Kenneth R. Wood",
  booktitle =    "Reflections on the work of {C. A. R. Hoare}",
  title =        "Reflections on the work of {C. A. R. Hoare}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 430",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-1-84882-912-1",
  ISBN =         "1-4471-6152-1, 1-84882-911-6 (hardcover),
                 1-84882-912-4 (e-book), 1-84882-917-5",
  ISBN-13 =      "978-1-4471-6152-3, 978-1-84882-911-4 (hardcover),
                 978-1-84882-912-1 (e-book), 978-1-84882-917-6",
  LCCN =         "QA76 .R44 2010",
  bibdate =      "Wed Aug 10 18:24:18 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  abstract =     "Thousands of different programming languages exist,
                 and many more are being created each year, yet all
                 those involved in such work must acknowledge that it is
                 'the highest goal of programming language design to
                 enable good ideas to be elegantly expressed'. These are
                 the words of Sir Charles Antony Richard Hoare, or Tony
                 Hoare to his colleagues and friends, a man who has
                 inspired generations of researchers in computer
                 science. His work, grounded in practical programming,
                 has had a profound impact on the evolution of the
                 field. This includes the development of Hoare logic and
                 Communicating Seque.",
  acknowledgement = ack-nhfb,
  shorttableofcontents = "Reflections on the Work of C.A.R. Hoare \\
                 Endorsements \\
                 Preface \\
                 Contents \\
                 1: Insight, Inspiration and Collaboration \\
                 2: From CSP to Game Semantics \\
                 3: On Mereologies in Computing Science \\
                 4: Roles, Stacks, Histories: A Triple for Hoare \\
                 5: Forward with Hoare \\
                 6: Probabilistic Programming with Coordination \\
                 7: The Operational Principle and Problem Frames \\
                 8: The Role of Auxiliary Variables in the Formal
                 Development of Concurrent Programs \\
                 9: Avoid a Void: The Eradication of Null Dereferencing
                 \\
                 10: Unfolding CSP \\
                 11: Quicksort: Combining Concurrency, Recursion, and
                 Mutable Data Structures \\
                 12: The Thousand-and-One Cryptographers \\
                 13: On Process-Algebraic Extensions of Metric Temporal
                 Logic \\
                 14: Fun with Type Functions \\
                 15: On CSP and the Algebraic Theory of Effects \\
                 16: CSP is Expressive Enough for $\pi$ \\
                 17: The Tokeneer Experiments",
  subject =      "informatique; {\'y}etudes diverses.; g{\'y}enie
                 logiciel; algorithmique; algorithmique.",
  tableofcontents = "Front Matter / / i--xii \\
                 1: Insight, Inspiration and Collaboration / C. B.
                 Jones, A. W. Roscoe / 1--32 \\
                 2: From CSP to Game Semantics / Samson Abramsky /
                 33--45 \\
                 3: On Mereologies in Computing Science / Dines
                 Bj{\o}rner / 47--70 \\
                 4: Roles, Stacks, Histories: A Triple for Hoare /
                 Johannes Borgstr{\"o}m, Andrew D. Gordon, Riccardo
                 Pucella / 71--99 \\
                 5: Forward with Hoare / Mike Gordon, H{\'e}l{\`e}ne
                 Collavizza / 101--121 \\
                 6: Probabilistic Programming with Coordination / He
                 Jifeng / 123--142 \\
                 7: The Operational Principle and Problem Frames /
                 Michael Jackson / 143--165 \\
                 8: The Role of Auxiliary Variables in the Formal
                 Development of Concurrent Programs / C. B. Jones /
                 167--187 \\
                 9: Avoid a Void: The Eradication of Null Dereferencing
                 / Bertrand Meyer, Alexander Kogtenkov, Emmanuel Stapf /
                 189--211 \\
                 10: Unfolding CSP / Mikkel Bundgaard, Robin Milner /
                 213--228 \\
                 11: Quicksort: Combining Concurrency, Recursion, and
                 Mutable Data Structures / David Kitchin, Adrian Quark,
                 Jayadev Misra / 229--254 \\
                 12: The Thousand-and-One Cryptographers / A. K. McIver,
                 C. C. Morgan / 255--282 \\
                 13: On Process-Algebraic Extensions of Metric Temporal
                 Logic / Christoph Haase, Jo{\"e}l Ouaknine, James
                 Worrell / 283--300 \\
                 14: Fun with Type Functions / Oleg Kiselyov, Simon
                 Peyton Jones, Chung-chieh Shan / 301--331 \\
                 15: On CSP and the Algebraic Theory of Effects / Rob
                 van Glabbeek, Gordon Plotkin / 333--369 \\
                 16: CSP is Expressive Enough for $\pi$ / A. W. Roscoe /
                 371--404 \\
                 17: The Tokeneer Experiments / Jim Woodcock, Emine
                 G{\"o}k{\c{c}}e Aydal, Rod Chapman / 405--430",
}

@Book{Manna:2010:TVE,
  editor =       "Zohar Manna and Doran A. Peled",
  booktitle =    "Time for Verification: Essays in Memory of {Amir
                 Pnueli}",
  title =        "Time for Verification: Essays in Memory of {Amir
                 Pnueli}",
  volume =       "6200",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 399",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-13754-9",
  ISBN =         "3-642-15584-7 (paperback), 3-642-15585-5 (e-book)",
  ISBN-13 =      "978-3-642-15584-0 (paperback), 978-3-642-15585-7
                 (e-book)",
  LCCN =         "QA76.76.V47 T56 2010",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  tableofcontents = "Modal and Temporal Argumentation Networks / Howard
                 Barringer, Dov M. Gabbay / 1--25 \\
                 Knowledge Based Scheduling of Distributed Systems /
                 Saddek Bensalem, Doron Peled, Joseph Sifakis / 26--41
                 \\
                 Quantitative Simulation Games / Pavol {\v{C}}ern{\'y},
                 Thomas A. Henzinger, Arjun Radhakrishna / 42--60 \\
                 The Localization Reduction and Counterexample-Guided
                 Abstraction Refinement / Edmund M. Clarke, Robert P.
                 Kurshan, Helmut Veith / 61--71 \\
                 A Scalable Segmented Decision Tree Abstract Domain /
                 Patrick Cousot, Radhia Cousot, Laurent Mauborgne /
                 72--95 \\
                 Towards Component Based Design of Hybrid Systems:
                 Safety and Stability / Werner Damm, Henning Dierks,
                 Jens Oehlerking, Amir Pnueli / 96--143 \\
                 Mildly Context-Sensitive Languages via Buffer Augmented
                 Pregroup Grammars / Daniel Genkin, Nissim Francez,
                 Michael Kaminski / 144--166 \\
                 Inference Rules for Proving the Equivalence of
                 Recursive Procedures / Benny Godlin, Ofer Strichman /
                 167--184 \\
                 Some Thoughts on the Semantics of Biocharts / David
                 Harel, Hillel Kugler / 185--194 \\
                 Unraveling a Card Trick / Tony Hoare, Natarajan Shankar
                 / 195--201 \\
                 An Automata-Theoretic Approach to Infinite-State
                 Systems / Orna Kupferman, Nir Piterman, Moshe Y. Vardi
                 / 202--259 \\
                 On the Krohn-Rhodes Cascaded Decomposition Theorem /
                 Oded Maler / 260--278 \\
                 Temporal Verification of Reactive Systems: Response /
                 Zohar Manna, Amir Pnueli / 279--361 \\
                 The Arrow of Time through the Lens of Computing /
                 Krishna V. Palem / 362--369 \\
                 What Is in a Step: New Perspectives on a Classical
                 Question / Willem-Paul de Roever, Gerald L{\"u}ttgen,
                 Michael Mendler / 370--399",
}

@Proceedings{Muller:2010:ALS,
  editor =       "Peter M{\"u}ller",
  booktitle =    "Advanced lectures on software engineering: {LASER
                 summer school 2007\slash 2008}",
  title =        "Advanced lectures on software engineering: {LASER
                 summer school 2007\slash 2008}",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "vii + 189 + 99",
  year =         "2010",
  DOI =          "https://doi.org/10.1007/978-3-642-13010-6",
  ISBN =         "3-642-13009-7 (paperback), 3-642-13010-0",
  ISBN-13 =      "978-3-642-13009-0 (paperback), 978-3-642-13010-6",
  LCCN =         "QA76.758 .A38 2010",
  bibdate =      "Tue Aug 09 14:43:58 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  URL =          "https://dl.acm.org/doi/abs/10.5555/2167938.2167940",
  abstract =     "The concept of a compensable transaction has been
                 embodied in modern business workflow languages like
                 BPEL. This article uses the concept of a box-structured
                 Petri net to formalise the definition of a compensable
                 transaction. The standard definitions of structured
                 program connectives are extended to construct
                 longer-running transactions out of shorter fine-grain
                 ones. Floyd-type assertions on the arcs of the net
                 specify the intended properties of the transaction and
                 of its component programs. The correctness of the whole
                 transaction can therefore be proved by local
                 reasoning.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Fine-Grain Concurrency / Tony Hoare / 1--20 \\
                 Compensable Transactions / Tony Hoare / 21--40 \\
                 SCOOP: A Contract-Based Concurrent Object-Oriented
                 Programming Model / Benjamin Morandi, Sebastian S.
                 Bauer, Bertrand Meyer / 41--90 \\
                 Using the Spec# Language, Methodology, and Tools to
                 Write Bug-Free Programs / K. Rustan M. Leino, Peter
                 M{\"u}ller / 91--139 \\
                 Fixpoints and Search in PVS / Natarajan Shankar /
                 140--161 \\
                 Multi Core Design for Chip Level Multiprocessing /
                 Tryggve Fossum / 162--187",
  xxbooktitle =  "Software System Reliability and Security",
}

@Proceedings{Broy:2011:SSS,
  editor =       "Manfred Broy and Christian Leuxner and Tony Hoare",
  booktitle =    "Software and Systems Safety --- Specification and
                 Verification",
  title =        "Software and Systems Safety --- Specification and
                 Verification",
  volume =       "30",
  publisher =    pub-IOS,
  address =      pub-IOS:adr,
  pages =        "ix + 285",
  year =         "2011",
  ISBN =         "1-60750-710-2 (hardcover), 1-60750-711-0 (e-book)",
  ISBN-13 =      "978-1-60750-710-9 (hardcover), 978-1-60750-711-6
                 (e-book)",
  ISSN =         "1874-6268 (print), 1879-8292 (electronic)",
  ISSN-L =       "1874-6268",
  LCCN =         "QA76.9.A25 S64 2011; QA76.76.P76 S64 2011",
  bibdate =      "Tue Aug 09 15:46:02 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "NATO Science for Peace and Security Series - D:
                 Information and Communication Security",
  URL =          "http://www.gbv.de/dms/tib-ub-hannover/655827013.pdf;
                 https://ebooks.iospress.nl/volume/software-and-systems-safety",
  abstract =     "Information security depends upon an understanding of
                 the functionality of software systems. Customers and
                 information can only be protected from attack if this
                 functionality is guaranteed to be correct and safe. A
                 scientific foundation of software engineering not only
                 provides models enabling the capture of application
                 domains and requirements, but also ensures an
                 understanding of the structure and working of software
                 systems, architectures and programs. This book presents
                 contributions based on the lectures delivered at the
                 31st International Summer School: Software and Systems
                 Safety: Specification and Verification held at
                 Marktoberdorf, Germany, in August 2010, and provides an
                 excellent overview of current research results with
                 special emphasis on software information security.
                 Leading international researchers and experts present
                 their experience in the specification and verification
                 of software systems, accompanied by corresponding tools
                 and methods. Subjects addressed include: model-based
                 testing, schemes and patterns of
                 assumption/promise-based system specification,
                 requirements models for critical systems, engineering
                 evolving and self-adaptive systems, unifying models of
                 data flow, model-based verification and analysis of
                 real-time systems, and model checking. The book will be
                 of interest to all those dealing with information
                 systems for whom security is of paramount importance.",
  acknowledgement = ack-nhfb,
  meetingname =  "NATO Advanced Study Institute on Software and Systems
                 Safety: Specification and Verification (2010:
                 Marktoberndorf, Germany)",
  subject =      "Computer security; Congresses; Computer software;
                 Verification; Software engineering; S{\'e}curit{\'e}
                 informatique; Congr{\'e}s; Logiciels; V{\'e}rification;
                 G{\'e}nie logiciel; Computer security.; Verification.;
                 Software engineering.",
  tableofcontents = "Preface / / i-ix \\
                 Model-based testing / Mark Timmer, Ed Brinksma and
                 Mari{\"e}lle Stoelinga / 1--32 /
                 doi:10.3233/978-1-60750-711-6-1\\
                 Towards a theory of architectural contracts: schemes
                 and patterns of assumption/promise based system
                 specification / Manfred Broy / 33--87 /
                 doi:10.3233/978-1-60750-711-6-33\\
                 Engineering evolving and self-adaptive systems: an
                 overview / Carlo Ghezzi / 88--102 /
                 doi:10.3233/978-1-60750-711-6-88 \\
                 Formal verification / John Harrison / 103--157 /
                 doi:10.3233/978-1-60750-711-6-103 \\
                 Requirements models for critical systems / Constance
                 Heitmeyer / 158--181 /
                 doi:10.3233/978-1-60750-711-6-158\\
                 From concurrency models to numbers: performance and
                 dependability / Holger Hermanns and Lijun Zhang /
                 182--210 / doi:10.3233/978-1-60750-711-6-182 \\
                 Unifying models of data flow / Tony Hoare and John
                 Wickerson / 211--230 doi:10.3233/978-1-60750-711-6-211
                 \\
                 Model-based verification and analysis for real-time
                 systems / Uli Fahrenberg, Kim G. Larsen and Claus
                 Thrane / 231--259 / doi:10.3233/978-1-60750-711-6-231
                 \\
                 Model checking / Doron Peled / 260--181 /
                 doi:10.3233/978-1-60750-711-6-260 \\
                 Subject Index / / 282--282 \\
                 Author Index / / 285--285",
}

@Book{Jones:2011:DHC,
  editor =       "Cliff B. Jones and J. L. (John L.) Lloyd",
  title =        "Dependable and Historic Computing: Essays Dedicated to
                 {Brian Randell} on the Occasion of His 75th Birthday",
  volume =       "6875",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 523",
  year =         "2011",
  DOI =          "https://doi.org/10.1007/978-3-642-24541-1",
  ISBN =         "3-642-24540-4, 3-642-24541-2",
  ISBN-13 =      "978-3-642-24540-4, 978-3-642-24541-1",
  ISSN =         "0302-9743",
  LCCN =         "QA76.17",
  bibdate =      "Wed Nov 9 09:56:56 MST 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/b/babbage-charles.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/l/lovelace-ada-augusta.bib",
  series =       "Lecture Notes in Computer Science",
  URL =          "http://link.springer.com/10.1007/978-3-642-24541-1",
  abstract =     "This Festschrift volume, published in honor of Brian
                 Randell on the occasion of his 75th birthday, contains
                 a total of 37 refereed contributions. Two biographical
                 papers are followed by the six invited papers that were
                 presented at the conference 'Dependable and Historic
                 Computing: The Randell Tales', held during April 7--8,
                 2011 at Newcastle University, UK. The remaining
                 contributions are authored by former scientific
                 colleagues of Brian Randell. The papers focus on the
                 core of Brian Randells work: the development of
                 computing science and the study of its history.
                 Moreover, his wider interests are reflected and so the
                 collection comprises papers on software engineering,
                 storage fragmentation, computer architecture,
                 programming languages and dependability. There is even
                 a paper that echoes Randells love of maps. After an
                 early career with English Electric and then with IBM in
                 New York and California, Brian Randell joined Newcastle
                 University. His main research has been on dependable
                 computing in all its forms, especially reliability,
                 safety and security aspects, and he has led several
                 major European collaborative projects.",
  acknowledgement = ack-nhfb,
  keywords =     "Ada Augusta Lovelace; Charles Babbage; Sir Charles
                 Antony Richard Hoare",
  subject =      "Computer science; Microprogramming; Software
                 engineering; Operating systems (Computers); Data
                 protection; Electronic data processing; Informatique;
                 Microprogrammation; G{\'e}nie logiciel; Syst{\`e}mes
                 d'exploitation (Ordinateurs); Protection de
                 l'information (Informatique); computer science.; data
                 processing.; operating systems.; Computer science.;
                 Data protection.; Microprogramming.; Operating systems
                 (Computers); Software engineering.",
  tableofcontents = "Part A: Biographical \\
                 What I Learned from Brian (Hermann Kopetz) / 1--6 \\
                 Brian Randell: A Biographical Note (John L. Lloyd and
                 Tom Anderson) / 7--14 \\
                 Part B: Conference Papers \\
                 On Building a Referee's Avatar (Algirdas Avizienis) /
                 15--22 \\
                 From Theory to Practice: The Invention of Programming,
                 1947--51 (Martin Campbell-Kelly) / 23--37 \\
                 Transactions: From Local Atomicity to Atomicity in the
                 Cloud (David Lomet) / 38--52 \\
                 From DSS to MILS (John Rushby) / 53--57 \\
                 Pre-electronic Computing (Doron Swade) / 58--83 \\
                 Whetstone Wanderings (Brian Wichmann) / 84--92 \\
                 Part C: Contributed Papers \\
                 Using Real-Time Road Traffic Data to Evaluate
                 Congestion (Jean Bacon, Andrei Iu. Bejan, Alastair R.
                 Beresford, David Evans, Richard J. Gibbens, and Ken
                 Moody) / 93--117 \\
                 Fault Tolerant Autonomic Computing Systems in a
                 Chemical Setting (Jean-Pierre Banatre, Christine Morin,
                 and Thierry Priol) / 118--129 \\
                 Out of a Closet: The Early Years of the Computer Museum
                 (Gordon Bell) / 130--146 \\
                 Timing Faults and Mixed Criticality Systems (Alan Burns
                 and Sanjoy Baruah) / 147--166 \\
                 Professor Brian Randell and the History of Computing
                 (Paul E. Ceruzzi) / 167--173 \\
                 Computer Storage Fragmentation: Pioneering Work of
                 Brian Randell (Ed Coffman) / 174--184 \\
                 IBM-ACS: Reminiscences and Lessons Learned from a
                 1960's Supercomputer Project (Lynn Conway) / 185--224
                 \\
                 The Belgian Electronic Mathematical Machine
                 (1951--1962): An Account (Pierre-Jacques Courtois) /
                 225--237 \\
                 On the Resilience of the Dependability Framework to the
                 Intrusion of New Security Threats (Marc Dacier) /
                 238--250 \\
                 Virtual Fault Tolerance (Peter J. Denning) / 251--260
                 \\
                 Recovery Blocks (Tony Hoare) / 261--266 \\
                 The Development and Writing of ``Process Structuring''
                 (J. J. Horning) / 267--272 \\
                 A Tolerant Approach to Faults (Michael Jackson) /
                 273--282 \\
                 Causality in Structured Occurrence Nets (Jetty Kleijn
                 and Maciej Koutny) / 283--297 \\
                 Diversity (John C. Knight) / 298--312 \\
                 Swords and Ploughshares: Connections between Computer
                 Projects for War and Peace, 1945--55 (Simon Lavington)
                 / 313--322 \\
                 The Evolution of the Arjuna Transaction Processing
                 System (M. C. Little and S. K. Shrivastava) / 323--343
                 \\
                 Making Experiments Dependable (Roy Maxion) / 344--357
                 \\
                 Wallpaper Maps (M. Douglas McIlroy) / 358--375 \\
                 Incremental Design: Programming with Holes and Evolvers
                 (Ron Morrison, Dharini Balasubramaniam, and Brian
                 Warboys) / 376--386 \\
                 Carrying Goals to Newcastle: A Tribute to Brian Randell
                 (Peter G. Neumann) / 387--392 \\
                 Distributed Computing in the 21st Century: Some Aspects
                 of Cloud Computing (Fabio Panzieri, Ozalp
                 Babao{\u{g}}lu, Stefano Ferretti, Vittorio Ghini, and
                 Moreno Marzolla) / 393--412 \\
                 Software Engineering: Multi-person Development of
                 Multi-version Programs (David Lorge Parnas) / 413--427
                 \\
                 Tolerance of Design Faults (David Powell, Jean Arlat,
                 Yves Deswarte, and Karama Kanoun) / 428--452 \\
                 On the Implementation of Concurrent Objects (Michel
                 Raynal) / 453--478 \\
                 Beyond Traces and Independence (Fred B. Schneider) /
                 479--485 \\
                 Socio-technical Complex Systems of Systems: Can We
                 Justifiably Trust Their Resilience? (Luca Simoncini) /
                 486--497 \\
                 Safety, Security and Dependability in Crowd Computing
                 (W\_ladys\_law M. Turski) / 498--503 \\
                 Achieving Dependability in Service-Oriented Systems
                 (Jie Xu) / 504--522 \\
                 Author Index / 523--523",
}

@Book{Daylight:2012:DSE,
  author =       "Edgar G. Daylight",
  booktitle =    "The Dawn of Software Engineering: from {Turing} to
                 {Dijkstra}",
  title =        "The Dawn of Software Engineering: from {Turing} to
                 {Dijkstra}",
  publisher =    "Lonely Scholar",
  address =      "Heverlee, Belgium",
  pages =        "vi + 239",
  year =         "2012",
  ISBN =         "94-91386-02-6",
  ISBN-13 =      "978-94-91386-02-2",
  LCCN =         "QA76.17 .D38 2012",
  bibdate =      "Tue Mar 17 06:10:32 MDT 2015",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib",
  note =         "Edited by Kurt {De Grave}.",
  acknowledgement = ack-nhfb,
  remark =       "Includes Interviews with 4 Turing Award Winners: Tony
                 Hoare, Barbara Liskov, Niklaus Wirth, Peter Naur.",
  subject =      "Software Engineering.",
  subject-dates = "Edsger Wybe Dijkstra (1930--2002); Peter Naur
                 (1928--2016); Alan Mathison Turing (1912--1954)",
  tableofcontents = "1: Introduction / 1 \\
                 2: Turing's influence on programming / 13 \\
                 3: Dijkstra's rallying cry for generalization / 43 \\
                 4: Tony Hoare and mathematical logic / 79 \\
                 5: Niklaus Wirth and software engineering / 105 \\
                 6: Barbara Liskov and data abstractions / 133 \\
                 7: Peter Naur and Turing's 1936 paper / 165 \\
                 8: Deromanticizing Turing's role in history / 187 \\
                 Endnotes / 199 \\
                 Bibliography / 213 \\
                 Index / 234",
}

@Proceedings{Gibbons:2012:MPC,
  editor =       "Jeremy Gibbons and Pablo Nogueira",
  booktitle =    "Mathematics of program construction: {11th
                 International Conference, MPC 2012, Madrid, Spain, June
                 25--27, 2012, Proceedings}",
  title =        "Mathematics of program construction: {11th
                 International Conference, MPC 2012, Madrid, Spain, June
                 25--27, 2012, Proceedings}",
  volume =       "7342",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 362",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-31113-0",
  ISBN =         "3-642-31112-1 (print), 3-642-31113-X (e-book)",
  ISBN-13 =      "978-3-642-31112-3 (print), 978-3-642-31113-0
                 (e-book)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA76.9.M65 M63 2012",
  MRclass =      "68N19",
  MRnumber =     "2988039",
  MRreviewer =   "Sergey Nikolayevich Baranov",
  bibdate =      "Wed Dec 19 15:20:29 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-31113-0_2/",
  abstract =     "This book constitutes the refereed proceedings of the
                 11th International Conference on Mathematics of Program
                 Construction, MPC 2012, held in Madrid, Spain, in June
                 2012. The 13 revised full papers presented together
                 with three invited talks were carefully reviewed and
                 selected from 27 submissions. The papers are organized
                 in topical sections on security and information flow,
                 synchronous and real-time systems, algorithms and
                 games, program calculi, tool support, algebras and
                 datatypes, and categorical functional programming.",
  acknowledgement = ack-nhfb,
  series-URL =   "http://link.springer.com/bookseries/558",
  tableofcontents = "Probabilistic Relational Hoare Logics for
                 Computer-Aided Security Proofs / Gilles Barthe,
                 Benjamin Gr{\'e}goire and Santiago Zanella B{\'e}guelin
                 / 1--6 \\
                 The Laws of Programming Unify Process Calculi / Tony
                 Hoare and Stephan van Staden / 7--22 \\
                 The Geometry of Synthesis: How to Make Hardware Out of
                 Software / Dan R. Ghica / 23--24 \\
                 Scheduler-Independent Declassification / Alexander Lux,
                 Heiko Mantel and Matthias Perner / 25--47 \\
                 Elementary Probability Theory in the Eindhoven Style /
                 Carroll Morgan / 48--73 \\
                 Scheduling and Buffer Sizing of n-Synchronous Systems:
                 Typing of Ultimately Periodic Clocks in Lucy-n / Louis
                 Mandel and Florence Plateau / 74--101 \\
                 Deriving Real-Time Action Systems Controllers from
                 Multiscale System Specifications / Brijesh Dongol and
                 Ian J. Hayes / 102--131 \\
                 Calculating Graph Algorithms for Dominance and Shortest
                 Path / Ilya Sergey, Jan Midtgaard and Dave Clarke /
                 132--156 \\
                 First-Past-the-Post Games / Roland Backhouse / 157--176
                 \\
                 Reverse Exchange for Concurrency and Local Reasoning /
                 Han-Hing Dang and Bernhard M{\"o}ller / 177--197 \\
                 Unifying Correctness Statements / Walter Guttmann /
                 198--219 \\
                 Dependently Typed Programming Based on Automated
                 Theorem Proving / Alasdair Armstrong, Simon Foster and
                 Georg Struth / 220--240 \\
                 An Algebraic Calculus of Database Preferences /
                 Bernhard M{\"o}ller, Patrick Roocks and Markus Endres /
                 241--262 \\
                 Modular Tree Automata / Patrick Bahr / 263--299 \\
                 Constructing Applicative Functors / Ross Paterson /
                 300--323 \\
                 Kan Extensions for Program Optimisation Or: Art and Dan
                 Explain an Old Trick / Ralf Hinze / 324--362",
}

@Proceedings{Haddad:2012:ATP,
  editor =       "Serge Haddad and Lucia Pomello",
  booktitle =    "{Application and Theory of Petri Nets: 33rd
                 International Conference, PETRI NETS 2012, Hamburg,
                 Germany, June 25--29, 2012. Proceedings}",
  title =        "{Application and Theory of Petri Nets: 33rd
                 International Conference, PETRI NETS 2012, Hamburg,
                 Germany, June 25--29, 2012. Proceedings}",
  volume =       "7347",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 417",
  year =         "2012",
  CODEN =        "LNCSD9",
  DOI =          "https://doi.org/10.1007/978-3-642-31131-4",
  ISBN =         "3-642-31131-8",
  ISBN-13 =      "978-3-642-31131-4",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "QA75.5-76.95",
  bibdate =      "Wed Dec 19 15:20:35 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2012e.bib",
  series =       ser-LNCS,
  URL =          "https://link.springer.com/book/10.1007/978-3-642-31131-4",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/bookseries/558",
  tableofcontents = "Net Models for Concurrent Object Behaviour / Tony
                 Hoare / 1--2 \\
                 The Theory of WSTS: The Case of Complete WSTS / Alain
                 Finkel and Jean Goubault-Larrecq / 3--31 \\
                 Using Colored Petri Nets to Construct Coalescent Hidden
                 Markov Models: Automatic Translation from Demographic
                 Specifications to Efficient Inference Methods / Thomas
                 Mailund, Anders E. Halager and Michael Westergaard /
                 32--50 \\
                 An SMT-Based Discovery Algorithm for C-Nets / Marc
                 Sol{\'e} and Josep Carmona / 51--71 \\
                 Decomposing Process Mining Problems Using Passages /
                 Wil M. P. van der Aalst / 72--91\\
                 Complexity of the Soundness Problem of Bounded Workflow
                 Nets / Guan Jun Liu, Jun Sun, Yang Liu and Jin Song
                 Dong / 92--107 \\
                 Cost Soundness for Priced Resource-Constrained Workflow
                 Nets / Mar{\'y}ia Martos-Salgado and Fernando
                 Rosa-Velardo / 108--127 \\
                 On the $\alpha$-Reconstructibility of Workflow Nets /
                 Eric Badouel / 128--147 \\
                 On Profiles and Footprints --- Relational Semantics for
                 Petri Nets / Matthias Weidlich and Jan Martijn van der
                 Werf / 148--167 \\
                 Data and Abstraction for Scenario-Based Modeling with
                 Petri Nets / Dirk Fahland and Robert Pr{\'y}ufer /
                 168--187 \\
                 Maximal Confluent Processes / Xu Wang / 188--207 \\
                 Old and New Algorithms for Minimal Coverability Sets /
                 Antti Valmari and Henri Hansen / 208--227 \\
                 Stubborn Sets for Simple Linear Time Properties /
                 Andreas Lehmann, Niels Lohmann and Karsten Wolf /
                 228--247 \\
                 Hybrid On-the-Fly LTL Model Checking with the
                 Sweep-Line Method / Sami Evangelista and Lars Michael
                 Kristensen / 248--267 \\
                 Safety Slicing Petri Nets / Astrid Rakow / 268--287 \\
                 Capacity Planning for Vertical Search Engines: An
                 Approach Based on Coloured Petri Nets / Veronica
                 Gil-Costa, Jair Lobos, Alonso Inostrosa-Psijas and
                 Mauricio Marin / 288--307 \\
                 An Infrastructure for Cost-Effective Testing of
                 Operational Support Algorithms Based on Colored Petri
                 Nets / Joyce Nakatumba, Michael Westergaard and Wil M.
                 P. van der Aalst / 308--327 \\
                 Designing Weakly Terminating ROS Systems / Debjyoti
                 Bera, Kees M. van Hee and Jan Martijn van der Werf /
                 328--347 \\
                 Nets-within-Nets to Model Innovative Space System
                 Architectures / Fr{\'e}d{\'e}ric Cristini and Catherine
                 Tessier / 348--367 \\
                 P- and T-Systems in the Nets-within-Nets-Formalism /
                 Frank Heitmann and Michael K{\"o}hler-Bu{\ss}meier /
                 368--387 \\
                 Stochastic Modeling and Analysis Using QPME: Queueing
                 Petri Net Modeling Environment v2.0 / Simon Spinner,
                 Samuel Kounev and Philipp Meier / 388--397 \\
                 Snoopy --- A Unifying Petri Net Tool / Monika Heiner,
                 Mostafa Herajy, Fei Liu, Christian Rohr and Martin
                 Schwarick / 398--407 \\
                 CPN Assistant II: A Tool for Management of Networked
                 Simulations / {\v{S}}tefan Kore{\'c}ko, J{\'a}n
                 Marcin{\v{c}}in and Viliam Slodi{\v{c}}{\'a}k /
                 408--417",
}

@Proceedings{Jones:2013:ICC,
  editor =       "Andrew V. Jones and Nicholas Ng",
  booktitle =    "{2013 Imperial College Computing Student Workshop:
                 ICCSW'13 September 26--27, 2013, London, United
                 Kingdom}",
  title =        "{2013 Imperial College Computing Student Workshop:
                 ICCSW'13 September 26--27, 2013, London, United
                 Kingdom}",
  volume =       "35",
  publisher =    "Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r
                 Informatik",
  address =      "Dagstuhl, Germany",
  year =         "2013",
  DOI =          "https://doi.org/10.4230/OASIcs.ICCSW.2013",
  ISBN =         "3-939897-63-9",
  ISBN-13 =      "978-3-939897-63-7",
  ISSN =         "2190-6807",
  ISSN-L =       "2190-6807",
  bibdate =      "Sat Jul 30 10:06:08 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "Open Access Series in Informatics (OASIcs)",
  URL =          "http://www.dagstuhl.de/dagpub/978-3-939897-63-7;
                 https://drops.dagstuhl.de/opus/volltexte/2013/4349;
                 https://drops.dagstuhl.de/opus/volltexte/2013/4349/pdf/oasics_vol35_iccsw2013_complete_volume.pdf",
  acknowledgement = ack-nhfb,
  annote =       "Keywords: Conference Proceedings",
  tableofcontents = "Preface \\
                 Andrew V. Jones and Nicholas Ng / i \\
                 Keynotes \\
                 Laws of programming with concurrency / Tony Hoare / 1
                 \\
                 Building Better Online Courses / Peter Norvig / 2 \\
                 Regular Papers \\
                 A swarm based heuristic for sparse image recovery /
                 Theofanis Apostolopoulos / 3 \\
                 Scalable and Fault-tolerant Stateful Stream Processing
                 / Raul Castro Fernandez, Matteo Migliavacca, Evangelia
                 Kalyvianaki, and Peter Pietzuch / 11 \\
                 Generalizing Multi-Context Systems for Reactive Stream
                 Reasoning Applications / Stefan Ellmauthaler / 19 \\
                 Conformal Prediction under Hypergraphical Models /
                 Valentina Fedorova, Alex Gammerman, Ilia Nouretdinov,
                 and Vladimir Vovk / 27 \\
                 Relational Knowledge Extraction from Attribute-Value
                 Learners / Manoel V. M. Fran{\c{c}}a, Artur S. D.
                 Garcez, and Gerson Zaverucha / 35 \\
                 Tools for the implementation of argumentation models /
                 Bas van Gijzel / 43 \\
                 Towards the Development of a Hybrid Parser for Natural
                 Languages / Sardar F. Jaf and Allan Ramsay / 49 \\
                 Improving the quality of APIs through the analysis of
                 software crash reports / Maria Kechagia, Dimitris
                 Mitropoulos, and Diomidis Spinellis / 57 \\
                 Fast Implementation of the Scalable Video Coding
                 Extension of the H.264/AVC Standard / Xin Lu and Graham
                 R. Martin / 65 \\
                 Improved Rate Control Algorithm for Scalable Video
                 Coding / Xin Lu and Graham R. Martin / 73 \\
                 An Optimal Real-time Pricing Algorithm for the Smart
                 Grid: A Bi-level Programming Approach / Fan-Lin Meng
                 and Xiao-Jun Zeng / 81 \\
                 Dreaming Machines: On multimodal fusion and information
                 retrieval using neural-symbolic cognitive agents / Leo
                 de Penning, Artur d Avila Garcez, and John-Jules C.
                 Meyer / 89 \\
                 Self-composition by Symbolic Execution / Quoc-Sang Phan
                 / 95 \\
                 Evaluation of Social Personalized Adaptive E-Learning
                 Environments: End-User Point of View / Lei Shi, Malik
                 Shahzad Awan, and Alexandra I. Cristea / 103 \\
                 Logical Foundations of Services / Ionu{\c{t}} u{\c{t}}u
                 / 111 \\
                 Refactoring Boundary / Tim Wood and Sophia Drossopoulou
                 / 119 \\
                 Using Self-learning and Automatic Tuning to Improve the
                 Performance of Sexual Genetic Algorithms for Constraint
                 Satisfaction Problems / Hu Xu, Karen Petrie, and Iain
                 Murray / 128 \\
                 Achieving Superscalar Performance without Superscalar
                 Overheads --- A Dataflow Compiler IR for Custom
                 Computing / Ali Mustafa Zaidi and David J. Greaves /
                 136 \\
                 A Graph based approach for Co-scheduling jobs on
                 Multi-core computers / Huanzhou Zhu and Ligang He /
                 144",
  URN =          "urn:nbn:de:0030-drops-43496",
}

@Proceedings{Liu:2013:TPF,
  editor =       "Zhiming Liu and J. Woodcock and Huibiao Zhu",
  booktitle =    "Theories of Programming and Formal Methods --- Essays
                 Dedicated to {Jifeng He} on the Occasion of His 70th
                 Birthday",
  title =        "Theories of Programming and Formal Methods --- Essays
                 Dedicated to {Jifeng He} on the Occasion of His 70th
                 Birthday",
  volume =       "8051",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 413 + 86",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-3-642-39698-4",
  ISBN =         "3-642-39697-6 (print), 3-642-39698-4 (e-book)",
  ISBN-13 =      "978-3-642-39697-7 (print), 978-3-642-39698-4
                 (e-book)",
  ISSN =         "0302-9743",
  LCCN =         "QA75.5-76.95",
  bibdate =      "Mon Aug 1 11:42:42 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  abstract =     "This Festschrift volume, dedicated to He Jifeng on the
                 occasion of his 70th birthday in September 2013,
                 includes 24 refereed papers by leading researchers,
                 current and former colleagues, who congratulated at a
                 celebratory symposium held in Shanghai, China, in the
                 course of the 10th International Colloquium on
                 Theoretical Aspects of Computing, ICTAC 2013. The
                 papers cover a broad spectrum of subjects, from
                 foundational and theoretical topics to programs and
                 systems issues and to applications, comprising formal
                 methods, software and systems modeling, semantics, laws
                 of programming, specification and verification, as well
                 as logics. He Jifeng is known for his seminal work in
                 the theories of programming and formal methods for
                 software engineering. He is particularly associated
                 with Unifying Theories of Programming (UTP), the theory
                 of data refinement and the laws of programming, and the
                 rCOS formal method for object and component system
                 construction. His book on UTP with Tony Hoare has been
                 widely read and followed by a large number of
                 researchers, and it has been used in many postgraduate
                 courses. He was a senior researcher at Oxford during
                 1984--1998, and then a senior research fellow at the
                 United Nations University International Institute for
                 Software Technology (UNU-IIST) in Macau during
                 1998--2005. He has been a professor and currently the
                 Dean of the Institute of Software Engineering at East
                 China Normal University, Shanghai, China. In 2005, He
                 Jifeng was elected as an academician to the Chinese
                 Academy of Sciences. He also received an honorary
                 doctorate from the University of York. He won a number
                 of prestigious science and technology awards, including
                 a 2nd prize of Natural Science Award from the State
                 Council of China, a 1st prize of Natural Science Award
                 from the Ministry of Education of China, a 1st prize of
                 Technology Innovation from the Ministry of Electronic
                 Industry, and a number awards from Shanghai
                 government.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Set-Theoretic Models of Computations / Jean-Raymond
                 Abrial \\
                 Model-Based Mutation Testing of Reactive Systems /
                 Bernhard K. Aichernig \\
                 Pliant Modalities in Hybrid Event-B / Richard Banach
                 \\
                 A Relational Approach to an Algebraic Community: From
                 Paul Erd{\H{o}}s to He Jifeng / Jonathan P. Bowen \\
                 Practical Theory Extension in Event-B / Michael Butler,
                 Issam Maamria \\
                 Simulink Timed Models for Program Verification / Ana
                 Cavalcanti, Alexandre Mota, Jim Woodcock \\
                 Concept Analysis Based Approach to Statistical Web
                 Testing / Chao Chen, Huaikou Miao, Yihai Chen \\
                 Algebraic Program Semantics for Supercomputing / Yifeng
                 Chen \\
                 Modeling and Specification of Real-Time Interfaces with
                 UTP / Hung Dang Van, Hoang Truong \\
                 Some Fixed-Point Issues in PPTL / Zhenhua Duan, Qian
                 Ma, Cong Tian, Nan Zhang \\
                 The Value-Passing Calculus / Yuxi Fu \\
                 Proving Safety of Traffic Manoeuvres on Country Roads /
                 Martin Hilscher, Sven Linker \\
                 Generic Models of the Laws of Programming / Tony Hoare
                 \\
                 Ours Is to Reason Why / Cliff B. Jones, Leo Freitas,
                 Andrius Velykis \\
                 Optimal Bounds for Multiweighted and Parametrised
                 Energy Games / Line Juhl, Kim Guldstrand Larsen \\
                 On the Relationship between LTL Normal Forms and
                 B{\"u}chi Automata / Jianwen Li, Geguang Pu, Lijun
                 Zhang \\
                 Managing Environment and Adaptation Risks for the
                 Internetware Paradigm / Jian L{\"u}, Yu Huang, Chang
                 Xu, Xiaoxing Ma \\
                 Safety versus Security in the Quality Calculus / Hanne
                 Riis Nielson, Flemming Nielson \\
                 Invariants Synthesis over a Combined Domain for
                 Automated Program Verification / Shengchao Qin, Guanhua
                 He, Wei-Ngan Chin \\
                 Slow Abstraction via Priority / A. W. Roscoe, Philippa
                 J. Hopcroft \\
                 Performance Estimation Using Symbolic Data / Jian Zhang
                 \\
                 Synthesizing Switching Controllers for Hybrid Systems
                 by Generating Invariants / Hengjun Zhao, Naijun Zhan,
                 Deepak Kapur \\
                 Graph-Based Object-Oriented Hoare Logic / Liang Zhao,
                 Shuling Wang, Zhiming Liu \\
                 Towards a Modeling Language for Cyber-Physical Systems
                 / Longfei Zhu, Yongxin Zhao, Huibiao Zhu",
}

@Proceedings{Wolff:2013:UTP,
  editor =       "Burkhart Wolff and Marie-Claude Gaudel and
                 Abderrahmane Feliachi",
  booktitle =    "Unifying Theories of Programming: {4th International
                 Symposium, UTP 2012, Paris, France, August 27--28,
                 2012, Revised Selected Papers}",
  title =        "Unifying Theories of Programming: {4th International
                 Symposium, UTP 2012, Paris, France, August 27--28,
                 2012, Revised Selected Papers}",
  volume =       "7681",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "viii + 249",
  year =         "2013",
  DOI =          "https://doi.org/10.1007/978-3-642-35705-3",
  ISBN =         "3-642-35704-0 (paperback), 3-642-35705-9 (e-book)",
  ISBN-13 =      "978-3-642-35704-6 (paperback), 978-3-642-35705-3
                 (e-book)",
  LCCN =         "QA76.6 .U87 2012",
  bibdate =      "Mon Aug 1 14:46:37 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  tableofcontents = "Unifying Theories of Undefinedness in UTP / Jim
                 Woodcock and Victor Bandur / 1 \\
                 Unifying Theories of Programming with Monads / Jeremy
                 Gibbons / 23 \\
                 Circus Time with Reactive Designs / Kun Wei, Jim
                 Woodcock, and Ana Cavalcanti / 68 \\
                 Algebra Unifies Operational Calculi / Stephan van
                 Staden and Tony Hoare / 88 \\
                 A Probabilistic Theory of Designs Based on
                 Distributions / Riccardo Bresciani and Andrew
                 Butterfield / 105 \\
                 The Logic of $U \cdot (T P)^2$ / Andrew Butterfield /
                 124 \\
                 Conscriptions: A New Relational Model for Sequential
                 Computations / Steve Dunne / 144 \\
                 Mechanical Approach to Linking Operational Semantics
                 and Algebraic Semantics for Verilog Using Maude /
                 Huibiao Zhu, Peng Liu, Jifeng He, and Shengchao Qin /
                 164 \\
                 Unifying Operational Semantics with Algebraic Semantics
                 for Instantaneous Reactions / Chengcheng Wu, Yongxin
                 Zhao, and Huibiao Zhu / 186 \\
                 Higher-Order UTP for a Theory of Methods / Frank Zeyda
                 and Ana Cavalcanti / 204 \\
                 Denotational Semantics for a Probabilistic Timed
                 Shared-Variable Language / Huibiao Zhu, Jeff W.
                 Sanders, Jifeng He, and Shengchao Qin / 224 Author
                 Index / 249",
}

@Proceedings{Hofner:2014:RAM,
  editor =       "P. H{\"o}fner and Peter Jipsen and Wolfram Kahl and
                 Martin Eric M{\"u}ller",
  booktitle =    "Relational and Algebraic Methods in Computer Science:
                 {14th International Conference, RAMiCS 2014,
                 Marienstatt, Germany, April 28--May 1, 2014,
                 Proceedings}",
  title =        "Relational and Algebraic Methods in Computer Science:
                 {14th International Conference, RAMiCS 2014,
                 Marienstatt, Germany, April 28--May 1, 2014,
                 Proceedings}",
  volume =       "8428",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 463 + 28",
  year =         "2014",
  DOI =          "https://doi.org/10.1007/978-3-319-06251-8",
  ISBN =         "3-319-06250-6 (paperback), 3-319-06251-4 (e-book)",
  ISBN-13 =      "978-3-319-06250-1 (paperback), 978-3-319-06251-8
                 (e-book)",
  LCCN =         "QA8.9-QA10.3; QA76.9.M35 R36 2014",
  bibdate =      "Tue Aug 09 16:21:17 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "https://doi.org/10.1007/978-3-319-06251-8",
  abstract =     "This book constitutes the proceedings of the 14th
                 International Conference on Relational and Algebraic
                 Methods in Computer Science, RAMiCS 2014 held in
                 Marienstatt, Germany, in April/May 2014. The 25 revised
                 full papers presented were carefully selected from 37
                 submissions. The papers are structured in specific
                 fields on concurrent Kleene algebras and related
                 formalisms, reasoning about computations and programs,
                 heterogeneous and categorical approaches, applications
                 of relational and algebraic methods, and developments
                 related to modal logics and lattices.",
  acknowledgement = ack-nhfb,
  tableofcontents = "Developments in Concurrent Kleene Algebra (Invited
                 Talk) \\
                 Endowing Concurrent Kleene Algebra with Communication
                 Actions \\
                 Concurrent Kleene Algebra with Tests \\
                 Algebras for Program Correctness in Isabelle/HOL \\
                 Completeness Theorems for Bi-Kleene Algebras and
                 Series-Parallel Rational Pomset Languages \\
                 A Modified Completeness Theorem of KAT and Decidability
                 of Term Reducibility \\
                 Kleene Algebra with Converse \\
                 Preparing Relational Algebra for ``Just Good Enough''
                 Hardware (Invited Talk) \\
                 Extended Conscriptions Algebraically \\
                 Abstract Dynamic Frames \\
                 Automated Verification of Relational While-Programs \\
                 On Faults and Faulty Programs \\
                 Parameterised Bisimulations: Some Applications \\
                 A Point-Free Relation-Algebraic Approach to General
                 Topology \\
                 A Mechanised Abstract Formalisation of Concept Lattices
                 \\
                 A Sufficient Condition for Liftable Adjunctions between
                 Eilenberg-Moore Categories \\
                 Higher-Order Arrow Categories \\
                 Type-2 Fuzzy Controllers in Arrow Categories.-Relation
                 Algebra and RelView Applied to Approval Voting \\
                 Relational Lattices \\
                 Towards Finding Maximal Subrelations with Desired
                 Properties \\
                 Complete Solution of a Constrained Tropical
                 Optimization Problem with Application to Location
                 Analysis \\
                 Refinements of the RCC25 Composition Table \\
                 Fuzzifying Modal Algebra \\
                 Tableau Development for a Bi- intuitionistic Tense
                 Logic \\
                 Nominal Sets over Algebraic Atoms \\
                 Fixed-Point Theory in the Varieties Dn",
}

@Proceedings{Ribeiro:2019:UTP,
  editor =       "Pedro (Pedro Fernando de Oliveira Salazar) Ribeiro and
                 Augusto Sampaio",
  booktitle =    "{Unifying theories of programming: 7th International
                 Symposium, UTP 2019, dedicated to Tony Hoare on the
                 occasion of his 85th birthday, Porto, Portugal, October
                 8, 2019: proceedings}",
  title =        "{Unifying theories of programming: 7th International
                 Symposium, UTP 2019, dedicated to Tony Hoare on the
                 occasion of his 85th birthday, Porto, Portugal, October
                 8, 2019: proceedings}",
  volume =       "11885",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 216",
  year =         "2019",
  DOI =          "https://doi.org/10.1007/978-3-030-31038-7",
  ISBN =         "3-030-31037-X (paperback), 3-030-31038-8 (e-book)",
  ISBN-13 =      "978-3-030-31037-0 (paperback), 978-3-030-31038-7
                 (e-book)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "QA76.6 .U86 2019",
  bibdate =      "Sat Jul 30 15:35:25 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       ser-LNCS,
  URL =          "http://link.springer.com/",
  acknowledgement = ack-nhfb,
  remark =       "LNCS sublibrary. SL 1 - Theoretical computer science
                 and general issues",
  subject =      "Computer programming; Congresses; Formal methods
                 (Computer science); Programmation (Informatique);
                 Congr{\'e}s; M{\'e}thodes formelles (Informatique);
                 Computer programming.; Formal methods (Computer
                 science)",
  tableofcontents = "Intro \\
                 Preface \\
                 Organization \\
                 Contents \\
                 Unification Approaches \\
                 A Calculus of Space, Time, and Causality: Its Algebra,
                 Geometry, Logic / Tony Hoare, Georg Struth, Jim
                 Woodcock / 3--21 \\
                 1 Introduction \\
                 2 Extended Summary \\
                 2.1 The Calculus \\
                 2.2 Causality, Space, and Time \\
                 2.3 Geometry \\
                 2.4 Logic \\
                 3 The Calculus \\
                 3.1 The Algebra of Traces \\
                 3.2 Applications \\
                 3.3 The Algebra of Programs \\
                 4 Symmetries \\
                 5 Future Directions \\
                 5.1 Unifying Theories of Programming \\
                 5.2 Applications of Concurrent Kleene Algebra \\
                 5.3 Implementing the Calculus \\
                 5.4 Object Orientation and UTP \\
                 5.5 Extensions of the Calculus \\
                 6 Conclusion \\
                 References \\
                 A Testing Perspective on Algebraic, Denotational, and
                 Operational Semantics \\
                 Bernhard K. Aichernig / 22--38 \\
                 1 Introduction / 2 Preliminaries \\
                 2.1 Model-Based Testing \\
                 2.2 Model-Based Mutation Testing \\
                 3 Operational Semanctics \\
                 3.1 Overview \\
                 3.2 Conformance of Input-Output LTSs \\
                 3.3 Explicit Conformance Checking \\
                 3.4 Action Systems \\
                 3.5 Symbolic Conformance Checking \\
                 4 Denotational Semantics \\
                 4.1 Transformational Systems \\
                 4.2 Action Systems \\
                 5 Algebraic Semantics \\
                 6 Concluding Remarks \\
                 References \\
                 Whither Specifications as Programs / David A. Naumann,
                 Minh Ngo / 39--61 \\
                 1 Introduction \\
                 2 Programs and Specifications as Binary Relations \\
                 3 Programs as Forward Predicate Transformers \\
                 4 Programs as h-Transformers \\
                 5 Specifications and Refinement \\
                 6 Related Work \\
                 7 Conclusion \\
                 References \\
                 Connecting Fixpoints of Computations with Strict
                 Progress / Walter Guttmann / 62--79 \\
                 1 Introduction \\
                 2 Basic Definitions \\
                 2.1 Algebraic Structures \\
                 2.2 A Unified Model for Computations with Progress \\
                 3 Overall Strategy \\
                 4 Connecting Fixpoints Algebraically \\
                 5 Connecting Fixpoints of Computations with Progress
                 \\
                 6 Conclusion \\
                 References \\
                 Probabilistic Semantics for RoboChart / Jim Woodcock,
                 Ana Cavalcanti, Simon Foster, Alexandre Mota, Kangfeng
                 Ye / 80--105 \\
                 1 Introduction \\
                 2 RoboChart \\
                 3 Unifying Theories of Programming \\
                 4 Weakest Preconditions and Prespecifications \\
                 5 Weakest Completion Semantics \\
                 6 Probabilistic Programs \\
                 7 Probabilistic Choice and Combining Distributions \\
                 8 Nondeterministic Choice \\
                 9 Related Work \\
                 10 Conclusions and Future Work \\
                 A Connecting Weakest Preconditions and
                 Prespecifications \\
                 References \\
                 Hybrid Models \\
                 Unified Graphical Co-modelling of Cyber-Physical
                 Systems Using AADL and Simulink/Stateflow / Haolan
                 Zhan, Qianqian Lin, Shuling Wang, Jean-Pierre Talpin,
                 Xiong Xu, Naijun Zhan / 109--129 \\
                 1 Introduction \\
                 2 Preliminaries \\
                 2.1 AADL \\
                 2.2 Simulink/Stateflow \\
                 2.3 Design by Contract \\
                 3 Isollete System: A Running Example \\
                 3.1 Isollete System \\
                 3.2 Requirements \\
                 4 Combination of AADL and Simulink/Stateflow \\
                 4.1 General Framework \\
                 4.2 Computing Type Classifier for Simulink/Stateflow
                 Diagrams \\
                 4.3 Defining Type Classifier as Contracts \\
                 5 Co-modelling and Co-simulation \\
                 5.1 Co-modelling in AADL and Simulink/Stateflow \\
                 5.2 Model Translation to C \\
                 5.3 Co-simulation \\
                 6 Related Work \\
                 7 Conclusion and Future Work \\
                 References \\
                 Hybrid Relations in Isabelle/UTP / Simon Foster /
                 130--153 \\
                 1 Introduction \\
                 2 Hybrid Systems and Programs \\
                 3 Isabelle/UTP \\
                 4 Trace Algebra and Generalised Reactive Relations \\
                 5 Continuous State and Timed Traces \\
                 6 Hybrid Relations \\
                 6.1 Continuous Variables \\
                 \ldots{} \\
                 The Inner and Outer Algebras of Unified Concurrency /
                 Andrew Butterfield / 157--175 Developing an Algebra for
                 Rely/Guarantee Concurrency: Design Decisions and
                 Challenges / Ian J. Hayes, Larissa A. Meinicke /
                 176--197 \\
                 UTP Semantics of a Calculus for Mobile Ad Hoc Networks
                 / Xi Wu, Huibiao Zhu, Wanling Xie / 198--216 \\
                 Back Matter / 217--217",
}

@Book{Jones:2021:TPL,
  editor =       "Cliff B. Jones and Jayadev Misra",
  booktitle =    "Theories of Programming: The Life and Works of {Tony
                 Hoare}",
  title =        "Theories of Programming: The Life and Works of {Tony
                 Hoare}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xx + 430",
  year =         "2021",
  DOI =          "https://doi.org/10.1145/3477355",
  ISBN =         "1-4503-8728-4",
  ISBN-13 =      "978-1-4503-8728-6",
  LCCN =         "QA76.6",
  bibdate =      "Sat Jul 30 08:09:18 2022",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  acknowledgement = ack-nhfb,
  tableofcontents = "Preface / Cliff Jones, Jayadev Misra / xvii -xx /
                 doi: 10.1145/3477355.3477356 \\
                 Part I: Introduction / 1--2 \\
                 1: The 1980 ACM Turing Award Lecture / Tony Hoare /
                 3--22 / doi: 10.1145/3477355.3477357 \\
                 2: Finding Effective Abstractions / Cliff Jones,
                 Jayadev Misra / 23--40 / doi: 10.1145/3477355.3477358
                 \\
                 Part II: Program Verification / 41--42 \\
                 3: Assessing the Success and Impact of Hoare's Logic /
                 Krzysztof R. Apt, Ernst-R{\"u}diger Olderog / 43--76 /
                 doi: 10.1145/3477355.3477359 \\
                 4: Preface to Special Issue on Software Verification /
                 C. A. R. Hoare, Jayadev Misra / 77--80 / doi:
                 10.1145/3477355.3477360 \\
                 5: The Verified Software Initiative: a Manifesto / Tony
                 Hoare, Jayadev Misra, Gary T. Leavens, and Natarajan
                 Shankar / 81--92 / doi: 10.1145/3477355.3477361 \\
                 6: The First Fifteen Years of the Verified Software
                 Project / Peter M{\"u}ller, Natarajan Shankar / 93--124
                 / doi: 10.1145/3477355.3477362 \\
                 7: Verification in the Grand Challenge / Jim Woodcock,
                 Janet Barnes, Rod Chapman, Simon Foster, and Thomas
                 Santen / 125--156 / doi: 10.1145/3477355.3477363 \\
                 Part III: Communicating Sequential Processes / 157--158
                 \\
                 Communicating Sequential Processes / C. A. R. Hoare /
                 159--186 / doi: 10.1145/3477355.3477364 \\
                 9: CSP: a Practical Process Algebra / Stephen D.
                 Brookes, A. W. Roscoe / 187--222 / doi:
                 10.1145/3477355.3477365 \\
                 Part IV: Teaching and Industrial Affiliations /
                 223--224 \\
                 10: Teaching at Belfast and Oxford / Bernard Sufrin /
                 225--250 / doi: 10.1145/3477355.3477366 \\
                 11: Software Specification / Ian J. Hayes, Steve King /
                 251--270 / doi: 10.1145/3477355.3477367 \\
                 12: CSP, Occam, and Inmos / David May / 271--284 / doi:
                 10.1145/3477355.3477368 \\
                 Part V: Recent Research Directions / 258--286 \\
                 13: Hoare and He's Unifying Theories of Programming /
                 Jim Woodcock / 287--316 / doi: 10.1145/3477355.3477369
                 \\
                 14: Trimming the Hedges: an Algebra to Tame Concurrency
                 / Georg Struth / 317--346 / doi:
                 10.1145/3477355.3477370 \\
                 Part VI: Retrospect and Prospect / 347--348 \\
                 Envoi / Tony Hoare / 349-356 / doi:
                 10.1145/3477355.3477371 \\
                 ACM Interview / 359--386 / doi: 10.1145/3477355.3477372
                 \\
                 CV / Jayadev Misra / 387--392 / doi:
                 10.1145/3477355.3477373 \\
                 Doctoral Students / 393--394 / doi:
                 10.1145/3477355.3477374 \\
                 List of Tony Hoare's Publications / Cliff Jones /
                 395--410 / doi: 10.1145/3477355.3477375 \\
                 Online Resources / Margaret Gray / 411--412 / doi:
                 10.1145/3477355.3477376 \\
                 Authors Biographies / Index / 413--420 / doi:
                 10.1145/3477355.3477377",
}

@Book{Apt:2022:EWD,
  editor =       "Krzysztof R. Apt and Tony Hoare",
  booktitle =    "{Edsger Wybe Dijkstra}: His Life, Work, and Legacy",
  title =        "{Edsger Wybe Dijkstra}: His Life, Work, and Legacy",
  volume =       "45",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xxiv + 550",
  year =         "2022",
  DOI =          "https://doi.org/10.1145/3544585",
  ISBN =         "1-4503-9771-9 (paperback), 1-4503-9772-7 (epub),
                 1-4503-9773-5 (hardcover), 1-4503-9774-3 (e-book)",
  ISBN-13 =      "978-1-4503-9771-1 (paperback), 978-1-4503-9772-8
                 (epub), 978-1-4503-9773-5 (hardcover),
                 978-1-4503-9774-2 (e-book)",
  ISSN =         "2374-6777",
  LCCN =         "DS119 .A685 2022",
  bibdate =      "Wed Aug 10 15:58:25 MDT 2022",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib",
  series =       "ACM books",
  acknowledgement = ack-nhfb,
  remark =       "Preface. Photo Credits. Part I Introduction. 1 The
                 Humble Programmer. Part II Technical Perspectives on
                 Dijkstra's Work. Part III Selected Papers. Part IV
                 Biographical Essays. Part V Varia. Authors'
                 Biographies.",
  subject =      "Edsger Wybe Dijkstra (Computer Science)",
  tableofcontents = "1. ???? / ???? \\
                 2 Dijkstra's Single Source Shortest Path Algorithm /
                 Mikkel Thorup \\
                 2.1 Dijkstra's Algorithm \\
                 2.2 Implementations \\
                 2.3 Dijkstra's SSSP and Beyond \\
                 Acknowledgment \\
                 References \\
                 3 Programming Concurrent Systems / Butler Lampson \\
                 Abstract \\
                 3.1 Introduction \\
                 3.2 Concurrency \\
                 3.3 Why Concurrency? \\
                 3.4 Atomicity and Commuting \\
                 3.5 Taxonomy of Concurrency: Shard, Stream, or Struggle
                 \\
                 3.6 Sharding \\
                 3.7 Streaming \\
                 3.8 Easy Concurrency \\
                 3.9 Hard Concurrency \\
                 3.10 Eventual Consistency \\
                 3.11 Nuisance Concurrency \\
                 3.12 Conclusion \\
                 References \\
                 4 Concurrent Algorithms / Leslie Lamport \\
                 4.1 Introduction \\
                 4.2 Mutual Exclusion \\
                 4.3 Self-stabilization \\
                 4.4 On-the-fly Garbage Collection \\
                 4.5 Termination Detection \\
                 4.6 Conclusion \\
                 References \\
                 5 Origin of Self-Stabilization / Ted Herman \\
                 5.1 Introduction \\
                 5.2 Privileges in a Ring \\
                 5.3 Privileges in an Array \\
                 5.4 Distance Convergence on a Circle \\
                 5.5 Complexity and Verification \\
                 5.6 Relevance \\
                 5.7 Adoption \\
                 5.8 Impact \\
                 5.9 Conclusions \\
                 Acknowledgment \\
                 References \\
                 6 Dijkstra's Legacy on Program Verification / Reiner
                 H{\"a}hnle \\
                 6.1 Dijkstra's View of Program Verification \\
                 6.2 The Weakest Precondition Calculus and Its Context
                 \\
                 6.3 From Program Correctness to Program Certification
                 \\
                 6.4 The Future of the Legacy \\
                 Acknowledgment \\
                 References \\
                 7 Development of Correct Programs / David Gries \\
                 7.1 Recurring Themes \\
                 7.2 What's a Proof? \\
                 7.3 Structured Programming, with Proof of Correctness
                 the Main Concern \\
                 7.4 1968 NATO Conference on Software Engineering \\
                 7.5 1968-1969: A Period of Suffering \\
                 7.6 The Development of Weakest Preconditions \\
                 7.7 A Calculus Based on Leibniz's Substitution of
                 Equals for Equals \\
                 7.8 Proofs of Concurrent Programs \\
                 7.9 Conclusion \\
                 References \\
                 8 Nondeterminism and Guarded Commands / Krzysztof R.
                 Apt and Ernst-R{\"u}diger Olderog \\
                 8.1 Introduction \\
                 8.2 Avoiding Nondeterminism \\
                 8.3 Angelic Nondeterminism \\
                 8.4 Guarded Commands \\
                 8.5 Some Considerations on Guarded Commands \\
                 8.6 Modeling Parallel Programs \\
                 8.7 Communicating Sequential Processes and Their
                 Relation to Guarded Commands \\
                 8.8 Fairness \\
                 8.9 Nondeterminism: Further Developments \\
                 8.10 Conclusions \\
                 Acknowledgements \\
                 References \\
                 9 A Personal View of Edsger W. Dijkstra and His Stance
                 on Software Construction / Christian Lengauer \\
                 References \\
                 10 Applying Dijkstra's Vision to Numerical Software /
                 Robert van de Geijn and Maggie Myers \\
                 10.1 Introduction \\
                 10.2 An Example \\
                 10.3 Decades of Research, Development, and Impact \\
                 10.4 Educating the Masses \\
                 10.5 Conclusion \\
                 Acknowledgments \\
                 References \\
                 11 Calculational Proofs / Vladimir Lifschitz \\
                 11.1 A letter from Dijkstra \\
                 11.2 Dijkstra's Calculational Proofs are Semi-formal
                 \\
                 11.3 Calculational Proofs Can Be Smooth \\
                 11.4 Calculational Proofs versus Natural Deduction \\
                 11.5 Propositional Calculations \\
                 11.6 Reasoning about Predicate Transformers \\
                 11.7 Conclusion \\
                 Acknowledgements \\
                 References \\
                 12 An Homage to the Beautiful Mathematical EWDs /
                 Jayadev Misra \\
                 12.1 Kruskal's Algorithm for Minimum Spanning Tree \\
                 12.2 Fermat's and Wilson's Theorems \\
                 12.3 Arithmetic and Geometric Mean \\
                 12.4 Hall's Theorem on Distinct Representatives \\
                 12.5 Coxeter's Rabbit \\
                 12.6 Concluding Remarks \\
                 Acknowledgement \\
                 References \\
                 13 A Note on Two Problems in Connexion with Graphs / E.
                 W. Dijkstra \\
                 References \\
                 14 Recursive Programming / E. W. Dijkstra \\
                 14.1 The Aim \\
                 14.2 The Stack \\
                 14.3 Stacked Reservations \\
                 14.4 Consequences \\
                 14.5 The Link \\
                 14.6 Recursive Techniques and ALGOL 60 \\
                 Acknowledgements \\
                 Reference \\
                 15 Some Meditations on Advanced Programming / E. W.
                 Dijkstra \\
                 16 Solution of a Problem in Concurrent Programming
                 Control / E. W. Dijkstra \\
                 17 Go To Statement Considered Harmful / E. W. Dijkstra
                 \\
                 Key Words and Phrases \\
                 18 The Structure of the ``THE''-Multiprogramming System
                 / Edsger W. Dijkstra \\
                 18.1 Introduction \\
                 18.2 The Tool and the Goal \\
                 18.3 A Progress Report \\
                 18.4 A Survey of the System Structure \\
                 18.5 Design Experience \\
                 18.6 Conclusion \\
                 Acknowledgements \\
                 18.A Appendix \\
                 19 Self-stabilizing Systems in Spite of Distributed
                 Control / Edsger W. Dijkstra \\
                 References \\
                 20 On-the-Fly Garbage Collection: An Exercise in
                 Cooperation / Edsger W. Dijkstra, Leslie Lamport, A.J.
                 Martin, C.S. Scholten, and E.F.M. Steffens \\
                 20.1 Introduction \\
                 20.2 The Grain of Action \\
                 20.3 Reformulation of the Problem \\
                 20.4 The First Coarse-Grained Solution \\
                 20.5 A New Coarse-Grained Solution \\
                 20.6 A Fine-Grained Solution \\
                 References \\
                 21 On the Reliability of Programs / E. W. Dijkstra \\
                 22 Edsger Dijkstra, The Man Who Carried Computer
                 Science on His Shoulders / Krzysztof R. Apt \\
                 22.1 Biography \\
                 22.2 EWDs \\
                 22.3 Early Contributions \\
                 22.4 Eighties \\
                 22.5 Nineties \\
                 22.6 Opinions and Attitudes \\
                 22.7 Character and Lifestyle \\
                 22.8 Legacy \\
                 References \\
                 23 Memories of Edsger W. Dijkstra / E. Allen Emerson
                 \\
                 23.1 Weakest Preconditions \\
                 23.2 Fairness \\
                 23.3 Personal Reminiscences \\
                 References \\
                 24 Reflections on Edsger and His Influence / David
                 Gries \\
                 References \\
                 25 Forty Years with Edsger / Tony Hoare \\
                 References 26 Edsger Dijkstra-Some Reminiscences /
                 Brian Randell \\
                 26.1 Introduction \\
                 26.2 Brighton 1961 \\
                 26.3 Visit to the Mathematical Centre \\
                 26.4 Our Trip Report and Book \\
                 26.5 1964-IBM and Algol WG 2.1 \\
                 26.6 1967-SOSP \\
                 26.7 The THE Operating System \\
                 26.8 The 1968 NATO S/W Engineering Conference \\
                 26.9 Algol 68 \\
                 26.10 The 1969 NATO Conference \\
                 26.11 In 12 Months from June 1974 \\
                 26.12 Some EWD Interludes \\
                 26.13 The 60th Birthday Salute \\
                 References \\
                 27 Evoking Whitehead's Dictum / Fred B. Schneider \\
                 27.1 Dijkstra's Influence: On Concurrent Programming
                 \\
                 27.2 Dijkstra's Influence: On Becoming a Researcher \\
                 Acknowledgements \\
                 References \\
                 28 Edsger W. Dijkstra in the Eyes of His Friends,
                 Colleagues, and Students \\
                 28.1 Lex Bijlsma, Open University of the Netherlands
                 \\
                 28.2 Ken Calvert, University of Kentucky, Lexington, KY
                 \\
                 28.3 K. Mani Chandy, California Institute of
                 Technology, Pasadena, CA \\
                 28.4 Eric C.R. Hehner, Department of Computer Science,
                 University of Toronto \\
                 28.5 Wim H. Hesselink, University of Groningen \\
                 28.6 Rajeev Joshi, Amazon, Pasadena, CA \\
                 28.7 Don Knuth, Stanford Computer Science Department
                 \\
                 28.8 Alain J. Martin, California Institute of
                 Technology \\
                 28.9 Jayadev Misra, University of Texas at Austin,
                 Austin, TX \\
                 28.10 David A. Naumann, Stevens Institute of
                 Technology, Hoboken, NJ \\
                 28.11 J.R. Rao, IBM Thomas J. Watson Research Center,
                 Yorktown Heights, NY \\
                 28.12 Hamilton Richards \\
                 28.13 Mark Scheevel, Vericast, Austin, TX \\
                 28.14 David Turner, University of Kent, UK29 Edsger W.
                 Dijkstra as a Lecturer in Marktoberdorf \\
                 Manfred Broy \\
                 29.1 The Idea Leading to the Marktoberdorf Summer
                 School \\
                 29.2 ``State of the Art'' at the Beginning of the '70s
                 \\
                 29.3 Marktoberdorf Summer Schools: The Beginnings \\
                 29.4 Edsger as a Director of the Marktoberdorf Summer
                 Schools \\
                 29.5 The Arena of the Marktoberdorf Summer School \\
                 29.6 The Challenge \\
                 29.7 The Role of Formal Mathematics in Programming \\
                 29.8 Edsger's Views about the Marktoberdorf Summer
                 School \\
                 29.9 A Line of Development \\
                 29.10 The End \\
                 References \\
                 30 The Edsger W. Dijkstra Archive / Hamilton Richards
                 \\
                 Edsger W. Dijkstra: Biographical Information /
                 Krzysztof R. Apt",
}