The security of a network protocol crucially relies on the scenario in which the protocol is deployed. This paper describes syntactic constructs for modelling network scenarios and presents an automated analysis tool, which can guarantee that security properties hold in all of the (infinitely many) instances of a scenario. The tool is based on control flow analysis of the process calculus LySa ...

A control flow graph represents all the flows of control that may arise during program execution. Since exception mechanism in Java induces flows of control, exception induced control flow have to be incorporated in control flow graph. In the previous research to construct control flow graph, they compute exception flow and normal flow at the same time while computing control flow information. ...

A new algorithm is introduced for analysing possible nesting in Mobile Ambients calculus. It improves both time and space complexities of the technique proposed by Nielson and Seidl. The improvements are achieved by enhancing the data structure representations, and by reducing the computation to the Control Flow Analysis constraints that are effectively necessary to get to the least solution.

Precise fluid flow control is one of the most important aspects of many chemical processing systems, both reactive and analytical. Recent research has led to a sensor capable of very precisely measuring mass flows up to 1g/h, based on the Coriolis principle. However, applying such a measurement in a flow control system is not yet possible, as valves capable of regulating such small flows do not...

A type flaw attack on a security protocol is an attack where an honest principal is cheated on interpreting a field in a message as the one with a type other than the intended one. In this paper, we shall present an extension of theLySa calculus with tags attached to each field, indicating the intended types. We developed a control flow analysis for analysing the extended LySa, which over-appro...

The problem of finding the dominators in a control-flow graph has a long history in the literature. The original algorithms suffered from a large asymptotic complexity but were easy to understand. Subsequent work improved the time bound, but generally sacrificed both simplicity and ease of implementation. This paper returns to a simple formulation of dominance as a global data-flow problem. Som...

In the S project, core calculi have been adopted as a linguistic means to model and analyze service oriented applications. The present chapter reports about the static analysis techniques developed for the S sessionoriented core calculi CaSPiS and CC. In particular, it presents a type system for client progress and control flow analysis in CaSPiS and type systems for conversation ...

Control-flow analysis of business process models requires to check the absence of lack of synchronization. We use workflow graphs, which may contain inclusive OR gateways, to represent the control-flow of business process models. We structurally characterize lack of synchronization in an acyclic workflow graph. Based on this characterization, we show how to detect lack of synchronization in qua...

Control-flow analyses statically determine the control-flow of programs. This is a nontrivial problem for higher-order programming languages. This work attempts to leverage the power of SAT solvers to answer questions regarding control-flow. A brief overview of a traditional control-flow analysis is presented. Then an encoding is given which has the property that any satisfying assignment will ...

In this paper, I present a summary on some works that utilized static analysis techniques for understanding biological systems. Control flow analysis, context dependent analysis, and other techniques were employed to investigate the properties of BioAmbients. In this summary report, I tried to introduce the ideas and explain the techniques used in the subject papers. This summary will highlight...