535 search results - page 54 / 107 » Checking Computations in Polylogarithmic Time |
CADE
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
IPTPS
2004
Springer
14 years 2 months ago
2004
Springer
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
ICAC
2009
IEEE
14 years 3 months ago
2009
IEEE
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
PEWASUN
2007
ACM
13 years 10 months ago
2007
ACM
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...