Sciweavers

1914 search results - page 171 / 383
» Verification by Abstract Interpretation
Sort
View
110
Voted
ESOP
1998
Springer
15 years 5 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
93
Voted
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
14 years 11 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
107
Voted
CASSIS
2005
Springer
15 years 6 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
ICFP
2005
ACM
16 years 24 days ago
Recursive type generativity
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
Derek Dreyer
91
Voted
SIGIR
2009
ACM
15 years 7 months ago
Feature selection for automatic taxonomy induction
Most existing automatic taxonomy induction systems exploit one or more features to induce a taxonomy; nevertheless there is no systematic study examining which are the best featur...
Hui Yang, Jamie Callan