Category:Journal ACM Transactions on Programming Languages and Systems

From BibNetWiki

Papers published in the Journal "ACM Transactions on Programming Languages and Systems"

(previous 200) (next 200)

Articles in category "Journal ACM Transactions on Programming Languages and Systems"

There are 200 articles in this category.

' ''Maximal-Munch'' Tokenization in Linear Time 'C and tcc: A Language and Compiler for Dynamic Code Generation A A Behavioral Notion of Subtyping A Bounded First-In, First-Enabled Solution to the ell-Exclusion Problem A Calculus for Access Control in Distributed Systems A Comparative Evaluation of Object Definition Techniques for Large Prototype Systems A Compiler Approach to Scalable Concurrent-Program Design A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism A Correctness Proof for Combinator Reduction with Cycles A Data-Driven Model for a Subset of Logic Programming A Denotational Semantics for Prolog A Distributed Alternative to Finite-State-Machine Specifications A Distributed Deadlock Detection Algorithm for CSP-Like Communication A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables A Formal Approach to Undo Operations in Programming Languages A Formal Definition of Priority in CSP A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables A Further Note on Hennessy's ''Symbolic Debugging of Optimized Code'' A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs A Generalization of Dijkstra's Calculus A Generalized Iterative Construct and Its Semantics A Generalized Theory of Bit Vector Data Flow Analysis A Global Communication Optimization Technique Based on Data-Flow Analysis and Linear Algebra A Linear-Time Scheme for Version Reconstruction A Logical Model for Relational Abstract Domains A Mathematical Approach to Nodeterminism in Data Types A Mathematical Approach to Nondeterminism in Data Types A Mechanism for Environment Integration A Methodology for Implementing Highly Concurrent Data Objects A Methodology for Synthesis of Recursive Functional Programs A Model Parametric Real-Time Logic A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms A Modular Verifiable Exception Handling Mechanism A Natural Semantics for Eiffel Dynamic Binding A New Analysis of LALR Formalisms A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphs A New, Simpler Linear-Time Dominators Algorithm A Note on ''On the Conversion of Indirect to Direct Recursion'' A Note on Cohen's ''Eliminating Redundant Recursive Calls'' A Note on Hennessy's ''Symbolic Debugging of Optimized Code'' A Partially Deadlock-Free Typed Process Calculus A Polymorphic Record Calculus and Its Compilation A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis A Practical Method for LR and LL Syntactic Error Diagnosis and Recovery A Reexamination of ''Optimization of Array Subscript Range Checks'' A Refinement Calculus for the Synthesis of Verified Hardware Descriptions in VHDL A Reflection on Call-by-Value A Region Inference Algorithm A Self-Applicable Partial Evaluator for the Lambda Calculus: Correctness and Pragmatics A Short Proof of a Conjecture of De Remer and Pennello A Simple Interprocedural Register Allocation Algorithm and Its Effectiveness for LISP A Solution to a Problem with Morel and Renvoise's ''Global Optimization by Suppression of Partial Redundancies'' A Stepwise Refinement Heuristic for Protocol Construction A Structural View of the Cedar Programming Environment A Study of the Applicability of Existing Exception-Handling Techniques to Component-Base Real-Time Software Technology A Superimposition Control Construct for Distributed Systems A Systematic Study of Functional Language Implementations A Task- and Data-Parallel Programming Language Based on Shared Objects A Unified Model of Pointwise Equivalence of Procedural Computations A Worst Case of Circularity Test Algorithms for Attribute Grammars ACE: An Automatic Complexity Evaluator Abstract Interaction Tools: A Language for User Interface Management Systems Abstract Interpretation of Reactive Systems Abstract Types Have Existential Type Adding Fair Choice to Dijkstra's Calculus Adding Liveness Properties to Coupled Finite-State Machines

A cont. Affix Grammar Driven Code Generation Algorithmic Specifications: A Constructive Specification Method for Abstract Data Types Alma-O: An Imperative Language that Supports Declarative Programming An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs An Ad Hoc Approach to the Implementation of Polymorphism An Ada Package for Dimensional Analysis An Adaptive Tenuring Policy for Generation Scavengers An Alternative Solution to a Problem on Self-Stabilization An Approach for Exploring Code Improving Transformations An Approach to Support Automatic Generation of User Interfaces An Axiomatic Treatment of Exception Handling in an Expression-Oriented Language An Editor for Revision Control An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement An Evaluation of an Automatically Generated Compiler An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection An Exercise in the Formal Derivation of Parallel Programs: Maximum Flows in Graphs An Improved Context-Free Recognizer An Improved Storage Management Scheme for Block Structured Languages An Incremental Algorithm for Satisfying Hierarchies of Multiway Dataflow Constraints An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis An Object-Based Programming Model for Shared Data An Old-Fashioned Recipe for Real Time An Overview of the SR Language and Implementation Analysis of Functional Programs to Detect Run-Time Garbage Cells Analysis of Or-Parallel Execution Models Applicative Caching Assessing test data adequacy through program inference Automatic Data Layout for Distributed-Memory Machines Automatic Generation and Use of Abstract Structure Operators Automatic Isolation of Compiler Errors Automatic Transformation of Series Expressions Into Loops Automatic Translation of FORTRAN Programs to Vector Form Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications Avoidance and Suppression of Compensation Code in a Trace Scheduling Compiler Axiomatic Bootstrapping: A Guide for Compiler Hackers Axioms for Memory Access in Asynchronous Hardware Systems B BURS Automata Generation Backtracking without Trailing in CLP(Re Lin) Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form C CIRCAL and the Representation of Communication, Concurrency, and Time Cache Behavior of Combinator Graph Reduction Cache Miss Equations: A Compiler Framework for Analyzing and Tuning Memory Behavior Chaining Span-Dependent Jump Instructions Clich'e-Based Program Editors Closure Analysis in Constraint Form Code Generation Using Tree Matching and Dynamic Programming Code Generation and Storage Allocation for Machines With Span-Dependent Instructions Collecting Interpretations of Expressions Combinatory Formulations of Concurrent Languages Combining Analyses, Combining Optimizations Comments on Georgeff's ''Transformations and Reduction Strategies for Typed Lambda Expressions'' Commutativity Analysis: A New Analysis Technique for Parallelizing Compilers Compilation of Functional Languages by Program Transformation Compile-Time Memory Reuse in Logic Programming Languages through Update in Place Compiling Nested Data-Parallel Programs for Shared-Memory Multiprocessors Complementation in Abstract Interpretation Composing First-Class Transactions Composing Specifications Compositional Parallel Programming Languages Compositional Specification and Verification of Distributed Systems Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rules Computer-Assisted Microanalysis of Parallel Programs Concurrency in Heavily Loaded Neighborhood-Constrained Systems Conditional Attribute Grammars Conjoining Specifications Constrained Expressions: Toward Broad Applicability of Analysis Methods for Distributed Software Systems Constrained Types and Their Expressiveness

C cont. Constraint-Based Array Dependence Analysis Constraint-Based Termination Analysis of Logic Programs Control Flow Aspects of Semantics-Directed Compiling Control Predicates Are Better Than Dummy Variables for Reasoning About Program Control Controlled Grammatic Ambiguity Controlling Generalization and Polyvariance in Partial Deduction of Normal Logic Programs Conversion From Data-Driven to Synchronous Execution in Loop Programs Correctness Proofs of Distributed Termination Algorithms Cost Analysis of Logic Programs Cost-Optimal Code Motion Covariance and Contravariance: Conflict without a Cause Creating User Interfaces Using Programming by Example, Visual Programming, and Constraints D DIB-a Distributed Implementation of Backtracking Data Descriptors: A Compile-Time Model of Data and Addressing Data Flow Analysis of Communicating Finite State Machines Data Types Are Values Dealing with World-Model-Based Programs Debugging Optimized Code without Being Misled Decompilation: The Enumeration of Types and Grammars Deducing Fairness Properties in UNITY Logic-a New Completeness Result Defining Context-Dependent Syntax without Using Contexts Demand-Driven Register Allocation Denotational Semantics of a Goal-Directed Language Dependency Analysis for Standard ML Deriving Target Code as a Representation of Continuation Semantics Describing and Analyzing Distributed Software System Designs Designing Families of Data Types Using Exemplars Detecting Global Variables in Denotational Semantics Detecting Global Variables in Denotational Specifications Determinacy Testing for Nondeterminate Logic Programming Languages Determining the Extent of Lookahead in Syntactic Error Repair Director Strings as Combinators Disjunctive Program Analysis for Algebraic Data Types Distributed Cooperation with Action Systems Distributed FIFO Allocation of Identical Resources Using Small Shared Space Dynamic Currency Determination in Optimized Programs Dynamic Typing for Distributed Programming in Polymorphic Languages Dynamic Typing in a Statically Typed Language Dynamic software updating E ECCS and LIPS: Two Languages for OSI Systems Specification and Verification Effectivness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming Efficient Algorithms for Automatic Construction and Compactification of Parsing Efficient Computation of Interprocedural Definition-Use Chains Efficient Construction of LR(k) States and Tables Efficient Demand-Driven Evaluation. Part 1 Efficient Demand-Driven Evaluation. Part 2 Efficient Evaluation of Circular Attribute Grammars Efficient Fault-Tolerance Algorithms for Distributed Resource Allocation Efficient High-Level Iteration with Accumulators Efficient Implementation of Adaptive Software Efficient Implementation of the First-Fit Strategy for Dynamic Storage Allocation Efficient Incremental LR Parsing for Syntax-Directed Editors Efficient Instruction Scheduling for Delayed-Load Architectures Efficient Logic Variables for Distributed Computing Efficient Register Allocation Via Coloring Using Clique Separators Efficient Synchronization of Multiprocessors with Shared Memory Efficient and Correct Execution of Parallel Programs that Share Memory Efficient and Flexible Incremental Parsing Efficiently Computing Static Single Assignment Form and the Control Dependence Graph Efficiently Computing phi-Nodes on-the-Fly Efficiently Counting Program Events with Support for on-Line Queries Embedding Continuations in Procedural Objects Epochs Equality-Based Flow Analysis Versus Recursive Types Error Repair in Shift-Reduce Parsers Eta-Expansion Does the Trick Evidence-Based Static Branch Prediction Using Machine Learning

(previous 200) (next 200)