The Omega Library interface guide
The Omega Library interface guide
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic execution and program testing
Communications of the ACM
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
An Approach to Symbolic Test Generation
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Proceedings of the 16th IEEE international conference on Automated software engineering
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Automatic test generation with AGATHA
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic execution techniques for refinement testing
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Symbolic execution techniques for test purpose definition
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Test generation based on symbolic specifications
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Symbolic execution of UML-RT State Machines
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Symbolic execution of communicating and hierarchically composed UML-RT state machines
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
| Hi-index | 0.00 |
We describe fundamental aspects of a method we have developed in order to check linear temporal logic formulas over Input Output Symbolic Transition Systems (IOSTSs). IOSTSs are used to describe reactive systems with communication channels and variables of different types ; in particular variables can take unbounded values. Thus the method can be applied to open systems, communicating with their environment, or with other modules that are not precisely specified. The method consists in a semi-decision algorithm based on symbolic execution techniques, usually used for tests generation purposes. We provide an adaptation of this technique in order to evaluate a LTL formula along a symbolic path ; moreover we have developed a termination criterion of the semi-decision algorithm for IOSTSs whose data part is specified by a decidable first order theory.