• DocumentCode
    596192
  • Title

    Proving Liveness Property under Fairness Requirements

  • Author

    Teng Long ; Wenhui Zhang

  • Author_Institution
    State Key Lab. of Comput. Sci., Grad. Univ. of China Acad. of Sci., Beijing, China
  • Volume
    1
  • fYear
    2012
  • fDate
    4-7 Dec. 2012
  • Firstpage
    674
  • Lastpage
    682
  • Abstract
    Different rules for proving properties have been studied for systems with different kinds of fairness constraints, such as justice, compassion and strengthened compassion. This work considers a kind of bounded fairness and propose a general form that includes these fairness constraints. The general form is referred to as mixed-fairness (m-fairness for short). A deductive rule for proving live ness properties under m-fairness is presented with examples illustrating the application of the deductive rule.
  • Keywords
    inference mechanisms; bounded fairness; deductive rule; fairness constraints; fairness requirements; liveness property proving; m-fairness; mixed-fairness; Computational modeling; Computer science; Educational institutions; Electronic mail; Indexes; Laboratories; Software; deductive proof; fairness; ranking function;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering Conference (APSEC), 2012 19th Asia-Pacific
  • Conference_Location
    Hong Kong
  • ISSN
    1530-1362
  • Print_ISBN
    978-1-4673-4930-7
  • Type

    conf

  • DOI
    10.1109/APSEC.2012.15
  • Filename
    6462723