7,482 papers · page 313 of 375
Mads Tofte, Jean-Pierre Talpin
We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All runtime values, including function closures, are put into regions. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be al…
Mitchell Wand, Paul Steckler
We consider the problem of selective and lightweight closure conversion, in which multiple procedure-calling protocols may coexist in the same code. Flow analysis is used to match the protocol expected by each procedure and the protocol used at each of its possible call sites. We…
Daniel Weise, Roger F. Crew, Michael D. Ernst, Bjarne Steensgaard
The value dependence graph (VDG) is a sparse dataflow-like representation that simplifies program analysis and transformation. It is a functional representation that represents control flow as data flow and makes explicit all machine quantities, such as stores and I/O channels. W…
Bruce Anderson, Mary Shaw, Larry Best, Kent L. Beck
Architectures are the structuring paradigms, styles and patterns that make up our software systems.They are important in many ways: they allow us to talk usefully about systems without talking about their detail; a knowledge of them gives us design choices; attention to this leve…
Henri E. Bal, M. Frans Kaashoek
Orca is a language for parallel programming on distributed systems. Communication in Orca is based on shared data-objects, which is a form of distributed shared memory. The performance of Orca programs depends strongly on how shared dataobjects are distributed among the local phy…
Tim Bingham, Nancy Hobbs, Dave Husson
Gilad Bracha, David Griswold
article Free Access Share on Strongtalk: typechecking Smalltalk in a production environment Authors: Gilad Bracha View Profile , David Griswold View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 10Oct. 1, 1993 pp 215–230https://doi.org/10.1145/167962.165893Onlin…
Kim B. Bruce, Jonathan Crabtree, Thomas P. Murtagh, Robert van Gent, Allyn Dimock, Robert Muller
Over the last several years, much interesting work has been done in modelling object-oriented programming languages in terms of extensions of the bounded second-order lambda calculus, F . Unfortunately, it has recently been shown by Pierce ([Pie92]) that type checking F is undeci…
Bernd Bruegge, Tim Gottschalk, Bin Luo
BEE++ is an object-oriented application framework for the dynamic analysis of distributed programs.The main objective of BEE++ is to provide a common platform for monitoring and debugging.BEE++'s class library consists of a rich set of classes for event processing to support a va…
Vinny Cahill, Seán Baker, Chris Horn, Gradimir Starovic
Many object-oriented programming language implementations have been estcndcd to support persistence, dist,ribut,ion or atomicity by integrating the necessary a,dditional support, with t,he language's runt,ime library.We argue tha.t a better approach is to provide a. Generic Runti…
Yves Caseau
A key mechanism of a persistent programming language is its ability to detect and handle references to non-resident objects. Ideally, this mechanism should be hidden from the programmer, allowing the transparent manipulation of all data regardless of its potential lifetime. We te…
Dennis de Champeaux, Andrew J. Baer, Brian Bernsen, Alan R. Korncoff, Timothy D. Korson, Daniel S. Tkach
article Free Access Share on Strategies for object-oriented technology transfer (panel) Authors: Dennis de Champeaux View Profile , Andrew J. Baer View Profile , Brian Bernsen View Profile , Alan R. Korncoff View Profile , Tim Korson View Profile , Daniel S. Tkach View Profile Au…
Franco Civello
A method is presented for using composite objects which separates their role and meaning as models of relations between problem-domain concepts from their role and meaning as models of hierarchical sof'twarc structures.The meaning of composite objects is analysed in terms of conn…
Angela Jo Coppola, William Ruh
Karel Driesen
article Free Access Share on Selector table indexing & sparse arrays Author: Karel Driesen View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 10Oct. 1, 1993 pp 259–270https://doi.org/10.1145/167962.165902Published:01 October 1993Publication History 42citation378…
Robert Godin, Hafedh Mili
Existing 00 development methodologies (see e.g.[Rumbaugh9 1 a, Wirfs-Brock90a, Coad9 la]) prescribe that design builds on the basic class structure identified at the analysis level--one aspect of the much vaunted seamless transition--by adding high level (control) and low level (…
William H. Harrison, Harold Ossher
Object-Oriented technology is often described in terms of an interwoven troika of themes: encapsulation, polymorphism, and inheritance.But these themes are firmly tied with the concept of identity.If object-oriented technology is to be successfully scaled from the development of …
Franz J. Hauck
Antony L. Hosking, J. Eliot B. Moss
A key mechanism of a persistent programming language is its ability to detect and handle references to non-resident objects.Ideally, this mechanism should be hidden from the programmer, allowing the transparent manipulation of all data regardless of its potential lifetime.We term…
Geir Magne Høydalsvik, Guttorm Sindre
The paper discusses the general purpose of analysis and evaluates OOA with respect to this, arguing that OOA does not deliver what it claims to do. The two major problems are that OOA often does not meet the full needs of the analysis phase, and that the transition to design is n…