Reducing Extension Edges of Concurrent Programs for Reachability Analysis

2018 ◽  
pp. 386-401
Author(s):  
Cong Tian ◽  
Jiaying Wang ◽  
Zhenhua Duan ◽  
Liang Zhao
Keyword(s):  
Reachability Analysis ◽  
Concurrent Programs

scholarly journals Reachability Analysis of Asynchronous Dynamic Pushdown Networks Based on Tree Semantics Approach

2018 ◽  
Vol 4 (4) ◽  
pp. 287
Author(s):  
Guodong Wu ◽  
Junyan Qian
Keyword(s):  
Reachability Analysis ◽  
Concurrent Programs ◽  
Abstract Model ◽  
Reachability Problem ◽  
Interleaving Semantics ◽  
Recursive Procedures ◽  
Backward Analysis

<em>ADPN (Asynchronous Dynamic Pushdown Networks) are an abstract model for concurrent programs with recursive procedures and dynamic thread creation. Usually, asynchronous dynamic pushdown networks are described with interleaving semantics, in which the backward analysis is not effective. In order to improve interleaving semantics, tree semantics approach was introduced. This paper extends the tree semantics to ADPN. Because the reachability problem of ADPN is also undecidable, we address the context-bounded reachability problem and provide an algorithm for backward reachability analysis with tree-based semantics Approach.</em>

scholarly journals Graph models for reachability analysis of concurrent programs

1995 ◽  
Vol 4 (2) ◽  
pp. 171-213 ◽  
Author(s):  
Mauro Pezzè ◽  
Richard N. Taylor ◽  
Michal Young
Keyword(s):  
Reachability Analysis ◽  
Concurrent Programs ◽  
Graph Models

Symbolic Reachability Analysis of Hybrid Systems

2009 ◽  
Vol 19 (12) ◽  
pp. 3111-3121 ◽  
Author(s):  
Hai-Bin ZHANG ◽  
Zhen-Hua DUAN
Keyword(s):  
Hybrid Systems ◽  
Reachability Analysis

Reachability analysis of nonlinear hybrid systems based on polyhedron inclusion

2013 ◽  
Vol 33 (5) ◽  
pp. 1289-1293
Author(s):  
Jin ZOU ◽  
Wang LIN ◽  
Yong LUO ◽  
Zhenbing ZENG
Keyword(s):  
Hybrid Systems ◽  
Reachability Analysis ◽  
Nonlinear Hybrid

Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs

2021 ◽  
Vol 178 (3) ◽  
pp. 229-266
Author(s):  
Ivan Lanese ◽  
Adrián Palacios ◽  
Germán Vidal
Keyword(s):  
Programming Language ◽  
Message Passing ◽  
Concurrent Programming ◽  
Concurrent Systems ◽  
Concurrent Programs ◽  
Unified Framework ◽  
Innovative Technique ◽  
Dual Notion

Causal-consistent reversible debugging is an innovative technique for debugging concurrent systems. It allows one to go back in the execution focusing on the actions that most likely caused a visible misbehavior. When such an action is selected, the debugger undoes it, including all and only its consequences. This operation is called a causal-consistent rollback. In this way, the user can avoid being distracted by the actions of other, unrelated processes. In this work, we introduce its dual notion: causal-consistent replay. We allow the user to record an execution of a running program and, in contrast to traditional replay debuggers, to reproduce a visible misbehavior inside the debugger including all and only its causes. Furthermore, we present a unified framework that combines both causal-consistent replay and causal-consistent rollback. Although most of the ideas that we present are rather general, we focus on a popular functional and concurrent programming language based on message passing: Erlang.

Sign in / Sign up

Export Citation Format

Share Document