Related work: HRU problem (access control - safety) is undecidable: http://en.wikipedia.org/wiki/HRU_%28security%29 http://www.utdallas.edu/~muratk/courses/dbsec12f_files/access2.pdf
Basically the HRU model can simulate a Turing machine, so if safety problem is decidable, so is halting problem. -- http://www.subspacefield.org/~travis/ "Computer crime, the glamor crime of the 1970s, will become in the 1980s one of the greatest sources of preventable business loss." John M. Carroll, "Computer Security", first edition cover flap, 1977
pgpZnCCyUSC1E.pgp
Description: PGP signature
_______________________________________________ langsec-discuss mailing list langsec-discuss@mail.langsec.org https://mail.langsec.org/cgi-bin/mailman/listinfo/langsec-discuss
