51 search results - page 9 / 11 » Static Analysis, Abstract Interpretation and Verification in... |
TRIER
2002
13 years 6 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
ICFP
2009
ACM
14 years 7 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
CADE
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
TAPSOFT
1995
Springer
13 years 10 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
VMCAI
2009
Springer
14 years 1 months ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...