Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Andrew D. Gordon

Andrew D. Gordon is a British computer scientist employed by Microsoft Research. His research interests include programming language design, formal… Expand
Wikipedia

Related topics

Related topics

16 relations
Access controlActor model and process calculiAmbient calculusCoinduction
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Automatic generation of specifications using verification tools = Automatische Spezifikationserzeugung mit Hilfe von Verifikationswerkzeugen
This dissertation deals with the automatic generation of sound specifications from a given program in the form of loop invariants… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.5
2013
2013
Formal Verification of Voting and Auction Protocols : From Privacy to Fairness and Verifiability
In this document, we formally analyze security in electronic voting and electronic auctions. On-line voting over is now available… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
2011
2011
Les ressources explicites vues par la théorie de la réécriture. (Explicit resources from the rewriting point of view)
Cette these s'articule autour de la gestion de ressources explicites dans les langages fonctionnels, en mettant l'accent sur des… Expand
  • figure 5.2
  • figure 5.3
  • figure 6.1
  • figure 6.2
  • figure 6.3
2011
2011
Automatically Verifying Typing Constraints for a Data Processing Language
In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order… Expand
  • table 1
  • table 2
2007
2007
Detecting Replay Attacks by Freshness Annotations
We present a reduction semantics for the LYSA calculus extended with session information and a static analysis for it. If a… Expand
  • table 1
  • table 2
2007
2007
Multi-tier programming
Multi-tier applications are traditionally designed in the style of a client-server architecture, forcing different parts of the… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.4
  • figure 1.5
  • figure 1.6
2007
2007
Sécurité des protocoles cryptographiques : décidabilité et résultats de transfert. (Security of cryptographic protocols: decidability and transfer resultats)
Cette these se situe dans le cadre de l'analyse symbolique des protocoles Les contributions sont representees par l'obtention de… Expand
2005
2005
Finding Resource Bounds in the Presence of Explicit Deallocation
A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is… Expand
  • figure 2.1
  • table 3.2
  • figure 4.1
  • table 4.2
  • table 5.3
1999
1999
Observational Mu-Calculus
We propose an extended modal mu-calculus to provide an `assembly language' for modal logics for real time, value-passing calculi… Expand
1985
1985
A natural bi-generic fern hybrid between Christella dentata and Pneumatopteris afra, from Ghana
s 473 frequent, together with A. dolomiticum Love, in at least one hundred localities across the karst plateaus of Lika and… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE