Pub Date : 2017-09-01DOI: 10.1109/TASE.2017.8285626
Tian-Ming Bu, Hengyang Wu, Yixiang Chen
The behavioural distance is a more robust way of formalising behavioural similarity between states than bisimulations. The smaller the distance, the more alike the states are. It is helpful for quantitative verifications of concurrent systems. The main contribution of this paper is an effective procedure for computing behavioural distance introduced by Cao et al. (IEEE Transactions on Fuzzy Systems, 21 (2013) 735–747). The time complexity of the algorithm is O(n5 m3 lg n), where n is the number of states and m is the number of transitions in the underlying transition systems. The key step in this algorithm is to compute the distance between two distributions, which is defined as the value of a mathematical programming problem (MP). In this process, some interesting properties about solutions of a fuzzy system, which is a constraint of the MP, are discussed.
行为距离是一种比双模拟更可靠的形式化状态间行为相似性的方法。距离越小，状态越相似。它有助于并行系统的定量验证。本文的主要贡献是Cao等人引入的计算行为距离的有效程序(IEEE Transactions on Fuzzy Systems, 21(2013) 735-747)。算法的时间复杂度为O(n5 m3 lg n)，其中n为底层迁移系统的状态数，m为底层迁移系统的迁移数。该算法的关键步骤是计算两个分布之间的距离，这被定义为一个数学规划问题(MP)的值。在此过程中，讨论了一类模糊系统解的一些有趣性质。
{"title":"Computing behavioural distance for fuzzy transition systems","authors":"Tian-Ming Bu, Hengyang Wu, Yixiang Chen","doi":"10.1109/TASE.2017.8285626","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285626","url":null,"abstract":"The behavioural distance is a more robust way of formalising behavioural similarity between states than bisimulations. The smaller the distance, the more alike the states are. It is helpful for quantitative verifications of concurrent systems. The main contribution of this paper is an effective procedure for computing behavioural distance introduced by Cao et al. (IEEE Transactions on Fuzzy Systems, 21 (2013) 735–747). The time complexity of the algorithm is O(n5 m3 lg n), where n is the number of states and m is the number of transitions in the underlying transition systems. The key step in this algorithm is to compute the distance between two distributions, which is defined as the value of a mathematical programming problem (MP). In this process, some interesting properties about solutions of a fuzzy system, which is a constraint of the MP, are discussed.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128338244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-01DOI: 10.1109/TASE.2017.8285623
Jean-Louis Colaço, B. Pagano, Marc Pouzet
SCADE is a high-level language and environment for developing safety-critical embedded control software. It has been used for more than twenty years in various application domains like avionics, nuclear plants, transportation, and automotive. SCADE was founded on the synchronous data-flow language Lustre invented by Caspi and Halbwachs. In the early years, it was mainly seen as a graphical notation for Lustre but with the unique and key addition of a code generator qualified to the highest standards for safety-critical applications. In 2008, a major revision based on the new language ‘Scade 6’ was released. This language is an original combination of the Lustre data-flow style with control structures borrowed from Esterel and SyncCharts, and compilation and static analyses from Lucid Synchrone for ensuring safety properties. This increase in expressiveness together with the qualified code generator have dramatically widened SCADE scope of applications. While previous publications have described some of its language constructs and compiler algorithms, no reference publication on ‘Scade 6’ exists to date. In this paper, we recall the decisions made in its design, illustrate the main language features and static analyses, and describe the compiler organization developed to satisfy the qualification process.
{"title":"SCADE 6: A formal language for embedded critical software development (invited paper)","authors":"Jean-Louis Colaço, B. Pagano, Marc Pouzet","doi":"10.1109/TASE.2017.8285623","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285623","url":null,"abstract":"SCADE is a high-level language and environment for developing safety-critical embedded control software. It has been used for more than twenty years in various application domains like avionics, nuclear plants, transportation, and automotive. SCADE was founded on the synchronous data-flow language Lustre invented by Caspi and Halbwachs. In the early years, it was mainly seen as a graphical notation for Lustre but with the unique and key addition of a code generator qualified to the highest standards for safety-critical applications. In 2008, a major revision based on the new language ‘Scade 6’ was released. This language is an original combination of the Lustre data-flow style with control structures borrowed from Esterel and SyncCharts, and compilation and static analyses from Lucid Synchrone for ensuring safety properties. This increase in expressiveness together with the qualified code generator have dramatically widened SCADE scope of applications. While previous publications have described some of its language constructs and compiler algorithms, no reference publication on ‘Scade 6’ exists to date. In this paper, we recall the decisions made in its design, illustrate the main language features and static analyses, and describe the compiler organization developed to satisfy the qualification process.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-01DOI: 10.1109/TASE.2017.8285628
J. Bowles, M. Caminati, Suhyun Cha
Common chronic conditions are routinely treated following standardised procedures known as clinical pathways. For patients suffering from two or more chronic conditions, referred to as multimorbidities, several pathways have to be applied simultaneously. However, since pathways rarely consider the presence of comorbidities, applying several pathways may lead to potentially harmful (medication) conflicts. This paper proposes an automated framework to detect, highlight and resolve conflicts in the treatments used for patients with multimorbidites. We use BPMN as a modelling language for capturing care guidelines. A BPMN model is transformed into an intermediate formal model capturing the possible unfoldings of the pathway. Putting together the constraint solver Z3 and the theorem prover Isabelle, we combine treatment plans and check the correctness of the approach. We illustrate the approach with an example from the medical domain and discuss future work.
{"title":"An integrated framework for verifying multiple care pathways","authors":"J. Bowles, M. Caminati, Suhyun Cha","doi":"10.1109/TASE.2017.8285628","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285628","url":null,"abstract":"Common chronic conditions are routinely treated following standardised procedures known as clinical pathways. For patients suffering from two or more chronic conditions, referred to as multimorbidities, several pathways have to be applied simultaneously. However, since pathways rarely consider the presence of comorbidities, applying several pathways may lead to potentially harmful (medication) conflicts. This paper proposes an automated framework to detect, highlight and resolve conflicts in the treatments used for patients with multimorbidites. We use BPMN as a modelling language for capturing care guidelines. A BPMN model is transformed into an intermediate formal model capturing the possible unfoldings of the pathway. Putting together the constraint solver Z3 and the theorem prover Isabelle, we combine treatment plans and check the correctness of the approach. We illustrate the approach with an example from the medical domain and discuss future work.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-01DOI: 10.1109/TASE.2017.8285622
M. Gaudel
This extended abstract takes advantage of a theory of software testing based on formal specifications to point out the benefits and limits of the use of formal methods to this end. A notion of exhaustive test set is defined according to the semantics of the formal notation, the considered conformance relation, and some testability hypotheses on the system under test. This gives a framework for the formalisation of test selection, test execution, and oracles, and, moreover, leads to the explicitation of those hypotheses underlying test selection strategies, such as uniformity hypotheses or regularity hypotheses. This explicitation provides some guides to complementary proofs, or tests, or instrumentations of the system under test. This approach has been applied to various formalisms: axiomatic specifications of data types, model-based specifications, process algebras, transition systems, etc. It provides some guiding principles for the development of testing methods given a formal specification notation and an associated conformance/refinement relation. It is at the origin of the development of some test environments based on SMT solvers and theorem provers.
{"title":"Formal methods for software testing (invited paper)","authors":"M. Gaudel","doi":"10.1109/TASE.2017.8285622","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285622","url":null,"abstract":"This extended abstract takes advantage of a theory of software testing based on formal specifications to point out the benefits and limits of the use of formal methods to this end. A notion of exhaustive test set is defined according to the semantics of the formal notation, the considered conformance relation, and some testability hypotheses on the system under test. This gives a framework for the formalisation of test selection, test execution, and oracles, and, moreover, leads to the explicitation of those hypotheses underlying test selection strategies, such as uniformity hypotheses or regularity hypotheses. This explicitation provides some guides to complementary proofs, or tests, or instrumentations of the system under test. This approach has been applied to various formalisms: axiomatic specifications of data types, model-based specifications, process algebras, transition systems, etc. It provides some guiding principles for the development of testing methods given a formal specification notation and an associated conformance/refinement relation. It is at the origin of the development of some test environments based on SMT solvers and theorem provers.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125302580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-01DOI: 10.1109/TASE.2017.8285625
Yuxin Deng, Yuan Feng
We investigate a notion of probabilistic program equivalence under linear contexts. We show that both a statebased and a distribution-based bisimilarity are sound coinductive proof techniques for reasoning about higher-order probabilistic programs, but only the distribution-based one is complete for linear contextual equivalence. The completeness proof is novel and directly constructs linear contexts from transitions, rather than the traditional approach of characterizing bisimilarities as testing equivalences.
{"title":"Bisimulations for probabilistic linear lambda calculi","authors":"Yuxin Deng, Yuan Feng","doi":"10.1109/TASE.2017.8285625","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285625","url":null,"abstract":"We investigate a notion of probabilistic program equivalence under linear contexts. We show that both a statebased and a distribution-based bisimilarity are sound coinductive proof techniques for reasoning about higher-order probabilistic programs, but only the distribution-based one is complete for linear contextual equivalence. The completeness proof is novel and directly constructs linear contexts from transitions, rather than the traditional approach of characterizing bisimilarities as testing equivalences.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124693431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-08DOI: 10.1109/TASE.2017.8285624
Harsh Beohar, B. König, Sebastian Küpper, Alexandra Silva
We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we show that such transition systems can be modelled in two ways: as conditional transition systems (CTS) with a partial order on conditions, or as lattice transition systems (LaTS), where transitions are labelled with the elements from a distributive lattice. We define equivalent notions of bisimilarity for both variants and characterise them via a bisimulation game. We explain how conditional transition systems are related to featured transition systems for the modelling of software product lines. Furthermore, we show how to compute bisimilarity symbolically via BDDs by defining an operation on BDDs that approximates an element of a Boolean algebra into a lattice. We have implemented our procedure and provide runtime results.
{"title":"Conditional transition systems with upgrades","authors":"Harsh Beohar, B. König, Sebastian Küpper, Alexandra Silva","doi":"10.1109/TASE.2017.8285624","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285624","url":null,"abstract":"We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we show that such transition systems can be modelled in two ways: as conditional transition systems (CTS) with a partial order on conditions, or as lattice transition systems (LaTS), where transitions are labelled with the elements from a distributive lattice. We define equivalent notions of bisimilarity for both variants and characterise them via a bisimulation game. We explain how conditional transition systems are related to featured transition systems for the modelling of software product lines. Furthermore, we show how to compute bisimilarity symbolically via BDDs by defining an operation on BDDs that approximates an element of a Boolean algebra into a lattice. We have implemented our procedure and provide runtime results.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122547780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-02-15DOI: 10.1109/TASE.2017.8285642
Jian Liu, Ying Jiang, Yanyun Chen, Qing Zhou
In the setting of automated theorem proving, the output of an automated theorem prover is usually presented in text format, which is often too heavy to be understood. In the setting of model checking, it would be helpful if one can observe, at the same time, both the model structure under consideration and the verification procedure. To address these problems, a 3D visualization tool for modeling, demonstration and verification (VMDV for short) is proposed in this paper. The facilities of VMDV are illustrated by applying it to an automated theorem prover.
{"title":"VMDV: A 3D visualization tool for modeling, demonstration, and verification","authors":"Jian Liu, Ying Jiang, Yanyun Chen, Qing Zhou","doi":"10.1109/TASE.2017.8285642","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285642","url":null,"abstract":"In the setting of automated theorem proving, the output of an automated theorem prover is usually presented in text format, which is often too heavy to be understood. In the setting of model checking, it would be helpful if one can observe, at the same time, both the model structure under consideration and the verification procedure. To address these problems, a 3D visualization tool for modeling, demonstration and verification (VMDV for short) is proposed in this paper. The facilities of VMDV are illustrated by applying it to an automated theorem prover.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"735 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-10DOI: 10.1109/TASE.2017.8285639
Shichao Liu, Ying Jiang
We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a reduction semantics and a labelled transition semantics. The former is used to define weak barbed congruence. The latter is used to define a parameterized weak bisimulation emphasizing locations and local broadcasts. We prove that weak bisimilarity implies weak barbed congruence. The potential applications are illustrated by some examples and two case studies.
{"title":"Modeling and reasoning about wireless networks: A graph-based calculus approach","authors":"Shichao Liu, Ying Jiang","doi":"10.1109/TASE.2017.8285639","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285639","url":null,"abstract":"We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a reduction semantics and a labelled transition semantics. The former is used to define weak barbed congruence. The latter is used to define a parameterized weak bisimulation emphasizing locations and local broadcasts. We prove that weak bisimilarity implies weak barbed congruence. The potential applications are illustrated by some examples and two case studies.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127793748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-04-19DOI: 10.1109/TASE.2017.8285635
C. A. Mezzina, Vasileios Koutavas
We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead systems to past states. Liveness and safety in this setting naturally correspond to the should-testing and inverse may-testing preorders, respectively. In reversible languages, however, the natural models of these preorders would need to be based on both forward and backward transitions, thus offering complex proof techniques for verification. Here we develop novel fully abstract models of liveness and safety which are based on forward transitions and limited rollback points, giving rise to considerably simpler proof techniques. Moreover, we show that, with respect to safety, total reversibility is a conservative extension to CCS. With respect to liveness, we prove that adding total reversibility to CCS distinguishes more systems. To our knowledge, this work provides the first testing theory for a reversible calculus, and paves the way for a testing theory for causal reversibility.
{"title":"A safety and liveness theory for total reversibility","authors":"C. A. Mezzina, Vasileios Koutavas","doi":"10.1109/TASE.2017.8285635","DOIUrl":"https://doi.org/10.1109/TASE.2017.8285635","url":null,"abstract":"We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead systems to past states. Liveness and safety in this setting naturally correspond to the should-testing and inverse may-testing preorders, respectively. In reversible languages, however, the natural models of these preorders would need to be based on both forward and backward transitions, thus offering complex proof techniques for verification. Here we develop novel fully abstract models of liveness and safety which are based on forward transitions and limited rollback points, giving rise to considerably simpler proof techniques. Moreover, we show that, with respect to safety, total reversibility is a conservative extension to CCS. With respect to liveness, we prove that adding total reversibility to CCS distinguishes more systems. To our knowledge, this work provides the first testing theory for a reversible calculus, and paves the way for a testing theory for causal reversibility.","PeriodicalId":221968,"journal":{"name":"2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116821772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：