default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. SAS 1994: Namur, Belgium
- Baudouin Le Charlier:
Static Analysis, First International Static Analysis Symposium, SAS'94, Namur, Belgium, September 28-30, 1994, Proceedings. Lecture Notes in Computer Science 864, Springer 1994, ISBN 3-540-58485-4
Invited Talk
- Thomas W. Getzinger:
The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization. 1-25
Logic Programming
- Michael Hanus
, Frank Zartmann:
Mode Analysis of Functional Logic Programs. 26-42 - Alexander Aiken, T. K. Lakshman:
Directional Type Checking of Logic Programs. 43-60 - Dmitri Boulanger, Maurice Bruynooghe:
A Systematic Construction of Abstract Domains. 61-77
Object-Oriented Programming
- Ole Agesen:
Constraint-Based Type Inference and Parametric Polymorphism. 78-100
Instruction Scheduling
- Frank Mueller, David B. Whalley:
Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation. 101-115 - Ed Harcourt, Jon Mauney, Todd A. Cook:
From Processor Timing Specifications to Static Intruction Scheduling. 116-130
Functional Program Optimization
- Anindya Banerjee, David A. Schmidt:
Stackability in the Simply-Typed Call-by-Value Lambda Calculus. 131-146 - Jean Goubault:
Generalized Boxings, Congruences and Partial Inlining. 147-161 - Paul Steckler, Mitchell Wand:
Selective Thunkification. 162-178
Invited Talk
- Nicolas Halbwachs:
About Synchronous Programming and Abstract Interpretation. 179-192
Extent Analysis
- David A. Garza-Salazar, A. P. Wim Böhm:
Uniqueness and Completeness Analysis of Array Comprehensions. 193-207 - Björn Lisper, Jean-Francois Collard:
Extended Analysis of Data Fields. 208-222
Verification
- Nicolas Halbwachs, Yann-Eric Proy, Pascal Raymond:
Verification of Linear Hybrid Systems by Means of Convex Approximations. 223-237 - Kwangkeun Yi:
Compile-time Detection of Uncaught Exceptions in Standard ML Programs. 238-254
Invited Talk
- Saumya K. Debray, Pedro López-García, Manuel V. Hermenegildo, Nai-Wei Lin:
Estimating the Computational Cost of Logic Programs. 255-265
Dependency Analyses for Logic Programming
- Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard:
Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. 266-280 - Michael Codish, Bart Demoen:
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. 281-296 - Daniel Cabeza Gras, Manuel V. Hermenegildo:
Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information. 297-313
Generic Fixpoint Algorithms
- Bart Vergauwen, J. Wauman, Johan Lewi:
Efficient FixPoint Computation. 314-328 - Niels Jörgensen:
Finding Fixpoints in Finite Function Spaces Using Neddedness Analysis and Chaotic Iteration. 329-345
Efficient Strictness Analysis
- Kristian Damm Jensen, Peter Hjæresen, Mads Rosendahl:
Efficient Strictness Analysis of Haskell. 246-362 - Laurent Mauborgne:
Abstract Interpretation Using TDGs. 363-379
Type-based Analyses for Functional Programming
- Chris Hankin, Daniel Le Métayer:
A Type-based Framework for Program Analysis. 380-394 - Fritz Henglein:
Iterative Fixed Point Computation for Type-Based Strictness Analysis. 395-407 - Kirsten Lackner Solberg:
Strictness and Totality Analysis. 408-422
Invited Talk
- Charles Consel:
Fast Strictness Analysis Via Symbolic Fixpoint Iteration. 423-431
Transformation
- Robert Glück, Jesper Jørgensen:
Generating Transformers for Deforestation and Supercompilation. 432-448 - Hessam Khoshnevisan, Mohamad Afshar:
Mechanical Elimination of Commutative Redundancy. 449-463
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-04 01:25 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:
