Sciweavers

1664 search results - page 201 / 333
» Towards Partial Reasoning
Sort
View
129
Voted
TPHOL
2003
IEEE
15 years 10 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews
165
Voted
CAEPIA
2003
Springer
15 years 10 months ago
Social Analysis of Multi-agent Systems with Activity Theory
The development of software systems is a complex task that requires support techniques to guide the process and solve inconsistencies in its . In the agent paradigm, the use of soc...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
130
Voted
CP
2003
Springer
15 years 10 months ago
Distributed Forward Checking
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
Ismel Brito, Pedro Meseguer
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 10 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
EUROCRYPT
2010
Springer
15 years 9 months ago
Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
This paper presents a formal security analysis of SSH in counter mode in a security model that accurately captures the capabilities of real-world attackers, as well as security-rel...
Kenneth G. Paterson, Gaven J. Watson