Alexander Gurney
[contact
|publications
|teaching
|history]
current activities.
I am a postdoc at the University of Pennsylvania, working
with Boon Thau Loo
and others. My main area of research is the formal analysis of
Internet routing algorithms and policies, and related topics.
| physical |
Distributed Systems Laboratory (Moore 102)
Department of Computer and Information Science
University of Pennsylvania
200 South 33rd Street
Philadelphia, PA 19104-6389, USA |
|---|
| email | It ends with seas.upenn.edu, begins agurney, and there's an @ in the middle.
Or try putting alexander.gurney in front of @gmail.com. |
|---|
-
Anduo Wang, Carolyn Talcott, Alexander J. T. Gurney, Boon Thau Loo and Andre Scedrov.
2012.
A calculus of policy-based routing systems (brief announcement).
31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012), Madeira.
-
Anduo Wang, Carolyn Talcott, Alexander J. T. Gurney, Boon Thau Loo and Andre Scedrov.
2012.
Reduction-based Formal Analysis of BGP Instances.
18th International Conference on Tools and Algorithms for
the Construction and Analysis of Systems (TACAS), Tallinn.
-
Alexander J. T. Gurney, Andreas Haeberlen, Wenchao Zhou, Micah Sherr and Boon Thau Loo.
2011.
Having your cake and eating it too: Routing security with privacy protections.
Tenth ACM Workshop on Hot Topics in Networking (HotNets-X), Boston.
-
Alexander J. T. Gurney, Limin Jia, Anduo Wang and Boon Thau Loo.
2011.
Partial specification of routing configurations.
Workshop on Rigorous Protocol Engineering (WRiPE 2011), Vancouver.
-
Alexander J. T. Gurney and Timothy G. Griffin.
2011.
Pathfinding through congruences.
Proceedings of the 12th International Conference on Relational and
Algebraic Methods in Computer Science (RAMICS 2011), Rotterdam.
Springer LNCS 6663, p180-195.
-
Alexander J. T. Gurney and Timothy G. Griffin.
2010.
Neighbor-specific BGP: An algebraic exploration.
Proceedings of the 18th IEEE International Conference on Network Protocols (ICNP 2010), Kyoto, pages 103–112.
-
Alexander J. T. Gurney.
2009.
Construction and verification of routing algebras.
PhD thesis, University of Cambridge.
-
Timothy G. Griffin and Alexander J. T. Gurney.
2008.
Increasing bisemigroups and algebraic routing.
Proceedings of the 10th International Conference on Relational Methods in Computer Science (RelMiCS 10), Frauenworth, Germany.
Also appeared as LNCS, volume 4988.
- Alexander J. T. Gurney and Timothy G. Griffin. 2007.
Lexicographic products in metarouting.
Proceedings of the 15th IEEE International Conference on Network Protocols (ICNP 2007), Beijing.
At Penn, I was co-instructor for a graduate seminar course on
rigorous Internet
protocol engineering (CIS 800/003) in Fall 2011.
At Cambridge I have supervised students in:
- Algorithms II
- Compiler construction
- Concepts in programming languages
- Denotational semantics
- Foundations of functional programming [now incorporated into Computation Theory]
- Optimizing compilers
- Quantum computing
education.
- 2005–2009: University of Cambridge, UK
- PhD — Construction and verification of routing algebras (see above)
- 2001–2005: University of York, UK.
- MMath, Mathematics and Computer Science. First-class honours with distinction.
Third-year project: A component library for category theory constructions
.
Supervised by Alan Wood.
Fourth-year project: Supergraph enumeration for complex networks
.
Supervised by Gustav Delius.
Departmental prize for outstanding achievement, 2005.
- 1994–2001: Reading School, Reading, UK.
- A-levels in English Literature, French, Mathematics, Further Mathematics (AAAB). Mathematics Special Paper (Distinction). GCSEs (3 A*, 8 A), Certificate in Additional Mathematics (A).
employment.
- 2011– : University of Pennsylvania
- Postdoctoral researcher
- 2009–2010: Computer Laboratory,
University of Cambridge
- Postdoctoral research assistant/associate
- 2000– : ORH Ltd., Reading, UK
- Writing and maintaining simulation software for ambulance service operations.
- Summer 2003: Canon Research Centre Europe, Bracknell, UK
- Integrating a named entity recognition engine into Microsoft Outlook, to scan emails, calendar items, and so on for names of people, companies and places, deduce relationships among them, and visualize the results within the Outlook interface.