Nonclausal deduction in first-order temporal logic
Journal of the ACM (JACM)
Interactive theorem proving with temporal logic
Journal of Symbolic Computation
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 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
Higher-Order Annotated Terms for Proof Search
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Proof Search in the Intuitionistic Sequent Calculus
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Incremental requirement specification for evolving systems
Nordic Journal of Computing
Proof planning for first-order temporal logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
We report on an initial success obtained in investigating the Feature Interaction problem (FI) via proof planning. FIs arise as an unwanted/ unexpected behaviour in large telephone networks and have recently attracted interest not only from the Computer Science community but also from the industrial world. So far, FIs have been solved mainly via approximation plus finite-state methods (model checking being the most popular); in our work we attack the problem via proof planning in First-Order Linear Temporal Logic (FOLTL), therefore making use of no finite-state approximation or restricting assumption about quantification. We have integrated the proof planner λCLAM with an object-level FOLTL theorem prover called FTL, and have so far re-discovered a feature interaction in a basic (but far from trivial) example.