Free Access
RAIRO. Inform. théor.
Volume 17, Number 1, 1983
Page(s) 55 - 70
Published online 01 February 2017
  1. 1. V. AMBRIOLA and G. LEVI, The equational language TEL: formal semantics and implementation, IEI Internal Report (in preparation). [Google Scholar]
  2. 2. P. ASIRELLI, P. DEGANO, G. LEVI, A. MARTELLI, U. MONTANARI, G. PACINI, F. SIROVICH and F. TURINI, A flexible environment for program development based on a symbolic interpreter, Proc. 4th Int'1 Conf. on Software Engineering, 1979, p. 251-263. [Google Scholar]
  3. 3. R. S. BOYER, B. ELSPAS and K. N. LEVITT, SELECT. A formal system for testing and debugging programs by symbolic execution. Proc. Int'1 Conf. on Reliable Software, 1975, p. 234-245. [Google Scholar]
  4. 4. R. S. BOYER and J. S. MOORE, Proving theorems about LISP functions, J. ACM 22, 1975, p. 129-144. [MR: 495081] [Zbl: 0338.68014] [Google Scholar]
  5. 5. R. S. BOYER and J. S. MOORE, A lemma driven automatic theorem prover for recursive function theory, Proc. 5th Int'1 Joint Conf. on Artificial Intelligence, 1977, p. 511-519. [Google Scholar]
  6. 6. R. M. BURSTALL, Program proof, program transformation, program synthesis for recursive programs. Rivista di Informatica, vol. 7, Suppl. 1, 1977, p. 25-43. [Google Scholar]
  7. 7. R. M. BURSTALL and J. DARLINGTON, A transformation system for developing recursive programs. J. ACM 24, 1977, p. 44-67. [MR: 451816] [Zbl: 0343.68014] [Google Scholar]
  8. 8. L. P. DEUTSCH, An interactive program verifier - Ph. D. - dissertation, Dept. of Comp. Sci., Univ. of California, Berkeley (May 1973). [Google Scholar]
  9. 9. J. A. GOGUEN, Abstract errors for abstract data types. Formal Description of Programming Concepts, E. J. Neuhold Ed., North-Holland, 1978, p. 491-522. [MR: 537918] [Zbl: 0373.68024] [Google Scholar]
  10. 10. J. C. KING, A new approach to program testing. Proc. Int'l Conf. on Reliable Software, 1975, p. 228-233. [Google Scholar]
  11. 11. J. C. KING, Symbolic execution and program testing. Comm. ACM 19, 1976, p. 385-395. [MR: 418502] [Zbl: 0329.68018] [Google Scholar]
  12. 12. G. LEVI and F. SIROVICH, Proving program properties, symbolic evaluation and logical procedural semantics. Mathematical Foundations of Computer Science 1975. Lecture Notes in Computer Science, Springer Verlag, 1975, p. 294-301. [MR: 391560] [Zbl: 0325.68008] [Google Scholar]
  13. 13. R. L. LONDON and D. R. MUSSER, The application of a symbolic mathematical System to program verification, Proc. ACM Annual Conf., 1974, p. 265-273. [Google Scholar]
  14. 14. J. A. MORRIS and B. WEGBREIT, Subgoal induction, Comm. ACM 20, 1977, p. 209-222. [MR: 445889] [Zbl: 0349.68007] [Google Scholar]
  15. 15. M. NIVAT, On the interpretation of recursive polyadic program schemes, Symposia Mathematica, vol. 15, 1975, p. 255-281. [MR: 391563] [Zbl: 0346.68041] [Google Scholar]
  16. 16. A. M. PEGNA, Una caratterizzazione della semantica dei linguaggi programmativi basata sulla valuatazione simbolica, Proc. AICA, 77, 3 1977, p. 93-99. [Google Scholar]
  17. 17. R. W. TOPOR, Interactive program verification using virtual programs, Ph. D. dissertation, Dept. of Artificial Intelligence, Univ. of Edinburgh (February, 1975). [Google Scholar]
  18. 18. M. H. VAN EMDEN and R. A. KOWALSKI, The semantics of predicate logic as a programming language, J. ACM 23, 1976, p. 733-742. [MR: 455509] [Zbl: 0339.68004] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.