The Experts below are selected from a list of 706581 Experts worldwide ranked by ideXlab platform
Zebo Peng - One of the best experts on this subject based on the ideXlab platform.
-
FMCAD - Safety verification of phaser programs
2017 Formal Methods in Computer Aided Design (FMCAD), 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations are found in modern languages such as Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
-
Safety Verification of Phaser Programs
arXiv: Programming Languages, 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations %of these recent and dynamic Synchronization are found in modern languages such as X10 or Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
Zeinab Ganjei - One of the best experts on this subject based on the ideXlab platform.
-
FMCAD - Safety verification of phaser programs
2017 Formal Methods in Computer Aided Design (FMCAD), 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations are found in modern languages such as Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
-
Safety Verification of Phaser Programs
arXiv: Programming Languages, 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations %of these recent and dynamic Synchronization are found in modern languages such as X10 or Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
Petru Eles - One of the best experts on this subject based on the ideXlab platform.
-
FMCAD - Safety verification of phaser programs
2017 Formal Methods in Computer Aided Design (FMCAD), 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations are found in modern languages such as Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
-
Safety Verification of Phaser Programs
arXiv: Programming Languages, 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations %of these recent and dynamic Synchronization are found in modern languages such as X10 or Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
Ahmed Rezine - One of the best experts on this subject based on the ideXlab platform.
-
FMCAD - Safety verification of phaser programs
2017 Formal Methods in Computer Aided Design (FMCAD), 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations are found in modern languages such as Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
-
Safety Verification of Phaser Programs
arXiv: Programming Languages, 2017Co-Authors: Zeinab Ganjei, Ahmed Rezine, Petru Eles, Zebo PengAbstract:We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern non-trivial Synchronization construct that supports dynamic parallelism with runtime registration and deregistration of spawned tasks. They allow for collective and point-to-point Synchronizations. For instance, phasers can enforce barriers or producer-consumer Synchronization schemes among all or subsets of the running tasks. Implementations %of these recent and dynamic Synchronization are found in modern languages such as X10 or Habanero Java. Phasers essentially associate phases to individual tasks and use their runtime values to restrict possible concurrent executions. Unbounded phases may result in infinite transition systems even in the case of programs only creating finite numbers of tasks and phasers. We introduce an exact gap-order based procedure that always terminates when checking control reachability for programs generating bounded numbers of coexisting tasks and phasers. We also show verifying plain reachability is undecidable even for programs generating few tasks and phasers. We then explain how to turn our procedure into a sound analysis for checking plain reachability (including deadlock freedom). We report on preliminary experiments with our open source tool.
Yang Juan - One of the best experts on this subject based on the ideXlab platform.
-
Synchronization distance determination and Synchronization controller design for hybrid Petri nets
Control theory & applications, 2012Co-Authors: Yang JuanAbstract:There are rare conclusions so far in studies of transition fairness and Synchronization distance for general hybrid Petri nets.On the basis of the definition of general hybrid Petri nets,we formally define the transition fairness and the Synchronization distance,and propose the method for determining the Synchronization distance by using the pruned invariant behavior(IB) evolution graph.Sufficient and necessary conditions for fairness determination are developed,and the relationships among the fairness,Synchronization and pruned IB evolution graph are confirmed.The proposed method not only gives existing results in simple Petri nets,but also extends the application scope in the determination of the Synchronization distance.A Synchronization controller is designed on the basis of the Synchronization distance for a hybrid transportation control system,the performance of which demonstrates the valid application of the Synchronization distance to the realization of the Synchronization control.
