The Anatomy and Facets of Dynamic Policies

Information flow policies are often dynamic; the security concerns of a program will typically change during execution to reflect security-relevant events. A key challenge is how to best specify, and give proper meaning to, such dynamic policies. A large number of approaches exist that tackle that challenge, each yielding some important, but unconnected, insight. In this work we synthesise existing knowledge on dynamic policies, with an aim to establish a common terminology, best practices, and frameworks for reasoning about them. We introduce the concept of facets to illuminate subtleties in the semantics of policies, and closely examine the anatomy of policies and the expressiveness of policy specification mechanisms. We further explore the relation between dynamic policies and the concept of declassification.Comment: Technical Report of publication under the same name in Computer Security Foundations (CSF) 201

An Algebra of Synchronous Scheduling Interfaces

In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.Comment: In Proceedings FIT 2010, arXiv:1101.426

Simulation Models for Analyzing the Dynamic Costs of Process-aware Information Systems

Introducing process-aware information systems (PAIS) in enterprises (e.g., workflow management systems, case handling systems) is associated with high costs. Though cost estimation has received considerable attention in software engineering for many years, it is difficult to apply existing approaches to PAIS. This difficulty particularly stems from the inability of existing estimation techniques to deal with the complex interplay of the many technological, organizational and project-driven factors which emerge in the context of PAIS. In response to this problem, this paper proposes an approach which utilizes simulation models for investigating the dynamic costs of PAIS engineering projects. We motivate the need for simulation, discuss the development and execution of simulation models, and give an illustrating example. The present work has been accomplished in the EcoPOST project, which deals with the development of a comprehensive evaluation framework for analyzing PAIS engineering projects from a value-based perspective

Exploring the Dynamic Costs of Process-aware Information Systems through Simulation

Introducing process-aware information systems (PAIS) in enterprises (e.g., workflow management systems, case handling systems) is associated with high costs. Though cost evaluation has received considerable attention in software engineering for many years, it is difficult to apply existing evaluation approaches to PAIS. This difficulty particularly stems from the inability of these techniques to deal with the complex interplay of the many technological, organizational and project-driven factors which emerge in the context of PAIS engineering projects. In response to this problem this paper proposes an approach which utilizes simulation models for investigating costs related to PAIS engineering projects. We motivate the need for simulation, discuss the design and execution of simulation models, and give an illustrating example

Data Workflow - A Workflow Model for Continuous Data Processing

Online data or streaming data are getting more and more important for enterprise information systems, e.g. by integrating sensor data and workflows. The continuous flow of data provided e.g. by sensors requires new workflow models addressing the data perspective of these applications, since continuous data is potentially infinite while business process instances are always finite.\ud In this paper a formal workflow model is proposed with data driven coordination and explicating properties of the continuous data processing. These properties can be used to optimize data workflows, i.e., reducing the computational power for processing the workflows in an engine by reusing intermediate processing results in several workflows

Mission Analysis Program for Solar Electric Propulsion (MAPSEP). Volume 3: Program manual

The internal structure of MAPSEP is described. Topics discussed include: macrologic, variable definition, subroutines, and logical flow. Information is given to facilitate modifications to the models and algorithms of MAPSEP