15 search results - page 1 / 3 » Proof of Soundness of Concurrent Separation Logic for GPGPU ... |
ESOP
2011
Springer
13 years 1 months ago
2011
Springer
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
APLAS
2009
ACM
14 years 4 months ago
2009
ACM
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...
ENTCS
2006
13 years 9 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
PPDP
2007
Springer
14 years 3 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...