{"title":"“带我去月球”:航天系统的验证","authors":"D. Giannakopoulou","doi":"10.1109/SEFM.2010.9","DOIUrl":null,"url":null,"abstract":"The safety-critical nature of aerospace systems mandates the development of advanced formal verification techniques that provide desired correctness guarantees. In this paper, we present two inherently different approaches towards achieving this goal. The first approach aims at scaling exhaustive verification techniques by applying divide-and-conquer principles. It involves automated compositional verification algorithms for model checking both finite and infinite-state software components. The second approach does not perform exhaustive verification but it is more versatile. It uses a model checker to automatically generate tests for aerospace algorithms and only requires knowledge of the types of inputs that the algorithms process. We will discuss our experience with formal verification of aerospace systems and analyze the applicability of the two approaches in several settings.","PeriodicalId":211760,"journal":{"name":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"\\\"Fly Me to the Moon\\\": Verification of Aerospace Systems\",\"authors\":\"D. Giannakopoulou\",\"doi\":\"10.1109/SEFM.2010.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The safety-critical nature of aerospace systems mandates the development of advanced formal verification techniques that provide desired correctness guarantees. In this paper, we present two inherently different approaches towards achieving this goal. The first approach aims at scaling exhaustive verification techniques by applying divide-and-conquer principles. It involves automated compositional verification algorithms for model checking both finite and infinite-state software components. The second approach does not perform exhaustive verification but it is more versatile. It uses a model checker to automatically generate tests for aerospace algorithms and only requires knowledge of the types of inputs that the algorithms process. We will discuss our experience with formal verification of aerospace systems and analyze the applicability of the two approaches in several settings.\",\"PeriodicalId\":211760,\"journal\":{\"name\":\"2010 8th IEEE International Conference on Software Engineering and Formal Methods\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 8th IEEE International Conference on Software Engineering and Formal Methods\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEFM.2010.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 8th IEEE International Conference on Software Engineering and Formal Methods","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEFM.2010.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
"Fly Me to the Moon": Verification of Aerospace Systems
The safety-critical nature of aerospace systems mandates the development of advanced formal verification techniques that provide desired correctness guarantees. In this paper, we present two inherently different approaches towards achieving this goal. The first approach aims at scaling exhaustive verification techniques by applying divide-and-conquer principles. It involves automated compositional verification algorithms for model checking both finite and infinite-state software components. The second approach does not perform exhaustive verification but it is more versatile. It uses a model checker to automatically generate tests for aerospace algorithms and only requires knowledge of the types of inputs that the algorithms process. We will discuss our experience with formal verification of aerospace systems and analyze the applicability of the two approaches in several settings.