Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

J. Christopher Ramming

dblp:26/3237 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 50% Network management and operations · 50%
Software engineering, system software, and programming languages
2 papers
Software testing · 50% Programming languages and type systems · 38% Compilers and program optimization · 12%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › network automation
autonomic network management
0.012003
A knowledge plane for the internet · SIGCOMM 2003
Internet architecture and protocols › future internet architecture
knowledge plane
0.012003
A knowledge plane for the internet · SIGCOMM 2003
Software testing › test generation
automated test generation
0.011997
Specification-based Testing of Reactive Software: Tools and Experiments (Experience Report) · ICSE 1997
Software testing
specification-based testing
0.011997
Specification-based Testing of Reactive Software: Tools and Experiments (Experience Report) · ICSE 1997
Programming languages and type systems
domain-specific languages
0.011995
A*: A Language for Implementing Language Processors · IEEE Trans. Software Eng. 1995
Programming languages and type systems
language design
0.011995
A*: A Language for Implementing Language Processors · IEEE Trans. Software Eng. 1995
Compilers and program optimization › parsing
parser generation
0.011995
A*: A Language for Implementing Language Processors · IEEE Trans. Software Eng. 1995
Compilers and program optimization
parsing
0.011995
A*: A Language for Implementing Language Processors · IEEE Trans. Software Eng. 1995

Methods — techniques the papers use, named apart from their topics

cognitive systems · 0.0artificial intelligence · 0.0parse tree construction · 0.0abstract interpretation · 0.0
YearPublicationVenuePosition
2004 An open architecture for next-generation telecommunication services
abstract
An open (in the sense of extensible and programmable) architecture for IP telecommunications must be based on a comprehensive strategy for managing feature interaction. We describe our experience with BoxOS, an IP telecommunication platform that implements the DFC technology for feature composition. We present solutions to problems, common to all efforts in IP telecommunications, of feature distribution, interoperability, and media management. We also explain how BoxOS addresses many deficiencies in SIP, including how BoxOS can be used as a SIP application server.
Gregory W. Bond, Eric Cheung, K. Hal Purdy, Pamela Zave, J. Christopher Ramming
ACM Trans. Internet Techn.5
2003 A knowledge plane for the internet
abstract
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as requirements change, automatically discover when something goes wrong, and automatically fix a detected problem or explain why it cannot do so.We further argue that to achieve this goal, it is not sufficient to improve incrementally on the techniques and algorithms we know today. Instead, we propose a new construct, the Knowledge Plane, a pervasive system within the network that builds and maintains high-level models of what the network is supposed to do, in order to provide services and advice to other elements of the network. The knowledge plane is novel in its reliance on the tools of AI and cognitive systems. We argue that cognitive techniques, rather than traditional algorithmic approaches, are best suited to meeting the uncertainties and complexity of our objective.
David D. Clark, Craig Partridge, J. Christopher Ramming, John Wroclawski
SIGCOMM3
1999 Guest Editorial: Introduction to the Special Section "Domain-Specfic Languages (DSL)''
David S. Wile, J. Christopher Ramming
IEEE Trans. Software Eng.2
1998 Specification-based testing of reactive software: A case study in technology transfer
Lalita Jategaonkar Jagadeesan, Lawrence G. Votta, Adam A. Porter, Carlos Puchol, J. Christopher Ramming
J. Syst. Softw.5
1997 Specification-based Testing of Reactive Software: Tools and Experiments (Experience Report)
abstract
Testing commercial software is expensive and time consuming.Automated testing methods promise to save a great deal of time and money throughout the software industry.One approach that is well-suited for the reactive systems found in telephone switching systems is specification-based testing.We have built a set of tools to automatically test software applications for violations of safety properties expressed in temporal logic.Our testing system automatically constructs finite state machine oracles corresponding to safety properties, builds test harnesses, and integrates them with the application.The test harness then generates inputs automatically to test the application.We describe a study examining the feasibility of this approach for testing industrial applications.To conduct this study we formally modeled an Automatic Protection Switching system (APS), which is an application common to many telephony systems.We then asked a number of computer science graduate students to develop several versions of the APS and use our tools to test them.We found that the tools are very effective, save significant amounts of human effort (at the expense of machine resources), and are easy to use.We also dis-
Lalita Jategaonkar Jagadeesan, Adam A. Porter, Carlos Puchol, J. Christopher Ramming, Lawrence G. Votta
ICSE4
1995 A*: A Language for Implementing Language Processors
abstract
A* is an experimental language designed to facilitate the creation of language-processing tools. It is analogous either to an interpreted yacc with Awk as its statement language, or to a version of Awk which processes programs rather than records. A* offers two principal advantages over the combination of lex, yacc, and C: a high-level interpreted base language and built-in parse tree construction. A* programmers are thus able to accomplish many useful tasks with little code. This paper describes the motivation for A*, its design, and its evolution. Experience with A* is described, and then the paper concludes with an analysis of that experience.>
David A. Ladd, J. Christopher Ramming
IEEE Trans. Software Eng.2