This paper presents a method for deriving an expression from the lowlevel code compiled from an expression in a high-level language. The input is a low-level control flow graph (CFG) and the derived expression is in a form that can be used as input to an automatic theorem prover. The method is useful for program verification systems that take as input both programs and specifications after they...

A complex fuzzy set (CFS) is described by a complex-valued truth membership function, which combination of standard true function plus phase term. In this paper, we extend the idea graph (FG) to (CFG). The CFS complexity arises from variety values that its can attain. contrast range expanded plane’s unit circle rather than [0,1]. As result, provides mathematical structure for representing in te...

We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an u...

One common approach to test sequence generation for structurally testing concurrent programs involves constructing a reachability graph (RG) and selecting a set of paths from the graph to satisfy some coverage criterion. It is often suggested that test sequence generation methods for testing sequential programs based on a control flow graph (CFG) can also be used to select paths from an RG for ...

This paper presents a (partial) solution to the case study on Program Comprehension, proposed in the GraBaTs’09 contest. Our tool of choice is GROOVE, a graph transformation tool initially designed as a model checker for graph grammars. GROOVE has been under development for several years and new features are being implemented. One of our current interests is on program analysis and model transf...

We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an u...

Understanding control ows in a computer program is essential for many software engineering tasks such as testing, debugging, reverse engineering, and maintenance. In this paper, we present a control ow analysis technique to analyze the control ow in Java bytecode. To perform the analysis, we construct a control ow graph (CFG) for Java bytecode not only at the intraprocedural level but also at t...

Depending on the role of software in everyday life, the cost of a software failure can sometimes be unaffordable. During system execution, errors may occur in system components and failures may be manifested due to these errors. These errors differ with respect to their effects on system behavior and consequent failure manifestation manners. Predicting failures before their manifestation is imp...

In the context of software quality assessment, this paper proposes original flow analyses which propagate numerical estimates of blocking risks along an inter-procedural Control Flow Graph (CFG) and which combine these estimates along the different CFG paths using fuzzy logics operations. Two specialized analyses can be further defined in terms of definite and possible flow analysis. The defini...

Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program adm...