Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Missing or faulty exception handling has caused a number of spectacular system failures and is a major cause of software failures in extensively tested critical systems. Prior wor...
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Reactive integrated development environments for software engineering have lead to an increase in productivity and quality of programs produced. They have done so by replacing the...
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...