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...
Main Authors: | McIver, A, Morgan, C |
---|---|
Other Authors: | Plotkin, G |
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2001
|
Subjects: |
Similar Items
-
Probabilistic guarded commands mechanized in HOL
by: Hurd, J, et al.
Published: (2005) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
by: McIver, A
Published: (2002) -
Program analysis with interpolants
by: Weissenbacher, G, et al.
Published: (2010) -
Predicate Abstraction of ANSI-C Programs Using SAT
by: Clarke, E, et al.
Published: (2004) -
Monotonicity in shared-memory program verification
by: Kaiser, A
Published: (2013)