Andere Kunden interessierten sich auch für
![Program synthesis from domain specific object models]( "Program synthesis from domain specific object models")
Program synthesis from domain specific object models44,99 €![Logic Program Synthesis and Transformation]( "Logic Program Synthesis and Transformation")
Logic Program Synthesis and Transformation39,99 €![Domain Driven Program Evolution]( "Domain Driven Program Evolution")
Domain Driven Program Evolution38,99 €![How to Program in C++With 100 Examples]( "How to Program in C++With 100 Examples")
How to Program in C++With 100 Examples48,99 €![Knowledge Based Program Construction II]( "Knowledge Based Program Construction II")
Knowledge Based Program Construction II92,99 €![Program Analysis Techniques for Identifying Concurrency Errors]( "Program Analysis Techniques for Identifying Concurrency Errors")
Program Analysis Techniques for Identifying Concurrency Errors46,99 €![Quantum Computing by Practice]( "Quantum Computing by Practice")
Quantum Computing by Practice33,99 €
This dissertation presents accurate and scalable approaches to discover program dependences (relations) between various parts of the program and leveraging the dependences to improve development and maintenance tasks via program slicing (comprehension) and verification. The contents include new notions of control dependences that are suitable for modern program structures (e.g. non-terminating loops in reactive systems, exceptional control flow), a general algorithm to calculate data-based program dependences in concurrent programs, a parametric framework to describe program slicing algorithms, and the first stateful model checking algorithm that employs dynamic partial order reduction. The exposition employs illustrative examples, rigorous theoretical reasoning, and thorough experimental evaluation. The tools that embody the described techniques (and were used in the experimental evaluation) are freely available at http://indus.projects.cis.ksu.edu.