Richard A. DeMillo

Orcid: 0000-0001-6902-6506

  • Georgia Institute of Technology, Atlanta, GA, USA

According to our database1, Richard A. DeMillo authored at least 59 papers between 1974 and 2023.

Collaborative distances:
  • Dijkstra number2 of one.
  • Erdős number3 of three.


ACM Fellow

ACM Fellow 2003, "For contributions to the engineering of reliable and secure software.".



In proceedings 
PhD thesis 


Online presence:



An Agent-Based Simulation Platform for a Safe Election: From Design to Simulation.
Inf., 2023

The Evolving University: Disruptive Change and Institutional Innovation.
Proceedings of the 4th International Conference on Software Development for Enhancing Accessibility and Fighting Info-exclusion, 2012

Keeping technology promises.
Commun. ACM, 2012

Blighted Virtual Neighborhoods and Other Threats to Online Social Experiences.
Proceedings of the Web Information Systems Engineering, 2009

On the Importance of Eliminating Errors in Cryptographic Computations.
J. Cryptol., 2001

Software development for next generation communication networks.
Proceedings of the ACM SIGSOFT Symposium on Foundations of Software Engineering, 2000

NSF workshop on a software research program for the 21st century.
ACM SIGSOFT Softw. Eng. Notes, 1999

On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract).
Proceedings of the Advances in Cryptology, 1997

Failure and Fault Analysis for Software Debugging.
Proceedings of the 21st International Computer Software and Applications Conference (COMPSAC '97), 1997

Mission-Critical Applications, Commercial Value and Software Quality.
ACM Comput. Surv., 1996

Critical Slicing for Software Fault Localization.
Proceedings of the 1996 International Symposium on Software Testing and Analysis, 1996

Some Critical Remarks on a Hierarchy of Fault-Detecting Abilities of Test Methods.
IEEE Trans. Software Eng., 1995

An International Masters in Software Engineering: Experience and Prospects.
Proceedings of the Eleventh International Conference on Data Engineering, 1995

Introduction to the Special Section.
IEEE Trans. Software Eng., 1994

Experimental Results from an Automatic Test Case Generator.
ACM Trans. Softw. Eng. Methodol., 1993

Debugging with Dynamic Slicing and Backtracking.
Softw. Pract. Exp., 1993

Constraint-Based Automatic Test Data Generation.
IEEE Trans. Software Eng., 1991

Defining Software by Continuous, Smooth Functions.
IEEE Trans. Software Eng., 1991

An Execution-Backtracking Approach to Debugging.
IEEE Softw., 1991

Dynamic Slicing in the Presence of Unconstrained Pointers.
Proceedings of the Symposium on Testing, Analysis, and Verification, 1991

Progress Toward Automated Software Testing.
Proceedings of the 13th International Conference on Software Engineering, 1991

Compiler-integrated program mutation.
Proceedings of the Fifteenth Annual International Computer Software and Applications Conference, 1991

Test Adequacy and Program Mutation.
Proceedings of the 11th International Conference on Software Engineering, 1989

Software testing for critical applications: a position paper.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

An integrated software environment for reuse.
Proceedings of the Conference on TRI-Ada 1988, 1988

Software testing and evaluation.
Benjamin/Cummings, ISBN: 978-0-8053-2535-5, 1987

Operational Survivability in Gracefully Degrading Distributed Processing Systems.
IEEE Trans. Software Eng., 1986

Protocols for Data Security.
Computer, 1983

Cryptographic Protocols
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Multilevel Secure Distributed System.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

The Design and Analysis of Cryptographic Protocols.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem.
J. ACM, 1980

The Consistency of "P = NP" and Related Problems with Fragments of Number Theory.
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

A System Architecture to Support a Verifiably Secure Multilevel Security System.
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

Protecting Shared Cryptographic Keys.
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

Review of "Proofs and refutations: the logic of mathematical discovery" by Imre Lakatos. Cambridge University Press 1976.
SIGACT News, 1979

A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings.
Math. Syst. Theory, 1979

Implicit Computation of Synchronization Primitives.
Inf. Process. Lett., 1979

Social Processes and Proofs of Theorems and Programs.
Commun. ACM, 1979

Some Connections between Mathematical Logic and Complexity Theory
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Even Data Bases That Lie Can Be Compromised.
IEEE Trans. Software Eng., 1978

On a political pamphlet from the middle ages.
ACM SIGSOFT Softw. Eng. Notes, 1978

Response from R. A. DeMillo, R. J. Lipton, A. J. Perlis.
ACM SIGSOFT Softw. Eng. Notes, 1978

A Probabilistic Remark on Algebraic Program Testing.
Inf. Process. Lett., 1978

Hints on Test Data Selection: Help for the Practicing Programmer.
Computer, 1978

Preserving Average Proximity in Arrays.
Commun. ACM, 1978

Database Security.
Proceedings of the Issues in Data Base Management, 1978

Recent progress in secure computation.
Proceedings of the IEEE Computer Society's Second International Computer Software and Applications Conference, 1978

The design of a prototype mutation system for program testing.
Proceedings of the American Federation of Information Processing Societies: 1978 National Computer Conference, 1978

Some applications of model theory to the metatheory of program schemata.
Notre Dame J. Formal Log., 1977

A Study of Schedules as Models of Synchronous Parallel Computation.
J. ACM, 1977

Theory in the Computer Science and Engineering Curriculum: Why, What, When, and Where.
Computer, 1977

On the Computational Complexity of a Generalized Scheduling Problem.
IEEE Trans. Computers, 1976

Can structured programs be efficient?
ACM SIGPLAN Notices, 1976

Space and Time Hierarchies for Classes of Control Structures and Data Structures.
J. ACM, 1976

Non-definability of certain semantic properties of programs.
Notre Dame J. Formal Log., 1975

The Complexity of Control Structures and Data Structures
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Parallel Scheduling of Programs in a Restricted Model of Computation
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974