Eric Badouel · Luca Bernardinello Philippe Darondeau Page 1 Texts in Theoretical Computer
Science An EATCS Series Petri Net Synthesis Eric Badouel · Luca Bernardinello Philippe …

The design and implementation of decision procedures for checking path feasibility in string-
manipulating programs is an important problem, with such applications as symbolic …

We study definability problems and algorithmic issues for infinite structures that are finitely
presented. After a brief overview over different classes of finitely presentable structures, we …

String analysis is the problem of reasoning about how strings are manipulated by a program.
It has numerous applications including automatic detection of cross-site scripting, and …

We study the fundamental issue of decidability of satisfiability over string logics with
concatenations and finite-state transducers as atomic operations. Although restricting to one …

We address the satisfiability problem for string constraints that combine relational constraints
represented by transducers, word equations, and string length constraints. This problem is …

Infinite automata are of interest not only in the verification of systems with infinite state
spaces, but also as a natural (and so far underdeveloped) framework for the study of formal …

The theory of abstract argumentation frameworks (af s) has, in the main, focused on finite
structures, though there are many significant contexts where argumentation can be regarded …

Model checking is a fully-automatic formal verification method that has been extremely
successful in validating and verifying safety-critical systems in the past three decades. In the …

By algorithmic metatheorems for a model checking problem P over infinite-state systems we
mean generic results that can be used to infer decidability (possibly complexity) of P not only …