In computer science, a counter automaton is a pushdown automaton with only two symbols, and the initial symbol in , the finite set of stack symbolsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Zhou Hang, Radu Iosif, Marius Bozga Verimag, Grenoble
- 2011

Verification of algorithms, programs and informatic systems has been proposed by Turing in 1940s. It has been extensively studiedâ€¦Â (More)

Is this relevant?

2010

2010

- Marius Bozga, Radu Iosif, Filip KonecnÃ½, TomÃ¡s Vojnar
- WING@ETAPS/IJCAR
- 2010

FLATA is a toolset for the manipulation and the analysis of non-deterministic integer programs (also known as counter automataâ€¦Â (More)

Is this relevant?

2009

2009

- Mikolaj Bojanczyk
- Theory of Computing Systems
- 2009

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of Ï‰-regularâ€¦Â (More)

Is this relevant?

2008

2008

- Peter Habermehl, Radu Iosif, TomÃ¡s Vojnar
- LPAR
- 2008

We present a logic interpreted over integer arrays, which allows difference bound comparisons between array elements situatedâ€¦Â (More)

Is this relevant?

2006

2006

- Vince BÃ¡rÃ¡ny, Christof LÃ¶ding, Olivier Serre
- STACS
- 2006

Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to aâ€¦Â (More)

Is this relevant?

2005

2005

- JÃ©rÃ´me Leroux, GrÃ©goire Sutre
- Software Verification: Infinite-State Modelâ€¦
- 2005

This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton isâ€¦Â (More)

Is this relevant?

2005

2005

- Oded Lachish, Ilan Newman
- Electronic Colloquium on Computational Complexity
- 2005

Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input fâ€¦Â (More)

Is this relevant?

2004

2004

- Gillian Z. Elston, Gretchen Ostheimer
- Theor. Comput. Sci.
- 2004

We prove that a group G has a word problem that is accepted by a deterministic counter automaton with a weak inverse property ifâ€¦Â (More)

Is this relevant?

1999

1999

- Hubert Comon, Yan Jurski Lsv
- 1999

We consider nite automata equipped with nitely many registers (or counters). Each transition can be red only if the associatedâ€¦Â (More)

Is this relevant?

1978