Sciweavers

2302 search results - page 282 / 461
» The Evolution of Concurrent Programs
Sort
View
OOPSLA
2010
Springer
15 years 4 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
16 years 1 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
RTAS
2008
IEEE
16 years 27 days ago
Real-Time Distributed Discrete-Event Execution with Fault Tolerance
We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE executi...
Thomas Huining Feng, Edward A. Lee
IPPS
2006
IEEE
16 years 16 days ago
Incrementally developing parallel applications with AspectJ
1 This paper presents a methodology to develop more modular parallel applications, based on aspect oriented programming. Traditional object oriented mechanisms implement applicatio...
João Luís Sobral
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
16 years 1 days ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn