1226 search results - page 66 / 246 » Proofs, Programs and Abstract Complexity |
102
click to vote
SAC
2008
ACM
15 years 2 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
125
click to vote
FM
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and...
113
click to vote
OOPSLA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we explore the idea that the code that constitutes a program actually forms a higher-level, program specific language. The symbols of the language are the abstracti...
117
click to vote
TPHOL
2000
IEEE
15 years 7 months ago
2000
IEEE
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
130
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...