- Applied mathematics
- >
- Theoretical computer science
- >
- Formal methods
- >
- Program logic

- Applied mathematics
- >
- Theoretical computer science
- >
- Logic in computer science
- >
- Program logic

- Fields of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Program logic

- Fields of mathematics
- >
- Mathematical logic
- >
- Logical calculi
- >
- Program logic

- Fields of mathematics
- >
- Mathematical logic
- >
- Non-classical logic
- >
- Program logic

- Formal theories
- >
- Formal systems
- >
- Logical calculi
- >
- Program logic

- Logic in computer science
- >
- Programming language semantics
- >
- Axiomatic semantics
- >
- Program logic

- Mathematical logic
- >
- Formal systems
- >
- Logical calculi
- >
- Program logic

- Mathematical logic
- >
- Logic in computer science
- >
- Logical calculi
- >
- Program logic

- Mathematics of computing
- >
- Formal methods
- >
- Logical calculi
- >
- Program logic

- Mathematics of computing
- >
- Logic in computer science
- >
- Logical calculi
- >
- Program logic

- Metalogic
- >
- Formal systems
- >
- Logical calculi
- >
- Program logic

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Program logic

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Logical calculi
- >
- Program logic

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Non-classical logic
- >
- Program logic

- Theoretical computer science
- >
- Formal methods
- >
- Logical calculi
- >
- Program logic

- Theoretical computer science
- >
- Logic in computer science
- >
- Logical calculi
- >
- Program logic

- Theoretical computer science
- >
- Mathematics of computing
- >
- Formal methods
- >
- Program logic

- Theoretical computer science
- >
- Mathematics of computing
- >
- Logic in computer science
- >
- Program logic

Separation logic

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, Samin Ishtiaq and Hongseok Yang, drawing up

Hoare logic

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 of computer programs. It was proposed in 1969

Interference freedom

In computer science, interference freedom is a technique for proving partial correctness ofconcurrent programs with shared variables. Hoare logic had been introduced earlierto prove correctness of seq

Predicate transformer semantics

Predicate transformer semantics were introduced by Edsger Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of programs". They define the semantics of an imperative

© 2023 Useful Links.