Dynamic logic with trace semantics

Authors:
Bernhard Beckert;Daniel Bruns
Affiliations:
Karlsruhe Institute of Technology (KIT), Germany;Karlsruhe Institute of Technology (KIT), Germany
Venue:
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Year:
2013

Citing 8
Cited 0

Nonclausal deduction in first-order temporal logic

Journal of the ACM (JACM)
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A Temporal Logic for Multilevel Reasoning about Hardware

Computer
A Temporal Dynamic Logic for Verifying Hybrid System Invariants

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
Comparing LTL Semantics for Runtime Verification

Journal of Logic and Computation
Interleaved Programs and Rely-Guarantee Reasoning with ITL

TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
Verification of information flow properties of java programs without approximations

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic logic is an established instrument for program verification and for reasoning about the semantics of programs and programming languages. In this paper, we define an extension of dynamic logic, called Dynamic Trace Logic (DTL), which combines the expressiveness of program logics such as dynamic logic with that of temporal logic. And we present a sound and relatively complete sequent calculus for proving validity of DTL formulae. Due to its expressiveness, DTL can serve as a basis for proving functional and information-flow properties in concurrent programs, among other applications.