Foundations of logic programming
Foundations of logic programming
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Automated logical verification based on trace abstractions
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Reducing nondeterminism while specializing logic programs
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Languages, automata, and logic
Handbook of formal languages, vol. 3
Automata based symbolic reasoning in hardware verification
Formal Methods in System Design
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Program Derivation = Rules + Strategies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Verification of Sets of Infinite State Processes Using Program Transformation
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proving Theorems by Program Transformation
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
We present a program synthesis method based on unfold/fold transformation rules which can be used for deriving terminating definite logic programs from formulas of the Weak Monadic Second Order theory of one successor (WS1S). This synthesis method can also be used as a proof method which is a decision procedure for closed formulas of WS1S. We apply our synthesis method for translating CLP(WS1S) programs into logic programs and we use it also as a proof method for verifying safety properties of infinite state systems.