Invited Speaker.- Static Analysis for Safe Destructive Updates in a Functional Language.- Program Transformation and Equivalence.- A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs.- On Deforesting Parameters of Accumulating Maps.- Equivalence in Answer Set Programming.- Program Verificaion.- Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols.- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking.- Verification of Sets of Infinite State Processes Using Program Transformation.- Program Analysis.- When Size Does Matter.- Symbolic Profiling for Multi-paradigm Declarative Languages.- Program Development.- Correct Object-Oriented Systems in Computational Logic.- A Framework for Developing Embeddable Customized Logics.- Computing Environment-Aware Agent Behaviours with Logic Program Updates.- Program Synthesis.- Extracting General Recursive Program Schemes in Nuprl's Type Theory.- Extracting Exact Time Bounds from Logical Proofs.
Inhaltsverzeichnis
Invited Speaker. - Static Analysis for Safe Destructive Updates in a Functional Language. - Program Transformation and Equivalence. - A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs. - On Deforesting Parameters of Accumulating Maps. - Equivalence in Answer Set Programming. - Program Verificaion. - Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols. - Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking. - Verification of Sets of Infinite State Processes Using Program Transformation. - Program Analysis. - When Size Does Matter. - Symbolic Profiling for Multi-paradigm Declarative Languages. - Program Development. - Correct Object-Oriented Systems in Computational Logic. - A Framework for Developing Embeddable Customized Logics. - Computing Environment-Aware Agent Behaviours with Logic Program Updates. - Program Synthesis. - Extracting General Recursive Program Schemes in Nuprl s Type Theory. - Extracting Exact Time Bounds from Logical Proofs.
