Results 21  30
of
1,482,473
A logical account of NGSCB
 In FORTE ’04
, 2004
"... Abstract. As its name indicates, NGSCB aims to be the “NextGeneration Secure Computing Base”. As envisioned in the context of Trusted Computing initiatives, NGSCB provides protection against software attacks. This paper describes NGSCB using a logic for authentication and access control. Its goal i ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract. As its name indicates, NGSCB aims to be the “NextGeneration Secure Computing Base”. As envisioned in the context of Trusted Computing initiatives, NGSCB provides protection against software attacks. This paper describes NGSCB using a logic for authentication and access control. Its goal
A logical reconstruction of SPKI
 IN PROCEEDINGS OF THE 14TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP
, 2001
"... SPKI/SDSI is a proposed public key infrastructure standard that incorporates the SDSI public key infrastructure. SDSI's key innovation was the use of local names. We previously introduced a Logic of Local Name Containment that has a clear semantics and was shown to completely characterize SD ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
SPKI/SDSI is a proposed public key infrastructure standard that incorporates the SDSI public key infrastructure. SDSI's key innovation was the use of local names. We previously introduced a Logic of Local Name Containment that has a clear semantics and was shown to completely characterize
A Logic of Games and . . .
, 2009
"... We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outcomes and preferences over outcomes. We study the underlying structure of powers of coalitions as they are expressed in the ..."
Abstract
 Add to MetaCart
We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outcomes and preferences over outcomes. We study the underlying structure of powers of coalitions as they are expressed
A logic of explicit knowledge
 In L. Behounek and M. Bilkova (Eds.), Logica Yearbook 2004
, 2005
"... A wellknown problem with Hintikkastyle logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpli ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
A wellknown problem with Hintikkastyle logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge
A Logic for Reasoning about Time and Reliability
 Formal Aspects of Computing
, 1994
"... We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are inter ..."
Abstract

Cited by 360 (1 self)
 Add to MetaCart
We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas
Towards a logic of argumentation
 Proc. 6th Int. Conf. Scalable
, 2012
"... Abstract. Starting from a typology of argumentative forms proposed in linguistics by Apothéloz, and observing that the four basic forms can be organized in a square of oppositions, we present a logical language, somewhat inspired from generalized possibilistic logic, where these basic forms can be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Starting from a typology of argumentative forms proposed in linguistics by Apothéloz, and observing that the four basic forms can be organized in a square of oppositions, we present a logical language, somewhat inspired from generalized possibilistic logic, where these basic forms can
A Logical Analysis of
, 1
"... We present a logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses. The operational meaning of a goal which is an implication is given by the deduction theorem: a goal D provable from a program if the goal G is prova ..."
Abstract
 Add to MetaCart
We present a logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses. The operational meaning of a goal which is an implication is given by the deduction theorem: a goal D provable from a program if the goal G
A LOGIC FOR ‘BECAUSE’
"... Abstract. In spite of its significance for everyday and philosophical discourse, the explanatory connective ‘because ’ has not received much treatment in the philosophy of logic. The present paper develops a logic for ‘because ’ based on systematic connections between ‘because ’ and the truthfunctio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In spite of its significance for everyday and philosophical discourse, the explanatory connective ‘because ’ has not received much treatment in the philosophy of logic. The present paper develops a logic for ‘because ’ based on systematic connections between ‘because
A Logic of ObjectOriented Programs
, 1998
"... We develop a logic for reasoning about objectoriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for selfreference in objects. It is much like a type system for objects with subtyping, but our specifications go further than types in detailing pre ..."
Abstract

Cited by 141 (4 self)
 Add to MetaCart
We develop a logic for reasoning about objectoriented programs. The logic is for a language with an imperative semantics and aliasing, and accounts for selfreference in objects. It is much like a type system for objects with subtyping, but our specifications go further than types in detailing pre
A Logic for the Schema Calculus
, 1998
"... In this paper we introduce and investigate a logic for the schema calculus of Z. The schema calculus is arguably the reason for Z's popularity but so far no true calculus (a sound system of rules for reasoning about schema expressions) has been given. Presentations thus far have either failed t ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In this paper we introduce and investigate a logic for the schema calculus of Z. The schema calculus is arguably the reason for Z's popularity but so far no true calculus (a sound system of rules for reasoning about schema expressions) has been given. Presentations thus far have either failed
Results 21  30
of
1,482,473