Applying Automated Theorem Proving to Computer Security / Najlacnejšie knihy
Applying Automated Theorem Proving to Computer Security

Kód: 12022683

Applying Automated Theorem Proving to Computer Security

Autor Kelly Mcelroy

While more and more data is stored and accessed electronically, better access control methods need to be implemented for computer security. Formal modelling and analysis have been successfully used in certain areas of computer sys ... celý popis

17.51

Bežne: 17.88 €

Ušetríte 0.37 €


Skladom u dodávateľa
Odosielame za 9 - 15 dní
Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darčekový poukaz: Radosť zaručená
  1. Darujte poukaz v ľubovoľnej hodnote, a my sa postaráme o zvyšok.
  2. Poukaz sa vzťahuje na všetky produkty v našej ponuke.
  3. Elektronický poukaz si vytlačíte z e-mailu a môžete ho ihneď darovať.
  4. Platnosť poukazu je 12 mesiacov od dátumu vystavenia.

Objednať darčekový poukazViac informácií

Viac informácií o knihe Applying Automated Theorem Proving to Computer Security

Nákupom získate 42 bodov

Anotácia knihy

While more and more data is stored and accessed electronically, better access control methods need to be implemented for computer security. Formal modelling and analysis have been successfully used in certain areas of computer systems, such as verifying the security properties of cryptographic and authentication protocols. However, formal models for computer systems in cyberspace, like networks, have hardly advanced. A highly regarded graduate textbook cites the Take-Grant model created in 1977 as one of the "current" examples of security modelling and analysis techniques. This model is rarely used in practice though. This research implements the Take-Grant Protection model's four de jure rules and Can Share predicate in the Prototype Veri cation System (PVS) which automates model checking and theorem proving. This facilitates the ability to test a given Take-Grant model against many systems which are modelled using digraphs. Two models, one with error checking and one without, are created to implement take-grant rules. The rst model that does not have error checking incorporated requires manual error checking. The second model uses recursion to allow for the error checking. The Can Share theorem requires further development.

Parametre knihy

17.51

Obľúbené z iného súdka



Osobný odber Bratislava a 12792 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: