David Musser

Q: What Schools Are Affiliated With David Musser

David Musser is affiliated with the following schools: Rensselaer Polytechnic Institute, University of California, Berkeley, University of Southern California, University of Wisconsin–Madison, Stanford University

David Musser's AcademicInfluence.com Rankings

David Musser

Computer Science

#419

World Rank

#435

Historical Rank

Database

#8050

World Rank

#8389

Historical Rank

computer-science Degrees

Download Badge

Computer Science

David Musser's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is David Musser Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David "Dave" Musser is a professor emeritus of computer science at the Rensselaer Polytechnic Institute in Troy, New York, United States. He is known for his work in generic programming, particularly as applied to C++, and his collaboration with Alexander Stepanov. Their work together includes coining the term "generic programming" in , and led to the creation of the C++ Standard Template Library .

(See a Problem?)

David Musser's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Abstract data types and software validation (1978) (454)
C++ Standard Template Library (2000) (421)
STL tutorial and reference guide - C++ programming with the standard template library (1996) (400)
Generic Programming (1988) (367)
On proving inductive properties of abstract data types (1980) (270)
Introspective Sorting and Selection Algorithms (1997) (258)
STL tutorial and reference guide (2001) (198)
Proof by Consistency (1987) (149)
Abstract Data Type Specification in the Affirm System (1980) (147)
STL tutorial and reference guide, second edition: C++ programming with the standard template library (2001) (144)
Algorithm‐oriented generic libraries (1994) (137)
The design of data type specifications (1976) (133)
Multivariate Polynomial Factorization (1975) (108)
An Overview of AFFIRM: A Specification and Verification System (1980) (84)
Algorithms for polynomial factorization. (1971) (74)
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure (1988) (67)
On Proving Uniform Termination and Restricted Termination of Rewriting Systems (1983) (60)
A generalized class of polynomials that are hard to factor (1981) (43)
Tecton: A Framework for Specifying and Verifying Generic System Components (1992) (38)
Some extensions to algebraic specifications (1977) (37)
An Overview of the Tecton Proof System (1994) (35)
A library of generic algorithms in Ada (1987) (34)
Tecton: A Language for Manipulating Generic Objects (1981) (33)
Semi-Unification (1988) (31)
The Ada® Generic Library: Linear List Processing Packages (1989) (29)
On the Efficiency of a Polynomial Irreducibility Test (1978) (26)
Fmdb: flexible distributed mesh database for parallel automated adaptive analysis (2005) (26)
Inductive Reasoning with Incomplete Specifications (Preliminary Report) (1986) (24)
Semantic and behavioral library transformations (2002) (23)
User-Extensible Simplification - Type-Based Optimizer Generators (2001) (23)
Generic Programming and High-Performance Libraries (2004) (23)
The SAC-1 Modular Arithmetic System (1972) (20)
The Ada® Generic Library (1989) (19)
A Formalization of Concepts for Generic Programming (2004) (18)
Dynamic Verification of C++ Generic Algorithms (1997) (18)
Higher Order Imperative Programming (2004) (17)
The application of a symbolic mathematical system to program verification (1974) (16)
Rewrite Rule Theory and Abstract Data Type Analysis (1982) (16)
Generic programming : International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27-May 1, 1998 : selected papers (2000) (16)
Fundamental Proof Methods in Computer Science: A Computer-Based Approach (2017) (15)
Requirement Oriented Programming (1998) (13)
Generic Gram-Schmidt orthogonalization by exact division (1996) (12)
The Tecton Concept Library (1999) (12)
The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs (1980) (12)
Library transformations (2001) (11)
Operators and algebraic structures (1981) (11)
Selected Papers from the International Seminar on Generic Programming (1998) (11)
Reasoning about three dimensional space (1985) (10)
The Tecton Proof System (1991) (9)
Requirement oriented programming concepts, implications, and algorithms (2000) (8)
Structured reasoning about actor systems (2013) (8)
Code-carrying theory (2008) (8)
Complete Traversals and their Implementation Using the Standard Template Library (1998) (8)
BIDS: A Method for Specifying and Verifying Bidirectional Hardware Devices (1988) (7)
Design patterns for library optimization (2003) (7)
New directions in teaching the fundamentals of computer science — discrete structures and computational analysis (1973) (6)
Automated Theorem Proving for Analysis and Synthesis of Computations (1989) (6)
Concept Use or Concept Refinement: An Important Distinction in Building Generic Specifications (2002) (6)
SAC-1 solution of problem #7 (1974) (5)
A Fast Generic Sequence Matching Algorithm (2008) (5)
Algorithm-Oriented Generic Software Library Development (1993) (5)
A Proof Rule for Functions (1977) (5)
Analysis of the Pope-Stein Division Algorithm (1977) (5)
Library-Centric Software Design (2006) (4)
AIDS to hierarchical specification structuring and reusing theorems in AFFIRM-85 (1985) (4)
A Secure Programming Paradigm for Network Virtualization (2006) (4)
Concept-based component libraries and optimizing compilers (2002) (4)
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (1982) (4)
Rationale for Adding Hash Tables to the C Standard Template Library (1995) (3)
A Basis for Formal Specification and Verification of Generic Algorithms in the C++ Standard Template (1995) (3)
Proving Theorems with Athena (2005) (2)
LCSD: library-centric software design (2006) (2)
A Secure Programming Paradigm for Network Virtualization ( Invited Paper ) (2)
Integrating tools and methods for rigorous analysis of c++ generic library components (1996) (2)
An Experimental Analysis of Counting Networks ∗ (2006) (1)
Theory and Generality of Complete Traversals (1998) (1)
Automated theorem proving for analysis and synthesis (1989) (1)
Using the Packages (1989) (1)
Proc. First Internat. Workshop on Library-Centric Software Design (LCSD'05) (2006) (1)
Text-line Random Shuffling Program (2001) (1)
Higher Order Programming (2004) (1)
Linked List Algorithms Package (1989) (0)
A Generic Programming Concept Web (1999) (0)
Elsevier Semi-unification* (2008) (0)
Complete Traversals as General Iteration Patterns (2002) (0)
SIGSAM (Tutorial Session) (1976) (0)
Base Class Injection (2001) (0)
User Allocated Singly Linked Package (1989) (0)
Double Ended Lists Package (1989) (0)
Auto-Reallocating Singly Linked Package (1989) (0)
Automated verification of generic computer software components (1998) (0)
THE RIEMANN ZETA-FUNCTION MAGNETIC TAPES. (1969) (0)
Generic Programming Projects and Open Problems (2004) (0)
System Allocated Singly Linked Package (1989) (0)
Generic Programming and High-Performance Libraries ( Preprint ) (2005) (0)
Singly Linked Lists Package (1989) (0)
Linear Data Structures (1989) (0)
Output Restricted Deques Package (1989) (0)
Isi/rr-76-4s Abstract Data Types and Software Validation (2013) (0)
New directions in teaching the fundamentals of computer science - discrete structures and computational analysis (1973) (0)
Abstract DataTypeSpecification intheAFFIRMSystem (1980) (0)

This paper list is powered by the following services:

Other Resources About David Musser

What Schools Are Affiliated With David Musser?

David Musser is affiliated with the following schools:

David Musser's Academic­Influence.com Rankings