255 search results - page 6 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
IFIP
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
182
click to vote
POPL
2006
ACM
16 years 11 hour ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
VSTTE
2005
Springer
15 years 5 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...