Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar2. SAS 1995: Glasgow, UK
Alan Mycroft:
Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 25-27, 1995, Proceedings. Lecture Notes in Computer Science 983, Springer 1995, ISBN 3-540-60360-3
Invited Talks
David A. Schmidt:
Natural-Semantics-Based Abstract Interpretation (Preliminary Version). 1-18Mads Tofte:
Region Inference for Higher-Order Functional Languages. 19-20Pierre Wolper, Bernard Boigelot:
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). 21-32
Contributed Papers
Martin Alt, Florian Martin:
Generation of Efficient Interprocedural Analyzers with PAG. 33-50Rance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich:
Optimality in Abstractions of Model Checking. 51-63Christopher Colby:
Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data. 64-81Satyan R. Coorg:
Partitioning Non-strict Functional Languages for Multi-threaded Code Generation. 82-99Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato:
Complementation in Abstract Interpretation. 100-117Dirk Dussart, Fritz Henglein, Christian Mossin:
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. 118-135Karl-Filip Faxén:
Optimizing Lazy Functional Programs Using Flow Inference. 136-153Jürgen Giesl:
Termination Analysis for Functional Programs using Term Orderings. 154-171John Hannan:
A Type-based Analysis for Stack Allocation in Functional Languages. 172-188Nevin Heintze:
Control-Flow Analysis and Type Systems. 189-206Suresh Jagannathan, Andrew K. Wright:
Effective Flow Analysis for Avoiding Run-Time Checks. 207-224Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa:
Static Analysis of Communication for Asynchronous Concurrent Programming Languages. 225-242M. R. K. Krishna Rao, R. K. Shyamasundar:
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs. 243-260Markus Mohnen:
Efficient Closure Utilisation by Higher-Order Inheritance Analysis. 261-278Bruno Monsuez:
System F and Abstract Interpretation. 279-295Kristian Nielsen, Morten Heine Sørensen:
Call-By-Name CPS-Translation as a Binding-Time Improvement. 296-313Jens Palsberg, Peter Ørbæk:
Trust in the lambda-Calculus. 314-329Viswanath Ramachandran, Pascal Van Hentenryck:
LSign Reordered. 330-347Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz:
Abstract Reduction Using a Tableau Calculus. 348-365Manuel Serrano, Pierre Weis:
Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages. 366-381Julian Seward:
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell. 382-399Franck Védrine:
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation. 400-417
System Descriptions
Christian Fecht:
GENA - A Tool for Generating Prolog Analyzers from Specifications. 418-419Magnus Nordin, Thomas Lindgren, Håkan Millroth:
IGOR: A Tool for Developing Prolog Dataflow Analyzers. 420-421
last updated on 2019-10-18 23:05 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
