Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
State-based model checking of event-driven system requirements
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Verifying systems with integer constraints and Boolean predicates: a composite approach
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
Specification-based prototyping for embedded systems
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
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking
Using predicate abstraction to reduce object-oriented programs for model checking
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
Slicing Software for Model Construction
Higher-Order and Symbolic Computation
Symbolic Model Checking
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Model Checking Large Software Specifications
IEEE Transactions on Software Engineering
Abstraction and Modular Verification of Infinite-State Reactive Systems
RTSE '97 Proceedings of the International Workshop on Requirements Targeting Software and Systems Engineering
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Generation of Reduced Models for Checking Fragments of CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Effectiveness of Slicing Hierarchical State Machines: A Case Study
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 1
Automated Test-Data Generation from Formal Models of Software
Proceedings of the 16th IEEE international conference on Automated software engineering
VERTAF: An Application Framework for the Design and Verification of Embedded Real-Time Software
IEEE Transactions on Software Engineering
Generation of test sequences from formal specifications: GSM 11-11 standard case study
Software—Practice & Experience
Data constraints for validation of real-time software
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Arithmetic strengthening for shape analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
Hi-index | 0.00 |
Model checking techniques have not been effective in important classes of software systems characterized by large (or infinite) input domains with interrelated linear and non-linear constraints over the input variables. Various model abstraction techniques have been proposed to address this problem. In this paper, we wish to propose domain abstraction based on data equivalence and trajectory reduction as an alternative and complement to other abstraction techniques. Our technique applies the abstraction to the input domain (environment) instead of the model and is applicable to constraint-free and deterministic constrained data transition system. Our technique is automatable with some minor restrictions.