Counter machine

A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the…

Papers overview

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

2018

We study timed systems in which some timing features are unknown parameters. First we consider Upper-bound Parametric Timed…

2012

We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes…

2009

The paper addresses what we see as the four major issues in logic. The overriding issue is that of the choice of logic. We start…

2008

We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and…

2004

2004

2003

The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such…

2000

This paper describes a technique of inductive proof based on model checking. It differs from previous techniques that combine…

Highly Cited

1995

Highly Cited

1995

Highly Cited

1993

Highly Cited

1993

We look at some decision questions concerning two-way counter machines and obtain the strongest decidable results to date…