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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-00768-2_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Roadrunner Dynamic Analysis Framework for Concurrent Programs

2010English

A Lightweight Deadlock Analysis for Programs With Threads and Reentrant Locks

Science of Computer Programming
Software
2019English

A Lightweight Deadlock Analysis for Programs With Threads and Reentrant Locks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Optimal Time-Bounded Reachability Analysis for Concurrent Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Bounded Expectations: Resource Analysis for Probabilistic Programs

2018English

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Nonlinear Programs With Positively Bounded Jacobians

1964English

Type Systems for Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy