240 research outputs found
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the
use of higher-order stacks, that is, a nested "stack of stacks" structure.
These systems may be used to model higher-order programs and are closely
related to the Caucal hierarchy of infinite graphs and safe higher-order
recursion schemes.
We consider the backwards-reachability problem over higher-order Alternating
PDSs (APDSs), a generalisation of higher-order PDSs. This builds on and extends
previous work on pushdown systems and context-free higher-order processes in a
non-trivial manner. In particular, we show that the set of configurations from
which a regular set of higher-order APDS configurations is reachable is regular
and computable in n-EXPTIME. In fact, the problem is n-EXPTIME-complete.
We show that this work has several applications in the verification of
higher-order PDSs, such as linear-time model-checking, alternation-free
mu-calculus model-checking and the computation of winning regions of
reachability games
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
Reversible Computation: Extending Horizons of Computing
This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
Reversible Computation: Extending Horizons of Computing
This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first
Continuity of Functional Transducers: A Profinite Study of Rational Functions
A word-to-word function is continuous for a class of languages~
if its inverse maps _languages to~. This notion
provides a basis for an algebraic study of transducers, and was integral to the
characterization of the sequential transducers computable in some circuit
complexity classes.
Here, we report on the decidability of continuity for functional transducers
and some standard classes of regular languages. To this end, we develop a
robust theory rooted in the standard profinite analysis of regular languages.
Since previous algebraic studies of transducers have focused on the sole
structure of the underlying input automaton, we also compare the two algebraic
approaches. We focus on two questions: When are the automaton structure and the
continuity properties related, and when does continuity propagate to
superclasses
Boundedness in languages of infinite words
We define a new class of languages of -words, strictly extending
-regular languages.
One way to present this new class is by a type of regular expressions. The
new expressions are an extension of -regular expressions where two new
variants of the Kleene star are added: and . These new
exponents are used to say that parts of the input word have bounded size, and
that parts of the input can have arbitrarily large sizes, respectively. For
instance, the expression represents the language of infinite
words over the letters where there is a common bound on the number of
consecutive letters . The expression represents a similar
language, but this time the distance between consecutive 's is required to
tend toward the infinite.
We develop a theory for these languages, with a focus on decidability and
closure. We define an equivalent automaton model, extending B\"uchi automata.
The main technical result is a complementation lemma that works for languages
where only one type of exponent---either or ---is used.
We use the closure and decidability results to obtain partial decidability
results for the logic MSOLB, a logic obtained by extending monadic second-order
logic with new quantifiers that speak about the size of sets
- …