By Topic

Proceedings of the 1992 International Conference on Computer Languages

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
  • 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 (13)  |  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.
  • 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.
  • Control abstraction in parallel programming languages

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

    Control abstraction is the process by which programmers define new control constructs, specifying a statement ordering separately from an implementation of that ordering. It is argued that control abstraction can and should play a central role in parallel programming. Control abstraction can be used to build new control constructs for the expression of parallelism. A control construct can have sev... 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.
  • 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.
  • 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.
  • Designing programming languages for analyzability: a fresh look at pointer data structures

    Publication Year: 1992, Page(s):242 - 251
    Cited by:  Papers (5)  |  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.
  • 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.
  • Experimental evaluation of a generic abstract interpretation algorithm for Prolog

    Publication Year: 1992, Page(s):137 - 146
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The practical value of research involving the abstract interpretation of Prolog programs was examined experimentally. The design and implementation of the generic abstract interpretation algorithm originally proposed by B. Le Charlier (1991), its instantiation in a sophisticated abstract domain containing modes, types, sharing and aliasing, and its evaluation in terms of performance and accuracy a... 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.
  • Distributed Eiffel: a language for programming multi-granular distributed objects on the Clouds operating system

    Publication Year: 1992, Page(s):331 - 340
    Cited by:  Papers (5)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The design and implementation of Distributed Eiffel, a language designed and implemented for distributed programming, on top of the Clouds operating system by extending the object-oriented language Eiffel are discussed. The language presents a programming paradigm based on objects of multiple granularity. While large-grained persistent objects serve as units of distribution, fine-grained objects a... 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.
  • 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.
  • Compositional specification of parallel time-critical systems

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

    The work discussed originated in an attempt to shape a practical specification tool that closely integrates a formal specification method into a software development process of parallel time-critical systems. The principal new feature is the concept of incorporating the specification of the dynamic behavior of a system component as part of its type information. Two well-formedness conditions for t... 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.
  • Computations, abstractions and constraints in logic programs

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

    A general framework, the computation system, that encompasses both the execution of constraint logic programs and their static analyses based on the abstract interpretation paradigm is presented. The notion of approximation (or abstraction) between two computation systems C and C' is defined. For a concrete program P of a computation system C, a corresponding abstract program P' of C' is defined s... 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.
  • 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.
  • 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.
  • Procedure cloning

    Publication Year: 1992, Page(s):96 - 105
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Procedure cloning is an interprocedural optimization where the compiler creates specialized copies of procedure bodies. The authors examine the problem of procedure cloning and describe an experiment where cloning was required to make other transformations possible. They present a three-phase algorithm for deciding how to clone a program and analyze the algorithm's complexity. The algorithm finds ... 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.
  • 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.