default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. SAS 1996: Aachen, Germany
- Radhia Cousot, David A. Schmidt:
Static Analysis, Third International Symposium, SAS'96, Aachen, Germany, September 24-26, 1996, Proceedings. Lecture Notes in Computer Science 1145, Springer 1996, ISBN 3-540-61739-6
Guests
- Alex Aiken:
Constraint-Based Program Analysis (Abstract). 1 - Flemming Nielson:
Semantics-Directed Program Analysis: A Tool-Maker's Perspective. 2-21 - Bernhard Steffen:
Property-Oriented Expansion. 22-41
Contributed Papers
- Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. 42-51 - Martin Helmut Alt, Christian Ferdinand, Florian Martin, Reinhard Wilhelm:
Cache Behavior Prediction by Abstract Interpretation. 52-66 - Peter Holst Andersen, Carsten Kehler Holst:
Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language. 67-82 - Frank S. de Boer, Maurizio Gabbrielli, Catuscia Palamidessi:
Proving Correctness of Constraint Logic Programs with Dynamic Scheduling. 83-97 - Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth Thomsen, Bent Thomsen
:
Understanding Mobile Agents via a Non-Interleaving Semantics for Facile. 98-112 - Jürgen Brauburger, Jürgen Giesl:
Termination Analysis for Partial Functions. 113-127 - Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers:
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. 128-142 - Mario Coppo, Ferruccio Damiani, Paola Giannini:
Refinement Types for Program Analysis. 143-158 - Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard:
A Comparison of Three Occur-Check Analysers. 159-173 - Pavel G. Emeljanov:
Analysis of the Equality Relations for the Program Terms. 174-188 - Christian Fecht, Helmut Seidl:
An Even Faster Solver for General Systems of Equations. 189-204 - Robert Givan:
Inferring Program Specifications in Polynomial-Time. 205-219 - Martin Müller, Thomas Glaß, Karl Stroetmann:
Automated Modular Termination Proofs for Real Prolog Programs. 220-237 - Hemant D. Pande, Barbara G. Ryder:
Data-Flow-Based Virtual Function Resolution. 238-254 - Ross Paterson:
Compiling Laziness Using Projections. 255-269 - Germán Puebla, Manuel V. Hermenegildo:
Optimized Algorithms for Incremental Analysis of Logic Programs. 270-284 - Jakob Rehof, Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices. 285-300 - Olivier F. Roux, Vlad Rusu:
Uniformity for the Decidability of Hybrid Automata. 301-316 - Stéphane Schoenig, Mireille Ducassé:
A Backward Slicing Algorithm for Prolog. 317-331 - Gregor Snelting:
Combining Slicing and Constraint Solving for Validation of Measurement Software. 332-348 - Valery Trifonov, Scott F. Smith:
Subtyping Constrained Types. 349-365 - Arnaud Venet:
Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs. 366-382
System Descriptions
- Maria Handjieva:
STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation. 383-384 - Andrew D. Kelly, Kim Marriott, Harald Søndergaard, Peter J. Stuckey:
Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs. 385-386 - Martin Müller, Thomas Glaß, Karl Stroetmann:
PAN - The Prolog Analyzer. 387-388
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-11-02 21:01 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:
