{"title":"模型检查你能做的,运行时检查其余的","authors":"Timothy L. Hinrichs, A. Sistla, L. Zuck","doi":"10.29007/slnn","DOIUrl":null,"url":null,"abstract":"Model checking and runtime verification are pillars of formal verification but for the most part are used independently. In this position paper we argue that the formal verification community would be well-served by developing theory, algorithms, implementations, and applications that combine model checking and runtime verification into a single, seamless technology. This technology would allow system developers to carefully choose the appropriate balance between offline verification of expressive properties (model checking) and online verification of important parts of the system’s state space (runtime verification). We present several realistic examples where such technology appears necessary and a preliminary formalization of the idea.","PeriodicalId":422904,"journal":{"name":"HOWARD-60","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Model Check What You Can, Runtime Verify the Rest\",\"authors\":\"Timothy L. Hinrichs, A. Sistla, L. Zuck\",\"doi\":\"10.29007/slnn\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Model checking and runtime verification are pillars of formal verification but for the most part are used independently. In this position paper we argue that the formal verification community would be well-served by developing theory, algorithms, implementations, and applications that combine model checking and runtime verification into a single, seamless technology. This technology would allow system developers to carefully choose the appropriate balance between offline verification of expressive properties (model checking) and online verification of important parts of the system’s state space (runtime verification). We present several realistic examples where such technology appears necessary and a preliminary formalization of the idea.\",\"PeriodicalId\":422904,\"journal\":{\"name\":\"HOWARD-60\",\"volume\":\"149 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HOWARD-60\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29007/slnn\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HOWARD-60","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/slnn","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Model checking and runtime verification are pillars of formal verification but for the most part are used independently. In this position paper we argue that the formal verification community would be well-served by developing theory, algorithms, implementations, and applications that combine model checking and runtime verification into a single, seamless technology. This technology would allow system developers to carefully choose the appropriate balance between offline verification of expressive properties (model checking) and online verification of important parts of the system’s state space (runtime verification). We present several realistic examples where such technology appears necessary and a preliminary formalization of the idea.