Sciweavers

456 search results - page 37 / 92
» A Proof System for Abstract Non-interference
Sort
View
LPNMR
2009
Springer
14 years 3 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
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...
Ping Hou, Marc Denecker
FOSSACS
2006
Springer
14 years 9 days ago
Presenting Functors by Operations and Equations
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 ...
Marcello M. Bonsangue, Alexander Kurz
TAPSOFT
1997
Springer
14 years 24 days ago
An Applicative Module Calculus
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...
Judicaël Courant
TACAS
2005
Springer
113views Algorithms» more  TACAS 2005»
14 years 2 months ago
Applications of Craig Interpolants in Model Checking
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 ...
Kenneth L. McMillan
BIRTHDAY
2006
Springer
14 years 11 days ago
Institutional 2-cells and Grothendieck Institutions
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...
Till Mossakowski