Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract#R##N##R##N#The application of formal verification in software engineering is limited because programs continue to evolve during the maintenance phase, thus rendering the original verification obsolete. Program decomposition schemes can be used to identify the parts of the modified program that need verification. The original program verification can be reused and combined with the verification of the parts of the modified program. Automatic decomposition of programs into independent computational threads called projections can be performed by utilizing program-dependence relations. These relations represent dependence information among the variables and statements of a program. The individual proofs of each projection can be combined to produce the verification of the entire program. After a modification, many of the original projections may still be present in the new program and they are not re-verified. Only new projections need verification which is usually easier than re-verifying the entire program.
['Rajeev Gopal', 'Stephen R. Schach']
I am writing a research paper on a idea Application of automatic decomposition schemes in proof maintenance for evolving programs
[{"from": "human", "value": "I am writing a research paper on a idea Application of automatic decomposition schemes in proof maintenance for evolving programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract#R##N##R##N#The application of formal verification in software engineering is limited because programs continue to evolve during the maintenance phase, thus rendering the original verification obsolete. Program decomposition schemes can be used to identify the parts of the modified program that need verification. The original program verification can be reused and combined with the verification of the parts of the modified program. Automatic decomposition of programs into independent computational threads called projections can be performed by utilizing program-dependence relations. These relations represent dependence information among the variables and statements of a program. The individual proofs of each projection can be combined to produce the verification of the entire program. After a modification, many of the original projections may still be present in the new program and they are not re-verified. Only new projections need verification which is usually easier than re-verifying the entire program."}]