A UML model consistency verification approach based on meta-modeling formalization
Proceedings of the 2006 ACM symposium on Applied computing
A Coinduction Rule for Entailment of Recursively Defined Properties
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Verification from Declarative Specifications Using Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Analysis of Linear Hybrid Systems in CLP
Logic-Based Program Synthesis and Transformation
HieroMate: a graphical tool for specification and verification of hierarchical hybrid automata
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
Multi-agent systems: modeling and verification using hybrid automata
ProMAS'09 Proceedings of the 7th international conference on Programming multi-agent systems
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
ICLP'05 Proceedings of the 21st international conference on Logic Programming
A reasoning method for timed CSP based on constraint solving
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Verifying complex continuous real-time systems with coinductive CLP(R)
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
Constraint Logic Programming (CLP) has been used to model programs and transition systems for the purpose of verification problems. In particular, it has been used to model Timed Safety Automata (TSA). In this paper, we start with a systematic translation of TSA into CLP. The main contribution is an expressive assertion language and a new CLP inference method for proving assertions. A distinction of the assertion language is that it can specify important properties beyond traditional safety properties. We highlight one important property: that a system of processes is symmetric. The new inference mechanism is based upon the well-known method of tabling in logic programming. It is distinguished by its ability to use assertions that are not yet proven, using a principle of coinduction. Apart from given assertions, the proof mechanism can also prove implicit assertions such as discovering a lower or upper bound of a variable. Finally, we demonstrate significant improvements over state-of-the-art systems using standard TSA benchmark examples.