Academic Journal
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL.
| Τίτλος: | Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL. |
|---|---|
| Συγγραφείς: | Foster, Simon, Hur, Chung-Kil, Woodcock, Jim |
| Πηγή: | ACM Transactions on Software Engineering & Methodology; May2025, Vol. 34 Issue 4, p1-40, 40p |
| Θεματικοί όροι: | Software engineering, Semantics, Logic, Mathematical proofs, Simulation methods & models, Parallel programs (Computer programs), Interactive computer systems |
| Περίληψη: | Model execution allows us to prototype and analyse software engineering models by stepping through their possible behaviours, using techniques like animation and simulation. On the other hand, deductive verification allows us to construct formal proofs demonstrating satisfaction of certain critical properties in support of high-assurance software engineering. To ensure coherent results between execution and proof, we need unifying semantics and automation. In this article, we mechanise Interaction Trees (ITrees) in Isabelle/HOL to produce an execution and verification framework. ITrees are coinductive structures that allow us to encode infinite labelled transition systems, yet they are inherently executable. We use ITrees to create verification tools for stateful imperative programs, concurrent programs with message passing in the form of the CSP and Circus languages, and abstract system models in the style of the Z and B methods. We demonstrate how ITrees can account for diverse semantic presentations, such as structural operational semantics, a relational program model, and CSP's failures-divergences trace model. Finally, we demonstrate how ITrees can be executed using the Isabelle code generator to support the animation of models. [ABSTRACT FROM AUTHOR] |
| Copyright of ACM Transactions on Software Engineering & Methodology is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:edb&genre=article&issn=1049331X&ISBN=&volume=34&issue=4&date=20250501&spage=1&pages=1-40&title=ACM Transactions on Software Engineering & Methodology&atitle=Unifying%20Model%20Execution%20and%20Deductive%20Verification%20with%20Interaction%20Trees%20in%20Isabelle%2FHOL.&aulast=Foster%2C%20Simon&id=DOI:10.1145/3702981 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: edb DbLabel: Complementary Index An: 188947113 RelevancyScore: 994 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 993.548583984375 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Foster%2C+Simon%22">Foster, Simon</searchLink><br /><searchLink fieldCode="AR" term="%22Hur%2C+Chung-Kil%22">Hur, Chung-Kil</searchLink><br /><searchLink fieldCode="AR" term="%22Woodcock%2C+Jim%22">Woodcock, Jim</searchLink> – Name: TitleSource Label: Source Group: Src Data: ACM Transactions on Software Engineering & Methodology; May2025, Vol. 34 Issue 4, p1-40, 40p – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Logic%22">Logic</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+proofs%22">Mathematical proofs</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programs+%28Computer+programs%29%22">Parallel programs (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Interactive+computer+systems%22">Interactive computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Model execution allows us to prototype and analyse software engineering models by stepping through their possible behaviours, using techniques like animation and simulation. On the other hand, deductive verification allows us to construct formal proofs demonstrating satisfaction of certain critical properties in support of high-assurance software engineering. To ensure coherent results between execution and proof, we need unifying semantics and automation. In this article, we mechanise Interaction Trees (ITrees) in Isabelle/HOL to produce an execution and verification framework. ITrees are coinductive structures that allow us to encode infinite labelled transition systems, yet they are inherently executable. We use ITrees to create verification tools for stateful imperative programs, concurrent programs with message passing in the form of the CSP and Circus languages, and abstract system models in the style of the Z and B methods. We demonstrate how ITrees can account for diverse semantic presentations, such as structural operational semantics, a relational program model, and CSP's failures-divergences trace model. Finally, we demonstrate how ITrees can be executed using the Isabelle code generator to support the animation of models. [ABSTRACT FROM AUTHOR] – Name: Abstract Label: Group: Ab Data: <i>Copyright of ACM Transactions on Software Engineering & Methodology is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=188947113 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/3702981 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 40 StartPage: 1 Subjects: – SubjectFull: Software engineering Type: general – SubjectFull: Semantics Type: general – SubjectFull: Logic Type: general – SubjectFull: Mathematical proofs Type: general – SubjectFull: Simulation methods & models Type: general – SubjectFull: Parallel programs (Computer programs) Type: general – SubjectFull: Interactive computer systems Type: general Titles: – TitleFull: Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Foster, Simon – PersonEntity: Name: NameFull: Hur, Chung-Kil – PersonEntity: Name: NameFull: Woodcock, Jim IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 1049331X Numbering: – Type: volume Value: 34 – Type: issue Value: 4 Titles: – TitleFull: ACM Transactions on Software Engineering & Methodology Type: main |
| ResultId | 1 |