Post Job Free
Sign in

Access Control Project

Location:
Hartford, CT
Posted:
November 17, 2012

Contact this candidate

Resume:

JUSTIN POMBRIO

860-***-****

******@*****.***

justinpombrio.net

Current Address Permanent Address

*** ****** ****** ** ******* Alley

Somerville, MA 02143 Manchester, CT 06040

Education Worcester Polytechnic Institute, Worcester, MA May 2011

Bachelor of Science in Computer Science

Bachelor of Science in Mathematical Science

GPA 3.87

Coursework Computer Science Mathematics

Software Engineering Analysis of Algorithms

Object Oriented Analysis and Design Discrete Optimization

Operating Systems Matrices and Linear Algebra

Programming Language Translation Numerical Methods for Linear Systems

Programming Language Design Combinatorics

Computer Architecture

Skills Languages Tools

Expert C, Java, Python, Scheme, Haskell Emacs, LaTeX

Novice Javascript, C++, SQL, Ocaml, Bash Eclipse, DevCpp

Experience Kayak, Concord, MA June 2011 Present

I currently work at Kayak, on the Kayak Network advertising team. At the moment I am

redesigning the framework the account managers use to manage ads. While most of my

contributions are back-end improvements or features for KN's account managers, if you see a

right-rail ad with a star rating or with a list of links separated by dashes that was my doing.

Chitika, Marlborough, MA May Aug 2008

Chitika is a small internet advertising company. Some of my contributions include

automating click-fraud detection, and writing a script that behaves like the map function, but

actually distributes the computation across Amazon EC2 instances.

Major Qualifying Project, WPI March 2010 Present

The Strand Space Formalism is a mathematical model, developed at MITRE, that is used to

reason about cryptographic protocols. It may, for instance, be used to prove the correctness

of the Transport Layer Security (TLS) protocol.

My research project, led by Professor Daniel Dougherty and Professor Joshua Guttman

(formally at MITRE), involved expressing the Strand Space Formalism in first order logic.

An algorithm called the Chase can then be used to verify cryptographic protocols with a

computer.

I also looked at some questions about graph isomorphism that came up, with the guidance of

Pofessor Peter Christopher.

Summer Undergraduate Research Fellowship, WPI June July 2009

Access control policies are usually studied without regard to the system they are trying to

regulate. The policy for a library, for instance, may disregard the state of the books

whether they are checked in or out. This research project involved simulating access control

policies in the context of their environments, using a programming language called Maude.

dd



Contact this candidate