FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. We extend the concept of a synchronizing word from finitestate automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it res...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
We investigate the complexity of deciding contextual approximation (refinement) in finitary Idealized Algol, a prototypical language combining higherorder types with state. Earli...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring (whose elements can be understood as logic pr...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
We reformulate the bar recursion and induction principles in terms of recursive and wellfounded coalgebras. Bar induction was originally proposed by Brouwer as an axiom to recover ...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
Recently, a number of reversible functional programming languages have been proposed. Common to several of these is the assumption of totality, a property that is not necessarily d...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. We first develop a (semantical) characterization of call-byneed normalization by means of typability, i.e. we show that a term is normalizing in call-by-need if and only...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
We consider infinite-state Markov decision processes (MDPs) that are induced by extensions of vector addition systems with states (VASS). Verification conditions for these MDPs a...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
We introduce a class of transformations of finite data words generalizing the well-known class of regular finite string transformations described by MSO-definable transductions ...
FOSSACS
2016
Springer
8 years 8 months ago
2016
Springer
Focusing is a general technique for transforming a sequent proof system into one with a syntactic separation of non-deterministic choices without sacrificing completeness. This no...