1423 search results - page 222 / 285 » Languages of Nested Trees |
136
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
130
click to vote
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
218
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
129
click to vote
ASPLOS
2012
ACM
14 years 18 hour ago
2012
ACM
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
142
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...