Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?

Authors:
Davide Ancona;Andrea Corradi;Giovanni Lagorio;Ferruccio Damiani
Affiliations:
DISI, University of Genova, Italy;DISI, University of Genova, Italy;DISI, University of Genova, Italy;Dipartimento di Informatica, University of Torino, Italy
Venue:
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Year:
2010

Citing 15
Cited 7

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global flow analysis as a practical compilation tool

Journal of Logic Programming
Intersection and union types: syntax and semantics

Information and Computation
Type inference with constrained types

Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Featherweight Java: a minimal core calculus for Java and GJ

ACM Transactions on Programming Languages and Systems (TOPLAS)
An uncaught exception analysis for Java

Journal of Systems and Software
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Hm(x) type inference is clp(x) solving

Journal of Functional Programming
Type Inference by Coinductive Logic Programming

Types for Proofs and Programs
Coinductive Type Systems for Object-Oriented Languages

Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Constraint Handling Rules

Constraint Handling Rules
Complete coinductive subtyping for abstract compilation of object-oriented languages

Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
Coinductive logic programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Verifying complex continuous real-time systems with coinductive CLP(R)

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Co-logic programming: extending logic programming with coinduction

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Coinductive big-step operational semantics for type soundness of Java-like languages

Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs
Regular corecursion in Prolog

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Corecursive Featherweight Java

Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Soundness of object-oriented languages with coinductive big-step semantics

ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
Static single information form for abstract compilation

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Safe corecursion in coFJ

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Regular corecursion in Prolog

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

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.