Andere Kunden interessierten sich auch für
![Symbolic Computation Techniques for Large Expressions from Math. and Engineering]( "Symbolic Computation Techniques for Large Expressions from Math. and Engineering")
Symbolic Computation Techniques for Large Expressions from Math. and Engineering51,99 €![Symbolic Approaches to Modeling and Analysis of Biological Systems]( "Symbolic Approaches to Modeling and Analysis of Biological Systems")
Symbolic Approaches to Modeling and Analysis of Biological Systems166,99 €![Modular Algorithms in Symbolic Summation and Symbolic Integration]( "Modular Algorithms in Symbolic Summation and Symbolic Integration")
Modular Algorithms in Symbolic Summation and Symbolic Integration40,99 €![Neuro Symbolic Reasoning and Learning]( "Neuro Symbolic Reasoning and Learning")
Neuro Symbolic Reasoning and Learning33,99 €![Symbolic Computing - Theory and Applications]( "Symbolic Computing - Theory and Applications")
Symbolic Computing - Theory and Applications49,99 €![Artificial Intelligence and Symbolic Mathematical Computing]( "Artificial Intelligence and Symbolic Mathematical Computing")
Artificial Intelligence and Symbolic Mathematical Computing40,99 €![Parallel and Distributed Computing for Symbolic and Irregular Applications - Proceedings of the International Workshop Pdsia  (Tm)99]( "Parallel and Distributed Computing for Symbolic and Irregular Applications - Proceedings of the International Workshop Pdsia  (Tm)99")
Parallel and Distributed Computing for Symbolic and Irregular Applications - Proceedings of the International Workshop Pdsia  (Tm)99152,99 €
Static program analysis aims to determine the dynamic behavior of programs without actually executing them. Symbolic analysis is an advanced static program analysis technique that has been successfully applied to memory leak detection, compilation of parallel programs, detection of superfluous bound checks, variable aliases and task deadlocks, and to worst-case execution time analysis. The symbolic analysis information is invaluable for optimizing compilers, code generators, program verification, testing and debugging.In this book we take a novel algebra-based approach to the symbolic analysis of imperative programming languages. Our approach employs path expression algebra to compute the complete control and data flowanalysis information valid at a given program point. This information is then provided for subsequent domain-specific analyses. Our approach derives solutions for arbitrary (even intra-loop) nodes ofreducible and irreducible control flow graphs. We prove the correctness of our analysis method. Experimental results show that the problem sizes arising from real-world applications such as the SPEC95 benchmark suite are tractable for our symbolic analysis method.