#### Filter Results:

- Full text PDF available (102)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, Mikhail I. Gofman
- ACM Conference on Computer and Communications…
- 2007

Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effect of an ARBAC policy by simple inspection, because sequences of changes by different administrators may interact in unexpected ways. ARBAC policy analysis algorithms can help by… (More)

- Amit Sasturkar, Ping Yang, Scott D. Stoller, C. R. Ramakrishnan
- 19th IEEE Computer Security Foundations Workshop…
- 2006

Role-based access control (RBAC) is a widely used model for expressing access control policies. In large organizations, the RBAC policy may be collectively managed by many administrators. Administrative RBAC (ARBAC) is a model for expressing the authority of administrators, thereby specifying how an organization's RBAC policy may change. Changes by one… (More)

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200… (More)

- Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
- COORDINATION
- 2008

We present the ω-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ω-calculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any other node within its physical transmission range (and no others), and… (More)

The eeciency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the… (More)

We introduce the problem of Model Repair for Probabilistic Systems as follows. Given a probabilistic system M and a probabilistic temporal logic formula φ such that M fails to satisfy φ, the Model Repair problem is to find an M ′ that satisfies φ and differs from M only in the transition flows of those states in M that are deemed controllable. Moreover, the… (More)

A new approach for ensuring the security of mobile code is proposed. Our approach enables a mobile-code consumer to understand and formally reason about what a piece of mobile code can do; check if the actions of the code are compatible with his/her security policies; and, if so, execute the code. The compatibility-checking process is automated, but if… (More)

WC propose Concurrent Transaction Logic (C7X) as the language for specifying, analyzing, and scheduling of workflows. We show that both local and global properties of worktlows can be naturally represented as C7X formulas and reasoning can be done with the use of the proof theory and the semantics of this logic, We describe a transformation that leads to an… (More)

- Xinxin Liu, C. R. Ramakrishnan, Scott A. Smolka
- TACAS
- 1998

- Ping Yang, C. R. Ramakrishnan, Scott A. Smolka
- VMCAI
- 2003