102 search results - page 3 / 21 » Terminator: Beyond Safety |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
INFORMATICALT
2008
13 years 5 months ago
2008
A transitive distributed knowledge logic is considered. The considered logic S4nD is obtained from multi-modal logic S4n by adding transitive distributed knowledge operator. For a ...
WRLA
2010
13 years 3 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
GLOBECOM
2009
IEEE
13 years 3 months ago
2009
IEEE
Abstract--In this paper we investigate hardware implementations of ciphering algorithms, SNOW 3G and the Advanced Encryption Standard (AES), for the acceleration of the protocol st...