Chris Hankin, Daniel Le Métayer  Home/Search
Context Related
| irisa.fr/local/lande/dlmpopl94.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: irisa.fr/EXTERNE/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The role of non-standard type inference in static program analysis has been much studied recently. Early work emphasised the efficiency of type inference algorithms and paid little attention to the correctness of the inference system. Recently more powerful inference systems have been investigated but the connection with efficient inference algorithms has been obscured. The contribution of this paper is twofold: first we show how to transform a program logic into an algorithm and, second, we... (Update)
Context of citations to this paper: More
.... We are currently investigating a more efficient version of the algorithm inspired by previous work on cahotic iteration [30] and lazy types [18] which avoid the exploration of the whole domain of properties (computing only the information required to answer an initial query)...
...The next step consists in the derivation of an algorithm from the specification. The derivation follows the method presented in [10] to get a decidable and deterministic proof system. Choices have to be made among algorithmic alternatives during Irisa Static debugging...
Cited by: More
Refinement Types for ML - Freeman (1994) (Correct)
Analyse Statique De Programmes : Fondements Et Applications - Jensen (1999) (Correct)
Formal Development of Static Program Analysers - Gouranton, Métayer (1997) (Correct)
Similar documents (at the sentence level):
17.7%: Lazy Type Inference for the Strictness Analysis of Lists - Hankin, Métayer (1994) (Correct)
16.4%: Lazy types and Program Analysis - Hankin, Métayer (1994) (Correct)
Active bibliography (related documents): More All
0.8: A Type-based Framework for Program Analysis - Chris Hankin (1994) (Correct)
0.4: A Syntactic Method for Finding Least Fixed Points of.. - Chuang, Goldberg (1997) (Correct)
0.2: Polymorphic Strictness Analysis Using Frontiers - Seward (1992) (Correct)
Similar documents based on text: More All
0.3: Strictness Types: An Inference Algorithm and an Application - Amtoft (1993) (Correct)
0.1: Inference of Polymorphic and Conditional Strictness Properties - Jensen (1998) (Correct)
0.1: Uniform Ideals and Strictness Analysis - Ernoult, Mycroft (1991) (Correct)
Related documents from co-citation: More All
7: Strictness analysis in logical form - Jensen - 1991
7: and pointer operations in Pascal (context) - Luckham, Suzuki et al. - 1979
7: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
BibTeX entry: (Update)
Chris Hankin and Daniel Le M'etayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, pages 202--212. ACM, January 1994. http://citeseer.ist.psu.edu/hankin94deriving.html More
@inproceedings{ hankin94deriving,
author = "Chris Hankin and Daniel Le M\'{e}tayer",
title = "Deriving algorithms from type inference systems: Application to strictness analysis",
booktitle = "Conference Record of {POPL} '94: 21ST {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages, Portland, Oregon",
address = "New York, NY",
pages = "202--212",
year = "1994",
url = "citeseer.ist.psu.edu/hankin94deriving.html" }
Citations (may not include all citations):137 A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
85 Type inference with simple subtypes (context) - Mitchell - 1991
73 Is there a use for linear logic (context) - Wadler - 1991
71 Abstract Interpretation and Optimising Transformations for A.. (context) - Mycroft - 1981
64 Efficient type inference for higher-order binding time analy.. - Henglein - 1991
54 Strictness Analysis on Non-flat Domains (context) - Wadler - 1987
48 From Operational Semantics to Abstract Machines (context) - Hannan, Miller - 1992
48 Comparing the Galois Connection and Widening/Narrowing Appro.. - Cousot, Cousot - 1992
44 Data-flow analysis of applicative programs using minimal fun.. (context) - Jones, Mycroft - 1986
41 Strictness Analysis - A Practical Approach (context) - Clack, Jones - 1985
41 Strictness Analysis in Logical Form - Jensen - 1991
41 Complete restrictions of the intersection type discipline - van Bakel - 1992
32 Strictness analysis: a new perspective based on type inferen.. (context) - Kuo, Mishra - 1989
24 Strictness analysis using abstract reduction (context) - Nocker - 1993
14 Strictness logic and polymorphic invariance (context) - Benton - 1992
12 Fixed Points and Frontiers: A New Perspective (context) - Hunt, Hankin - 1991
12 Reasoning about simple and exhaustive demand in higher-order.. (context) - Leung, Mishra - 1991
10 Approximate fixed points in abstract interpretation (context) - Hankin, Hunt - 1992
8 Polymorphic Typing by Abstract Interpretation (context) - Monsuez - 1992
6 Fast abstract interpretation using sequential algorithms - Ferguson, Hughes - 1993
6 A syntactic approach to fixed point computation on finite do.. - Chuang, Goldberg - 1992
4 Investigating a proof-theoretic metalanguage (context) - Hannan - 1991
4 Also available as DIKU Technical Report (context) - Jensen, in et al. - 1992
3 Abstract reduction: a theory via abstract interpretation (context) - van Eekelen, Goubault et al. - 1992
2 Strictness and binding time: two for the price of one (context) - Launchbury - 1991
2 Finding Fixed Points in Abstract Interpretation (context) - Jones, Clack - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.irisa.fr/EXTERNE/projet/lande/BIBLIO/publications.html): More
Imagining CLP(Λ,≡αβ) - Ridoux (1995) (Correct)
Refining Multiset Transformers - Hankin, Métayer, Sands (Correct)
The Architecture of an Implementation of λProlog.. - Brisset, Ridoux (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC