63 search results - page 10 / 13 » Static analysis of atomicity for programs with non-blocking ... |
152
click to vote
ISOLA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
114
click to vote
TACAS
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
126
click to vote
PPOPP
2006
ACM
15 years 5 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
176
click to vote
POPL
2009
ACM
16 years 8 days ago
2009
ACM
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
POPL
2004
ACM
15 years 5 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...