2137 search results - page 104 / 428 » Proving Abstract Non-interference |
87
Voted
LICS
1997
IEEE
15 years 7 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
131
click to vote
ALGOSENSORS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
113
Voted
ISTA
2004
15 years 4 months ago
2004
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
143
Voted
CIIA
2009
15 years 3 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
113
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...