dblp.uni-trier.dewww.uni-trier.de

J. Thomas Haigh

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
10EEJ. Thomas Haigh, Steven A. Harp, Richard C. O'Brien, Charles N. Payne, Johnathan Gohde, John Maraist: Trapping Malicious Insiders in the SPDR Web. HICSS 2009: 1-10
1990
9 J. Thomas Haigh, Richard C. O'Brien, D. J. Thomsen: The LDV Secure Relational DBMS Model. DBSec 1990: 265-280
1989
8 Todd Fine, J. Thomas Haigh, Richard C. O'Brien, Dana L. Toups: Noninterference and the Unwinding for LOCK. CSFW 1989: 22-28
7 J. Thomas Haigh, Richard C. O'Brien, P. D. Stachour, Dana L. Toups: The LDV Approach to Database Security. DBSec 1989: 323-339
1988
6 D. J. Thomsen, J. Thomas Haigh, Carl E. Landwehr: Discussion Notes and Research Question List. DBSec 1988: 263-280
1987
5 J. Thomas Haigh: Modeling Datbase Security Requirements. DBSec 1987: 45-56
4 J. Thomas Haigh, William D. Young: Extending the Noninterference Version of MLS for SAT. IEEE Trans. Software Eng. 13(2): 141-150 (1987)
3 J. Thomas Haigh, Richard A. Kemmerer, John McHugh, William D. Young: An Experience Using Two Covert Channel Analysis Techniques on a Real System Design. IEEE Trans. Software Eng. 13(2): 157-168 (1987)
1986
2 J. Thomas Haigh, Richard A. Kemmerer, John McHugh, William D. Young: An Experience Using Two Covert Channel Analysis Techniques on a Real System Design. IEEE Symposium on Security and Privacy 1986: 14-24
1 J. Thomas Haigh, William D. Young: Extending the Non-Interference Version of MLS for SAT. IEEE Symposium on Security and Privacy 1986: 60-60

Coauthor Index

1Todd Fine [8]
2Johnathan Gohde [10]
3Steven A. Harp [10]
4Richard A. Kemmerer [2] [3]
5Carl E. Landwehr [6]
6John Maraist [10]
7John McHugh [2] [3]
8Richard C. O'Brien [7] [8] [9] [10]
9Charles N. Payne [10]
10P. D. Stachour [7]
11D. J. Thomsen [6] [9]
12Dana L. Toups [7] [8]
13William D. Young [1] [2] [3] [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)