Cartesian hoare logic for verifying k-safety properties

Authors:
Open Access
Publisher website
Google Scholar
Abstract
Unlike safety properties which require the absence of a “bad” program trace, k-safety properties stipulate the absence of a “bad” interaction between k traces. Examples of k-safety properties include transitivity, associativity, anti-symmetry, and monotonicity. This paper presents a sound and relatively complete calculus, called Cartesian Hoare Logic (CHL), for verifying k-safety properties. We also present an automated verification algorithm based on CHL and implement it in a tool called DESCARTES. We use DESCARTES to analyze user-defined relational operators in Java and demonstrate that DESCARTES is effective at verifying (or finding violations of) multiple k-safety properties.
Funding Information
  • National Science Foundation (1453386)
  • Air Force Research Laboratory (8750-15-2-0096, 8750-14-2-0270)

This publication has 26 references indexed in Scilit: