PEQtest: testing functional equivalence

DOI10.1007/978-3-030-99429-7_11MaRDI QIDQ6535553zbMATH OpenFDO

Authors Marie-Christine Jakobs, Maik Wiesner

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99429-7_11

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Refactoring tools for functional languages
• A closer look at software refactoring using symbolic execution
• Searching Semantically Equivalent Code Fragments in Logic Programs
• Towards a Generic Framework for Trustworthy Program Refactoring
• Regression verification for unbalanced recursive functions

Cites work

• Abstract Semantic Differencing for Numerical Programs
• Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
• scientific article; zbMATH DE number 1929900 (Why is no real title available?)
• Modular demand-driven analysis of semantic difference for program versions
• Modular verification of procedure equivalence in the presence of memory allocation
• Simple relational correctness proofs for static analyses and program transformations
• TASS: the toolkit for accurate scientific software

This page was built for publication: PEQtest: testing functional equivalence

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