In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Optimizing compilers for object-oriented languages apply static class analysis and other techniques to try to deduce precise information about the possible classes of the receivers...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...