Idea: Unwinding Based Model-Checking and Testing for Non-Interference on EFSMs
Paper in proceeding, 2015

Undesired flows of information between different sensitivity levels or domains can seriously compromise the security of a system. Moreover, even if specifications are secure, unwanted flows can still be present in implementations. In this paper we present a model-based technique to discover unwanted information flows in specifications and to test systems for unwanted flows. We base our approach on an unwinding relation for Extended Finite State Machines. We preliminary validate our approach by means of an implementation that allows us to benchmark the efficiency of our model-checking algorithm.


M. Ochoa

J. Cuellar

A. Pretschner

Per Hallgren

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 8978 34-42
978-3-319-15618-7 (ISBN)

Subject Categories

Software Engineering





More information

Latest update

3/2/2022 6