Automated Proof Support for Interval Logics

Authors:
Thomas Marthedal Rasmussen
Affiliations:
-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 8
Cited 1

A propositional modal logic of time intervals

Journal of the ACM (JACM)
Interval logics and their decision procedures: part I: an interval logic

Theoretical Computer Science
A Hardware Semantics Based on Temporal Intervals

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Liveness and Fairness in Duration Calculus

CONCUR '94 Proceedings of the Concurrency Theory
A Formal Proof of the Deadline Driven Scheduler

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional reasoning about projected and infinite time

ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
A Temporal Logic for Multilevel Reasoning about Hardware

Computer

Timed traces and strand spaces

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We outline the background and motivation for the use of interval logics and consider some initial attempts toward proof support and automation. The main focus, though, is on recent work on these subjects. We compare different proof theoretical formalisms, in particular a "classical" versus a "labelled" one. We discuss encodings of these in the generic proof assistant Isabelle and consider some examples which show that in some cases the labelled formalism gives an order of magnitude improvement in proof length compared to a classical approach.