A symbolic execution semantics for TopHat

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI:10.1145/3412932.3412933

N. Naus, Tim Steenvoorden, M. Klinik

{"title":"A symbolic execution semantics for TopHat","authors":"N. Naus, Tim Steenvoorden, M. Klinik","doi":"10.1145/3412932.3412933","DOIUrl":null,"url":null,"abstract":"Task-Oriented Programming (TOP) is a programming paradigm that allows declarative specification of workflows. TOP is typically used in domains where functional correctness is essential, and where failure can have financial or strategical consequences. In this paper we aim to make formal verification of software written in TOP easier. Currently, only testing is used to verify that programs behave as intended. We use symbolic execution to guarantee that no aberrant behaviour can occur. In previous work we presented TopHat, a formal language that implements the core aspects of TOP. In this paper we develop a symbolic execution semantics for TopHat. Symbolic execution allows to prove that a given property holds for all possible execution paths of TopHat programs. We show that the symbolic execution semantics is consistent with the original TopHat semantics, by proving soundness and completeness. We present an implementation of the symbolic execution semantics in Haskell. By running example programs, we validate our approach. This work represents a step forward in the formal verification of TOP software.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3412932.3412933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

Abstract

Task-Oriented Programming (TOP) is a programming paradigm that allows declarative specification of workflows. TOP is typically used in domains where functional correctness is essential, and where failure can have financial or strategical consequences. In this paper we aim to make formal verification of software written in TOP easier. Currently, only testing is used to verify that programs behave as intended. We use symbolic execution to guarantee that no aberrant behaviour can occur. In previous work we presented TopHat, a formal language that implements the core aspects of TOP. In this paper we develop a symbolic execution semantics for TopHat. Symbolic execution allows to prove that a given property holds for all possible execution paths of TopHat programs. We show that the symbolic execution semantics is consistent with the original TopHat semantics, by proving soundness and completeness. We present an implementation of the symbolic execution semantics in Haskell. By running example programs, we validate our approach. This work represents a step forward in the formal verification of TOP software.

查看原文本刊更多论文

TopHat的符号执行语义

面向任务的编程(TOP)是一种编程范例，它允许对工作流进行声明性规范。TOP通常用于功能正确性至关重要的领域，以及失败可能导致财务或战略后果的领域。在本文中，我们的目标是使用TOP编写的软件的形式化验证更容易。目前，只有测试被用来验证程序是否按预期运行。我们使用符号执行来保证不会发生异常行为。在之前的工作中，我们介绍了TopHat，一种实现TOP核心方面的形式化语言。在本文中，我们为TopHat开发了一个符号执行语义。符号执行允许证明给定的属性适用于所有可能的TopHat程序执行路径。通过证明稳健性和完备性，我们证明了符号执行语义与原始TopHat语义是一致的。我们在Haskell中给出了符号执行语义的实现。通过运行示例程序，我们验证了我们的方法。这项工作代表着TOP软件的正式验证向前迈进了一步。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages

自引率

0.00%

发文量