Test sets generation from algebraic specifications using logic programming

Bougé, Luc; Choquet, N; Fribourg, Laurent; Gaudel, Marie-Claude

doi:10.1016/0164-1212(86)90004-x

Cited by 77 publications

(50 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bougé et al [12] suggested a logic programming approach to generating test cases from algebraic specifications. Tsai, Volovik, and Keefe [53] used a similar approach, but started with relational algebra queries.…”

Section: Algebraic Approachesmentioning

confidence: 99%

“…The current research literature reports on specific tools for specific formal specification languages [9,12,27,34,47,53,55], manual methods for deriving tests from specifications [2,3,8,22,28], case studies on using specifications to check the output of the software on specifications [23,36,39,50], and formalizations of test specifications [7,16,52,51]. The term specification-based testing is used in the narrow sense of using specifications as a basis for deciding what tests to run on software.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Generating test data from state‐based specifications

Offutt

Liu

Abdurazik

et al. 2003

Software Testing Verif & Rel

270

159

View full text Add to dashboard Cite

show abstract

Section: Algebraic Approachesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Generating test data from state‐based specifications

Offutt

Liu

Abdurazik

et al. 2003

Software Testing Verif & Rel

270

159

View full text Add to dashboard Cite

show abstract

“…Formal specifications have been widely explored as a starting point for software testing; the works reported in [8,11,3,4,2,14] give a few examples. In our own previous work [5], we have instantiated Gaudel's long-standing theory of formal testing [12] to CSP [19].…”

Section: Introductionmentioning

confidence: 99%

A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming

Cavalcanti

Gaudel

2010

Unifying Theories of Programming

View full text Add to dashboard Cite

Abstract. There is a close relation between the failures-divergences and the UTP models of CSP, but they are not equivalent. For example, miracles are not available in the failures-divergences model; the UTP theory is richer and can be used to give semantics to data-rich process algebras like Circus. Previously, we have defined functions that calculate the failuresdivergences model of a CSP process characterised by a UTP relation. In this note, we use these functions to calculate the UTP characterisations of traces refinement and of the conf relation that is widely used in testing. In addition, we prove that the combination of traces refinement and conf corresponds to refinement of processes in Circus. This result is the basis for a formal testing technique based on Circus; as usual in testing, we restrict ourselves to divergence-free processes.

show abstract

“…This paper is a survey of a research activity which has been led for several years in the area of program testing [5,6,7], and a presentation of some recent results [2,3,22].…”

Section: Introductionmentioning

confidence: 99%

Testing can be formal, too

Gaudel

1995

TAPSOFT '95: Theory and Practice of Software Development

200

147

View full text Add to dashboard Cite

Abstract. The paper presents a theory of program testing based on formal specifications. The formal semantics of the specifications is the basis for a notion of an exhaustive test set. Under some minimal hypotheses on the program under test, the success of this test set is equivalent to the satisfaction of the specification. The selection of a finite subset of the exhaustive test set can be seen as the introduction of more hypotheses on the program, called selection hypotheses. Several examples of commonly used selection hypotheses are presented. Another problem is the observability of the results of a program with respect to its specification : contrary to some common belief, the use of a formal specification is not always sufficient to decide whether a test execution is a success. As soon as the specification deals with more abstract entities than the program, program results may appear in a form which is not obviously equivalent to the specificied results. A solution to this problem is proposed in the case of algebraic specifications.

show abstract

Test sets generation from algebraic specifications using logic programming

Cited by 77 publications

References 16 publications

Generating test data from state‐based specifications

Generating test data from state‐based specifications

A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming

Testing can be formal, too

Contact Info

Product

Resources

About