Dependence analysis for inferring information flow properties in Spark ADA programs
dc.contributor.author | Thiagarajan, Hariharan | |
dc.date.accessioned | 2011-12-01T14:00:32Z | |
dc.date.available | 2011-12-01T14:00:32Z | |
dc.date.graduationmonth | December | |
dc.date.issued | 2011-12-01 | |
dc.date.published | 2011 | |
dc.description.abstract | With the increase in development of safety and security critical systems, it is important to have more sophisticated methods for engineering such systems. It can be difficult to understand and verify critical properties of these systems because of their ever growing size and complexity. Even a small error in a complex system may result in casualty or significant monetary loss. Consequently, there is a rise in the demand for scalable and accurate techniques to enable faster development and verification of high assurance systems. This thesis focuses on discovering dependencies between various parts of a system and leveraging that knowledge to infer information flow properties and to verify security policies specified for the system. The primary contribution of this thesis is a technique to build dependence graphs for languages which feature abstraction and refinement. Inter-procedural slicing and inter-procedural chopping are the techniques used to analyze the properties of the system statically. The approach outlined in this thesis provides a domain-specific language to query the information flow properties and to specify security policies for a critical system. The spec- ified policies can then be verified using existing static analysis techniques. All the above contributions are integrated with a development environment used to develop the critical system. The resulting software development tool helps programmers develop, infer, and verify safety and security systems in a single unified environment. | |
dc.description.advisor | John M. Hatcliff | |
dc.description.degree | Master of Science | |
dc.description.department | Department of Computing and Information Sciences | |
dc.description.level | Masters | |
dc.identifier.uri | http://hdl.handle.net/2097/13187 | |
dc.language.iso | en_US | |
dc.publisher | Kansas State University | |
dc.rights | © the author. This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Information flow | |
dc.subject | Dependence graph | |
dc.subject | Policy language | |
dc.subject | Specification and verification | |
dc.subject.umi | Computer Science (0984) | |
dc.title | Dependence analysis for inferring information flow properties in Spark ADA programs | |
dc.type | Thesis |