Real-Time Verification Techniques for Untimed Systems

Du, Xiaoqun; Ramakrishnan, C. R.; Smolka, Steffen

doi:10.1016/s1571-0661(05)01222-3

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However we take a different direction from them in our approach to abstraction and checking of temporal properties, in that we use abstract CLP program semantics when abstracting the state space (only briefly mentioned in the present work), but then apply this abstraction in a temporal logic framework, which is the topic of this work. Other authors have encoded both the transition systems and CTL semantics as constraint logic programs [8,34,37,18,21,38,39]. However none of these develops a comprehensive approach to abstract semantics when dealing with infinite-state systems.…”

Section: Related Workmentioning

confidence: 99%

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

Banda

Gallagher

2010

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

interpretation provides a practical approach to verifying properties of infinite-state systems. We apply the framework of abstract interpretation to derive an abstract semantic function for the modal µ-calculus, which is the basis for abstract model checking. The abstract semantic function is constructed directly from the standard concrete semantics together with a Galois connection between the concrete state-space and an abstract domain. There is no need for mixed or modal transition systems to abstract arbitrary temporal properties, as in previous work in the area of abstract model checking. Using the modal µ-calculus to implement CTL, the abstract semantics gives an over-approximation of the set of states in which an arbitrary CTL formula holds. Then we show that this leads directly to an effective implementation of an abstract model checking algorithm for CTL using abstract domains based on linear constraints. The implementation of the abstract semantic function makes use of an SMT solver. We describe an implemented system for proving properties of linear hybrid automata and give some experimental results.

show abstract

Section: Related Workmentioning

confidence: 99%

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

Banda

Gallagher

2010

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

show abstract

“…A somewhat different but related CLP modelling and proof approach is followed in [8,30,32,14,15,33,34]. This is to encode a proof procedure for a modal logic such as CTL, µ-calculus or related languages as a logic program, and then prove formulas in the language by running the interpreter (usually with tabling to ensure termination).…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Analysis of Linear Hybrid Systems in CLP

Banda

Gallagher

2009

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

In this paper we present a procedure for representing the semantics of linear hybrid automata (LHAs) as constraint logic programs (CLP); flexible and accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive notation for specifying real-time systems. The main contributions are (i) a technique for capturing the reachable states of the continuously changing state variables of the LHA as CLP constraints; (ii) a way of representing events in the LHA as constraints in CLP, along with a product construction on the CLP representation including synchronisation on shared events; (iii) a framework in which various kinds of reasoning about an LHA can be flexibly performed by combining standard CLP transformation and analysis techniques. We give experimental results to support the usefulness of the approach and argue that we contribute to the general field of using static analysis tools for verification.

show abstract

Real-Time Verification Techniques for Untimed Systems

Cited by 2 publications

References 0 publications

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

Analysis of Linear Hybrid Systems in CLP

Contact Info

Product

Resources

About