Sciweavers

442 search results - page 8 / 89
» Proof Abstraction for Imperative Languages
Sort
View
POPL
2010
ACM
15 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
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...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
103
Voted
TYPES
1998
Springer
15 years 1 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
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...
Thomas Kleymann
CORR
2010
Springer
97views Education» more  CORR 2010»
14 years 9 months ago
Continuation-Passing C, compiling threads to events through continuations
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...
Gabriel Kerneis, Juliusz Chroboczek
PLDI
2006
ACM
15 years 3 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
70
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
14 years 9 months ago
A persistent union-find data structure
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...
Sylvain Conchon, Jean-Christophe Filliâtre