2473 search results - page 221 / 495 » The Logic of Communication Graphs |
160
click to vote
BIRTHDAY
2005
Springer
16 years 5 days ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
158
click to vote
ASPDAC
2004
ACM
16 years 2 days ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
160
click to vote
DLOG
2007
15 years 9 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
172
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...
163
click to vote
TACAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...