1818 search results - page 248 / 364 » Granularity-Adaptive Proof Presentation |
156
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
129
Voted
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
115
Voted
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
103
Voted
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
137
Voted
SP
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...