Proceedings of the 6th international workshop on numerical and symbolic abstract domains, NSAD 2016, Edinburgh, UK, September 11, 2016.

*(English)*Zbl 1375.68021
Electronic Notes in Theoretical Computer Science 331. Amsterdam: Elsevier. 99 p., electronic only (2017).

**
Show indexed articles as search result.
**

Abstract domains are a key notion in Abstract Interpretation theory and practice. They embed the semantic choices, data structures and algorithmic aspects, and implementation decisions. The Abstract Interpretation framework provides constructive and systematic formal methods to design, compose, compare, study, prove, and apply abstract domains. Many abstract domains have been designed so far: numerical domains (intervals, congruences, polyhedra, polynomials, etc.), symbolic domains (shape domains, trees, etc.), but also domain operators (products, powersets, completions, etc.), which have been applied to several kinds of static analyses (safety, termination, probability, etc.).

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1310.68020].

Indexed articles:

MinĂ©, Antoine, Static analysis of embedded real-time concurrent software with dynamic priorities, 3-39 [Zbl 1412.68042]

Arceri, Vincenzo; Maffeis, Sergio, Abstract domains for type juggling, 41-55 [Zbl 1412.68033]

Jourdan, Jacques-Henri, Sparsity preserving algorithms for octagons, 57-70 [Zbl 1412.68040]

Dalla Preda, Mila; Pasqua, Michele, Software watermarking: a semantics-based approach, 71-85 [Zbl 1412.68036]

Dalla Preda, Mila; Vidali, Vanessa, Abstract similarity analysis, 87-99 [Zbl 1412.68037]