TY - JOUR TI - Synchronised Shared Memory and Model Checking AU - Aguado, Joaquín AU - Duenas, Alejandra PY - 2024 JO - ACM transactions on embedded computing systems : TECS VL - 23 IS - 5, 70 SP - 1-30 PB - ACM Press CY - New York, NY SN - 1558-3465 DO - 10.1145/3626188 UR - https://fis.uni-bamberg.de/handle/uniba/107767 LA - eng ER - TY - BOOK TI - Schulpraktische Studien an der Universität Bamberg : Impulse für die Lehrkräftebildung AU - Grötzbach, Daniel AU - Niehaus, Johanna AU - Beer, Christof AU - Rübben, Ricarda AU - Hirmer, Tobias AU - Sticht, Martin AU - Timm, Susanne AU - Summer, Theresa AU - Schnellbögl, Claudia AU - Kraus, Birgit AU - Schwarzl, Cordula AU - Plötz, Evi AU - Lindner, Konstantin AU - Steinweg, Anna Susanne AU - Treiber, Eva AU - Meidel, Eva AU - Mayer, Florian AU - Franz, Ute AU - Groh, Nicola AU - Kleber, Angelika AU - Anderka, Angela ED - Plötz, Evi ED - Summer, Theresa ED - Grötzbach, Daniel ED - Drechsel, Barbara PY - 2024 PB - University of Bamberg Press CY - Bamberg T3 - Forum Lehrerinnen- und Lehrerbildung SN - 978-3-86309-969-5 DO - 10.20378/irb-95393 UR - https://fis.uni-bamberg.de/handle/uniba/95393 LA - deu AB - Schulbezogene Praktika im Lehramtsstudium sind die ersten und frühzeitigen Einblicke Studierender in ihre zukünftige professionelle Praxis. In den vergangenen Jahren wurde diesen Lerngelegenheiten im wissenschaftlichen Diskurs viel Aufmerksamkeit zugewandt. Unterschiedliche Akteurinnen und Akteure in den Schulen und an der Universität sind damit befasst, Studierenden diese Erfahrungen zu ermöglichen und gemeinsam maximale Lernerfolge sicherzustellen. In diesem Buch werden Fragestellungen rund um die schulpraktischen Studien im Rahmen der Lehrkräftebildung an der Universität Bamberg diskutiert. Aus Anlass des Abschlusses des Projekts SchulPrax (Weiterentwicklung schulpraktischer Studien), das im Bamberger WegE-Projekt der Qualitätsoffensive Lehrerbildung initiiert worden war, ist eine Sammlung von Beiträgen unterschiedlicher an schulpraktischen Studien beteiligten Arbeitsgruppen entstanden. Dabei wird der Blick auf das Lernen Studierender im Praktikum und deren Begleitung durch Praktikumslehrkräfte gelenkt (Teil I) und anhand evidenzbasierter Modelle die wissenschaftlich fundierten Weiterentwicklungen schulpraktischer Studien beschrieben (Teil II), beispielsweise durch die Begleitung von Praktika im Rahmen von E-Portfolios. Zudem werden (Teil III) Einblicke in Praktikumsvarianten verschiedener Unterrichtsfächer und konkrete Konzepte verschiedener allgemein- und fachdidaktischer sowie weiterer auf das Lehramt bezogener Praktika vorgestellt. Somit liefern die Beiträge Impulse zur Weiterentwicklung schulpraktischer Studien für einzelne Fächer und darüber hinaus. KW - Lehramt KW - Teacher training programme KW - Lehramtsstudium KW - Lehrerbildung KW - Praktikum KW - Kohärenz KW - Qualitätsoffensive KW - internships KW - coherence KW - quality initiative ER - TY - JOUR TI - Synchronized Shared Memory and Black-box Procedural Abstraction : Toward a Formal Semantics of Blech AU - Gretz, Friedrich AU - Grosch, Franz-Josef AU - Mendler, Michael AU - Scheele, Stephan PY - 2024 JO - ACM transactions on embedded computing systems : TECS VL - 23 IS - 5 SP - 1-45 PB - ACM Press CY - New York, NY SN - 1539-9087 DO - 10.1145/3571585 UR - https://fis.uni-bamberg.de/handle/uniba/93448 LA - eng ER - TY - JOUR TI - A Constructive State-based Semantics and Interpreter for a Synchronous Data-flow Language with State Machines AU - Colaço, Jean-Louis AU - Mendler, Michael AU - Pauget, Baptiste AU - Pouzet, Marc PY - 2023 JO - ACM transactions on embedded computing systems : TECS VL - 22 IS - 5s SP - 1-26 PB - ACM Press CY - New York, NY SN - 1539-9087 DO - 10.1145/3609131 UR - https://fis.uni-bamberg.de/handle/uniba/108553 LA - eng ER - TY - JOUR TI - FairCaipi : A Combination of Explanatory Interactive and Fair Machine Learning for Human and Machine Bias Reduction AU - Heidrich, Louisa AU - Slany, Emanuel AU - Scheele, Stephan AU - Schmid, Ute PY - 2023 JO - Machine learning and knowledge extraction VL - 5 IS - 4 SP - 1519-1538 PB - MDPI CY - Basel SN - 2504-4990 DO - 10.3390/make5040076 UR - https://fis.uni-bamberg.de/handle/uniba/94998 LA - eng AB - The rise of machine-learning applications in domains with critical end-user impact has led to a growing concern about the fairness of learned models, with the goal of avoiding biases that negatively impact specific demographic groups. Most existing bias-mitigation strategies adapt the importance of data instances during pre-processing. Since fairness is a contextual concept, we advocate for an interactive machine-learning approach that enables users to provide iterative feedback for model adaptation. Specifically, we propose to adapt the explanatory interactive machine-learning approach Caipi for fair machine learning. FairCaipi incorporates human feedback in the loop on predictions and explanations to improve the fairness of the model. Experimental results demonstrate that FairCaipi outperforms a state-of-the-art pre-processing bias mitigation strategy in terms of the fairness and the predictive performance of the resulting machine-learning model. We show that FairCaipi can both uncover and reduce bias in machine-learning models and allows us to detect human bias. KW - fair machine learning KW - explanatory and interactive machine learning ER - TY - CPAPER TI - Studentische E-Portfolio-Nutzung : Begleitung der Entwicklung und Einführung von Mahara an der Universität Bamberg AU - Eisenmann, Rahel AU - Sticht, Martin AU - Hirmer, Tobias AU - Henrich, Andreas AU - Scheunpflug, Annette PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-56143 UR - https://fis.uni-bamberg.de/handle/uniba/56143 LA - deu AB - Durch die Einführung und Etablierung der Plattform Mahara, welche die Erstellung von E-Portfolios ermöglicht, soll an der Otto-Friedrich-Universität Bamberg individuelles Lernen langfristig digital etabliert und unterstützt werden. Erste E-Portfolios wurden im Sommersemester 2022 in verschiedenen Studiengängen mit unterschiedlichen Herangehensweisen umgesetzt. Das Poster zeigt wichtige Designentscheidungen und Meilensteine der technischen und didaktischen Umsetzung einer universitätsweiten E-Portfolio-Lösung auf. Die unterschiedlichen Anwendungsfälle werden kurz charakterisiert und erste Ergebnisse einer Evaluation dargestellt. KW - E-Portfolio KW - Mahara KW - Erfahrungsbericht ER - TY - CPAPER TI - The Došen Square Under Construction : A Tale of Four Modalities AU - Mendler, Michael AU - Scheele, Stephan AU - Burke, Luke PY - 2021 T2 - Automated Reasoning with Analytic Tableaux and Related Methods : 30th International Conference, TABLEAUX 2021 Birmingham, UK, September 6–9, 2021 Proceedings SP - 446-465 PB - Springer CY - Cham T3 - Lecture Notes in Artificial Intelligence SN - 978-3-030-86058-5 DO - 10.1007/978-3-030-86059-2_26 UR - https://fis.uni-bamberg.de/handle/uniba/111259 LA - eng ER - TY - CPAPER TI - Synchronised Shared Memory and Model Checking : A Proof of Concept AU - Aguado, Joaquin AU - Duenas, Alejandra PY - 2021 T2 - 2021 Forum on specification & Design Languages (FDL) SP - 01-08 PB - IEEE SN - 978-1-6654-1825-6 DO - 10.1109/fdl53530.2021.9568373 UR - https://fis.uni-bamberg.de/handle/uniba/111238 LA - eng ER - TY - JOUR TI - Toward Object-oriented Modeling in SCCharts AU - Schulz-Rosengarten, Alexander AU - Smyth, Steven AU - Mendler, Michael PY - 2021 JO - ACM transactions on embedded computing systems VL - 20 IS - 4 SP - 1-26 PB - ACM Press CY - New York, NY SN - 1558-3465 DO - 10.1145/3453482 UR - https://fis.uni-bamberg.de/handle/uniba/111171 LA - eng 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 - BOOK TI - A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52663 UR - https://fis.uni-bamberg.de/handle/uniba/44332 LA - eng ER - TY - CPAPER TI - An asynchronous process algebra with multiple clocks AU - Andersen, Henrik Reif AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52645 UR - https://fis.uni-bamberg.de/handle/uniba/44320 LA - eng AB - - KW - - ER - TY - CPAPER TI - Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52666 UR - https://fis.uni-bamberg.de/handle/uniba/44287 LA - eng AB - - KW - - ER - TY - CPAPER TI - Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente AU - Reinhardt, Tilmann AU - Mendler, Michael AU - Stroup, Terry PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52665 UR - https://fis.uni-bamberg.de/handle/uniba/44288 LA - eng AB - - KW - - ER - TY - JOUR TI - Compositional Characterization of Observable Program Properties AU - Steffen, B. AU - Barry Jay, C. AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52664 UR - https://fis.uni-bamberg.de/handle/uniba/44286 LA - deu ER - TY - JOUR TI - Newtonian Arbiters Cannot be Proven Correct AU - Mendler, Michael AU - Stroup, Terry PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52662 UR - https://fis.uni-bamberg.de/handle/uniba/44285 LA - eng ER - TY - JOUR TI - Multi-Agent Dialogues and Dialogue Sequents for Proof Search and Scheduling in Intuitionistic Logic and the Modal Logic S4 AU - Sticht, Martin PY - 2018 JO - Fundamenta Informaticae VL - 161 IS - 1/2, Special Issue on the 31Th Italian Conference on Computational Logic: CILC 2016 SP - 191-218 PB - IOS Press CY - Amsterdam [u.a.] SN - 0169-2968 DO - 10.3233/FI-2018-1700 UR - https://fis.uni-bamberg.de/handle/uniba/44251 LA - eng KW - dialogues, proof search, intuitionistic logic, modal logic, game theories, parallel reasoning ER - TY - THES TI - Proof Search in Multi-Agent Dialogues for Modal Logic AU - Sticht, Martin PY - 2018 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-599-4 DO - 10.20378/irbo-52527 UR - https://fis.uni-bamberg.de/handle/uniba/44248 LA - eng AB - In computer science, and also in philosophy, modal logics play an important role in various areas. They can be used to model knowledge structures among software-agents, behaviour of computer systems, or ontologies. They also provide mathematical tools to perform reasoning in these models, e.g., to extract common knowledge of agents, check whether security-relevant problems might occur when running a program, or to detect contradictions in a set of terminological definitions. Intuitionistic or constructive propositional logic can be considered as a special kind of modal logic. Constructive modal logics, as a combination of intuitionistic propositional logic and classical modal logics, describe a family of modal systems which are, compared to the classical variant, more restrictive concerning the validity of formulas. To prove validity of a statement formalized in such a logic, various reasoning procedures (also called calculi) have been investigated. There are especially many variants of sequent and tableau systems which can be used easily to find proofs by applying given syntactical rules one after another. Sometimes there are different possibilities to find a proof for the same formula within the same calculus. It also happens that a bad choice of non-invertible rule applications at the wrong time makes it impossible to finish the proof successfully, although the formula is provable. For this reason, a normalization of deductions in a calculus is desired. This restricts the possibilities to apply rules arbitrarily and emphasizes the situations in which significant, non-invertible rule applications are necessary. Such a normalization is enforced in so-called focused sequent systems. Another attempt to find a normalized calculus leads to dialogical logic, a game-theoretic reasoning technique. Usually, two players, one proponent and one opponent, argue about an assertion, expressed as a formula and stated by the proponent at the beginning of the play. The kinds of arguments, namely attacks and defences, are bound to special game rules. These are designed in such a way that the proponent has a winning strategy in the game if and only if his initial statement is a valid formula. The dialogical approach is very flexible as the game rules can be adjusted easily. Sets of rules exist to perform reasoning in many different kinds of logic, however proving soundness and completeness of dialogical calculi is complex and, if at all, often only considered very roughly in the literature. The standard two-player dialogues do not have much potential to enforce normalization like focus sequent systems. However, it turns out that introducing further proponent-players who fight against one opponent in a round-based setting leads to a normalization as described above. The flexibility of two-player games is largely preserved in multi-proponent dialogues. Other ordinary sequent systems can easily be transferred into the dialectic setting to achieve a normalization. Further, the round-based scheduling induces a method to parallelize the reasoning process. Modifying the game rules makes it possible to construct new intermediate or even more restrictive logics. In this work, dialogical systems with multiple proponents are presented for intuitionistic propositional logic and modal logics S4 and CS4. Starting with the former one, it is shown that the normalization can be transferred easily to both the latter systems. Informal game rules are introduced and, to make them concrete and unambiguous, translated into the dialogical sequent-style calculi DiaSeqI, DiaSeqS4, and DiaSeqCS4. An extra system for intuitionistic logic, which guarantees termination in proof searches, even if the target formula is not valid, is also provided. Soundness and completeness of all these presented dialogical sequent calculi is proven formally, by showing that it is always possible to translate derivations in the game-oriented approach into another sound and complete sequent system and vice versa. Thereby, a new (ordinary) multi-conclusion sequent calculus for CS4 is introduced for which adequateness is shown, too. The multi-proponent dialogical systems of this work are compared to different sequent calculi and other dialogical attempts found in literature. A comprehensive survey of such approaches is also part of this thesis. ER - TY - GEN TI - Denotational Fixed Point Semantics for Constructive Scheduling of Synchronous Concurrency AU - Mendler, Michael AU - von Hanxleden, Reinhard AU - Fuhrmann, Insa AU - Aguado, Joaquín PY - 2016 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/21713 LA - eng AB - The synchronous model of concurrent computation (SMoCC) is well established for programming languages in the domain of safety-critical reactive and embedded systems. Translated into mainstream C/Java programming, the SMoCC corresponds to a cyclic execution model in which concurrent threads are synchronised on a logical clock that cuts system computation into a sequence of macro-steps. A causality analysis verifies the existence of a schedule on memory accesses to ensure each macro-step is deadlock-free and determinate. We introduce an abstract semantic domain I(D,P) and an associated denotational fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. We use this domain for a new and extended behavioural definition of Berry’s causality analysis in terms of approximation intervals. The domain I(D,P) extends the domain I(D) from our previous work and fixes a mistake in the treatment of initialisations. Based on this fixed point semantics the notion of Input Berry-constructiveness (IBC) for synchronous programs is proposed. This new IBC class lies properly between strong (SBC) and normal Berry-constructiveness (BC) defined in previous work. SBC and BC are two ways to interpret the standard constructive semantics of synchronous programming, as exemplified by imperative SMoCC languages such as Esterel or Quartz. SBC is often too restrictive as it requires all variables to be initialised by the program. BC can be too permissive because it initialises all variables to a fixed value, by default. Where the initialisation happens through the memory, e.g., when carrying values from one synchronous tick to the next, then IBC is more appropriate. IBC links two levels of execution, the macro-step level and the micro-step level. We prove that the denotational fixed point analysis for IBC, and hence Berry’s causality analysis, is sound with respect to operational micro-level scheduling. The denotational model can thus be viewed as a compositional presentation of a synchronous scheduling strategy that ensures reactiveness and determinacy for imperative concurrent programming. KW - Denotational semantics KW - concurrency KW - determinism KW - constructiveness KW - Mealy reactive systems, synchronous programming, Esterel ER - TY - THES TI - Model and Proof Theory of Constructive ALC : constructive Description Logics AU - Scheele, Stephan PY - 2015 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-320-4 DO - 10.20378/irb-21626 UR - https://fis.uni-bamberg.de/handle/uniba/21626 LA - eng AB - Description logics (DLs) represent a widely studied logical formalism with a significant impact in the field of knowledge representation and the Semantic Web. However, they are equipped with a classical descriptive semantics that is characterised by a platonic notion of truth, being insufficiently expressive to deal with evolving and incomplete information, as from data streams or ongoing processes. Such partially determined and incomplete knowledge can be expressed by relying on a constructive semantics. This thesis investigates the model and proof theory of a constructive variant of the basic description logic ALC, called cALC. The semantic dimension of constructive DLs is investigated by replacing the classical binary truth interpretation of ALC with a constructive notion of truth. This semantic characterisation is crucial to represent applications with partial information adequately, and to achieve both consistency under abstraction as well as robustness under refinement, and on the other hand is compatible with the Curry-Howard isomorphism in order to form the cornerstone for a DL-based type theory. The proof theory of cALC is investigated by giving a sound and complete Hilbert-style axiomatisation, a Gentzen-style sequent calculus and a labelled tableau calculus showing finite model property and decidability. Moreover, cALC can be strengthened towards normal intuitionistic modal logics and classical ALC in terms of sound and complete extensions and hereby forms a starting point for the systematic investigation of a constructive correspondence theory. KW - Constructive Logic, Description Logic, Curry-Howard, Gentzen Tableau, Modal Logic ER - TY - CPAPER TI - SCCharts : Sequentially constructive statecharts for safety-critical applications ; HW/SW-Synthesis for a Conservative Extension of Synchronous Statecharts AU - von Hanxleden, Reinhard AU - Duderstadt, Björn AU - Motika, Christian AU - Smyth, Steven AU - Mendler, Michael AU - Aguado, Joaquin AU - Mercer, Stephen AU - O'Brien, Owen PY - 2014 T2 - PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation SP - 372-383 PB - ACM CY - New York, NY, USA SN - 978-1-4503-2784-8 DO - 10.1145/2594291.2594310 UR - https://fis.uni-bamberg.de/handle/uniba/21163 LA - eng ER - TY - JOUR TI - On the Computational Interpretation of CKn for Contextual Information Processing AU - Mendler, Michael AU - Scheele, Stephan PY - 2014 JO - Fundamenta Informaticae VL - 130 IS - 1 SP - 125-162 PB - IOS Press CY - Amsterdam SN - 0169-2968 UR - https://fis.uni-bamberg.de/handle/uniba/21154 LA - eng ER - TY - CPAPER TI - Grounding Synchronous Deterministic Concurrency in Sequential Programming AU - Aguado, Joaquin AU - Mendler, Michael AU - von Hanxleden, Reinhard AU - Fuhrmann, Insa ED - Shao, Zhong PY - 2014 T2 - Programming languages and systems : 23rd European Symposium on Programming, ESOP 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5 - 13, 2014 ; proceedings SP - 229-248 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-54832-1 DO - 10.1007/978-3-642-54833-8_13 UR - https://fis.uni-bamberg.de/handle/uniba/21129 LA - eng ER - TY - BOOK TI - Grounding Synchronous Deterministic Concurrency in Sequential Programming AU - Aguado, Joaquín AU - Mendler, Michael AU - Von Hanxleden, Reinhard AU - Fuhrmann, Insa PY - 2014 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/20793 LA - eng AB - In this report, we introduce an abstract interval domain I(D; P) and associated fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. The interval domain captures must (lower bound) and cannot (upper bound) information to approximate the synchronisation status of variables consisting of a value status D and an init status P. We use this domain for a new behavioural definition of Berry’s causality analysis for Esterel. This gives a compact and uniform understanding of Esterel-style constructiveness for shared-memory multi-threaded programs. Using this new domain-theoretic characterisation we show that Berry’s constructive semantics is a conservative approximation of the recently proposed sequentially constructive (SC) model of computation. We prove that every Berry-constructive program is sequentially constructive, i.e., deterministic and deadlock-free under sequentially admissible scheduling. This gives, for the first time, a natural interpretation of Berry-constructiveness for main-stream imperative programming in terms of scheduling, where previous results were cast in terms of synchronous circuits. It also opens the door to a direct mapping of Esterel’s signal mechanism into boolean variables that can be set and reset arbitrarily within a tick. We illustrate the practical usefulness of this mapping by discussing how signal reincarnation is handled efficiently by this transformation, which is of complexity that is linear in program KW - Concurrency KW - determinism KW - constructiveness KW - Mealy reactive systems KW - synchronous programming ER - TY - GEN TI - On the Computational Interpretation of CKn for Contextual Information Processing : Ancillary Material AU - Scheele, Stephan AU - Mendler, Michael PY - 2014 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/6157 LA - eng AB - In the journal article we introduce a modal λ-calculus λCKn whose type system corresponds to the constructive multi-modal logic CKn. This logic is a constructive refinement of the classical multi-modal logic CKn which forms the heart of the class of description logics used in semantic information processing. λCKn constitutes the core of a functional language for information processing in this application domain. Being strongly typed, it offers static type checking to support safe contextual reasoning in relational structures like those treated by description logics. Here we provide detailed mathematical proofs for the results presented in [8]. Accordingly, this report is not meant as a self-contained technical exposition of the whys and hows of λCKn. It is merely a collection of ancillary material to complement the main article [8] to which the reader is referred for more information. An early version of this work appeared at the 3rd International Workshop on Logics, Agents and Mobility (LAM 2010). We are grateful for the support by the German Research Council (DFG) who funded this research as part of the project SPACMODL under grant No. ME 1427/4-1. ER - TY - CPAPER TI - Sequentially constructive concurrency : A conservative extension of the synchronous model of computation AU - Hanxleden, Reinhard von AU - Mendler, Michael AU - Aguado, Joaquin AU - Duderstadt, Björn AU - Fuhrmann, Insa AU - Motika, Christian AU - Mercer, Stephen AU - O'Brien, Owen PY - 2013 T2 - European Design Automation Association: 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE 2013) : Grenoble, France, 18 - 22 March 2013 ; Proceedings SP - 581-586 PB - IEEE CY - Piscataway, NJ SN - 978-1-4673-5071-6 DO - 10.7873/DATE.2013.128 UR - https://fis.uni-bamberg.de/handle/uniba/21189 LA - eng ER - TY - CHAP TI - How similar is what I get to what I want : Matchmaking for Mobility Support AU - Schmid, Ute AU - Berle, Lukas AU - Munz, Michael AU - Stein, Klaus AU - Sticht, Martin PY - 2013 T2 - Computational Approaches to Analogical Reasoning : Current Trends SP - 263-287 PB - Springer CY - Berlin T3 - Studies in Computational Intelligence SN - 978-3642545153 UR - https://fis.uni-bamberg.de/handle/uniba/2734 LA - eng ER - TY - JOUR TI - Constructive Boolean circuits and the exactness of timed ternary simulation AU - Mendler, Michael AU - Shiple, Thomas R. AU - Berry, Gérard PY - 2012 JO - Formal methods in system design : an international journal VL - 40 IS - 3 SP - 283-329 PB - Springer CY - Dordrecht [u.a.] SN - 0925-9856 DO - 10.1007/s10703-012-0144-6 UR - https://fis.uni-bamberg.de/handle/uniba/1113 LA - eng ER - TY - CPAPER TI - Matchmaking: How similar is what I want to what I get? AU - Munz, Michael AU - Stein, Klaus AU - Sticht, Martin AU - Schmid, Ute PY - 2012 T2 - Working Papers of the 1st International Workshop on Similarity and Analogy-based Methods in AI, SAMAI 2012, August 27, 2012 - Montpellier (France) SP - 13-18 PB - IRIT CY - Toulouse UR - https://fis.uni-bamberg.de/handle/uniba/1018 LA - eng ER - TY - CPAPER TI - Computing with streams AU - Aguado, Joaquín AU - Mendler, Michael PY - 2011 T2 - DAMP '11 Proceedings of the sixth workshop on Declarative aspects of multicore programming ; Austin, Texas, 23 Jan 2011 SP - 35-44 CY - New York, NY UR - https://fis.uni-bamberg.de/handle/uniba/5492 LA - eng ER - TY - JOUR TI - Constructive semantics for instantaneous reactions AU - Aguado, Joaquín AU - Mendler, Michael PY - 2011 JO - Theoretical computer science : the journal of the EATCS VL - 412 IS - 11 SP - 931 - 961 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/5450 LA - eng ER - TY - JOUR TI - Cut-free Gentzen Calculus for Multimodal CK AU - Mendler, Michael AU - Scheele, Stephan PY - 2011 JO - Information and computation VL - 209 IS - 12, December 2011: Intuitionistic Modal Logic and Applications (IMLA 2008) SP - 1435 - 1538 SN - 0890-5401 UR - https://fis.uni-bamberg.de/handle/uniba/5451 LA - eng ER - TY - CPAPER TI - Unifying Synchronous Data and Control Flow in the Lazy Lambda Calculus AU - Aguado, Joaquín AU - Mendler, Michael AU - Pouzet, Marc PY - 2011 T2 - Proceedings of the 23rd Nordic Workshop on Programming Theory, October 26 - 28, 2011, Västerås, Sweden (NWPT 2011) SP - 108 - 111 CY - Västerås, Sweden T3 - Technical report UR - https://fis.uni-bamberg.de/handle/uniba/5441 LA - eng ER - TY - CPAPER TI - An Algebra of Synchronous Scheduling Interfaces AU - Mendler, Michael PY - 2011 T2 - Foundations of Interface Technologies : (FIT 2010), Paris, 30th August 2010 SP - 28 - 48 CY - Paris UR - https://fis.uni-bamberg.de/handle/uniba/4266 LA - eng ER - TY - CPAPER TI - Towards Strategies for Dataflow Programming AU - Mendler, Michael AU - Aguado, Joaquín PY - 2010 T2 - Preproceedings of the 22nd Symposium on Implementation and Application of Functional Languages (IFL 2010) SP - 372 - 423 UR - https://fis.uni-bamberg.de/handle/uniba/4312 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 - THES TI - Die Seele im Gespräch mit sich selbst : Bewusstsein und die Fähigkeit zur Selbsterkenntnis und -veränderung AU - Zeißner, Georg PY - 2010 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Humanwissenschaften der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-005-0 DO - 10.20378/irb-270 UR - https://fis.uni-bamberg.de/handle/uniba/270 LA - deu AB - Die besondere Fähigkeit des Menschen, sich flexibel an neuartige und sich dynamisch verändernde Problemstellungen anzupassen, wird von zeitgenössischen psychologischen und neurowissenschaftlichen Menschenbildern nur unzureichend berücksichtigt. Nicht ohne Grund fällt diese konzeptionelle Lücke mit einer Neigung zusammen, das menschliche Bewusstsein bei der Erforschung des menschlichen Geistes auszuklammern oder als rein epiphänomenal zu behandeln. Dabei schließt dieses – im Sinne seiner grundsätzlichen Befähigung, über sich selbst zu reflektieren und sein Denken und Handeln im Einklang mit den so gewonnenen Erkenntnissen zu verändern, verstanden – genau die erwähnte Lücke. In der Tat existieren sowohl Theorien (Dörner, 1999) wie auch empirische Ergebnisse (Reither, 1979 sowie Tisdale, 1998), die einen engen Zusammenhang zwischen Bewusstsein und Problemlösegüte nahelegen. Zielsetzung der vorliegenden Arbeit war es, die Tätigkeit dieser bewussten Handlungskontrolle im Detail zu beobachten, um deren Bedingungen und Erscheinungsformen genauer herausarbeiten zu können. Sechzehn Versuchspersonen wurden mit einem Versuchsparcours aus drei Versuchsteilen konfrontiert: Dem Führen einer fiktiven Farm in einem einfachen computersimulierten ökologischen System, der Bearbeitung von Entscheidungsszenarien sowie dem Deuten und Bewerten von Sprichwörtern. Dabei hielt der Versuchsleiter die Probanden dazu an, ihre Gedanken laut auszusprechen, damit er die Entwicklung des Problemlöseprozesses online verfolgen konnte. Acht Probanden wurden als Eckfälle ausgewählt und ihre Versuchsdaten einer Einzelfallanalyse unterzogen. Für die Eckfälle konnten Theorien entwickelt werden, die den individuellen Verlauf der Computersimulation erklären. Die verschiedenen Episoden im Simulationsverlauf, an denen die Probanden sich und ihre Problemlösebemühungen immer wieder in den Blick nahmen, leisteten hierbei einen besonders großen Erklärungsbeitrag. Sie wurden in einem weiteren Schritt probandenübergreifend betrachtet, geordnet und in Beziehung gesetzt. Die resultierende Theorie ist in der Lage, die Stellen des Vorkommens, sowie den Inhalt und die Auswirkungen dieser bewussten Episoden in Abhängigkeit von der jeweiligen Situation und der Persönlichkeit des Probanden zu erklären. In einer abschließenden Prüfung durch Triangulation und Modellierung am Rechner hat sich diese Theorie bewährt. KW - Bewusstsein , PSI-Theorie , komplexe Probleme , Selbstreflexion , Besonnenheit KW - consciousness , PSI-theory , complex problem-solving , self-reflection , deliberateness KW - Bewusstsein KW - PSI-Theorie KW - komplexe Probleme KW - Selbstreflexion KW - Besonnenheit KW - consciousness KW - PSI-theory KW - complex problem-solving KW - self-reflection KW - deliberateness ER - TY - GEN TI - Electronic Notes in Theoretical Computer Science ED - Aguado, Joaquin ED - Mendler, Michael PY - 2008 VL - 203 IS - 4, Proceedings of the International Workshop on Model-driven High-level Programming of Embedded Systems (SLA++P 2007), Braga, Portugal, 31 March 2007 SP - 1 - 140 SN - 1571-0661 UR - https://fis.uni-bamberg.de/handle/uniba/18126 LA - eng ER - TY - CPAPER TI - Constructive Description Logic cALC as a Type System for Semantic Streams in the Domain of Auditing AU - Mendler, Michael AU - Scheele, Stephan PY - 2008 T2 - Proceedings of the 1st International Workshop on Logics for Agents and Mobility 2008 PB - Bibliothek des Dep. Informatik, Univ. CY - Hamburg UR - https://fis.uni-bamberg.de/handle/uniba/18088 LA - eng ER - TY - CPAPER TI - Towards Constructive DL for Abstraction and Refinement AU - Mendler, Michael AU - Scheele, Stephan PY - 2008 T2 - Proceedings of the 21th ... ; (DL 2008), Dresden, May 13 - 16, 2008 SP - 1 - 11 UR - https://fis.uni-bamberg.de/handle/uniba/18094 LA - eng ER - TY - JOUR TI - WCRT Algebra and Scheduling Interfaces for Esterel- style Synchronous Multithreading AU - Hanxleden, R. von AU - Mendler, Michael AU - Traulsen, C. PY - 2008 JO - Technical Report IS - Nr. 0807, vom 11 Juli 2008 SP - 3 - 37 UR - https://fis.uni-bamberg.de/handle/uniba/18093 LA - eng ER - TY - GEN TI - Towards Constructive Description Logics for Abstraction and Refinement AU - Scheele, Stephan AU - Mendler, Michael PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/6173 LA - eng AB - This work explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truth-value interpretation to a constructive interpretation. We argue that such a strengthened interpretation is essential to represent applications with partial information adequately and to achieve consistency under abstraction as well as robustness under refinement. We introduce a constructive version of ALC, called cALC, for which we give a sound and complete Hilbert axiomatisation and a Gentzen tableau calculus showing finite model property and decidability. 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 - Model-driven high-level programming of embedded systems : SLA++P 2007 ; proceedings ; satellite workshop to the tenth European Joint Conferences on Theory and Practice of Software (ETAPS 2007), Braga, Portugal, March 31, 2007 ED - Aguado, Joaquin ED - Mendler, Michael PY - 2007 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/15261 LA - eng ER - TY - RPRT TI - The Synchrony Hypothesis or the Importance of Being Constructive AU - Mendler, Michael PY - 2006 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/18092 LA - eng ER - TY - BOOK TI - Constructive circuits and the exactness of ternary simulation AU - Mendler, Michael AU - Shiple, Thomas R. AU - Berry, Gérard PY - 2006 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/14022 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 - BOOK TI - Constructive semantics for instantaneous reactions AU - Aguado, Joaquin AU - Mendler, Michael PY - 2005 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/12313 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 - JOUR TI - Modalities in constructive modal logics and type theories AU - De Paiva, V, AU - Gore, R. AU - Mendler, Michael PY - 2004 JO - Journal of logic and computation VL - 14 IS - 4 SP - 439 - 446 SN - 0955-792X UR - https://fis.uni-bamberg.de/handle/uniba/12846 LA - eng ER - TY - GEN TI - Formal aspects of computing : the international journal of formal methods AU - Mendler, Michael PY - 2004 PB - Springer CY - London u.a. UR - https://fis.uni-bamberg.de/handle/uniba/10079 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 - JOUR TI - Intensional completeness in an extension of Goedel- Dummett logic AU - Fairtlough, M. AU - Mendler, Michael PY - 2003 JO - Studia logica : an international journal for symbolic logic VL - 73 IS - 1 SP - 51 - 80 SN - 0039-3215 UR - https://fis.uni-bamberg.de/handle/uniba/9779 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 - CPAPER TI - On the logical content of computational type theory: A solution to Curry's problem AU - Fairtlough, M. AU - Mendler, Michael PY - 2002 T2 - Types for proofs and programs : international workshop, TYPES 2000, Durham, UK, December 8 - 12, 2000 ; selected papers SP - 63 - 78 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9776 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 - TY - CPAPER TI - Intuitionistic modal logic and applications : (IMLA ' 02) ; workshop proceedings ; LICS Satellite Workshop to the 3rd Federated Logic Conference (FLoC'02), Copenhagen, DK, 26 July 2002 AU - Mendler, Michael ED - Goré, Rajeev ED - Mendler, Michael PY - 2002 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/7837 LA - eng ER - TY - CPAPER TI - Proofs as constraints for abstraction and refinement AU - Cheng, Xiaochun AU - Fairtlough, Matt AU - Mendler, Michael PY - 2001 T2 - Workshop on Proof Transformations, Proof Presentations and Complexities of Proof (PTP-01 Siena, Universitá degli Studi di Siena, Dipartimento di Ingegneria dell'Informatione June 19, 2001, in connection with IJCAR 2001) SP - 1 - 11 CY - Siena UR - https://fis.uni-bamberg.de/handle/uniba/10127 LA - eng ER - TY - JOUR TI - Special Issue: Modalities in Type Theory AU - Mendler, Michael AU - Fairtlough, Matt AU - Moggi, Eugenio PY - 2001 JO - Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science VL - 11 IS - 4 SP - 507-596 PB - Cambridge Univ. Press CY - Cambridge DO - 10.1017/S0960129501003310 UR - https://fis.uni-bamberg.de/handle/uniba/10075 LA - deu ER - TY - CPAPER TI - Abstraction and refinement in higher order logic AU - Fairtlough, M. AU - Mendler, Michael AU - Cheng, X. PY - 2001 T2 - Theorem proving in higher order logics : 14th international conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3 - 6, 2001 ; proceedings SP - 201 - 216 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9820 LA - eng ER - TY - CPAPER TI - Categorical and Kripke semantics for constructive S4 modal logic AU - Alechina, N. AU - Mendler, Michael AU - De Paiva, V, AU - Ritter, E. PY - 2001 T2 - Computer science logic : 15th international workshop, CSL 2001, 10th annual conference of the EACSL Paris, France, September 10 - 13, 2001 ;proceedings SP - 292 - 307 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9774 LA - eng ER - TY - JOUR TI - Modalities in type theory AU - Mendler, Michael PY - 2001 JO - Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science VL - 11 IS - 4 SP - 507 - 509 SN - 0960-1295 UR - https://fis.uni-bamberg.de/handle/uniba/9780 LA - deu ER - TY - CPAPER TI - An asynchronous process algebra with multiple clocks AU - Andersen, Henrik Reif AU - Mendler, Michael PY - 1994 T2 - Programming languages and systems : proceedings ; ESOP '94, 5th European Symposium on Programming, Edinburgh, UK, April 11 - 13, 1994 SP - 58-73 PB - Springer CY - Berlin ; Heidelberg T3 - Lecture notes in computer science SN - 978-3-540-57880-2 UR - https://fis.uni-bamberg.de/handle/uniba/104022 LA - eng AB - - KW - - ER - TY - JOUR TI - Newtonian Arbiters Cannot be Proven Correct AU - Mendler, Michael AU - Stroup, Terry PY - 1993 JO - Formal Methods in System Design VL - 3 IS - 3 SP - 233-257 PB - Kluwer CY - Dordrecht [u.a.] SN - 1572-8102 UR - https://fis.uni-bamberg.de/handle/uniba/56619 LA - eng ER - TY - CPAPER TI - Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente AU - Reinhardt, Tilmann AU - Mendler, Michael AU - Stroup, Terry PY - 1992 T2 - Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme : Vorträge der ITG-Fachtagung am 23. und 24. November 1992 in Darmstadt SP - 273-274 PB - vde-Verl. CY - Berlin ; Offenbach T3 - Informationstechnische Gesellschaft: ITG-Fachbericht SN - 978-3-8007-1905-1 UR - https://fis.uni-bamberg.de/handle/uniba/104020 LA - deu AB - - KW - - ER - TY - JOUR TI - Compositional Characterization of Observable Program Properties AU - Steffen, B. AU - Barry Jay, C. AU - Mendler, Michael PY - 1992 JO - Theoretical informatics and applications VL - 26 IS - 5 SP - 403-424 PB - EDP Sciences CY - Cambridge, Massachusetts, USA SN - 0988-3754 DO - 10.1051/ita/1992260504031 UR - https://fis.uni-bamberg.de/handle/uniba/56620 LA - deu ER - TY - CPAPER TI - Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 1991 T2 - Designing Correct Circuits : Workshop jointly organised by the Universities of Oxford and Glasgow, 26–28 September 1990, Oxford SP - 1-28 PB - Springer CY - London u.a. SN - 978-1-4471-3544-9 UR - https://fis.uni-bamberg.de/handle/uniba/104019 LA - eng AB - - KW - - ER -