Ira R. Forman

dblp:31/2743 · DBLP profile ↗
← Back
13ranked-venue papers
6as first author
0since 2021 · last 2012
—ORCID · none

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

Software engineering, systems software and programming languages · 8 · 5 first-authorTheory of computation · 2Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous 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.

Software engineering, system software, and programming languages
7 papers
Programming languages and type systems · 79% Software maintenance and evolution · 9% Program analysis · 8%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language design
0.021995
Release-to-Release Binary Compatibility in SOM · OOPSLA 1995
Composition of Before/After Metaclasses in SOM · OOPSLA 1994
Programming languages and type systems › object-oriented programming
object-oriented language design
0.021995
Release-to-Release Binary Compatibility in SOM · OOPSLA 1995
Composition of Before/After Metaclasses in SOM · OOPSLA 1994
Programming languages and type systems › interoperability
binary compatibility
0.011995
Release-to-Release Binary Compatibility in SOM · OOPSLA 1995
Software maintenance and evolution
software evolution
0.011995
Release-to-Release Binary Compatibility in SOM · OOPSLA 1995
Programming languages and type systems
inheritance
0.011994
Reflections on Metaclass Rorgramming in SOM · OOPSLA 1994
Programming languages and type systems
language semantics
0.011994
Composition of Before/After Metaclasses in SOM · OOPSLA 1994
Programming languages and type systems › metaprogramming
metaobject protocol
0.011994
Composition of Before/After Metaclasses in SOM · OOPSLA 1994
Program analysis
data flow analysis
0.021984
An Algebra for Data Flow Anomaly Detection · ICSE 1984
Global Data Flow Analysis by Decomposition into Primes · ICSE 1982
Programming languages and type systems
object-oriented programming
0.011994
Reflections on Metaclass Rorgramming in SOM · OOPSLA 1994
Services computing and microservices › middleware
service-oriented middleware
0.011994
Reflections on Metaclass Rorgramming in SOM · OOPSLA 1994
Program analysis › data flow analysis
data flow anomaly detection
0.011984
An Algebra for Data Flow Anomaly Detection · ICSE 1984
Program analysis › data flow analysis
global flow analysis
0.011982
Global Data Flow Analysis by Decomposition into Primes · ICSE 1982
Program analysis
dynamic analysis
0.011981
On the Time Overhead of Counters and Traversal Markers · ICSE 1981

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

compatibility-preserving transformations · 0.0metaclass derivation · 0.0constraint solving · 0.0
YearPublicationVenuePosition
2012 Blue herd: automated captioning for videoconferences
abstract
Blue Herd is a project in IBM Research to investigate automated captioning for videoconferences. Today videoconferences are held among meeting participants connected with a variety of devices: personal computers, mobile devices, and multi-participant meeting rooms. Blue Herd is charged with studying automated real-time captioning in that context. This poster explains the system that was developed for personal computers and describes our experiments to include mobile devices and multi-participant meeting rooms.
Ira R. Forman, Ben Fletcher, John Hartley, William J. Rippon, Allen Wilson
ASSETS1
1995 Release-to-Release Binary Compatibility in SOM
abstract
SOM (IBM's System Object Model) removes a major impediment to reuse in Object-Oriented Programming by facilitating the programming of release-to-release binary compatible class libraries. This is accomplished by supporting a large number of compatibility preserving transformations. Taken together these transformations compose a discipline for programming evolving class libraries.
Ira R. Forman, Michael H. Conner, Scott Danforth, Larry K. Raper
OOPSLA1
1994 Reflections on Metaclass Rorgramming in SOM
abstract
This paper reports on the evolution of metaclass programming in SOM (the IBM System Object Model). Initially, SOM's use of explicit metaclasses introduced metaclass incompatibilities. This was cured by having SOM dynamically derive an appropriate metaclass by interpreting the “metaclass declaration” as a constraint. In effect, inheritance is given a new dimension, because the constraint is also inherited. The derived metaclass is the least solution to all these constraints. Subsequently, this cure led to the possibility of metaclasses conflicting over the need to assign meaning to a method. The cure for this problem is a framework that facilitates the programming of metaclasses that cooperate on the assignment of meaning to methods.
Scott Danforth, Ira R. Forman
OOPSLA2
1994 Composition of Before/After Metaclasses in SOM
abstract
In SOM, the IBM System Object Model, a class is a run-time object that defines the behavior of its instances by creating an instance method table. Because classes are objects, their behavior is defined by other classes (called metaclasses). For example, a “Before/After Metaclass” can be used to define the implementation of classes that, by suitable construction of their instance method tables, arrange for each invocation of a method to be preceded by execution of a “before method” and followed by execution of an “after method”. This paper introduces and solves the problem of composing different Before/After Metaclasses in the context of SOM. An enabling element in the solution is SOM's concept of derived metaclasses, i.e., at run-time a SOM system derives the appropriate metaclass of a class based on the classes of its parents and an optional metaclass constraint.
Ira R. Forman, Scott Danforth, Hari Madduri
OOPSLA1
1991 Synchrony Loosening Transformations for Interacting Processes
Nissim Francez, Ira R. Forman
CONCUR2
1990 Superimposition for Interacting Processes
Nissim Francez, Ira R. Forman
CONCUR2
1990 On Fairness as an Abstraction for the Design of Distributed Systems
abstract
A fairness property, called U-fairness, is studied in the context of the design of distributed systems with multiparty interactions. This is done with an overlapping model of concurrency. A distributed algorithm implementing the fairness notion is presented. U-fairness is shown to be more appropriate to the design of distributed systems than other known fairness notions because it provides an abstraction for stable property detection whereas the other fairness notions do not.>
Paul C. Attie, Ira R. Forman, Eliezer Levy
ICDCS2
1988 Using Raddle To Design Distributed Systems
Michael Evangelist, Vincent Y. Shen, Ira R. Forman, Mike Graf 0002
ICSE3
1984 TABLE: Object Oriented Editing of Complex Structures
Ted J. Biggerstaff, D. Mack Endres, Ira R. Forman
ICSE3
1984 An Algebra for Data Flow Anomaly Detection
Ira R. Forman
ICSE1
1984 Psychological perspectives for software science
Bill Curtis, Ira R. Forman, Ruven E. Brooks, Elliot Soloway, Kate Ehrlich
Inf. Process. Manag.2
1982 Global Data Flow Analysis by Decomposition into Primes
Ira R. Forman
ICSE1
1981 On the Time Overhead of Counters and Traversal Markers
Ira R. Forman
ICSE1