Temporal stream logic modulo theories

DOI10.1007/978-3-030-99253-8_17arXiv2104.14988OpenAlexW3157401082MaRDI QIDQ6141780

Noemi Passing, Bernd Finkbeiner, Philippe Heim

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.14988

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• An automata-theoretic approach to constraint LTL
• Model checking software. 14th international SPIN workshop, Berlin, Germany, July 1-3, 2007. Proceedings
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Finite-memory automata
• Reasoning about infinite computations
• The power of symbolic automata and transducers
• Decidable synthesis of programs with uninterpreted functions
• LTL over integer periodicity constraints
• LTL with the freeze quantifier and register automata
• Linear-time temporal logics with Presburger constraints: an overview ★
• The complexity of propositional linear temporal logics
• What’s Decidable About Program Verification Modulo Axioms?
• A practical decision method for propositional dynamic logic (Preliminary Report)
• A Decidable Temporal Logic of Repeating Values
• Bounded synthesis of register transducers