888 search results - page 150 / 178 » The Power of Temporal Proofs |
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
: IC technologies are approaching the ultimate limits of silicon in terms of channel width, power supply and speed. By approaching these limits, circuits are becoming increasingly ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
100
click to vote
TABLEAUX
1998
Springer
15 years 1 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
DEBS
2010
ACM
15 years 1 months ago
2010
ACM
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...