3481 search results - page 295 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
156
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
176
click to vote
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
210
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
158
click to vote
ENTCS
2002
15 years 4 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
147
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...