Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present an algorithm that constructs a finite state abstract program from a given, possibly infinite state, concrete program by means of a syntactic program transformation. Starting with an initial set of predicates from a specification, the algorithm iteratively computes the predicates required for the abstraction relative to that specification. These predicates are represented by boolean variables in the abstract program.  show that the method is sound, in that the abstract program is always guaranteed to simulate the original.  also show that the method is complete, in that, if the concrete program has a finite abstraction with respect to simulation (bisimulation) equivalence, the algorithm can produce a finite simulation-equivalent (bisimulation-equivalent) abstract program. Syntactic abstraction has two key advantages: it can be applied to infinite state programs or programs with large data paths, and it permits the effective application of other reduction methods for model checking.  show that our method generalizes several known algorithms for analyzing syntactically restricted, data-insensitive programs.
['Kedar S. Namjoshi', 'Robert P. Kurshan']
I am writing a research paper on a idea Syntactic program transformations for automatic abstraction
[{"from": "human", "value": "I am writing a research paper on a idea Syntactic program transformations for automatic abstraction"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present an algorithm that constructs a finite state abstract program from a given, possibly infinite state, concrete program by means of a syntactic program transformation. Starting with an initial set of predicates from a specification, the algorithm iteratively computes the predicates required for the abstraction relative to that specification. These predicates are represented by boolean variables in the abstract program.  show that the method is sound, in that the abstract program is always guaranteed to simulate the original.  also show that the method is complete, in that, if the concrete program has a finite abstraction with respect to simulation (bisimulation) equivalence, the algorithm can produce a finite simulation-equivalent (bisimulation-equivalent) abstract program. Syntactic abstraction has two key advantages: it can be applied to infinite state programs or programs with large data paths, and it permits the effective application of other reduction methods for model checking.  show that our method generalizes several known algorithms for analyzing syntactically restricted, data-insensitive programs."}]