Verification: Theory and Practice

DOI10.1007/b12001zbMath1274.68180OpenAlexW2483649756MaRDI QIDQ5305644

Patrick Cousot

Publication date: 23 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

The octagon abstract domain, Program verification: state of the art, problems, and results. I, Computable fixpoints in well-structured symbolic model checking, A Scalable Segmented Decision Tree Abstract Domain, Pentagons: a weakly relational abstract domain for the efficient validation of array accesses