4047 search results - page 460 / 810 » Algebraic Model Checking |
173
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
163
click to vote
CTCS
1997
Springer
15 years 11 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
135
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
We present a rigorous but transparent semantic de nition of VHDL'93 covering the complete signal behavior and time model including the various wait statements and signal assi...
208
click to vote
COCO
1993
Springer
15 years 11 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
144
click to vote
CONCUR
1993
Springer
15 years 11 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...