1101 search results - page 106 / 221 » Forcing in proof theory |
107
click to vote
POPL
2010
ACM
15 years 28 days ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
96
Voted
JAR
2008
15 years 21 days ago
2008
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
APAL
2004
15 years 18 days ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
146
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
136
click to vote
CCS
2005
ACM
15 years 6 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...