Reasoning on data words over numeric domains
From MaRDI portal
Cites work
- A structure to decide reachability in Petri nets
- An Algorithm for the General Petri Net Reachability Problem
- Arithmetic, first-order logic, and counting quantifiers
- Array Folds Logic
- Automata theory in nominal sets
- Automata vs. Logics on Data Words
- Automated Deduction – CADE-20
- Complexity classes defined by counting quantifiers
- Complexity of Subcases of Presburger Arithmetic
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- First-order logic with two variables and unary temporal logic
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- scientific article; zbMATH DE number 2038747 (Why is no real title available?)
- Linear Arithmetic with Stars
- LTL with the freeze quantifier and register automata
- On Context-Free Languages
- On notions of regularity for data languages
- On synthesis of specifications with arithmetic
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- PP is as Hard as the Polynomial-Time Hierarchy
- Register automata with linear arithmetic
- Semigroups, Presburger formulas, and languages
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- The power of symbolic automata and transducers
- The Reachability Problem for Petri Nets Is Not Elementary
- Theory of computation.
- Two-variable logic on data words
- Two-variable logic with two order relations
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Reasoning on data words over numeric domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649469)
