Cantitate/Preț
Produs

Static Analysis: First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28 - 30, 1994. Proceedings: Lecture Notes in Computer Science, cartea 864

Editat de Baudouin LeCharlier
en Limba Engleză Paperback – 14 sep 1994
This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994.
The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35075 lei

Preț vechi: 43844 lei
-20% Nou

Puncte Express: 526

Preț estimativ în valută:
6713 6973$ 5576£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540584858
ISBN-10: 3540584854
Pagini: 484
Ilustrații: XIII, 471 p.
Dimensiuni: 155 x 233 x 25 mm
Greutate: 1.12 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

The costs and benefits of abstract interpretation-driven Prolog optimization.- Mode analysis of functional logic programs.- Directional type checking of logic programs.- A systematic construction of abstract domains.- Constraint-based type inference and parametric polymorphism.- Efficient on-the-fly analysis of program behavior and static cache simulation.- From processor timing specifications to static instruction scheduling.- Stackability in the simply-typed call-by-value lambda calculus.- Generalized boxings, congruences and partial inlining.- Selective thunkification.- About synchronous programming and abstract interpretation.- Uniqueness and completeness analysis of array comprehensions.- Extent analysis of data fields.- Verification of linear hybrid systems by means of convex approximations.- Compile-time detection of uncaught exceptions in Standard ML programs.- Estimating the computational cost of logic programs.- Boolean functions for dependency analysis: Algebraic properties and efficient representation.- Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop.- Extracting Non-strict independent and-parallelism using sharing and freeness information.- Efficient fixpoint computation.- Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration.- Efficient strictness analysis of Haskell.- Abstract interpretation using TDGs.- A type-based framework for program analysis.- Iterative fixed point computation for type-based strictness analysis.- Strictness and totality analysis.- Fast strictness analysis via symbolic fixpoint iteration.- Generating transformers for deforestation and supercompilation.- Mechanical elimination of commutative redundancy.