Sciweavers

9626 search results - page 323 / 1926
» Invariant Based Programming
Sort
View
ICFP
1999
ACM
15 years 11 months ago
Atomic Heap Transactions and Fine-grain Interrupts
Languages such as Java, ML, Scheme, and Haskell provide automatic storage management, that is, garbage collection. The two fundamental operations performed on a garbagecollected h...
Olin Shivers, James W. Clark, Roland McGrath
POPL
1993
ACM
15 years 10 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
CSL
2006
Springer
15 years 10 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
ENTCS
2006
140views more  ENTCS 2006»
15 years 6 months ago
A Library for Self-Adjusting Computation
We present a Standard ML library for writing programs that automatically adjust to changes to their data. The library combines modifiable references and memoization to achieve eff...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Rob...
FUIN
2010
97views more  FUIN 2010»
15 years 5 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant