scientific article; zbMATH DE number 3901996
[For the entire collection see Zbl 0562.00011.] Over the last few years, temporal logic has been investigated as a tool for reasoning about computer programs, digital circuits and message- passing systems. In the case of programs, the general feeling has been that temporal logic is an adjunct to existing languages. For example, one might use temporal logic to specify and prove properties about a program written in, say, CSP. This leads to the annoyance of having to simultaneously use two separate notations. In earlier work we proposed that temporal logic itself directly serves as the basis for a programming language. Since then we have implemented an interpreter for such a language called Tempura. We are developing Tempura as a tool for directly executing suitable temporal logic specifications of digital circuits and other discrete-time systems. Since every Tempura statement is also a temporal formula, we can use the entire temporal logic formalism for our assertion language and semantics. Tempura has the two seemingly contradictory properties of being a logic programming language and having imperative constructs such as assignment statements. The presentation given here first describes the syntax and semantics of a first-order temporal logic having the operators o (next) and \(\square\) (always). This serves as the basis for the Tempura programming language. The lesser known temporal operator chop is subsequently introduced, resulting in Interval Temporal Logic. We then show how to incorporate chop and related constructs into Tempura.
- Programming in metric temporal logic
- TABLEAUX: A general theorem prover for modal logics
- An overview of transaction logic
- Duration calculus: Logical foundations
- Multi-dimensional logic programming: theoretical foundations
- Induction in the timed interval calculus
- A timed concurrent constraint language.
- MetateM: An introduction
- Linear time-dependent constraints programming with MSVL
- Guest editors' preface to special issue on interval temporal logics
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Compositional reasoning using intervals and time reversal
- Index set expressions can represent temporal logic formulas
- Operational semantics of Framed Tempura
- An application of temporal projection to interleaving concurrency
- Domain science and engineering from computer science to the sciences of informatics. I: Engineering
- A decision procedure for propositional projection temporal logic with infinite models
- Some fixed-point issues in PPTL
- Axiomatic semantics of projection temporal logic programs
- Connection between logical and algebraic approaches to concurrent systems
- Formal verification of a lock-free stack with hazard pointers
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic
- A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus
- Logical Interpolation and Projection onto State in the Duration Calculus
- scientific article; zbMATH DE number 4076583 (Why is no real title available?)
- scientific article; zbMATH DE number 4082943 (Why is no real title available?)
- A complete proof system for propositional projection temporal logic
- scientific article; zbMATH DE number 4128368 (Why is no real title available?)
- The temporal logic Sugar
- An infinitary encoding of temporal equilibrium logic
- Temporal logic programs with variables
- scientific article; zbMATH DE number 4119670 (Why is no real title available?)
- Extending temporal logic to support high-level simulations
- Foundations of linear-time logic programming
- Reversibility of Executable Interval Temporal Logic Specifications
- Proving linearizability with temporal logic
- On the completeness and decidability of duration calculus with iteration
- Temporal logic programming
- A Road Map of Interval Temporal Logics and Duration Calculi
- A Road Map of Interval Temporal Logics and Duration Calculi
- Distributed processes and location failures
- Specifying and reasoning about shared-variable concurrency
- Executable temporal logic systems
- Online monitoring of metric temporal logic using sequential networks
- Balancing expressiveness in formal approaches to concurrency
- Verification of distributed systems with the axiomatic system of MSVL
- Defining, analysing and implementing communication protocols using attribute grammars
- A timeband framework for modelling real-time systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680239)