SAS 2002

35 papers

1. A Few Graph-Based Relational Numerical Abstract Domains · Antoine Miné
2. An Algebraic Approach to the Static Analysis of Concurrent Software · Javier Esparza
3. An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages · John Whaley, Monica S. Lam
4. An Improved Constraint-Based System for the Verification of Security Protocols · Ricardo Corin, Sandro Etalle
5. Analysing Approximate Confinement under Uniform Attacks · Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
6. Automated Verification of Concurrent Linked Lists with Counters · Tuba Yavuz-Kahveci, Tevfik Bultan
7. Backward Type Inference Generalises Type Checking · Lunjin Lu, Andy King
8. Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation · Charles Hymans
9. Compactly Representing First-Order Structures for Static Analysis · Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv
10. Detecting Optimal Termination Conditions of Logic Programs · Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
11. Finiteness Analysis in Polynomial Time · Chin Soon Lee
12. From Secrecy to Authenticity in Security Protocols · Bruno Blanchet
13. Guaranteed Optimization: Proving Nullspace Properties of Compilers · Todd L. Veldhuizen, Andrew Lumsdaine
14. Improving the Precision of Equality-Based Dataflow Analyses · Erik Ruf
15. Making Abstract Model Checking Strongly Preserving · Francesco Ranzato, Francesco Tapparo
16. Modular Control Flow Analysis for Libraries · Christian W. Probst
17. More Precise Yet Efficient Type Inference for Logic Programs · Claudio Vaucheret, Francisco Bueno
18. Nonuniform Alias Analysis of Recursive Data Structures and Arrays · Arnaud Venet
19. Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi · Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
20. On Termination of Logic Programs with Floating Point Computations · Alexander Serebrenik, Danny De Schreye
21. Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges · Robert J. Hall
22. Pipeline Modeling for Timing Analysis · Marc Langenbach, Stephan Thesing, Reinhold Heckmann
23. Polynomial Constants Are Decidable · Markus Müller-Olm, Helmut Seidl
24. Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library · Roberto Bagnara, Elisa Ricci, Enea Zaffanella, Patricia M. Hill
25. Refinement of LTL Formulas for Abstract Model Checking · María-del-Mar Gallardo, Pedro Merino, Ernesto Pimentel
26. Representation Analysis for Coercion Placement · Karl-Filip Faxén
27. Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes · Bertrand Jeannet
28. Reuse of Results in Termination Analysis of Typed Logic Programs · Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
29. Securing Communication in a Concurrent Language · Andrei Sabelfeld, Heiko Mantel
30. Security Typings by Abstract Interpretation · Mirko Zanotti
31. Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties · Damien Massé
32. Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis · Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle + 1 more
33. States vs. Traces in Model Checking by Abstract Interpretation · Roberto Giacobazzi, Francesco Ranzato
34. Static Analysis of the Numerical Stability of Loops · Matthieu Martel
35. Static Program Analysis via 3-Valued Logic · Thomas W. Reps