Automated theorem proving: theory and practice
Automated theorem proving: theory and practice
Art of Software Testing
Specifying & Verifying Concurrent Systems Using Z
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
Feature Interaction Detection Using Testing and Model-Checking Experience Report
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Theorem proving for verification
Modeling and verification of parallel processes
Mutation analysis of program test data
Mutation analysis of program test data
Challenging Formal Specifications by Mutation: a CSP security example
APSEC '03 Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
Is mutation an appropriate tool for testing experiments?
Proceedings of the 27th international conference on Software engineering
An extended fault class hierarchy for specification-based testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
The Why/Krakatoa/Caduceus platform for deductive program verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
| Hi-index | 0.00 |
In the context of deductive proof, formal specification (and thus proofs) may only cover a small part of the program behaviours. We discuss the relevance of applying a mutation analysis, proposed to evaluate the quality of a test set, to evaluate if a specification is able to detect predefined types of faults.