Niklas Krafczyk

dblp:155/6009 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
5since 2021 · last 2024
0000-0003-0475-4128ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 2 first-author · 4 since 2021Systems, architecture and hardware · 2 · 1 first-authorTheory of computation · 1 · 1 since 2021
YearPublicationVenuePosition
2024 Exhaustive property oriented model-based testing with symbolic finite state machines
abstract
We advocate a fusion of property-oriented testing (POT) and model-based testing (MBT). The existence of a symbolic finite state machine (SFSM) model fulfilling the properties of interest is exploited for property-directed test data generation and to create a test oracle. A new test generation strategy is presented for verifying that the system under test (SUT) satisfies the same LTL safety conditions over a given set of atomic propositions as the model. We prove that this strategy is exhaustive in the sense that any SUT violating at least one of these formulae will fail at least one test case of the generated suite. It is shown that the existence of a model allows for significantly smaller exhaustive test suites as would be necessary for POT without reference models. As a corollary, the main theorem also generalises a known result about SFSM-based conformance testing for language equivalence. Our approach fits well to industrial development processes for (potentially safety-critical) cyber-physical systems, where both models and properties representing system requirements are elaborated for development, verification, and validation.
Wen-ling Huang, Niklas Krafczyk, Jan Peleska 0001
Sci. Comput. Program.2
2023 Complete Property-Oriented Module Testing
Felix Brüning, Mario Gleirscher, Wen-ling Huang, Niklas Krafczyk, Jan Peleska 0001, Robert Sachtleben
ICTSS4
2021 libfsmtest An Open Source Library for FSM-Based Testing
Moritz Bergenthal, Niklas Krafczyk, Jan Peleska 0001, Robert Sachtleben
ICTSS2
2021 Exhaustive Property Oriented Model-Based Testing with Symbolic Finite State Machines
Niklas Krafczyk, Jan Peleska 0001
SEFM1
2021 Efficient data validation for geographical interlocking systems
abstract
Abstract In this paper, an efficient approach to data validation of distributed geographical interlocking systems (IXLs) is presented. In the distributed IXL paradigm, track elements are controlled by local computers communicating with other control components over local and wide area networks. The overall control logic is distributed over these track-side computers and remote server computers that may even reside in one or more cloud server farms. Redundancy is introduced to ensure fail-safe behaviour, fault-tolerance, and to increase the availability of the overall system. To cope with the configuration-related complexity of such distributed IXLs, the software is designed according to the digital twin paradigm: physical track elements are associated with software objects implementing supervision and control for the element. The objects communicate with each other and with high-level IXL control components in the cloud over logical channels realised by distributed communication mechanisms. The objective of this article is to explain how configuration rules for this type of IXLs can be specified by temporal logic formulae interpreted on Kripke Structure representations of the IXL configuration. Violations of configuration rules can be specified using formulae from a well-defined subset of LTL. By decomposing the complete configuration model into sub-models corresponding to routes through the model, the LTL model checking problem can be transformed into a CTL checking problem for which highly efficient algorithms exist. Specialised rule violation queries that are hard to express in LTL can be simplified and checked faster by performing sub-model transformations adding auxiliary variables to the states of the underlying Kripke Structures. Further performance enhancements are achieved by checking each sub-model concurrently. The approach presented here has been implemented in a model checking tool which is applied by Siemens Mobility for data validation of geographical IXLs.
Jan Peleska 0001, Niklas Krafczyk, Anne E. Haxthausen, Ralf Pinger
Formal Aspects Comput.2
2017 Effective Infinite-State Model Checking by Input Equivalence Class Partitioning
Niklas Krafczyk, Jan Peleska 0001
ICTSS1
2016 WCET overapproximation for software in the context of a Cyber-Physical System
abstract
We propose an approach for overapproximating the Worst-Case Execution Time (WCET) of embedded control software using formal methods. Model checking is iteratively applied to compute the WCET from the machine code of the software considering a platform and an environment model. We implemented the approach and present first experiments for a thermal controller application executed on a LEON3 processor under different environment constraints.
Niklas Krafczyk, Heinz Riener, Görschwin Fey
VLSI-SoC1
2014 Automatically connecting hardware blocks via light-weight matching techniques
abstract
In modern chip design, many different blocks are assembled in a single chip. Normally, these blocks have been written by different developers or even licensed from other companies. Correctly connecting all blocks is a tedious task. State of the art tools for automatically generating the connections either require identical port-names or additional user input describing the intended connections.
Jan Malburg, Niklas Krafczyk, Görschwin Fey
DDECS2