Static Analysis Third International Workshop, WSA '93, Padova, Italy, September 22-24, 1993. Proceedings

Static Analysis Third International Workshop, WSA '93, Padova, Italy, September 22-24, 1993. Proceedings / edited by Patrick Cousot, Moreno Falaschi, Gilberto File, Antoine Rauzy.

This volume constitutes the proceedings of the third International Workshop on Static Analysis (WSÀ93), held in Padova, Italy, in September 1993. The objective of the international workshop series WSA is to serve as a forum for the discussion of the various aspects of static analysis in different pr...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Cousot, Patrick (Editor), Falaschi, Moreno (Editor), File, Gilberto (Editor), Rauzy, Antoine (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993.
Edition:1st ed. 1993.
Series:Lecture Notes in Computer Science, 724
Springer eBook Collection.
Subjects:
Software engineering.
Data structures (Computer science).
Computer programming.
Computer logic.
Mathematical logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • The impact of granularity in abstract interpretation of Prolog
  • Optimization techniques for general purpose fixpoint algorithms practical efficiency for the abstract interpretation of Prolog
  • Chaotic fixpoint iteration guided by dynamic dependency
  • Fast abstract interpretation using sequential algorithms
  • Abstract interpretation and verification of reactive systems
  • Semantics and analysis of linda-based languages
  • Compiling FX on the CM-2
  • Combining dependability with architectural adaptability by means of the signal language
  • Challenges in developing useful and practical static analysis for logic programs
  • Occam's razor in metacomputation: the notion of a perfect process tree
  • Tupling functions with multiple recursion parameters
  • Avoiding repeated tests in pattern matching
  • Freeness, sharing, linearity and correctness — All at once
  • Synthesis of directionality information for functional logic programs
  • Abstract rewriting
  • Reflections on program optimization
  • Finiteness conditions for strictness analysis
  • Strictness properties of lazy algebraic datatypes
  • Minimal thunkification
  • An efficient abductive reasoning system based on program analysis
  • A congruence for gamma programs
  • Usage analysis with natural reduction types
  • Polymorphic types and widening operators
  • Demonstration: static analysis of AKL.

Similar Items