(Enter summary)
Abstract: In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action
logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evaluated
along intervals instead of at states. Action logic is an equational theory ACT conservatively extending
the equational theory REG of regular expressions with operations preimplication a!b (had a then b) and
postimplication b/a (b if-ever a). Unlike REG, ACT is finitely based, makes a... (Update)
Cited by: More
Logics for Classes of Boolean Monoids - Allwein, Demir, Pike (2004)
(Correct)
On the Equational Definition of the Least Prefixed Point - Santocanale (2003)
(Correct)
Kleene Algebra with Domain - Desharnais, Möller, Struth (2003)
(Correct)
Active bibliography (related documents): More All
0.8: Dynamic Algebras as a well-behaved fragment of Relation Algebras - Pratt (1990)
(Correct)
0.4: A Roadmap of Some Two-Dimensional Logics - Pratt (1994)
(Correct)
0.4: Origins of the Calculus of Binary Relations - Pratt (1992)
(Correct)
Similar documents based on text: More All
0.1: Rewriting Extended Regular Expressions - Antimirov, Mosses (1993)
(Correct)
0.1: Arithmetic + Logic + Geometry = Concurrency - Vaughan Pratt (1992)
(Correct)
0.1: Description Logics and Logics - Franconi
(Correct)
Related documents from co-citation: More All
13: Relation Algebras with Transitive Closure (context) - Ng - 1984
12: A completeness theorem for Kleene algebras and the algebra of regular events
- Kozen - 1994
9: Two complete axiom systems for the algebras of regular events (context) - Salomaa - 1966
BibTeX entry: (Update)
V.R. Pratt. Action logic and pure induction. In Workshop on Logics in AI, volume 478 of Lecture Notes in Computer Science, pages 97--120. Springer-Verlag, 1990. http://citeseer.ist.psu.edu/pratt91action.html More
@inproceedings{ pratt90action,
author = "Vaughan Pratt",
title = "Action logic and pure induction",
booktitle = "Proc. Logics in {AI}: European Workshop {JELIA} '90",
volume = "478",
publisher = "Springer-Verlag Lecture Notes in Computer Science",
editor = "J. van Eijck",
pages = "97--120",
year = "1990",
url = "citeseer.ist.psu.edu/pratt91action.html" }
Citations (may not include all citations):
562
Categories for the Working Mathematician (context) - Lane - 1971
215
Theoretical Computer Science (context) - Girard - 1987 ACM
198
Structure and complexity of relational queries
- Chandra, Harel - 1982 DBLP
131
Modeling concurrency with partial orders (context) - Pratt - 1986 ACM
124
Lattice Theory (context) - Birkhoff - 1967
120
Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
118
Boolean algebras with operators (context) - J'onsson, Tarski - 1951
97
Chapman and Hall (context) - Conway, Finite - 1971
97
North Holland (context) - Freyd, Scedrov et al. - 1990
86
A theorem on Boolean matrices (context) - Warshall - 1962 ACM DBLP
84
A completeness theorem for Kleene algebras and the algebra o..
- Kozen - 1990 ACM DBLP
80
Review of the elements of 2-categories (context) - Kelly, Street - 1974
64
The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
61
the calculus of relations (context) - Tarski - 1941
59
Models of program logics (context) - Pratt - 1979 DBLP
59
Two complete axiom systems for the algebra of regular events (context) - Salomaa - 1966 ACM DBLP
51
Partially Ordered Algebraic Systems (context) - Fuchs - 1963
49
Algorithm 97: shortest path (context) - Floyd - 1962 ACM DBLP
33
On defining relations for the algebra of regular events (context) - Redko - 1964
33
Relation algebras with transitive closure (context) - Ng, Tarski - 1977
33
Relation Algebras with Transitive Closure (context) - Ng - 1984
23
Temporal structures
- Casley, Crew et al. - 1989 ACM DBLP
20
Varieties of relation algebras (context) - J'onsson - 1982
15
Vorlesungen uber die Algebra der Logik (context) - Schroder
14
resulting from an amplification of the conceptions of Boole'.. (context) - Peirce, for et al. - 1933
12
On Kleene algebras and closed semirings
- Kozen - 1990 ACM DBLP
11
Dynamic algebras and the nature of induction (context) - Pratt - 1980 ACM DBLP
10
Residuated lattices (context) - Ward, Dilworth - 1939
7
and on the logic of relations (context) - De Morgan, syllogism et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://boole.stanford.edu/abstracts.html): More
Origins of the Calculus of Binary Relations - Pratt (1992)
(Correct)
Branching Bisimulation as a Tool in the Analysis of Weak.. - van Glabbeek (1995)
(Correct)
Chu Spaces: A Model Of Concurrency - Gupta (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC