• Publications
  • Influence
Efficient policy analysis for administrative role based access control
TLDR
This paper identifies classes of policies of practical interest, develops analysis algorithms for them, and analyzes their parameterized complexity, showing that the algorithms may have high complexity with respect to some parameter k characterizing the hardness of the input (such that k is often small in practice) but have polynomial complexity in terms of the overall input size. Expand
  • 126
  • 20
  • PDF
Mining Attribute-Based Access Control Policies
  • Z. Xu, S. Stoller
  • Computer Science
  • IEEE Transactions on Dependable and Secure…
  • 10 June 2013
Attribute-based access control (ABAC) provides a high level of flexibility that promotes security and information sharing. ABAC policy mining algorithms have potential to significantly reduce theExpand
  • 70
  • 15
  • PDF
Accurate and efficient runtime detection of atomicity errors in concurrent programs
TLDR
We present new algorithms for runtime (dynamic) detection of violations of conflict-atomicity and view-atomicism, which are analogous to conflict-serializability in database systems. Expand
  • 113
  • 11
  • PDF
Transformations for model checking distributed Java programs
TLDR
This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs. Expand
  • 44
  • 11
  • PDF
Runtime analysis of atomicity for multithreaded programs
TLDR
This paper describes two algorithms for runtime detection of atomicity violations and compares their cost and effectiveness. Expand
  • 139
  • 10
  • PDF
Testing Concurrent Java Programs using Randomized Scheduling
  • S. Stoller
  • Computer Science
  • Electron. Notes Theor. Comput. Sci.
  • 1 December 2002
TLDR
We transform a given Java program by inserting calls to a scheduling function at selected points. Expand
  • 130
  • 10
  • PDF
Runtime Verification with State Estimation
TLDR
We introduce the concept of Runtime Verification with State Estimation and show how this concept can be applied to estimate the probability that a temporal property is satisfied by a run of a program when monitoring overhead is reduced by sampling. Expand
  • 97
  • 8
  • PDF
Type Inference for Parameterized Race-Free Java
TLDR
We study the type system introduced by Boyapati and Rinard in their paper “A Parameterized Type System for Race-Free Java Programs” and try to infer the type annotations (“lock types”) needed by their type checker to show that a program is free of race conditions. Expand
  • 78
  • 8
  • PDF
Policy Analysis for Administrative Role Based Access Control
TLDR
We first establish the connection between security policy analysis and planning in artificial intelligence. Expand
  • 85
  • 7
Optimized run-time race detection and atomicity checking using partial discovered types
TLDR
This paper explores the use of static analysis to significantly decrease the overhead of run-time checking for data races and atomicity violations. Expand
  • 67
  • 7
  • PDF