3591 search results - page 250 / 719 » Typing linear constraints |
225
click to vote
VSTTE
2012
Springer
14 years 2 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
165
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric soluti...
181
click to vote
ICTAI
2006
IEEE
16 years 1 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
204
click to vote
CINQ
2004
Springer
16 years 19 days ago
2004
Springer
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
226
click to vote
ESOP
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...