Testing refinements of state‐based formal specifications
نویسندگان
چکیده
منابع مشابه
Automatic Testing from Formal Specifications
In this article, we consider model oriented formal specification languages. We generate test cases by performing symbolic execution over a model, and from the test cases obtain a Java program. This Java program acts as a test driver and when it is run in conjunction with the implementation then testing is performed in an automatic manner. Our approach makes the testing cycle fully automatic. Th...
متن کاملChecking Formal Specifications by Testing
Formal specification methods hold promise for bridging the wide gap between an intuitive idea for solving a problem by computer, and the executable program that attempts to do the job. The use of formalism is itself a good thing, allowing professionals to understand and analyze their work better. However, formal methods are an aid to human effort, not a panacea. Conventional software testing ca...
متن کاملTesting Against Formal Specifications: A Theoretical View
Assuming that a formal specification is available, one can formally study the validation of a software with respect to its specification. While proof theories are widely investigated, testing theories have not been extensively studied. The idea of deriving test data sets from a specification can be found in [Rig 85], [Sou 88], but there are few other published works. The work reported in this p...
متن کاملTesting from Formal Specifications, a Generic Approach
Deriving test cases from specifications is now recognised as a major application of formal methods to software development. Several methods have been proposed for various formalisms: behavioural descriptions such as transition systems, model-based specifications, algebraic specifications, etc. This article presents a general framework for test data selection from formal specifications. A notion...
متن کاملQuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem proving. The main challenge QuickSpec faces is to keep the number of generated equations to a minimum while maintaining completeness. We demonstrate how QuickSpec can improve one’s understanding of a program module by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Testing, Verification and Reliability
سال: 1999
ISSN: 0960-0833,1099-1689
DOI: 10.1002/(sici)1099-1689(199903)9:1<27::aid-stvr172>3.3.co;2-2