Titlebook: Logic-Based Program Synthesis and Transformation; 18th International S Michael Hanus Conference proceedings 2009 Springer-Verlag Berlin Hei

有机体

accrete

A Modular Equational Generalization Algorithm,d identity axioms (including the empty set). This is suitable for dealing with functions that obey algebraic laws, and are typically mechanized by means of equational atributes in rule-based languages such as ASF+SDF, Elan, OBJ, Cafe-OBJ, and Maude. The algorithm computes a complete set of least gen

Antagonist

A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs,For this purpose, we first introduce an improved defunctionalization algorithm that transforms higher-order functions into first-order ones, so that existing techniques for termination analysis and propagation of binding-times of first-order programs can be applied. Then, we define another transform

osteopath

Analysis of Linear Hybrid Systems in CLP,accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive notation for specifying real-time systems. The main contributions are (i) a technique for capturing the reachable states of the continuously changing state

招人嫉妒

Automatic Generation of Test Inputs for Mercury,reason about program executions as paths in a control-flow graph. Next, we define how such a path corresponds to a set of constraints whose solution defines input values for the predicate under test such that when the predicate is called with respect to these input values, the execution is guarantee

amnesia

Narcissist

The MEB and CEB Static Analysis for CSP Specifications,echnique allows us to know what parts of the specification must necessarily be executed before this event, and what parts of the specification could be executed before it in some execution. Our technique is based on a new data structure which extends the . (SCFG). We show that this new data structur

座右铭

Fast Offline Partial Evaluation of Large Logic Programs,lassical BTA for offline partial evaluation of logic programs. In contrast to previous approaches, the new BTA is conceptually simpler and considerably faster, scaling to medium-sized or even large examples and, moreover, it ensures both the so called local and global termination. We also show that

indignant

原来