-
1
-
-
4544326700
-
Efficient symbolic representations for arithmetic constraints in verification
-
C. Bartzis and T. Bultan. Efficient symbolic representations for arithmetic constraints in verification. Int. J. Found. Comput. Sci., 14(4):605-624, 2003.
-
(2003)
Int. J. Found. Comput. Sci.
, vol.14
, Issue.4
, pp. 605-624
-
-
Bartzis, C.1
Bultan, T.2
-
2
-
-
0002440902
-
The complexity of logical theories
-
L. Berman. The complexity of logical theories. Theor. Comput. Sci., 11:71-77, 1980.
-
(1980)
Theor. Comput. Sci.
, vol.11
, pp. 71-77
-
-
Berman, L.1
-
3
-
-
0033700293
-
Automatic structures
-
A. Blumensath and E. Grädel. Automatic structures. In LICS'00, pp. 51-62, 2000.
-
(2000)
LICS'00
, pp. 51-62
-
-
Blumensath, A.1
Grädel, E.2
-
4
-
-
84867770613
-
On the use of weak automata for deciding linear arithmetic with integer and real veriables
-
LNCS 2083
-
B. Boigelot, S. Jodogne, and P. Wolper. On the use of weak automata for deciding linear arithmetic with integer and real veriables. In IJCAR'01, LNCS 2083, pp. 611-625, 2001.
-
(2001)
IJCAR'01
, pp. 611-625
-
-
Boigelot, B.1
Jodogne, S.2
Wolper, P.3
-
5
-
-
84878538273
-
On the expressiveness of real and integer arithmetic automata
-
LNCS 1443
-
B. Boigelot, S. Rassart, and P. Wolper. On the expressiveness of real and integer arithmetic automata (extended abstract). In ICALP'98, LNCS 1443, pp. 152-163, 1998.
-
(1998)
ICALP'98
, pp. 152-163
-
-
Boigelot, B.1
Rassart, S.2
Wolper, P.3
-
6
-
-
84947916935
-
Diophantine equations, Presburger arithmetic and finite automata
-
LNCS 1059
-
A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In CAAP'96, LNCS 1059, pp. 30-43, 1996.
-
(1996)
CAAP'96
, pp. 30-43
-
-
Boudet, A.1
Comon, H.2
-
7
-
-
0026107125
-
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
-
R. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Comp., 40:205-213, 1991.
-
(1991)
IEEE Trans. on Comp.
, vol.40
, pp. 205-213
-
-
Bryant, R.1
-
8
-
-
70350098746
-
Weak second-order arithmetic and finite automata
-
J. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66-92, 1960.
-
(1960)
Z. Math. Logik Grundlagen Math.
, vol.6
, pp. 66-92
-
-
Büchi, J.1
-
9
-
-
0003083237
-
Theorem proving in arithmetic without multiplication
-
D. Cooper. Theorem proving in arithmetic without multiplication. Machine Intelligence, 7:91-99, 1972.
-
(1972)
Machine Intelligence
, vol.7
, pp. 91-99
-
-
Cooper, D.1
-
10
-
-
45149139506
-
Proof of a conjecture by Erdös and Graham concerning the problem of Frobenius
-
J. Dixmier. Proof of a conjecture by Erdös and Graham concerning the problem of Frobenius. J. Number Theory, 34(2): 198-209, 1990.
-
(1990)
J. Number Theory
, vol.34
, Issue.2
, pp. 198-209
-
-
Dixmier, J.1
-
13
-
-
0002389262
-
Representations of numbers and finite automata
-
C. Frougny. Representations of numbers and finite automata. Math. Syst. Theory, 25(1):37-60, 1992.
-
(1992)
Math. Syst. Theory
, vol.25
, Issue.1
, pp. 37-60
-
-
Frougny, C.1
-
14
-
-
23044532366
-
Deciding Presburger arithmetic by model checking and comparisons with other methods
-
LNCS 2517
-
V. Ganesh, S. Berezin, and D. Dill. Deciding Presburger arithmetic by model checking and comparisons with other methods. In FMCAD'02, LNCS 2517, pp. 171-186, 2002.
-
(2002)
FMCAD'02
, pp. 171-186
-
-
Ganesh, V.1
Berezin, S.2
Dill, D.3
-
15
-
-
0023984103
-
Subclasses of Presburger arithmetic and the polynomial-time hierarchy
-
E. Grädel. Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theor. Comput. Sci., 56:289-301, 1988.
-
(1988)
Theor. Comput. Sci.
, vol.56
, pp. 289-301
-
-
Grädel, E.1
-
16
-
-
0032363097
-
Greedy numeration systems and regularity
-
M. Hollander. Greedy numeration systems and regularity. Theory Comput. Syst., 31(2):111-133, 1998.
-
(1998)
Theory Comput. Syst.
, vol.31
, Issue.2
, pp. 111-133
-
-
Hollander, M.1
-
17
-
-
84957650553
-
Automatic presentations of structures
-
LNCS 960
-
B. Khoussainov and A. Nerode. Automatic presentations of structures. ln LCC'94, LNCS 960, pp. 367-392, 1995.
-
(1995)
LCC'94
, pp. 367-392
-
-
Khoussainov, B.1
Nerode, A.2
-
18
-
-
0000555791
-
22pn upper bound on the complexity of Presburger arithmetic
-
22pn upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci., 16:323-332, 1978.
-
(1978)
J. Comput. Syst. Sci.
, vol.16
, pp. 323-332
-
-
Oppen, D.1
-
19
-
-
0001906394
-
Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt
-
M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Sprawozdanie z 1 Kongresu metematyków slowiańskich, Warszawa 1929, pp. 92-101, 395, 1930.
-
(1930)
Sprawozdanie z 1 Kongresu Metematyków Slowiańskich, Warszawa 1929
, pp. 92-101
-
-
Presburger, M.1
-
20
-
-
0018057588
-
Presburger arithmetic with bounded quantifier alternation
-
C. Reddy and D. Loveland. Presburger arithmetic with bounded quantifier alternation. In STOC'78, pp. 320-325, 1978.
-
(1978)
STOC'78
, pp. 320-325
-
-
Reddy, C.1
Loveland, D.2
-
21
-
-
0041498595
-
The complexity of translating logic to finite automata
-
E. Grädel, W. Thomas, and T. Wilke, editors, LNCS 2500, ch. 13
-
K. Reinhardt. The complexity of translating logic to finite automata. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games, LNCS 2500, ch. 13, pp. 231-238. 2002.
-
(2002)
Automata, Logics, and Infinite Games
, pp. 231-238
-
-
Reinhardt, K.1
-
22
-
-
85015274734
-
A decision procedure for term algebras with queues
-
T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Trans. Comput. Log., 2(2):155-181, 2001.
-
(2001)
ACM Trans. Comput. Log.
, vol.2
, Issue.2
, pp. 155-181
-
-
Rybina, T.1
Voronkov, A.2
-
23
-
-
33744902231
-
Upper bounds for a theory of queues
-
LNCS 2719
-
T. Rybina and A. Voronkov. Upper bounds for a theory of queues. In ICALP'03, LNCS 2719, pp. 714-724, 2003.
-
(2003)
ICALP'03
, pp. 714-724
-
-
Rybina, T.1
Voronkov, A.2
-
24
-
-
0038877596
-
Complexity of Presburger arithmetic with fixed quantifier dimension
-
U. Schöning. Complexity of Presburger arithmetic with fixed quantifier dimension. Theory Comput. Syst., 30(4):423-428, 1997.
-
(1997)
Theory Comput. Syst.
, vol.30
, Issue.4
, pp. 423-428
-
-
Schöning, U.1
-
25
-
-
0000339723
-
Numeration systems, linear recurrences, and regular sets
-
J. Shallit. Numeration systems, linear recurrences, and regular sets. Inf. Comput., 113(2):331-347, 1994.
-
(1994)
Inf. Comput.
, vol.113
, Issue.2
, pp. 331-347
-
-
Shallit, J.1
-
26
-
-
84863973748
-
A comparison of Presburger engines for EFSM reachability
-
LNCS 1427
-
T. Shiple, J. Kukula, and R. Ranjan. A comparison of Presburger engines for EFSM reachability. In CAV'98, LNCS 1427, pp. 280-292, 1998.
-
(1998)
CAV'98
, pp. 280-292
-
-
Shiple, T.1
Kukula, J.2
Ranjan, R.3
-
28
-
-
0003394437
-
-
PhD thesis, Department of Electrical Engineering, MIT, Boston, MA, USA
-
L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, Department of Electrical Engineering, MIT, Boston, MA, USA, 1974.
-
(1974)
The Complexity of Decision Problems in Automata Theory and Logic
-
-
Stockmeyer, L.1
-
29
-
-
85139856542
-
Mixed real-integer linear quantifier elimination
-
V. Weispfenning. Mixed real-integer linear quantifier elimination. In ISSAC'99, pp. 129-136, 1999.
-
(1999)
ISSAC'99
, pp. 129-136
-
-
Weispfenning, V.1
-
30
-
-
84863934422
-
On the construction of automata from linear arithmetic constraints
-
LNCS 1785
-
P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In TACAS'00, LNCS 1785, pp. 1-19, 2000.
-
(2000)
TACAS'00
, pp. 1-19
-
-
Wolper, P.1
Boigelot, B.2
|