Static Analysis
Springer Berlin (Verlag)
978-3-540-60360-3 (ISBN)
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.
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.
| Erscheint lt. Verlag | 13.9.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | IX, 431 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 216 x 279 mm |
| Gewicht | 578 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Informatik ► Theorie / Studium ► Compilerbau | |
| Schlagworte | Hardcover, Softcover / Informatik, EDV/Informatik • High-Level Programming • High-Performance Computing • Hochleistungsrechnen • höherstufiges Programmieren • Performance • Programmierung • programming • Programming language • Rechnerarchitektur • Static Analysis • Statische Analyse • Statistik Analyse System (SAS) • System • Systemimplementierung • Systems Implementation • Systems Verfication • Systemverifikation |
| ISBN-10 | 3-540-60360-3 / 3540603603 |
| ISBN-13 | 978-3-540-60360-3 / 9783540603603 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
