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...
Autors principals: | McIver, A, Morgan, C |
---|---|
Altres autors: | Plotkin, G |
Format: | Journal article |
Idioma: | English |
Publicat: |
Elsevier
2001
|
Matèries: |
Ítems similars
-
Probabilistic guarded commands mechanized in HOL
per: Hurd, J, et al.
Publicat: (2005) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
per: McIver, A
Publicat: (2002) -
Program analysis with interpolants
per: Weissenbacher, G, et al.
Publicat: (2010) -
Predicate Abstraction of ANSI-C Programs Using SAT
per: Clarke, E, et al.
Publicat: (2004) -
Monotonicity in shared-memory program verification
per: Kaiser, A
Publicat: (2013)