Sciweavers

147 search results - page 11 / 30
» Reasoning about Deadlines in Concurrent Real-Time Programs
Sort
View
CONCUR
2004
Springer
14 years 27 days ago
A Semantics for Concurrent Separation Logic
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Stephen D. Brookes
ESOP
2008
Springer
13 years 9 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 7 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
JPDC
2007
184views more  JPDC 2007»
13 years 7 months ago
Modeling of concurrent web sessions with bounded inconsistency in shared data
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Alexander Totok, Vijay Karamcheti
SIGSOFT
2008
ACM
14 years 8 months ago
Randomized active atomicity violation detection in concurrent programs
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
Chang-Seo Park, Koushik Sen