On proving syntactic properties of CPS programs
✍ Scribed by Olivier Danvy; Belmina Dzafic; Frank Pfennin
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 699 KB
- Volume
- 26
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The CP-PACS is a massively parallel MIMD computer with the theoretical peak speed of 614 GFLOPS which has been developed for computational physics applications at the University of Tsukuba, Japan. We report on the performance of the CP-PACS computer measured during recent production runs using our q
## Abstract As‐polymerized poly(L‐lactide) test rods were sterilized by seven different specially designed computer‐operated autoclaving programs. As a control, common hospital sterilization was performed. In all cases, the molecular weight decreased after sterilization. A short time high‐temperatu
Quantified Discrete-time Duration Calculus, (QDDC), is a form of interval temporal logic [14]. It is well suited to specify quantitative timing properties of synchronous systems. An automata theoretic decision procedure for QDDC allows converting a QDDC formula into a finite state automaton recognis