David R. Musser

According to our database1, David R. Musser authored at least 53 papers between 1974 and 2013.

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



In proceedings 
PhD thesis 



On csauthors.net:


Structured reasoning about actor systems.
Proceedings of the 2013 Workshop on Programming based on Actors, 2013

A Fast Generic Sequence Matching Algorithm
CoRR, 2008

Code-carrying theory.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

LCSD: library-centric software design.
Proceedings of the Companion to the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

A Secure Programming Paradigm for Network Virtualization.
Proceedings of the 3rd International Conference on Broadband Communications, 2006

Generic Programming and High-Performance Libraries.
International Journal of Parallel Programming, 2005

Generic Programming and High-Performance Libraries.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Design patterns for library optimization.
Scientific Programming, 2003

Semantic and behavioral library transformations.
Information & Software Technology, 2002

Concept-Based Component Libraries and Optimizing Compilers.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Complete Traversals as General Iteration Patterns.
Proceedings of the Generic Programming, 2002

Concept Use or Concept Refinement: An Important Distinction in Building Generic Specifications.
Proceedings of the Formal Methods and Software Engineering, 2002

Library Transformations.
Proceedings of the 1st IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2001), 2001

Base Class Injection.
Proceedings of the Generative and Component-Based Software Engineering, 2001

User-Extensible Simplification - Type-Based Optimizer Generators.
Proceedings of the Compiler Construction, 10th International Conference, 2001

Complete Traversals and their Implementation Using the Standard Template Library.
CLEI Electron. J., 1998

Requirement Oriented Programming.
Proceedings of the Generic Programming, 1998

Theory and Generality of Complete Traversals.
Proceedings of the Generic Programming, 1998

Dynamic Verification of C++ Generic Algorithms.
IEEE Trans. Software Eng., 1997

Introspective Sorting and Selection Algorithms.
Softw., Pract. Exper., 1997

Generic Gram-Schmidt Orthogonalization by Exact Division.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

STL tutorial and reference guide - C++ programming with the standard template library.
Addison-Wesley professional computing series, Addison-Wesley, ISBN: 978-0-201-63398-6, 1996

An Overview of the Tecton Proof System.
Theor. Comput. Sci., 1994

Algorithm-oriented Generic Libraries.
Softw., Pract. Exper., 1994

The Tecton Proof System.
Proceedings of the Formal Methods in Databases and Software Engineering, 1992

Theor. Comput. Sci., 1991

The Tecton Proof System.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure.
J. Symb. Comput., 1988

Generic Programming.
Proceedings of the Symbolic and Algebraic Computation, 1988

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

Proof by Consistency.
Artif. Intell., 1987

Inductive Reasoning with Incomplete Specifications (Preliminary Report)
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Reasoning about three dimensional space.
Proceedings of the 1985 IEEE International Conference on Robotics and Automation, 1985

A Generalized Class of Polynomials that are Hard to Factor.
SIAM J. Comput., 1983

On Proving Uniform Termination and Restricted Termination of Rewriting Systems.
SIAM J. Comput., 1983

Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems.
Proceedings of the Automata, 1982

Rewrite Rule Theory and Abstract Data Type Analysis.
Proceedings of the Computer Algebra, 1982

A generalized class of polynomials that are hard to factor.
Proceedings of the SYMSAC 1981, 1981

Operators and algebraic structures.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

Tecton: A Language for Manipulating Generic Objects.
Proceedings of the Program Specification, 1981

Abstract Data Type Specification in the AFFIRM System.
IEEE Trans. Software Eng., 1980

On Proving Inductive Properties of Abstract Data Types.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

An Overview of AFFIRM: A Specification and Verification System.
Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs.
Proceedings of the 5th Conference on Automated Deduction, 1980

On the Efficiency of a Polynomial Irreducibility Test.
J. ACM, 1978

Abstract Data Types and Software Validation.
Commun. ACM, 1978

Analysis of the Pope-Stein Division Algorithm.
Inf. Process. Lett., 1977

Some Extensions to Algebraic Specifications.
Proceedings of an ACM Conference on Language Design for Reliable Software (LDRS), 1977

The Design of Data Type Specifications.
Proceedings of the 2nd International Conference on Software Engineering, 1976

SIGSAM (Tutorial Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

Multivariate Polynomial Factorization.
J. ACM, 1975

SAC-1 solution of problem #7.
ACM SIGSAM Bulletin, 1974

The application of a symbolic mathematical system to program verification.
Proceedings of the 1974 ACM Annual Conference, 1974