1071 search results - page 105 / 215 » Programming with enumerable sets of structures |
122
click to vote
POPL
2010
ACM
16 years 11 days ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
125
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
109
click to vote
AAAI
2008
15 years 5 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
107
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
148
click to vote
AGENTS
2000
Springer
15 years 7 months ago
2000
Springer
Before the powerful agent programming paradigm can be adopted in commercial or industrial settings, a complete environment, similar to that for other programming languages, must b...