Verification and Analysis -- Searching Semantically Equivalent Code Fragments in Logic Programs -- Determinacy Analysis for Logic Programs Using Mode and Type Information -- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs -- Fully Automatic Binding-Time Analysis for Prolog -- Theory and Security -- Logical Mobility and Locality Types -- Unwinding Conditions for Security in Imperative Languages -- Natural Rewriting for General Term Rewriting Systems -- Transformations -- Negation Elimination for Finite PCFGs -- Specialization of Concurrent Guarded Multi-set Transformation Rules -- Efficient Local Unfolding with Ancestor Stacks for Full Prolog -- Program Development -- Schema-Guided Synthesis of Imperative Programs by Constraint Solving -- Run-Time Profiling of Functional Logic Programs -- Constructive Specifications for Compositional Units -- Termination -- Input-Termination of Logic Programs -- On Termination of Binary CLP Programs -- Program Development and Synthesis -- From Natural Semantics to Abstract Machines -- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.

Licensed e-book