P
Petr Janků
Researcher at Brno University of Technology
Publications - 6
Citations - 115
Petr Janků is an academic researcher from Brno University of Technology. The author has contributed to research in topics: String (computer science) & Automaton. The author has an hindex of 5, co-authored 6 publications receiving 85 citations.
Papers
More filters
Journal ArticleDOI
String constraints with concatenation and transducers solved efficiently
TL;DR: This paper provides the first string solver that can reason about constraints involving both concatenation and finite-state transductions, and has a completeness and termination guarantee for several important fragments.
Book ChapterDOI
Chain-Free String Constraints
TL;DR: A new decidable fragment of string constraints is proposed, called weakly chaining string constraints, for which the satisfiability problem is decidable and pushed the borders of decidability ofstring constraints by generalising the existing straight-line as well as the acyclic fragment of the string logic.
Proceedings ArticleDOI
Efficient handling of string-number conversion
Parosh Aziz Abdulla,Mohamed Faouzi Atig,Yu-Fang Chen,Bui Phi Diep,Julian Dolby,Petr Janků,Hsin-Hung Lin,Lukáš Holík,Wei-Cheng Wu +8 more
TL;DR: This paper proposes an approach that can efficiently support both string-number conversion and other common types of string constraints and shows that it significantly outperforms other state-of-the-art tools on benchmarks that involves string- number conversion.
Book ChapterDOI
Lazy Automata Techniques for WS1S
TL;DR: A new decision procedure for the logic WS1S is presented, which first builds an automaton accepting all models of a formula and then tests whether its language is empty, and which can in many cases significantly outperform the classical decision procedure.
Posted Content
Lazy Automata Techniques for WS1S
TL;DR: In this paper, a new decision procedure for the logic WS1S is presented, where the main novelty is to test the emptiness on the fly, while constructing a symbolic, term-based representation of the automaton, and pruning the constructed state space from parts irrelevant to the test.