Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
From MaRDI portal
Publication:3067532
Recommendations
- Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas
- Type Inference by Coinductive Logic Programming
- scientific article; zbMATH DE number 549959
- Static analysis, abstract interpretation and verification in (constraint logic) programming
- scientific article; zbMATH DE number 2086518
Cites work
- Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinductive Logic Programming
- Constraint Handling Rules
- Fundamental properties of infinite trees
- HM(X) type inference is CLP(X) solving
- Idealized coinductive type systems for imperative object-oriented programs
- Intersection and union types: Syntax and semantics
- Type Inference by Coinductive Logic Programming
- Verifying complex continuous real-time systems with coinductive CLP(R)
Cited in
(4)- Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
- Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas
- Idealized coinductive type systems for imperative object-oriented programs
- Static single information form for abstract compilation
This page was built for publication: Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067532)