内容

目次

Constraint-based program analysis.- Semantics-directed program analysis: A tool-maker's perspective.- Property-oriented expansion.- Generalized dominators for structured programs.- Cache behavior prediction by abstract interpretation.- Termination analysis for offline partial evaluation of a higher order functional language.- Proving correctness of Constraint Logic Programs with dynamic scheduling.- Understanding mobile agents via a non-interleaving semantics for facile.- Termination analysis for partial functions.- A freeness and sharing analysis of logic programs based on a pre-interpretation.- Refinement types for program analysis.- A comparison of three occur-check analysers.- Analysis of the equality relations for the program terms.- An even faster solver for general systems of equations.- Inferring program specifications in polynomial-time.- Automated modular termination proofs for real Prolog programs.- Data-flow-based virtual function resolution.- Compiling laziness using projections.- Optimized algorithms for incremental analysis of logic programs.- Tractable constraints in finite semilattices.- Uniformity for the decidability of hybrid automata.- A backward slicing algorithm for Prolog.- Combining slicing and constraint solving for validation of measurement software.- Subtyping constrained types.- Abstract cofibered domains: Application to the alias analysis of untyped programs.- Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation.- Two applications of an incremental analysis engine for (constraint) logic programs.- PAN — The Prolog analyzer.