2067 search results - page 355 / 414 » Logics of propositional control |
153
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
282
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
167
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
It is difficult to design and test location-enhanced applications. A large part of this difficulty is due to the added complexity of supporting location. Wizard of Oz (WOz) has be...
272
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
We describe an approach for pipelining nested data collections in scientific workflows. Our approach logically delimits arbitrarily nested collections of data tokens using special...
148
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...