TY - CPAPER TI - On the Generation of Invalid Objects for Inferring More Precise Class Invariants AU - Boockmann, Jan Henrik AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2025 T2 - Software Engineering and Formal Methods : 23rd International Conference, SEFM 2025, Toledo, Spain, November 10–14, 2025, Proceedings SP - 148-156 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 9783032104434 DO - 10.1007/978-3-032-10444-1_9 UR - https://fis.uni-bamberg.de/handle/uniba/112155 LA - eng ER - TY - CPAPER TI - Recovering Test-To-Code Trace Links via Program Mutation AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2025 T2 - 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C) SP - 166-173 PB - IEEE Computer Society CY - Los Alamitos, CA, USA DO - 10.1109/saner-c66551.2025.00032 UR - https://fis.uni-bamberg.de/handle/uniba/112156 LA - eng ER - TY - CPAPER TI - Comprehending Object State via Dynamic Class Invariant Learning AU - Boockmann, Jan H. AU - Lüttgen, Gerald PY - 2025 SP - 143-164 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111406 LA - eng AB - Maintaining software is cumbersome when method argument constraints are undocumented. To reveal them, previous work learned preconditions from exemplary valid and invalid method arguments. In practice, it would be highly beneficial to know class invariants, too, because functionality added during software maintenance must not break them. Even more so than method preconditions, class invariants are rarely documented and often cannot completely be inferred automatically, especially for objects exhibiting complex state such as dynamic data structures. This paper presents a novel dynamic approach to learning class invariants, thereby complementing related work on learning method preconditions. We automatically synthesize assertions from an adjustable assertion grammar to distinguish valid and invalid objects. While random walks generate valid objects, a combination of bounded-exhaustive testing techniques and behavioral oracles yield invalid objects. The utility of our approach for code comprehension and software maintenance is demonstrated by comparing our learned invariants to documented invariant validation methods found in real-world Java classes and to the invariants detected by the Daikon tool. KW - Dynamic Class Invariant Learning ER - TY - CPAPER TI - SWTbahn : An Embedded Software Demonstrator in Symbiosis with Embedded Software Education AU - Luedtke, Bernhard M. AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2025 SP - 77-82 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111403 LA - eng AB - Demonstrators, such as model railways, are effective in providing real-world examples that help students to grasp abstract concepts in the engineering of embedded software. Although building such a demonstrator yourself can appear overwhelming, we argue how building your own improves your teaching of embedded software. We report on how we have achieved these improvements with a development process that lets our teaching co-evolve with our own demonstrator, share our main lessons learned, and invite educators to discuss remaining challenges. KW - model railway demonstrator KW - evolutionary development KW - embedded software ER - TY - CPAPER TI - Fast Pathfinding in Knowledge Graphs Using Word Embeddings AU - Martin, Leon AU - Boockmann, Jan H. AU - Henrich, Andreas PY - 2025 SP - 305-312 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106396 LA - eng AB - Knowledge graphs, which model relationships between entities, provide a rich and structured source of information. Currently, search engines aim to enrich their search results by structured summaries, e.g., obtained from knowledge graphs, that provide further information on the entity of interest. While single entity summaries are available already, summaries on the relations between multiple entities have not been studied in detail so far. Such queries can be understood as a pathfinding problem. However, the large size of public knowledge graphs, such as Wikidata, as well as the large indegree of its major entities, and the problem of concept drift impose major challenges for standard search algorithms in this context. In this paper, we propose a bidirectional pathfinding approach for directed knowledge graphs that uses the semantic distance between entity labels, which is approximated using word vectors, as a search heuristics in a parameterized A*-like evaluation function in order to find meaningful paths between two entities fast. We evaluate our approach using different parameters against a set of selected within- and cross-domain queries. The results indicate that our approach generally needs to explore fewer entities compared to its uninformed counterpart and qualitatively yields more meaningful paths. KW - Knowledge graphs KW - Word embeddings KW - Pathfinding ER - TY - JOUR TI - On domain generators for the evaluation of action reversibility in STRIPS AU - Schwartz, Tobias AU - Boockmann, Jan H. AU - Martin, Leon PY - 2025 JO - Annals of Mathematics and Artificial Intelligence VL - 93 IS - 5 SP - 699-726 PB - Springer Science + Business Media B.V CY - Dordrecht [u.a.] SN - 1573-7470 DO - 10.1007/s10472-024-09960-8 UR - https://fis.uni-bamberg.de/handle/uniba/107589 LA - eng AB - Robustness is a crucial requirement for the deployment of AI systems in real-world scenarios. In the context of AI planning, the concept of action reversibility, i.e., the ability to undo the effects of an action using a reverse plan, is a promising direction for achieving robust plans. Plans composed exclusively of reversible actions exhibit resilience against goal changes during the execution of the plan. However, the evaluation of action reversibility systems in STRIPS planning presents a challenge, given that standard planning benchmarks are often not suitable. Early experiments using a naive implementation of an action reversibility algorithm show that the available domain generation approach is susceptible to bias. Building on this existing domain generator, we introduce two slight variations that exhibit entirely different search space characteristics. We assess these domain generators using the naive action reversibility implementation and existing ASP implementations, and demonstrate that different generators indeed favor different implementations. As a follow-up to this line of research, we present a generalized domain generator facilitating the creation of domains with diverse search space characteristics. To finally reduce the utilization of contrived generation patterns, we propose another domain generator based on the Barabási-Albert model yielding less rigid domains. Our experiments demonstrate that these new domain generators can produce a variety of domains with diverse search space characteristics, enabling a less biased evaluation of action reversibility systems. KW - STRIPS planning KW - Action reversibility KW - Benchmark KW - PDDL domain generation ER - TY - CPAPER TI - Integrating Mutation Techniques to Keep Specification and Source Code in Sync AU - Jacob, Kerstin PY - 2024 T2 - Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis SP - 1912-1914 PB - ACM CY - New York, NY, United States SN - 979-8-4007-0612-7 DO - 10.1145/3650212.3685556 UR - https://fis.uni-bamberg.de/handle/uniba/106849 LA - eng ER - TY - CPAPER TI - Comprehending Object State via Dynamic Class Invariant Learning AU - Boockmann, Jan H. AU - Lüttgen, Gerald PY - 2024 T2 - Fundamental Approaches to Software Engineering : 27th International Conference, FASE 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings SP - 143-164 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-57258-6 DO - 10.1007/978-3-031-57259-3_7 UR - https://fis.uni-bamberg.de/handle/uniba/98466 LA - eng AB - Maintaining software is cumbersome when method argument constraints are undocumented. To reveal them, previous work learned preconditions from exemplary valid and invalid method arguments. In practice, it would be highly beneficial to know class invariants, too, because functionality added during software maintenance must not break them. Even more so than method preconditions, class invariants are rarely documented and often cannot completely be inferred automatically, especially for objects exhibiting complex state such as dynamic data structures. This paper presents a novel dynamic approach to learning class invariants, thereby complementing related work on learning method preconditions. We automatically synthesize assertions from an adjustable assertion grammar to distinguish valid and invalid objects. While random walks generate valid objects, a combination of bounded-exhaustive testing techniques and behavioral oracles yield invalid objects. The utility of our approach for code comprehension and software maintenance is demonstrated by comparing our learned invariants to documented invariant validation methods found in real-world Java classes and to the invariants detected by the Daikon tool. KW - Dynamic Class Invariant Learning ER - TY - CPAPER TI - SWTbahn : An Embedded Software Demonstrator in Symbiosis with Embedded Software Education AU - Luedtke, Bernhard M. AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 T2 - Software Engineering im Unterricht der Hochschulen 2024 : Komplettband SP - 77-82 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 978-3-88579-255-0 DO - 10.18420/seuh2024_06 UR - https://fis.uni-bamberg.de/handle/uniba/98464 LA - eng AB - Demonstrators, such as model railways, are effective in providing real-world examples that help students to grasp abstract concepts in the engineering of embedded software. Although building such a demonstrator yourself can appear overwhelming, we argue how building your own improves your teaching of embedded software. We report on how we have achieved these improvements with a development process that lets our teaching co-evolve with our own demonstrator, share our main lessons learned, and invite educators to discuss remaining challenges. KW - model railway demonstrator KW - evolutionary development KW - embedded software ER - TY - CPAPER TI - On the Hunt for Invalid Objects : Exploring the Object State Space with Program Mutants AU - Boockmann, Jan Henrik AU - Lüttgen, Gerald PY - 2024 VL - 31 SP - 711-716 PB - IEEE CY - New York SN - 979-8-3503-3066-3 DO - 10.1109/saner60148.2024.00078 UR - https://fis.uni-bamberg.de/handle/uniba/98170 LA - eng ER - TY - RPRT TI - Heterogeneous Specification of Spacecraft Software AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irb-97634 UR - https://fis.uni-bamberg.de/handle/uniba/97634 LA - eng AB - The operational behaviour of a reactive system is commonly specified or modelled as concurrent state machines, where each machine models the possible states or modes of a software component and its interactions with the environment. However, state machines can quickly become verbose when execution constraints between concurrent states need to be modelled. Alternatively, constraints could be modelled declaratively as special edges between states. Such a heterogeneous modelling approach is employed by Virtual Satellite (VirSat), a model-based systems engineering tool from the German Aerospace Center (DLR). The challenge has been to develop a heterogeneous modelling framework that supports an operational and declarative syntax, defines a unified semantics suitable for formal reasoning, and supports the independent and incremental development of software components. We address this challenge with our Component State Machine (CSM) formalism as a means to operationalise VirSat: the operational syntax of VirSat is preserved in CSM, the declarative VirSat constraints are transformed into CSM atomic propositions and parallel conditions, the CSM parallel operator incrementally composes CSMs and resolves the parallel conditions, and design errors are analysed as inconsistent transitions. CSM permits new constraints to be defined without needing to modify the core VirSat semantics. We also propose an intuitive, practical, and mathematically rigorous notion of refinement that aims to encourage a more systematic development of spacecraft software. Lastly, we offer a modular implementation of CSMs as hierarchically scheduled Executable State Machines (ESMs) that remains open to further composition and refinement. KW - operational behaviour KW - component state machine (CSM) KW - german aerospace center (DLR) KW - VirSat KW - executable state machines (ESMs) ER - TY - RPRT TI - Concurrency, Shared Variables, Compositionality : An Unlikely Triple AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irb-97637 UR - https://fis.uni-bamberg.de/handle/uniba/97637 LA - eng AB - This paper reports our experiences with extending Interface Automaton (IA) with shared variables by lifting IA’s intuitive notion of refinement and compositionality to shared variables. Although there are existing works that introduce shared variables to IA, they typically support a very restricted notion of sharing, e.g., the value of a shared variable is only defined for the duration of an atomic operation, with no ability to persist values for subsequent operations. When attempting to formulate the semantics of shared variables that could persist their values across operations, we encountered numerous challenges when defining a notion of refinement that respected compositionality. We conjecture that, even for a basic notion of variable persistence, concurrent shared variable accesses between automata create a tight data dependency that prevents a compositional reasoning. We discuss the generality of this negative result in relation to other concurrency theories. KW - Interface Automaton (IA) KW - compositionality KW - shared variables KW - concurrency ER - TY - CPAPER TI - LetSynchronise : An Open-Source Framework for Analysing and Optimising Logical Execution Time Systems AU - Yip, Eugene AU - Kuo, Matthew M.Y. PY - 2023 T2 - Proceedings of 2023 Cyber-Physical Systems and Internet-of-Things Week (CPS-IoT Week) Workshops : May 9-12, 2023, San Antonio, Texas, USA SP - 349-354 PB - ACM CY - New York SN - 979-8-4007-0049-1 DO - 10.1145/3576914.3587500 UR - https://fis.uni-bamberg.de/handle/uniba/112379 LA - eng ER - TY - JOUR TI - Synchronous Deterministic Parallel Programming for Multi-Cores with ForeC AU - Yip, Eugene AU - Girault, Alain AU - Roop, Partha S. AU - Biglari-Abhari, Morteza PY - 2023 JO - ACM transactions on programming languages and systems : ACM TOPLAS VL - 45 IS - 2 SP - 1-74 PB - Association for Computing Machinery CY - New York, NY SN - 1558-4593 DO - 10.1145/3591594 UR - https://fis.uni-bamberg.de/handle/uniba/108603 LA - eng ER - TY - CPAPER TI - On Developing an E-Assessment Tool for Agile Practices AU - Jacob, Kerstin AU - Hallmann, Daniel AU - Lüttgen, Gerald AU - Völpel, Vanessa PY - 2023 SP - 13-18 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90945 LA - eng AB - As agile software development processes are widely applied in industry, students need to develop a good understanding of agile principles and practices as part of their education. During our ten years of experience with teaching the Scrum framework in team project modules, we noticed that students frequently struggle with writing good user stories and concise sprint goals. To support students in mastering basic practices and to free limited teaching resources for more in-depth discussions on advanced topics, e-assessment tools should be developed to provide timely feedback on at least common mistakes. This paper argues that, and sketches how, research on quality criteria for artifacts of agile development can serve as the basis for such a tool. However, multiple challenges remain that we invite lecturers and researchers to discuss. KW - agile software development KW - e-assessment tool KW - Scrum ER - TY - CPAPER TI - On Developing an E-Assessment Tool for Agile Practices AU - Jacob, Kerstin AU - Hallmann, Daniel AU - Lüttgen, Gerald AU - Völpel, Vanessa PY - 2023 T2 - Proceedings der SEUH 2023 : 23.-24. Februar 2023 in Paderborn, Deutschland SP - 13-18 PB - Gesellschaft für Informatik CY - Bonn SN - 978-3-88579-727-2 DO - 10.18420/seuh2023_01 UR - https://fis.uni-bamberg.de/handle/uniba/90073 LA - eng AB - As agile software development processes are widely applied in industry, students need to develop a good understanding of agile principles and practices as part of their education. During our ten years of experience with teaching the Scrum framework in team project modules, we noticed that students frequently struggle with writing good user stories and concise sprint goals. To support students in mastering basic practices and to free limited teaching resources for more in-depth discussions on advanced topics, e-assessment tools should be developed to provide timely feedback on at least common mistakes. This paper argues that, and sketches how, research on quality criteria for artifacts of agile development can serve as the basis for such a tool. However, multiple challenges remain that we invite lecturers and researchers to discuss. KW - agile software development KW - e-assessment tool KW - Scrum ER - TY - JOUR TI - High Fidelity Simulation of Hybrid Systems using Higher Order Hybrid Automata AU - Ro, Jin Woo AU - Malik, Avinash AU - Roop, Partha S. PY - 2022 JO - IEEE Transactions on Computers VL - 71 IS - 7 SP - 1668-1680 PB - IEEE Computer Soc. SN - 1557-9956 DO - 10.1109/tc.2021.3100746 UR - https://fis.uni-bamberg.de/handle/uniba/109401 LA - eng ER - TY - JOUR TI - GitOps : The Evolution of DevOps? AU - Beetz, Florian AU - Harrer, Simon PY - 2022 JO - IEEE software VL - 39 IS - 4 SP - 70-75 PB - Soc. CY - Los Alamitos, Calif. SN - 1937-4194 DO - 10.1109/ms.2021.3119106 UR - https://fis.uni-bamberg.de/handle/uniba/109400 LA - eng ER - TY - JOUR TI - Model-driven Engineering for Dynamic Data Structures AU - Boockmann, Jan Henrik AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 JO - Softwaretechnik-Trends : Mitteilungen der Fachgruppen VL - 42 IS - 4 SP - 2-7 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 0720-8928 UR - https://fis.uni-bamberg.de/handle/uniba/105316 LA - eng ER - TY - CPAPER TI - Heap Patterns for Memory Graph Visualization AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2022 T2 - 2022 Working Conference on Software Visualization (VISSOFT) SP - 162-166 PB - IEEE SN - 978-1-6654-8092-5 DO - 10.1109/VISSOFT55257.2022.00025 UR - https://fis.uni-bamberg.de/handle/uniba/105320 LA - eng ER - TY - CPAPER TI - Throw Away Student Software At Semester End? : Better Not! AU - Boockmann, Jan AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 SP - 23-28 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57354 LA - eng AB - Software engineering is continuously evolving in order to meet the challenges faced by the ever growing complexity and longevity of digital systems. Students should thus acquire additional practical competencies wrt. software evolution and maintenance. This paper describes how student team projects at our Chair have been redesigned to meet this need, and reports on our first experiences. It also aims at initiating a discussion on the challenges we met, namely the contributions we can expect from students, the effort required from staff, and the individualization of grades. KW - long-living software KW - project-based learning KW - software evolution and maintenance ER - TY - CPAPER TI - Throw Away Student Software At Semester End? : Better Not! AU - Boockmann, Jan AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 T2 - Software Engineering im Unterricht der Hochschulen SEUH 2022 : 24.-25. Februar 2022, Berlin ; Proceedings SP - 23--28 CY - Bonn SN - 978-3-88579-715-9 DO - 10.18420/SEUH2022_03 UR - https://fis.uni-bamberg.de/handle/uniba/57001 LA - eng AB - Software engineering is continuously evolving in order to meet the challenges faced by the ever growing complexity and longevity of digital systems. Students should thus acquire additional practical competencies wrt. software evolution and maintenance. This paper describes how student team projects at our Chair have been redesigned to meet this need, and reports on our first experiences. It also aims at initiating a discussion on the challenges we met, namely the contributions we can expect from students, the effort required from staff, and the individualization of grades. KW - long-living software KW - project-based learning KW - software evolution and maintenance ER - TY - JOUR TI - A linear-time branching-time perspective on interface automata AU - Vogler, Walter AU - Lüttgen, Gerald PY - 2022 SP - 513-550 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/55170 LA - eng AB - Over the past two decades, de Alfaro and Henzinger’s interface automata (IA) have become a popular formal framework for the component-based specification of concurrent systems. IA’s parallel composition assumes that a component may wait on inputs but never on outputs, implying that an output must be consumed immediately or a communication error occurs. By now, the literature contains a number of semantics for IA: linear-time semantics based on traces observing communication errors, quiescence and/or divergence, as well as branching-time semantics based on alternating simulation. This article surveys these semantics from Rob van Glabbeek’s linear-time branching-time perspective, which does not consider settings with communication errors. We shed light onto the subtleties implied by IA’s pruning of all behaviour that might lead a component to autonomously enter an error state, and investigate when exactly de Alfaro and Henzinger’s restriction of input-determinism is needed. In addition, we introduce several new semantics for IA, in particular the linear-time ready semantics and the branching-time ready simulation. KW - interface automata KW - semantics KW - simulation KW - de Alfaro and Henzinger’s restriction KW - Glabbeek’s linear-time branching-time perspective ER - TY - CPAPER TI - Reinforcement Learning With Imperfect Safety Constraints AU - Ro, Jin Woo AU - Lüttgen, Gerald AU - Wolter, Diedrich PY - 2022 T2 - Artificial Intelligence Safety 2022 : Proceedings of the Workshop on Artificial Intelligence Safety 2022 (SafeAI 2022) co-located with the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI2022) Virtual, February, 2022. SP - 1-8 PB - RWTH Aachen CY - Aachen, Germany T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/55364 LA - eng ER - TY - JOUR TI - On the automation-supported derivation of domain-specific UML profiles considering static semantics AU - Kraas, Alexander PY - 2022 VL - 21 IS - 1 SP - 51-79 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54847 LA - eng AB - In the light of standardization, the model-driven engineering (MDE) is becoming increasingly important for the development of DSLs, in addition to traditional approaches based on grammar formalisms. Metamodels define the abstract syntax and static semantics of a DSL and can be created by using the language concepts of the Meta Object Facility (MOF) or by defining a UML profile. Both metamodels and UML profiles are often provided for standardized DSLs, and the mappings of metamodels to UML profiles are usually specified informally in natural language, which also applies for the static semantics of metamodels and/or UML profiles, which has the disadvantage that ambiguities can occur, and that the static semantics must be manually translated into a machine-processable language. To address these weaknesses, we propose a new automated approach for deriving a UML profile from the metamodel of a DSL. One novelty is that subsetting or redefining metaclass attributes are mapped to stereotype attributes whose values are computed at runtime via automatically created OCL expressions. The automatic transfer of the static semantics of a DSL to a UML profile is a further contribution of our approach. Our DSL Metamodeling and Derivation Toolchain (DSL-MeDeTo) implements all aspects of our proposed approach in Eclipse. This enabled us to successfully apply our approach to the two DSLs Test Description Language (TDL) and Specification and Description Language (SDL). KW - model-driven engineering (MDE) KW - DSL KW - Metamodels KW - UML profiles KW - machine-processable language ER - TY - JOUR TI - Interface Automata for Shared Memory AU - Schinko, Ayleen AU - Vogler, Walter AU - Gareis, Johannes AU - Nguyen, Ngoc Tri AU - Lüttgen, Gerald PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54718 LA - eng AB - Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems. KW - Interface Automata KW - Alfaro and Henzinger’s original IA theory KW - memory data KW - ground semantics ER - TY - JOUR TI - On the automation-supported derivation of domain-specific UML profiles considering static semantics AU - Kraas, Alexander PY - 2021 JO - Software and Systems Modeling VL - 21 IS - 1 SP - 51-79 PB - Springer CY - Berlin ; Heidelberg ; New York, NY, USA SN - 1619-1374 DO - 10.1007/s10270-021-00890-1 UR - https://fis.uni-bamberg.de/handle/uniba/54846 LA - eng AB - In the light of standardization, the model-driven engineering (MDE) is becoming increasingly important for the development of DSLs, in addition to traditional approaches based on grammar formalisms. Metamodels define the abstract syntax and static semantics of a DSL and can be created by using the language concepts of the Meta Object Facility (MOF) or by defining a UML profile. Both metamodels and UML profiles are often provided for standardized DSLs, and the mappings of metamodels to UML profiles are usually specified informally in natural language, which also applies for the static semantics of metamodels and/or UML profiles, which has the disadvantage that ambiguities can occur, and that the static semantics must be manually translated into a machine-processable language. To address these weaknesses, we propose a new automated approach for deriving a UML profile from the metamodel of a DSL. One novelty is that subsetting or redefining metaclass attributes are mapped to stereotype attributes whose values are computed at runtime via automatically created OCL expressions. The automatic transfer of the static semantics of a DSL to a UML profile is a further contribution of our approach. Our DSL Metamodeling and Derivation Toolchain (DSL-MeDeTo) implements all aspects of our proposed approach in Eclipse. This enabled us to successfully apply our approach to the two DSLs Test Description Language (TDL) and Specification and Description Language (SDL). KW - model-driven engineering (MDE) KW - DSL KW - Metamodels KW - UML profiles KW - machine-processable language ER - TY - JOUR TI - Interface Automata for Shared Memory AU - Schinko, Ayleen AU - Vogler, Walter AU - Gareis, Johannes AU - Nguyen, Ngoc Tri AU - Lüttgen, Gerald PY - 2021 JO - Acta Informatica PB - Springer CY - Berlin ; Heidelberg ; New York, NY, USA SN - 1432-0525 DO - 10.1007/s00236-021-00408-8 UR - https://fis.uni-bamberg.de/handle/uniba/54717 LA - eng AB - Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems. KW - Interface Automata KW - Alfaro and Henzinger’s original IA theory KW - memory data KW - ground semantics ER - TY - CPAPER TI - Synchronized Shared Memory and Procedural Abstraction : Towards a Formal Semantics of Blech AU - Gretz, F. AU - Grosch, F-J. AU - Mendler, M. AU - Scheele, S. PY - 2020 T2 - Proceedings of the 2020 Forum on specification & Design Languages (FDL) PB - IEEE CY - Piscataway, New Jersey SN - 978-1-7281-8928-4 DO - 10.1109/fdl50818.2020.9232942 UR - https://fis.uni-bamberg.de/handle/uniba/112860 LA - eng ER - TY - CPAPER TI - Learning Data Structure Shapes from Memory Graphs AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2020 VL - 73 SP - 151-168 PB - EasyChair CY - Manchester SN - 2398-7340 DO - 10.29007/dhpw UR - https://fis.uni-bamberg.de/handle/uniba/50153 LA - eng ER - TY - JOUR TI - A linear-time branching-time perspective on interface automata AU - Vogler, Walter AU - Lüttgen, Gerald PY - 2020 JO - Acta Informatica VL - 57 IS - 3 SP - 513-550 PB - Springer SN - 1432-0525 DO - 10.1007/s00236-020-00369-4 UR - https://fis.uni-bamberg.de/handle/uniba/50150 LA - eng AB - Over the past two decades, de Alfaro and Henzinger’s interface automata (IA) have become a popular formal framework for the component-based specification of concurrent systems. IA’s parallel composition assumes that a component may wait on inputs but never on outputs, implying that an output must be consumed immediately or a communication error occurs. By now, the literature contains a number of semantics for IA: linear-time semantics based on traces observing communication errors, quiescence and/or divergence, as well as branching-time semantics based on alternating simulation. This article surveys these semantics from Rob van Glabbeek’s linear-time branching-time perspective, which does not consider settings with communication errors. We shed light onto the subtleties implied by IA’s pruning of all behaviour that might lead a component to autonomously enter an error state, and investigate when exactly de Alfaro and Henzinger’s restriction of input-determinism is needed. In addition, we introduce several new semantics for IA, in particular the linear-time ready semantics and the branching-time ready simulation. KW - interface automata KW - semantics KW - simulation KW - de Alfaro and Henzinger’s restriction KW - Glabbeek’s linear-time branching-time perspective ER - TY - CPAPER TI - Fast Pathfinding in Knowledge Graphs Using Word Embeddings AU - Martin, Leon AU - Boockmann, Jan H. AU - Henrich, Andreas PY - 2020 T2 - KI 2020: Advances in Artificial Intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings SP - 305-312 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-030-58284-5 DO - 10.1007/978-3-030-58285-2_27 UR - https://fis.uni-bamberg.de/handle/uniba/49140 LA - eng AB - Knowledge graphs, which model relationships between entities, provide a rich and structured source of information. Currently, search engines aim to enrich their search results by structured summaries, e.g., obtained from knowledge graphs, that provide further information on the entity of interest. While single entity summaries are available already, summaries on the relations between multiple entities have not been studied in detail so far. Such queries can be understood as a pathfinding problem. However, the large size of public knowledge graphs, such as Wikidata, as well as the large indegree of its major entities, and the problem of concept drift impose major challenges for standard search algorithms in this context. In this paper, we propose a bidirectional pathfinding approach for directed knowledge graphs that uses the semantic distance between entity labels, which is approximated using word vectors, as a search heuristics in a parameterized A*-like evaluation function in order to find meaningful paths between two entities fast. We evaluate our approach using different parameters against a set of selected within- and cross-domain queries. The results indicate that our approach generally needs to explore fewer entities compared to its uninformed counterpart and qualitatively yields more meaningful paths. KW - Knowledge graphs KW - Word embeddings KW - Pathfinding ER - TY - THES TI - Data Structure Identification from Executions of Pointer Programs AU - Rupprecht, Thomas PY - 2020 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-717-2 DO - 10.20378/irb-47325 UR - https://fis.uni-bamberg.de/handle/uniba/47325 LA - eng AB - The reverse engineering of binaries is a tedious and time consuming task, yet mandatory when the need arises to understand the behaviour of a program for which source code is unavailable. Instances of source code loss for old arcade games [1] and the steadily growing amount of malware [2] are prominent use cases requiring reverse engineering. One of the challenges when dealing with binaries is the loss of low level type information, i.e., primitive and compound types, which even state-of-the-art type recovery tools often cannot reconstruct with full accuracy. Further programmers most commonly use high level data structures, such as linked lists, in addition to primitive types. Therefore detection of dynamic data structure shapes is an important aspect of reverse engineering. Though the recognition of dynamic data structure shapes in the presence of tricky programming concepts such as pointer arithmetic and casts – which are both fundamental concepts to enable, e.g., the frequently used Linux kernel list [3] – also bring current shape detection tools to their limits. A recent approach called Data Structure Investigator (DSI) [4] , aims for the detection of dynamic pointer based data structures. While the approach is general in nature, a concrete realization for C programs requiring source code is envisioned as programming constructs such as type casts and pointer arithmetic will stress test the approach. Therefore, the first research question addressed in this dissertation is whether DSI can meet its goal in the presence of the sheer multitude of existing data structure implementations. The second research question is whether DSI can be opened up to reverse engineer C/C++ binaries, even in the presence of type information loss and the variety of C/C++ programming constructs. Both questions are answered positively in this dissertation. The first is answered by realizing the DSI source code approach, which requires detailing fundamental aspects of DSI’s theory to arrive at a working implementation, e.g., handling the consistency of DSI’s memory abstraction and quantifying the interconnections found within a dynamic pointer based data structure, e.g., a parent child nesting scenario, to allow for its detection. DSI’s utility is evaluated on an extensive benchmark including real world examples (libusb [5], bash [6]) and shape analysis examples, [7,8] . The second question is answered through the development of a DSI prototype for binaries (DSIbin). To compensate for the loss of perfect type information found in source code, DSIbin interfaces with the state-of-the-art type recovery tool Howard [9]. Notably, DSIbin improves upon type information recovered by Howard. This is accomplished through a much improved nested struct detection and type merging algorithm, both of which are fundamental aspects for the reverse engineering of binaries. The proposed approach is again evaluated by a diverse benchmark containing real world examples such as, the VNC clipping library, The Computer Language Benchmarks Game and the Olden Benchmark, as well as examples taken from the shape analysis literature. In summary, this dissertation improves upon the state-of-the-art of shape detection and reverse engineering by (i) realizing and evaluating the DSI approach, which includes contributing to DSI’s theory and results in the DSI prototype; (ii) opening up DSI for C/C++ binaries so as to extend DSI to reverse engineering, resulting in the DSIbin prototype; (iii) handling data structures with DSIbin not covered by some related work such as skip lists; (iv) refining the nesting detection and performing type merging for types excavated by Howard. Further, DSIbin’s ultimate future use case of malware analysis is hardened by revealing the presence of dynamic data structures in multiple real world malware samples. In summary, this dissertation advanced the dynamic analysis of data structure shapes with the aforementioned contributions to the DSI approach for source code and further by transferring this new technology to the analysis of binaries. The latter resulted in the additional insight that high level dynamic data structure information can help to infer low level type information. 1. http://kotaku.com/5028197/sega-cant-find-the-source-code-for-your-favorite-old-school-arcade-games 2. https://www.av-test.org/en/statistics/malware/ 3. https://github.com/torvalds/linux/blob/master/include/linux/list.h 4. SWT Research Group, University Bamberg, DFG-Project LU 1748/4-1 5. http://libusb.info/ 6. https://www.gnu.org/software/bash/ 7. Predator: http://www.fit.vutbr.cz/research/groups/verifit/tools/predator/ 8. Forester: http://www.fit.vutbr.cz/research/groups/verifit/tools/forester/ 9. http://www.cs.vu.nl/ herbertb/papers/dde_ndss11-preprint.pdf KW - Data structure identification; Dynamic data structures; Pointer programs; Reverse engineering; Type recovery ER - TY - CPAPER TI - Shape Inference from Memory Graphs (Extended Abstract) AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2019 T2 - 20. Kolloquium Programmiersprachen und Grundlagen der Programmierung KPS 2019 : Tagungsband SP - 69-71 PB - Shaker Verlag CY - Düren SN - 978-3-8440-6933-4 UR - https://fis.uni-bamberg.de/handle/uniba/50360 LA - eng ER - TY - CPAPER TI - Lightweight Semantics-Preserving Communication for Real-Time Automotive Software AU - Yip, Eugene AU - Lalo, Erjola AU - Lüttgen, Gerald AU - Sailer, Andreas PY - 2019 T2 - 13th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) SP - 372-379 PB - IEEE SN - 978-1-7281-4882-3 DO - 10.1109/MCSoC.2019.00059 UR - https://fis.uni-bamberg.de/handle/uniba/48659 LA - eng ER - TY - CPAPER TI - A Multi-Rate Precision Timed Programming Language for Multi-Cores AU - Girault, Alain AU - Hili, Nicolas AU - Jenn, Eric AU - Yip, Eugene PY - 2019 T2 - 2019 Forum for Specification and Design Languages (FDL) SP - 8 PB - IEEE SN - 978-1-7281-4113-8 DO - 10.1109/FDL.2019.8876950 UR - https://fis.uni-bamberg.de/handle/uniba/48658 LA - eng ER - TY - CPAPER TI - Generating Inductive Shape Predicates for Runtime Checking and Formal Verification AU - Boockmann, Jan AU - Lüttgen, Gerald AU - Mühlberg, Jan Tobias PY - 2018 T2 - Leveraging Applications of Formal Methods, Verification and Validation. Verification : 8th International Symposium, ISoLA 2018, Limassol, Cyprus, November 5-9, 2018, Proceedings, Part II SP - 64-74 PB - Springer International Publishing CY - Cham SN - 978-3-030-03420-7 DO - 10.1007/978-3-030-03421-4_5 UR - https://fis.uni-bamberg.de/handle/uniba/50362 LA - eng ER - TY - JOUR TI - A generalised theory of Interface Automata, component compatibility and error AU - Fendrich, Sascha AU - Lüttgen, Gerald PY - 2018 JO - Acta Informatica VL - 56 IS - 4 SP - 287-319 PB - Springer CY - Berlin ; Heidelberg [u.a.] SN - 1432-0525 DO - 10.1007/s00236-018-0319-8 UR - https://fis.uni-bamberg.de/handle/uniba/44798 LA - eng AB - Interface theories allow system designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger's Interface Automata and Larsen's Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines. In this article we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established Modal Interface Automata theory. ER - TY - CPAPER TI - A Note on Refinement in Hierarchical Transition Systems AU - Lüttgen, Gerald PY - 2018 T2 - Formal Methods for Industrial Critical Systems : 23rd International Conference, FMICS 2018, Maynooth, Ireland, September 3-4, 2018, Proceedings SP - 211-222 PB - Springer International Publishing CY - Cham T3 - Lecture Notes in Computer Science ET - 1 SN - 978-3-030-00244-2 DO - 10.1007/978-3-030-00244-2 UR - https://fis.uni-bamberg.de/handle/uniba/44799 LA - eng AB - Software engineers frequently employ notations and tools based on transition systems, such as UML state machines and Statecharts, for specifying and reasoning about reactive behaviour. While these notations are typically supported by an operational semantics, they lack a formal underpinning of the incremental refinement practices of engineers who, e.g., place state machines inside states or add outer transitions to states during design. This note sketches how modal transition systems may be applied to formally capture such refinements along state hierarchies, using a hierarchical extension of labelled transition systems that permits engineers to explicitly allow or disallow state refinement and transition extension at each state. A small example testifies to the utility of this framework for hierarchically refining reactive systems. ER - TY - RPRT TI - Optimized Buffering of Time-Triggered Automotive Software AU - Yip, Eugene AU - Lalo, Erjola AU - Lüttgen, Gerald AU - Deubzer, Michael AU - Sailer, Andreas PY - 2018 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irbo-52917 UR - https://fis.uni-bamberg.de/handle/uniba/44463 LA - eng AB - The development of an automotive system involves the integration of many real-time software functionalities, and it is of utmost importance to guarantee strict timing requirements. However, the recent trend towards multi-core architectures poses significant challenges for the timely transfer of signals between processor cores so as to not violate data consistency. We have studied and adapted an existing buffering mechanism to work specifically for statically scheduled time-triggered systems, called static buffering protocol. We developed further buffering optimisation algorithms and heuristics, to reduce the memory consumption, processor utilisation, and end-to-end response times of time-triggered AUTOSAR designs on multi-core platforms. Our contributions are important because they enable deterministic time-triggered implementations to become competitive alternatives to their inherently non-deterministic event-triggered counterparts. We have prototyped a selection of optimisations in an industrial tool and evaluated them on realistic industrial automotive benchmarks. KW - Real-Time Software, Logical-Execution Time, Buffering Mechanism ER - TY - CPAPER TI - DSI: Automated detection of dynamic data structures in C programs and binary code AU - Rupprecht, Thomas AU - Boockmann, Jan AU - White, David AU - Lüttgen, Gerald ED - Amme, Wolfram ED - Heinze, Thomas S. PY - 2017 T2 - Programmiersprachen und Grundlagen der Programmierung : 19. Kolloquium, KPS 2017 ; Weimar, 25.–27. September 2017 ; Tagungsband SP - 134-147 PB - Friedrich-Schiller-Universität Jena CY - Weimar T3 - Jenaer Schriften zur Mathematik und Informatik UR - https://fis.uni-bamberg.de/handle/uniba/44806 LA - eng AB - Program comprehension is an important task for software engineers who maintain legacy code, as well as for reverse engineers who analyse binary executables such as malware. Detecting dynamic, i.e., pointer-based data structures is a particular challenge due to the complex usage of pointers found in real world software. This paper presents the key results of the DFG-funded project "Learning Data Structure Behaviour from Executions of Pointer Programs" (DSI), in which dynamic analysis techniques have been developed to identify dynamic data structures in C programs and x86 binary code. DSI's analysis utilizes a novel memory abstraction that allows for a compact description of pointer-based data structures such as linked lists and binary trees, and their interconnections such as parent-child nesting. On top of this abstraction, an evidence-collecting approach calculates a natural language description of the observed data structure with the help of a systematic taxonomy. The inferred data structure information is not only helpful for program comprehension but also for other use cases including software verification and software visualization. ER - TY - CPAPER TI - Comparing trace recordings of automotive real-time software AU - Sailer, Andreas AU - Deubzer, Michael AU - Lüttgen, Gerald AU - Mottok, Jürgen PY - 2017 T2 - Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017, Grenoble, France SP - 118-127 PB - ACM CY - New York, NY SN - 978-1-4503-5286-4 DO - 10.1145/3139258.3139265 UR - https://fis.uni-bamberg.de/handle/uniba/43006 LA - eng ER - TY - CPAPER TI - DSIbin: identifying dynamic data structures in C/C++ binaries AU - Rupprecht, Thomas AU - Chen, Xi AU - White, David H. AU - Boockmann, Jan H. AU - Lüttgen, Gerald AU - Bos, Herbert PY - 2017 T2 - Proceedings of the 32nd International Conference on Automated Software Engineering SP - 331-341 PB - IEEE CY - Urbana, IL SN - 978-1-5386-2684-9 DO - 10.1109/ASE.2017.8115646 UR - https://fis.uni-bamberg.de/handle/uniba/42967 LA - eng ER - TY - CPAPER TI - Automated Tooling for the Evolving SDL Standard: From Metamodels to UML Profiles AU - Kraas, Alexander ED - Csöndes, Tibor ED - Kovács, Gábor ED - Réthy, György PY - 2017 T2 - SDL 2017 : Model-Driven Engineering for Future Internet ; 18th International SDL Forum, Budapest, Hungary, October 9–11, 2017, Proceedings SP - 136-156 PB - Springer International Publishing CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-68015-6 DO - 10.1007/978-3-319-68015-6 UR - https://fis.uni-bamberg.de/handle/uniba/42606 LA - eng ER - TY - THES TI - Modal Interface Theories for Specifying Component-based Systems AU - Fendrich, Sascha PY - 2017 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/42329 LA - eng AB - Large software systems frequently manifest as complex, concurrent, reactive systems and their correctness is often crucial for the safety of the application. Hence, modern techniques of software engineering employ incremental, component-based approaches to systems design. These are supported by interface theories which may serve as specification languages and as semantic foundations for software product lines, web-services, the internet of things, software contracts and conformance testing. Interface theories enable a systems designer to express communication requirements of components on their environments and to reason about the mutual compatibility of these requirements in order to guarantee the communication safety of the system. Further, interface theories enrich traditional operational specification theories by declarative aspects such as conjunction and disjunction, which allow one to specify systems heterogeneously. However, substantial practical aspects of software verification are not supported by current interface theories, e.g., reusing components, adapting components to changed operational environments, reasoning about the compatibility of more than two components, modelling software product lines or tracking erroneous behaviour in safety-critical systems. The goal of this thesis is to investigate the theoretical foundations for making interface theories more practical by solving the above issues. Although partial solutions to some of these issues have been presented in the literature, none of them succeeds without sacrificing other desired features. The particular challenge of this thesis is to solve these problems simultaneously within a single interface theory. To this end, the arguably most general interface theory Modal Interface Automata (MIA) is extended, yielding the interface theory Error-preserving Modal Interface Automata (EMIA). The above problems are addressed as follows. Quotient operators are adjoint to composition and, therefore, support component reuse. Such a quotient operator is introduced to both MIA and EMIA. It is the first one that considers nondeterministic dividends and compatibility. Alphabet extension operators for MIA and EMIA allow for the change of operational environment by permitting one to adapt system components to new interactions without breaking previously satisfied requirements. Erroneous behavior is identified as a common source of problems with respect to the compatibility of more than two components, the modelling of software product lines and erroneous behaviour in safety-critical systems. EMIA improves on previous interface theories by providing a more precise semantics with respect to erroneous behaviour based on error-preservation. The relation between error-preservation and the usual error-abstraction employed in previous interface theories is investigated, establishing a Galois insertion from MIA into EMIA that is relevant at the levels of specifications, composition operations and proofs. The practical utility of interface theories is demonstrated by providing a software implementation of MIA and EMIA that is applied to two case studies. Further, an outlook is given on the relation between type checking and refinement checking. As a proof of concept, the simple interface theory Interface Automata is extended to a behavioural type theory where type checking is a syntactic approximation of refinement checking. ER - TY - JOUR TI - Resource-aware Policies AU - Bottoni, Paolo AU - Fish, Andrew AU - Heußner, Alexander AU - Presicce, F. Parisi PY - 2017 JO - Journal of Visual Languages and Computation VL - 38 SP - 84-96 PB - Elsevier, Academic Press CY - Amsterdam [u.a.] SN - 1045-926X DO - 10.1016/j.jvlc.2016.10.004 UR - https://fis.uni-bamberg.de/handle/uniba/41394 LA - eng ER - TY - CPAPER TI - CoreTAna : A Trace Analyzer for Reverse Engineering Real-Time Software AU - Sailer, Andreas AU - Deubzer, Michael AU - Lüttgen, Gerald AU - Mottok, Jürgen PY - 2016 T2 - IEEE 23rd Intl. Conf. on Software Analysis, Evolution, and Reengineering (SANER 2016) SP - 657-660 PB - IEEE Computer Society CY - Osaka, Japan SN - 978-1-5090-1855-0 DO - 10.1109/SANER.2016.36 UR - https://fis.uni-bamberg.de/handle/uniba/41947 LA - eng ER - TY - CPAPER TI - The ForeC Synchronous Deterministic Parallel Programming Language for Multicores AU - Yip, Eugene AU - Girault, Alain AU - Roop, Partha S. AU - Biglari-Abhari, Morteza PY - 2016 T2 - IEEE 10th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC), 2016 SP - 297-304 PB - IEEE CY - Deutschland SN - 978-1-5090-3531-1 DO - 10.1109/MCSoC.2016.13 UR - https://fis.uni-bamberg.de/handle/uniba/41458 LA - eng ER - TY - CPAPER TI - Preface AU - Heußner, Alexander AU - Kissinger, Aleks AU - Wijs, Anton PY - 2016 T2 - EPTCS 231: Proceedings Second : Graphs as Models Workshop ; Eindhoven, The Netherlands, April 2-3, 2016 PB - NICTA CY - Sydney SN - 2075-2180 DO - 10.4204/EPTCS.231 UR - https://fis.uni-bamberg.de/handle/uniba/41391 LA - eng ER - TY - CPAPER TI - POSTER: Identifying Dynamic Data Structures in Malware AU - Rupprecht, Thomas AU - Chen, Xi AU - White, David H. AU - Mühlberg, Jan Tobias AU - Bos, Herbert AU - Lüttgen, Gerald PY - 2016 T2 - CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security SP - 1772-1774 PB - ACM CY - New York, NY, USA SN - 978-1-4503-4139-4 DO - 10.1145/2976749.2989041 UR - https://fis.uni-bamberg.de/handle/uniba/41377 LA - eng AB - As the complexity of malware grows, so does the necessity of employing program structuring mechanisms during development. While control flow structuring is often obfuscated, the dynamic data structures employed by the program are typically untouched. We report on work in progress that exploits this weakness to identify dynamic data structures present in malware samples for the purposes of aiding reverse engineering and constructing malware signatures, which may be employed for malware classification. Using a prototype implementation, which combines the type recovery tool Howard and the identification tool Data Structure Investigator (DSI), we analyze data structures in Carberp and AgoBot malware. Identifying their data structures illustrates a challenging problem. To tackle this, we propose a new type recovery for binaries based on machine learning, which uses Howard's types to guide the search and DSI's memory abstraction for hypothesis evaluation. ER - TY - CPAPER TI - A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs AU - Corrodi, Claudio AU - Heußner, Alexander AU - Poskitt, Christopher M. ED - Stevens, Perdita ED - Wąsowski , Andrzej PY - 2016 T2 - Fundamental Approaches to Software Engineering : 19th International Conference, FASE 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016, Proceedings SP - 31-48 PB - Springer CY - Berlin ; Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-662-49664-0 DO - 10.1007/978-3-662-49665-7_3 UR - https://fis.uni-bamberg.de/handle/uniba/41373 LA - eng ER - TY - JOUR TI - Nondeterministic Modal Interfaces AU - Bujtor, Ferenc AU - Fendrich, Sascha AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2016 JO - Theoretical computer science : the journal of the EATCS IS - 642 SP - 24-53 PB - Elsevier CY - Amsterdam [u.a.] SN - 0304-3975 DO - 10.1016/j.tcs.2016.06.011 UR - https://fis.uni-bamberg.de/handle/uniba/41366 LA - eng AB - Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA. In this paper, we generalise MI to interfaces, for which we properly resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. In addition, we define a hiding and a restriction operator, complement conjunction with a disjunction operator and illustrate our interface theory by means of a simple example. ER - TY - CPAPER TI - DSI : an evidence-based approach to identify dynamic data structures in C programs AU - White, David H. AU - Rupprecht, Thomas AU - Lüttgen, Gerald PY - 2016 T2 - ISSTA 2016: Proceedings of the 25th International Symposium on Software Testing and Analysis SP - 259-269 PB - ACM CY - New York, NY SN - 978-1-4503-4390-9 DO - 10.1145/2931037.2931071 UR - https://fis.uni-bamberg.de/handle/uniba/41314 LA - eng ER - TY - CPAPER TI - A Generalised Theory of Interface Automata, Component Compatibility and Error AU - Fendrich, Sascha AU - Lüttgen, Gerald ED - Ábrahám, Erika ED - Huisman, Marieke PY - 2016 T2 - Integrated formal methods : 12th International Conference, IFM 2016, Reykjavik, Iceland, June 1-5, 2016: proceedings SP - 160-175 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-33692-3 DO - 10.1007/978-3-319-33693-0_11 UR - https://fis.uni-bamberg.de/handle/uniba/41243 LA - eng ER - TY - GEN TI - A Generalised Theory of Interface Automata, Component Compatibility and Error AU - Fendrich, Sascha AU - Lüttgen, Gerald PY - 2016 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/40287 LA - eng AB - Interface theories allow systems designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger’s Interface Automata and Larsen’s Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines. In this paper we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established MIA (Modal Interface Automata) theory. KW - Interface Automata KW - Modal Transition Systems KW - Component-based Design KW - Concurrency KW - Error States ER - TY - CPAPER TI - Learning assertions to verify linked-list programs AU - Mühlberg, Jan Tobias AU - White, David H. AU - Dodds, Mike AU - Lüttgen, Gerald AU - Piessens, Frank ED - Calinescu, Radu ED - Rumpe , Bernhard PY - 2015 T2 - Software Engineering and Formal Methods : 13th International Conference, SEFM 2015, York, UK, September 7-11, 2015 ; Proceedings SP - 37-52 PB - Springer CY - Berlin ; Heidelberg [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-319-22968-3 DO - 10.1007/978-3-319-22969-0_3 UR - https://fis.uni-bamberg.de/handle/uniba/41306 LA - eng ER - TY - JOUR TI - Richer interface automata with optimistic and pessimistic compatibility AU - Lüttgen, Gerald AU - Vogler, Walter AU - Fendrich, Sascha PY - 2015 JO - Acta Informatica VL - 52 IS - 4/5 SP - 305-336 PB - Springer CY - Heidelberg [u.a.] SN - 1432-0525 DO - 10.1007/s00236-014-0211-0 UR - https://fis.uni-bamberg.de/handle/uniba/21974 LA - eng AB - Modal transition systems are a popular semantic underpinning of interface theories, such as Nyman et al.’s IOMTS and Bauer et al.’s MIO, which facilitate component-based reasoning for concurrent systems. Our interface theory MIA repaired a compositional flaw of IOMTS-refinement and introduced a conjunction operator. In this paper, we first modify MIA to properly deal with internal computations including internal must-transitions, which were largely ignored already in IOMTS. We then study a MIA variant that adopts MIO’s pessimistic—rather than IOMTS’ optimistic—view on component compatibility and define, for the first-time in a pessimistic, non-deterministic setting, conjunction and disjunction on interfaces. For both the optimistic and pessimistic MIA variant, we also discuss mechanisms for extending alphabets when refining interfaces, which is a desired feature for perspective-based specification. We illustrate our advancements via a small example. ER - TY - CPAPER TI - Nondeterministic Modal Interfaces AU - Bujtor, Ferenc AU - Fendrich, Sascha AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2015 T2 - SOFSEM 2015: theory and practice of computer science 41th International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24 - 29, 2015 ; proceedings SP - 152-163 PB - Springer CY - Heidelberg [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-662-46078-8 DO - 10.1007/978-3-662-46078-8_13 UR - https://fis.uni-bamberg.de/handle/uniba/21930 LA - eng AB - Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.’s IOMTS, Bauer et al.’s MIO, Raclet et al.’s MI or our MIA. In this paper, we generalise MI to nondeterministic interfaces, for which we resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. ER - TY - JOUR TI - Symbolic object code analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2014 JO - International Journal on Software Tools for Technology Transfer VL - 16 IS - 1 SP - 81-102 PB - Springer CY - Berlin Heidelberg SN - 1433-2787 DO - 10.1007/s10009-012-0256-8 UR - https://fis.uni-bamberg.de/handle/uniba/21904 LA - eng ER - TY - CPAPER TI - Automated Verification of Critical Systems AU - Lüttgen, Gerald AU - Merz, Stephan PY - 2014 IS - 96 (2014), 3, Special issue on Automated Verification of Critical Systems (AVoCS'12) SP - 277-278 PB - Elsevier Science CY - Amsterdam [u.a.] DO - 10.1016/j.scico.2014.03.008 UR - https://fis.uni-bamberg.de/handle/uniba/21865 LA - eng ER - TY - CPAPER TI - Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory AU - White, David AU - Lüttgen, Gerald ED - Piterman, Nir PY - 2013 T2 - Tools and algorithms for the construction and analysis of systems : 19th international conference, TACAS 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16 - 24, 2013 ; proceedings SP - 354-369 PB - Springer CY - Berlin T3 - Lecture notes in computer science SN - 978-3-642-36741-0 DO - 10.1007/978-3-642-36742-7_25 UR - https://fis.uni-bamberg.de/handle/uniba/2581 LA - eng ER - TY - JOUR TI - Modal Interface Automata AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2013 JO - Logical Methods in Computer Science : LMCS VL - 9 IS - 3 SP - 1-28 CY - Braunschweig SN - 1860-5974 DO - 10.2168/LMCS-9(3:4)2013 UR - https://fis.uni-bamberg.de/handle/uniba/2535 LA - eng ER - TY - CPAPER TI - ω-Petri Nets AU - Geeraerts, Gilles AU - Heußner, Alexander AU - Praveen, M. AU - Raskin, Jean-François ED - Colom, José-Manuel ED - Desel, Jörg PY - 2013 T2 - Application and Theory of Petri Nets and Concurrency : 34th International Conference, PETRI NETS 2013, Milan, Italy, June 2013 ; Proceedings SP - 49-69 PB - Springer CY - Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-642-38696-1 DO - 10.1007/978-3-642-38697-8_4 UR - https://fis.uni-bamberg.de/handle/uniba/2539 LA - eng ER - TY - CPAPER TI - Queue-Dispatch Asynchronous Systems AU - Geeraerts, Gilles AU - Heußner, Alexander AU - Raskin, Jean-François PY - 2013 T2 - ACSD '13: Proceedings of the 2013 13th International Conference on Application of Concurrency to System Design SP - 150-159 PB - IEEE Computer Society CY - Washington, DC, USA SN - 978-0-7695-5035-0 DO - 10.1109/ACSD.2013.18 UR - https://fis.uni-bamberg.de/handle/uniba/2547 LA - eng ER - TY - CPAPER TI - Reachability in Higher-Order-Counters AU - Heußner, Alexander AU - Kartzow, Alexander ED - Krishnendu, Chatterjee ED - Sgall, Jiri PY - 2013 T2 - Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013; Klosterneuburg, Austria, August 26-30, 2013 ; Proceedings SP - 528-539 PB - Springer CY - Berlin, Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-642-40312-5 DO - 10.1007/978-3-642-40313-2_47 UR - https://fis.uni-bamberg.de/handle/uniba/2528 LA - eng ER - TY - CPAPER TI - Safety Verification of Communicating One-Counter Machines AU - Heußner, Alexander AU - Le Gall, Tristan AU - Sutre, Grégoire PY - 2012 T2 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) SP - 224-235 CY - Wadern T3 - LIPIcs - Leibniz International Proceedings in Informatics SN - 978-3-939897-47-7 UR - https://fis.uni-bamberg.de/handle/uniba/986 LA - eng ER - TY - CPAPER TI - On Parallel Software Verification Using Boolean Equation Systems AU - Ditter, Alexander AU - Češka, Milan AU - Lüttgen, Gerald ED - Donaldson, Alastair PY - 2012 T2 - Model checking software : 19th international workshop, SPIN 2012, Oxford, UK, July 23 - 24, 2012 ; proceedings SP - 80-97 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-31758-3 DO - 10.1007/978-3-642-31759-0_8 UR - https://fis.uni-bamberg.de/handle/uniba/858 LA - eng ER - TY - CPAPER TI - Introducing Fairness into Compositional Verification via Unidirectional Counters AU - Siirtola, Antti AU - Puhakka, Antti AU - Lüttgen, Gerald PY - 2012 T2 - Proceedings, 2012 12th International Conference on Application of Concurrency to System Design : ACSD 2012 : 27-29 June 2012, Hamburg, Germany. SP - 32-41 CY - Hamburg SN - 978-0-7695-4709-1 UR - https://fis.uni-bamberg.de/handle/uniba/839 LA - eng ER - TY - CPAPER TI - Modal Interface Automata AU - Lüttgen, Gerald AU - Vogler, Walter ED - Baeten, Josephus C. M. PY - 2012 T2 - Theoretical computer science : 7th IFIP TC1/WG2.2 international conference, TCS 2012 : Amsterdam, The Netherlands, September 2012 : proceedings SP - 265-279 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-33474-0 DO - 10.1007/978-3-642-33475-7_19 UR - https://fis.uni-bamberg.de/handle/uniba/840 LA - eng ER - TY - JOUR TI - Symbolic object code analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2012 JO - International journal on software tools for technology transfer : STTT PB - Springer CY - Berlin ; Heidelberg SN - 1433-2779 UR - https://fis.uni-bamberg.de/handle/uniba/835 LA - eng ER - TY - JOUR TI - Verifying compiled file system code AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2012 JO - Formal Aspects of Computing : the international journal of formal methods VL - 24 IS - 3 SP - 375-391 PB - Springer CY - London ; Berlin SN - 0934-5043 DO - 10.1007/s00165-011-0198-z UR - https://fis.uni-bamberg.de/handle/uniba/829 LA - eng ER - TY - JOUR TI - To Parallelize or to Optimize? AU - Ezekiel, Jonathan AU - Lüttgen, Gerald AU - Siminiceanu, Radu PY - 2011 JO - Journal of Logic and Computation VL - 21 IS - 1 SP - 85 - 120 SN - 0955-792X UR - https://fis.uni-bamberg.de/handle/uniba/3252 LA - eng ER - TY - JOUR TI - Ready simulation for concurrency: It's logical!star, open AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2010 JO - Information and computation VL - 208 IS - 7 SP - 845-867 SN - 0890-5401 UR - https://fis.uni-bamberg.de/handle/uniba/3920 LA - eng ER - TY - CPAPER TI - On the expressiveness of refinement settings AU - Fecher, Harald AU - Frutos-Escrig, David de AU - Lüttgen, Gerald AU - Schmidt, Heiko PY - 2010 T2 - Fundamentals of software engineering : third IPM international conference, FSEN 2009, Kish Island, Iran, April 15 - 17, 2009 ; revised selected papers SP - 276 - 291 CY - Berlin u.a. SN - 978-3-642-11622-3 UR - https://fis.uni-bamberg.de/handle/uniba/3884 LA - eng ER - TY - CPAPER TI - Symbolic Object Code Analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2010 T2 - Model checking software : 17th International SPIN workshop, Enschede, The Netherlands, September 27-29, 2010 ; proceedings SP - 4 - 21 CY - Berlin u.a. T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/3886 LA - eng ER - TY - CHAP TI - What is in a Step: New Perspectives on a Classical Question AU - Roever, Willem-Paul de AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2010 T2 - Time for verification : essays in memory of Amir Pnueli SP - 370 - 399 CY - Berlin u.a. SN - 9783642137532 UR - https://fis.uni-bamberg.de/handle/uniba/3847 LA - eng ER - TY - CPAPER TI - Is observational congruence on µ-expressions axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2010 VL - 208 IS - 6 = Special Issue: 18th International Conference on Concurrency Theory (CONCUR 2007) SP - 634 - 651 UR - https://fis.uni-bamberg.de/handle/uniba/3806 LA - eng ER - TY - JOUR TI - Generative Models for Chemical Structures AU - White, David AU - Wilson, Richard C. PY - 2010 JO - Journal of chemical information and modeling VL - 50 IS - 7 SP - 1257-1274 PB - American Chemical Society CY - Washington, DC, SN - 1549-960X DO - 10.1021/ci9004089 UR - https://fis.uni-bamberg.de/handle/uniba/2607 LA - eng ER - TY - GEN TI - Symbolic Object Code Analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2010 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/194 LA - eng AB - Current software model checkers quickly reach their limit when being applied to verifying pointer safety properties in source code that includes function pointers and inlined assembly. This paper introduces an alternative technique for checking pointer safety violations, called Symbolic Object Code Analysis (SOCA), which is based on bounded symbolic execution, incorporates path-sensitive slicing, and employs the SMT solver Yices as its execution and verification engine. Extensive experimental results of a prototypic SOCA Verifier, using the Verisec suite and almost 10,000 Linux device driver functions as benchmarks, show that SOCA performs competitively to current source-code model checkers and that it also scales well when applied to real operating systems code and pointer safety issues. SOCA effectively explores semantic niches of software that current software verifiers do not reach. KW - bounded model checking , symbolic execution , program slicing , object code analysis , linux device drivers KW - bounded model checking KW - symbolic execution KW - program slicing KW - object code analysis KW - linux device drivers ER - TY - CPAPER TI - Verifying compiled file system code AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2009 T2 - Formal methods: foundations and applications : 12th Brazilian Symposium on Formal Methods, SBMF 2009 Gramado, Brazil, August 19- 21, 2009 ; revised selected papers SP - 306 - 320 CY - Berlin u.a. SN - 978-3-642-10452-7 UR - https://fis.uni-bamberg.de/handle/uniba/20148 LA - eng ER - TY - CPAPER TI - Is observational congruence axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2007 T2 - CONCUR 2007 - concurrency theory : 18th international conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007 ; proceedings SP - 197 - 211 CY - Berlin u.a. T3 - Lecture notes in computer science DO - 10.1007/978-3-540-74407-8 UR - https://fis.uni-bamberg.de/handle/uniba/18098 LA - eng ER - TY - BOOK TI - Is observational congruence on µ-expressions axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2007 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/15376 LA - eng ER - TY - CPAPER TI - Proceedings of the Second Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2004) AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2005 VL - 115 SP - 1 - 97 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/12909 LA - eng ER - TY - CPAPER TI - Semantic foundations of engineering design languages : SFEDL 2004 ; satellite workshop to the seventh European Joint Conferences on Theory and Practice of Software (ETAPS 2004), Barcelona, Spain, April 3, 2004 ; proceedings AU - Lüttgen, Gerald AU - Martínez Madrid, Natividad AU - Mendler, Michael PY - 2004 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/15256 LA - eng ER - TY - JOUR TI - Editorial: Semantic Foundations of Engineering Design Languages AU - Broy, Manfred AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2004 JO - Formal aspects of computing : the internat. journal of formal methods VL - 16 IS - 3 = Special issue SP - 165 SN - 0934-5043 UR - https://fis.uni-bamberg.de/handle/uniba/13594 LA - eng ER - TY - CPAPER TI - Editorial: Where theory and practice meet AU - Broy, Manfred AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2003 VL - 15 IS - 4 = Special Issue: Where theory and practice meet SP - 297 - 298 UR - https://fis.uni-bamberg.de/handle/uniba/13602 LA - eng ER - TY - CPAPER TI - A compositional semantic theory for synchronous component-based design AU - Norton, B. AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2003 T2 - CONCUR 2003 - concurrency theory : 14th International Conference, Marseille, France, September 3 - 5, 2003 ; proceedings SP - 461 - 476 CY - Berlin T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9771 LA - eng ER - TY - CPAPER TI - Statecharts: from visual syntax to model-theoretic semantics AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2003 T2 - Wirtschaft und Wissenschaft in der network economy - Visionen und Wirklichkeit : Tagungsband der GI/OCG Jahrestagung 2001, 25. - 28. September 2001, Universität Wien SP - 615 - 621 CY - Wien T3 - Books@ocg.at UR - https://fis.uni-bamberg.de/handle/uniba/9775 LA - eng ER - TY - CPAPER TI - Towards a model-theory for Esterel AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 VL - 65 IS - 5 = SLAP'2002 Synchronous Languages, Applications, and Programming, Grenoble, France, April 13, 2002 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/10081 LA - eng ER - TY - CPAPER TI - Axiomatizing an algebra of step reactions for synchronous languages AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 T2 - CONCUR 2002 - Concurrency theory : 13th international conference, Brno, Czech Republic, August 20 - 23, 2002 ; proceedings SP - 386 - 401 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9824 LA - eng ER - TY - JOUR TI - The intuitionism behind statecharts steps AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 JO - ACM transactions on computational logic : TOCL VL - 3 IS - 1 SP - 1 - 41 SN - 1529-3785 DO - 10.1145/504077.504078 UR - https://fis.uni-bamberg.de/handle/uniba/9778 LA - eng ER -