Raymond E. Miller

Affiliations:
  • University of Maryland, College Park, USA


According to our database1, Raymond E. Miller authored at least 75 papers between 1957 and 2006.

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

Awards

ACM Fellow

ACM Fellow 1997, "For research contributions to the theory of parallel computation and for his distinguished service to the Computer Science community as an educator and leader.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2006
Network protocol system monitoring: a formal approach with passive testing.
IEEE/ACM Trans. Netw., 2006

Graduate Student Experiences at Illinois.
IEEE Ann. Hist. Comput., 2006

2005
Coping with Nondeterminism in Network Protocol Testing.
Proceedings of the Testing of Communicating Systems, 2005

2004
A profitable multicast business model.
Comput. Commun., 2004

2003
JACM 1973-1975.
J. ACM, 2003

2002
Specification and Analysis of the DCF and PCF Protocols in the 802.11 Standard Using Systems of Communicating Machines.
Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP 2002), 2002

A Formal Approach for Passive Testing of Protocol Data Portions.
Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP 2002), 2002

2001
Fault Coverage in Networks by Passive Testing.
Proceedings of the International Conference on Internet Computing, 2001

Fault management using passive testing for mobile IPv6 networks.
Proceedings of the Global Telecommunications Conference, 2001

Fault Identification in Networks by Passive Testing.
Proceedings of the Proceedings 34th Annual Simulation Symposium (SS 2001), 2001

1999
Interactive Authoring of Multimedia Documents in a Constraint-Based Authoring System.
Multim. Syst., 1999

Estimating protocol performance using a formal specification model.
Int. J. Commun. Syst., 1999

Solving Systems of Difference Constraints Incrementally.
Algorithmica, 1999

On estimating protocol performance from a formal specification.
Proceedings of the IEEE International Performance Computing and Communications Conference, 1999

