References
- King , J. C. 1971 . Proving programs to be correct . IEEE Trans. on Computers , C-20 ( 11 ) November : 1331 – 1336 .
- Harrison , M. A. 1965 . Introduction to Switching and Automata Theory , 316 – 327 . New York : McGraw-Hill .
- Sloane , N. J. A . 1972 . On finding the paths through a network . Bell System Technical Journal , 51 ( 2 ) February : 371 – 390 .
- Lunts , A. G. 1965 . A method of analysis of finite automata . Soviet Physics-Doklady , 10 ( 2 ) February
- Nelson , R. J. 1968 . Introduction to Automata , 42 – 50 . New York : Wiley .
- Huang , J. C. 1975 . An approach to program testing . ACM Computing Surveys , 7 ( 3 ) September
- Berge , C. 1962 . Theory of Graphs and its Applications , New York : Wiley .
- Harary , F. 1969 . Graph Theory , Reading, Mass : Addison-Wesley .
- Dahl , O.-J. , Dijkstra , E. W. and Hoare , C. A. R . 1972 . Structured Programming , 23 – 24 . London : Academic Press .
- Ashcroft E. Manna Z. The translation of ‘GO TO’ programs to ‘WHILE’programs Proc. 1971IFIP Cong North Holland Pub Amsterdam 1972
- Manna , Z. 1969 . Properties of programs and the first-order predicate calculus . J. of ACM , 16 ( 2 ) April : 244 – 255 .