Safety, Liveness, and Information Flow: Dependability Revisited

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-81, Issue , 2006, Pages 56-65

  Benenson, Zinaida ^a   Freiling, Felix C ^b   Holz, Thorsten ^b   Kesdogan, Dogan ^c   Penso, Lucia Draque ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF MANNHEIM   (Germany)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; SPECIFICATIONS;

ASYNCHRONOUS SYSTEM MODEL; DEPENDABLE SYSTEMS; FAULT-TOLERANT; FORMAL FRAMEWORK; FUNCTIONAL REQUIREMENT; INFORMATION FLOWS; LIVENESS; PROPERTY; SECURITY ATTRIBUTES; SYSTEMS SPECIFICATION;

FAULT TOLERANCE;

EID: 79551552320     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Martin Abadi und Leslie Lamport. Composing Specifications. ACM Trans. Progr. Lang, and Sys., 15(1):73-132, Jan. 1993.
2. Algirdas Avizienis, Jean-Claude Laprie, Brian Randell und Carl E. Landwehr. Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Trans. Dep. Sec. Compute 1(1):11-33, 2004.
3. Edward Amoroso. Fundamentals ofComputerSecurity Technology. Prentice Hall, 1994.
4. ' liveness. Inf. Proc. Lett., 21:181-185, 1985.
5. Baruch Awerbuch. Complexity of Network Synchronization. J. ACM, 32(4):804-823, Oct. 1985.
6. Christian Cachin. Modeling complexity in secure distributed computing. In Proc. Int. Workshop on Future Directions in Distr. Comp. (FuDiCo), Bertinoro, Italy, 2002.
7. David Chaum. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. J. Cryptology, 1(1):65-75, 1988.
8. Rudiger Dierstein. Sicherheit in der Tnformationstechnik-der Begriff IT-Sicherheit. Informatik Spektrum, 27(4):343-353, Aug. 2004.
9. James W. Gray, III. und John McLean. Using Temporal Logic to Specify and Verify Cryptographic Protocols. In Proc. Eighth Comp. Sec. Found. Workshop (CSFW '95丿, pages 108-117, Jun. 1995.
10. Felix C. Gartner und Stefan Pleisch. Failure detection sequencers: Necessary and sufficient information about failures to solve predicate detection. In Proc. 16th Int. Symp. on Distr. Comp. (DISC 2002丿,number 2508 in LNCS, pages 280-294, Toulouse, France, Oct. 2002.
11. Information Technology Security Evaluation Criteria (ITSEC). Version 1.2, Juni 1991.
12. Leslie Lamport. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng., 3(2):125-143, Mar. 1977.
13. Jean-Claude Laprie, Hrsg. Dependability: Basic concepts and Terminology, Number 5 of Dependable Computing and Fault-Tolerant Systems. Springer-Verlag, 1992.
14. Leslie Lamport. What good is Temporal Logic? In Proc. IFIP Congress on Inf. Proc., pages 657-667, Amsterdam, 1983.
15. L. Lamport, R. Shostak und M. Pease. The Byzantine generals problem. ACM Trans. Progr. Lang, and Sys., 4(3):382-401, Jul. 1982.
16. Nancy Lynch. DistributedAlgorithms. Morgan Kaufmann, San Mateo, CA, 1996.
17. MAFTIA Home - Malicious- and Accidental-Fault Tolerance for Internet Applications. Internet: h t t p://www. n e w c a s tle. r e s e a r c h. ec. o rg/m a f t i a/.
18. Heiko Mantel. Possibilistic Definitions of Security - An Assembly Kit. In Proc. 13th Comp. Sec. Found. Workshop (CSFW2000), Cambridge, England, Juli 2000.
19. Heiko Mantel. 厶 Uniform Framework for the Formal Specification and Verification of Information Flow Security. PhD thesis, Universitat des Saarlandes, Saarbriicken, Germany, 2003.
20. John McLean. Security models and information flow. In Proc. Symp. Research in Security and Privacy, pages 180-187, Oakland,CA, 1990.
21. John McLean. Security Models. In Encyclopedia ofSoftware Engineering. John Wiley & Sons, 1994.
22. John McLean. A General Theory of Composition for a Class of "Possibilistic” Properties. IEEE Trans. Softw. Eng., 22(1):53-67, Jan. 1996.
23. Zohar Manna und Amir Pnueli. The temporal logic ofreactive and concurrent systems: Specification. Springer-Verlag, 1991.
24. Heiko Mantel und Andrei Sabelfeld. A Generic Approach to the Security of Multithreaded Programs. In Proc. 14th Comp. Sec. Found. Workshop (CSFW 2001), pages 126-142, Cape Breton, Nova Scotia, Canada, Jun. 2001.
25. Andreas Pfitzmann. Why safety and security should and will merge. In Proc. 23rd Int. Conf. SAFECOMP 2004, number 3219 in LNCS, pages 1-2, Potsdam, Germany, Sep. 2004. Invited talk.
26. Amir Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
27. Kai Rannenberg, Andreas Pfitzmann und Gunter Muller. IT Security and Multilateral Security. In Gunter Muller und Kai Rannenberg, Hrsg., Multilateral Security in Communications- Technology, Infrastructure, Economy, pages 21-29. Addison-Wesley, 1999.
28. Dirk Stelzer. Kritik des Sicherheitsbegriffs im IT-Sicherheitsrahmenkonzept. Datenschutz undDatensicherheit, 14(10):501-506, Oct. 1990.
29. Victor L. Voydock und Stephen T. Kent. Security Mechanisms in High-Level Network Protocols. ACM Comp. Surveys, 15(2):135-171, Jun. 1983.