36 search results - page 5 / 8 » tcs 1998 |
TCS
1998
13 years 9 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
TCS
1998
13 years 9 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
TCS
1998
13 years 9 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
TCS
1998
13 years 9 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
TCS
1998
13 years 9 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...