Static Analysis
Edition: 1 edition
Publisher: Springer
Published: August 9, 2001
Language: eng
Format: Paperback
Number of pages: 450
ISBN-13: 9783540423140
Subjects: Compilers & interpreters; Programming languages; Programming languages (Electro; Congresses; Computers; Computers - General Information; Computers - Languages / Programming; Programming Languages - General; Computer Books: General; Programming - General; General; Artificial Intelligence - General; Logic Design; Computers / Logic Design; Formal Methods; Formal Verification; Model Checking; Program Analysis; Programming Languages Implementation; Programming Logic; Programming languages (Electronic computers); Computer Programming
First sentence: Multithreading is a widely used structuring technique for modern software.
Description: Static Analysis: 8th International Symposium, SAS 2001 Paris, France, July 16–18, 2001 Proceedings<br />Author: Patrick Cousot<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42314-0<br /> DOI: 10.1007/3-540-47764-0<br /><br />Table of Contents:<p></p><ul><li>Analysis of Multithreaded Programs
</li><li>Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs
</li><li>Using Slicing to Identify Duplication in Source Code
</li><li>Soft Scheduling for Hardware
</li><li>Effective Strictness Analysis with HORN Constraints
</li><li>Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
</li><li>An Abstract Analysis of the Probabilistic Termination of Programs
</li><li>Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses
</li><li>Parameterizing a Groundness Analysis of Logic Programs
</li><li>Finite-Tree Analysis for Constraint Logic-Based Languages
</li><li>Applications of Extended Static Checking
</li><li>Cleanness Checking of String Manipulations in C Programs via Integer Analysis
</li><li>Solving Regular Tree Grammar Based Constraints
</li><li>Static Analyses of the Precision of Floating-Point Operations
</li><li>Estimating the Impact of Scalable Pointer Analysis on Optimization
</li><li>Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses
</li><li>Parametric Optimization of Open Real-Time Systems
</li><li>Embedding Chaos
</li><li>Analyzing Fair Parametric Extended Automata
</li><li>Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking</li></ul>