This paper shows how to achieve, under certain conditions, abstract-interpretation ms that enjoy the best possible precision for a given abstraction. The key idea is a simple proce...
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Symbolic non-deterministic planning represents action effects as sets of possible next states. In this paper, we move toward a more probabilistic uncertainty model by distinguishi...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...
We study the inference on the interesting association rules. Then we define the concept of the representative basis for interesting association rules extracted from a dataset D, a...