default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Gammie
Person information
- affiliation: Australian National University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Peter Gammie:
ConcurrentHOL. Arch. Formal Proofs 2024 (2024)- 2020
- [j14]Peter Gammie:
Putting the 'K' into Bird's derivation of Knuth-Morris-Pratt string matching. Arch. Formal Proofs 2020 (2020)
2010 – 2019
- 2017
- [j13]Peter Gammie, Gianpaolo Gioiosa:
The Kuratowski Closure-Complement Theorem. Arch. Formal Proofs 2017 (2017) - 2016
- [j12]Peter Gammie:
Stable Matching. Arch. Formal Proofs 2016 (2016) - 2015
- [j11]Peter Gammie:
Concurrent IMP. Arch. Formal Proofs 2015 (2015) - [j10]Peter Gammie, Tony Hosking, Kai Engelhardt:
Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO. Arch. Formal Proofs 2015 (2015) - [j9]Peter Gammie, Andreas Lochbihler:
The Stern-Brocot Tree. Arch. Formal Proofs 2015 (2015) - [c8]Peter Gammie, Antony L. Hosking
, Kai Engelhardt:
Relaxing safely: verified on-the-fly garbage collection for x86-TSO. PLDI 2015: 99-109 - 2013
- [j8]Peter Gammie:
Synchronous digital circuits as functional programs. ACM Comput. Surv. 46(2): 21:1-21:27 (2013) - [c7]Toby C. Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie, Timothy Bourke, Sean Seefried, Corey Lewis, Xin Gao, Gerwin Klein:
seL4: From General Purpose to a Proof of Information Flow Enforcement. IEEE Symposium on Security and Privacy 2013: 415-429 - 2012
- [j7]Peter Gammie:
Logical Relations for PCF. Arch. Formal Proofs 2012 (2012) - [c6]Toby C. Murray, Daniel Matichuk, Matthew Brassil, Peter Gammie, Gerwin Klein:
Noninterference for Operating System Kernels. CPP 2012: 126-142 - 2011
- [j6]Peter Gammie:
Knowledge-based programs. Arch. Formal Proofs 2011 (2011) - [j5]Peter Gammie:
Review: Lambda-Calculus and Combinators: An Introduction, Second Edition by J. R. Hindley and J. P. Seldin. J. Funct. Program. 21(1): 115-117 (2011) - [j4]Peter Gammie:
Short note: Strict unwraps make worker/wrapper fusion totally correct. J. Funct. Program. 21(2): 209-213 (2011) - [c5]Gerwin Klein, Toby C. Murray, Peter Gammie, Thomas Sewell, Simon Winwood:
Provable Security: How Feasible Is It? HotOS 2011 - [c4]Peter Gammie:
Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments. ITP 2011: 87-102 - [c3]Thomas Sewell, Simon Winwood, Peter Gammie, Toby C. Murray, June Andronick, Gerwin Klein:
seL4 Enforces Integrity. ITP 2011: 325-340
2000 – 2009
- 2009
- [j3]Peter Gammie:
The Worker/Wrapper Transformation. Arch. Formal Proofs 2009 (2009) - [j2]Peter Gammie:
Peter Van Roy and Seif Haridi. Concepts, Techniques, and Models of Computer Programming. The MIT Press, 2004. ISBN: 0262220695 Price $70. 930pp. J. Funct. Program. 19(2): 254-256 (2009) - 2008
- [j1]Peter Gammie:
Some classical results in Social Choice Theory. Arch. Formal Proofs 2008 (2008) - 2007
- [c2]Kai Engelhardt, Peter Gammie, Ron van der Meyden:
Model Checking Knowledge and Linear Time: PSPACE Cases. LFCS 2007: 195-211 - 2004
- [c1]Peter Gammie, Ron van der Meyden:
MCK: Model Checking the Logic of Knowledge. CAV 2004: 479-483
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
