Abstracting and Counting Synchronizing Processes

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

doi:10.1007/978-3-662-46081-8_13

Cited by 10 publications

(2 citation statements)

References 14 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have experimented with over eighty different counter machine reachability problems. These were obtained from our prototype tool Pacman [61], which checks local (i.e., assertion) or global (e.g., deadlock freedom) properties in concurrent programs (some inspired by [52] and [40]).…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Resultsmentioning

confidence: 99%

“…Well-structured transition systems (WSTS:s for short) may be everywhere [59], but not all transition systems are well-structured [3,61]. Problems such as state reachability (e.g, safety) have been shown to be decidable for WSTS:s [2,59].…”

Section: Introductionmentioning

confidence: 99%

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

Abstracting and Counting Synchronizing Processes

Ganjei

Rezine

Eles

et al. 2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We address the problem of automatically establishing synchronization dependent correctness (e.g. due to using barriers or ensuring absence of deadlocks) of programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an infinite domain. Automatically checking such properties for these programs is beyond the capabilities of current verification techniques. For this purpose, we describe an original logic that mixes two sorts of variables: those shared and manipulated by the concurrent processes, and ghost variables refering to the number of processes satisfying predicates on shared and local program variables. We then combine existing works on counter, predicate, and constrained monotonic abstraction and nest two cooperating counter example based refinement loops for establishing correctness (safety expressed as non reachability of configurations satisfying formulas in our logic). We have implemented a tool (Pacman, for predicated constrained monotonic abstraction) and used it to perform parameterized verification for several programs whose correctness crucially depends on precisely capturing the number of synchronizing processes.

show abstract