8 research outputs found
Collected Size Semantics for Functional Programs over Polymorphic Nested Lists
Contains fulltext :
75338.pdf (preprint version ) (Open Access)10th symposium on trends in functional programming TFP 2009 SELYE JANOS UNIVERSITY, KOMARNO, SLOVAKIA, JUNE 2-4, 2009, 02 juni 200
A Formal Connection between Security Automata and JML Annotations
Security automata are a convenient way to describe security
policies. Their typical use is to monitor the execution of an
application, and to interrupt it as soon as the security policy is
violated. However, run-time adherence checking is not always
convenient. Instead, we aim at developing a technique to verify
adherence to a security policy statically. To do this, we consider
a security automaton as specification, and we generate JML
annotations that inline the monitor~--~as a specification~--~into the
application. We describe this translation and prove preservation of
program behaviour, i.e., if monitoring does not reveal a
security violation, the generated annotations are respected by the
program.
The correctness proofs are formalised using the PVS theorem prover.
This reveals several subtleties to be considered in the definition of the
translation algorithm and in the program requirements
Preemption Abstraction: A Lightweight Approach to Modelling Concurrency
Contains fulltext :
76014.pdf (publisher's version ) (Closed access)Formal Methods for Industrial Critical Systems (FMICS 2009), 2 november 201