Titlebook: Static Analysis; Second International Alan Mycroft Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 High-Level Programmin

人充满活力

neutrophils

叫喊

盘旋

画布

Complementation in abstract interpretation,ch we call complementation. Such an operation allows to systematically decompose domains; it provides a systematic way to design new abstract domains; it allows to simplify domain verification problems, like correctness proofs; and it yields space saving representations for domains. We show that the

设想

CAND

Optimizing lazy functional programs using flow inference,r each variable . in a program which expressions could have originated the value of ., can improve the situation by removing redundant eval and thunk operations, avoiding thunk updates, and allowing the use of unboxed representations of some data. We formulate flow analysis as an inference problem i

addict

FAST

A type-based analysis for stack allocation in functional languages,use an annotated type system to infer information about the occurrence and extent of variables in a simple higher-order functional language and combine this system with a translation to an annotated language which explicitly indicates when stack allocation can be performed. This technique supports b

defray

Control-flow analysis and type systems,olving simple types, subtypes and recursion) and conservatively extend them to reason about control-flow information. Similarly, we take four standard control-flow systems and conservatively extend them to reason about type consistency. Our main result is that we can match up the resulting type and