Interpretability of First-Order Dynamic Logic in a Relational Calculus

Authors:
Marcelo F. Frias;Gabriel Baum;T. S. E. Maibaum
Affiliations:
-;-;-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 4
Cited 3

Ration algebras

Relational methods in computer science
A short proof of representability of fork algebras

Theoretical Computer Science
Fork algebras in algebra, logic and computer science

Fundamenta Informaticae
Dynamic Logic

Dynamic Logic

Reasoning about static and dynamic properties in alloy: A purely relational approach

ACM Transactions on Software Engineering and Methodology (TOSEM)
Complete calculi for structured specifications in fork algebra

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Fork algebras as a sufficiently rich universal institution

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic logic has become a very useful tool in Computer Science, with direct applications in system specification. Here we show how to interpret first-order dynamic logic in an extension of the relational calculus of fork algebras. That is, reasoning in first-order dynamic logic can be replaced by equational reasoning in the extended relational calculus. This allows to: (a) incorporate the features of dynamic logic in a relational framework, and, (b) provide an equational calculus for reasoning in first-order dynamic logic.