Thai Son Hoang

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Annabelle McIver

> Home > Persons > Thai Son Hoang

Publications

2014
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/fac/HoangMMMSS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fac/HoangMMMSS14
Thai Son Hoang, A. K. McIver, Larissa Meinicke, Carroll C. Morgan, Anthony Sloane, E. Susatyo:
Abstractions of non-interference security: probabilistic versus possibilistic. Formal Aspects Comput. 26(1): 169-194 (2014)
2005
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/zum/HoangJRMM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/zum/HoangJRMM05
Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan:
Development via Refinement in Probabilistic B - Foundation and Case Study. ZB 2005: 355-373
2003
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/zum/McIverMH03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/zum/McIverMH03
Annabelle McIver, Carroll Morgan, Thai Son Hoang:
Probabilistic Termination in B. ZB 2003: 216-239
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/zum/HoangJRMM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/zum/HoangJRMM03
Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan:
Probabilistic Invariants for Probabilistic Machines. ZB 2003: 240-259

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.