Paper Info
Title
Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
Abstract
This paper further investigates the potential and practical applicability of abstract compilation in two different directions. First, we formally define an abstract compilation scheme for precise prediction of uncaught exceptions for a simple Java-like language; besides the usual user declared checked exceptions, the analysis covers the runtime ClassCastException. Second, we present a general implementation schema for abstract compilation based on coinductive CLP with variance annotation of user-defined predicates, and propose an implementation based on a Prolog prototype meta-interpreter, parametric in the solver for the subtyping constraints.
Year
DOI
Venue
2010
10.1007/978-3-642-18070-5_3
FoVeOOS
Keywords
Field
DocType
abstract compilation,different direction,runtime classcastexception,object-oriented language,simple java-like language,abstract compilation scheme,general implementation schema,practical applicability,precise prediction,coinductive clp,prolog prototype meta-interpreter,type inference,object oriented language
Programming language,Object-oriented programming,Computer science,Type inference,Constraint satisfaction problem,Theoretical computer science,Parametric statistics,Coinduction,Prolog,Solver,Constraint logic programming
Conference
Volume
ISSN
ISBN
6528
0302-9743
3-642-18069-8
Citations 
PageRank 
References 
12
0.66
20
Authors
4
Name
Order
Citations
PageRank
Davide Ancona172769.43
Andrea Corradi2151.05
Giovanni Lagorio321217.98
Ferruccio Damiani498971.30