2529 search results - page 286 / 506 » The Logical Structure of Binding |
166
click to vote
APN
2000
Springer
15 years 11 months ago
2000
Springer
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
166
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
A target structure for implementing fast edge-triggered control units is presented. In many cases, the proposed controller is faster than a one-hot encoded structure as its correc...
168
click to vote
PADS
1996
ACM
15 years 10 months ago
1996
ACM
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...
167
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
187
click to vote
ICECCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...