A security model for personal information security management based on partial approximative set theory

Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2010

Volumn 5, Issue , 2010, Pages 839-845

  Csajbók, Zoltán ^a  

^a UNIVERSITY OF DEBRECEN   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SECURITY OF DATA;

COMPUTING ENVIRONMENTS; COMPUTING SYSTEM; DISTRIBUTED SOFTWARE SYSTEM; EXTERNAL OBSERVER; LOWER AND UPPER APPROXIMATIONS; OBSERVED SYSTEMS; PERSONAL INFORMATION SECURITIES; PRIMITIVE ACTIONS;

ROUGH SET THEORY;

EID: 79551545010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/imcsit.2010.5679939     Document Type: Conference Paper

References (33)

1. Alpern, B., " Schneider, F., Defining liveness. Inf. Process. Lett. 21, 4 (Oct.), 181-185, 1985.
2. Alpern, B., " Schneider, F., Recognizing safety and liveness. Distributed Computing, 2:117-126, 1987.
3. Anderson, R., Security Engineering: A Guide to Building Dependable, Distributed Systems. First edition. Wiley Computer Publishing, 2001.
4. Bauer, L., " Ligatti, J., " Walker, D., More enforceable security policies. In Cervesato, I. (Ed.), Foundations of Computer Security: Proceedings of the FLoC'02 workshop on Foundations of Computer Security (2002), pp. 95-104.
5. Benenson, Z., " Freiling, F.C., " Holz, Th., " Kesdogan, D., " Penso, L.D.: Safety, Liveness, and Information Flow: Dependability Revisited. In: Karl, W., Becker, J., Gropietsch, K.E., Hochberger, Ch., Maehle, E. (eds.) ARCS 2006-19th International Conference on Architecture of Computing Systems, Workshops Proceedings, pp. 56-65. Frankfurt am Main, Germany (2006).
6. Caelli, W., " Longley, D., " Shain, M., Information security handbook, Stockton Press, New York, 1991.
7. Clarkson, M. R., " Schneider, F.B., Hyperproperties, Proceedings 21st IEEE Computer Security Foundations Symposium (Pittsburgh, PA, June 2008), IEEE Computer Society (2008), pp. 51-65.
8. Cousot, P., " Cousot, R., Abstract interpretation and application to logic programs, Journal of Logic Programming, 13(2-3):103-179, 1992. http://www.di.ens.fr/-cousot/COUSOTpapers/JLP92.shtml.
9. Csajbók, Z., Partial Approximative Set Theory, In Programs, Proofs, Processes, Sixth Conference on Computability in Europe, CiE 2010, Ponta Delgada (Azores), Portugal, June 30 - July 4, 2010, Abstract and Handout Booklet, 2010. To appear.
10. Csajbók, Z., Partial Approximative Set Theory: A View from Galois Connections, In Kovács, Emöd (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), January 27-30, 2010, Eger, Hungary. Eger: Eszterházy Károly College. To appear.
11. Davey, B. A., " Priestley, H. A.: Introduction to Lattices and Order, Second edition, Cambridge University Press, Cambridge, 2002.
12. Denecke, K., " Erné, M., " Wismath, S.L., Galois Connections and Applications, Kluwer Academic Publishers, Dordrecht, London, Boston, 2004.
13. Diekert, V., " Rozenberg, G., The Book of Traces, World Scientific, Singapore, 1995.
14. Düntsch, I., " Gediga, G., Approximation Operators in Qualitative Data Analysis, In: H. de Swart et al. (Eds.): TARSKI, Lecture Notes in Computer Science Vol. 2929, Springer-Verlag, Berlin, Heidelberg, 214-230, 2003.
15. Erné, M., " Koslowski, J., " Melton, A., " Strecker, G. E., A primer on Galois connections. In: S. Andima et al. (eds.), Papers on General Topology and its Applications. 7th Summer Conf. Wisconsin. Annals New York Acad. Sci. 704, New York (1994), pp. 103-125.
16. Focardi, R., " Gorrieri, R., Classification of security properties (Part I: Information flow). In Foundations of Security Analysis and Design 2000, volume 2171 of Lecture Notes in Computer Science, pages 331-396. Springer, 2001.
17. Gierz, G., " Hofmann, K. H., " Keimel, K., " Lawson, J. D., " Mislove, M., " Scott, D.S., Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications 93, Cambridge University Press, 2003.
18. Information Technology Security Evaluation Criteria (ITSEC). Version 1.2, Juni 1991.
19. Järvinen, J., Lattice theory for rough sets, In: Transactions on Rough Sets VI. LNCS, vol. 4374, Springer, Heidelberg, 2007, pp. 400-498.
20. Lamport, L., Proving the correctness of multiprocess programs. IEEE Transactions of Software Engineering, 3(2):125-143, Mar. 1977.
21. Ligatti, J., " Bauer, L., " Walker, D., Edit Automata: Enforcement mechanisms for run-time security policies. International Journal of Information Security, 4(1-2):2-16, February 2005.
22. Ligatti, J. A., Policy Enforcement via Program Monitoring. PhD thesis, Princeton University, June 2006.
23. Mazurkiewicz, A., Trace Theory, In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279-324, Berlin-Heidelberg-New York, 1987, Springer.
24. Miné, A., Weakly relational numerical abstract domains, Ph. D. thesis, École Polythechnique, 2004.
25. Naldurg, P., " Campbell, R.H., " Mickunas, M.D., Developing Dynamic Security Policies, Proceedings of the 2002 DARPA Active Networks Conference and Exposition (DANCE 2002), San Francisco, CA, USA, IEEE Computer Society Press, May 29-31, 2002.
26. Pagliani, P. and Chakraborty, M., A Geometry of Approximation. Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns, Trends in Logic, Vol. 27, Springer, 2008.
27. Pawlak, Z., Rough Sets, International Journal of Information and Computer Science, Vol. 11(5) (1982), pp. 341-356.
28. Pawlak, Z., Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.
29. Read, S., Thinking about Logic: An Introduction to the Philosophy of Logic, Oxford University Press, Oxford, 1995.
30. Schneider, F.B., " Morrisett, G., " Harper, R., A Language-Based Approach to Security. In: Informatics: 10 Years Back, 10 Years Ahead. Lecture Notes in Computer Science, Vol. 2000. Springer-Verlag, 2001. pp. 86-101.
31. Smyth, M.B., Powerdomains and predicate transformers: a topological view, In J. Diaz, editor, Automata, Languages and Programming, pages 662-675, Berlin, 1983. Springer-Verlag. Lecture Notes in Computer Science Vol. 154.
32. Smyth, M.B., Topology, In Abramsky, S., " Gabbay, D.M., " Maibaum, T.S.E. (eds.): Handbook of Logic in Computer Science. Volume I. Background: Mathematical Stuctures, pp. 641-761, Clarendon Press, Oxford, 1992.
33. Szpilrajn, E., Sur l'extension de l'ordre partiel, Fund. Math. 16 (1930), pp. 386-389.