Titlebook: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems; Essays Dedicated to Pedro Lopez-Garcia,John

单调性

,The Role of Abstraction in Model Checking,the use of abstract interpretation to reduce the well-known state space explosion problem in model checking was the first and most successful combination of these two techniques. However, this is not the only possible way both methods can collaborate to improve the software reliability. Along these

挡泥板

,Justifications and a Reconstruction of Parity Game Solving Algorithms,fines parametrized parity games and introduces an operation, ., that determines a winning strategy for a single node. By carefully ordering . steps, we reconstruct three algorithms well known from the literature.

perimenopause

SMT-Based Test-Case Generation and Validation for Programs with Complex Specifications,x preconditions. The key of the approach is to translate a formal precondition into a set of constraints belonging to the decidable logics of SMT solvers. By checking the satisfiability of the constraints, then the models returned by the solver automatically synthesize the cases. We also show how to

Dislocation

Layerings of Logic Programs - Layer Decomposable Semantics and Incremental Model Computation,er growing size and diversity of applications using logic programs as representations of knowledge bases, there is a corresponding growing need to optimize the efficiency of model computation. In this paper we define two graph-theoretical structures, which we dub the Rule Layering and the Atom Layer

affluent

FECK

,Proof-Theoretic Foundations of Normal Logic Programs,ion, and this realization can be used to develop a goal-directed method of computing models. In essence, the difference between these semantics is how they resolve the unstratified portions of a program. In this paper, restricting ourselves to the propositional case, we show how the semantics of nor

胡言乱语

,Reversible Debugging in Logic Programming, where one can explore a computation from the observable misbehaviour . to the source of the error. In this work, we propose a reversible debugging scheme for logic programs. For this purpose, we define an appropriate instrumented semantics (a so-called Landauer embedding) that makes SLD resolution

FID

嫌恶

adipose-tissue