Thesis Topic Details
Topic ID: |
3305 | |
Title: |
QuickCheck for security definitions | |
Supervisor: |
Kai Engelhardt | |
Research Area: |
Security | |
| Associated Staff | ||
|---|---|---|
Assessor: |
Manuel Chakravarty | |
| Topic Details | ||
Status: |
Active | |
Type: |
R & D | |
Programs: |
CS CE SE | |
Group Suitable: |
No | |
Industrial: |
No | |
Pre-requisites: |
-- | |
Description: |
There are almost more definitions of security than there are security researchers. Often the relationship between any given pair of definitions is unclear or hidden away in some hard-to-find paper. The most natural way to separate two definitions is by way of an example system that satisfies one definition but not the other.QuickCheck was originally designed to aid software testing by randomising test case generation for Haskell programs. Nowadays it has been re-implemented for many other languages and abused for various other purposes.For this thesis topic, a prototype tool is to be designed and implemented that takes as input two security definitions (and optionally a security policy) and produces as output a small system that satifies the first but not the second definition if such a system exists and could be found using the QuickCheck heuristics. It is recommended to undertake the development in Haskell or another functional language because the QuickCheck implementation for those appear to be most mature. | |
Comments: |
-- | |
| Past Student Reports | ||
| Takashi MATSUOKA in s2, 2012 QuickCheck for security definitions |
||
Download report from the CSE Thesis Report Library NOTE: only current CSE students can login to view and select reports to download. | ||