153 search results - page 13 / 31 » Independence and Concurrent Separation Logic |
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
107
click to vote
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
74
Voted
PLDI
1990
ACM
15 years 1 months ago
1990
ACM
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
POPL
2010
ACM
15 years 6 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...