Static Analysis: First International Static Analysis Symposium, Sas '94, Namur, Belgium, September 28 - 30, 1994. Proceedings (First International Static Analysis Symposium, Sas '94, Namur, Belgium, September 28-30, 1994 - Proceedings) - Lecture Notes in  - Baudouin Lecharlier - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540584858 - 1994. gada 14. septembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Static Analysis: First International Static Analysis Symposium, Sas '94, Namur, Belgium, September 28 - 30, 1994. Proceedings (First International Static Analysis Symposium, Sas '94, Namur, Belgium, September 28-30, 1994 - Proceedings) - Lecture Notes in

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 23. nov. - . gada 1. dec.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Baudouin Lecharlier izdevumiem
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

This volume contains papers addressing the static analysis aspects of various programming paradigms. The contributors cover program optimization, strictness-related analysis, type-based analyses and type inference, dependency analyses and abstract domain construction.


Marc Notes: Spine title: Static analysis symposium.; Includes bibliographical references and index. Table of Contents: 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.

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1994. gada 14. septembris
ISBN13 9783540584858
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 471
Izmēri 155 × 233 × 24 mm   ·   1,12 kg
Valoda Vācu  

Vairāk no tā paša izdevēja