Refining Interface Alphabets for Compositional Verification
Abstract elided by the publisher.
Related papers
- Unifying Compositional Verification and Certified Compilation with a Three-Dimensional Refinement Algebra POPL 2025
- Automata Learning with Automated Alphabet Abstraction Refinement VMCAI 2011
- Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement CAV 2016
- Foundational and Compositional Verification of Layered Concurrent Objects ECOOP 2026
- A Theory of Synchronous Relational Interfaces TOPLAS 2011
- Using Interface Refinement to Integrate Formal Verification into the Design Cycle CAV 2004
- Fully Composable and Adequate Verified Compilation with Direct Refinements between Open Modules POPL 2024
- Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification SAS 2007