3738 search results - page 516 / 748 » Parametrized Logic Programming |
107
click to vote
ESOP
2004
Springer
15 years 6 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
104
click to vote
FOSSACS
2008
Springer
15 years 2 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...
103
click to vote
SIGSOFT
2004
ACM
16 years 1 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 ...
186
click to vote
POPL
2009
ACM
16 years 1 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...
178
Voted
POPL
2005
ACM
16 years 1 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...