Sciweavers

1023 search results - page 125 / 205
» A Formal Method for Program Slicing
Sort
View
POPL
2009
ACM
16 years 2 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
16 years 2 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt
FMCAD
2009
Springer
15 years 8 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
SAS
2007
Springer
106views Formal Methods» more  SAS 2007»
15 years 7 months ago
Guided Static Analysis
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Denis Gopan, Thomas W. Reps
101
Voted
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 7 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto