Exhaustive property oriented model-based testing with symbolic finite state machines

DOI10.1007/978-3-030-92124-8_5zbMATH Open1522.68331OpenAlexW4205907374MaRDI QIDQ6041277FDOQ6041277

Niklas Krafczyk, Jan Peleska

Publication date: 26 May 2023

Published in: Software Engineering and Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92124-8_5

Recommendations

• Towards property oriented testing
• Formal Approaches to Software Testing
• Symbolic Model-based Test Selection
• Model based testing with logical properties versus state machines
• Model-based testing of reactive systems. Advanced lectures.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Linear Encodings of Bounded LTL Model Checking
• Safety, liveness and fairness in temporal logic
• Complete model-based equivalence class testing for nondeterministic systems
• Formal Approaches to Software Testing
• Towards property oriented testing
• Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin

Cited In (1)

• An optimised complete strategy for testing symbolic finite state machines

This page was built for publication: Exhaustive property oriented model-based testing with symbolic finite state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041277)