Boolean abstractions for realizability modulo theories

DOI10.1007/978-3-031-37709-9_15zbMATH Open1547.68451MaRDI QIDQ6535690FDOQ6535690

Authors: Andoni Rodríguez, César Sánchez 

Publication date: 1 February 2024

Recommendations

• Realizability of real-time logics
• Tableaux for realizability of safety specifications
• Boolean Abstraction for Temporal Logic Satisfiability
• An Antichain Algorithm for LTL Realizability
• Verification, Model Checking, and Abstract Interpretation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• An automata-theoretic approach to constraint LTL
• Automata, logics, and infinite games. A guide to current research
• Fast, flexible MUS enumeration
• Temporal verification of reactive systems: response
• Title not available (Why is that?)
• Synthesis of Reactive(1) designs
• Church’s Problem and a Tour through Automata Theory
• Bounded Synthesis
• Verification, Model Checking, and Abstract Interpretation
• Title not available (Why is that?)
• Counting minimal unsatisfiable subsets
• Vacuity in synthesis
• LTL with arithmetic and its applications in reasoning about hierarchical systems
• Temporal stream logic modulo theories
• Temporal stream logic: synthesis beyond the Bools

Cited In (1)

• Realizability modulo theories

This page was built for publication: Boolean abstractions for realizability modulo theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535690)