ABCD

This publication has 35 references indexed in Scilit:

• Eliminating array bound checking through dependent types
  ACM SIGPLAN Notices, 1998
• A practical framework for demand-driven interprocedural data flow analysis
  ACM Transactions on Programming Languages and Systems, 1997
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
  Journal of Algorithms, 1996
• Precise interprocedural dataflow analysis with applications to constant propagation
  Theoretical Computer Science, 1996
• Avoiding conditional branches by code replication
  ACM SIGPLAN Notices, 1995
• Optimizing array bound checks using flow analysis
  ACM Letters on Programming Languages and Systems, 1993
• Lazy code motion
  ACM SIGPLAN Notices, 1992
• Optimization of array subscript range checks
  ACM Letters on Programming Languages and Systems, 1992
• Global optimization by suppression of partial redundancies
  Communications of the ACM, 1979
• A fast and usually linear algorithm for global flow analysis (abstract only)
  Communications of the ACM, 1975