LP structures on type lattices and some refactoring problems

DOI10.1134/S0361768809040021MaRDI QIDQ1040323zbMATH OpenFDO

Authors S. D. Makhortov

Publication date 24 November 2009

Published in Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Logical aspects of lattices and related structures (03G10)

Recommendations

• LP-structures analysis: substantiation of refactoring in object-oriented programming
• Algebraic reasoning for object-oriented programming
• scientific article; zbMATH DE number 5065675
• Refinement types for program analysis
• Efficient inference of object types

Cites work

• scientific article; zbMATH DE number 1554928 (Why is no real title available?)
• scientific article; zbMATH DE number 5065677 (Why is no real title available?)
• Algebraic semantics of an imperative programming language
• Semantics of untyped functional programs
• The Transitive Reduction of a Directed Graph

Cited in

(1)

• LP-structures analysis: substantiation of refactoring in object-oriented programming

This page was built for publication: LP structures on type lattices and some refactoring problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040323)