[图书][B] Principles of program analysis

F Nielson, HR Nielson, C Hankin - 2015 - books.google.com
Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

Proving optimizations correct using parameterized program equivalence

S Kundu, Z Tatlock, S Lerner - ACM Sigplan Notices, 2009 - dl.acm.org
Translation validation is a technique for checking that, after an optimization has run, the
input and output of the optimization are equivalent. Traditionally, translation validation has …

Automated soundness proofs for dataflow analyses and transformations via local rules

S Lerner, T Millstein, E Rice, C Chambers - ACM SIGPLAN Notices, 2005 - dl.acm.org
We present Rhodium, a new language for writing compiler optimizations that can be
automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses …

Method and apparatus for creating an index in a database system

DT Chang, JMK Cheng, JH Chow, J Xu - US Patent 6,240,407, 2001 - Google Patents
ASSistant Examiner Diane Mizrahi (57) ABSTRACT A method, apparatus and article of
manufacture for computer-implemented creation of an indeX in a database System is …

Composing dataflow analyses and transformations

S Lerner, D Grove, C Chambers - ACM SIGPLAN Notices, 2002 - dl.acm.org
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these
interactions have either (1) iteratively performed each individual analysis until no further …

PAG–an efficient program analyzer generator

F Martin - International Journal on Software Tools for Technology …, 1998 - Springer
The program analyzer generator PAG described in this paper attempts to offer the best of
both worlds, specification languages based on the clean theory of abstract interpretation and …

Optimal domains for disjunctive abstract interpretation

R Giacobazzi, F Ranzato - Science of Computer Programming, 1998 - Elsevier
In the context of standard abstract interpretation theory, we define the inverse operation to
the disjunctive completion of abstract domains, introducing the notion of least disjunctive …

TSL: A system for generating abstract interpreters and its application to machine-code analysis

J Lim, T Reps - ACM Transactions on Programming Languages and …, 2013 - dl.acm.org
This article describes the design and implementation of a system, called Tsl (for Transformer
Specification Language), that provides a systematic solution to the problem of creating …

Generation of efficient interprocedural analyzers with PAG

M Alt, F Martin - Static Analysis: Second International Symposium, SAS' …, 1995 - Springer
To produce high quality code, modern compilers use global optimization algorithms based
on abstract interpretation. These algorithms are rather complex; their implementation is …

Refining and compressing abstract domains

R Giacobazzi, F Ranzato - International Colloquium on Automata …, 1997 - Springer
In the context of Cousot and Cousot's abstract interpretation theory, we present a general
framework to define, study and handle operators modifying abstract domains. In particular …