Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Backward compatibility of class libraries ensures that an old implementation of a library can safely be replaced by a new implementation without breaking existing clients. #R##N#Formal reasoning about backward compatibility requires an adequate semantic model to compare the behavior of two library implementations.#R##N#In the object-oriented setting with inheritance and callbacks, finding such models is difficult as the interface beten library implementations and clients are complex.#R##N#Furthermore, handling these models in a way to support practical reasoning requires appropriate verification tools.#R##N##R##N#This thesis proposes a formal model for library implementations and a reasoning approach for backward compatibility that is implemented using an automatic verifier. The first part of the thesis develops a fully abstract trace-based semantics for class libraries of a core sequential object-oriented language. Traces abstract from the control flow (stack) and data representation (heap) of the library implementations. The construction of a most general context is given that abstracts exactly from all possible clients of the library implementation.#R##N#Soundness and completeness of the trace semantics as ll as the most general context are proven using specialized simulation relations on the operational semantics. The simulation relations also provide a proof method for reasoning about backward compatibility.#R##N#The second part of the thesis presents the implementation of the simulation-based proof method for an automatic verifier to check backward compatibility of class libraries written in Java. The approach works for complex library implementations, with recursion and loops, in the setting of unknown program contexts. The verification process relies on a coupling invariant that describes a relation beten programs that use the old library implementation and programs that use the new library implementation. The thesis presents a specification language to formulate such coupling invariants. Finally, an application of the developed theory and tool to typical examples from the literature validates the reasoning and verification approach.
['Yannick Welsch']
I am writing a research paper on a idea Reasoning about Backward Compatibility of Class Libraries
[{"from": "human", "value": "I am writing a research paper on a idea Reasoning about Backward Compatibility of Class Libraries"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Backward compatibility of class libraries ensures that an old implementation of a library can safely be replaced by a new implementation without breaking existing clients. #R##N#Formal reasoning about backward compatibility requires an adequate semantic model to compare the behavior of two library implementations.#R##N#In the object-oriented setting with inheritance and callbacks, finding such models is difficult as the interface beten library implementations and clients are complex.#R##N#Furthermore, handling these models in a way to support practical reasoning requires appropriate verification tools.#R##N##R##N#This thesis proposes a formal model for library implementations and a reasoning approach for backward compatibility that is implemented using an automatic verifier. The first part of the thesis develops a fully abstract trace-based semantics for class libraries of a core sequential object-oriented language. Traces abstract from the control flow (stack) and data representation (heap) of the library implementations. The construction of a most general context is given that abstracts exactly from all possible clients of the library implementation.#R##N#Soundness and completeness of the trace semantics as ll as the most general context are proven using specialized simulation relations on the operational semantics. The simulation relations also provide a proof method for reasoning about backward compatibility.#R##N#The second part of the thesis presents the implementation of the simulation-based proof method for an automatic verifier to check backward compatibility of class libraries written in Java. The approach works for complex library implementations, with recursion and loops, in the setting of unknown program contexts. The verification process relies on a coupling invariant that describes a relation beten programs that use the old library implementation and programs that use the new library implementation. The thesis presents a specification language to formulate such coupling invariants. Finally, an application of the developed theory and tool to typical examples from the literature validates the reasoning and verification approach."}]