1071 search results - page 97 / 215 » Programming with enumerable sets of structures |
117
click to vote
CL
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
115
click to vote
ICALP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
141
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
127
click to vote
ICECCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
ACSC
2007
IEEE
15 years 9 months ago
2007
IEEE
Package design is concerned with the determining the best way to partition the classes in a system into subsystems. A poor package design can adversely affect the quality of a sof...