The following pages link to Software: Practice and Experience (Q111603):
Displaying 50 items.
- A new algorithm for encoding and decoding the Hilbert order (Q111607) (← links)
- fsh—A functional unix command interpreter (Q3026310) (← links)
- A direct access technique for sequential files with variable length records (Q3026325) (← links)
- Object-oriented data management based on abstract data types (Q3026328) (← links)
- Synthesizing implementations of abstract data types from axiomatic specifications (Q3026329) (← links)
- Concurrent communication and synchronization mechanisms (Q3040493) (← links)
- PEP: An interactive programming system with an Algol-like programming language (Q3040506) (← links)
- Should if… then… else… follow the dodo? (Q3048195) (← links)
- Implementing strings in Pascal (Q3048197) (← links)
- Synchronization under a commercial operating system (Q3048214) (← links)
- A poor man's realization of attribute grammars (Q3048219) (← links)
- Using convert to transform source code (Q3048227) (← links)
- Unisex: A unix-based symbolic executor for pascal (Q3221390) (← links)
- A semantically-based formatting discipline for Pascal (Q3314958) (← links)
- Guarded and unguarded coroutines: An implementation in BCPL (Q3314959) (← links)
- Mixed language programming (Q3314960) (← links)
- Toward complete programming language descriptions that are both formal and understandable (Q3314961) (← links)
- A methodology and notation for compiler front end design (Q3314979) (← links)
- Experience with a portable debugging tool (Q3314984) (← links)
- Concurrent programming in the Ada® language: The polling bias (Q3321429) (← links)
- The ‘Completeness’ of the pascal test suite (Q3321455) (← links)
- Exception handling—A static approach (Q3321456) (← links)
- Integrating library modules into Pascal programs (Q3321458) (← links)
- Automatic generation of make dependencies (Q3321460) (← links)
- Exploiting partial order with Quicksort (Q3323281) (← links)
- Top-down design within a functional environment (Q3330481) (← links)
- An experiment in language design for distributed systems (Q3330492) (← links)
- Concurrent C: A programming language for distributed multiprocessor systems (Q3332236) (← links)
- The use of ghost variables and virtual programming in the documentation and verification of programs (Q3334049) (← links)
- Compile—time detection of aliasing in euclid programs (Q3334050) (← links)
- A general approach to queuing in C.S.P (Q3334059) (← links)
- Separating policy from correctness in concurrency control design (Q3334061) (← links)
- Resource monitors: A design methodology for operating systems (Q3334065) (← links)
- Transducers are type-converters (Q3334066) (← links)
- Applying Mccabe's complexity measure to multiple-exit programs (Q3334078) (← links)
- Program development by inductive stepwise refinement (Q3339257) (← links)
- Forced termination of loops (Q3339258) (← links)
- A simple equation solver and its application to financial modelling (Q3339284) (← links)
- Implementation of a Pascal based parallel language for a multiprocessor computer (Q3345758) (← links)
- Adam: An Ada-based language for multiprocessing (Q3345761) (← links)
- A standard Pascal event simulation package (Q3345767) (← links)
- Using Ada for discrete event simulation (Q3345768) (← links)
- PL/I as a discrete event simulation tool (Q3345769) (← links)
- Performance analysis of partial-match search algorithms for BD trees (Q3493342) (← links)
- Optimizing procedure calls and returns (Q3659108) (← links)
- On the design of a special-purpose scientific programming language (Q3659112) (← links)
- The influence of hardware and software considerations on the design of synchronous parallel algorithms (Q3659118) (← links)
- The little META translator writing system (Q3659119) (← links)
- Introduction to enhanced C (EC) (Q3660872) (← links)
- Higher level programming and data abstractions—a case study using enhanced C (Q3660873) (← links)
