Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a new fixpoint modal logic,  the visibly pushdown μ-calculus  (VP-μ), as an extension of the modal μ-calculus. The models of this logic are execution trees of structured programs where the procedure calls and returns are made visible. This new logic can express pushdown specifications on the model that its classical counterpart cannot, and is motivated by recent work on visibly pushdown languages [4].  show that our logic naturally captures several interesting program specifications in program verification and dataflow analysis. This includes a variety of program specifications such as computing combinations of local and global program flows, pre/post conditions of procedures, security properties involving the context stack, and interprocedural dataflow analysis properties. The logic can capture flow-sensitive and inter-procedural analysis, and it has constructs that allow skipping procedure calls so that  local flows  in a procedure can also be tracked. The logic generalizes the semantics of the modal μ-calculus by considering  summaries  instead of nodes as first-class objects, with appropriate constructs for concatenating summaries, and naturally captures the way in which pushdown models are model-checked. The main result of the paper is that the model-checking problem for VP-μ is effectively solvable against pushdown models with no more effort than that required for aker logics such as CTL.  also investigate the expressive por of the logic VP-μ:  show that it encompasses all properties expressed by a corresponding pushdown temporal logic on linear structures ( caret  [2]) as ll as by the classical μ-calculus. This makes VP-μ the most expressive known program logic for which algorithmic software model checking is feasible. In fact, the decidability of most known program logics (μ-calculus, temporal logics LTL and CTL,  caret , etc.) can be understood by their interpretation in the monadic second-order logic over trees. This is not true for the logic VP-μ, making it a new porful tractable program logic.
['Rajeev Alur', 'Swarat Chaudhuri', 'P. Madhusudan']
I am writing a research paper on a idea A fixpoint calculus for local and global program flows
[{"from": "human", "value": "I am writing a research paper on a idea A fixpoint calculus for local and global program flows"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  define a new fixpoint modal logic,  the visibly pushdown \u03bc-calculus  (VP-\u03bc), as an extension of the modal \u03bc-calculus. The models of this logic are execution trees of structured programs where the procedure calls and returns are made visible. This new logic can express pushdown specifications on the model that its classical counterpart cannot, and is motivated by recent work on visibly pushdown languages [4].  show that our logic naturally captures several interesting program specifications in program verification and dataflow analysis. This includes a variety of program specifications such as computing combinations of local and global program flows, pre/post conditions of procedures, security properties involving the context stack, and interprocedural dataflow analysis properties. The logic can capture flow-sensitive and inter-procedural analysis, and it has constructs that allow skipping procedure calls so that  local flows  in a procedure can also be tracked. The logic generalizes the semantics of the modal \u03bc-calculus by considering  summaries  instead of nodes as first-class objects, with appropriate constructs for concatenating summaries, and naturally captures the way in which pushdown models are model-checked. The main result of the paper is that the model-checking problem for VP-\u03bc is effectively solvable against pushdown models with no more effort than that required for aker logics such as CTL.  also investigate the expressive por of the logic VP-\u03bc:  show that it encompasses all properties expressed by a corresponding pushdown temporal logic on linear structures ( caret  [2]) as ll as by the classical \u03bc-calculus. This makes VP-\u03bc the most expressive known program logic for which algorithmic software model checking is feasible. In fact, the decidability of most known program logics (\u03bc-calculus, temporal logics LTL and CTL,  caret , etc.) can be understood by their interpretation in the monadic second-order logic over trees. This is not true for the logic VP-\u03bc, making it a new porful tractable program logic."}]