Results 1  10
of
102
A latticetheoretic model for an algebra of . . .
, 2006
"... We establish the foundations of a latticetheoretic model for a variant of communicating sequential processes. This technical report is not intended as a standalone work, but as a companion to a paper which defines the process algebra and describes its model. We give proofs for various theorems sta ..."
Abstract
 Add to MetaCart
We establish the foundations of a latticetheoretic model for a variant of communicating sequential processes. This technical report is not intended as a standalone work, but as a companion to a paper which defines the process algebra and describes its model. We give proofs for various theorems
LatticeBased Access Control Models
, 1993
"... The objective of this article is to give a tutorial on latticebased access control models for computer security. The paper begins with a review of Denning's axioms for information flow policies, which provide a theoretical foundation for these models. The structure of security labels in the ..."
Abstract

Cited by 1518 (61 self)
 Add to MetaCart
The objective of this article is to give a tutorial on latticebased access control models for computer security. The paper begins with a review of Denning's axioms for information flow policies, which provide a theoretical foundation for these models. The structure of security labels
The Lattice of Topological Domains: An Example of Mizar Development
"... We present the complete development of the theory of topological domains (regular sets) in the Mizar formalism. It enveloped the latticetheoretic foundations of the theory of domains that was given in [23] and in [12]. The aim is to present the main result in [11] concerning certain characteriza ..."
Abstract
 Add to MetaCart
We present the complete development of the theory of topological domains (regular sets) in the Mizar formalism. It enveloped the latticetheoretic foundations of the theory of domains that was given in [23] and in [12]. The aim is to present the main result in [11] concerning certain
Strict Monotonicity in Comparative Statics
, 1997
"... This paper provides sufficient conditions to draw strict monotone comparative statics conclusions in optimization problems. These results extend the latticetheoretic results of Milgrom and Shannon (1994) by imposing a stronger differential version of the single crossing property and arguing from fi ..."
Abstract

Cited by 263 (1 self)
 Add to MetaCart
This paper provides sufficient conditions to draw strict monotone comparative statics conclusions in optimization problems. These results extend the latticetheoretic results of Milgrom and Shannon (1994) by imposing a stronger differential version of the single crossing property and arguing from
Measuring on lattices
, 2009
"... Abstract. Previous derivations of the sum and product rules of probability theory relied on the algebraic properties of Boolean logic. Here they are derived within a more general framework based on lattice theory. The result is a new foundation of probability theory that encompasses and generalizes ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
. The generality of this formalism enables one to derive the traditionally assumed condition of additivity in measure theory, as well introduce a general notion of product. To illustrate the generic utility of this novel latticetheoretic foundation of measure, the sum and product rules are applied to number
Theoretical foundations of association rules
 In 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery
, 1998
"... In this paper we describe a formal framework for the problem of mining association rules. The theoretical foundation is based on the field of formal concept analysis. A concept is composed of closed subsets of attributes (itemsets) and objects (transactions). We show that all frequent itemsets are u ..."
Abstract

Cited by 112 (10 self)
 Add to MetaCart
are uniquely determined by the frequent concepts. We further show how this latticetheoretic framework can be used to find a small rule generating set, from which one can infer all other association rules. 1
Domain Theory in Logical Form
 Annals of Pure and Applied Logic
, 1991
"... The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and system ..."
Abstract

Cited by 249 (8 self)
 Add to MetaCart
The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency
The Power of Parameterization in Coinductive Proof
"... Coinduction is one of the most basic concepts in computer science. It is therefore surprising that the commonlyknown latticetheoretic accounts of the principles underlying coinductive proofs are lacking in two key respects: they do not support compositional reasoning (i.e., breaking proofs into se ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
in 2001, neither of the previous accounts suggests its general applicability to improving the state of the art in interactive coinductive proof. In addition to presenting the latticetheoretic foundations of parameterized coinduction, demonstrating its utility on representative examples, and studying its
Theoretical foundations of dynamic program slicing
, 2006
"... This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of slicing. This shows that existing forms of dynamic sl ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
slicing contain three orthogonal dimensions in their slicing criteria and allows for a latticetheoretic study of the subsumption relationship between these dimensions and their relationship to static slicing formulations.
A Thermal Lattice Boltzmann TwoPhase Flow Model and Its Application to Heat Transfer Problems—Part 1. Theoretical Foundation,”
 ASME J. Fluids Eng.,
, 2006
"... ..."
Results 1  10
of
102