Cantitate/Preț
Produs
Total produse
Vezi coșul
Static Analysis de Alan Mycroft

Static Analysis

Editat de Alan Mycroft
en Limba Engleză Paperback – 13 sep 1995
This book constitutes the refereed proceedings of the Second International Symposium on Static Analysis, SAS '95, held in Glasgow, UK, in September 1995. Static Analysis is increasingly recognized as a foundation for high-performance implementations and verification systems of high-level programming languages.
22 full revised papers selected from a total of 55 submissions are presented; they address static analysis issues for different programming paradigms; in particular concurrent, constraint, functional, imperative, logic, and object-oriented programming are addressed. In addition there are abstracts or full papers for three invited presentations and two system descriptions.
Citește tot Restrânge

Preț: 32935 lei

Preț vechi: 41169 lei
-20%

Puncte Express: 494

Carte tipărită la comandă

Livrare economică 25 iulie-08 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540603603
ISBN-10: 3540603603
Pagini: 440
Ilustrații: IX, 431 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Natural-semantics-based abstract interpretation (preliminary version).- Region inference for higher-order functional languages.- An automata-theoretic approach to Presburger arithmetic constraints.- Generation of efficient interprocedural analyzers with PAG.- Optimality in abstractions of model checking.- Determining storage properties of sequential and concurrent programs with assignment and structured data.- Partitioning non-strict functional languages for multi-threaded code generation.- Complementation in abstract interpretation.- Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time.- Optimizing lazy functional programs using flow inference.- Termination analysis for functional programs using term orderings.- A type-based analysis for stack allocation in functional languages.- Control-flow analysis and type systems.- Effective flow analysis for avoiding run-time checks.- Static analysis of communication for asynchronous concurrent programming languages.- Unification-free execution of well-moded and well-typed Prolog programs.- Efficient closure utilisation by higher-order inheritance analysis.- System F and abstract interpretation.- Call-by-name CPS-translation as a binding-time improvement.- Trust in the ?-calculus.- LSign reordered.- Strictness analysis by abstract reduction using a tableau calculus.- Bigloo: a portable and optimizing compiler for strict functional languages.- Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell.- Binding-time analysis and strictness analysis by abstract interpretation.- GENA — A tool for generating Prolog analyzers from specifications.- IGOR: A tool for developing Prolog dataflow analyzers.