The Internet of Things(IoT)can realize the interconnection of people,machines,and things anytime,anywhere.Most of the existing research mainly focuses on the practical applications of IoT,and there is a lack of resear...The Internet of Things(IoT)can realize the interconnection of people,machines,and things anytime,anywhere.Most of the existing research mainly focuses on the practical applications of IoT,and there is a lack of research on modeling and reasoning about IoT systems from the perspective of formal methods.Thus,the Calculus of the Internet of Things(CaIT)has been proposed to specify and analyze IoT systems before the actual implementation,which can effectively improve development efficiency,and enhance system quality and reliability.To verify the correctness of IoT systems described by CaIT,this paper presents a proof system for CaIT,in which specifications and verifications are based on the extended Hoare Logic with time.Furthermore,we explore the cooperation between isolated proofs to validate the postconditions of the communication actions occurring in these proofs,with a particular focus on broadcast communication.We also demonstrate the soundness of our proof system.A simple“smart home”is given to illustrate the availability of our proof system.展开更多
In the design of dependable software for embed- ded and real-time operating systems, time analysis is a cru- cial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeter...In the design of dependable software for embed- ded and real-time operating systems, time analysis is a cru- cial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important and challenging. In this paper, we present a pro- gramming language to describe programs with interrupts that is comprised of two essential parts： main program and inter- rupt handling programs. We also explore a timed operational semantics and a denotational semantics to specify the mean- ings of our language. Furthermore, a strategy of deriving de- notational semantics from the timed operational semantics is provided to demonstrate the soundness of our operational se- mantics by showing the consistency between the derived de- notational semantics and the original denotational semantics.展开更多
基金supported by the National Key Research and Development Program of China (No.2022YFB3305102)the National Natural Science Foundation of China (Grant Nos.62032024,61872145)+1 种基金the"Digital Silk Road"Shanghai International Joint Lab of Trustworthy Intelligent Software (No.22510750100)Shanghai Trusted Industry Internet Software Collaborative Innovation Center,and the Dean's Fund of Shanghai Key Laboratory of Trustworthy Computing (East China Normal University).
文摘The Internet of Things(IoT)can realize the interconnection of people,machines,and things anytime,anywhere.Most of the existing research mainly focuses on the practical applications of IoT,and there is a lack of research on modeling and reasoning about IoT systems from the perspective of formal methods.Thus,the Calculus of the Internet of Things(CaIT)has been proposed to specify and analyze IoT systems before the actual implementation,which can effectively improve development efficiency,and enhance system quality and reliability.To verify the correctness of IoT systems described by CaIT,this paper presents a proof system for CaIT,in which specifications and verifications are based on the extended Hoare Logic with time.Furthermore,we explore the cooperation between isolated proofs to validate the postconditions of the communication actions occurring in these proofs,with a particular focus on broadcast communication.We also demonstrate the soundness of our proof system.A simple“smart home”is given to illustrate the availability of our proof system.
文摘In the design of dependable software for embed- ded and real-time operating systems, time analysis is a cru- cial but extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important and challenging. In this paper, we present a pro- gramming language to describe programs with interrupts that is comprised of two essential parts： main program and inter- rupt handling programs. We also explore a timed operational semantics and a denotational semantics to specify the mean- ings of our language. Furthermore, a strategy of deriving de- notational semantics from the timed operational semantics is provided to demonstrate the soundness of our operational se- mantics by showing the consistency between the derived de- notational semantics and the original denotational semantics.
