Sciweavers

957 search results - page 81 / 192
» Modular Static Program Analysis
Sort
View
PPDP
2010
Springer
15 years 18 days ago
Typed and unambiguous pattern matching on strings using regular expressions
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterizatio...
Claus Brabrand, Jakob G. Thomsen
122
Voted
ECLIPSE
2006
ACM
15 years 8 months ago
Generating run-time progress reports for a points-to analysis in Eclipse
Eclipse plug-ins have access to a rich collection of GUI components. One such component is the progress bar, which allows a long-running task to provide Eclipse users with feedbac...
Jason Sawin, Mariana Sharp, Atanas Rountev
212
Voted
POPL
2007
ACM
16 years 2 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
110
Voted
SEFM
2005
IEEE
15 years 7 months ago
Safe Concurrency for Aggregate Objects with Invariants
Developing safe multithreaded software systems is difficult due to the potential unwanted interference among concurrent threads. This paper presents a flexible methodology for o...
Bart Jacobs 0002, Frank Piessens, K. Rustan M. Lei...
138
Voted
PLDI
2012
ACM
13 years 4 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...