• DocumentCode
    2416554
  • Title

    Implementing angelic nondeterminism

  • Author

    Celiku, Orieta ; Von Wright, Joakim

  • Author_Institution
    Turku Centre for Comput. Sci., Abo Akad., Turku, Finland
  • fYear
    2003
  • fDate
    10-12 Dec. 2003
  • Firstpage
    176
  • Lastpage
    185
  • Abstract
    We extend correctness and refinement reasoning methods in order to show how angelic nondeterminism can be systematically transformed into demonic nondeterminism or determinism. This kind of transformation is important because angelic nondeterminism assumes that an agent interested in establishing the postcondition will resolve the choices intelligently. When angelic nondeterminism is reduced into demonic nondeterminism or determinism, such intelligent choices are no longer necessary. Reducing angelic nondeterminism is generally not a refinement; however, when context is taken into consideration, it can be a correctness-preserving transformation.
  • Keywords
    formal specification; reasoning about programs; refinement calculus; angelic nondeterminism; demonic nondeterminism; program correctness-preserving transformation; refinement reasoning method; Calculus; Computer science; Control systems; Data mining; Greedy algorithms; Intelligent agent; Logic; Software engineering; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering Conference, 2003. Tenth Asia-Pacific
  • Print_ISBN
    0-7695-2011-1
  • Type

    conf

  • DOI
    10.1109/APSEC.2003.1254370
  • Filename
    1254370