456 search results - page 37 / 92 » A Proof System for Abstract Non-interference |
141
click to vote
LPNMR
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
123
click to vote
FOSSACS
2006
Springer
15 years 9 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
133
Voted
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
161
Voted
TACAS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
124
click to vote
BIRTHDAY
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (so...