198 search results - page 29 / 40 » Modal Proofs as Distributed Programs (Extended Abstract) |
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
170
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
CL
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
101
click to vote
ICDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Rational strategic reasoning is the process whereby an agent reasons about the best strategy to adopt in a given multi-agent scenario, taking into account the likely behaviour of ...