Learning regular sets from queries and counterexamples
Information and Computation
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inference of finite automata using homing sequences
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
On the learnability of infinitary regular sets
Information and Computation
Testing finite state machines: fault detection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Art of Software Testing
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A holistic approach to test-driven model checking
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Automatic symbolic compositional verification by learning assumptions
Formal Methods in System Design
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Integrating model verification and self-adaptation
Proceedings of the IEEE/ACM international conference on Automated software engineering
Automatic discovery of unspecified behaviors in automotive control software
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Representing, learning and extracting temporal knowledge from neural networks: a case study
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Learning to adapt requirements specifications of evolving systems (NIER track)
Proceedings of the 33rd International Conference on Software Engineering
AutoBlackTest: a tool for automatic black-box testing
Proceedings of the 33rd International Conference on Software Engineering
Iterative refinement of specification for component based embedded systems
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Checking models, proving programs, and testing systems
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Automatic verification and conformance testing for validating safety properties of reactive systems
FM'05 Proceedings of the 2005 international conference on Formal Methods
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Black box checking for biochemical networks
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Conformance testing of boolean programs with multiple faults
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
LearnLib tutorial: from finite automata to register interface programs
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Hi-index | 0.00 |
Two main approaches are used for increasing the quality of systems: in model checking , one checks properties of a known design of a system; in testing, one usually checks whether a given implementation, whose internal structure is often unknown, conforms with an abstract design. We are interested in the combination of these techniques. Namely, we would like to be able to test whether an implementation with unknown structure satisfies some given properties. We propose and formalize this problem of black box checking and suggest several algorithms. Since the input to black box checking is not given initially, as is the case in the classical model of computation, but is learned through experiments, we propose a computational model based on games with incomplete information. We use this model to analyze the complexity of the problem. We also address the more practical question of finding an approach that can detect errors in the implementation before completing an exhaustive search.