TY  - UNPD
A1  - Schmidt-Schauß, Manfred
A1  - Sabel, David
T1  - Closures of may and must convergence for contextual equivalence
T2  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 35
N2  - We show on an abstract level that contextual equivalence in non-deterministic program calculi defined by may- and must-convergence is maximal in the following sense. Using also all the test predicates generated by the Boolean, forall- and existential closure of may- and must-convergence does not change the contextual equivalence. The situation is different if may- and total must-convergence is used, where an expression totally must-converges if all reductions are finite and terminate with a value: There is an infinite sequence of test-predicates generated by the Boolean, forall- and existential closure of may- and total must-convergence, which also leads to an infinite sequence of different contextual equalities.
T3  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik - 35 
KW  - Formale Semantik
KW  - Programmkalküle
KW  - Programmkorrektheit
KW  - formal semantics
KW  - programming calculi
KW  - program correctness
Y1  - 2008
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/6176
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-61000
UR  - http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank35maymust.pdf
IS  - 12
SP  - 12
EP  - 1
PB  - Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
CY  - Frankfurt [am Main]
ER  -