Logic in Computer Science (LICS 1994)

Paper: Passivity and independence (at LICS 1994)

Authors: Uday Reddy

Abstract

Most programming languages have certain phrases (like expressions) which only read information from the state and certain others (like commands) which write information to the state. These are called passive and active phrases respectively. Semantic models which make these distinctions have been hard to find. For instance, most semantic models have expression denotations that (temporarily) change the state. Common reasoning principles, such as the Hoare's assignment axiom, are not valid in such models. We define here a semantic model which captures the notions of “change”, “absence of change” and “independent change” etc. This is done by extending the author's “linear logic model of state” with dependence/independence relations so that sequential traces give way to pomset traces

BibTeX

  @InProceedings{Reddy-Passivityandindepen,
    author = 	 {Uday Reddy},
    title = 	 {Passivity and independence},
    booktitle =  {Proceedings of the Ninth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1994},
    year =	 1994,
    editor =	 {Samson Abramsky},
    month =	 {July}, 
    pages =      {342--352},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }