A temporal logic characterisation of observational determinism

Proceedings of the Computer Security Foundations Workshop

Volumn 2006, Issue , 2006, Pages 3-15

  Huisman, Marieke ^a   Worah, Pratik ^b   Sunesen, Kim ^c  

^a INRIA   (France)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

^c ANSYS Esterel Technologies   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PRIVACY; MODAL ANALYSIS; MODEL CHECKING; PROGRAM PROCESSORS; SECURITY OF DATA;

MODEL CHECKING ALGORITHMS; MULTI-THREADED PROGRAMS; OBSERVATIONAL DETERMINISM; TEMPORAL LOGIC CHARACTERIZATION;

TEMPORAL LOGIC;

EID: 33947616857     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2006.6     Document Type: Conference Paper

References (26)

1. T. Amtoft, S. Bandhakavi, and A. Banerjee. A logic for information flow in object-oriented programs. In POPL'06, pages 91-102. ACM Press, 2006.
2. T. Amtoft and A. Banerjee. A logic for information flow analysis with an application to forward slicing of simple imperative programs. Science of Computer Programming, 200x. To appear.
3. H.R. Andersen. A polyadic modal μ-calculus. Technical Report 1994-145, Tech. Univ. of Denmark (DTU), 1994.
4. G. Barthe, P. D'Argenio, and T. Rezk. Secure information flow by self-composition. In CSFW'17. IEEE Press, 2004.
5. G. Boudol and I. Castellani. Noninterference for concurrent programs and thread systems. TCS, 281(1):109-130, 2002.
6. M. Dam. CTL* and ECTL* as fragments of the modal mu-calculus. TCS, 126(1):77-96, 1994.
7. M. Dam. Decidability and proof systems for language-based noninterference relations. In POPL'06, 2006.
8. Á. Darvas, R. Hähnle, and D. Sands. A theorem proving approach to analysis of secure information flow. In Security in Pervasive Computing, number 3450 in LNCS, pages 193 - 209. Springer, 2005.
9. J.K. Deka. Model Checking Techniques for Reasoning about Events and Extremal Properties in Timed Systems. PhD thesis, IIT Kharagpur, 2000.
10. D. Distefano, A. Rensink, and J.-P. Katoen. Model checking birth and death. In Foundations of Information Technology in the Era of Network and Mobile Computing, volume 223 of IFIP Conference Proceedings, pages 435-447. Kluwer, 2002.
11. E.A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science. Elsevier, 1990.
12. E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic. J. of the ACM, 33:151-178, 1986.
13. J. Goguen and J. Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy, pages 11-20, 1982.
14. J. Gosling, B. Joy, G. Steele, and G. Bracha. The Java Language Specification, third edition. The Java Series. Addison-Wesley, 2005.
15. R. Joshi and K.R.M. Leino. A semantic approach to secure information flow. Science of Computer Programming, 37:113-138, 2000.
16. D. Kozen. Results on the prepositional μ-calculus. TCS, 27:333-354, 1983.
17. Information processing systems - open systems interconnection - LOTOS - a formal description technique based on the temporal ordering of observational behaviour, 1989. ISO International Standard 8807.
18. D. Peled and T. Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Inf. Processing Letters, 63:243-246, 1997.
19. F. Pottier. A simple view of type-secure information flow in the pi-calculus. In CSFW 15, pages 320-330, 2002.
20. F. Pottier and V. Simonet. Information flow inference for ML. ACM TOPLAS, 25:117-158, 2003.
21. A.W. Roscoe. CSP and determinism in security modelling. In IEEE Symposium on Security and Privacy, page 114, Washington, DC, USA, 1995. IEEE Computer Society.
22. A. Sabelfeld and A.C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21:5-19, 2003.
23. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In POPL'98, pages 355-364, 1998.
24. T. Terauchi and A. Aiken. Secure information flow as a safety problem. In Symposium on Static Analysis (SAS'05), number 3672 in LNCS, pages 352-367. Springer, 2005.
25. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
26. S. Zdancewic and A.C. Myers. Observational determinism for concurrent program security. In CSFW'16, 2003.