Ramachandran Krishnaswamy

dblp:89/2935 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Theoretical computer science
3 papers
Automata and formal languages · 40% Logic in computer science · 27% Automated reasoning and model checking · 27%
Software engineering, system software, and programming languages
2 papers
Program synthesis and code generation · 54% Compilers and program optimization · 46%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
formal translations
0.021978
Formal Methodology of Translation. II. Capabilities and Limitations · Inf. Control. 1978
Formal Methodology of Translation. I. Semantic Preserving Translations · Inf. Control. 1978
Compilers and program optimization › compiler construction
syntax-directed translation
0.011980
On the Correctness of Semantic-Syntax-Directed Translations · J. ACM 1980
Automated reasoning and model checking › program verification
program correctness
0.011980
On the Correctness of Semantic-Syntax-Directed Translations · J. ACM 1980
Logic in computer science
semantics
0.011980
On the Correctness of Semantic-Syntax-Directed Translations · J. ACM 1980
Program synthesis and code generation
programming by example
0.011976
Constructing Programs from Example Computations · IEEE Trans. Software Eng. 1976

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

undecidability proof · 0.0shortest program synthesis · 0.0example computation history · 0.0
YearPublicationVenuePosition
2004 Test Programming Environment in a Modular, Open Architecture Test System
abstract
This work addresses two key concepts in device test program development: test class programming and pattern management. These are explored in the context of an open architecture test system, where the primary requirement is the flexibility to integrate externally developed capabilities into the system. Development against an open architecture test system includes the integration of software-based solutions (such as user-developed test classes) and third party hardware modules, including the software necessary to support the modules. This work focuses on the open architecture facets of test programming and pattern management, as embodied in the OPENSTAR/spl trade/ specification. The software for Advantest Corporation's T2000 system is used as a concrete example for highlighting these concepts.
Ankan K. Pramanick, Ramachandran Krishnaswamy, Mark Elston, Toshiaki Adachi, Harsanjeet Singh, Bruce R. Parnas
ITC2
1980 On the Correctness of Semantic-Syntax-Directed Translations
abstract
The correctness of semantic-syntax-directed translators (SSDTs) is examined. SSDTs are a generalization of syntax-directed translators in which semantic information is employed to partially direct the translator. Sufficient conditions for an SSDT to be “semantic-preserving,” or “correct,” are presented. A further result shows that unless certain conditions are met, it is undecidable, in general, whether an SSDT is semantic-preserving.
Ramachandran Krishnaswamy, Arthur B. Pyster
J. ACM1
1978 Formal Methodology of Translation. I. Semantic Preserving Translations
Ramachandran Krishnaswamy, H. William Buttelmann
Inf. Control.1
1978 Formal Methodology of Translation. II. Capabilities and Limitations
Ramachandran Krishnaswamy, H. William Buttelmann
Inf. Control.1
1976 Constructing Programs from Example Computations
abstract
An autoprogrammer is an interactive computer programming system which automatically constructs computer programs from example computations executed by the user. The example calculations are done in a scratch pad fashion at a computer display using a light pen or other graphic input device, and the system stores a detailed history of all of the steps executed in the process. Then the system automatically synthesizes the shortest possible program which is capable of executing the observed examples. The paper describes the computational environment provided by the system, proves that the program synthesis technique is both "sound" and "complete," describes the design of the system, and gives some programs it was used to create.
Alan W. Biermann, Ramachandran Krishnaswamy
IEEE Trans. Software Eng.2