By Topic

Computer Languages, 1994., Proceedings of the 1994 International Conference on

Date 16-19 May 1994

Filter Results

Displaying Results 1 - 25 of 29
  • Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)

    Publication Year: 1994
    Save to Project icon | Request Permissions | PDF file iconPDF (91 KB)  
    Freely Available from IEEE
  • Is there a future for functional languages in parallel programming?

    Publication Year: 1994 , Page(s): 299 - 304
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (496 KB)  

    This panel provides an outlook for the role of functional languages in parallel programming from the perspective of researchers who are actively involved in the design and implementation of parallel functional languages. The panel focuses on developments in parallel programming and functional programming and their interactions. The panelists discuss the impact of these developments on the future o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State space reduction in abstract interpretation of parallel programs

    Publication Year: 1994 , Page(s): 277 - 288
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1036 KB)  

    Traditional compiler techniques operating on control flow graphs are not adequate for analyzing parallel programs where data can flow from one node to another through the shared memory, even though the nodes are not related by control flow edges. Abstract interpretation provides a general and unified framework for program analyses, and can be applied to parallel programs without much difficulty. H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Customizing C++ to improve the reusability of class libraries

    Publication Year: 1994 , Page(s): 64 - 73
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (648 KB)  

    OPTEC is a language extension tool for customizing a strongly typed object-oriented language to improve the usability of specific class libraries. Using OPTEC, a system specific language for non-expert programmers call be built easily by extending C++. The system specific language supports selection of the appropriate private class from the class libraries, simplifies the use of the class, and mak... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient incremental parsing for context-free languages

    Publication Year: 1994 , Page(s): 241 - 252
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (764 KB)  

    An incremental parsing algorithm based on dynamic programming techniques is described. The analyzer takes the automaton generated from a general class of context-free grammars as driver, and any finite string as input. Given an input string that has been modified, the algorithm cuts out the parts of the old analysis that had been generated by the parts of the input that has changed. What remains a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract interpretation over algebraic data types

    Publication Year: 1994 , Page(s): 265 - 276
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (820 KB)  

    This paper is concerned with the static analysis of programs over recursive data structures such as lists and trees. In particular, we consider the analysis of uniform properties i.e., properties pertaining only to the content of a data structure. We first present an axiomatic description of properties of sum types and algebraic types and use the theory of powerdomains to construct lattices modell... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Haskell-style overloading is NP-hard

    Publication Year: 1994 , Page(s): 88 - 94
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (492 KB)  

    Extensions of the ML type system, based on constrained type schemes, have been proposed for languages with overloading. Type inference in these systems requires solving the following satisfiability problem. Given a set of type assumptions C over finite types and a type basis A, is there is a substitution S that satisfies C in that A implies that CS is derivable? Under arbitrary overloading, the pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A three-level object-based model

    Publication Year: 1994 , Page(s): 148 - 158
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (776 KB)  

    The three fundamental areas of functionality in an object-based system are the creation, encapsulation and access of related data. Parallel to these areas of functionality we may identify three levels of data: data which exists as long as an object does, data which exists for the length of a procedure invocation and data which exists for the length of a process's use of an object. A new object mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complementary relationship of interprocedural register allocation and inlining

    Publication Year: 1994 , Page(s): 253 - 264
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (780 KB)  

    Inline expansion and interprocedural register allocation are two general approaches used for interprocedural optimization. However, there are certain situations which prevent either of them from being applied smoothly to procedure calls. This paper describes a method of integrating interprocedural register allocation and inlining in order to reduce the procedure call overhead. The method uses prof... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How could object-oriented concepts and parallelism cohabit?

    Publication Year: 1994 , Page(s): 195 - 199
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (428 KB)  

    A lot of new languages and new concepts have been conceived in order to promote parallelism in the object-oriented framework. These proposals could be investigated using different concepts related to parallelism and object orientation. Among these concepts, we can find shared variables/message passing, inheritance/delegation, reflection. The degrees of a good cohabitation may be appreciated by com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving asynchronous speedup while preserving synchronous semantics: an implementation of instructional footprinting in Linda

    Publication Year: 1994 , Page(s): 55 - 63
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (576 KB)  

    Linda is a coordination language designed to support process creation and inter-process communication within conventional computational languages. Although the Linda paradigm touts architectural and language independence, it often suffers performance penalties, particularly on local area network platforms. Instructional footprinting is an optimization technique with the primary goal of enhancing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real spreadsheets for real programmers

    Publication Year: 1994 , Page(s): 20 - 30
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (760 KB)  

    Spreadsheets as a computing metaphor have received desultory attention from the programming languages community. Efforts to map real problems onto the metaphor however, have been hampered by serious flaws in the design and implementation of commonly available packages. We show that the intuition behind such efforts is sound; we define a spreadsheet mini-language, then use it to program solutions t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure notation of dynamic systems: a pictorial language approach

    Publication Year: 1994 , Page(s): 219 - 228
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (760 KB)  

    Describes a visual programming environment called PROX (Pictorial Programming for Control Systems and Simulation) and its application to the development of software code for dynamic systems. We show how PROX is used for modeling and simulating a continuous process of interdependent variables with emphasis on user software development. Some of PROX key features are highlighted, such as encouraging ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A functional specification language for instruction set architectures

    Publication Year: 1994 , Page(s): 11 - 19
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (680 KB)  

    Application-specific programmable processing systems consist of not only a processor, but also the software that runs on it. In order to support development of such systems, a design environment must support both hardware and software development. Unfortunately, there are no specification languages for processors that are suitable for such dual use. Therefore, we have designed a functional-style l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPiCE: a system for translating Smalltalk programs into a C environment

    Publication Year: 1994 , Page(s): 113 - 123
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (808 KB)  

    Smalltalk-80 is very well suited for prototyping of applications, but it is less well suited for delivering applications because applications can neither run in isolation from the Smalltalk environment nor be combined with other programs written in other languages. By translating Smalltalk into C while preserving the semantics of Smalltalk, it is possible to deliver a standalone version of Smallta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics for a real-time object-oriented programming language

    Publication Year: 1994 , Page(s): 159 - 170
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (820 KB)  

    Presents a framework to define a semantics for a real-time object-oriented programming language and to verify programs written in the language. The semantics is defined as the collection of translation rules that map the syntactic constructions of the language into expressions in a process calculus extended with the notion of time. By using the expressive capabilities of the calculus, the semantic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Region analysis: a parallel elimination method for data flow analysis

    Publication Year: 1994 , Page(s): 31 - 42
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (928 KB)  

    Parallel data flow analysis methods offer the promise of calculating detailed semantic information about a program at compile-time more efficiently than sequential techniques. Previous work on parallel elimination methods has been hampered by the lack of control over interval size; this can prohibit effective parallel execution of these methods. To overcome this problem, we have designed the regio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual language for behavioral specifications of reactive systems

    Publication Year: 1994 , Page(s): 200 - 210
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (680 KB)  

    Complex reactive systems require specifying the relationship of inputs and outputs in the time domain. Typically, such descriptions involve complex sequences of events, often, with explicit timing constraints, that combine to form the system's overall behavior. In addition, most reactive systems are highly concurrent and hierarchical. Investigating formal methods for behavior specification of reac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binding-time analysis: abstract interpretation versus type inference

    Publication Year: 1994 , Page(s): 289 - 298
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (636 KB)  

    Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a program can be evaluated if some of the expected input is known. Two approaches to do this are abstract interpretation and type inference. We compare two specific such analyses to see which one determines most program ports to be eliminable. The first is a an abstract interpretation approach based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using metaprogramming to add persistence to CLOS

    Publication Year: 1994 , Page(s): 136 - 147
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (948 KB)  

    By encapsulating aspects of language semantics within a set of default classes and allowing the programmer to derive new versions, object-oriented languages whose semantics con be tailored to the needs of individual programmers have been provided. The degree to which such languages are simultaneously flexible and efficient is an open question. We describe our experience with using this technique t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compositional semantics for conditional term rewriting systems

    Publication Year: 1994 , Page(s): 171 - 182
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (928 KB)  

    The article considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context, an equational logic program is viewed as consisting of a set of modules, each module defining a part of the program's functions. We define a compositional semantics for conditional term rewriting systems which we show t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Taming control flow: a structured approach to eliminating goto statements

    Publication Year: 1994 , Page(s): 229 - 240
    Cited by:  Papers (8)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1008 KB)  

    In designing optimizing and parallelizing compilers, it is often simpler and more efficient to deal with programs that have structured control flow. Although most programmers naturally program in a structured fashion, there remain many important programs and benchmarks that include some number of goto statements, thus rendering the entire program unstructured. Such unstructured programs cannot be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic modules in higher-order languages

    Publication Year: 1994 , Page(s): 74 - 87
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (772 KB)  

    Providing programmers the ability to construct meaningful abstractions to help manage complexity is a serious language design issue. Many languages define a module system that can be used to specify distinct namespaces, and build user-defined data abstractions; however, few languages support dynamic modules, i.e., modules which are true first-class objects. We define a module semantics for a diale... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A compositional approach to concurrent object-oriented programming

    Publication Year: 1994 , Page(s): 124 - 135
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1084 KB)  

    Presents a model of concurrent object-oriented programming in which specification of computational behavior is separated from specification of interaction behavior of methods. This compositional approach to concurrent programming avoids some of the conceptual difficulties that have plagued the integration of concurrency and object-oriented models of programs. The compositional approach to concurre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating optimizing specializers

    Publication Year: 1994 , Page(s): 183 - 194
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (808 KB)  

    We propose a new method for improving the specialization of programs by inserting an interpreter between a subject program and a specializer. We formulate three specializer projections which enable us to generate specializers from interpreters. The goal is to provide a new way to control the specialization of programs, and we report the first practical results. This is a step towards the automatic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.