Sciweavers

71 search results - page 3 / 15
» Parameterized Memory Models and Concurrent Separation Logic
Sort
View
ASIAN
2004
Springer
150views Algorithms» more  ASIAN 2004»
13 years 10 months ago
Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
Vijay A. Saraswat
TPHOL
2009
IEEE
13 years 11 months ago
Types, Maps and Separation Logic
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...
Rafal Kolanski, Gerwin Klein
ECCC
2007
90views more  ECCC 2007»
13 years 5 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 2 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
APLAS
2009
ACM
13 years 11 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel