Partial correctness for probabilistic demonic programs
Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171–192) and an axiomatic (Morgan et al., ACM Trans. Programming Languages Systems 18(3) (1996) 325–353; Seidel et al., Tech Report PRG-TR-6-96, Programming Research grou...
المؤلفون الرئيسيون: | McIver, A, Morgan, C |
---|---|
مؤلفون آخرون: | Plotkin, G |
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
Elsevier
2001
|
الموضوعات: |
مواد مشابهة
-
Probabilistic guarded commands mechanized in HOL
حسب: Hurd, J, وآخرون
منشور في: (2005) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
حسب: McIver, A
منشور في: (2002) -
Program analysis with interpolants
حسب: Weissenbacher, G, وآخرون
منشور في: (2010) -
Predicate Abstraction of ANSI-C Programs Using SAT
حسب: Clarke, E, وآخرون
منشور في: (2004) -
Monotonicity in shared-memory program verification
حسب: Kaiser, A
منشور في: (2013)