`Travelled to:`

1 × Canada

1 × Sweden

1 × United Kingdom

2 × Italy

2 × USA

`Collaborated with:`

D.Jackson A.Milicevic E.Kang ∅ W.E.Byrd D.P.Friedman D.Rayside Z.Benjamin R.Singh D.Darais Chike Abuah Tim Stevens Pranav Gaddamadugu L.Wang Neel Somani Mu Zhang 0001 N.Sharma Alex Shan D.Song

`Talks about:`

order (3) analysi (2) higher (2) applic (2) relat (2) logic (2) web (2) lightweight (1) differenti (1) constraint (1)

## Person: Joseph P. Near

### DBLP: Near:Joseph_P=

### Contributed to:

### Wrote 8 papers:

- ICSE-v1-2015-MilicevicNKJ #constraints #higher-order #relational #theorem proving
- Alloy*: A General-Purpose Higher-Order Relational Constraint Solver (AM, JPN, EK, DJ), pp. 609–619.
- ASE-2014-NearJ #analysis #interactive #named #security #web
- Derailer: interactive security analysis for web applications (JPN, DJ), pp. 587–598.
- FSE-2012-NearJ #bound #named #verification #web
- Rubicon: bounded verification of web applications (JPN, DJ), p. 60.
- ICSE-2011-NearMKJ #analysis #dependence #evaluation #lightweight
- A lightweight code analysis and its role in evaluation of a dependability case (JPN, AM, EK, DJ), pp. 31–40.
- ICLP-2010-Near10 #logic programming #relational #source code #specification
- From Relational Specifications to Logic Programs (JPN), pp. 144–153.
- ICSE-2009-RaysideBSNMJ #abstraction #generative #implementation #similarity
- Equality and hashing for (almost) free: Generating implementations from abstraction functions (DR, ZB, RS, JPN, AM, DJ), pp. 342–352.
- ICLP-2008-NearBF #declarative #first-order #logic #named #proving #theorem proving
- αleanTAP: A Declarative Theorem Prover for First-Order Classical Logic (JPN, WEB, DPF), pp. 238–252.
- OOPSLA-2019-NearDASGWSZSSS #difference #higher-order #linear #named #privacy #type system
- Duet: an expressive higher-order language and linear type system for statically enforcing differential privacy (JPN, DD, CA, TS, PG, LW, NS, MZ0, NS, AS, DS), p. 30.