Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Verifying Parallel Code After Refactoring Using Equivalence Checking
by
Pidan, Dmitry
, Veksler, Tatyana
, Abadi, Moria
, Keidar-Barner, Sharon
in
Computer programming
/ Equivalence
/ Parallel processing
/ Program verification (computers)
/ Software
/ Synchronism
2019
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Verifying Parallel Code After Refactoring Using Equivalence Checking
by
Pidan, Dmitry
, Veksler, Tatyana
, Abadi, Moria
, Keidar-Barner, Sharon
in
Computer programming
/ Equivalence
/ Parallel processing
/ Program verification (computers)
/ Software
/ Synchronism
2019
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Verifying Parallel Code After Refactoring Using Equivalence Checking
Journal Article
Verifying Parallel Code After Refactoring Using Equivalence Checking
2019
Request Book From Autostore
and Choose the Collection Method
Overview
To take advantage of multi-core systems, programmers are replacing sequential software with parallel software. Software engineers often avoid writing their parallel software from scratch and prefer refactoring their legacy application, either manually or with the help of a refactoring tool. In either case, it is extremely challenging to produce correct parallel code, taking into account all synchronization issues. Furthermore, the complexity of parallel code makes its verification extremely difficult. We introduce a method for the verification of parallel code after refactoring. Our method, which is based on symbolic interpretation, leverages the original sequential code that in most cases was already tested and/or verified, and checks whether it is equivalent to the code after refactoring. The advantage of this method is that it can generically find any problem in the parallel code that does not exist in the original sequential code. As a result, it can help create higher quality and safer parallel code.
Publisher
Springer Nature B.V
This website uses cookies to ensure you get the best experience on our website.