Static checker which is able to detect locking problems, interrupts enabling/disabling problems, unnecessary check optimizations and points-to problems like null pointer dereference and memory leaks
Algorithm description: if(node is marked as visited) -> stop process and ask for another from queue if(node has only one predecessor) { -> process node's element and mark it as visited } else { if(all node's predecessors are visited) { -> try to join all nodes with same CFGNode -> process actual node's element and mark it as visited } else { if(predecessor's is part of a cycle
Provides static method buildErrorList which compute the checker-errors from automata states at PattenLocations assigned to matching source code locacions by use of error transition rules defined in XML automata definition file