Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Por is a RISC architecture developed by IBM, Freescale, and several other companies and implemented in a series of POWER processors. The architecture features a relaxed memory model providing very ak guarantees with respect to the ordering and atomicity of memory accesses. #R##N#Due to these aknesses, some programs that are correct under sequential consistency (SC) show undesirable effects when run under Por.  call these programs not robust against the Por memory model. Formally, a program is robust if every computation under Por has the same data and control dependencies as some SC computation. #R##N#Our contribution is a decision procedure for robustness of concurrent programs against the Por memory model. It is based on three ideas. First,  reformulate robustness in terms of the acyclicity of a happens-before relation. Second,  prove that among the computations with cyclic happens-before relation there is one in a certain normal form. Finally,  reduce the existence of such a normal-form computation to a language emptiness problem. Altogether, this yields a PSPACE algorithm for checking robustness against Por.  complement it by a matching lor bound to show PSPACE-completeness.
['Egor Derevenetc', 'Roland Meyer']
I am writing a research paper on a idea Robustness against Power is PSpace-complete
[{"from": "human", "value": "I am writing a research paper on a idea Robustness against Power is PSpace-complete"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Por is a RISC architecture developed by IBM, Freescale, and several other companies and implemented in a series of POWER processors. The architecture features a relaxed memory model providing very ak guarantees with respect to the ordering and atomicity of memory accesses. #R##N#Due to these aknesses, some programs that are correct under sequential consistency (SC) show undesirable effects when run under Por.  call these programs not robust against the Por memory model. Formally, a program is robust if every computation under Por has the same data and control dependencies as some SC computation. #R##N#Our contribution is a decision procedure for robustness of concurrent programs against the Por memory model. It is based on three ideas. First,  reformulate robustness in terms of the acyclicity of a happens-before relation. Second,  prove that among the computations with cyclic happens-before relation there is one in a certain normal form. Finally,  reduce the existence of such a normal-form computation to a language emptiness problem. Altogether, this yields a PSPACE algorithm for checking robustness against Por.  complement it by a matching lor bound to show PSPACE-completeness."}]