default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. SAS 2004: Verona, Italy
- Roberto Giacobazzi:
Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings. Lecture Notes in Computer Science 3148, Springer 2004, ISBN 3-540-22791-1
Invited Talks
- Ehud Shapiro:
Injecting Life with Computers. 1 - Dirk Beyer
, Adam Chlipala, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar:
The Blast Query Language for Software Verification.. 2-18 - Yannis Smaragdakis:
Program Generators and the Tools to Make Them. 19-20 - Sheila A. McIlraith:
Towards Declarative Programming for Web Services. 21
Program and System Verification
- David A. Schmidt:
Closed and Logical Relations for Over- and Under-Approximation of Powersets. 22-37 - Mila Dalla Preda:
Completeness Refinement in Abstract Symbolic Trajectory Evaluation. 38-52 - Sriram Sankaranarayanan, Henny B. Sipma, Zohar Manna:
Constraint-Based Linear-Relations Analysis. 53-68 - Hanne Riis Nielson, Flemming Nielson, Henrik Pilegaard:
Spatial Analysis of BioAmbients. 69-83
Security and Safety
- Qi Sun, Anindya Banerjee, David A. Naumann:
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language. 84-99 - Torben Amtoft, Anindya Banerjee:
Information Flow Analysis in Logical Form. 100-115 - Cormac Flanagan, Stephen N. Freund:
Type Inference Against Races. 116-132
Pointer Analysis
- Suan Hsi Yong, Susan Horwitz:
Pointer-Range Analysis. 133-148 - Arnaud Venet:
A Scalable Nonuniform Pointer Analysis for Embedded Programs. 149-164 - Erik M. Nystrom, Hong-Seok Kim, Wen-mei W. Hwu:
Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis. 165-180
Abstract Interpretation and Algorithms
- Sarah Thompson, Alan Mycroft:
Abstract Interpretation of Combinational Asynchronous Circuits. 181-196 - Charles Hymans, Eben Upton:
Static Analysis of Gated Data Dependence Graphs. 197-211 - Sumit Gulwani, George C. Necula:
A Polynomial-Time Algorithm for Global Value Numbering. 212-227 - Radu Rugina:
Shape Analysis Quantitative Shape Analysis. 228-245 - Bertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv:
A Relational Approach to Interprocedural Shape Analysis. 246-264 - Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field:
Partially Disjunctive Heap Abstraction. 265-279
Abstract Domain and Data Structures
- Enric Rodríguez-Carbonell, Deepak Kapur:
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. 280-295 - Michael Colón:
Approximating the Algebraic Relational Semantics of Imperative Programs. 296-311 - Robert Clarisó, Jordi Cortadella:
The Octahedron Abstract Domain. 312-327 - Sumit Gulwani, George C. Necula:
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions. 328-343
Shape Analysis and Logic
- Marius Bozga, Radu Iosif, Yassine Lakhnech:
On Logics of Aliasing. 344-360 - Viktor Kuncak, Martin C. Rinard:
Generalized Records and Spatial Conjunction in Role Logic. 361-376
Termination Analysis
- Étienne Payet, Frédéric Mesnard:
Non-termination Inference for Constraint Logic Programs. 377-392
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-19 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
