Results 1 
6 of
6
A powerdomain construction
 SIAM J. of Computing
, 1976
"... Abstract. We develop a powerdomain construction, [.], which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains. The desire for such a construction arises when considering programming languages with nondeterministic featu ..."
Abstract

Cited by 225 (20 self)
 Add to MetaCart
Abstract. We develop a powerdomain construction, [.], which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains. The desire for such a construction arises when considering programming languages with nondeterministic features or parallel features treated in a nondeterministic way. We hope to achieve a natural, fully abstract semantics in which such equivalences as (pparq)=(qparp) hold. The domain (D Truthvalues) is not the right one, and instead we take the (finitely) generable subsets of D. When D is discrete they are ordered in an elementwise fashion. In the general case they are given the coarsest ordering consistent, in an appropriate sense, with the ordering given in the discrete case. We then find a restricted class of algebraic inductive partial orders which is closed under [. as well as the sum, product and exponentiation constructions. This class permits the solution of recursive domain equations, and we give some illustrative semantics using 5[.]. It remains to be seen if our powerdomain construction does give rise to fully abstract semantics, although such natural equivalences as the above do hold. The major deficiency is the lack of a convincing treatment of the fair parallel construct. 1. Introduction. When one follows the ScottStrachey approach to the
A Propositional Policy Algebra for Access Control
 ACM Transactions on Information and System Security
, 2003
"... Securitysensitive environments protect their information resources against unauthorized use by enforcing access control mechanisms driven by access control policies. Due to the need to compare, contrast, and compose such protected information resources, access control policies regulating their mani ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
Securitysensitive environments protect their information resources against unauthorized use by enforcing access control mechanisms driven by access control policies. Due to the need to compare, contrast, and compose such protected information resources, access control policies regulating their manipulation need to be compared, contrasted, and composed. An algebra for manipulating such access control policies at a higher (propositional) level, where the operations of the algebra are abstracted from their specification details, is the subject of this paper. This algebra is applicable to policies that have controlled nondeterminism and all or nothing assignments of access privileges in their specification. These requirements reflect current practices in discretionary and rolebased access control models. Therefore, the proposed algebra can be used to reason about rolebased access control policies combined with other forms of discretionary policies. We show how to use algebraic identities to reason about consistency, completeness, and determinacy of composed policies using similar properties of their constituents.
Algebraic Approaches to Nondeterminism  an Overview
 ACM Computing Surveys
, 1997
"... this paper was published as Walicki, M.A. and Meldal, S., 1995, Nondeterministic Operators in Algebraic Frameworks, Tehnical Report No. CSLTR95664, Stanford University ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
this paper was published as Walicki, M.A. and Meldal, S., 1995, Nondeterministic Operators in Algebraic Frameworks, Tehnical Report No. CSLTR95664, Stanford University
A Programming Language for the Inductive Sets, and Applications
, 1984
"... Structures," NorthHolland, Amsterdam, 1974), r.e. dynamic logic is more expressive than finitetest dynamic logic. This refines a separation result of Meyer and Parikh ("Proc. 12th ACM Sympos. on Theory of Computing," 1979, pp. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Structures," NorthHolland, Amsterdam, 1974), r.e. dynamic logic is more expressive than finitetest dynamic logic. This refines a separation result of Meyer and Parikh ("Proc. 12th ACM Sympos. on Theory of Computing," 1979, pp.
The temporal knapsack problem and its solution
 In Proceedings of the 2 d International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
, 2005
"... Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsa ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a multiprocessor to bids for the resources. The algorithms considered use and combine techniques from constraint programming, artificial intelligence and operations research. 1
Session No. 11 Theoretical Foundations 481 AN ALGEBRAIC DEFINITION OF SIMULATION BETWEEN PROGRAMS*
"... A simulation relation between programs is defined which is a quasiordering. Mutual simulation is then an equivalence relation, and by dividing out by it we abstract from a program such details as how the sequencing is controlled and how data is represented. The equivalence classes are approximation ..."
Abstract
 Add to MetaCart
A simulation relation between programs is defined which is a quasiordering. Mutual simulation is then an equivalence relation, and by dividing out by it we abstract from a program such details as how the sequencing is controlled and how data is represented. The equivalence classes are approximations to the algorithms which are realized, or expressed, by their member programs. A technique is given and illustrated for proving simulation and equivalence of programs; there is an analogy with Floyd's technique for proving correctness oi programs. Finally, necessary and sufficient conditions for simulation are given.