Abstraction and learning for infinite-state compositional verification

MaRDI QIDQ4994694zbMATH OpenFDO

Authors Dimitra Giannakopoulou, Corina S. Păsăreanu

Publication date 21 June 2021

Full work available at URL https://arxiv.org/abs/1309.5140, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DSS2013.13

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1956591
• Automatic symbolic compositional verification by learning assumptions
• Computer Aided Verification
• Refining Interface Alphabets for Compositional Verification
• Learning-based compositional verification for synchronous probabilistic systems

Cited in

(3)

• Generating models of infinite-state communication protocols using regular inference with abstraction
• A learning-based approach to synthesizing invariants for incomplete verification engines
• A theory of history dependent abstractions for learning interface automata

This page was built for publication: Abstraction and learning for infinite-state compositional verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994694)