Practical First-Order Temporal Reasoning

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification.

Authors

• Clare Dixon
• Michael Fisher 0001
• Boris Konev
• Alexei Lisitsa 0001

Keywords

• Logic
• Automata
• Delay systems
• Safety
• Broadcasting
• Computer science
• Formal verification
• Protocols
• Upper bound
• Health-related Quality Of Life
• Communication Delay
• Verification System
• First-order Logic
• Temporal Logic
• Asynchronous System
• Moment In Time
• Linear Time
• State Machine
• Original Protocol
• Decision Problem
• Normal Form
• Color Scheme
• Model Checking
• Safety Properties
• Domain Elements
• First-order Structure
• Set Of Formulas
• Temporal Operators
• Output Bits
• Input Bits
• Propositional Logic
• Verification
• First-Order Temporal Logics
• Infinite State Systems