Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Developers are often unaware of, or fail to respect, the intentions behind a design due to poor communication of design intent. SCL (Structural Constraint Language) helps develope...
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...