Entry Wadkins:1995:RPP from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Wadkins:1995:RPP,
  author =       "J. R. Jefferson Wadkins",
  title =        "Rigorous Proofs of Program Correctness without Formal
                 Logic",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "1",
  pages =        "307--311",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/199691.199834;
                 https://doi.org/10.1145/199688.199834",
  ISBN =         "0-89791-693-X",
  ISBN-13 =      "978-0-89791-693-6",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:28 MST 2012",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/sigcse/sigcse1995.html#Wadkins95;
                 http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  URL =          "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/1995.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/Pape.bib;
                 ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/SE/alspaugh.bib",
  abstract =     "Three fundamental principles of static reasoning used
                 to write imperative program code with built-in proof of
                 its correctness are presented and explained in
                 operational terms. It is argued that, although the
                 traditional use of formal logic in the
                 Hoare-Dijkstra-Gries methodology is probably the most
                 efficient way to write code with built-in proofs of
                 correctness, the ideas underlying that methodology are
                 much simpler than commonly perceived through the veil
                 of formal logic and axiomatic semantics. Examples are
                 given illustrating principles and techniques for
                 deriving code from specifications, using the informal
                 reasoning of the mathematician without either the
                 terminology or notation of formal logic.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries