442 search results - page 8 / 89 » Proof Abstraction for Imperative Languages |
POPL
2010
ACM
15 years 7 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...
103
Voted
TYPES
1998
Springer
15 years 1 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
103
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
70
Voted
ML
2007
ACM
14 years 9 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...