Sciweavers

3053 search results - page 322 / 611
» A Logic of Abstract Argumentation
Sort
View
ICLP
2003
Springer
16 years 17 hour ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
LICS
1994
IEEE
15 years 11 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
ASWC
2006
Springer
15 years 10 months ago
Modular Ontologies - A Formal Investigation of Semantics and Expressivity
With the growing interest in modular ontology languages to address the need for collaborative development, integration, and use of ontologies on the Web, there is an urgent need fo...
Jie Bao, Doina Caragea, Vasant Honavar
172
Voted
WCRE
2007
IEEE
16 years 1 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 6 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara