Вы здесь

Главная

ACM Trans. Programming Languages and Systems

Связанные издания:

A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem
A Calculus for Access Control in Distributed Systems
A Compiler Approach to Scalable Concurrent-Program Design
Adding Fair Choice to Dijkstra s Calculus
A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables
A Formal Definition of Priority in CSP
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables
A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs
A Linear-Time Scheme for Version Reconstruction
A Methodology for Implementing Highly Concurrent Data Objects
A Model Parametric Real-Time Logic
An Adaptive Tenuring Policy for Generation Scavengers
An Alternative Solution to a Problem on Self-Stabilization
Analysis of Or-Parallel Execution Models
An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement
An Object-Based Programming Model for Shared Data
A Self-Applicable Partial Evaluator for the Lambda Calculus: Correctness and Pragmatics
A Stepwise Refinement Heuristic for Protocol Construction
A Superimposition Control Construct for Distributed Systems
Automatic Generation and Use of Abstract Structure Operators
Avoidance and Suppression of Compensation Code in a Trace Scheduling Compiler
Cache Behavior of Combinator Graph Reduction
Cliche-Based Program Editors
Compilling Nested Data-Parallel Programs for Shared-Memory Multiprocessors
Compositional Specification and Verification of Distributed Systems
Computer-Assisted Microanalysis of Parallel Programs
Controlled Grammatic Ambiguity
Coordinating First-Order Multiparty Interactions
Cost Analysis of Logic Programs
Debugging Optimized Code without Being Misled
Defining Context-Dependent Syntax Without Using Contexts
Denotational Abstract Interpretation of Logic Programs
Denotational Semantics of a Goal-Directed Language
Determinacy Testing for Nondeterminate Logic Programming Languages
Efficient Computation of Interprocedural Definition-Use Chains
Efficiently Computing Static Single Assignment Form and the Control Dependence Graph
Efficient Register Allocation via Coloring Using Clique Separators
Epochs
Experience with a Software-Defined Machine Architecture
Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG
How to Securely Replicate Services
Improvements to Graph Coloring Register Allocation
Incremental Generation of Lexical Scanners
Incremental Global Reoptimization of Programs
Interprocedural Optimization: Eliminating Unnecessary Recompilation
Lazy and Incremental Program Generation
Lazy Caching
Leader Election in Uniform Rings
Live-Structure Dataflow Analysis for Prolog
Mathematical Foundations for Time Warp Systems