Verifying Probabilistic Programs Using a Hoare Like Logic.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 315, doi. 10.1142/S012905410200114X
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2002 AND VI 13 AND IP 3
Results: 8
1
2
An Expressive Extension of TLC.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 341, doi. 10.1142/S0129054102001151
- By:
- Publication type:
- Article
3
An Extension of an Automated Termination Method of Recursive Functions.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 361, doi. 10.1142/S0129054102001163
- By:
- Publication type:
- Article
4
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 387, doi. 10.1142/S0129054102001175
- By:
- Publication type:
- Article
5
Gate Resizing to Reduce Power Consumption.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 405, doi. 10.1142/S0129054102001187
- By:
- Publication type:
- Article
6
The Fastest and Shortest Algorithm for all Well-Defined Problems.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 431, doi. 10.1142/S0129054102001199
- By:
- Publication type:
- Article
7
Sizes of Ordered Decision Trees.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 445, doi. 10.1142/S0129054102001205
- By:
- Publication type:
- Article
8
A Note on Synchronized Automata and Road Coloring Problem.
- Published in:
- International Journal of Foundations of Computer Science, 2002, v. 13, n. 3, p. 459, doi. 10.1142/S0129054102001217
- By:
- Publication type:
- Article