6978 search results - page 317 / 1396 » On Proofs in System P |
211
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
196
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
188
Voted
FC
1998
Springer
15 years 11 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
162
click to vote
SIGECOM
2004
ACM
16 years 5 days ago
2004
ACM
Lack of cooperation (free riding) is one of the key problems that confronts today’s P2P systems. What makes this problem particularly difficult is the unique set of challenges ...
203
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...