Results 1  10
of
261
EquivalenceChecking with OneCounter Automata: A Generic Method for Proving Lower Bounds
"... We present a general method for proving DPhardness of equivalencechecking problems on onecounter automata. For this we show a reduction of the SATUNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, a ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We present a general method for proving DPhardness of equivalencechecking problems on onecounter automata. For this we show a reduction of the SATUNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable
DP Lower Bounds for EquivalenceChecking and ModelChecking of OneCounter Automata
, 2008
"... We present a general method for proving DPhardness of problems related to formal verification of onecounter automata. For this we show a reduction of the SATUNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free v ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We present a general method for proving DPhardness of problems related to formal verification of onecounter automata. For this we show a reduction of the SATUNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free
Lower Bounds for Discrete Logarithms and Related Problems
, 1997
"... . This paper considers the computational complexity of the discrete logarithm and related problems in the context of "generic algorithms"that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is ..."
Abstract

Cited by 288 (11 self)
 Add to MetaCart
is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the known upper bounds: any generic algorithm must perform\Omega (p 1=2 ) group operations, where p is the largest prime dividing the order of the group. Also, a new method for correcting a faulty
Bisimilarity of onecounter processes is PSPACEcomplete
"... A onecounter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic onecounter automata (with no εsteps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
A onecounter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic onecounter automata (with no εsteps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
, 2006
"... We investigate the possibility of (bi)simulationlike preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly onecounter automata. We describe generic methods for proving complexity upper and lower bounds ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We investigate the possibility of (bi)simulationlike preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly onecounter automata. We describe generic methods for proving complexity upper and lower bounds
Typability and Type Checking in System F Are Equivalent and Undecidable
 ANNALS OF PURE AND APPLIED LOGIC
, 1998
"... Girard and Reynolds independently invented System F (a.k.a. the secondorder polymorphically typed lambda calculus) to handle problems in logic and computer programming language design, respectively. Viewing F in the Curry style, which associates types with untyped lambda terms, raises the questions ..."
Abstract

Cited by 70 (5 self)
 Add to MetaCart
and related systems and complexity lowerbounds have been determined for typability in F, but this report is the first to resolve whether these problems are decidable for System F. This report proves that type checking in F is undecidable, by a reduction from semiunification, and that typability in F
Lower Bounds for Factoring IntegralGenerically, with Room for Improvement
, 2010
"... An integralgeneric factoring algorithm is, loosely speaking, a constant sequence of ring operations that computes an integer whose greatest common divisor with a given integral random variable n, such as an RSA public key, is nontrivial. Formal definitions for generic factoring will be stated. Int ..."
Abstract
 Add to MetaCart
. Integralgeneric factoring algorithms seem to include versions of trial division and Lenstra’s elliptic curve method. Abstract lower bounds on the number of such ring operations will be given. Concrete lower bounds on the abstract bounds are also given, but prove to be too weak for any cryptologic
Flat Counter Automata Almost Everywhere
 In ATVA ’05
"... Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a generic semialgorithmic technique implemented in successful tools like FAST, LASH or TREX. From a theoretical view point, we prove that many known semilinear subclasses of counter automata are flat
Bounds on the Automata Size for Presburger Arithmetic
, 2005
"... Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by this approach. In this paper, we prove an upper bound on the the number of states of the minimal deterministic automaton for a Pre ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by this approach. In this paper, we prove an upper bound on the the number of states of the minimal deterministic automaton for a
3Party Message Complexity is Better than 2Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata
, 2002
"... Despite the facts that automata theory is one of the oldest and most extensively investigated areas of theoretical computer science, and finite automaton is the simplest model of computation, there are still principal open problems about nite automata. One of them is to estimate, for a regular l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
language L; the size of the minimal nondeterministic finite automaton accepting L: Currently, we do not have any method that would at least assure an approximation of this value. The best known technique for proving lower bound on the size of the minimal nondeterministic finite automata is based
Results 1  10
of
261