Sciweavers

12753 search results - page 2272 / 2551
» is 2002
Sort
View
TCS
2002
15 years 4 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
TCS
2002
15 years 4 months ago
Logical systems for structured specifications
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
Tomasz Borzyszkowski
TCS
2002
15 years 4 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat
TCS
2002
15 years 4 months ago
A truly concurrent semantics for a process algebra using resource pomsets
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
Paul Gastin, Michael W. Mislove
TCS
2002
15 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
« Prev « First page 2272 / 2551 Last » Next »