A Mechanised Proof of an Adaptive State Counting Algorithm. - Robert Sachtleben; Robert M. Hierons; Wen-ling Huang; Jan Peleska 001 (ICTSS, 2019)

Formalisation of an Adaptive State Counting Algorithm. - Robert Sachtleben (Arch. Formal Proofs, 2019)

An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm. - Robert Sachtleben (ICTSS, 2020)

libfsmtest An Open Source Library for FSM-Based Testing. - Moritz Bergenthal; Niklas Krafczyk; Jan Peleska 001; Robert Sachtleben (ICTSS, 2021)

Verified Complete Test Strategies for Finite State Machines. - Robert Sachtleben (Arch. Formal Proofs, 2022)

Effective grey-box testing with partial FSM models. - Robert Sachtleben; Jan Peleska 001 (Softw. Test. Verification Reliab., 2022)

An approach for the verification and synthesis of complete test generation algorithms for finite state machines - Robert Sachtleben (2022)

Conformance Relations Between Input/Output Languages. - Wen-ling Huang; Robert Sachtleben (Applicable Formal Methods for Safe Industrial Products, 2023)

Complete Property-Oriented Module Testing. - Felix Brüning; Mario Gleirscher; Wen-ling Huang; Niklas Krafczyk; Jan Peleska 001; Robert Sachtleben (ICTSS, 2023)

Conformance Relations between Input/Output Languages. - Robert Sachtleben (Arch. Formal Proofs, 2023)

Qualification of proof assistants, checkers, and generators: Where are we and what next? - Mario Gleirscher; Robert Sachtleben; Jan Peleska 001 (Sci. Comput. Program., 2023)

On the Unification of Conformance Notions. - Jan Peleska 001; Wen-ling Huang; Robert Sachtleben (The Application of Formal Methods, 2024)

Unifying frameworks for complete test strategies. - Robert Sachtleben (Sci. Comput. Program., 2024)

Mechanised Safety Verification for a Distributed Autonomous Railway Control System. - Robert Sachtleben; Anne E. Haxthausen; Jan Peleska 001 (Formal Aspects Comput., 2025)