Decision procedures for path feasibility of string-manipulating programs with complex operations
The design and implementation of decision procedures for checking path feasibility in string-
manipulating programs is an important problem, with such applications as symbolic …
manipulating programs is an important problem, with such applications as symbolic …
String solving with word equations and transducers: towards a logic for analysing mutation XSS
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 …
concatenations and finite-state transducers as atomic operations. Although restricting to one …
The many facets of string transducers
A Muscholl, G Puppis - … Symposium on Theoretical Aspects of Computer …, 2019 - hal.science
Regular word transductions extend the robust notion of regular languages from a qualitative
to a quantitative reasoning. They were already considered in early papers of formal …
to a quantitative reasoning. They were already considered in early papers of formal …
On equivalence and uniformisation problems for finite transducers
Transductions are binary relations of finite words. For rational transductions, ie,
transductions defined by finite transducers, the inclusion, equivalence and sequential …
transductions defined by finite transducers, the inclusion, equivalence and sequential …
Graph logics with rational relations
We investigate some basic questions about the interaction of regular and rational relations
on words. The primary motivation comes from the study of logics for querying graph …
on words. The primary motivation comes from the study of logics for querying graph …
Monadic decomposition
Monadic predicates play a prominent role in many decidable cases, including decision
procedures for symbolic automata. We are here interested in discovering whether a formula …
procedures for symbolic automata. We are here interested in discovering whether a formula …
Graph logics with rational relations and the generalized intersection problem
We investigate some basic questions about the interaction of regular and rational relations
on words. The primary motivation comes from the study of logics for querying graph …
on words. The primary motivation comes from the study of logics for querying graph …
Separating automatic relations
We study the separability problem for automatic relations (ie, relations on finite words
definable by synchronous automata) in terms of recognizable relations (ie, finite unions of …
definable by synchronous automata) in terms of recognizable relations (ie, finite unions of …
[HTML][HTML] Uniform strategies, rational relations and jumping automata
L Bozzelli, B Maubert, S Pinchinat - Information and Computation, 2015 - Elsevier
A general concept of uniform strategies has recently been proposed as a relevant notion in
game theory for computer science, which subsumes various notions from the literature. It …
game theory for computer science, which subsumes various notions from the literature. It …
Monadic decomposition in integer linear arithmetic
Monadic decomposability is a notion of variable independence, which asks whether a given
formula in a first-order theory is expressible as a Boolean combination of monadic …
formula in a first-order theory is expressible as a Boolean combination of monadic …