`Travelled to:`

1 × Canada

11 × USA

`Collaborated with:`

R.J.Lipton ∅ E.H.Spafford K.Vairavan H.Pan H.Agrawal N.A.Lynch M.Merritt A.J.Perlis S.C.Eisenstat T.A.Budd F.G.Sayward

`Talks about:`

program (5) softwar (3) test (3) structur (2) complex (2) theori (2) slice (2) mutat (2) unconstrain (1) cryptograph (1)

## Person: Richard A. DeMillo

### DBLP: DeMillo:Richard_A=

### Facilitated 4 volumes:

### Contributed to:

### Wrote 12 papers:

- FSE-2000-DeMillo #communication #development #generative #network
- Software development for next generation communication networks (RAD), p. 1.
- ISSTA-1996-DeMilloPS #fault #locality #slicing
- Critical Slicing for Software Fault Localization (RAD, HP, EHS), pp. 121–134.
- ICSE-1991-DeMillo #automation #testing #towards
- Progress Toward Automated Software Testing (RAD), pp. 180–183.
- TAV-1991-AgrawalDS #pointer #slicing
- Dynamic Slicing in the Presence of Unconstrained Pointers (HA, RAD, EHS), pp. 60–73.
- ICSE-1989-DeMillo #test coverage #testing
- Test Adequacy and Program Mutation (RAD), pp. 355–356.
- STOC-1982-DeMilloLM #encryption #protocol
- Cryptographic Protocols (RAD, NAL, MM), pp. 383–400.
- POPL-1980-BuddDLS #correctness #functional #source code #using
- Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs (TAB, RAD, RJL, FGS), pp. 220–233.
- STOC-1980-DeMilloL #consistency #problem
- The Consistency of “P = NP” and Related Problems with Fragments of Number Theory (RAD, RJL), pp. 45–57.
- STOC-1979-DeMilloL #complexity #logic
- Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.
- POPL-1977-DeMilloLP #process #proving #social #source code #theorem
- Social Processes and Proofs of Theorems and Programs (RAD, RJL, AJP), pp. 206–214.
- STOC-1975-LiptonED #complexity #data type
- The Complexity of Control Structures and Data Structures (RJL, SCE, RAD), pp. 186–193.
- STOC-1974-VairavanD #parallel #scheduling #source code #strict
- Parallel Scheduling of Programs in a Restricted Model of Computation (KV, RAD), pp. 248–255.