• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Høgskulen på Vestlandet
  • Import fra CRIStin
  • Vis innførsel
  •   Hjem
  • Høgskulen på Vestlandet
  • Import fra CRIStin
  • Vis innførsel
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
Åpne
Boer.pdf (518.7Kb)
Permanent lenke
https://hdl.handle.net/11250/2729449
Utgivelsesdato
2020
Metadata
Vis full innførsel
Samlinger
  • Import fra CRIStin [2282]
  • Institutt for datateknologi, elektroteknologi og realfag [852]
Originalversjon
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
Sammendrag
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.
Beskrivelse
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
Utgiver
Springer
Tidsskrift
Lecture Notes in Computer Science (LNCS)

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit