A succinct canonical register automaton model

Authors:
Sofia Cassel;Falk Howar;Bengt Jonsson;Maik Merten;Bernhard Steffen
Affiliations:
Dept. of Information Technology, Uppsala University, Sweden;Programming Systems, University of Dortmund, Germany;Dept. of Information Technology, Uppsala University, Sweden;Programming Systems, University of Dortmund, Germany;Programming Systems, University of Dortmund, Germany
Venue:
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Year:
2011

Citing 19
Cited 6

Three partition refinement algorithms

SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
A theory of timed automata

Theoretical Computer Science
Finite-memory automata

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A logical characterization of data languages

Information Processing Letters
Navigating with a Browser

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Unifying Approach to Data-Independence

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
An algebraic approach to data languages and timed languages

Information and Computation
XML with data values: typechecking revisited

Journal of Computer and System Sciences - Special issu on PODS 2001
An algebraic characterization of deterministic regular languages over infinite alphabets

Theoretical Computer Science
Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering
CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

ICECCS '09 Proceedings of the 2009 14th IEEE International Conference on Engineering of Complex Computer Systems
On notions of regularity for data languages

Theoretical Computer Science
Regular inference for state machines using domains with equality tests

FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Two-variable logic on data words

ACM Transactions on Computational Logic (TOCL)
Automata and logics for words and trees over an infinite alphabet

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Variable automata over infinite alphabets

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Inferring canonical register automata

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Demonstrating learning of register automata

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A succinct canonical register automaton model for data domains with binary relations

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Automated inference of models for black box systems based on interface descriptions

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Inferring semantic interfaces of data structures

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
LearnLib tutorial: from finite automata to register interface programs

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel canonical automaton model, based on register automata, that can easily be used to specify protocol or program behavior. More concretely, register automata are reminiscent of control flow graphs: they comprise a finite control structure, assignments, and conditionals, allowing to assign values of an infinite domain to registers (variables) and to compare them for equality. A major contribution is the definition of a canonical automaton representation of any language recognizable by a deterministic register automaton, by means of a Nerode congruence. Not only is this canonical form easier to comprehend than previous proposals, but it can also be exponentially more succinct than these. Key to the canonical form is the symbolic treatment of data languages, which overcomes the structural restrictions in previous formalisms, and opens the way to new practical applications.