Combining Logic Programs and Monadic Second Order Logics by Program Transformation

Details Combining Logic Programs and Monadic Second Order Logics by Program Transformation Combining Logic Programs and Monadic Second Order Logics by Program Transformation

2003-11-27

arxiv.org/abs/cs/0311043v1

Computer Science

Programming Languages

25 pages. Full version of a paper that appears in: M. Leuschel (ed.) Proceedings of LOPSTR'02, Twelfth International Workshop

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combining Logic Programs and Monadic Second Order Logics by Program Transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combining Logic Programs and Monadic Second Order Logics by Program Transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining Logic Programs and Monadic Second Order Logics by Program Transformation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518832