default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. SAS 2000: Santa Barbara, CA, USA
- Jens Palsberg:
Static Analysis, 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 1, 2000, Proceedings. Lecture Notes in Computer Science 1824, Springer 2000, ISBN 3-540-67668-6
Invited Papers
- Daniel Jackson:
Enforcing Design Constraints with Object Logic. 1-21 - Andreas Podelski:
Model Checking as Constraint Solving. 22-37
Contributed Papers
- Gianluca Amato, Giorgio Levi:
Abstract Interpretation Based Semantics of Sequent Calculi. 38-57 - Saddek Bensalem, Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Yassine Lakhnech:
A Transformational Approach for Generating Non-linear Invariants. 58-74 - Wei-Ngan Chin, Siau-Cheng Khoo, Zhenjiang Hu, Masato Takeichi:
Deriving Parallel Codes via Invariants. 75-94 - David Clark
, Chris Hankin, Sebastian Hunt:
Safety of Strictness Analysis via Term Graph Rewriting. 95-114 - Nurit Dor, Michael Rodeh, Shmuel Sagiv:
Checking Cleanness in Linked Lists. 115-134 - Jérôme Feret:
Confidentiality Analysis of Mobile Systems. 135-154 - Stephen J. Fink, Kathleen Knobe, Vivek Sarkar:
Unified Analysis of Array and Object References in Strongly Typed Languages. 155-174 - Jeffrey S. Foster, Manuel Fähndrich, Alexander Aiken:
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C. 175-198 - Etienne Gagnon, Laurie J. Hendren, Guillaume Marceau:
Efficient Inference of Static Types for Java Bytecode. 199-219 - Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-François Raskin:
Abstract Interpretation of Game Properties. 220-239 - Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa:
FULLDOC: A Full Reporting Debugger for Optimized Code. 240-259 - Jens Knoop, Jean-Francois Collard, Roy Dz-Ching Ju:
Partial Redundancy Elimination on Predicated Code. 260-279 - Tal Lev-Ami, Shmuel Sagiv:
TVLA: A System for Implementing Static Analyses. 280-301 - Laurent Mauborgne:
Tree Schemata and Fair Termination. 302-321 - David Monniaux:
Abstract Interpretation of Probabilistic Semantics. 322-339 - Robert Muth, Scott A. Watterson, Saumya K. Debray:
Code Specialization Based on Value Profiles. 340-359 - James Riely, Jan F. Prins:
Flattening Is an Improvement. 360-376 - Hassen Saïdi:
Model Checking Guided Abstraction and Analysis. 377-396 - Francesca Scozzari:
Abstract Domains for Sharing Analysis by Optimal Semantics. 397-412 - Cristian Ungureanu, Suresh Jagannathan:
Concurrency Analysis for Java. 413-432
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 2026-07-10 00:40 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
