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

DOI10.1007/978-3-030-92124-8_5zbMath1522.68331OpenAlexW4205907374MaRDI QIDQ6041277

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

Mathematics Subject Classification ID

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

Cites Work

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

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