Realizability modulo theories
From MaRDI portal
Publication:6561346
DOI10.1016/j.jlamp.2024.100971MaRDI QIDQ6561346
Andoni Rodríguez, César Sánchez
Publication date: 25 June 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- Causality-based game solving
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Automata, logics, and infinite games. A guide to current research
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Vacuity in synthesis
- A new decision method for elementary algebra
- Synthesis with Identifiers
- Reactive synthesis from signal temporal logic specifications
- On Synthesis of Specifications with Arithmetic
- Alfred Tarski's elimination theory for real closed fields
- A Decision Procedure for the First Order Theory of Real Addition with Order
- LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
- A constraint-based approach to solving games on infinite graphs
- Church’s Problem and a Tour through Automata Theory
- Definability and decision problems in arithmetic
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Bounded synthesis of register transducers
- Temporal stream logic modulo theories
- Temporal stream logic: synthesis beyond the Bools
- Boolean abstractions for realizability modulo theories
This page was built for publication: Realizability modulo theories
