Alternate Semantics of the Guarded Conditional

23 pages•Published: May 26, 2024

Abstract

The various possible semantics of Dijkstra’s guarded commands are elucidated by means of a new graph-based low-level, generic specification language designed for asynchronous nondeterministic algorithms. The graphs incorporate vertices for actions and edges indicating control flow alongside edges for data flow. This formalism allows one to specify, not just input-output behavior nor only what actions take place, but also precisely how often and in what order they transpire.

Keyphrases: guarded commands, nondeterminism, operational semantics

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). LPAR 2024 Complementary Volume, vol 18, pages 30-52.

Links:	https://easychair.org/publications/paper/1HKl
	https://doi.org/10.29007/2kx9

BibTeX entry

@inproceedings{LPAR2024C:Alternate_Semantics_Guarded_Conditional,
  author    = {Nachum Dershowitz},
  title     = {Alternate Semantics of the Guarded Conditional},
  booktitle = {LPAR 2024 Complementary Volume},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {18},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/1HKl},
  doi       = {10.29007/2kx9},
  pages     = {30-52},
  year      = {2024}}

Download PDF Open PDF in browser