Phone: (+61 8) 6488 1945
Fax: (+61 8) 6488 1089
Applications of modal logic to Computer Security
John has just started his PhD. He is currently looking at proofs of completeness for modal logics. His supervisor believes this is necessary for effective use of modal logics. He has briefly looked at pre-existing proofs of security for cryptographic key-exchange; existing modal logic prove construction software; Typed Assembly Language, a mark-up for assembly language programs that proves that the assembly language program e.g. memory safe. He is also presenting a paper regarding the approximability of "Dodgson's rule", a voting procedure for which determining whether a Candidate is a winner is known to be an NP-hard problem.