Sciweavers

76 search results - page 4 / 16
» Reusing Proofs
Sort
View
ACTA
2011
14 years 4 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
67
Voted
ECOOPW
1999
Springer
15 years 1 months ago
Correct Composition of Design Components
In this paper, we describe a method for the composition of components that are relatively correct under a particular criterion. The notion of composition pattern is also introduce...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan
POPL
2010
ACM
15 years 7 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
IS
2006
14 years 9 months ago
A proof markup language for Semantic Web services
The Semantic Web is being designed to enable automated reasoners to be used as core components in a wide variety of Web applications and services. In order for a client to accept ...
Paulo Pinheiro da Silva, Deborah L. McGuinness, Ri...
VSTTE
2010
Springer
14 years 7 months ago
Reusable Verification of a Copying Collector
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
Magnus O. Myreen