Modular control-flow analysis with rank 2 intersection types

Authors:
Anindya Banerjee;Thomas Jensen
Affiliations:
Department of Computing and Information Sciences, Kansas State University, Manhattan KS 66506, U.S.A. Email: ab@cis.ksu.edu;IRISA/CNRS, Campus de Beaulieu, F-35042 Rennes, France Email: jensen@irisa.fr
Venue:
Mathematical Structures in Computer Science
Year:
2003

Citing 54
Cited 11

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Automatic binding time analysis for a typed &lgr;-calculus

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strictness analysis: a new perspective based on type inference

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Control-flow analysis of higher-order languages of taming lambda

Control-flow analysis of higher-order languages of taming lambda
Two-level functional languages

Two-level functional languages
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of the typed call-by-value λ-calculus using a stack of regions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving algorithms from type inference systems: application to strictness analysis

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline

Information and Computation
A syntactic approach to type soundness

Information and Computation
A unified treatment of flow analysis in higher-order languages

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Closure analysis in constraint form

ACM Transactions on Programming Languages and Systems (TOPLAS)
Safety analysis versus type inference

Information and Computation
A type system equivalent to flow analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Effect systems with subtyping

PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Lazy type inference and program analysis

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
What are principal typings and what are they good for?

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rank 2 intersection type assignment in term rewriting

Fundamenta Informaticae
Lightweight closure conversion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Region-based memory management

Information and Computation
A modular, polyvariant and type-based closure analysis

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Strongly typed flow-directed representation transformations (extended abstract)

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Infinitary control flow analysis: a collecting semantics for closure analysis

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Disjunctive program analysis for algebraic data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inference of polymorphic and conditional strictness properties

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial online cycle elimination in inclusion constraint graphs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Principality and decidable type inference for finite-rank intersection types

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint systems for useless variable elimination

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based useless variable elimination

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Functioning without closure: type-safe customized function representations for standard ML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Polymorphic type inference

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Polymorphic Binding-Time Analysis

ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Strictness Analysis in Logical Form

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Strictness Logic and Polymorphic Invariance

TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Design and Correctness of Program Transformations Based on Control-Flow Analysis

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Une Extension de la Theorie des Types en lambda-Calcul

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Flow Analysis of Lambda Expressions (Preliminary Version)

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Detecting and Removing Dead-Code using Rank 2 Intersection

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Refinement Types for Program Analysis

SAS '96 Proceedings of the Third International Symposium on Static Analysis
Exact Flow Analysis

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Type-Directed Flow Analysis for Typed Intermediate Languages

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Program Representation Size in an Intermediate Language with Intersection and Union Types

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
A Complete Type Inference Algorithm for Simple Intersection Types

CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Control-Flow Analysis and Type Systems

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Rank 2 Type Systems and Recursive Definitions

Rank 2 Type Systems and Recursive Definitions
The logic and expressibility of simply-typed call-by-value and lazy languages

The logic and expressibility of simply-typed call-by-value and lazy languages
A computational formalization for partial evaluation

Mathematical Structures in Computer Science
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
From ML to Ada: Strongly-typed language interoperability via source translation

Journal of Functional Programming
Type and behaviour reconstruction for higher-order concurrent programs

Journal of Functional Programming

Relating complexity and precision in control flow analysis

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Using intersection types for cost-analysis of higher-order polymorphic functional programs

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
On the rôle of minimal typing derivations in type-driven program transformation

Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Verifying pointer and string analyses with region type systems

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Approximation semantics and expressive predicate assignment for object-oriented programming

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Control-flow analysis of functional programs

ACM Computing Surveys (CSUR)
Higher-order symbolic execution via contracts

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
A structural soundness proof for shivers's escape technique: a case for galois connections

SAS'12 Proceedings of the 19th international conference on Static Analysis
Verifying pointer and string analyses with region type systems

Computer Languages, Systems and Structures
Semantic Types and Approximation for Featherweight Java

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how the principal typing property of the rank 2 intersection type system enables the specification of a modular and polyvariant control-flow analysis.