Optimal Time-Bounded Reachability Analysis for Concurrent Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-17465-1_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Optimal Dyck Reachability for Data-Dependence and Alias Analysis

Proceedings of the ACM on Programming Languages
2018English

Temporal Analysis of Time Bounded Digital Systems

English

Sensitivity Analysis for Linear Systems Based on Reachability Sets

2019English

Axiomatic Characterization of Trace Reachability for Concurrent Objects

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Reachability Analysis of Communicating Pushdown Systems

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Probabilistic Reachability Analysis for Large Scale Stochastic Hybrid Systems

2007English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Context-Bounded Analysis for Concurrent Programs With Dynamic Creation of Threads

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy