Pages that link to "Item:Q3038608"
From MaRDI portal
The following pages link to ACM Transactions on Programming Languages and Systems (Q3038608):
Displayed 50 items.
- Parallel Generation of Postfix and Tree Forms (Q3038609) (← links)
- Postpass Code Optimization of Pipeline Constraints (Q3038614) (← links)
- Eliminating Redundant Recursive Calls. (Q3040478) (← links)
- A Formal Framework for the Derivation of Machine-Specific Optimizers (Q3040502) (← links)
- A Syntax-Error-Handling Technique and Its Experimental Analysis (Q3042426) (← links)
- Translation of attribute grammars into procedures (Q3217587) (← links)
- Proofs as programs (Q3219093) (← links)
- Transformations and reduction strategies for typed lambda expressions (Q3219096) (← links)
- Encapsulation constructs in systems programming languages (Q3321421) (← links)
- Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic (Q3321430) (← links)
- Communicating Sequential Processes for Centralized and Distributed Operating System Design (Q3321432) (← links)
- The ``Hoare Logic'' of CSP, and All That (Q3321433) (← links)
- Modeling the distributed termination convention of CSP (Q3321434) (← links)
- Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery (Q3321438) (← links)
- Real-Time Synchronization of Interprocess Communications (Q3321439) (← links)
- Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs (Q3321440) (← links)
- Using message passing for distributed programming: proof rules and disciplines (Q3321441) (← links)
- An APL Compiler for a Vector Processor (Q3321447) (← links)
- A Directly Executable Encoding for APL (Q3321449) (← links)
- Algorithms for on-the-fly garbage collection (Q3321450) (← links)
- Jump Minimization in Linear Time (Q3330482) (← links)
- The promotion and accumulation strategies in transformational programming (Q3330483) (← links)
- Magma2: a language oriented toward experiments in control (Q3330489) (← links)
- Axiomatic semantics of communicating sequential processes (Q3330490) (← links)
- Distributed algorithms for finding centers and medians in networks (Q3332262) (← links)
- Some Techniques for Recursion Removal from Recursive Functions (Q3339250) (← links)
- Selective and locally controlled transport of privileges (Q3339280) (← links)
- A new analysis of LALR formalisms (Q3341936) (← links)
- Guardians and Actions: Linguistic Support for Robust, Distributed Programs (Q3657424) (← links)
- Specifying Concurrent Program Modules (Q3664404) (← links)
- Automatic Program Improvement: Variable Usage Transformations (Q3664410) (← links)
- An Effective Implementation for the Generalized Input-Output Construct of CSP (Q3664419) (← links)
- Generation of Compiler Symbol Processing Mechanisms from Specifications (Q3664422) (← links)
- Assessing Test Data Adequacy through Program Inference (Q3666251) (← links)
- Tentative steps toward a development method for interfering programs (Q3666252) (← links)
- Control Flow Aspects of Semantics-Directed Compiling (Q3666264) (← links)
- Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature (Q3666272) (← links)
- Grammar-Based Definition of Metaprogramming Systems (Q3673075) (← links)
- Recursion As an Effective Step in Program Development (Q3673076) (← links)
- The Type Theory of PL/CV3 (Q3673081) (← links)
- Synthesis of Communicating Processes from Temporal Logic Specifications (Q3673090) (← links)
- Efficient demand-driven evaluation. Part 1 (Q3675503) (← links)
- Detecting global variables in denotational specifications (Q3675504) (← links)
- CIRCAL and the representation of communication, concurrency, and time (Q3675511) (← links)
- Optimal parallel generation of a computation tree form (Q3678673) (← links)
- Program abstraction and instantiation (Q3681903) (← links)
- Program transformations in a denotational setting (Q3681904) (← links)
- Data types are values (Q3681907) (← links)
- Procedures as persistent data objects (Q3694662) (← links)
- Side effects and aliasing can have simple axiomatic descriptions (Q3694663) (← links)