The following pages link to Science of Computer Programming (Q169675):
Displaying 50 items.
- An exercise in program synthesis: algorithms for computing the transitive closure of a relation (Q1162146) (← links)
- Circular expressions: elimination of static environments (Q1162353) (← links)
- A calculus of total correctness for communicating processes (Q1164413) (← links)
- Smoothsort, an alternative for sorting in situ (Q1165006) (← links)
- A methodology for programming with concurrency: An informal presentation (Q1167527) (← links)
- A methodology for programming with concurrency: The formalism (Q1167528) (← links)
- Some notes on putting formal specifications to productive use (Q1167530) (← links)
- A technique for recursion removal based on string homomorphisms (Q1168071) (← links)
- Implementing specification freedoms (Q1170876) (← links)
- Finding repeated elements (Q1170891) (← links)
- Synchronous programming with events and relations: The SIGNAL language and its semantics (Q1183545) (← links)
- Automatic autoprojection of recursive equations with global variables and abstract data types (Q1183547) (← links)
- Symbolic execution: A semantic approach (Q1183549) (← links)
- Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers (Q1183550) (← links)
- Automatic autoprojection of higher order recursive equations (Q1183551) (← links)
- On the expressive power of programming languages (Q1183552) (← links)
- Power domain constructions (Q1183553) (← links)
- Resolution and type theory (Q1183555) (← links)
- Algebraic properties of program integration (Q1183556) (← links)
- A type system for implicit scaling (Q1183557) (← links)
- Parallel programming with data structures and higher order functions (Q1190848) (← links)
- Longest segment problems (Q1190849) (← links)
- Heuristics for constructing while loops (Q1190850) (← links)
- Formalizing and implementing Gries' program development method in dynamic logic (Q1190851) (← links)
- Arbiters: An exercise in specifying and decomposing asynchronously communicating components (Q1193741) (← links)
- Minimal state graph generation (Q1193742) (← links)
- Reasoning algebraically about recursion (Q1193743) (← links)
- The smallest upravel (Q1193744) (← links)
- Improving recursive functions by inverting the order of evaluation (Q1193746) (← links)
- Balanced trees with removals: An exercise in rewriting and proof (Q1193748) (← links)
- The Esterel synchronous programming language: Design, semantics, implementation (Q1196296) (← links)
- Correctness of transformations on register transfers (Q1196298) (← links)
- LR-parsing derived (Q1196299) (← links)
- Derivation of concurrent programs: Two examples (Q1199832) (← links)
- Communication relations: A paradigm for parallel program design (Q1199833) (← links)
- A technique for solving a class of quadratic FP equations (Q1199835) (← links)
- Beyond atomic registers: Bounded wait-free implementations of nontrivial objects (Q1208423) (← links)
- A system at the cross-roads of functional and logic programming (Q1208425) (← links)
- A bottom-up polymorphic type inference in logic programming (Q1208426) (← links)
- Modelling Jackson's programming method (Q1261491) (← links)
- Deriving parallel programs from specifications using cost information (Q1261492) (← links)
- Statement inversion and strongest postcondition (Q1261493) (← links)
- On the mathematics of sequential decompositions (Q1261494) (← links)
- An example of sequentialization of a parallel algorithm (Q1262778) (← links)
- Bottom-up tree acceptors (Q1263293) (← links)
- Small programming exercises 23 (Q1263962) (← links)
- Calculational derivation of pointer algorithms from tree operations (Q1283882) (← links)
- Strategies for consistency checking based on unification (Q1283883) (← links)
- Rankers: A classification of synchronization problems (Q1314537) (← links)
- Axiomatizing CCS, nets and processes (Q1314538) (← links)
