315 search results - page 22 / 63 » Reasoning about Assignments in Recursive Data Structures |
128
click to vote
VALUETOOLS
2006
ACM
15 years 7 months ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
SIGSOFT
2009
ACM
16 years 2 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
113
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
104
click to vote
CAV
2008
Springer
15 years 3 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
127
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...