Combining Predicate Abstraction with Fixpoint Approximations

DOI10.1007/978-3-319-41591-8_8zbMath1390.68443OpenAlexW2497982621MaRDI QIDQ4571129

Tuba Yavuz

Publication date: 6 July 2018

Published in: Software Engineering and Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41591-8_8

Mathematics Subject Classification ID

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

Related Items (1)

Partial predicate abstraction and counter-example guided refinement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Action language verifier: An infinite-state model checker for reactive software specifications
• Property preserving abstractions for the verification of concurrent systems
• Transition predicate abstraction and fair termination
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification

This page was built for publication: Combining Predicate Abstraction with Fixpoint Approximations