2022 search results - page 343 / 405 » Complexity of Non-Monotonic Logics |
LCPC
2001
Springer
15 years 3 months ago
2001
Springer
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
100
click to vote
PAPM
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
RTA
2001
Springer
15 years 3 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
DATE
2000
IEEE
15 years 3 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 ...
99
Voted
ISSTA
2000
ACM
15 years 3 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...