scientific article; zbMATH DE number 7559472
From MaRDI portal
Publication:5089281
Cites work
- A characterization for decidable separability by piecewise testable languages
- A note on the reduction of two-way automata to one-way automata
- An efficient algorithm for solving word equations
- An efficient SMT solver for string constraints
- Chain-free string constraints
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1512622 (Why is no real title available?)
- Interpolation and SAT-based model checking.
- Lazy Abstraction with Interpolants
- Minimizing resources of sweeping and streaming string transducers
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Ordering by Divisibility in Abstract Algebras
- Priced timed Petri nets
- Progressive reasoning over recursively-defined strings
- Regular separability of one counter automata
- Regular separability of Parikh automata
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Separating regular languages by piecewise testable and unambiguous languages
- String Analysis via Automata Manipulation with Logic Circuit Representation
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(7)- Distinguishing string selection problems.
- scientific article; zbMATH DE number 1305456 (Why is no real title available?)
- Simple linear string constraints
- Solving Not-Substring Constraint withFlat Abstraction
- On the satisfiability of context-free string constraints with subword-ordering
- Satisfiability of context-free string constraints with subword-ordering and transducers
- Separability and non-determinizability of WSTS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089281)
