Algebraic theory of processes
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
IEEE Transactions on Computers
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Aiding Test Case Generation in Temporally Constrained State Based Systems Using Genetic Algorithms
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Analysis of the OLSR Protocol by Using Formal Passive Testing
APSEC '09 Proceedings of the 2009 16th Asia-Pacific Software Engineering Conference
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
A Statistical Approach to Test Stochastic and Probabilistic Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Model based testing with labelled transition systems
Formal methods and testing
Testing timed systems modeled by Stream X-machines
Software and Systems Modeling (SoSyM)
A case study on the use of genetic algorithms to generate test cases for temporal systems
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Testing probabilistic distributed systems
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
This talk reviews some of my contributions on formal testing of timed and probabilistic systems, focusing on methodologies that allow their users to decide whether these systems are correct with respect to a formal specification. The consideration of time and probability complicates the definition of these frameworks since there is not an obvious way to define correctness. For example, in a specific situation it might be desirable that a system is as fast as possible while in a different application it might be required that the performance of the system is exactly equal to the one given by the specification. All the methodologies have as common assumption that the system under test is a black-box and that the specification is described as a timed and/or probabilistic extension of the finite state machines formalism.