Eric J. Golin

dblp:26/6509 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 50% Program verification · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Program verification
environment generation
0.011990
Early Experience with the Visual Programmer's WorkBench · IEEE Trans. Software Eng. 1990
Programming languages and type systems › programming environment
visual programming environment
0.011990
Early Experience with the Visual Programmer's WorkBench · IEEE Trans. Software Eng. 1990
Memory systems › shared memory
distributed shared memory
0.011990
Early Experience with the Visual Programmer's WorkBench · IEEE Trans. Software Eng. 1990

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

static semantics · 0.0language specification · 0.0dynamic semantics · 0.0
YearPublicationVenuePosition
1993 A visual design environment
Eric J. Golin, Annette C. Feng, Linus Huang, Eric Hughes
ICCAD1
1993 Fine-Grain Visualization Algorithms in Dataflow Environments
abstract
Most of the current dataflow visualization systems are based on coarse-grain dataflow computing models. In this paper we propose a fine-grain dataflow model that takes advantage of data locality properties of many visualization algorithms. A fine-grain module works on small chunks of data one at a time by keeping a dynamically adjusted moving window on the input data stream. It is more memory efficient and has the potential of handling very large data sets without taking up all the memory resources. Two popular visualization algorithms, an iso-surface extraction algorithm and a volume rendering algorithm, are implemented using the fine-grain model. The performance measurements showed faster speed, reduced memory usage, and improved CPU utilization over a typical coarse-grain system.>
Deyang Song, Eric J. Golin
IEEE Visualization2
1990 Design and implementation of programming environments in the Visual Programmers Workbench
abstract
The authors describe Visual Programmers Workbench (VPW), which addresses the rapid synthesis of programming environments for the specification, analysis, and execution of visual programs. A language-based environment for a specific visual language is generated in VPW from a specification of the syntactic structure, the abstract structure, the static semantics, and the dynamic semantics of the language. VPW is built around a model of distributed processing based on shared distributed memory. This framework is used both for defining the architecture of the environment and for the execution model of programming languages. The VPW has been used to experiment with visual programming environments for several visual languages. The design of the Visual Programmers Workbench and experience with using it to generate a distributed programming environment for a concurrent visual language are described.>
Robert V. Rubin, James Walker II, Eric J. Golin
COMPSAC3
1990 Early Experience with the Visual Programmer's WorkBench
abstract
The Visual Programmer's WorkBench (VPW) addresses the rapid synthesis and customization of environments for the specification, analysis, and execution of visual programs. The goal of VPW is to enable the easy creation of environments for visual languages. The design of VPW and experience using it to generate a distributed programming environment for a concurrent visual language are described. A visual programming environment for the PetriFSA language generated with VPW is outlined. An overview is provided of the language definition model and its relation to the logical architecture of VPW. Details are given of the language specifications used in VPW, and its application in defining the PetriFSA language. A language-based environment for a specific visual language is generated in VPW from a specification of the syntactic structure, the abstract structure, the static semantics, and the dynamic semantics of the language. VPW is built around a model of distributed processing based on a shared distributed memory. This framework is used in defining the architecture of the environment and for the execution model of visual languages.>
Robert V. Rubin, James Walker II, Eric J. Golin
IEEE Trans. Software Eng.3