Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Using model checking to generate tests from requirements specifications
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Modular verification of collaboration-based software designs
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Automatic extraction of object-oriented component interfaces
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Software component quality assessment in practice: successes and practical impediments
Proceedings of the 24th International Conference on Software Engineering
Verifying cross-cutting features as open systems
ACM SIGSOFT Software Engineering Notes
IEEE Software
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Test Generation for Intelligent Networks Using Model Checking
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
You Assume, We Guarantee: Methodology and Case Studies
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
AMC: An Adaptive Model Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Component Metadata for Software Engineering Tasks
EDO '00 Revised Papers from the Second International Workshop on Engineering Distributed Objects
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Component technology: what, where, and how?
Proceedings of the 25th International Conference on Software Engineering
Mutation Operators for Specifications
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Assumption Generation for Software Component Verification
Proceedings of the 17th IEEE international conference on Automated software engineering
Using Model Checking to Generate Tests from Specifications
ICFEM '98 Proceedings of the Second IEEE International Conference on Formal Engineering Methods
Testing systems of concurrent black-boxes—an automata-theoretic and decompositional approach
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
| Hi-index | 0.00 |
This paper introduces a new approach for the verification of systems with unspecified components. In our approach, some model-checking problems concerning a component-based system are first reduced to the emptiness problem of an oracle finite automaton, which is then solved by testing the unspecified components on-the-fly with test-cases generated automatically from the oracle finite automaton. The generated test-cases are of bounded length, and with a properly chosen bound, a complete and sound solution is immediate. Particularly, the whole verification process can be carried out in an automatic way. In the paper, a symbolic algorithm is given for generating test-cases and performing the testings, and an example is drawn from an TinyOS application to illustrate our approach.