Shin Nakajima

Model-Checking Behavioral Specification of BPEL Applications

To provide a framework to compose lots of specialised services flexibly, BPEL is proposed to describe Web service flows. Since the Web service flow description is basically a distributed collaboration, writing correct programs in BPEL is not easy. Verifying BPEL program prior to its execution is essential. This paper proposes a method to extract the behavioral specification from a BPEL appliation program and to analyze it by using the SPIN model checker. With the adequate abstraction method and support for DPE, the method can analyze all the four example cases in the BPEL standard document.

Semi-automated diagnosis of FODA feature diagram

A semi-automated model diagnostic method is proposed for FODA feature diagram, a primary modeling notation used in Software Product Line Engineering. The proposed method includes a propositional logic interpretation of the feature diagram and a diagram-slicing algorithm for locating bugs. In addition to logic-based formalization of the semantics, the novelty of our approach is that it uses heuristics taking into account the diagram graph structure. Although human intelligence is always involved in removing bugs from feature diagrams, the checking and diagnosing of them can be automated to some extent.

Model Checking of Energy Consumption Behavior

Energy consumption is one of the primary non-functional properties to be addressed early in software system development. Model-based analysis methods are introduced in order to supplement the current practice of runtime profiler techniques. In the present paper, the energy consumption analysis is classified as a duration bounded cost constraint problem. Specifically, behavioral contracts based on Power Consumption Automata and properties written in terms of weighted linear temporal logic with freeze quantifiers are proposed. In addition, the problem is solved by model-checking of such logic formulas with respect to the automaton.

A Formula-Based Approach for Automatic Fault Localization of Imperative Programs

Among various automatic fault localization methods, two of them are specifically noticed, coverage-based and formula-based. While the coverage-based method relies on statistical measures, the formula-based approach is an algorithmic method being able to provide fine-grained information account for identified root causes. The method combines the SAT-based formal verification techniques with the Reiter’s model-based diagnosis theory. This paper adapts the formula-based fault localization method, and improves the efficiency of computing the potential root causes by using the push & pop mechanism of the Yices solver. The technique is particularly useful for programs with multiple faults. We implemented the method in a tool, SNIPER, which was applied to the TCAS benchmark. All single and multiple faults were successfully identified and discriminated by using the original test cases of the TCAS.

Using Real-Time Maude to Model Check Energy Consumption Behavior

Energy consumption is one of the primary non-functional concerns, especially for application programs running on systems that have limited battery capacity. A model-based analysis of energy consumption is introduced at early stages of development. As rigorous formal models of this, the power consumption automaton and a variant of linear temporal logic are proposed. Detecting unexpected energy consumption is then reduced to a model checking problem, which is unfortunately undecidable in general. This paper introduces some restrictions to the logic formulas representing energy consumption properties so that an automatic analysis is possible with Real-Time Maude.

Refinement and Proof Based Development ofźSystems Characterized by Continuous Functions

The specification of cyber-physical systems usually relies on continuous functions over dense real numbers whereas their implementation is discrete. Proving the correctness of the discrete implementation with respect to the continuous specification remains a challenge in the presence of dense real numbers. In this paper, we propose a refinement-based formal method, relying on Event-B, for such developments. We illustrate our proposal with the development of a simple stability controller for a generic plant model. The continuous function that models the system behavior is refined as a discrete model of the same kind preserving stability expressed as a safety invariants of the continuous model. The obtained discrete model uses discrete time instants modeled on

Hidden Markov model based automated fault localization for integration testing

mathbb {N}

A Formula-based Approach for Automatic Fault Localization of Multi-fault Programs

, whereas the continuous model is based on dense time on