• Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness...
    22 KB (3,643 words) - 22:35, 5 April 2024
  • Thumbnail for Tony Hoare
    distinction in computer science, in 1980. Hoare developed the sorting algorithm quicksort in 1959–1960. He developed Hoare logic, an axiomatic basis for verifying...
    27 KB (2,191 words) - 11:37, 20 November 2024
  • In computer science, separation logic is an extension of Hoare logic, a way of reasoning about programs. It was developed by John C. Reynolds, Peter O'Hearn...
    28 KB (3,647 words) - 14:42, 2 October 2024
  • program verification, particularly the Floyd-Hoare approach, loop invariants are expressed by formal predicate logic and used to prove properties of loops and...
    17 KB (2,426 words) - 22:47, 18 August 2023
  • Separation logic is an extension of Hoare logic that facilitates reasoning about mutable data structures that use pointers. Following Hoare logic the formulae...
    21 KB (2,856 words) - 04:43, 2 November 2024
  • Axiomatic semantics (category Logic in computer science)
    approach based on mathematical logic for proving the correctness of computer programs. It is closely related to Hoare logic. Axiomatic semantics define the...
    1 KB (144 words) - 17:23, 2 January 2022
  • Predicate transformer semantics (category Program logic)
    predicate transformer semantics are a reformulation of Floyd–Hoare logic. Whereas Hoare logic is presented as a deductive system, predicate transformer semantics...
    27 KB (3,377 words) - 00:47, 14 November 2024
  • Thumbnail for Liskov substitution principle
    Wing detailed their notion of behavioral subtyping in an extension of Hoare logic, which bears a certain resemblance to Bertrand Meyer's design by contract...
    11 KB (1,191 words) - 16:25, 8 July 2024
  • making dynamic logic more general than Hoare logic. Beyond its use in formal verification of programs, dynamic logic has been applied to describe complex...
    29 KB (5,118 words) - 21:28, 20 August 2024
  • constructive logic corresponds to a certain program in the lambda calculus. Converting a proof in this way is called program extraction. Hoare logic is a specific...
    7 KB (658 words) - 09:24, 14 June 2024
  • Thumbnail for Design by contract
    has its roots in work on formal verification, formal specification and Hoare logic. The original contributions include: A clear metaphor to guide the design...
    15 KB (1,728 words) - 14:10, 20 November 2024
  • Semantics (computer science) (category Logic in computer science)
    interpretation in the neighborhood of each command. In 1969, Tony Hoare published a paper on Hoare logic seeded by Floyd's ideas, now sometimes collectively called...
    18 KB (1,671 words) - 06:21, 19 July 2024
  • for an introductory programming course for freshmen” that consisted of Hoare logic as an uninterpreted formal system. Since the term "software engineering"...
    4 KB (544 words) - 16:22, 16 October 2023
  • Assigning Meanings to Programs. This was a contribution to what later became Hoare logic. Floyd received the Turing Award in 1978. Born in New York City, Floyd...
    12 KB (1,171 words) - 11:40, 27 September 2024
  • Formal verification (category Logic in computer science)
    operational semantics, denotational semantics, axiomatic semantics and Hoare logic. Model checking involves a systematic and exhaustive exploration of the...
    18 KB (1,877 words) - 04:53, 19 November 2024
  • operational semantics and, from them, to create a Hoare logic. Matching logic can be converted to first-order logic with equality, which allows the K Framework...
    3 KB (502 words) - 13:20, 2 April 2024
  • Thumbnail for Dafny
    user of writing specifications. The general proof framework is that of Hoare logic. Dafny builds on the Boogie intermediate language which uses the Z3 automated...
    13 KB (1,443 words) - 20:08, 20 November 2024
  • languages such as the P programming language. Automatic programming Hoare logic Program refinement Design by contract Program synthesis Proof-carrying...
    3 KB (410 words) - 03:08, 27 June 2023
  • Wilfred Hoare (1909–2003), English cricketer and headmaster William Hoare (c.1707–1792), British painter Hoare baronets, four Baronetcies Hoare logic, named...
    4 KB (355 words) - 22:40, 21 March 2024
  • scenario aspect of this format may be regarded as an application of Hoare logic to behavioral specification of software using the domain-specific language...
    18 KB (2,158 words) - 02:09, 14 November 2024
  • technique for gathering information about the possible set of values; Hoare logic, a formal system with a set of logical rules for reasoning rigorously...
    18 KB (1,921 words) - 10:11, 12 August 2024
  • Extreme Computing Conference 2016 Ying, Mingsheng (January 2012). "Floyd–hoare Logic for Quantum Programs". ACM Trans. Program. Lang. Syst. 33 (6): 19:1–19:49...
    41 KB (4,217 words) - 17:46, 23 October 2024
  • Thumbnail for Programming language theory
    in Combinatory Logic, later generalized into the Hindley–Milner type inference algorithm. In 1969, Tony Hoare introduces the Hoare logic, a form of axiomatic...
    15 KB (1,622 words) - 12:51, 5 October 2024
  • is abstraction. Refinement calculus is a formal system (inspired from Hoare logic) that promotes program refinement. The FermaT Transformation System is...
    5 KB (543 words) - 20:07, 26 March 2024
  • Postcondition (category Logic in computer science)
    but may not decrease those benefits. Precondition Design by contract Hoare logic Invariants maintained by conditions Database trigger Meyer, Bertrand...
    4 KB (452 words) - 23:21, 22 December 2021
  • correctness proofs of programs through proof annotations such as in Hoare logic. Another way of working around Rice's theorem is to search for methods...
    12 KB (1,719 words) - 20:40, 28 October 2024
  • systems. Logics for processes that allow one to reason about (essentially) arbitrary properties of processes, following the ideas of Hoare logic. Behavioural...
    19 KB (2,452 words) - 08:56, 28 June 2024
  • conditions by analyzing a program's source code using a method based upon Hoare logic. VC generators may require that the source code contains logical annotations...
    2 KB (167 words) - 18:30, 26 June 2023
  • to express computations.[citation needed] Alternative methods such as Hoare logic and uniqueness have been developed to track side effects in programs...
    86 KB (8,590 words) - 14:04, 13 November 2024
  • Precondition (category Logic in computer science)
    increase it. Design by contract Guard (computer science) Postcondition Hoare logic Invariants maintained by conditions Database trigger Meyer, Bertrand...
    5 KB (618 words) - 16:38, 30 August 2023