The following pages link to Science of Computer Programming (Q169675):
Displaying 50 items.
- An assertional correctness proof of a distributed algorithm (Q1051413) (← links)
- Justification of the structural synthesis of programs (Q1051416) (← links)
- Exceptions and interrupts in CSP (Q1051417) (← links)
- Using branching time temporal logic to synthesize synchronization skeletons (Q1051419) (← links)
- Decomposition of distributed programs into communication-closed layers (Q1051420) (← links)
- A note on a standard strategy for developing loop invariants and loops (Q1052815) (← links)
- Extended naming conventions for communicating processes (Q1052819) (← links)
- Small programming exercises 2 (Q1054458) (← links)
- A structured approach to static semantics correctness (Q1054459) (← links)
- A case study of number-theoretic computation: Searching for primes in arithmetic progression (Q1055463) (← links)
- Small programming exercises (Q1056533) (← links)
- An alternative for the implementation of Kruskal's minimal spanning tree algorithm (Q1056544) (← links)
- A method and a language for constructing iterative programs (Q1057051) (← links)
- Small programming exercises 6 (Q1057052) (← links)
- Small programming exercises 7 (Q1057053) (← links)
- Showing programs on a screen (Q1057058) (← links)
- Increasing modularity and language-independency in automatically generated compilers (Q1058844) (← links)
- Small programming exercises 8 (Q1060000) (← links)
- Automatic construction of CSP programs from sequential non-deterministic programs (Q1060002) (← links)
- Distributed mutual exclusion on a ring of processes (Q1060005) (← links)
- Verifying the unification algorithm in LCF (Q1060023) (← links)
- The crippled Queen placement problem (Q1060835) (← links)
- Small programming exercises 9 (Q1064044) (← links)
- Two most nondeterministic programs (Q1064048) (← links)
- Script: A communication abstraction mechanism and its verification (Q1064053) (← links)
- Description and improvement of iterative program transformations (Q1065540) (← links)
- Derivation of a distributed algorithm for finding paths in directed networks (Q1066673) (← links)
- Report on the Larch shared language (Q1067767) (← links)
- A Larch shared language handbook (Q1067768) (← links)
- Transformational programming and the paragraph problem (Q1067769) (← links)
- Small programming exercises 10 (Q1067770) (← links)
- Model of error propagation in systems of communicating processes (Q1067778) (← links)
- Small programming exercises 11 (Q1070812) (← links)
- A new type-checker for a functional language (Q1070814) (← links)
- Message-based functional operating systems (Q1070816) (← links)
- Program derivation through transformations: The evolution of list-copying algorithms (Q1070817) (← links)
- Analyzing a class of distributive partitioning sort algorithms (Q1075762) (← links)
- A derivation of distributed implementation of Warshall's algorithm (Q1075774) (← links)
- CIGALE: A tool for interactive grammar construction and expression parsing (Q1075778) (← links)
- Small programming exercises 12 (Q1077151) (← links)
- State machines and assertions: An integrated approach to modeling and verification of distributed systems (Q1077153) (← links)
- Algebraic implementations preserve program correctness (Q1079358) (← links)
- Small programming exercises 13 (Q1080646) (← links)
- Transformational program development in a particular problem domain (Q1081295) (← links)
- Functional programming with side-effects (Q1082790) (← links)
- Compiling and optimizing methods for the functional language ASL/F (Q1082794) (← links)
- Small programming exercises 14 (Q1082799) (← links)
- Strictness analysis for higher-order functions (Q1082802) (← links)
- Top-down design and the algebra of communicating processes (Q1084850) (← links)
- Small programming exercises 15 (Q1085966) (← links)