256 search results - page 5 / 52 » Timing Verification by Successive Approximation |
ICISC
2004
13 years 8 months ago
2004
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
DAC
1998
ACM
14 years 8 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
TWC
2008
13 years 7 months ago
2008
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...