Safety verification of phaser programs

Ganjei, Zeinab; Rezine, Ahmed; Eles, Petru; Peng, Zebo

doi:10.23919/fmcad.2017.8102243

Cited by 5 publications

(9 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, even with finite numbers of tasks and phasers, but with arbitrary gap-bounds, we can show [62] the following. Theorem 20.…”

Section: Theorem 18 K-control-reachability Is Undecidable In Generalmentioning

confidence: 88%

Section: Related Workmentioning

confidence: 99%

“…The closest work to ours is [62], which was introduced in Chapter 4 and is the only work on automatic and static formal verification of phaser programs. However, the work in [62] considers a bounded number of tasks and phasers. The approach introduced in this chapter can decide whether some program assertion has been violated even in the presence of arbitrarily many tasks with arbitrarily large phase gaps.…”

Section: Related Workmentioning

confidence: 99%

“…The approach introduced in this chapter can decide whether some program assertion has been violated even in the presence of arbitrarily many tasks with arbitrarily large phase gaps. This is well beyond [62] and requires a more complex symbolic representation with a more profound termination argument.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Parameterized Verification of Synchronized Concurrent Programs

Ganjei

2021

Linköping Studies in Science and Technology. Dissertations

Self Cite

View full text Add to dashboard Cite

I want to begin by thanking God for He has given me the opportunity and capability to reach this stage of my life. Then, I would like to offer my sincere gratitude to my advisors, Associate Professor Ahmed Rezine, Professor Petru Eles, and Professor Zebo Peng for giving me the opportunity to pursue a PhD in the Embedded Systems Lab at Linköping University, for sharing their wisdom and knowledge, and most importantly, for allowing me the room to work in my own way. I cannot thank any of my professors enough for their dedication and efforts in creating an excellent working environment. Their input, understanding, and patience have been invaluable in helping me pursue my research goals.I am especially grateful to Ahmed for his continued help and support during the whole time I was at ESLAB. I have been very fortunate to have had Ahmed as my advisor, who brightened up my academic path and supported me through each step of the way. He provided me with the necessary guidance and also ample space to improve my independent thoughts during my PhD. I would like to thank him for teaching me lessons of patience and passion for education that I will carry throughout my life's journey, making sure I was getting all the help I needed and never letting me down. I would also like to thank Professor Ludovic Henrio for his collaboration and contribution as a co-author.The ESLAB and IDA members contributed immensely to my personal and professional time as a PhD student at LiU. My profound appreciation also goes to Amir Aminifar and Breeta SenGupta for welcoming me to ESLAB and helping me take my first steps. Specifically, my most heartfelt thanks to Mina Niknafs and Åsa Kärrman, who were both my colleagues and friends.I would like to take this opportunity and extend my thanks to Professor Mariam Kamkar for all her encouragement and kindness, to the administration at IDA that facilitated my work, and especially to Anne Moe, Inger Norén, and Lene Rosell.Last but not least, I would like to express my deepest gratitude to my parents, to whom I shall always be indebted, for their unconditional love, for raising me, supporting me, but never asking me how much of my PhD was left! To my sweet and adorable little sons who brought joy and adventure vii to our family, who motivated me to take a refreshing break from my studies and contributed to the length of my PhD! To my loving, caring, and patient husband, Meysam, who has always been there for me and whose sacrifices I greatly appreciate and never forget.

show abstract

“…Finally, even with finite numbers of tasks and phasers, but with arbitrary gap-bounds, we can show [62] the following. Theorem 20.…”

Section: Theorem 18 K-control-reachability Is Undecidable In Generalmentioning

confidence: 88%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Parameterized Verification of Synchronized Concurrent Programs

Ganjei

2021

Linköping Studies in Science and Technology. Dissertations

Self Cite

View full text Add to dashboard Cite

show abstract

“…Related work. The closest work to ours is [9], which is the only work on automatic and static formal verification of phaser programs. The work in [9] does not consider the parameterized case.…”

Section: Introductionmentioning

confidence: 99%

On Reachability in Parameterized Phaser Programs

Ganjei¹,

Rezine²,

Henrio³

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

We address the problem of statically checking safety properties (such as assertions or deadlocks) for parameterized phaser programs. Phasers embody a non-trivial and modern synchronization construct used to orchestrate executions of parallel tasks. This generic construct supports dynamic parallelism with runtime registrations and deregistrations of spawned tasks. It generalizes many synchronization patterns such as collective and point-to-point schemes. For instance, phasers can enforce barriers or producer-consumer synchronization patterns among all or subsets of the running tasks. We consider in this work programs that may generate arbitrarily many tasks and phasers. We study different formulations of the verification problem and propose an exact procedure that is guaranteed to terminate for some reachability problems even in the presence of unbounded phases and arbitrarily many spawned tasks. In addition, we prove undecidability results for several problems on which our procedure cannot be guaranteed to terminate.

show abstract

Dynamic deadlock verification for general barrier synchronisation

et al. 2015

View full text Add to dashboard Cite

We present Armus, a dynamic verification tool for deadlock detection and avoidance specialised in barrier synchronisation. Barriers are used to coordinate the execution of groups of tasks, and serve as a building block of parallel computing. Our tool verifies more barrier synchronisation patterns than current state-of-the-art. To improve the scalability of verification, we introduce a novel event-based representation of concurrency constraints, and a graph-based technique for deadlock analysis. The implementation is distributed and fault-tolerant, and can verify X10 and Java programs. To formalise the notion of barrier deadlock, we introduce a core language expressive enough to represent the three most widespread barrier synchronisation patterns: group, split-phase, and dynamic membership. We propose a graph analysis technique that selects from two alternative graph representations: the Wait-For Graph, that favours programs with more tasks than barriers; and the State Graph, optimised for programs with more barriers than tasks. We prove that finding a deadlock in either representation is equivalent, and that the verification algorithm is sound and complete with respect to the notion of deadlock in our core language. Armus is evaluated with three benchmark suites in local and distributed scenarios. The benchmarks show that graph analysis with automatic graph-representation selection can record a 7-fold execution increase versus the traditional fixed graph representation. The performance measurements for distributed deadlock detection between 64 processes show negligible overheads.

show abstract

Safety verification of phaser programs

Cited by 5 publications

References 19 publications

Parameterized Verification of Synchronized Concurrent Programs

Parameterized Verification of Synchronized Concurrent Programs

On Reachability in Parameterized Phaser Programs

Dynamic deadlock verification for general barrier synchronisation

Contact Info

Product

Resources

About