12774 search results - page 203 / 2555 » A Framework for Proof Systems |
142
click to vote
CSL
2004
Springer
15 years 12 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...
180
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...
156
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...
165
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...
166
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...