• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Høgskulen på Vestlandet
  • Import fra CRIStin
  • View Item
  •   Home
  • Høgskulen på Vestlandet
  • Import fra CRIStin
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

SymPaths: Symbolic Execution Meets Partial Order Reduction

de Boer, Frank; Bonsangue, Marcello; Johnsen, Einar Broch; Pun, Ka I; Tapia Tarifa, Silvia Lizeth; Tveito, Lars
Peer reviewed, Journal article
Accepted version
Thumbnail
View/Open
Boer.pdf (518.7Kb)
URI
https://hdl.handle.net/11250/2729449
Date
2020
Metadata
Show full item record
Collections
  • Import fra CRIStin [1550]
  • Institutt for datateknologi, elektroteknologi og realfag [629]
Original version
de Boer, F. S., Bonsangue, M., Johnsen, E. B., Pun, V. K. I., Tapia Tarifa, S. L., & Tveito, L. (2020). Sympaths: Symbolic execution meets partial order reduction. In W. Ahrendt, B. Beckert, R. Bubel, R. Hähnle, & M. Ulbrich (Eds.), Deductive software verification: Future perspectives (pp. 313-338).   10.1007/978-3-030-64354-6_13
Abstract
Symbolic execution is an important technique for software analysis, which enables systematic model exploration by following all possible execution paths for a given program. For multithreaded shared variable programs, this technique leads to a state space explosion. Partial order reduction is a technique which allows equivalent execution paths to be recognized, reducing the state space explosion problem. This paper provides formal justifications for these techniques in a multithreaded setting by proving the correctness and completeness of symbolic execution for multithreaded shared variable programs, with and without the use of partial order reduction. We then show how these formal justifications carry over to prove the soundness and relative completeness of a proof system for such multithreaded shared variable programs in dynamic logic, such that partial order reduction can be used to simplify the proof construction by mitigating the state space explosion.
Description
This is an author's accepted manuscript version (postprint) of an article published by Springer in Lecture Notes in Computer Science on 4 December 2020. The final authenticated version is available online at https://doi.org/10.1007/978-3-030-64354-6_13
Publisher
Springer
Journal
Lecture Notes in Computer Science (LNCS)

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit