1426 search results - page 129 / 286 » Specification of nonmonotonic reasoning |
152
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
168
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
166
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
201
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
171
click to vote
GIS
2009
ACM
16 years 1 months ago
2009
ACM
Naive Geography’s premise “Topology matters, metric refines” calls for metric properties that provide opportunities for finergrained distinctions than the purely qualitative...