Temporal logic of programs
eventuality properties of programsinvariance propertyprecedence propertyreasoning about the behavior of programssequential programs
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Temporal logic has become an indispensable tool in reasoning about the behavior of programs since the pioneering work of \textit{A. Pnueli} [Proc. 18th Ann. Symp. Foundations of Computer Science, Providence, RI. New York (1977)]. This interesting monograph is intended for an introduction to this vital area, assuming only modest familiarity with the fundamental concepts of mathematical logic. The monograph consists of seven chapters, the first three of which deal with the pure (linear time) temporal logic. Chapter 4 is devoted to representing programs and their properties within this formalism. Chapter 5 treats the invariance and precedence properties of programs, while the succeeding chapter is devoted to the eventuality properties of programs. The final chapter discusses two special methods of sequential programs from a standpoint of temporal logic.
- A complete axiomatic characterization of first-order temporal logic of linear time
- Programming in metric temporal logic
- Completing the temporal picture
- Specification and design of shared resource arbitration
- Axiomatizing fixpoint logics
- Querying datalog programs with temporal logic
- Completeness of a first-order temporal logic with time-gaps
- Specification of abstract dynamic-data types: A temporal logic approach
- Order-sorted model theory for temporal executable specifications
- Verification of reactive systems using temporal logic with clocks
- LOGSPACE and PTIME characterized by programming languages
- Algebra and theory of order-deterministic pomsets
- Semantics of temporal classes
- Reasoning about time in the situation calculus
- Temporal logic with recursion
- A non-hyperarithmetical Gödel logic
- Specifying reversibility with \(\mathrm{TLA}^+\)
- On strictly arithmetical completeness in logics of programs
- Operational semantics of Framed Tempura
- A decision procedure for propositional projection temporal logic with infinite models
- Planning from second principles
- Temporal object-oriented programming
- Sheaves and geometric logic and applications to modular verification of complex systems
- Temporal and dynamic logic
- Branching time? Pruning time!
- A Temporal Logic for Multi-threaded Programs
- An introduction to practical formal methods using temporal logic
- A history of until
- scientific article; zbMATH DE number 3846861 (Why is no real title available?)
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- A Labeled Natural Deduction System for a Fragment of CTL *
- scientific article; zbMATH DE number 4055577 (Why is no real title available?)
- scientific article; zbMATH DE number 4076583 (Why is no real title available?)
- Verifying temporal properties without temporal logic
- TTL : a formalism to describe local and global properties of distributed systems
- scientific article; zbMATH DE number 148938 (Why is no real title available?)
- Decidability and incompleteness results for first-order temporal logics of linear time
- A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time
- Handling database updates in two-dimensional temporal logic
- Temporal logic programs with variables
- Process specification and verification
- scientific article; zbMATH DE number 4119592 (Why is no real title available?)
- scientific article; zbMATH DE number 830431 (Why is no real title available?)
- A Branching Time Logical System for Open Distributed Systems Development
- Modal rules are co-implications
- On proving properties of completion strategies
- Similarity saturation for first order linear temporal logic with UNLESS
- Logic Programming
- scientific article; zbMATH DE number 4182845 (Why is no real title available?)
- Proof-theoretical investigation of temporal logic with time gaps
- Temporal representation and reasoning in artificial intelligence: A review
- Construction of deterministic transition graphs from dynamic integrity constraints
- Formal Reasoning About Influence in Natural Sciences Experiments
- Incompleteness of a first-order Gödel logic and some temporal logics of programs
- Formal verification and evaluation of execution time in the envelope theory
- Deciding the existence of interpolants and definitions in first-order modal logic
- Using typed lambda calculus to implement formal systems on a machine
- Switched systems with transient unsustainable modes: stability and feasibility
- Compositional reasoning using interval temporal logic and Tempura
- On the expressive power of temporal logic for infinite words
- Deontic action logic, atomic Boolean algebras and fault-tolerance
- Theoretical foundations of handling large substitution sets in temporal integrity monitoring
- Transformation of dynamic integrity constraints into transaction specifications
- On the interpretability of arithmetic in temporal logic
This page was built for publication: Temporal logic of programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3749040)