This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
834.0 Querying the World Wide Web - Mendelzon, Mihaila, Milo (1997)(Correct)
1
The World Wide Web is a large, heterogeneous,
distributed collection of documents connected by
hypertext links. The most common technology currently
used for searching the Web depends on sending... / is implemented in the Java programming language SM and can be downloaded
689.3 A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1997)(Correct)
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying auth... / but extremely expressive programming language. It is an important result br to writing it in any programming language with suitable
565.9 GOLOG: A Logic Programming Language for Dynamic Domains - Levesque, Reiter, Lespérance, .. (1997)(Correct)
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied... / GOLOG A Logic Programming Language for Dynamic Domains br paper proposes a new logic programming language called GOLOG whose
534.0 Efficient Software-Based Fault Isolation - Wahbe, Lucco, Anderson, Graham (1993)(Correct)
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch o... / operations are portable and programming language independent. Our approach br We have identified several programming-languageindependent transformation
531.9 Parallel Programming in Split-C - Culler (1993)(Correct)
We introduce the Split-C language, a parallel extension
of C intended for high performance programming
on distributed memory multiprocessors, and demonstrate
the use of the language in optimizing para... / parallel extension of the C programming language that supports efficient
530.4 The Oz Programming Model - Smolka (1995)(Correct)
The Oz Programming Model (OPM) is a concurrent programming model subsuming higher- order functional and object-oriented programming as facets of a general model. This is particularly interesting for c... / together with a concomitant programming language Oz which is designed for br of the fact that current programming languages were conceived for
485.1 Pict: A Programming Language Based on the Pi-Calculus - Pierce, Turner (1997)(Correct)
The π-calculus offers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports (via simple encodings) a wide range of high-level constructs including dat... / Pict A Programming Language Based on the Pi-Calculus br a strongly-typed concurrent programming language constructed in terms of an
443.4 Points-to analysis in almost linear time - Steensgaard (1996)(Correct)
We present an interprocedural points-to analysis based on type inference that has an almost linear time cost complexity. To our knowledge, this is the fastest points-to analysis algorithm yet describe... / is borrowed from the C programming language KR All variables are br Symposium on Principles of Programming Languages pages - . ACM
441.9 Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller (1994)(Correct)
When logic programming is based on the proof theory of intuitionistic logic, it is natural
to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of
the form D oe G fr... / calling it a logic programming language. Logic programs based on br interpreter for this logic programming language must address the problem of
420.2 Decentralized Trust Management - Blaze, Feigenbaum, Lacy (1996)(Correct)
We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and securi... / of programs in a safe programming language. Existing systems are br written in a general programming language the trust language for an
418.1 Model Checking Java Programs Using Java PathFinder - Havelund, Pressburger (1999)(Correct)
This paper describes a translator called Java
PathFinder from Java to Promela, the "programming
language" of the Spin model checker. The purpose
is to establish a framework for verification and debu... / Java to Promela the programming language of the Spin model br Java to Promela the programming language of the Spin model
394.2 The Design and Implementation of a Certifying Compiler - Necula, Lee (1998)(Correct)
This paper presents the design and implementation of a
compiler that translates programs written in a type-safe
subset of the C programming language into highly optimized
DEC Alpha assembly language p... / a type-safe subset of the C programming language into highly optimized DEC br translates a strongly typed programming language essentially a type-safe
391.7 Representing Action and Change by Logic Programs - Gelfond, Lifschitz (1993)(Correct)
We represent properties of actions in a logic programming language
that uses both classical negation and negation as failure. The
method is applicable to temporal projection problems with incomplete
i... / of actions in a logic programming language that uses both classical br of actions in logic programming languages with negation as failure.
388.4 Efficient Context-Sensitive Pointer Analysis for C Programs - Wilson, Lam (1995)(Correct)
This paper proposes an efficient technique for contextsensitive
pointer analysis that is applicable to real C programs.
For efficiency, we summarize the effects of procedures
using partial transfer fu... / Acm Sigplan' Conference On Programminglanguage Design And br SIGPLAN' Conference on Programming Language Design and
373.9 Horus: A Flexible Group Communications System - van Renesse, Birman, Maffeis (1996)(Correct)
This paper reports on the Horus system, which provides an unusually flexible group communication model to application-developers. This flexibility extends to system interfaces, the properties provided... / system-calls the Tk Tcl programming language and other distributed br the Tcl TK graphical programming language to Horus. A challenge
350.5 Imperative functional programming - Jones, Wadler (1993)(Correct)
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, an... / Symposium on Principles Of Programming Languages POPL Charleston Jan br any procedure written in the programming language C Kernighan Ritchie
348.5 Secure Information Flow in a Multi-threaded Imperative Language - Smith, Volpano (1998)(Correct)
Previously, we developed a type system to ensure secure information flow in a sequential, imperative programming language [VSI96]. Program variables are classified as either high or low security; intu... / in a sequential imperative programming language VSI Program variables br Symposium on Principles of Programming Languages San Diego California
345.6 The Temporal Logic of Actions - Lamport (1994)(Correct)
This report introduces TLA and describes how it is used to specify and verify concurrent algorithms. The use of TLA to specify and reason about open systems will be described elsewhere. Categories and... / in ACM Transactions on Programming Languages and Systems. The br ACM Transactions on Programming Languages and Systems Vol No.
345.4 Preliminary Design of JML: A Behavioral Interface Specification.. - Leavens, Baker, Ruby (1999)(Correct)
JML is a behavioral interface specification language tailored to Java. It also allows
assertions to be intermixed with Java code, as an aid to verification and debugging.
JML is designed to be used by... / written in a specific programming language BISLs are inherently br written in the syntax of the programming language thus JML uses the Java
344.8 Uniprocessor Garbage Collection Techniques - Wilson (1992)(Correct)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying, and t... / basic abstractions of the programming language making errors hard to br are not integrated into the programming language. The fact that such kludges
337.1 PLAN: A Packet Language for Active Networks - Hicks (1998)(Correct)
PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudime... / a primitive program in the programming language defined by the packet br Or using our analogy the programming language and its specification
336.2 TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995)(Correct)
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional
polymorphism, tag-free garbage collection, conventional functional language optimization,
and loo... / SIGPLAN ' Conference on Programming Language Design and br storage management for the programming language Pascal. Master's thesis
331.4 A Type System for Object Initialization In the Java Bytecode Language - Freund, Mitchell (1998)(Correct)
In the standard Java implementation, a Java language
program is compiled to Java bytecode. This bytecode
may be sent across the network to another site, where it
is then interpreted by the Java Virtua... / Introduction The Java programming language is a statically-typed br general-purpose programming language with an implementation
331.4 A Type System for Object Initialization In the Java Bytecode Language .. - Freund (1998)(Correct)
In the standard Java implementation, a Java language program is compiled to
Java bytecode and this bytecode is then interpreted by the Java Virtual Machine.
Since bytecode may be written by hand, or c... / Introduction The Java programming language is a statically-typed br general-purpose programming language with an implementation
327.9 Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees, (ed.).. (1991)(Correct)
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates th... / defining description of the programming language Scheme. Scheme is a br dialect of the Lisp programming language invented by Guy Lewis
327.2 Typed Memory Management in a Calculus of Capabilities - Crary, Walker, Morrisett (1999)(Correct)
An increasing number of systems rely on programming language
technology to ensure safety and security of low-level
code. Unfortunately, these systems typically rely on a complex,
trusted garbage colle... / number of systems rely on programming language technology to ensure br on the Principles of ProgrammingLanguages San Antonio Texas
323.7 An Old-Fashioned Recipe for Real Time - Abadi, Lamport (1993)(Correct)
Traditional methods for specifying and reasoning about concurrent systems work for realtime systems. Using TLA (the temporal logic of actions), we illustrate how they work with the examples of a queu... / in ACM Transactions on Programming Languages and Systems. An br A- ACM Transactions on Programming Languages and Systems Vol No.
318.9 A Syntactic Approach to Type Soundness - Wright, Felleisen (1992)(Correct)
We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory log... / from combinatory logic to programming languages and the use of br Static type systems for programming languages attempt to prevent the
272.7 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The main id... / execution D. . Programming Languages Language Constructs and br management D. . Programming Languages
263.7 Optimizing ML with Run-Time Code Generation - Leone, Lee (1995)(Correct)
We describe the design and implementation of a compiler that automatically translates ordinary
programs written in a subset of ML into code that generates native code at run time. Run-time
code genera... / approach is to design the programming language so that run-time code br a safe or easily verified programming language so that it can be trusted
260.8 Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren (1996)(Correct)
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Desp... / of predicate calculus as a programming language and forms the computational br of predicate logic as a programming language. It has the advantages of
259.5 PolyP - a polytypic programming language extension - Jansson, Jeuring (1997)(Correct)
Many functions have to be written over and over again
for different datatypes, either because datatypes change
during the development of programs, or because functions
with similar functionality are n... / PolyP -a polytypic programming language extension Patrik Jansson br Symposium on Principles of Programming Languages Paris France January
254.3 Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting - Deutsch (1994)(Correct)
Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: k-limiting, which blurs distinction between sub-objects below depth k; and store-bas... / Acm Sigplan Conference On Programming Language Design And Implementation br ACM Symp. on Principles of Programming Languages Orlando FL Jan. .
253.4 A Safe Approximate Algorithm for Interprocedural Pointer Aliasing - Landi, Ryder (1992)(Correct)
Aliasing occurs at some program point during execution when two or more names exist for
the same location. In a language which allows pointers, the problem of determining the set
of pairs of names at ... / Symposium on Principles of Programming Languages pages - January br SIGPLAN Conference on Programming Language Design and Implementation
252.1 Monad Transformers and Modular Interpreters - Liang, Hudak, Jones (1995)(Correct)
We show how a set of building blocks can be used to construct
programming language interpreters, and present implementations
of such building blocks capable of supporting many
commonly known features,... / can be used to construct programming language interpreters and present br discusses how to construct programming language interpreters out of
239.9 The SwitchWare Active Network Architecture - Alexander, al. (1998)(Correct)
Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance mu... / techniques from programming languages such as strong type br we have designed PLAN Programming Language for Active Networks to
229.7 Scripting: Higher Level Programming for the 21st Century - Ousterhout (1997)(Correct)
Scripting languages such as Perl and Tcl represent a very different style of programming than system programming languages such as C or Java TM . Scripting languages are designed for "gluing" applicat... / of programming than system programming languages such as C or Java TM br development than system programming languages. Increases in computer
228.5 A transformation-based optimiser for Haskell - Jones, Santos (1998)(Correct)
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilatio... / as in any modern functional programming language. For example in Haskell br Symposium on Principles of Programming Languages San Francisco ACM Jan
227.1 Operations for Learning with Graphical Models - Buntine (1994)(Correct)
This paper is a multidisciplinary review of empirical, statistical learning from a graphical
model perspective. Well-known examples of graphical models include Bayesian networks,
directed graphs repre... / same way that a high-level programming language leads to higher
222.2 Actions with Indirect Effects - Kartha, Lifschitz (1994)(Correct)
We define and study a high-level language for
describing actions that extends the language
A introduced by Gelfond and Lifschitz. The
new language, AR 0 , allows us to describe actions
with indirect ... / subset of A into a logic programming language and the translation is
221.2 Parameterized Types for Java - Myers, Bank, Liskov (1997)(Correct)
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This paper extends Java in one... / a type-safe object-oriented programming language that is interesting br some other statically-typed programming languages KLMM OL Omo In
214.4 Programming Parallel Algorithms - Blelloch (1996)(Correct)
This paper is also available on the World-Wide Web at: unknown Programming Parallel Algorithms
Guy E. Blelloch
Keywords: Data-parallel, parallel algorithms, supercomputers, nested parallelism, PRAM mo... / PRAM model parallel programming languages collection-oriented br concrete we describe the programming language Nesl which we
214.3 Munin: Distributed Shared Memory Based on Type-Specific Memory.. - Bennett, Carter, Zwaenepoel (1990)(Correct)
We are developing Munin, a system that allows programs written for shared memory multiprocessors to be executed efficiently on distributed memory machines. Munin attempts to overcome the architectural... / it studies sharing at the programming language level and hence it is br provided by object oriented programming languages makes them good
211.5 PolyTOIL: A type-safe polymorphic object-oriented language - Bruce, Fiech, Schuett (1995)(Correct)
PolyTOIL is a new statically-typed polymorphic object-oriented programming language which is provably type-safe. By separating the definitions of subtyping and inheritance, providing a name for the ty... / polymorphic object-oriented programming language which is provably br Because most object-oriented programming languages are imperative it was
211.4 PLAN: A Programming Language for Active Networks - Hicks, Kakkar, Moore, Gunter, Nettles (1998)(Correct)
PLAN (Programming Language for Active Networks) is a new language for programs that are carried in the packets of a programmable network. PLAN programs replace the packet headers (which can be viewed ... / PLAN A Programming Language for Active Networks br Abstract PLAN Programming Language for Active Networks is a
208.3 APRIL: A Processor Architecture for Multiprocessing - Agarwal (1990)(Correct)
Processors in large-scale multiprocessors must be able to tolerate large communication latencies and synchronization delays. This paper describes the architecture of a rapid-context-switching processo... / Model Our experimental programming language for ALEWIFE is Mul-T br ACM Transactions on Programming Languages and Systems
206.1 Wait-Free Synchronization - Herlihy (1993)(Correct)
A wait-free implementation of a concurrent data object is one that
guarantees that any process can complete any operation in a finite
number of steps, regardless of the execution speeds of the other p... / A machine architecture or programming language is computationally powerful br ACM Transactions on Programming Languages and Systems
200.0 VIS: A System for Verification and Synthesis - Brayton, Sangiovanni-Vincentelli.. (1996)(Correct)
ion Manual abstraction can be performed by giving a file containing the names of variables to abstract. For each
variable appearing in the file, a new primary input node is created to drive all the no... / the one available in the C programming language. Conceptually it would be br implemented VIS using the C programming language and it has been ported to
199.9 Units: Cool Modules for HOT Languages - Flatt, Felleisen (1998)(Correct)
A module system ought to enable assembly-line programming
using separate compilation and an expressive linking
language. Separate compilation allows programmers to
develop parts of a program independ... / ffl Types If the core programming language supports static type br the module language into the programming language. The last gives
199.9 An Architecture for Next Generation Middleware - Blair, Coulson, Robin, Papathomas (1998)(Correct)
This paper proposes an approach to the design of configurable and open
middleware platforms based on the concept of reflection. More specifically, the
paper introduces a language-independent reflectiv... / restricted to the field of programming language design Kiczaleset al br of AL- D a reflective programming language for distributed
197.5 Exploiting Style in Architectural Design Environments - Garlan, Allen, Ockerbloom (1994)(Correct)
As the design of software architectures emerges as a discipline
within software engineering, it will become increasingly important
to support architectural description and analysis with tools and
envi... / as a BNF description of a programming language a lifecycle model a br invocation to traditional programming languages. In Proceedings of the
188.4 Charlotte: Metacomputing on the Web - Baratloo (1996)(Correct)
The World Wide Web has the potential of being used as
an inexpensive and convenient metacomputing resource.
This brings forward new challenges and invalidates many
of the assumptions made in offering ... / secure language. The Java programming language guards against mischievous br are tied to a particular programming language and a particular target
187.6 The Evolution of Evolvability in Genetic Programming - Altenberg (1994)(Correct)
Introduction
The choice of genetic operators and representations has proven critical to the performance
of genetic algorithms (GAs), because they comprise dual aspects of the same process: the
creatio... / or LISP versus some other programming language these are fixed at the
185.5 Reasoning about Termination of Pure Prolog Programs - Apt, al. (1993)(Correct)
We provide a theoretical basis for studying termination of (general) logic programs with
the Prolog selection rule. To this end we study the class of left terminating programs. These
are logic program... / Background Prolog is a programming language based on logic programming.
181.8 What is a Recursive Module? - Crary, Harper, Puri (1999)(Correct)
A hierarchical module system is an effective tool for
structuring large programs. Strictly hierarchical module
systems impose an acyclic ordering on import dependencies
among program units. This can i... / acyclic graph. Most modern programming languages include module systems br at the Conference on Programming Language Design and Implementation.
181.0 The Amber System: Parallel Programming on a Network of Multiprocessors - Chase (1989)(Correct)
Microprocessor-based shared-memory multiprocessors are becoming widely available and
promise to provide cost-effective high-performance computing.
This paper describes a programming system called Ambe... / subset of the Cprogramming language supplemented with br subset of the Cprogramming language Stroustrup to which
178.7 Qualitative Spatial Representation and Reasoning with the Region.. - Cohn, Bennett, Gooday, Gotts (1997)(Correct)
This paper surveys the work of the qualitative spatial reasoning group at the University of Leeds. The group has developed a number of logical calculi for representing and reasoning with qualitative... / and semantics of Visual Programming languages Gooday and Cohn br the semantics of a visual programming language. This is followed by a
178.7 A Framework for Classifying and Comparing Architecture Description.. - Medvidovic (1997)(Correct)
Software architectures shift developers' focus from lines-of-code to
coarser-grained architectural elements and their interconnection structure. Architecture
description languages (ADLs) have been p... / simulation and programming languages on the other. This paper br MIL simulation and programming languages PL on the other. Indeed
177.1 A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell, Mitchell, Scedrov (1998)(Correct)
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are written in a form of pr... / a standard relation from programming language theory that involves br notion from the study of programming languages. Namely two processes
175.3 Unifying Data and Control Transformations for Distributed Shared.. - Cierniak (1994)(Correct)
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Control transformations inv... / transformations. Existing programming languages allow programs whose br make sure that none of the programming language constructs discussed in
174.4 Building Reliable Distributed Systems with CORBA - Landis, Maffeis (1997)(Correct)
New classes of large-scale distributed applications will
have to deal with unpredictable communication delays,
with partial failures, and with networks that
partition. In addition, sophisticated appli... / the service. The programming language which was used to br independent of the specific programming languages and techniques used to
173.5 Standard ML of New Jersey - Appel, MacQueen (1991)(Correct)
The Standard ML of New Jersey compiler has been under development for five years now. We have developed a robust and complete environment for Standard ML that supports the implementation of large soft... / end and interpreter for programming language research but the scope of br be the best general-purpose programming language yet developed to
172.7 Certifying Compilation and Run-time Code Generation - Hornof, Jim (1999)(Correct)
A certifying compiler takes a source language program and
produces object code, as well as a "certificate" that can be
used to verify that the object code satisfies desirable properties,
such as type ... / work has applied advanced programming language techniques to the problem. br concerns through another programming language technique certifying
170.0 Why Functional Programming Matters - Hughes (1984)(Correct)
As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can b... / is the key to successful programming and languages such as Modula-II br new kinds of glue in the programming language. Complicated scope rules
165.9 Java is Type Safe - Probably - Drossopoulou, Eisenbach (1997)(Correct)
Amidst rocketing numbers of enthusiastic Java programmers
and internet applet users, there is growing concern about the security
of executing Java code produced by external, unknown sources. Rather
... / the semantics of isolated programming language features or of minimal br features or of minimal programming languages there have not been
163.6 Cache-Conscious Structure Definition - Chilimbi, Davidson, Larus (1999)(Correct)
A program's cache performance can be improved by changing the
organization and layout of its data---even complex, pointer-based
data structures. Previous techniques improved the cache performance
of t... / Acm Sigplan' Conference On Programming Language Design And Implementation br Architectural Support for Programming Languages and Operating Systems
162.9 An Overview of the Spring System - Mitchell, Gibbons, Hamilton.. (1994)(Correct)
Spring is a highly modular, distributed, object-oriented
operating system. This paper describes the goals of the
Spring system and provides overviews of the Spring object
model, the security model, an... / tie ourselves to a single programming language which would have made the
154.5 A Functional Approach to External Graph Algorithms - Abello, Buchsbaum, Westbrook (1999)(Correct)
We present a new approach for designing external graph algorithms and use it to design simple deterministic and
randomized external algorithms for computing connected components, minimum spanning tree... / standard checkpointing and programming language optimization techniques. br amenable to general purpose programming language transformations that can
154.5 Programming in an Integrated Functional and Logic Language - Lloyd (1999)(Correct)
Escher is a general-purpose, declarative programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-prog... / general-purpose declarative programming language that integrates the best br both functional and logic programming languages. It has types and modules
154.2 JRes: A Resource Accounting Interface for Java - Czajkowski, von Eicken (1998)(Correct)
With the spread of the Internet the computing model on
server systems is undergoing several important changes.
Recent research ideas concerning dynamic operating
system extensibility are finding their... / executed on the server. The programming language Java is currently a br when designing a plain programming language. This is not so in the case
150.7 Type Inference for Recursively Constrained Types and its Application.. - Eifrig, Smith, Trifonov (1995)(Correct)
This paper addresses the problem of designing an object-oriented programming language with an
effective type inference mechanism. Recently developed programming languages including Standard
ML and Has... / designing an object-oriented programming language with an effective type br Recently developed programming languages including Standard ML and
150.7 Formalizing Style to Understand Descriptions of Software Architecture - Abowd, Allen, Garlan (1995)(Correct)
The software architecture of most systems is described informally and diagrammatically by means of
boxes and lines. In order for these descriptions to be meaningful at all, the diagrams are understood... / directly to facilities of a programming language or other executable br respect this is nothing new programming language researchers have been
144.0 Efficiently Updating Materialized Views - Blakeley, Larson, Tompa (1986)(Correct)
Query processing can be sped up by keeping frequently
accessed users' views materialized. However,
the need to access base relations in response to
queries can be avoided only if the materialized view... / model within a programming language suitable for data
142.2 On the Observable Properties of Higher Order Functions that.. - Pitts, Stark (1993)(Correct)
The research reported in this paper is concerned with the problem of reasoning
about properties of higher order functions involving state. It is motivated by the
desire to identify what, if any, are t... / Introduction Programming languages combining higher order br traditional techniques of programming language semantics and logics of
140.2 Automatic Program Parallelization - Banerjee, Eigenmann, Nicolau (1993)(Correct)
This paper presents an overview of automatic program
parallelization techniques. It covers dependence analysis
techniques, followed by a discussion of program transformations,
including straight-line ... / could take the form of new programming languages language extensions or br annotations to an existing programming language. Whatever the programming
139.1 Subtyping Constrained Types - Trifonov, Smith (1996)(Correct)
Constrained type systems are a natural generalization of Hindley/Milner type inference to
languages with subtyping. This paper develops several subtyping relations on constrained types.
We establish a... / object-oriented programming language that has as its basis a br for object-oriented programming languages they effectively address
136.3 PLANet: An Active Internetwork - Michael Hicks (1999)(Correct)
We present PLANet: an active network architecture and implementation.
In addition to a standard suite of Internet-like services,
PLANet has two key programmability features:
1. all packets contain pro... / in our special purpose programming language PLAN the Packet Language br a dialect of the ML programming language. These extensions add to or
136.2 An Orthogonally Persistent Java - Atkinson, Daynès, Jordan, Printezis, .. (1996)(Correct)
The language Java is enjoying a rapid rise in popularity as an application programming language. For many applications an effective provision of database facilities is required. Here we report on a pa... / popularity as an application programming language. For many applications an br Introduction The programming language Java Gosling et al.
133.3 MONA: Monadic Second-Order Logic in Practice - Henriksen, Jensen, Jørgensen.. (1995)(Correct)
1
The purpose of this article is to introduce Monadic Secondorder
Logic as a practical means of specifying regularity. The logic is a
highly succinct alternative to the use of regular expressions. We... / examples. In CR a programming language for nite domains based on br similar to those of programming languages. Predicates The user
133.3 Specialization of Perceptual Processes - Horswill (1994)(Correct)
In this report, I discuss the use of vision to support concrete, everyday activity. I
will argue that a variety of interesting tasks can be solved using simple and inexpensive
vision systems. I will p... / . Programming language issues br . briefly describes the programming language used. Section . describes
131.9 A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997)(Correct)
We introduce the type theory ¯ v , a call-by-value variant of Parigot's ¯-calculus, as a Curry-Howard representation theory of classical propositional proofs. The associated rewrite system is Church-R... / The attendant call-by-value programming language pcf v is obtained br Symposium on Principles of Programming Languages Paris January -
131.9 An Industrial Strength Theorem Prover for a Logic Based on Common Lisp - Kaufmann, Moore (1997)(Correct)
ACL2 is a re-implemented extended version
of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqthm,
intended for large scale verification projects. This paper
deals primarily with how we scaled up Nqthm's l... / to an industrial strength programming language -namely a large br subset of a commonly used programming language thereby gaining access to
130.4 Migratory Applications - Bharat (1995)(Correct)
We introduce a new genre of user interface applications that
can migrate from one machine to another, taking their user
interface and application contexts with them, and continue
from where they left ... / can be implemented at the programming language environment level. Our br structure or even about the programming language. The machine architecture
128.3 A Multiple-Conclusion Meta-Logic - Miller (1994)(Correct)
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic refinement, Lolli [12... / design of a number of logic programming languages. Two such languages br for concurrency. The logic programming language LO Linear Objects
127.6 Hybrid Probabilistic Programs - Dekhtyar, Subrahmanian (1997)(Correct)
The precise probability of a compound event (e.g. e1 e2 ; e1 e2) depends upon the known
relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between
the primitive... / hybrid probabilistic logic programming language in which the user can
126.0 The Design Of Postgres - Stonebraker, Rowe (1986)(Correct)
This paper presents the preliminary design of a new database management system, called POSTGRES, that is the successor to the INGRES relational database system. The main design goals of the new system... / the query language and programming language interface respectively to br written in a general purpose programming language with embedded data
125.7 Coordinating Multiagent Applications on the WWW: A Reference.. - Ciancarini, Tolksdorf, Vitali.. (1998)(Correct)
The original Web did not support multiuser, interactive applications. This shortcoming is being studied, and several
approaches have been proposed to use the Web as a platform for programming Internet... / Web technology and the programming language Java. Several kinds of br supporting Internet programming languages such as Java allow
121.7 Concurrent Objects in a Process Calculus - Pierce, Turner (1995)(Correct)
A programming style based on concurrent objects arises almost inevitably
in languages where processes communicate by exchanging data on channels.
Using the pict language as an experimental testbed, we... / concurrent object-oriented programming languages Pap Nie VT br use a fragment of pict a programming language based on Milner Parrow
121.6 A Paradigmatic Object-Oriented Programming Language: Design, Static.. - Bruce (1993)(Correct)
In order to illuminate the fundamental concepts involved in object-oriented programming languages, we describe the design of TOOPL, a paradigmatic, statically-typed, functional, object-oriented progra... / Paradigmatic Object-Oriented Programming Language Design Static Typing br involved in object-oriented programming languages we describe the design of
119.9 Improving Data-flow Analysis with Path Profiles - Ammons (1998)(Correct)
Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, ... / Acm Sigplan Conference On Programming Language Design And Implementation br SIGPLAN ' Conference on Programming Language Design and
118.8 ParaWeb: Towards World-Wide Supercomputing - Tim Brecht (1996)(Correct)
In this paper, we describe the design of a system, called ParaWeb, for utilizing Internet or intra-net
computing resources in a seamless fashion. The goal is to allow users to execute serial programs ... / in the form of the Java programming language and Java Virtual
118.5 Scheduling and Page Migration for Multiprocessor Compute Servers - Chandra, Devine, Verghese, Gupta.. (1994)(Correct)
Several cache-coherent shared-memory multiprocessors have been developed that are scalable and offer a very tight coupling between the processing resources. They are therefore quite attractive for use... / Architectural Support for Programming Language and Operating Sytems br Architectural Support for Programming Languages and Operating Systems
117.5 Register Allocation with Instruction Scheduling: a New Approach - Pinter (1993)(Correct)
We present a new framework in which considerations of both register allocation and instruction scheduling can be applied uniformly and simultaneously. In this framework an optimal coloring of a graph,... / Architectural Support for Programming Languages and Operating Systems br cycle. ACM Transactions on Programming Languages and Systems
116.0 Programming and verifying real-time systems by means of the.. - Halbwachs, LAGNIER, RATEL (1994)(Correct)
We investigate the benefits of using a synchronous data-flow language for programming
critical real-time systems. These benefits concern ergonomy --- since the dataflow approach
meets traditional desc... / problem arguing that the programming language used has a direct influence br good basis for designing a programming language meeting the criterion
116.0 CENTAUR: the system - Borras, Clément, Despeyrouz.. (1988)(Correct)
syntax terms occur in most rules. They
have to be valid terms w.r.t. their abstract syntax.
Every such term is typed with a syntatic category.
The type-checking phase of TYPOL compilation uses
this in... / of a particular programming language -including syntax and br description of a particular programming language -including its syntax
115.9 Powerful Techniques for the Automatic Generation of Invariants - Bensalem (1996)(Correct)
When proving invariance properties of programs one is faced
with two problems. The first problem is related to the necessity of proving
tautologies of the considered assertion language, whereas the ... / as a program in a simple programming language and a predicate to be
115.9 The Structure of a Multi-Service Operating System - Roscoe (1995)(Correct)
This position paper describes research in progress into a new approach to structuring an operating
system. This approach is intended to facilitate the provision of "Quality of Service"
guarantees of r... / at compile time by the programming language. ffl Protection
114.8 The Flux OSKit: A Substrate for Kernel and Language Research - Ford (1997)(Correct)
Implementing new operating systems is tedious, costly, and often impractical except for large projects. The Flux OSKit addresses this problem in a novel way by providing clean, well-documented OS comp... / in operating systems and programming languages. Introduction As br constructs of a functional programming language. Our port of SR
114.2 Executing Java Threads in Parallel in a Distributed-Memory Environment - MacBeth, McGuigan, Hatcher (1998)(Correct)
We present the design and initial implementation
of Hyperion, an environment for the highperformance
execution of Java programs. Hyperion
supports high performance by utilizing
a Java-bytecode-to-C tr... / programs using the same programming language that they utilize to write br acceptance of data-parallel programming languages is that they require the
113.5 Turning SOS Rules into Equations - Aceto, Bloom, Vaandrager (1994)(Correct)
Many process algebras are defined by structural operational semantics (SOS). Indeed,
most such definitions are nicely structured and fit the GSOS format of [19]. We
give a procedure for converting any... / operational semantics for programming languages are best presented in br for proving properties of programming languages as a whole
110.6 UPPAAL in a Nutshell - Larsen, Pettersson, Yi (1997)(Correct)
This paper presents the overall structure, the
design criteria, and the main features of the tool box Uppaal.
It gives a detailed user guide which describes how
to use the various tools of Uppaal ve... / ta provides a basic programming language for timed automata. In br a high-level real-time programming language with various data types.
110.3 Predicate Migration: Optimizing Queries with Expensive Predicates - Hellerstein (1992)(Correct)
The traditional focus of relational query optimization schemes has been on the choice of join methods and join
orders. Restrictions have typically been handled in query optimizers by "predicate pushdo... / in a general-purpose programming language such as C or CThese br may be written in a general programming language such as C or in the
110.1 An Integrated Runtime and Compile-time Approach for Parallelizing.. - Agrawal, Sussman, Saltz (1995)(Correct)
In compiling applications for distributed memory machines, runtime analysis is required when data
to be communicated cannot be determined at compile-time. One such class of applications requiring
runt... / for HPF-like parallel programming languages in compiling codes in br major efforts in developing programming language and compiler support for
108.6 A High-Performance Microarchitecture with Hardware-Programmable.. - Razdan, Smith (1994)(Correct)
This paper explores a novel way to incorporate hardware-programmable
resources into a processor microarchitecture to improve the
performance of general-purpose applications. Through a coupling
of comp... / operating system and the programming language compilation techniques br ACM Symp. on Principles of Programming Languages Jan. . J.
108.6 Compiler Blockability of Numerical Algorithms - Carr (1992)(Correct)
Over the past decade, microprocessor design strategies have focused on increasing the computational power on a single chip. Unfortunately, memory speeds have not kept pace. The result is an imbalance ... / this algorithm in a current programming language in a manner that would br form. ACM Transactions on Programming Languages and Systems
107.2 Evaluation of KQML as an Agent Communication Language - Mayfield, Labrou, Finin (1996)(Correct)
This chapter discusses the desirable features of languages and protocols
for communication among intelligent information agents. These desiderata
aredividedintosevencategories:form,content,semantics... / agents. Virtually any programming language can be used for software br for a wide variety of programming languages including procedural
106.8 Lazy Code Motion - Knoop, Rüthing, Steffen (1992)(Correct)
We present a bit-vector algorithm for the optimal and economical placement of computations
within flow graphs, which is as efficient as standard uni-directional analyses. The
point of our algorithm is... / SIGPLAN Conference on Programming Languages Design and
106.1 A Practical Soft Type System for Scheme - Wright, Cartwright (1994)(Correct)
Soft typing is a generalization of static type checking that accommodates both dynamic typing and static typing in one framework. A soft type checker infers types for identifiers and inserts explicit ... / grubby features of a real programming language that Cartwright and br Safe implementations of a programming language guarantee to terminate
104.3 Compiling Haskell by program transformation: a report from the.. - Jones (1996)(Correct)
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilatio... / as in any modern functional programming language. For example in Haskell br Symposium on Principles of Programming Languages San Francisco ACM
104.0 Recursive Functions of Symbolic Expressions and Their Computation by.. - McCarthy (1960)(Correct)
this paper in L unknown Recursive Functions of Symbolic Expressions
and Their Computation by Machine, Part I
John McCarthy, Massachusetts Institute of Technology, Cambridge, Mass.
April 1960
1 / has advantages both as a programming language and as a vehicle for br an interpreter for the LISP programming language which describes computation
103.0 A Tour of Schism: A Partial Evaluation System For Higher-Order.. - Consel (1993)(Correct)
ion Parameters Expr))
(b) Standard Syntax
Figure 5: Abstract Syntax
(define (spec ae env prog cache)
(caseType ae
[(Id e) (specId e cache)]
[(Ev e) (specEv e env prog cache)]
[(AType tn) (specType tn ... / capture various applicative programming languages such as pure instances of br follows. In Section the programming language handled by Schism is
102.1 Distributed Processes and Location Failures - Riely (1997)(Correct)
Site failure is an essential aspect of distributed systems; nonetheless its effect on
programming language semantics remains poorly understood. To model such systems, we define
a process calculus in... / nonetheless its effect on programming language semantics remains poorly br ACM Transactions on Programming Languages and Systems
102.1 Java Access to Numerical Libraries - Casanova (1997)(Correct)
It is a common and somewhat erroneous belief that Java will always be "too slow" for scientific
computing. Two projects underway at the University of Tennessee are addressing the question of scientifi... / of Java as a viable programming language and the fact that it can br Fortran in a conventional programming language than it is to use an
102.1 A Practical Subtyping System For Erlang - Marlow (1997)(Correct)
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is similar to one explored... / a type system for the programming language Erlang. The type system br would expect from a typed programming language. Several gaps remain in
101.2 Metasystems: An Approach Combining Parallel Processing and.. - Grimshaw (1994)(Correct)
A metasystem is a single computing resource composed of a heterogeneous group of autonomous computers
linked together by a network. The interconnection network needed to construct large metasystems
wi... / computing into the programming language and run-time system. We br of Mentat the Mentat Programming Language MPL and the Mentat
101.2 A Semantics for Higher-order Functors - MacQueen, Tofte (1994)(Correct)
Standard ML has a module system that allows one to define parametric modules, called functors. Functors are "first-order," meaning that functors themselves cannot be passed as parameters or returned... / a grammar for a skeletal programming language and elaboration rules in br and A skeletal programming language In this section we
98.5 Foundations of a Logical Approach to Agent Programming - Lespérance, Levesque, Lin.. (1995)(Correct)
This paper describes a novel approach to high-level agent programming based on a highly developed logical theory of action. The user provides a specification of the agents' basic actions (precondition... / terms of these actions in a programming language where one can refer to br defined can be viewed as a programming language for agents. Given a
98.5 Declarative Programming in Escher - Lloyd (1995)(Correct)
ion) If t is a term of type fi and x ff is a variable of type ff, then x ff :t is a term of type ff ! fi. 4. (Application) If s is a term of type ff ! fi and t is a term of type ff, then (s t) is a te... / declarative general-purpose programming language which integrates the best br of both functional and logic programming languages. It has types and modules
97.1 Compositional Programming Abstractions for Mobile Computing - McCann, Roman (1998)(Correct)
ions for
Mobile Computing
Peter J. McCann, Gruia-Catalin Roman
Abstract--- Recent advances in wireless networking technology
and the increasing demand for ubiquitous, mobile
connectivity demonstrate ... / long been advocated in the programming language community but these
97.1 View Extraction and View Fusion in Architectural Understanding - Kazman, Carrière (1998)(Correct)
When performing architectural analysis on legacy systems,
it is frequently necessary to extract the architecture of
the system, because it has not been documented, or because
its documentation is out ... / no layer construct in a programming language there is no simple br the use of late binding in programming languages and the need to extract
96.2 Introducing Global Constraints in CHIP - Beldiceanu, Contejan (1994)(Correct)
The purpose of this paper is to show how the introduction of new primitive constraints (e.g. among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding ... / current constraint logic programming languages. One of the main advantage br is a constraint logic programming language designed to tackle real
92.7 Concurrency and Communication in Transaction Logic - Bonner, Kifer (1996)(Correct)
In previous work, we developed Transaction Logic (or T R), which deals with state changes in deductive databases. T R provides a logical framework in which elementary database updates and queries can ... / component of any database programming language. Even the simplest database br by existing concurrent logic programming languages In fact the
92.7 An Extensible Protocol Architecture for Application-Specific.. - Fiuczynski (1996)(Correct)
Plexus is a networking architecture that allows applications
to achieve high performance with customized
protocols. Application-specific protocols are written in
a typesafe language and installed dyna... / is written in a typesafe programming language which guarantees that the br is an Algol-like typesafe programming language. Extensions are
92.7 A Data Transformation System for Biological Data Sources - Buneman, Davidson, Hart, Overton.. (1995)(Correct)
Scientific data of importance to biologists in the Human Genome Project resides not only in conventional databases, but in structured files maintained in a number of different formats (e.g. ASN.1 and ... / close to that of high-level programming languages. It should be noted that br The language CPL Collection Programming Language is based on a type system
89.8 The reflexive CHAM and the join-calculus - Fournet, Gonthier (1995)(Correct)
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a prog... / the foundations of a programming language with functional and br in a distributed setting. Programming languages such as Actors or
89.8 The Design of a Pretty-printing Library - Hughes (1995)(Correct)
Layouts We'll begin by looking for an abstract model of a pretty-printer's output --- that is, prettily indented text. We could say that the output is just a string, but a string has so little structu... / component be used Every programming language worthy of the name allows br in ACM Transactions on Programming Languages and Systems Vol. No.
89.7 Mostly Parallel Garbage Collection - Boehm, Demers, Shenker (1991)(Correct)
We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it. We rely on virtual memory hardware to provide information a... / SIGPLAN ' Conference on Programming Language Design and Implementation br SIGPLAN ' Conference on Programming Language Design and Implementation
88.0 Constructing Distributed Systems In Conic - Magee, Kramer, Sloman (1989)(Correct)
Abstract -- Existing distributed systems vary from those which merely provide Existing distributed systems vary from those which merely provide interconnection of autonomous systems to those which pro... / systems networked systems programming language operating configuration br systems networked systems programming language operating system
86.5 Dependence-Based Program Analysis - Johnson, Pingali (1993)(Correct)
Program analysis and optimization can be speeded up through the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and static single assig... / and hidden in modern programming language control structures. br SIGPLAN ' Conference on Programming Language Design and
86.4 A type system for prototyping languages - Katiyar, Luckham, Mitchell (1994)(Correct)
Rapide is a programming language framework designed for the development of large, concurrent, real-time systems by prototyping. The framework consists of a type language and default executable, specif... / Abstract Rapide is a programming language framework designed for the br Introduction Rapide is a programming language framework with an
85.7 Run-time Code Generation and Modal-ML - Wickline, Lee, Pfenning (1998)(Correct)
This paper presents a typed programming language and
compiler for run-time code generation. The language, called
ML
2
, extends ML with modal operators in the style of the
Mini-ML
2
e language of ... / This paper presents a typed programming language and compiler for run-time br Acm Sigplan Conference On Programming Language Design And Implementation.
85.1 An Efficient Implementation of Reactivity for Modeling Hardware in.. - Liao, Tjiang, Gupta (1997)(Correct)
Reactivity is one of the key features of hardware
description languages. We present an efficient implementation
of reactivity in the Scenic framework that allows the system
designer to model hardware ... / models in a high-level programming language such as C or CThe br by starting with Ca programming language familiar to most designers
84.0 Safe and Efficient Sharing of Persistent Objects in Thor - Liskov, Adya, Castro, Day, Ghemawat, .. (1996)(Correct)
Thor is an object-oriented database system designed for use in a heterogeneous distributed environment. It provides highly-reliable and highly-available persistent storage for objects, and supports sa... / written in different programming languages. Safe heterogeneous br system and especially the programming language. Programs written in
84.0 The execution algorithm of Mercury, an efficient purely declarative.. - Zoltan Somogyi (1996)(Correct)
We introduce Mercury, a new purely declarative logic programming language designed to provide the support that
groups of application programmers need when building large programs. Mercury's strong typ... / purely declarative logic programming language Zoltan Somogyi Fergus br new purely declarative logic programming language designed to provide the
83.0 On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)(Correct)
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the re... / the notion of type in programming languages present a model of typed br model of typed polymorphic programming languages that reflects recent
82.4 A Language-Based Approach to Protocol Implementation - Abbott, Peterson (1993)(Correct)
Morpheus is a special-purpose programming language that facilitates the efficient implementation of communication protocols. Protocols are divided into three categories, called shapes, so that they ca... / is a special-purpose programming language that facilitates the br software problem-using a programming language designed specifically for
81.4 Data Flow Analysis for Verifying Properties of Concurrent Programs - Dwyer (1994)(Correct)
In this paper we present an approach, based on data
flow analysis, that can provide cost-effective analysis of
concurrent programs with respect to explicitly stated
correctness properties. Using this ... / being analyzed and the programming language in which it is written br ACM Transactions on Programming Languages and Systems
80.8 Solving Small TSPs with Constraints - Caseau, Laburthe (1997)(Correct)
This paper presents a set of techniques that makes constraint programming
a technique of choice for solving small (up to 30 nodes) traveling salesman
problems. These techniques include a propagation s... / we have used the CLAIRE programming language . Motivations br F. Laburthe. The CLAIRE Programming Language cole Normale Suprieure
80.8 Recursion from Cyclic Sharing: Traced Monoidal Categories and Models.. - Hasegawa (1997)(Correct)
Cyclic sharing (cyclic graph rewriting) has been used as a
practical technique for implementing recursive computation efficiently.
To capture its semantic nature, we introduce categorical models for... / the real implementations of programming languages we often use some kind br known that if we implement a programming language using the technique of
80.4 Distributed Object Management in Thor - Liskov, Day, Shrira (1993)(Correct)
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share object... / written in different programming languages to share objects in a br write programs in different programming languages. The programs have
79.9 A Rational Design for a Weighted Finite-State Transducer Library - Mohri, Pereira, Riley (1998)(Correct)
this paper is used ambiguously to
refer both to the use of the theory of rational power series as a foundation for
the library, and to the design approach, in which each object and function has
a well... / too different from that in programming-language parsing before lex and br of general methods in programming-language parsing before the
79.9 An Incremental Interpreter for High-Level Programs with Sensing - De Giacomo, Levesque (1998)(Correct)
Like classical planning, the execution of high-level
agent programs requires a reasoner to look all the
way to a final goal state before even a single action
can be taken in the world. This deferral i... / the expressive power of the programming language in question. In De br Hennessy. The Semantics of Programming Languages. John Wiley Sons
78.3 Improving the Performance of Runtime Parallelization - Leung, Zahorjan (1993)(Correct)
When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statically, compile time parallelization of the loop is not possible. In these cases, runtime parallelizati... / of the familiar sequential programming language while program execution
76.5 Interprocedural Conditional Branch Elimination - Bodik (1997)(Correct)
The existence of statically detectable correlation among conditional branches enables their elimination, an optimization that has a number of benefits. This paper presents techniques to determine whet... / SIGPLAN ' Conference on Programming Language Design and Implementation br SIGPLAN ' Conference on Programming Language Design and
76.5 Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)(Correct)
The syntax of comprehensions is very close to the syntax of a number of practical database query languages and is, we believe, a better starting point than first-order logic for the development of d... / of first-order logic as a programming language to cope with these richer br the theory and practice of programming languages for collection types and
75.8 Report on a SAT competition - Buro, Büning (1992)(Correct)
We present the results of a SAT competition organized in 1991/92 at the University of Paderborn. Here we asked for programs solving the satisfiability problem for formulas in conjunctive normal form. ... / written in different programming languages we asked for programs br programs written in the C programming language. We acknowledge gratefully
75.0 Higher-Order Logic Programming - Nadathur, Miller (1986)(Correct)
ly,
if a tactic R holds of G1 and G2, i.e., if (R G1 G2) is solvable from a presentation of primitive
tactics as a set of definite clauses, then satisfying the goal G2 in the object-language should su... / Introduction Modern programming languages such as Lisp Scheme and br found in functional programming languages it is possible to adopt a
74.2 Location Independence for Mobile Agents - Sewell (1998)(Correct)
this paper we study the first of these, considering the design, semantic definition and implementation
of communication primitives by which mobile agents can interact.
Communication primitives can be ... / Mobile agents require novel programming language support and raise new br far from being a practical programming language -it does not allow any
74.0 Chu Spaces: A Model Of Concurrency - Gupta (1994)(Correct)
A Chu space is a binary relation between two sets. In this thesis we show that Chu
spaces form a non-interleaving model of concurrency which extends event structures
while endowing them with an algebr... / expressive specification and programming language. We define a history br Symposium on Principles of Programming Languages January . Pra
72.4 Active Object - An Object Behavioral Pattern for Concurrent.. - Lavender, Schmidt (1996)(Correct)
This paper describes the Active Object pattern, which decouples
method execution from method invocation in order to
simplify synchronized access to an object that resides in its
own thread of control.... / standard strongly-typed programming language features rather than br Computation ACM Trans. Programming Languages and Systems vol. pp.
72.4 A Linear Logical Framework - Cervesato, Pfenning (1996)(Correct)
We present the linear type theory LLF as the forThis extended abstract will appear on the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96, New Brunswick, NJ,... / interpretation as a logic programming language under which the br logical formalisms and programming languages Unfortunately many
72.3 ECLiPSe: A Platform for Constraint Logic Programming - Wallace, Novello, Schimpf (1997)(Correct)
This paper introduces the Constraint Logic Programming (CLP) platform ECLiPSe. ECLiPSe is designed to be more than an implementation of CLP: it also supports mathematical programming and stochastic pr... / generation of constraint programming languages focussed on a single br e is a constraint logic programming language and it uses the same
72.1 Introducing OBJ - Goguen, Winkler, Meseguer.. (1993)(Correct)
This is an introduction to OBJ, describing its philosophy, its syntax, its history, and aspects of
its semantics, both logical and operational. Many examples are given, using Release 2 of OBJ3,
which ... / oriented specification and programming language and OOZE which br prototyping defining programming languages in a way that directly
72.1 Hybrid Systems in TLA+ - Lamport (1993)(Correct)
TLA + is a general purpose, formal specification language based on the Temporal Logic of Actions, with no built-in primitives for specifying real-time properties. Here, we use TLA + to define operat... / one based on an abstract programming language such as CSP because one br to introduce such a toy programming language. The control model is
72.1 Object Distribution in Orca using Compile-Time and Run-Time Techniques - Bal, Kaashoek (1993)(Correct)
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
program... / been designed for the Orca programming language Orca is a language br Weaver The DINO parallel programming language Journal of Parallel and
71.6 Typechecking and Modules for Multi-Methods - Chambers, Leavens (1994)(Correct)
Two major obstacles preventing the wider acceptance of multi-methods are concerns over the lack of encapsulation and modularity and the lack of static typechecking in existing multi-method-based langu... / CR Categories D. . Programming Languages Language Classifications br languages D. . Programming Language Language Constructs and
70.5 Collection-Oriented Languages - Sipelstein (1991)(Correct)
This research was supported in part by the Defense Advanced Research Projects Agency (DOD) and monitored
by the Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Di... / Abstract Several programming languages arising from widely br Introduction We call a programming language collection-oriented if
69.5 Constructive Analysis of Cyclic Circuits - Shiple, Berry, Touati (1996)(Correct)
Traditionally, circuits with combinational loops are
found only in asynchronous designs. However, combinational
loops can also be useful for synchronous circuit
design. Combinational loops can arise f... / the Esterel synchronous programming language. Introduction The br G. Gonthier. The synchronous programming language Esterel Design
69.1 Improving Programs which Recurse over Multiple Inductive Structures - Fegaras (1994)(Correct)
This paper considers generic recursion schemes for programs
which recurse over multiple inductive structures simultaneously,
such as equality, zip and the nth element of a list
function. Such schemes ... / of a modern functional programming language. Third we describe an br is the Goto of functional programming. Languages which allow arbitrary
68.5 Modular Domain Specific Languages and Tools - Hudak (1998)(Correct)
A domain specific language (DSL) allows one to
develop software for a particular application domain
quickly and e#ectively, yielding programs that are
easy to understand, reason about, and maintain. O... / higher-order and typed programming language such as Haskell or ML. In br language DSL is a programming language tailored for a particular
68.0 Complete Worst-Case Execution Time Analysis of Straight-line Hard.. - Stappert, Altenbernd (1997)(Correct)
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time
program is addressed. The analysis is focused on straight-line code (i.e. code without l... / high-level aspects on the programming language level is presented. On br of the department for programming languages and compilers of the
68.0 Portable Checkpointing for Heterogeneous Architectures - Ramkumar (1997)(Correct)
Current approaches for checkpointing assume system
homogeneity, where checkpointing and recovery
are both performed on the same processor architecture
and operating system configuration. Sometimes it ... / hardware support for programming languages e.g. register windows of br and system calls. Several programming language features are not
68.0 PERTS: A Prototyping Environment for Real-Time Systems - Liu, Redondo, Deng, Tia, Bettati.. (1993)(Correct)
PERTS is a prototyping environment for real-time systems. It is being built incrementally and will contain schedulers and resource access protocols for time-critical applications, together with tools ... / building blocks in the Cprogramming language. They can be customized br incrementally in the Cprogramming language. Again the editors needed
67.2 Mudding: Social Phenomena in Text-Based Virtual Realities - Curtis (1992)(Correct)
A MUD (Multi-User Dungeon or, sometimes, Multi-User Dimension) is a network-accessible, multi-participant, user-extensible virtual reality whose user interface is entirely textual. Participants (usual... / even support an embedded programming language in which a user can br of experience with the Lisp programming language. Pavel Curtis
67.0 A Basis For A Mathematical Theory Of Computation - McCarthy (1963)(Correct)
This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and compu... / . To develop a universal programming language. We believe that this goal br a candidate for a universal programming language because it lacks a number
66.6 Transportable Information Agents - Rus (1996)(Correct)
Transportable agents are autonomous programs. They can move through a heterogeneous network of computers under their own control, migrating from host to host. They can sense the state of the network, ... / in which a programming language provides a remote service br in ACM Transactions on Programming Languages and Systems
66.6 TIGUKAT: A Uniform Behavioral Objectbase Management System - Özsu, Peters, Szafron, Irani, Lipka, .. (1995)(Correct)
We describe the TIGUKAT objectbase management system that is under development at the Laboratory for Database Systems Research at the University of Alberta. TIGUKAT has a novel object model whose iden... / system of an object-oriented programming language as the object model of the br O Deu A database programming language is being designed that is
66.6 Counting Solutions to Presburger Formulas: How and Why - Pugh (1994)(Correct)
this paper, we describe methods that are able to
count the number of integer solutions to selected free
variables of a Presburger formula, or sum a polynomial
over all integer solutions of selected fr... / Sixth Annual Workshop on Programming Languages and Compilers for br Sixth Annual Workshop on Programming Languages and Compilers for
66.1 Object-Preserving Class Transformations - Bergstein (1991)(Correct)
Reorganization of classes for object-oriented programming
and object-oriented database design has
recently received considerable attention in the literature.
In this paper a small set of primitive
tra... / has the advantage of being programming language independent and is br a typical statically typed programming language e.g.CA
64.6 The Implementation Of Postgres - Stonebraker (1990)(Correct)
Currently, POSTGRES is about 90,000 lines of code in C and is being used by assorted "bold and brave" early users. The system has been constructed by a team of 5 part time students led by a full time ... / Object-oriented programming languages and data bases provide br system our choice of programming languages and some of our
64.1 Distributed Programming with Logic Tuple Spaces - Ciancarini (1994)(Correct)
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via e-mail at the address last-name@cs.unibo.it. UBLCS Technical Repo... / several sequential programming languages like C and Scheme. In br of designing a distributed programming language is that several different
63.9 Explicit Polymorphism and CPS Conversion - Harper (1993)(Correct)
We study the typing properties of CPS conversion for an extension of F ! with control operators. Two classes of evaluation strategies are considered, each with call-by-name and call-by-value variants.... / Symposium on Principles of Programming Languages Charleston SC January br the theory and practice of programming language design the concepts of
63.8 Generation of Components for Software Renovation Factories from.. - van den Brand, Sellink, Verhoef (1997)(Correct)
Syntax Tree
Transform
Parse Unparse
Code
Generation of Components for Software
Renovation Factories from Context-free
Grammars
Mark van den Brand
Alex Sellink
Chris Verhoef
Report P9705 June
Univers... / syntax and semantics of a programming language can be defined using Sdf br syntax and semantics of programming languages. It is a combination of
63.8 The PEP Tool - Grahlmann (1997)(Correct)
The PEP tool is a Programming Environment based on Petri Nets. Comprehensive
modelling, compilation, simulation and verification components are embedded
in a user-friendly graphical interface. The bas... / an imperative predicative programming language. B PN is called br written in the parallel programming language B PN Even
63.7 Productive Parallel Programming: The PCN Approach - Foster, Olson, Tuecke (1992)(Correct)
We describe the PCN programming system, focusing on those features designed to improve the productivity of scientists and engineers using parallel supercomputers. These features include a simple notat... / is the need to learn a new programming language. Others are uncomfortable br a description of the programming language a discussion of the
63.7 Uniqueness Typing for Functional Languages with Graph Rewriting.. - Barendsen, Smetsers (1996)(Correct)
This paper is an elaborated version of the work presented in Barendsen and Smetsers
(1995a) and Barendsen and Smetsers (1995c).
2. Term graph rewriting unknown aaaaaa
Math. Struct. in Comp. Science (... / systems in functional programming languages. Uniqueness typing extends br main reasons why functional programming languages are often praised. As a
63.7 Polytypic Pattern Matching - Jeuring (1995)(Correct)
The (exact) pattern matching problem can be informally
specified as follows: given a pattern and a text, find all
occurrences of the pattern in the text. The pattern and
the text may both be lists, or... / be found in the functional programming language Haskell where it is br and designing a practical programming language in which polytypic
63.7 Cooperative Multi-Robot Box-Pushing - Mataric, Nilsson, Simsarian (1995)(Correct)
This paper describes the problem of task sharing between two autonomous
six--legged robots. The robots are equipped with two-way
communication, object and goal sensing, and a repertoire of basic behav... / a parallel distributed robot programming language based on the Subsumption
63.7 Theorems and Algorithms: An Interface between Isabelle and Maple - Ballarin, Homann, Calmet (1995)(Correct)
Solving sophisticated mathematical problems often requires algebraic algorithms and theorems. However, there are no environments integrating theorem provers and computer algebra systems which consiste... / offer a straightforward programming language with ad-hoc br Mathematical Logic and Programming Languages pp. -