• Cite Icon16
  • https://doi.org/10.1007/3-540-61739-6_39Copy DOI Icon

Refinement types for program analysis

  • Jan 1, 1996
  • Mario Coppo +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we introduce a system for the detection and elimination of dead code in typed functional programs. The main application of this method is the optimization of programs extracted from proofs in logical frameworks but it could be used as well in the elimination of dead code determined by program specialization. Our algorithm is based on a type inference system suitable for reasoning about dead code information. This system relays on refinement types which allow to exploit the type structure of the language for the investigation of program properties. The detection of dead code is obtained via type inference, which can be performed in an efficient and complete way, by reducing it to the solution of a system of inequalities between type variables. A key feature of our method is that program analysis can be performed in a strictly incremental way. Even though the language considered in the paper is a simply typed λ-calculus we can generalize our approach to polymorphic languages like ML. Although focused on dead code elimination our type inference method can also be applied to the investigation of other program properties like binding time and strictness. Some hints on these applications are given.

Similar Papers
  • Conference Article
  • Citations3

Dead code elimination technique in eclipse compiler for Java

  • Dec 01, 2015
  • Hiral H Karer +1
  • Dissertation

Classifying Dead Code in Software Development

  • Mar 01, 2022
  • Arman Alavizadeh
  • Research Article

The Opticode: A User-Centric Tool for Enhancing Software Efficiency and Minimizing Errors Through Dead Code Elimination and Loop Invariant Code Motion Techniques

  • Dec 18, 2024
  • Communications on Applied Nonlinear Analysis
  • Tulshihar Patil
  • Conference Article
  • Citations22

Dead code elimination for web systems written in PHP: Lessons learned from an industry case

  • Sep 01, 2012
  • Hidde Boomsma +2
  • Conference Article
  • Citations3

Type inference methods and performance for data in an RDBMS

  • May 20, 2012
  • Peter Mcbrien +2
  • Conference Article
  • Citations412

Refinement types for ML

  • Jan 01, 1991
  • Tim Freeman +1
  • Conference Article
  • Citations7

A New Technique for Copy Propagation And Dead Code Elimination Using Hash Based Value Numbering

  • Dec 01, 2006
  • K V N Sunitha +1
  • Conference Article
  • Citations1

A Type Checker for a Logical Framework with Union and Intersection Types

  • May 14, 2020
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Claude Stolze +1
  • Research Article
  • Citations21

“Slimming” a Java virtual machine by way of cold code removal and optimistic partial program loading

  • Apr 29, 2010
  • Science of Computer Programming
  • Gregor Wagner +2
  • Conference Article
  • Citations3

Static optimization in PHP 7

  • Feb 05, 2017
  • Nikita Popov +3
  • Research Article
  • Citations49

Partial dead code elimination

  • Jun 01, 1994
  • ACM SIGPLAN Notices
  • Jens Knoop +2
  • Research Article
  • Citations11

Data flow refinement type inference

  • Jan 04, 2021
  • Proceedings of the ACM on Programming Languages
  • Zvonimir Pavlinovic +2
  • Research Article
  • Citations1

Combining type inference techniques for semi-automatic UML generation from Pharo code

  • Nov 14, 2024
  • Journal of Computer Languages
  • Jan Blizničenko +1
  • Book Chapter
  • Citations43

Dead Code Elimination through Dependent Types

  • Jan 01, 1998
  • Hongwei Xi
  • Research Article

A Mathematical Modeling Framework Opti-Blend for Integrated Code Analysis through Dead Code Elimination, Clone Detection, and Loop Optimization

  • Oct 02, 2025
  • International Journal of Applied Mathematics
  • Tulshihar Patil
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.