Boolean abstractions for realizability modulo theories
From MaRDI portal
Publication:6535690
DOI10.1007/978-3-031-37709-9_15zbMATH Open1547.68451MaRDI QIDQ6535690
Andoni Rodríguez, César Sánchez
Publication date: 1 February 2024
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast, flexible MUS enumeration
- Synthesis of Reactive(1) designs
- Counting minimal unsatisfiable subsets
- An automata-theoretic approach to constraint LTL
- Automata, logics, and infinite games. A guide to current research
- Vacuity in synthesis
- Bounded Synthesis
- Temporal Verification of Reactive Systems: Response
- LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
- Church’s Problem and a Tour through Automata Theory
- Verification, Model Checking, and Abstract Interpretation
- Temporal stream logic modulo theories
- Temporal stream logic: synthesis beyond the Bools
Related Items (1)
This page was built for publication: Boolean abstractions for realizability modulo theories
