Dependence Analysis of Concurrent Programs Based on Reachability Graph and Its Applications

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24685-5_52
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Dependence Flow Graph for Analysis of Aspect- Oriented Programs

International Journal of Software Engineering & Applications
2014English

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Optimal Time-Bounded Reachability Analysis for Concurrent Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

On Cylindrical Graph Construction and Its Applications

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2016English

Optimal Dyck Reachability for Data-Dependence and Alias Analysis

Proceedings of the ACM on Programming Languages
2018English

A Generic Graph Model for WCET Analysis of Multi-Core Concurrent Applications

Journal of Software Engineering and Applications
2016English

Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On Sequentializing Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy