|
ABSTRACT
Security automata are a variant of Büchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, a specification language combining Communicating Sequential Processes (CSP) and Object-Z (OZ), to specify security automata, formalize their combination with target systems, and analyze the security of the resulting system specifications. We provide theoretical results relating CSP-OZ specifications and security automata and show how refinement can be used to reason about specifications of security automata and their combination with target systems. Through a case study, we provide evidence for the practical usefulness of this approach. This includes the ability to specify concisely complex operations and complex control, support for structured specifications, refinement, and transformational design, as well as automated, tool-supported analysis.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
B. Alpern and F. Schneider. Defining Liveness. Inf. Process. Lett., 21(4):181--185, 1985.
|
| |
3
|
B. Alpern and F. Schneider. Recognizing Safety and Liveness. Distributed Computing, 2:117--126, 1987.
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
M. Butler and M. Leuschel. Combining CSP and B for specification and property verification. In J. Fitzgerald, I. Hayes, and A. Tarlecki, editors, Formal Methods 2005, volume 3582 of LNCS. Springer, 2005.
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
D. Evans and A. Twyman. Flexible policy-directed code safety. In IEEE Symposium on Security and Privacy, pages 32--45, 1999.
|
| |
12
|
|
| |
13
|
C. Fischer. Combination and Implementation of Processes and Data: From CSP-OZ to Java. PhD thesis, Bericht Nr. 2/2000, University of Oldenburg, April 2000.
|
| |
14
|
|
| |
15
|
Formal Systems (Europe) Ltd. Failures-Divergence Refinement --- FDR 2 User Manual, May 2003.
|
| |
16
|
L. Freitas. Model Checking Circus. PhD thesis, University of York, October 2005.
|
 |
17
|
|
| |
18
|
|
| |
19
|
|
 |
20
|
|
| |
21
|
|
| |
22
|
International Organization for Standardization. Information technology - Z formal specification notation - Syntax, type system and semantics, first edition, July 2002.
|
| |
23
|
|
| |
24
|
J. Ligatti, L. Bauer, and D. Walker. Edit automata: Enforcement mechanisms for run-time security policies. International Journal of Information Security, 4(1--2):2--16, 2005.
|
| |
25
|
|
| |
26
|
M. Möller, E.-R. Olderog, H. Rasch, and H. Wehrheim. Linking CSP-OZ with UML and Java: A Case Study. In E. Boiten, J. Derrick, and G. Smith, editors, Integrated Formal Methods, volume 2999 of LNCS, pages 267--286. Springer, 2004.
|
| |
27
|
|
| |
28
|
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
 |
32
|
|
| |
33
|
P. E. Sevinç. and D. Basin. Controlling access to documents: A formal access control model. Technical report, ETH Zurich, 2006.
|
| |
34
|
P. E. Sevinç, D. Basin, and E.-R. Olderog. Controlling access to documents: A formal access control model. In G. Müller and G. Schneider, editors, Proc. of ETRICS 2006, volume 3995 of LNCS, pages 352--367. Springer, 2006.
|
| |
35
|
|
| |
36
|
|
| |
37
|
|
| |
38
|
G. von Bochmann and J. Gecsei. A unified method for the specification and verification of protocols. In IFIP Congress, pages 229--234, 1977.
|
| |
39
|
|
| |
40
|
|
|