1410 search results - page 132 / 282 » Proving theorems by reuse |
181
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
Reasoning about permissions and obligations sometimes requires to distinguish more than one level of permission: certain actions are preferable to others, or one has more confiden...
169
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
We define a small-step operational semantics for the ECMAScript standard language corresponding to JavaScript, as a basis for analyzing security properties of web applications and ...
139
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
141
click to vote
CLIMA
2007
15 years 7 months ago
2007
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
152
click to vote
CCCG
2001
15 years 7 months ago
2001
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...