Geoffrey M. Brown

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 Lee Pike

> Home > Persons > Geoffrey M. Brown

Publications

2011
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/fac/BrownP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fac/BrownP11
Geoffrey M. Brown, Lee Pike:
Automated verification and refinement for physical-layer protocols. Formal Aspects Comput. 23(3): 243-266 (2011)
2009
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/haskell/PikeBG09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/haskell/PikeBG09
Lee Pike, Geoffrey M. Brown, Alwyn Goodloe:
Roll your own test bed for embedded real-time protocols: a haskell experience. Haskell 2009: 61-68
2007
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/memocode/BrownP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/memocode/BrownP07
Geoffrey M. Brown, Lee Pike:
Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols. MEMOCODE 2007: 171-180
2006
[c6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/tacas/BrownP06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tacas/BrownP06
Geoffrey M. Brown, Lee Pike:
Easy Parameterized Verification of Biphase Mark and 8N1 Protocols. TACAS 2006: 58-72

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.