TY - GEN
T1 - Practical first-order temporal reasoning
AU - Dixon, C.
AU - Fisher, M.
AU - Konev, B.
AU - Lisitsa, A.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-51549111455&partnerID=MN8TOARS
U2 - 10.1109/TIME.2008.15
DO - 10.1109/TIME.2008.15
M3 - Conference contribution
BT - Proceedings of the International Workshop on Temporal Representation and Reasoning
ER -