Difference between revisions of "Book/Principles of Abstract Interpretation"
| Line 21: | Line 21: | ||
==Other important work== | ==Other important work== | ||
The seminal paper on [[Abstract Interpretation]] is here<ref>{{:Paper/Abstract Interpretation}}</ref>. | The seminal paper on [[Abstract Interpretation]] is here<ref>{{:Paper/Abstract Interpretation}}</ref>. | ||
=Table of Contents= | |||
# Introduction | |||
## Abstract Interpretation and Is Main Applications | |||
## Basic Set Theory | |||
## Syntax, Semantics, Properties, and Static Analysis of Expressions | |||
# Syntax | |||
## Syntax | |||
## Parsing | |||
# Trace Semantics | |||
## Structural Deductive Stateless Prefix Trace Semantics | |||
=References= | =References= | ||
<references/> | <references/> | ||
</noinclude> | </noinclude> | ||
Revision as of 04:21, 4 January 2022
Cousot, Patrick (Sep 2021). Principles of Abstract Interpretation. local page: ACM Press.
Summary
Introduction to abstract interpretation, with examples of applications to the semantics, specification, verification, and static analysis of computer programs.
Formal methods are mathematically rigorous techniques for the specification, development, manipulation, and verification of safe, robust, and secure software and hardware systems. Abstract interpretation is a unifying theory of formal methods that proposes a general methodology for proving the correctness of computing systems, based on their semantics. The concepts of abstract interpretation underlie such software tools as compilers, type systems, and security protocol analyzers. This book provides an introduction to the theory and practice of abstract interpretation, offering examples of applications to semantics, specification, verification, and static analysis of programming languages with emphasis on calculational design.
The book covers all necessary computer science and mathematical concepts—including most of the logic, order, linear, fixpoint, and discrete mathematics frequently used in computer science—in separate chapters before they are used in the text. Each chapter offers exercises and selected solutions. Chapter topics include syntax, parsing, trace semantics, properties and their abstraction, fixpoints and their abstractions, reachability semantics, abstract domain and abstract interpreter, specification and verification, effective fixpoint approximation, relational static analysis, and symbolic static analysis. The main applications covered include program semantics, program specification and verification, program dynamic and static analysis of numerical properties and of such symbolic properties as dataflow analysis, software model checking, pointer analysis, dependency, and typing (both for forward and backward analysis), and their combinations. Principles of Abstract Interpretation is suitable for classroom use at the graduate level and as a reference for researchers and practitioners.
Other important work
The seminal paper on Abstract Interpretation is here[1].
Table of Contents
- Introduction
- Abstract Interpretation and Is Main Applications
- Basic Set Theory
- Syntax, Semantics, Properties, and Static Analysis of Expressions
- Syntax
- Syntax
- Parsing
- Trace Semantics
- Structural Deductive Stateless Prefix Trace Semantics
References
- ↑ Cousot, Patrick; Cousot, Radhia (1977). Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints (PDF). 4th POPL. local page: ACM Press. p. 238-252.