scientific article; zbMATH DE number 7559472
From MaRDI portal
Publication:5089281
DOI10.4230/LIPICS.CONCUR.2020.16MaRDI QIDQ5089281FDOQ5089281
Authors: Mohamed Faouzi Atig, Vrunda Dave, Shankara Narayanan Krishna, Parosh A. Abdulla 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.09489
Title of this publication is not available (Why is that?)
Cites Work
- An efficient algorithm for solving word equations
- Interpolation and SAT-based model checking.
- Tools and Algorithms for the Construction and Analysis of Systems
- Lazy Abstraction with Interpolants
- Title not available (Why is that?)
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Ordering by Divisibility in Abstract Algebras
- A note on the reduction of two-way automata to one-way automata
- Chain-free string constraints
- An efficient SMT solver for string constraints
- Title not available (Why is that?)
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Progressive reasoning over recursively-defined strings
- Separating regular languages by piecewise testable and unambiguous languages
- String Analysis via Automata Manipulation with Logic Circuit Representation
- A characterization for decidable separability by piecewise testable languages
- Regular separability of Parikh automata
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Priced timed Petri nets
- Minimizing resources of sweeping and streaming string transducers
- Regular separability of one counter automata
Cited In (5)
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)
