Sciweavers

2864 search results - page 162 / 573
» Constraint Programming in OPL
Sort
View
FLOPS
2010
Springer
14 years 2 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
CADE
2010
Springer
13 years 10 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
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...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
ICSE
2007
IEEE-ACM
14 years 9 months ago
SCL: Static Enforcement and Exploration of Developer Intent in Source Code
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...
Daqing Hou
DATE
2005
IEEE
150views Hardware» more  DATE 2005»
14 years 2 months ago
Pueblo: A Modern Pseudo-Boolean SAT Solver
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...
Hossein M. Sheini, Karem A. Sakallah
CP
2005
Springer
14 years 2 months ago
Bounds of Graph Characteristics
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...