Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communication and Concurrency
A Closed Form for Datalog Queries with Integer Order
ICDT '90 Proceedings of the Third International Conference on Database Theory
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Verification of Parameterized Systems Using Logic Program Transformations
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Logic Programming and Model Checking
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Automated Analysis of an Audio Control Protocol
Proceedings of the 7th International Conference on Computer Aided Verification
Local Model Checking for Real-Time Systems (Extended Abstract)
Proceedings of the 7th International Conference on Computer Aided Verification
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
A constraint-based approach for specification and verification of real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Accurate Widenings and Boundedness Properties of Timed Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Design and Implementation of AT: a real-time action description language
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Model checking with probabilistic tabled logic programming
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We apply techniques from logic programming and constraint databases to verify real time systems. We introduce timed logic processes (TLPs) as a fragment of constraint query languages over reals. We establish a formal connection between TLPs and timed automata, and between the procedure of the UPPAAL model checker for restricted temporallogic properties of timed automata and the top-down query evaluation of TLPs (with tabling in the XSB style). This connection yields an alternative implementation of the UPPAAL procedure. Furthermore, we can extend that procedure in order to accommodate more expressive properties.