Symbolic test case generation for primitive recursive functions

Authors:
Achim D. Brucker;Burkhart Wolff
Affiliations:
Information Security, ETH Zürich, ETH Zentrum, Zürich, Switzerland;Information Security, ETH Zürich, ETH Zentrum, Zürich, Switzerland
Venue:
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Year:
2004

Citing 11
Cited 15

Software unit test coverage and adequacy

ACM Computing Surveys (CSUR)
QuickCheck: a lightweight tool for random testing of Haskell programs

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Towards the animation of proofs---testing proofs by examples

Theoretical Computer Science - Special issue on theories of types and proofs
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Proposal for a Formal OCL Semantics in Isabelle/HOL

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Testing Can Be Formal, Too

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
AutoFocus: A Tool for Distributed Systems Specification

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Automating the Generation and Sequencing of Test Cases from Model-Based Specifications

FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Test input generation with java PathFinder

ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Structured programming

Structured programming
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Parameterized unit tests with unit meister

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Parameterized unit tests

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
The Role of Model-Based Testing

Verified Software: Theories, Tools, Experiments
Model-Based Firewall Conformance Testing

TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Verifying Test-Hypotheses

Electronic Notes in Theoretical Computer Science (ENTCS)
hol-TestGen

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Test-sequence generation with Hol-TestGen with an application to firewall testing

TAP'07 Proceedings of the 1st international conference on Tests and proofs
Testing data types implementations from algebraic specifications

Formal methods and testing
Proof-Guided Test Selection from First-Order Specifications with Equality

Journal of Automated Reasoning
Unifying theories in Isabelle/HOL

UTP'10 Proceedings of the Third international conference on Unifying theories of programming
An approach to modular and testable security models of real-world health-care applications

Proceedings of the 16th ACM symposium on Access control models and technologies
Automated specification analysis using an interactive theorem prover

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Interactive testing with HOL-TestGen

FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
A symbolic framework for model-based testing

FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
A Tool for Testing Data Type Implementations from Maude Algebraic Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for the automatic generation of test cases for HOL formulae containing primitive recursive predicates. These test cases can be used for the animation of specifications as well as for black-box testing of external programs. Our method is two-staged: first, the original formula is partitioned into test cases by transformation into a Horn-clause normal form (HCNF). Second, the test cases are analyzed for instances with constant terms satisfying the premises of the clauses. Particular emphasis is put on the control of test hypotheses and test hierarchies to avoid intractability. We applied our method to several examples, including AVL-trees and the red-black tree implementation in the standard library from SML/NJ.