Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Formal verification of parallel programs
Communications of the ACM
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Testing Transition Systems: An Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Model-Based Software Testing and Analysis with C#
Model-Based Software Testing and Analysis with C#
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
The Composition of Event-B Models
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Decomposition Structures for Event-B
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Model based testing with labelled transition systems
Formal methods and testing
Test generation based on symbolic specifications
FATES'04 Proceedings of the 4th 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
Compositional random testing using extended symbolic transition systems
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
An orchestrated survey of methodologies for automated software test case generation
Journal of Systems and Software
| Hi-index | 0.00 |
We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of formal specification languages. We define a notion of i/o-refinement over GLASs as an alternating simulation relation and provide formal proofs that relate i/o-refinement to ioco. We show that non-i/o-refinement reduces to a reachability problem and provide a translation from bounded non-i/orefinement or bounded non-ioco to checking first-order assertions.