Formal model and policy specification of usage control

The recent usage control model (UCON) is a foundation for next-generation access control models with distinguishing properties of decision continuity and attribute mutability. A usage control decision is determined by combining authorizations, obligations, and conditions, presented as UCON ABC core models by Park and Sandhu. Based on these core aspects, we develop a formal model and logical specification of UCON with an extension of Lamport's temporal logic of actions (TLA). The building blocks of this model include: (1) a set of sequences of system states based on the attributes of subjects, objects, and the system, (2) authorization predicates based on subject and object attributes, (3) usage control actions to update attributes and accessing status of a usage process, (4) obligation actions, and (5) condition predicates based on system attributes. A usage control policy is defined as a set of temporal logic formulas that are satisfied as the system state changes. A fixed set of scheme rules is defined to specify general UCON policies with the properties of soundness and completeness. We show the flexibility and expressive capability of this formal model by specifying the core models of UCON and some applications. © 2005 ACM

DTD level authorization in XML documents with usage control

[Summary]: In recent years an increasing amount of semi-structured data has become important to humans and programs. XML promoted by the World Wide Web Consortium (W3C) is rapidly emerging as the new standard language for semi-structured data representation and exchange on the Internet. XML documents may contain private information that cannot be shared by all user communities. So securing XML data is becoming increasingly important and several approaches have been designed to protect information in a website. However, these approaches typically are used at file system level, rather than for the data in XML documents. Usage control has been considered as the next generation access control model with distinguishing properties of decision continuity. Usage control enables finer-grained control over usage of digital objects than that of traditional access control policies and models. In this paper, we present a usage control model to protect information distributed on the web, which allows the access restrictions directly at DTD-level and XML document-level. Finally, comparisons with related works are analysed

RUPA and Former Partners: Cutting the Gordian Knot With Continuing Partnership Entities

Passage of the Revised Uniform Partnership Act (RUPA) brought change in the treatment of partnerships as entities rather than aggregates of their members. The nature of the Gordian knot that binds individuals associated in partnership and the lingering ties between individuals formerly associated in partnership are examined, and the hidden costs of continuity that RUPA imposes on withdrawing partners are evaluated

RUPA and Former Partners: Cutting the Gordian Knot With Continuing Partnership Entities

Passage of the Revised Uniform Partnership Act (RUPA) brought change in the treatment of partnerships as entities rather than aggregates of their members. The nature of the Gordian knot that binds individuals associated in partnership and the lingering ties between individuals formerly associated in partnership are examined, and the hidden costs of continuity that RUPA imposes on withdrawing partners are evaluated

Access to Hospice Care: Expanding Boundaries, Overcoming Barriers

This report looks at issues of social justice, access, and public policy in hospice and palliative care. As it examines the issues from the perspectives of social justice and fairness, it also recommends ways in which the definition of hospice can be expanded to include more Americans for a longer period of time than simply the days or months shortly before death

Effects of employee commitment on collectivism in the workplace : further evidence

Purpose: Some industries whose products are considered to have a negative effect on health and environment, are categorized as controversial industries. Empirical studies in such studies have not been widely carried out. Design/methodology/approach: This study was carried out in a controversial industry to examine the level of employee collectivism in the face of various challenges in this industry. The number of samples is 150 people, with the method of non purposive random sampling. Respondents were taken from several cigarette factories in Kudus. The method of analysis in this study is the multiple linear regression analysis, with SSPS testing reliability and validity, correlation, hypothesis testing, simultaneous effect and the coefficient of determination. Findings: The results demonstrate that in this industry, employees are trying to increase collectivism to strengthen solidarity in the workplace. Practical Implications: This findings can be used implementatively for management to improve the elements supporting the strengthening of employee commitment and increasing collectivism in the workplace. Theoretically, this finding is useful to know more about industrial relations and human resource management in controversial industries. Originality/value: The study examines how individual commitments can unite employees to continue working in controversial industries, and whether individual commitment can strengthen fellow employee relations.peer-reviewe

Coinductive Formal Reasoning in Exact Real Arithmetic

In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by coinductive streams. The algorithms work on coinductive stream of M\"{o}bius maps and form the basis of the Edalat--Potts exact real arithmetic. We use the machinery of the Coq proof assistant for the coinductive types to present the formalisation. The formalised algorithms are only partially productive, i.e., they do not output provably infinite streams for all possible inputs. We show how to deal with this partiality in the presence of syntactic restrictions posed by the constructive type theory of Coq. Furthermore we show that the type theoretic techniques that we develop are compatible with the semantics of the algorithms as continuous maps on real numbers. The resulting Coq formalisation is available for public download.Comment: 40 page

Recursive Definitions of Monadic Functions

Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.Comment: In Proceedings PAR 2010, arXiv:1012.455