6. SAS 1999: Venice, Italy

Agostino Cortesi, Gilberto Filé (Eds.): Static Analysis, 6th International Symposium, SAS '99, Venice, Italy, September 22-24, 1999, Proceedings. Lecture Notes in Computer Science 1694 Springer 1999, ISBN 3-540-66459-9

@proceedings{DBLP:conf/sas/1999,
  editor    = {Agostino Cortesi and
               Gilberto Fil{\'e}},
  title     = {Static Analysis, 6th International Symposium, SAS '99, Venice,
               Italy, September 22-24, 1999, Proceedings},
  booktitle = {SAS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1694},
  year      = {1999},
  isbn      = {3-540-66459-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Synchronization in JAVA Programs

John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, Hongjun Zheng:
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives. 1-18
Jonathan Aldrich, Craig Chambers, Emin Gün Sirer, Susan J. Eggers:
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs. 19-38

Synchronous Languages

Bertrand Jeannet, Nicolas Halbwachs, Pascal Raymond:
Dynamic Partitioning in Analyses of Numerical Properties. 39-50
Frédéric Besson, Thomas P. Jensen, Jean-Pierre Talpin:
Polyhedral Analysis for Synchronous Languages. 51-68

Abstract Domains

Enea Zaffanella, Patricia M. Hill, Roberto Bagnara:
Decomposing Non-redundant Sharing by Complementation. 69-84
Patricia M. Hill, Fausto Spoto:
Freeness Analysis Through Linear Refinement. 85-100
Laurent Mauborgne:
Binary Decision Graphs. 101-116
Kenichi Asai:
Binding-Time Analysis for Both Static and Dynamic Expressions. 117-133

Concurrency

René Rydhof Hansen, Jacob Grydholt Jensen, Flemming Nielson, Hanne Riis Nielson:
Abstract Interpretation of Mobile Ambients. 134-148
David Monniaux:
Abstracting Cryptographic Protocols with Tree Automata. 149-163
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu:
State Space Reduction Based on Live Variables Analysis. 164-178

Static Single Assignment

Munehiro Takimoto, Kenichi Harada:
Partial Dead Code Elimination Using Extended Value Graph. 179-193
Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gillies, Vatsa Santhanam:
Translating Out of Static Single Assignment Form. 194-210

Optimizations

Yanhong A. Liu, Scott D. Stoller:
Eliminating Dead Code on Recursive Data. 211-231
Oliver Rüthing, Jens Knoop, Bernhard Steffen:
Detecting Equalities of Variables: Combining Efficiency with Precision. 232-247

Foundations

Jörg Köller, Markus Mohnen:
A New Class of Functions for Abstract Interpretation. 248-263
Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel:
Equational Semantics. 264-283
Dominique Cansell, Dominique Méry:
Abstract Animator for Temporal Specifications: Application to TLA. 284-299

Invited Talks and Tutorials

Daniel Weise:
Static Analysis of Mega-Programs. 300-302
Dennis M. Volpano:
Safety versus Secrecy. 303-311
David A. McAllester:
On the Complexity Analysis of Static Analyses. 312-329
Markus Müller-Olm, David A. Schmidt, Bernhard Steffen:
Model-Checking: A Tutorial Introduction. 330-354
Mary Lou Soffa:
Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis. 355-356

Last update Wed Feb 15 04:21:30 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page