Sciweavers

88 search results - page 2 / 18
» Proving the Correctness of the STG Machine
Sort
View
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
13 years 11 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
ESOP
1992
Springer
13 years 10 months ago
A Provably Correct Compiler Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
Jens Palsberg
COORDINATION
2005
Springer
13 years 11 months ago
A Correct Abstract Machine for Safe Ambients
t Abstract Machine for Safe Ambients Daniel Hirschkoff1 , Damien Pous1 , and Davide Sangiorgi2 1 ENS Lyon, France 2 Universit`a di Bologna, Italy Abstract. We describe an abstract...
Daniel Hirschkoff, Damien Pous, Davide Sangiorgi
CSR
2007
Springer
13 years 12 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich
MEMOCODE
2010
IEEE
13 years 3 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler