Tightly coupled verification of pervasive systems

ECEASST(2010)

引用 27|浏览21
暂无评分
摘要
We consider the problem of verifying context-aware, pervasive, inter- active systems when the interaction involves both system configuration and system use. Verification of configurable systems is more tightly coupled to design when the verification process involves reasoning about configurable formal models. The ap- proach is illustrated with a case study: using the model checker SPIN (Hol03) and a SAT solver (ES03) to reason about a configurable model of an activity monitor from the MATCH homecare infrastructure (MG09). Parts of the models are generated automatically from actual log files.
更多
查看译文
关键词
model checking,formal models,pervasive systems,sat solver
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要