Titlebook: Logic-Based Program Synthesis and Transformation; 26th International S Manuel V Hermenegildo,Pedro Lopez-Garcia Conference proceedings 2017

Cardiac-Output

SKIFF

不满分子

On the Completeness of Selective Unification in Concolic Testing of Logic Programsselective” unification. In this paper, we show that the existing algorithm is not complete and explore different alternatives in order to have a sound and complete algorithm for selective unification.

Nonflammable

Partial Evaluation of Order-Sorted Equational Programs Modulo Axiomsde. Our partial evaluation scheme is based on an automatic unfolding algorithm that computes term . and relies on . for ensuring global termination. We demonstrate the use of the resulting partial evaluator for program optimization on several examples where it shows significant speed-ups.

Axillary

MiniZinc with Stringsvariables. This conversion is obtained via rewrite rules, and does not require any extension of the existing FlatZinc specification. This provides a user-friendly interface for modelling combinatorial problems with strings, and enables both string and non-string solvers to actually solve such problems.

Dappled

CurryCheck: Checking Properties of Curry Programschecking of specifications and contracts occurring in source programs. Hence, CurryCheck is a useful tool that contributes to the property- and specification-based development of reliable and well tested declarative programs.

Conquest

athlete’s-foot

不法行为

ethnology

Hierarchical Shape Abstraction for Analysis of Free List Memory Allocatorsut the allocation policies (best-fit, first-fit, etc.). Such properties are out of the scope of the existing analyzers. We implemented this domain and we show its effectiveness on several implementations of free list allocators.