BEAM is a tool for finding errors in C++ programs by source code analysis. It uses data flow analysis to find paths leading to an error. Classical data flow analysis propagates information along all paths, including non-executable ones, which results in reporting errors that are not real. To avoid this problem, BEAM restricts data flow analysis to paths that are executable, and in addition also...

Finding disjoint paths in graphs is a problem that has attracted considerable attention from at least three perspectives: graph theory, VLSI design and network routing/flow. The corresponding literature is extensive. In this chapter we focus mostly on results on offline approximation algorithms for problems on general graphs as influenced from the network flow perspective. Surveys examining the...

Many program verification, testing and performance prediction techniques rely on analysis of statically-identified control-flow paths. However, some such paths may be ‘dead’ because they can never be followed at run time, and should therefore be excluded from analysis. It is shown how the formal semantics of those statements comprising a path provides a sound theoretical foundation for identifi...

Software testing is an integral part of the software development cycle. Software testing involves designing a set of test cases. In white box testing, test cases are usually designed based using path testing. The basis path testing approach involves generation of test cases from a set of independent paths. Each test case is forced to execute a certain test path of the control flow graph. Some c...

Due to limited resources and challenging time schedule, software testing is usually performed in pressure to assure the fulfilment of the software requirements. Test case generation is a crucial activity of the software testing phase. Testing of all paths from Control Flow Graph is not feasible in software testing, due to limited time and cost. Generation of optimized test paths is a challengin...

We define and study the noncommutative spectral flow for paths of regular selfadjoint Fredholm operators on a Hilbert C∗-module. We give an axiomatic description and discuss some applications. One of them is the definition a noncommutative Maslov index for paths of Lagrangians which appears in a splitting formula for the spectral flow. Analogously we study the spectral flow for odd operators on...