1894 search results - page 113 / 379 » A TLA Proof System |
148
click to vote
SAC
2006
ACM
16 years 9 days ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
140
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
173
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
149
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
157
click to vote
APAL
2010
15 years 6 months ago
2010
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...