Joe Near

Assistant Professor
University of Vermont
Office: E458 Innovation Hall
E-mail: jnear at uvm dot edu
[ CV ]

[ Teaching | Projects | Publications | Press ]

I'm currently looking for PhD students! If you're interested in working with me on research projects in data privacy or security, please e-mail me.

Research Interests

My research interests include data privacy, security, programming languages, and software engineering. My research to date focuses on the theory, design, and implementation of algorithms and programming systems (programming languages, static analyses, and runtime systems) that enable provable security and privacy.


Teaching


Projects


Publications

  • Duet: An Expressive Higher-Order Language and Linear Type System for Statically Enforcing Differential Privacy.
    Joseph P. Near, David Darais, Chike Abuah, Tim Stevens, Pranav Gaddamadugu, Lun Wang, Neel Somani, Mu Zhang, Nikhil Sharma, Alex Shan, and Dawn Song.
    In Object-oriented Programming, Systems, Languages, and Applications (OOPSLA). 2019. (pdf)

  • Data Capsule: A New Paradigm for Automatic Compliance of Data Privacy Regulations.
    Lun Wang, Joseph P. Near, Neel Somani, Peng Gao, Andrew Low, David Dao, and Dawn Song.
    In POLY19 Workshop @ VLDB2019. 2019. (pdf)

  • Chorus: Differential Privacy via Query Rewriting.
    Noah Johnson, Joseph P. Near, Joseph M. Hellerstein, and Dawn Song.
    CoRR, abs/1809.07750, 2018.

  • Towards Practical Differentially Private Convex Optimization.
    Roger Iyengar, Joseph P. Near, Dawn Song, Om Thakkar, Abhradeep Thakurta, Lun Wang.
    In Proceedings of the 40th IEEE Symposium on Security and Privacy, 2019. (pdf)

  • Towards practical differential privacy for SQL queries.
    Noah Johnson, Joseph P. Near, and Dawn Song.
    In Proceedings of the 34th International Conference on Very Large Data Bases, 2018.

  • Towards practical differential privacy for SQL queries.
    Noah Johnson, Joseph P. Near, and Dawn Song.
    CoRR, abs/1706.09479, 2017.

  • Alloy*: a general-purpose higher-order relational constraint solver.
    Aleksandar Milicevic, Joseph P. Near, Eunsuk Kang, and Daniel Jackson.
    Formal Methods in System Design, Jan 2017.

  • Finding security bugs in web applications using a catalog of access control patterns.
    Joseph P. Near and Daniel Jackson.
    In Proceedings of the 38th ACM/IEEE International Conference on Software Engineering (ICSE), 2016. (pdf)

  • Alloy*: A general-purpose higher-order relational constraint solver.
    Aleksandar Milicevic, Joseph P. Near, Eunsuk Kang, and Daniel Jackson.
    In Proceedings of the 37th ACM/IEEE International Conference on Software Engineering (ICSE), 2015.
    Distinguished paper award. (pdf)

  • Finding Security Bugs in Web Applications using Domain-Specific Static Analysis.
    Joseph P. Near.
    MIT PhD Thesis, 2015.

  • Derailer: Interactive Security Analysis for Web Applications.
    Joseph P. Near and Daniel Jackson.
    In Proceedings of the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE), 2014. (pdf)

  • Alloy*: A higher-order relational constraint solver.
    Aleksandar Milicevic, Joseph P. Near, Eunsuk Kang, and Daniel Jackson.
    Technical Report MIT-CSAIL-TR-2014-018, Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, Massachusetts, 2014. (link)

  • Symbolic execution for (almost) free: Hijacking an existing implementation to perform symbolic execution.
    Joseph P. Near and Daniel Jackson.
    Technical Report MIT-CSAIL-TR-2014-007, Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, Massachusetts, April 2014. (pdf)

  • Applications and extensions of Alloy: past, present and future.
    Emina Torlak, Mana Taghdiri, Greg Dennis, and Joseph P. Near.
    In Mathematical Structures in Computer Science, volume 23 number 4, 2013.

  • Rubicon: bounded verification of web applications.
    Joseph P. Near and Daniel Jackson.
    In Proceedings of the 20th International Symposium on the Foundations of Software Engineering (FSE), 2012. (pdf)

  • A lightweight code analysis and its role in evaluation of a dependability case.
    Joseph P. Near, Aleksandar Milicevic, Eunsuk Kang and Daniel Jackson.
    In Proceedings of the 33rd International Conference on Software Engineering (ICSE), 2011.

  • An Imperative Extension to Alloy and a Compiler for its Execution.
    Joseph P. Near.
    MIT Masters Thesis, 2010. (pdf)

  • From Relational Specifications to Logic Programs.
    Joseph P. Near.
    In Proceedings of the 26th International Conference on Logic Programming (Technical Communications), 2010. (pdf)

  • An Imperative Extension to Alloy.
    Joseph P. Near and Daniel Jackson.
    In Proceedings of the 2nd International Conference on Abstract State Machines, Alloy, B and Z, 2010. (pdf)

  • Equality and Hashing for (almost) Free: Generating Implementations from Abstraction Functions.
    Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic, and Daniel Jackson.
    In Proceedings of the 31st International Conference on Software Engineering, 2009.

  • alphaleanTAP: A Declarative Theorem Prover for First-Order Classical Logic.
    Joseph P. Near, William E. Byrd, and Daniel P. Friedman.
    In Proceedings of the 24th International Conference on Logic Programming, 2008. (pdf)

Selected Press


Older Projects

E458 Innovation Hall, Burlington, VT