In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
Chai-Keong Toh, Richard Chen, Minar Delwar, Donald...
Sun-synchronous exploration is accomplished by reasoning about sunlight: where the Sun is in the sky, where and when shadows will fall, and how much power can be obtained through ...
David Wettergreen, M. Bernardine Dias, Benjamin Sh...
Timed-trace formalisms have emerged as a powerful method for specifying and reasoning about concurrent real-time systems. We present a simple variant which builds methodically on s...
Colin J. Fidge, Ian J. Hayes, A. P. Martin, Axel W...