Sciweavers

545 search results - page 80 / 109
» Recursive logic frames
Sort
View
APAL
2008
104views more  APAL 2008»
14 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
On Termination for Faulty Channel Machines
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
ENTCS
2010
130views more  ENTCS 2010»
14 years 9 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
JFP
2006
113views more  JFP 2006»
14 years 9 months ago
Consistency of the theory of contexts
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher stract S...
Anna Bucalo, Furio Honsell, Marino Miculan, Ivan S...
ENTCS
2007
121views more  ENTCS 2007»
14 years 9 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim