Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Practical Abstractions for Automated Verification of Shared-Memory Concurrency
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Teoretisk datalogi, TCS.ORCID-id: 0000-0002-0074-8786
University of TwenteEnschedeThe Netherlands.
2020 (engelsk)Inngår i: Lect. Notes Comput. Sci.: Verification, Model Checking, and Abstract Interpretation, Springer , 2020, s. 401-425Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Modern concurrent and distributed software is highly complex. Techniques to reason about the correct behaviour of such software are essential to ensure its reliability. To be able to reason about realistic programs, these techniques must be modular and compositional as well as practical by being supported by automated tools. However, many existing approaches for concurrency verification are theoretical and focus on expressivity and generality. This paper contributes a technique for verifying behavioural properties of concurrent and distributed programs that makes a trade-off between expressivity and usability. The key idea of the approach is that program behaviour is abstractly modelled using process algebra, and analysed separately. The main difficulty is presented by the typical abstraction gap between program implementations and their models. Our approach bridges this gap by providing a deductive technique for formally linking programs with their process-algebraic models. Our verification technique is modular and compositional, is proven sound with Coq, and has been implemented in the automated concurrency verifier VerCors. Moreover, our technique is demonstrated on multiple case studies, including the verification of a leader election protocol. 

sted, utgiver, år, opplag, sider
Springer , 2020. s. 401-425
Emneord [en]
Abstracting, Algebra, Automation, Economic and social effects, Software reliability, Automated verification, Deductive techniques, Distributed program, Distributed software, Leader election protocols, Multiple-case study, Program implementation, Verification techniques, Model checking
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-274331DOI: 10.1007/978-3-030-39322-9_19ISI: 000655367300019Scopus ID: 2-s2.0-85079086514OAI: oai:DiVA.org:kth-274331DiVA, id: diva2:1442666
Konferanse
International Conference on Verification, Model Checking, and Abstract Interpretation 16 January 2020 through 21 January 2020
Merknad

QC 20200617

Tilgjengelig fra: 2020-06-17 Laget: 2020-06-17 Sist oppdatert: 2023-03-30bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopushttps://link.springer.com/chapter/10.1007%2F978-3-030-39322-9_19

Person

Gurov, Dilian

Søk i DiVA

Av forfatter/redaktør
Gurov, Dilian
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 113 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf