Business processes are becoming more and more complex and at the same time their correctness is becoming a critical issue: The costs of errors in business information systems are g...
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
The Data Driven Design Optimization Methodology (DDDOM) is a Dynamic Data Driven Application System (DDDAS) developed for engineering design optimization. The DDDOM synergizes expe...
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...