David R. Musser - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 54 from 54

2013

Structured reasoning about actor systemsDavid R. Musser, Carlos A. Varela. agere 2013: 37-48 [doi]

2008

Code-carrying theoryAytekin Vargun, David R. Musser. SAC 2008: 376-383 [doi]

2006

LCSD: library-centric software designJosh Bloch, Jaakko Järvi, David R. Musser, Sibylle Schupp, Jeremy G. Siek. OOPSLA 2006: 618 [doi]

2005

Generic Programming and High-Performance LibrariesDouglas Gregor, Jaakko Järvi, Mayuresh Kulkarni, Andrew Lumsdaine, David R. Musser, Sibylle Schupp. ijpp, 33(2-3):145-164, 2005. [doi]

2004

Generic Programming and High-Performance LibrariesJaakko Järvi, Andrew Lumsdaine, D. P. Gregor, Mayuresh Kulkarni, David R. Musser, Sibylle Schupp. ipps 2004: [doi]

2003

Design patterns for library optimizationDouglas Gregor, Sibylle Schupp, David R. Musser. sp, 11(4):309-320, 2003.

2002

2001

Base Class InjectionDouglas Gregor, Sibylle Schupp, David R. Musser. gcse 2001: 106-117 [doi]

User-Extensible SimplificationType-Based Optimizer GeneratorsSibylle Schupp, Douglas Gregor, David R. Musser, Shin-Ming Liu. CC 2001: 86-101 [doi]

Library TransformationsSibylle Schupp, Douglas Gregor, David R. Musser. SCAM 2001: 111-123 [doi]

1998

Complete Traversals and their Implementation Using the Standard Template LibraryEric Gamess, David R. Musser, Arturo J. Sánchez-Ruíz. cleiej, 1(2), 1998. [doi]

Theory and Generality of Complete TraversalsDavid R. Musser, Arturo J. Sánchez-Ruíz. Dagstuhl 2000: 91-101 [doi]

Requirement Oriented ProgrammingDavid R. Musser, Sibylle Schupp, Rüdiger Loos. Dagstuhl 2000: 12-24 [doi]

1997

Introspective Sorting and Selection AlgorithmsDavid R. Musser. SPE, 27(8):983-993, 1997.

Dynamic Verification of C++ Generic AlgorithmsChangqing Wang, David R. Musser. TSE, 23(5):314-323, 1997. [doi]

1996

STL tutorial and reference guide - C++ programming with the standard template libraryDavid R. Musser, Atul Saini. Addison-Wesley professional computing series, Addison-Wesley, 1996.

Generic Gram-Schmidt Orthogonalization by Exact DivisionÚlfar Erlingsson, Erich Kaltofen, David R. Musser. issac 1996: 275-282 [doi]

1994

An Overview of the Tecton Proof SystemDeepak Kapur, Xumin Nie, David R. Musser. TCS, 133(2):307-339, 1994.

Algorithm-oriented Generic LibrariesDavid R. Musser, Alexander A. Stepanov. SPE, 24(7):623-642, 1994.

1992

The Tecton Proof SystemDeepak Kapur, David R. Musser, Xumin Nie. db-workshops 1993: 54-79

1991

The Tecton Proof SystemRaj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie. RTA 1991: 442-444

Semi-UnificationDeepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman. TCS, 81(2):169-187, 1991.

1988

Semi-UnificationDeepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman. fsttcs 1988: 435-454

Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion ProcedureDeepak Kapur, David R. Musser, Paliath Narendran. JSC, 6(1):19-36, 1988.

Generic ProgrammingDavid R. Musser, Alexander A. Stepanov. issac 1989: 13-25

1987

Proof by ConsistencyDeepak Kapur, David R. Musser. ai, 31(2):125-157, 1987.

A library of generic algorithms in AdaDavid R. Musser, Alexander A. Stepanov. sigada 1987: 216-225 [doi]

1986

Inductive Reasoning with Incomplete Specifications (Preliminary Report)Deepak Kapur, David R. Musser. lics 1986: 367-377

1985

Reasoning about three dimensional spaceDeepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran. icra 1985: 405-410 [doi]

AIDS to hierarchical specification structuring and reusing theorems in AFFIRM-85David R. Musser. sigsoft, 10(4):2-4, 1985. [doi]

1983

On Proving Uniform Termination and Restricted Termination of Rewriting SystemsJohn V. Guttag, Deepak Kapur, David R. Musser. SICOMP, 12(1):189-214, 1983.

A Generalized Class of Polynomials that are Hard to FactorErich Kaltofen, David R. Musser, B. David Saunders. SICOMP, 12(3):473-483, 1983.

1982

Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting SystemsJohn V. Guttag, Deepak Kapur, David R. Musser. icalp 1982: 300-312

Rewrite Rule Theory and Abstract Data Type AnalysisDavid R. Musser, Deepak Kapur. eurocal 1982: 77-90

1981

A generalized class of polynomials that are hard to factorErich Kaltofen, David R. Musser, B. David Saunders. issac 1981: 188-194 [doi]

Tecton: A Language for Manipulating Generic ObjectsDeepak Kapur, David R. Musser, Alexander A. Stepanov. FM 1982: 402-414

Operators and algebraic structuresDeepak Kapur, David R. Musser, Alexander A. Stepanov. fpca 1981: 59-64 [doi]

1980

1978

Abstract Data Types and Software ValidationJohn V. Guttag, Ellis Horowitz, David R. Musser. CACM, 21(12):1048-1064, 1978.

On the Efficiency of a Polynomial Irreducibility TestDavid R. Musser. JACM, 25(2):271-282, 1978. [doi]

1977

Analysis of the Pope-Stein Division AlgorithmGeorge E. Collins, David R. Musser. ipl, 6(5):151-155, 1977.

Some Extensions to Algebraic SpecificationsJohn V. Guttag, Ellis Horowitz, David R. Musser. ldrs 1977: 63-67

1976

The Design of Data Type SpecificationsJohn V. Guttag, Ellis Horowitz, David R. Musser. ICSE 1976: 414-420

SIGSAM (Tutorial Session)John D. Lipson, Ellis Horowitz, David R. Musser. acm 1976: 435 [doi]

1975

Multivariate Polynomial FactorizationDavid R. Musser. JACM, 22(2):291-308, 1975. [doi]

1974

SAC-1 solution of problem #7George E. Collins, David R. Musser, Michael Rothstein. cca, 8(2):17-19, 1974. [doi]

The application of a symbolic mathematical system to program verificationRalph L. London, David R. Musser. acm 1974: 265-273 [doi]

1973

New directions in teaching the fundamentals of computer science - discrete structures and computational analysisRaymond T. Yeh, Donald I. Good, David R. Musser. sigcse 1973: 60-67 [doi]

Sign in or sign up to see more results.

runs on WebDSL