3513 search results - page 473 / 703 » Super Logic Programs |
122
click to vote
FOSSACS
2008
Springer
15 years 4 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
124
Voted
SIGSOFT
2004
ACM
16 years 3 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
215
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
203
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
135
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...