ENTCS
2006
13 years 11 months ago
2006
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
ENTCS
2006
13 years 11 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
ENTCS
2006
13 years 11 months ago
2006
d Abstract) 1 Matthias Schr
ENTCS
2006
13 years 11 months ago
2006
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
ENTCS
2006
13 years 11 months ago
2006
In addition to efficient code generation, causality cycles and schizophrenic statements are major problems for the compilation of synchronous programs. Although these problems are ...
ENTCS
2006
13 years 11 months ago
2006
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
ENTCS
2006
13 years 11 months ago
2006
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
ENTCS
2006
13 years 11 months ago
2006
Extending the work of [7] on groups definable in compact complex manifolds and of [1] on strongly minimal groups definable in nonstandard compact complex manifolds, we classify al...
ENTCS
2006
13 years 11 months ago
2006
ENTCS
2006
13 years 11 months ago
2006
The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a l...