History-Register Automata

@inproceedings{Grigore2013HistoryRegisterA,
  title={History-Register Automata},
  author={Radu Grigore and Nikos Tzevelekos},
  booktitle={Log. Methods Comput. Sci.},
  year={2013}
}
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling and analysing such programs. HRAs extend the expressiveness of previous approaches and bring us to the limits of decidability for reachability checks. The distinctive feature of our machines is their use of unbounded memory sets (histories) where input symbols can… 

Figures from this paper

Weak and Nested Class Memory Automata
TLDR
This work identifies a restriction – which is called weakness – of CMA, and shows that they are equivalent to three existing forms of automata over data languages, and that in the deterministic case they are closed under all Boolean operations, and hence have an ExpSpace-complete equivalence problem.
Nominal Automata with Name Binding
TLDR
An automaton model over nominal sets is introduced, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word.
Well Structured Transition Systems with History
TLDR
A formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations leading to operational semantics with historical data is proposed.
Using class memory automata in algorithmic game semantics
TLDR
This thesis aims to continue the classification of the fragments of the higher-order call-by-value language RML for which observational equivalence is decidable, and develops new variants of class memory automata that allow us to express and compare languages representing game semantic strategies.
Tree Buffers
TLDR
This paper introduces a data structure, called tree buffer, that solves the problem in the context of automata-based monitors if the monitor itself respects hard real-time constraints, then enriching it by tree buffers makes it possible to provide error traces, which are essential for diagnosing defects.
Nominal Techniques and Black Box Testing for Automata Learning
Using an adaptation of state-of-the-art algorithms for black-box automata learning, as implemented in the LearnLib tool, we succeeded to learn a model of the Engine Status Manager (ESM), a software
The Parametric Complexity of Lossy Counter Machines
TLDR
This work proves F_d-completeness for machines with d counters, which provides the first known uncontrived problems complete for the fast-growing complexity classes at levels 3 < d < omega.
Complexity Hierarchies beyond Elementary
TLDR
A hierarchy of fast-growing complexity classes is introduced and its suitability for completeness statements of many nonelementary problems is shown, with complexities ranging from simple towers of exponentials to Ackermannian and beyond.
Fast Computations on Ordered Nominal Sets
TLDR
This work shows how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon at the level of orbits.
Ideal-based algorithms for VASSes and well-structured systems
TLDR
An attempt is made to evaluate the methodology, aims, and approaches used in the planning and implementation of this project, as well as some of the aspects of its development.

References

SHOWING 1-10 OF 53 REFERENCES
Weak and Nested Class Memory Automata
TLDR
This work identifies a restriction – which is called weakness – of CMA, and shows that they are equivalent to three existing forms of automata over data languages, and that in the deterministic case they are closed under all Boolean operations, and hence have an ExpSpace-complete equivalence problem.
Fresh-register automata
TLDR
Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names with previously stored ones is introduced.
Runtime Verification Based on Register Automata
TLDR
It is shown that TOPL automata are equally expressive to register automata and yet suitable to express properties of programs, and in particular that properties which require value updates are not expressible with current techniques yet are naturally captured by TOPL machines.
An Introduction to History Dependent Automata
LTL with the Freeze Quantifier and Register Automata
  • S. Demri, R. Lazic
  • Computer Science
    21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
  • 2006
TLDR
It is proved that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register.
Finite state machines for strings over infinite alphabets
TLDR
This work investigates the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems of Kaminski and Francez on register automata.
Nets with Tokens which Carry Data
TLDR
The main result of the paper is that, even for unordered data domains, each of the three verification problems for data nets without whole-place operations has non-elementary complexity.
Ordered Navigation on Multi-attributed Data Words
TLDR
ND-LTL is introduced, an extension of BD- LTL by a restricted form of tuple-navigation that yields two 2ExpSpace-complete fragments while satisfiability for the full logic is known to be as hard as reachability in Petri nets.
Efficient Coverability Analysis by Proof Minimization
TLDR
This paper considers multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure and presents a novel, sound and complete yet empirically much improved solution to the coverability problem for well-structured transition systems (WSTS).
...
...