255 search results - page 46 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
IFIP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
109
click to vote
JOOP
1998
14 years 11 months ago
1998
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
203
click to vote
POPL
2009
ACM
16 years 11 days ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
137
click to vote
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...