Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
Design and validation of protocols: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Knowledge-based proof planning
Artificial Intelligence
A feature interaction benchmark for the first feature interaction detection contest
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on the feature interactions in telecommunications systems
Using SPIN for feature interaction analysis—a case study
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Feature Interactions in Telecommunications and Software Systems VI
Feature Interactions in Telecommunications and Software Systems VI
Feature interaction: a critical review and considered forecast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Higher-Order Logic Programming
Proceedings of the Third International Conference on Logic Programming
Proof Planning for Feature Interactions: A Preliminary Report
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Experiments in Automating Hardware Verification Using Inductive Proof Planning
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Automatic Verification of any Number of Concurrent, Communicating Processes
Proceedings of the 17th IEEE international conference on Automated software engineering
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
Automated reasoning in quantified modal and temporal logics
AI Communications
Cooperating reasoning processes: more than just the sum of their parts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressiveness can be exploited to precisely model the behaviour of complex, infinite-state systems. In order to demonstrate the potentiality of our technique, we introduce a case-study inspired by the Feature Interactions problem and we model it in FOLTL; we then describe a set of methods which tackle and solve the validation problem for a number of properties of the model; and lastly we present a set of experimental results showing that the methods we propose capture the common patterns in the proofs presented, guide the search at the object level and let the overall system build large and highly structured proofs. This paper to some extent improves over previous work that showed how proof planning can be used to detect such interactions.