By Topic

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

Date 20-23 April 1992

Filter Results

Displaying Results 1 - 25 of 35
  • Proceedings of the 1992 International Conference on Computer Languages (Cat. No.92CH3082-5)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Parallel ordered attribute grammars

    Publication Year: 1992, Page(s):106 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    Ordered attributed grammars (OAGs) are extended for use on parallel computers. A partition of the attributes of a tree leads to parallel evaluation if each partition is taken care of by a separate process. Visit sequences for parallel ordered attribute grammars (POAGs) are constructed, and it is shown that the POAG class is of the same power as the OAG class. The construction always leads to deadl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automatically generated and provably correct compiler for a subset of Ada

    Publication Year: 1992, Page(s):117 - 126
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The automatic generation of a provably correct compiler for a nontrivial subset of Ada is described. The compiler is generated from an action semantic description; it emits absolute code for an abstract RISC (reduced instruction set computer) machine language that currently is assembled into code for the SPARC and the HP Precision Architecture. The generated code is an order of magnitude better th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DML-a meta-language and system for the generation of practical and efficient compilers from denotational specifications

    Publication Year: 1992, Page(s):127 - 136
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    DML (Denotational Meta Language) is a specification language and a compiler generation tool for producing practical and efficient compilers from denotational semantics specifications. This means that code emitted from generated compilers should be product quality, and that generated compilers should have reasonable compilation speed and interface well with standard front-ends and back-ends. To ach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations

    Publication Year: 1992, Page(s):2 - 13
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    The problem of interference and aliasing in programming languages with structured, dynamically allocated data is studied. The author starts from a novel semantic model of data aliasing, then elaborates new results in formal language theory in order to represent its invariants, and finally uses these results to derive an efficient and online algorithm for statically determining dynamic aliasing pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint specification on object-oriented databases

    Publication Year: 1992, Page(s):300 - 309
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    The main semantics of constraints pertaining to OO (object-oriented) databases are identified, constraints are classified into types based on these semantics, and a simple and powerful constraint language for OO databases is described. If a set of constraints needs to be defined over the same subdatabase, the approach allows for defining the shared subdatabase first, followed by the set of constra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static analysis of PostScript code

    Publication Year: 1992, Page(s):14 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    It is pointed out that stack-based languages, such as PostScript, present a major challenge to static analysis techniques because of their almost unlimited polymorphism. A regular expression notation that is used to represent allowed combinations of types on the stack at different points in a PostScript program is introduced. An abstract interpretation algorithm can then be used to perform static-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered architecture of multiple programming language system for multiparadigm programming

    Publication Year: 1992, Page(s):190 - 199
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A layered architecture that can provide a unified environment for multiparadigm programming on sequential processors is described. The architecture gives open-endedness to a system for programming in multiple languages based on multiple paradigms. Language-specific constructs such as control structures and variable definitions are given in an upper layer. Lower layers describe concepts common to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic issues in the design of languages for debugging

    Publication Year: 1992, Page(s):252 - 261
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Some of the inherently difficult issues that will be faced by a designer of any imperative debugging language are surveyed. A powerful debugging language called GDL (General-purpose Debugging Language) is outlined, the particular set of mechanisms included in GDL is justified, and the issue of minimality of this set is addressed. The focus is especially on the semantic issues that arise when the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the power of abstract interpretation

    Publication Year: 1992, Page(s):24 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    R.C. Sekar et al. (1991) studied the power of strictness analysis techniques and showed that strictness analysis is perfect up to variations in constants. The authors generalize this approach to abstract interpretation in general by defining a notion of similarity semantics. This semantics associates with a program a collection of interpretations all of which are obtained by blurring the distincti... View full abstract»

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

    Publication Year: 1992, Page(s):310 - 319
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    Synchronizing Resources (SR) is a language for writing distributed programs which supports many forms of interprocess communication to obtain high expressiveness. The design of SR is evaluated from the perspective of parallel programming. Several programs for parallel applications implemented in SR are studied, and some observations are made about the expressiveness and ease of use of SR. The resu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPMD execution of programs with dynamic data structures on distributed memory machines

    Publication Year: 1992, Page(s):232 - 241
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    A combination of language features and compilation techniques that permits SPMD (single-program multiple-data) execution of programs with pointer-based dynamic data structures is presented. The Distributed Dynamic Pascal (DDP) language, which supports the construction and manipulation of local as well as distributed data structures, is described. The compiler techniques developed translate a seque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing structural recursion in functional programs

    Publication Year: 1992, Page(s):76 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    An optimization technique for the implementation of functional languages with eager evaluation is described. Recursion is compiled into a variant of the Schorr-Waite algorithm that is faster and uses less stack space than a standard runtime stack implementation. Analysis techniques are provided to determine the safety of the optimization View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modula-P-a language for parallel programming definition and implementation on a transputer network

    Publication Year: 1992, Page(s):54 - 64
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    The programming language Modula-P extends Modula-2 with CSP-based (communicating-sequential-process-based) language constructs, i.e., parallel processes, synchronous message passing, and simultaneous waiting for events. The language and its implementation on a transputer network are presented. It is concluded that Modula-P and the development system MOCKA-P offer a very powerful programming enviro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metalinguistic features for formal parallel-program transformation

    Publication Year: 1992, Page(s):65 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    A set of metalinguistic features and their applications in formal parallel-program transformation are described. Program transformation is an effective methodology for developing correct and efficient parallel programs. However, manually carrying out the transformation is usually very cumbersome and error-prone. These metalinguistic features provide convenient language constructs for expressing an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity issues in the design of functional languages with explicit parallelism

    Publication Year: 1992, Page(s):34 - 43
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    It is shown that for a functional language with explicit parallelisms, at least two different parallel operators are necessary from a complexity point of view. In principle, just one of these operators is semantically sufficient, but the other cannot be implemented in constant time using this one operator. The parallel functional language is a first-order language (in order to keep the semantics s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program structure as basis for parallelizing global register allocation

    Publication Year: 1992, Page(s):262 - 271
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    A model that uses knowledge about program structure to guide global register allocation explicitly is proposed. Restrictions that must be met by the live ranges of loops and conditionals such that the corresponding portion of the register conflict graph is an interval graph are defined. Interval graphs are desirable because they can be colored optimally in polynomial time and because clique separa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dora-an environment for experimenting with compiler optimizers

    Publication Year: 1992, Page(s):86 - 95
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The design philosophy behind Dora, an environment for experimenting with compiler optimizers, is discussed. Dora encourages the writing of reusable optimizations by using a single intermediate-language schema to represent programs for all languages, machines, and code levels. Sal, a tree-attribute language, and Tess, a tree-rewrite language, provide support in quickly writing and experimenting wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract fixpoint semantics and abstract procedural semantics of definite logic programs

    Publication Year: 1992, Page(s):147 - 154
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A class of abstract interpretations of definite logic programs are discussed that are characterized by stable abstraction functions and a procedural characterization of the abstract fixpoint semantics is given. The authors give the notion of partial unification and define abstract fixpoint semantics. They then define a partial SLD resolution procedure over the concrete domain and relate it to the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract data groups: structuring distributed programs as layers

    Publication Year: 1992, Page(s):222 - 231
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Processes that cooperate in a binary fashion and hierarchical compositions of these are a popular structuring concept for distributed programming. The issue of modularizing distributed programs is discussed, and a modularization mechanism, abstract data groups (ADGs), is introduced. Examples are used to show why ADGs are useful and to indicate problems with previous methods. A comparison with rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attaching instance variables to method realization1 instead of classes

    Publication Year: 1992, Page(s):291 - 299
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The authors discuss an object model in which instance-variable definitions are associated with the implementations of each method in a class, rather than with the class as a whole. This allows avoidance of recompilation of methods and invalidation of existing objects when new instance variables are introduced for a class, smooth integration of temporary objects with objects in persistent stores, f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visual knowledge representation language for layout problem

    Publication Year: 1992, Page(s):181 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    A knowledge programming approach is proposed in order to solve a layout problem. This approach describes a problem in a two-dimensional language called a visual language, applies to the problem a form of the knowledge that is also described in the visual language, solves the problem, and represents the solution also in the visual language. The knowledge is represented by visual production rules. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing programming languages for analyzability: a fresh look at pointer data structures

    Publication Year: 1992, Page(s):242 - 251
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    A programming language mechanism and associated compiler techniques which significantly enhance the analyzability of pointer-based data structures frequently used in nonscientific programs are proposed. The approach is based on exploiting two important properties of pointer data structures: structural inductivity and speculative traversability. Structural inductivity facilitates the application of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward relaxing assumptions in languages and the1r implementations

    Publication Year: 1992, Page(s):202 - 211
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    It is pointed out that language implementors frequently make preemptive decisions concerning the exact implementations of language features. These decisions constrain programmers' control over their computations and may tempt them to write involuted code to obtain special (or efficient) effects. In many cases, one can distinguish some properties of a language facility that are essential to the sem... View full abstract»

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

    Publication Year: 1992, Page(s):282 - 290
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Several roles of classes in existing languages are unbundled by providing a suite of operators independently controlling such effects as combination, modification, encapsulation, name resolution, and sharing, all on the single notion of a module. It is pointed out that all module operators are forms of inheritance: thus, inheritance not only is not in conflict with modularity in the present system... View full abstract»

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