Titlebook: Logic-Based Program Synthesis and Transformation; 19th International S Danny Schreye Conference proceedings 2010 Springer-Verlag Berlin Hei

DEMN

Deciding Full Branching Time Logic by Program Transformation,e finite state systems and the CTL. properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a .., that is, a stratified pr

逃避現(xiàn)實

分解

The Dependency Triple Framework for Termination of Logic Programs,ctly on LPs and the . approach which transforms LPs to term rewrite systems (TRSs) and tries to prove termination of the resulting TRSs. To this end, we adapt the well-known . from TRSs to LPs. With the resulting method, one can combine arbitrary termination techniques for LPs in a completely modula

ellagic-acid

CLAIM

蘆筍

On Inductive and Coinductive Proofs via Unfold/Fold Transformations,s. The new condition of negative unfolding is a natural one, since it is considered as a special case of replacement rule. The correctness of our unfold/fold transformation system in the sense of the perfect model semantics is proved. We then consider the coinductive proof rules proposed by Jaffar e

Cardioversion

Coinductive Logic Programming with Negation,-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting’s Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF re

Dissonance

TOXIC

Towards a Framework for Constraint-Based Test Case Generation,standard CP search strategies in order to express preferences on the generated test cases and to obtain the desired degree of coverage. We develop our framework in the concrete context of an imperative language and show that the technique is sufficiently powerful to deal with arbitrary pointer-based

榨取

Using Rewrite Strategies for Testing BUpL Agents,ists of two main steps. We first define a formal language for the specification of test cases with respect to BUpL. We then implement test cases written in the formal language by means of a general method based on rewrite strategies. Testing an agent program with respect to a given test case corresp