| 2007 |
|---|
| 29 | EE | Robert M. Marmorstein,
Phil Kearns:
Assisted Firewall Policy Repair Using Examples and History.
LISA 2007: 27-37 |
| 2006 |
|---|
| 28 | EE | Robert M. Marmorstein,
Phil Kearns:
Firewall Analysis with Policy-based Host Classification.
LISA 2006: 41-51 |
| 27 | EE | Tracy Camp,
Phil Kearns:
Fast batched data transfer with flush channels: A performance analysis.
J. Parallel Distrib. Comput. 66(6): 780-795 (2006) |
| 26 | EE | Sharon Simmons,
Dennis Edwards,
Phil Kearns:
Communication analysis of distributed programs.
Scientific Programming 14(2): 151-170 (2006) |
| 2005 |
|---|
| 25 | EE | Robert M. Marmorstein,
Phil Kearns:
An Open Source Solution for Testing NAT'd and Nested iptables Firewalls.
LISA 2005: 103-112 |
| 24 | EE | James Deverick,
Phil Kearns:
Towards a Deep-Packet-Filter Toolkit for Securing Legacy Resources.
LISA 2005: 237-248 |
| 23 | EE | Robert M. Marmorstein,
Phil Kearns:
A Tool for Automated iptables Firewall Analysis.
USENIX Annual Technical Conference, FREENIX Track 2005: 71-81 |
| 2004 |
|---|
| 22 | EE | Serge E. Hallyn,
Phil Kearns:
Modular Construction of DTE Policies.
USENIX Annual Technical Conference, FREENIX Track 2004: 81-91 |
| 2003 |
|---|
| 21 | | Robert Matthews,
Phil Kearns:
On-Line Rollback in Log-Structured File Systems.
CAINE 2003: 11-16 |
| 20 | | Jeffrey Dobbelaere,
Phil Kearns,
Jean Mayo:
The Advantages of Real Time in TORA.
CAINE 2003: 225-229 |
| 2002 |
|---|
| 19 | | Natasha Jarymowycz,
Phil Kearns:
Valid Debugging for Distributed Shared Memory.
PDPTA 2002: 624-630 |
| 2001 |
|---|
| 18 | EE | Serge E. Hallyn,
Phil Kearns:
Tools to Administer Domain and Type Enforcement.
LISA 2001: 151-156 |
| 1999 |
|---|
| 17 | EE | Jean Mayo,
Phil Kearns:
Distributed Deadlock Detection and Resolution Based on Hardware Clocks.
ICDCS 1999: 208-215 |
| 16 | EE | Jean Mayo,
Phil Kearns:
A secure unrestricted advanced systems laboratory.
SIGCSE 1999: 165-169 |
| 1995 |
|---|
| 15 | | Anna Brunstrom,
Phil Kearns:
A User Level Implementation of Flush Channels.
Parallel and Distributed Computing and Systems 1995: 125-128 |
| 14 | | Jean Mayo,
Phil Kearns:
Efficient Distributed Termination Detection with Roughly Synchronized Clocks.
Parallel and Distributed Computing and Systems 1995: 305-307 |
| 13 | | Sharon Simmons,
Phil Kearns:
A Causal Assert Statement for Distributed Systems.
Parallel and Distributed Computing and Systems 1995: 495-498 |
| 1994 |
|---|
| 12 | | Jean Mayo,
Phil Kearns:
Distributed Termination Detection with Roughly Synchronized Clocks.
Inf. Process. Lett. 52(2): 105-108 (1994) |
| 1993 |
|---|
| 11 | | S. L. Peterson,
Phil Kearns:
Rollback Based on Vector Time.
SRDS 1993: 68-77 |
| 10 | EE | Tracy Camp,
Phil Kearns,
Mohan Ahuja:
Proof Rules for Flush Channels.
IEEE Trans. Software Eng. 19(4): 366-378 (1993) |
| 9 | EE | William S. Lloyd,
Phil Kearns:
Tracing the execution of distributed programs.
Journal of Systems and Software 21(3): 201-214 (1993) |
| 1992 |
|---|
| 8 | | Phil Kearns,
Tracy Camp,
Mohan Ahuja:
An Implementation of Flush Channels Based on a Verification Methodology.
ICDCS 1992: 336-343 |
| 1991 |
|---|
| 7 | EE | William S. Lloyd,
Phil Kearns:
Using tracing to direct our reasoning about distributed programs.
ICDCS 1991: 552-559 |
| 1990 |
|---|
| 6 | | William S. Lloyd,
Phil Kearns:
Bounding Sequence Numbers in Distributed Systems: a General Approach.
ICDCS 1990: 312-319 |
| 5 | EE | Phil Kearns,
Jeffery E. Payne:
Time-based performance evaluation of protocols for distributed systems: an alternative to message counting.
Winter Simulation Conference 1990: 441-445 |
| 1988 |
|---|
| 4 | | Phil Kearns:
A Correct and Unrestrictive Implementation of General Semaphores.
Operating Systems Review 22(4): 46-48 (1988) |
| 1987 |
|---|
| 3 | EE | Phil Kearns,
M. Freeman:
CCAL: an interpreted language for experimentation in concurrent control.
PLDI 1987: 283-291 |
| 1986 |
|---|
| 2 | | Madalene Spezialetti,
Phil Kearns:
Efficient Distributed Snapshots.
ICDCS 1986: 382-388 |
| 1985 |
|---|
| 1 | EE | Jean R. S. Blair,
Phil Kearns,
Mary Lou Soffa:
An optimistic implementation of the stack-heap.
Journal of Systems and Software 5(3): 193-202 (1985) |
