FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
X;R ;R R R X X R R 1 2 1 2 1 1 2 1 2 2 1 2
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...