5084 search results - page 234 / 1017 » Proving Possibility Properties |
141
click to vote
FSE
2010
Springer
15 years 11 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
195
Voted
DALT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...
166
Voted
KBSE
2000
IEEE
15 years 11 months ago
2000
IEEE
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
164
Voted
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...
173
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...