1401 search results - page 194 / 281 » Randomness in Interactive Proofs |
TVCG
2012
13 years 8 days ago
2012
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
Web Services are software services that can be advertised by providers and deployed by customers using Web technologies. This concept is currently carried further to address Web s...
174
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
170
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
174
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...