Sciweavers

1499 search results - page 62 / 300
» Chopping Concurrent Programs
Sort
View
SAS
2007
Springer
14 years 3 months ago
Modular Safety Checking for Fine-Grained Concurrency
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
Cristiano Calcagno, Matthew J. Parkinson, Viktor V...
CONCURRENCY
2004
124views more  CONCURRENCY 2004»
13 years 8 months ago
Checking ownership and confinement
Abstract. A number of formal proposals to manage aliasing in Java-like programming languages have been advanced over the last five years. Unfortunately, it is not clear how practic...
Alex Potanin, James Noble, Robert Biddle
ICFP
2004
ACM
14 years 9 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
ICFP
2005
ACM
14 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
ISCA
2006
IEEE
138views Hardware» more  ISCA 2006»
14 years 3 months ago
Program Demultiplexing: Data-flow based Speculative Parallelization of Methods in Sequential Programs
We present Program Demultiplexing (PD), an execution paradigm that creates concurrency in sequential programs by "demultiplexing" methods (functions or subroutines). Cal...
Saisanthosh Balakrishnan, Gurindar S. Sohi