A refinement logic for the fork calculus.
Klaus HavelundKim Guldstrand LarsenPublished in: PSTV (1994)
Keyphrases
- computer algebra
- natural deduction
- formal language
- proof procedure
- logic programming
- transition systems
- computational properties
- modal logic
- sequent calculus
- proof search
- classical logic
- algebraic structure
- automated theorem proving
- proof theoretic
- automated reasoning
- proof theory
- theorem proving
- cut elimination
- linear time temporal logic
- relation algebra
- knowledge representation
- refinement process
- state space search
- predicate logic
- model checking
- lambda calculus
- asynchronous circuits
- truth values
- defeasible logic
- theorem prover