Information flow analysis in a discrete-time process algebra

R. Focardi, R. Gorrieri, F. Martinelli
Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13  
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably AE , are reformulated here in a realtime setting. This is done by enhancing the Security Process Algebra of [6, 10] with some extra constructs to model real-time systems (in a discrete time setting); and then by studying the natural extensions of those properties in this enriched setting. We prove essentially the same results known for the untimed case: ordering relation
more » ... properties, compositionality aspects, partial model checking techniques. Finally, we illustrate a case study of a system that presents no information flows when analyzed without considering timing constraints. But, when the specification is refined with time, some interesting information flows are detected.
doi:10.1109/csfw.2000.856935 dblp:conf/csfw/FocardiGM00 fatcat:ye72rob4bzhino7o7x2562lz3m