Application of PROLOG to test sets generation from algebraic specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 186 LNCS, Issue , 1985, Pages 261-275

  Bouge L ^a   Choquet, N ^b   Fribourg, L ^b   Gaudel, M C ^c  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b route de Nozay ^*  (France)

^c Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; PATTERN MATCHING; SOFTWARE DESIGN; SOFTWARE ENGINEERING; SPECIFICATIONS;

ALGEBRAIC DATA-TYPES; ALGEBRAIC SPECIFICATIONS; BASIC CONCEPTS; FORMAL DEFINITION; FUNCTIONAL TESTING; TEST SETS;

FORMAL METHODS;

EID: 84910809974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15199-0_17     Document Type: Conference Paper

References (31)

1. W.R. Adrion, M.A. Branstad and J.C. Cherniavsky, “Validation, verification and testing of computer software”, ACM Comp. Sarv. 14, 2 (June 1982).
2. M. Bidait, “Putting together fair presentations of abstract data types into structured specifications”, Rept. No. 15/81, GRECO, France (1981).
3. L Bougé, “Modélisation de la notion de test de programme; application à la production de jeux de tests”, Thèse de 3ème cycle, Université Paris 6, Paris (Oct. 1982).
4. L. Bougé, “A proposition for a theory of testing: an abstract approach to the testing process”, Rept. No. PB-160, DAIMI, Aarhus University, Denmark (may 1983), to appear in Theor. Comp, Science.
5. T.A. Budd “Mutation analysis: ideas, examples, problems and prospects”, in: Computer Program Testing, B. Chandrasekran and S. Radicchi, eds. (North-Holland, 1981) 129-148.
6. T.A. Budd and D. Angluin, “Two notions of correctness and their relation to testing”, Acta Informatica 18 (1982) 31-45.
7. T.A. Budd, R.A. De Mitto, R.J. Lipton and F.G. Sayward, “Theoretical and empirical studies on using program mutation to test the functional correctness of programs”, Proc. 7th Ann. ACM Symp. Princ. Prog. Lang., Las Vegas (Jan. 1980) 220-233.
8. B. Biebow and J. Hagelstein, “Algebraic specification of synchronization and errors: a telephonic example”, Proc. Coll. Soft. Eng., Berlin (1985), this volume.
9. M. Bidoit, B. Biebow, M.C. Gaudel, D. Gresse and G. Guiho, “Exception handling: formal specification and systematic program construction”, Prec. Int. Conf. Soft. Eng., Orlando, Florida (1984).
10. K.L. Clark, “Predicate logic as a computational formalism”, Research Rept., Dept of Computing, imperial College, London (1977).
11. L Clarke, “A system to generate test data and symbollicaly execute programs”, IEEE Trans. Soft. Eng. SE-2, 8 (1978) 215-222.
12. N. Dershowitz and N.A. Josephson, “Logic programming by completion”, Proc. 2nd Int. Logic Programming Conf, Uppsala, Sweden (July 1984) 313-320.
13. M. Dincbas and LP. Le Pape, “Metacontrol in logic programs in METALOG”, 5th Generation Conf., Tokyo, Japan (Nov. 1984).
14. L. Fribourg, “Oriented equational clauses as a programming language”, J. Logic Programming, 2 (Oct. 1984) 165-177.
15. J.S. Gourlay, “A mathematical framework for the investigation of testing”, IEEE trans. Soft. Eng. SE-9, 6 (1983).
16. J.B. Goodenough and S.L. Gerhart, “Toward a theory of test data selection”, IEEE Trans, Soft. Eng. SE-1, 2 (1975).
17. J. Guttag and J. Horning, “The algebraic specification of abstract data types”, Acta infarmatica 10, 1(1978).
18. J. Goguen and J. Meseguer, “Equality, types, modules and generics for logic programming”, Proc. 2nd Int.logic Programming Conf., Uppsala, Sweden (July 1984) 115-125.
19. R.G. Hamlet, “Testing programs with finite sets of data”, Rept. No. TR-388, U. of Maryland, College Park (August 1975).
20. W.E. Howden, “Reliability of path analysis strategies”, IEEE Trans. Soft. Eng. SE-2, 8 (1976) 208-214.
21. W.E. Howden, “Functional program testing”, IEEE Trans. Soft. Eng, SE-6, 2 (1980) 162-169.
22. W.E. Howden, “Weak mutation testing and completeness of test sets”, IEEE Trans. Soft. Eng. SE-8, 4 (1982) 371-379.
23. J. Hsiang and M. Srivas, “A Prolog environment for developing and reasoning about data types”, Proc. Coll. Soft. Eng., Berlin (1985), this volume.
24. H.J. Komorowski, “Qlog - The software for prolng and logic programming”, Proc. of the Logic Programming Workshop, Debrecen, Hungary (1980) 305-320.
25. L. Naish, “An introduction to MU-PROLOG”, Technical Rept, Dept. of Computer Science, U. of Melbourne (1982).
26. J. Paul, “Approche pour une certification fonctiormelle de systémes & partir de specifications externs”, Internal rept., CqT, Latin/on, France (1983).
27. D. Sanella and M. Wirsinng, “A kernel language for algebraic specification and implementation”, Proc. Int. Conf. Foundations Computing Theory, Bergholm, Sweden (Aug. 1983).
28. L.J. White, E.J. Cohen, “A domain strategy for computer program testing”, IEEE Traus. Soft. Eng. SE-6, 3 (1980) 247-257.
29. M.R. Woodward, D. Hedley and M.A. Hennel, “Experience with path analysis and testing of programs”, IEEE Trans. Soft. Eng. SE-6, 3 (1980) 278-285.
30. M. Wirsing, P. Pepper, H. Partsch, W. Dusch and M. Broy, “On hierarchies of abstract data types”, Acta Information 20, 1 (Oct. 1983).
31. S.H. Zeil, L.J. White, “Sufficient test sets for path analysis testing strategy”, Proc. 5th Int. Conf. Soft. Eng., San Diego, Calif. (March 1981) 184-191.