Sciweavers

46 search results - page 6 / 10
» Precise Fixpoint-Based Analysis of Programs with Thread-Crea...
Sort
View
74
Voted
ESOP
2007
Springer
15 years 3 months ago
Interprocedurally Analysing Linear Inequality Relations
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...
Helmut Seidl, Andrea Flexeder, Michael Petter
109
Voted
ECOOP
1995
Springer
15 years 1 months ago
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
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...
Jeffrey Dean, David Grove, Craig Chambers
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 3 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
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 ...
POPL
2008
ACM
15 years 9 months ago
Relevance heuristics for program analysis
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...
Kenneth L. McMillan
107
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
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...