Alban Ponse

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 Jan Friso Groote

> Home > Persons > Alban Ponse

Publications

2001
[j12]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jlp/GrootePU01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlp/GrootePU01
Jan Friso Groote, Alban Ponse, Yaroslav S. Usenko:
Linearization in parallel pCRL. J. Log. Algebraic Methods Program. 48(1-2): 39-70 (2001)
1994
[j2]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/fac/GrooteP94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fac/GrooteP94
Jan Friso Groote, Alban Ponse:
Process Algebra with Guards: Combining Hoare Logic with Process Algebra. Formal Aspects Comput. 6(2): 115-164 (1994)
1993
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/sosl/GrooteP93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosl/GrooteP93
Jan Friso Groote, Alban Ponse:
Proof Theory for µCRL: A Language for Processes with Data. Semantics of Specification Languages 1993: 232-251
1991
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/concur/GrooteP91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/GrooteP91
Jan Friso Groote, Alban Ponse:
Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract). CONCUR 1991: 235-249

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.