Sciweavers

906 search results - page 9 / 182
» Linking Theories of Concurrency
Sort
View
103
Voted
TYPES
1993
Springer
15 years 1 months ago
Proof-Checking a Data Link Protocol
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
Leen Helmink, M. P. A. Sellink, Frits W. Vaandrage...
OPODIS
2004
14 years 11 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
SEFM
2007
IEEE
15 years 3 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
VLDB
1989
ACM
44views Database» more  VLDB 1989»
15 years 1 months ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid
FMCO
2006
Springer
135views Formal Methods» more  FMCO 2006»
15 years 1 months ago
Links: Web Programming Without Tiers
Links is a programming language for web applications that generates code for all three tiers of a web application from a single source, compiling into JavaScript to run on the clie...
Ezra Cooper, Sam Lindley, Philip Wadler, Jeremy Ya...