Categories and Subject Descriptors: F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs -- assertions; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- logic programming
General Terms: Algorithms, Theory
Additional Key Words and Phrases: Correction assertions, Hoare logic
Selected papers that cite this one
- S. L. Bloom and Z. Ésik. Equational axioms for regular sets. Mathematical Structures in Computer Science, 3(1):1-24, March 1993.
Selected references
- Stephen L. Bloom, Zoltán Ésik, and Dirk Taubner. Iteration theories of synchronization trees. Information and Computation, 102(1):1-55, January 1993.
- J. B. Wright, J. W. Thatcher, E. G. Wagner, and J. A. Goguen. Rational algebraic theories and fixed-point solutions. In 17th Annual Symposium on Foundations of Computer Science, pages 147-158, Houston, Texas, 25-27 October 1976. IEEE.