Sciweavers

1071 search results - page 43 / 215
» Programming with enumerable sets of structures
Sort
View
AOSD
2010
ACM
15 years 5 months ago
Weaving generic programming and traversal performance
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...
Bryan Chadwick, Karl J. Lieberherr
CSCLP
2004
Springer
15 years 4 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
ICSE
1997
IEEE-ACM
15 years 2 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
SSR
2001
134views more  SSR 2001»
15 years 3 days ago
Generation of visitor components that implement program transformations
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
Kurt Stirewalt, Laura K. Dillon
AAAI
2007
15 years 1 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre