Towards Security Assurance in Round-Trip Engineering: A Type-Based Approach
Author(s) -
Jaime A. Pavlich-Mariscal,
María Consuelo Franky,
Ariel Pablo Lopez
Publication year - 2013
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2013.02.007
Subject(s) - computer science , software security assurance , mathematical proof , programming language , software engineering , correctness , consistency (knowledge bases) , sketch , code (set theory) , information security , computer security , algorithm , security service , geometry , mathematics , set (abstract data type) , artificial intelligence
ecurity assurance is a property that ensures that the application code behaves consistently with the access control policy specified at the design level. Security assurance proofs are valid as long as software engineers do not modify the generated code. This assumption does not hold in Round-Trip Engineering, since programmers may modify the generated code and the models are automatically re-generated. This paper proposes a round-trip engineering approach for access control that preserves security assurance both when generating code from models and vice versa. The approach is to extend programming languagesʼ typing mechanisms with additional rules that ensure consistency between models and code, even when code is arbitrarily modified by programmers. This paper presents a formal description of the solution and an initial sketch of the required proofs of correctness. Ongoing work is the development of a prototype to automate most of the process and its validation in a case study
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom