In computer science methods to aid learning are very important, because abstract models are used frequently. For this conventional teaching methods do not suffice. We have develope...
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
Abstract. An overview of the concept of program similarity is presented. It divides similarity into two types--syntactic and semantic-and provides a review of eight categories of m...
Andrew Walenstein, Mohammad El-Ramly, James R. Cor...
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...