Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement

DOI10.1007/978-3-319-41528-4_18zbMath1411.68056OpenAlexW2497515766MaRDI QIDQ4633543

Orna Grumberg, Sharon Shoham, Karam Abd Elkader, Corina S. Păsăreanu

Publication date: 3 May 2019

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41528-4_18

Mathematics Subject Classification ID

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

Related Items (4)

Assume, Guarantee or Repair ⋮ Automated circular assume-guarantee reasoning ⋮ Automated program repair using formal verification techniques ⋮ To compose, or not to compose, that is the question: an analysis of compositional state space generation

This page was built for publication: Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement