4370 search results - page 483 / 874 » Algebra of Logic Programming |
111
click to vote
CONCUR
1993
Springer
15 years 7 months ago
1993
Springer
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
117
click to vote
ICFEM
2000
Springer
15 years 7 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
136
click to vote
ENTCS
2008
15 years 3 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
132
click to vote
ENTCS
2006
15 years 3 months ago
2006
We present a denotational semantics for the hardware compilation language Handel-C that maps language constructs to a set of equations, which describe the structure of the resulti...
153
click to vote
JCT
2008
15 years 3 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...