Sciweavers

578 search results - page 53 / 116
» Analysis of Programs with Exception-Handling Constructs
Sort
View
POPL
2009
ACM
14 years 9 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
POPL
2010
ACM
13 years 9 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
POPL
1994
ACM
14 years 26 days ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 3 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
ICSE
2010
IEEE-ACM
13 years 10 months ago
An exploratory study of fault-proneness in evolving aspect-oriented programs
This paper presents the results of an exploratory study on the fault-proneness of aspect-oriented programs. We analysed the faults collected from three evolving aspect-oriented sy...
Fabiano Cutigi Ferrari, Rachel Burrows, Otá...