• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

Previous Articles     Next Articles

Deductive proof of security-relevant
properties under bounded constraints

LONG Teng1,2,XU Zhi-wu3   

  1. (1.School of Information Engineering,China University of Geosciences,Beijing 100083;
    2.State Key Laboratory of Computer Science,Institute of Software,Chinese Academy of Sciences,Beijing 100190;
    3.College of Computer Science and Software Engineering,Shenzhen University,Shenzhen 518060,China)
     
  • Received:2016-12-17 Revised:2017-02-20 Online:2017-04-25 Published:2017-04-25

Abstract:

Security-relevant properties such as access control in a complex environment play a very important role. In terms of procedural verification, not only the safety and activity verification are considered, but the nature of some security policies, such as non-interference, should also be considered. These security policies that cannot be described by the general nature can be considered as “hypersafety”. Boundary constraints are common to represent different degrees of access frequency restrictions. They are one of the effective auxiliary methods in safety-related property verification, and have wide application value in the attribute verification of wireless sensor network protocols, embedded systems and other important fields. Based on the above description, we propose an approach for extracting deductive proof of security-relevant properties under bounded constraints.

Key words: bounded constraints, hypersafety, security-relevant properties, deductive proof