Semantical proofs of correctness for programs performing non-deterministic tests on real numbers. Anberrée, T. Math. Structures Comput. Sci., 20(5):723–751, 2010.
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers [link]Paper  doi  bibtex   
@ARTICLE{Anb10,
  author = {Anberr{\'e}e, Thomas},
  title = {Semantical proofs of correctness for programs performing non-deterministic
	tests on real numbers},
  journal = {Math. Structures Comput. Sci.},
  year = {2010},
  volume = {20},
  pages = {723--751},
  number = {5},
  doi = {10.1017/S0960129510000186},
  file = {Anb10.pdf:Anb10.pdf:PDF},
  fjournal = {Mathematical Structures in Computer Science. A Journal in the Applications
	of Categorical, Algebraic and Geometric Methods in Computer Science},
  issn = {0960-1295},
  keywords = {bib,cca},
  mrclass = {68N18 (68Q55)},
  mrnumber = {2735840 (2012a:68041)},
  owner = {Vasco},
  timestamp = {2014.10.18},
  url = {http://dx.doi.org/10.1017/S0960129510000186}
}

Downloads: 0