Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Applying Automated Theorem Proving to Computer Security

Applying Automated Theorem Proving to Computer Security

McElroy, Kelly

Paperback

FictionGeneral ComputersComputer Security

ISBN10: 1288254504
ISBN13: 9781288254507
Publisher: Biblioscholar
Published: Nov 9 2012
Pages: 132
Weight: 0.43
Height: 0.28 Width: 6.14 Depth: 9.21
Language: English

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.

Also from

McElroy, Kelly

View All

Also in

Computer Security

View All