1998
A Proof Technique for Liveness Properties of Multifunction Composite Protocols.
Proceedings of the 1998 International Conference on Network Protocols (ICNP '98), 1998

1997
A Compositional Approach for Designing Multifunction Time-Dependent Protocols.
Proceedings of the 1997 International Conference on Network Protocols (ICNP '97), 1997

Synthesizing Protocol Specifications from Service Specifications in Timed Extended Finite State Machines.
Proceedings of the 17th International Conference on Distributed Computing Systems, 1997

1996
Generalized fair reachability analysis for cyclic protocols.
IEEE/ACM Trans. Netw., 1996

An approach to cyclic protocol validation.
Comput. Commun., 1996

Interactive Authoring of Multimedia Documents.
Proceedings of the 1996 IEEE Symposium on Visual Languages, 1996

Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines.
Proceedings of the 1996 International Conference on Network Protocols, 1996

Deadlock Detection by Pair Reachability Analysis: From Cyclic to Multi-Cyclic Protocols (and Beyond?).
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

1995
Locating Faults in a Systematic Manner in a Large Heterogeneous Network.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions.
Proceedings of the 1995 International Conference on Network Protocols, 1995

Reachability Problems for Cyclic Protocols.
Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), 1995

1994
Structural analysis of protocol specifications and generation of maximal fault coverage conformance test sequences.
IEEE/ACM Trans. Netw., 1994

Generalized fair reachability analysis for cyclic protocols: part 1.
Proceedings of the Protocol Specification, 1994

Generalized fair reachability analysis for cyclic protocols: decidability for logical correctness problems.
Proceedings of the 1994 International Conference on Network Protocols, 1994

1993
On the generation of minimal-length conformance tests for communication protocols.
IEEE/ACM Trans. Netw., 1993

Analyzing a CSMA/CD protocol through a Systems of Communicating Machines Specification.
IEEE Trans. Commun., 1993

Stabilization and Pseudo-Stabilization.
Distributed Comput., 1993

Generating maximal fault coverage conformance test sequences of reduced length for communication protocols.
Proceedings of the 1993 International Conference on Network Protocols, 1993

1992
Generating Conformance Test Sequences for Combined Control and Data Flow of Communication Protocols.
Proceedings of the Protocol Specification, 1992

1991
Block acknowledgment: redesigning the window protocol.
IEEE Trans. Commun., 1991

Synthesizing a Protocol Converter from Executable Protocol Traces.
IEEE Trans. Computers, 1991

Specification and Analysis of a Data Transfer Protocol Using Systems of Communicating Machines.
Distributed Comput., 1991

Generating Minimal Length Test Sequences for Conformance Testing of Communication Protocols.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

Protocol engineering (panel session).
Proceedings of the 19th annual conference on Computer Science, 1991

1990
Protocol verification: the first ten years, the next ten years; some personal observations.
Proceedings of the Protocol Specification, 1990

1989
Block Acknowledgement: Redesigning the Window Protocol.
Proceedings of the ACM Symposium on Communications Architectures & Protocols, 1989

1987
The Construction of Self-Synchronizing Finite State Protocols.
Distributed Comput., 1987

Computer Science Program Accreditation: The First-Year Activities of the Computing Sciences Accreditation Board.
Computer, 1987

Computer Science Program Acceditation: The First-Year Activities of the Computer Science Accreditation Board.
Commun. ACM, 1987

1986
Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding.
Computer, 1986

Protocol Analysis and Synthesis by Structured Partitions.
Comput. Networks, 1986

1985
1984 Snowbird Report: Future Issues in Computer Science.
Computer, 1985

Computer science accreditation (panel session): an introduction and status of the national program.
Proceedings of the 16th SIGCSE Technical Symposium on Computer Science Education, 1985

1983
A decomposition method for the analysis and design of finite state protocols.
Proceedings of the Eighth Symposium on Data Communications, 1983

Network protocol: A structured approach.
Proceedings of the 1983 Annual Conference on Computers: extending the human resource, 1983

1982
Homomorphisms between Models of Parallel Computation.
J. Comput. Syst. Sci., 1982

1980
On Formulating Simultaneity for Studying Parallelism and Synchronization.
J. Comput. Syst. Sci., 1980

1979
Optimal 2, 3-Trees.
SIAM J. Comput., 1979

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

Comparing models of parallel computation by homomorphisms.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1978
A Batching Method for Coloring Planar Graphs.
Inf. Process. Lett., 1978

On the formal specification and analysis for loosely connected processes.
Proceedings of the Mathematical Studies of Information Processing, 1978

1977
Synchronization and Computing Capabilities of Linear Asynchronous Structures.
J. Comput. Syst. Sci., 1977

1973
A Comparison of Some Theoretical Models of Parallel Computation.
IEEE Trans. Computers, 1973

1972
Some Undecidability Results for Parallel Program Schemata.
SIAM J. Comput., 1972

A Generalization of the Theory of Incompletely Specified Machines.
J. Comput. Syst. Sci., 1972

Rapid Identification of Repeated Patterns in Strings, Trees and Arrays
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

A boundary between decidability and undecidability for parallel program schemata (Extended Abstract).
Proceedings of ACM Conference on Proving Assertions About Programs, 1972

Configurable computers: a new class of general purpose machines.
Proceedings of the International Sympoisum on Theoretical Programming, 1972

1971
On the Composition of Parallel Program Schemata
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1969
Parallel Program Schemata.
J. Comput. Syst. Sci., 1969

1967
The Organization of Computations for Uniform Recurrence Equations.
J. ACM, 1967

Parallel Program Schemata: A Mathematical Model for Parallel Computation
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966
Index Register Allocation.
J. ACM, 1966

1964
On the Number of Transitions Entering the States of a Finite Automaton.
IEEE Trans. Electron. Comput., 1964

1963
A survey of asynchronous logic: Comparing various definitions and models for asynchronous switching circuits
Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design, 1963

1962
Some theorems for incompletely specified sequential machines with applications to state minimization
Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962

1961
An introduction to speed independent circuit theory
Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design, 1961

1960
Maximal Paths on Rectangular Boards.
IBM J. Res. Dev., 1960

1958
Formal Analysis and Synthesis of Bilateral Switching Networks.
IRE Trans. Electron. Comput., 1958

1957
Formal Analysis and Synthesis of Bilateral Switching Networks
PhD thesis, 1957


  Loading...