Cantitate/Preț
Produs

Static Analysis: Third International Symposium, SAS '96, Aachen, Germany, September 24 - 26, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1145

Editat de Radhia Cousot, David A. Schmidt
en Limba Engleză Paperback – 11 sep 1996
This book constitutes the refereed proceedings of the Third International Static Analysis Symposium, SAS '96, held in Aachen, Germany, in September 1996 in conjunction with ALP and PLILP.
The volume presents 22 highly-quality revised full papers selected from a total of 79 submissions; also included are three system descriptions and invited contributions by Alex Aiken (abstract only), Flemming Nielson, and Bernhard Steffen. Among the topics addressed are program analysis, incremental analysis, abstract interpretation, partial evaluation, logic programming, functional programming, and constraint programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33104 lei

Preț vechi: 41381 lei
-20% Nou

Puncte Express: 497

Preț estimativ în valută:
6335 6581$ 5262£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540617396
ISBN-10: 3540617396
Pagini: 408
Ilustrații: X, 398 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.57 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.