Sciweavers

141 search results - page 7 / 29
» Automatically Proving Concurrent Programs Correct
Sort
View
FAC
2010
106views more  FAC 2010»
13 years 5 months ago
Automatic verification of Java programs with dynamic frames
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...
ENTCS
2010
165views more  ENTCS 2010»
13 years 7 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
SIGSOFT
2010
ACM
13 years 5 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen
PLDI
2010
ACM
13 years 10 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
14 years 1 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards