@article{aguado2024_107767,
  title = {Synchronised Shared Memory and Model Checking},
  author = {Aguado, Joaquín and Duenas, Alejandra},
  year = {2024},
  journal = {ACM transactions on embedded computing systems : TECS},
  volume = {23},
  number = {5, 70},
  pages = {1-30},
  publisher = {ACM Press},
  address = {New York, NY},
  issn = {1558-3465},
  doi = {10.1145/3626188},
  url = {https://fis.uni-bamberg.de/handle/uniba/107767},
  language = {eng}
}

@book{grotzbach2024_95393,
  title = {Schulpraktische Studien an der Universität Bamberg : Impulse für die Lehrkräftebildung},
  author = {Grötzbach, Daniel and Niehaus, Johanna and Beer, Christof and Rübben, Ricarda and Hirmer, Tobias and Sticht, Martin and Timm, Susanne and Summer, Theresa and Schnellbögl, Claudia and Kraus, Birgit and Schwarzl, Cordula and Plötz, Evi and Lindner, Konstantin and Steinweg, Anna Susanne and Treiber, Eva and Meidel, Eva and Mayer, Florian and Franz, Ute and Groh, Nicola and Kleber, Angelika and Anderka, Angela},
  editor = {Plötz, Evi and Summer, Theresa and Grötzbach, Daniel and Drechsel, Barbara},
  year = {2024},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Forum Lehrerinnen- und Lehrerbildung},
  isbn = {978-3-86309-969-5},
  doi = {10.20378/irb-95393},
  urn = {urn:nbn:de:bvb:473-irb-953934},
  url = {https://fis.uni-bamberg.de/handle/uniba/95393},
  language = {deu},
  abstract = {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.},
  keywords = {Lehramt, Teacher training programme, Lehramtsstudium, Lehrerbildung, Praktikum, Kohärenz, Qualitätsoffensive, internships, coherence, quality initiative}
}

@article{gretz2024_93448,
  title = {Synchronized Shared Memory and Black-box Procedural Abstraction : Toward a Formal Semantics of Blech},
  author = {Gretz, Friedrich and Grosch, Franz-Josef and Mendler, Michael and Scheele, Stephan},
  year = {2024},
  journal = {ACM transactions on embedded computing systems : TECS},
  volume = {23},
  number = {5},
  pages = {1-45},
  publisher = {ACM Press},
  address = {New York, NY},
  issn = {1539-9087},
  doi = {10.1145/3571585},
  url = {https://fis.uni-bamberg.de/handle/uniba/93448},
  language = {eng}
}

@article{colaco2023_108553,
  title = {A Constructive State-based Semantics and Interpreter for a Synchronous Data-flow Language with State Machines},
  author = {Colaço, Jean-Louis and Mendler, Michael and Pauget, Baptiste and Pouzet, Marc},
  year = {2023},
  journal = {ACM transactions on embedded computing systems : TECS},
  volume = {22},
  number = {5s},
  pages = {1-26},
  publisher = {ACM Press},
  address = {New York, NY},
  issn = {1539-9087},
  doi = {10.1145/3609131},
  url = {https://fis.uni-bamberg.de/handle/uniba/108553},
  language = {eng}
}

@article{heidrich2023_94998,
  title = {FairCaipi : A Combination of Explanatory Interactive and Fair Machine Learning for Human and Machine Bias Reduction},
  author = {Heidrich, Louisa and Slany, Emanuel and Scheele, Stephan and Schmid, Ute},
  year = {2023},
  journal = {Machine learning and knowledge extraction},
  volume = {5},
  number = {4},
  pages = {1519-1538},
  publisher = {MDPI},
  address = {Basel},
  issn = {2504-4990},
  doi = {10.3390/make5040076},
  url = {https://fis.uni-bamberg.de/handle/uniba/94998},
  language = {eng},
  abstract = {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.},
  keywords = {fair machine learning, explanatory and interactive machine learning}
}

@inproceedings{eisenmann2022_56143,
  title = {Studentische E-Portfolio-Nutzung : Begleitung der Entwicklung und Einführung von Mahara an der Universität Bamberg},
  author = {Eisenmann, Rahel and Sticht, Martin and Hirmer, Tobias and Henrich, Andreas and Scheunpflug, Annette},
  year = {2022},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-56143},
  urn = {urn:nbn:de:bvb:473-irb-561437},
  url = {https://fis.uni-bamberg.de/handle/uniba/56143},
  language = {deu},
  abstract = {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.},
  keywords = {E-Portfolio, Mahara, Erfahrungsbericht}
}

@inproceedings{mendler2021_111259,
  title = {The Došen Square Under Construction : A Tale of Four Modalities},
  author = {Mendler, Michael and Scheele, Stephan and Burke, Luke},
  year = {2021},
  booktitle = {Automated Reasoning with Analytic Tableaux and Related Methods : 30th International Conference, TABLEAUX 2021 Birmingham, UK, September 6–9, 2021 Proceedings},
  pages = {446-465},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Artificial Intelligence},
  isbn = {978-3-030-86058-5},
  doi = {10.1007/978-3-030-86059-2\_26},
  url = {https://fis.uni-bamberg.de/handle/uniba/111259},
  language = {eng}
}

@inproceedings{aguado2021_111238,
  title = {Synchronised Shared Memory and Model Checking : A Proof of Concept},
  author = {Aguado, Joaquin and Duenas, Alejandra},
  year = {2021},
  booktitle = {2021 Forum on specification \& Design Languages (FDL)},
  pages = {01-08},
  publisher = {IEEE},
  isbn = {978-1-6654-1825-6},
  doi = {10.1109/fdl53530.2021.9568373},
  url = {https://fis.uni-bamberg.de/handle/uniba/111238},
  language = {eng}
}

@article{schulzrosengarten2021_111171,
  title = {Toward Object-oriented Modeling in SCCharts},
  author = {Schulz-Rosengarten, Alexander and Smyth, Steven and Mendler, Michael},
  year = {2021},
  journal = {ACM transactions on embedded computing systems},
  volume = {20},
  number = {4},
  pages = {1-26},
  publisher = {ACM Press},
  address = {New York, NY},
  issn = {1558-3465},
  doi = {10.1145/3453482},
  url = {https://fis.uni-bamberg.de/handle/uniba/111171},
  language = {eng}
}

@inproceedings{gretz2020_112860,
  title = {Synchronized Shared Memory and Procedural Abstraction : Towards a Formal Semantics of Blech},
  author = {Gretz, F. and Grosch, F-J. and Mendler, M. and Scheele, S.},
  year = {2020},
  booktitle = {Proceedings of the 2020 Forum on specification \& Design Languages (FDL)},
  publisher = {IEEE},
  address = {Piscataway, New Jersey},
  isbn = {978-1-7281-8928-4},
  doi = {10.1109/fdl50818.2020.9232942},
  url = {https://fis.uni-bamberg.de/handle/uniba/112860},
  language = {eng}
}

@book{mendler2018_44332,
  title = {A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification},
  author = {Mendler, Michael},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52663},
  urn = {urn:nbn:de:bvb:473-opus4-526634},
  url = {https://fis.uni-bamberg.de/handle/uniba/44332},
  language = {eng}
}

@inproceedings{andersen2018_44320,
  title = {An asynchronous process algebra with multiple clocks},
  author = {Andersen, Henrik Reif and Mendler, Michael},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52645},
  urn = {urn:nbn:de:bvb:473-opus4-526456},
  url = {https://fis.uni-bamberg.de/handle/uniba/44320},
  language = {eng},
  abstract = {-},
  keywords = {-}
}

@inproceedings{mendler2018_44287,
  title = {Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification},
  author = {Mendler, Michael},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52666},
  urn = {urn:nbn:de:bvb:473-opus4-526664},
  url = {https://fis.uni-bamberg.de/handle/uniba/44287},
  language = {eng},
  abstract = {-},
  keywords = {-}
}

@inproceedings{reinhardt2018_44288,
  title = {Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente},
  author = {Reinhardt, Tilmann and Mendler, Michael and Stroup, Terry},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52665},
  urn = {urn:nbn:de:bvb:473-opus4-526653},
  url = {https://fis.uni-bamberg.de/handle/uniba/44288},
  language = {eng},
  abstract = {-},
  keywords = {-}
}

@article{steffen2018_44286,
  title = {Compositional Characterization of Observable Program Properties},
  author = {Steffen, B. and Barry Jay, C. and Mendler, Michael},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52664},
  urn = {urn:nbn:de:bvb:473-opus4-526643},
  url = {https://fis.uni-bamberg.de/handle/uniba/44286},
  language = {deu}
}

@article{mendler2018_44285,
  title = {Newtonian Arbiters Cannot be Proven Correct},
  author = {Mendler, Michael and Stroup, Terry},
  year = {2018},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-52662},
  urn = {urn:nbn:de:bvb:473-opus4-526625},
  url = {https://fis.uni-bamberg.de/handle/uniba/44285},
  language = {eng}
}

@article{sticht2018_44251,
  title = {Multi-Agent Dialogues and Dialogue Sequents for Proof Search and Scheduling in Intuitionistic Logic and the Modal Logic S4},
  author = {Sticht, Martin},
  year = {2018},
  journal = {Fundamenta Informaticae},
  volume = {161},
  number = {1/2, Special Issue on the 31Th Italian Conference on Computational Logic: CILC 2016},
  pages = {191-218},
  publisher = {IOS Press},
  address = {Amsterdam [u.a.]},
  issn = {0169-2968},
  doi = {10.3233/FI-2018-1700},
  url = {https://fis.uni-bamberg.de/handle/uniba/44251},
  language = {eng},
  keywords = {dialogues, proof search, intuitionistic logic, modal logic, game theories, parallel reasoning}
}

@phdthesis{sticht2018_44248,
  title = {Proof Search in Multi-Agent Dialogues for Modal Logic},
  author = {Sticht, Martin},
  year = {2018},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg},
  isbn = {978-3-86309-599-4},
  doi = {10.20378/irbo-52527},
  urn = {urn:nbn:de:bvb:473-opus4-525276},
  url = {https://fis.uni-bamberg.de/handle/uniba/44248},
  language = {eng},
  abstract = {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.},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{mendler2016_21713,
  title = {Denotational Fixed Point Semantics for Constructive Scheduling of Synchronous Concurrency},
  author = {Mendler, Michael and von Hanxleden, Reinhard and Fuhrmann, Insa and Aguado, Joaquín},
  year = {2016},
  publisher = {opus},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  urn = {urn:nbn:de:bvb:473-opus4-265444},
  url = {https://fis.uni-bamberg.de/handle/uniba/21713},
  language = {eng},
  abstract = {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.},
  keywords = {Denotational semantics, concurrency, determinism, constructiveness, Mealy reactive systems, synchronous programming, Esterel}
}

@phdthesis{scheele2015_21626,
  title = {Model and Proof Theory of Constructive ALC : constructive Description Logics},
  author = {Scheele, Stephan},
  year = {2015},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg},
  isbn = {978-3-86309-320-4},
  doi = {10.20378/irb-21626},
  urn = {urn:nbn:de:bvb:473-opus4-264607},
  url = {https://fis.uni-bamberg.de/handle/uniba/21626},
  language = {eng},
  abstract = {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.},
  keywords = {Constructive Logic, Description Logic, Curry-Howard, Gentzen Tableau, Modal Logic},
  school = {Otto-Friedrich-Universität Bamberg}
}

@inproceedings{vonhanxleden2014_21163,
  title = {SCCharts : Sequentially constructive statecharts for safety-critical applications ; HW/SW-Synthesis for a Conservative Extension of Synchronous Statecharts},
  author = {von Hanxleden, Reinhard and Duderstadt, Björn and Motika, Christian and Smyth, Steven and Mendler, Michael and Aguado, Joaquin and Mercer, Stephen and O'Brien, Owen},
  year = {2014},
  booktitle = {PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation},
  pages = {372-383},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-2784-8},
  doi = {10.1145/2594291.2594310},
  url = {https://fis.uni-bamberg.de/handle/uniba/21163},
  language = {eng}
}

@article{mendler2014_21154,
  title = {On the Computational Interpretation of CKn for Contextual Information Processing},
  author = {Mendler, Michael and Scheele, Stephan},
  year = {2014},
  journal = {Fundamenta Informaticae},
  volume = {130},
  number = {1},
  pages = {125-162},
  publisher = {IOS Press},
  address = {Amsterdam},
  issn = {0169-2968},
  url = {https://fis.uni-bamberg.de/handle/uniba/21154},
  language = {eng}
}

@inproceedings{aguado2014_21129,
  title = {Grounding Synchronous Deterministic Concurrency in Sequential Programming},
  author = {Aguado, Joaquin and Mendler, Michael and von Hanxleden, Reinhard and Fuhrmann, Insa},
  editor = {Shao, Zhong},
  year = {2014},
  booktitle = {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},
  pages = {229-248},
  publisher = {Springer},
  address = {Berlin [u.a.]},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-642-54832-1},
  doi = {10.1007/978-3-642-54833-8\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/21129},
  language = {eng}
}

@book{aguado2014_20793,
  title = {Grounding Synchronous Deterministic Concurrency in Sequential Programming},
  author = {Aguado, Joaquín and Mendler, Michael and Von Hanxleden, Reinhard and Fuhrmann, Insa},
  year = {2014},
  publisher = {opus},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  urn = {urn:nbn:de:bvb:473-opus4-250905},
  url = {https://fis.uni-bamberg.de/handle/uniba/20793},
  language = {eng},
  abstract = {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},
  keywords = {Concurrency, determinism, constructiveness, Mealy reactive systems, synchronous  programming}
}

@misc{scheele2014_6157,
  title = {On the Computational Interpretation of CKn for Contextual Information Processing : Ancillary Material},
  author = {Scheele, Stephan and Mendler, Michael},
  year = {2014},
  publisher = {opus},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  urn = {urn:nbn:de:bvb:473-opus4-101139},
  url = {https://fis.uni-bamberg.de/handle/uniba/6157},
  language = {eng},
  abstract = {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.}
}

@inproceedings{hanxleden2013_21189,
  title = {Sequentially constructive concurrency : A conservative extension of the synchronous model of computation},
  author = {Hanxleden, Reinhard von and Mendler, Michael and Aguado, Joaquin and Duderstadt, Björn and Fuhrmann, Insa and Motika, Christian and Mercer, Stephen and O'Brien, Owen},
  year = {2013},
  booktitle = {European Design Automation Association: 2013 Design, Automation \& Test in Europe Conference \& Exhibition (DATE 2013) : Grenoble, France, 18 - 22 March 2013 ; Proceedings},
  pages = {581-586},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  isbn = {978-1-4673-5071-6},
  doi = {10.7873/DATE.2013.128},
  url = {https://fis.uni-bamberg.de/handle/uniba/21189},
  language = {eng}
}

@incollection{schmid2013_2734,
  title = {How similar is what I get to what I want : Matchmaking for Mobility Support},
  author = {Schmid, Ute and Berle, Lukas and Munz, Michael and Stein, Klaus and Sticht, Martin},
  year = {2013},
  booktitle = {Computational Approaches to Analogical Reasoning : Current Trends},
  pages = {263-287},
  publisher = {Springer},
  address = {Berlin},
  series = {Studies in Computational Intelligence},
  isbn = {978-3642545153},
  url = {https://fis.uni-bamberg.de/handle/uniba/2734},
  language = {eng}
}

@article{mendler2012_1113,
  title = {Constructive Boolean circuits and the exactness of timed ternary simulation},
  author = {Mendler, Michael and Shiple, Thomas R. and Berry, Gérard},
  year = {2012},
  journal = {Formal methods in system design : an international journal},
  volume = {40},
  number = {3},
  pages = {283-329},
  publisher = {Springer},
  address = {Dordrecht [u.a.]},
  issn = {0925-9856},
  doi = {10.1007/s10703-012-0144-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/1113},
  language = {eng}
}

@inproceedings{munz2012_1018,
  title = {Matchmaking: How similar is what I want to what I get?},
  author = {Munz, Michael and Stein, Klaus and Sticht, Martin and Schmid, Ute},
  year = {2012},
  booktitle = {Working Papers of the 1st International Workshop on Similarity and Analogy-based Methods in AI, SAMAI 2012, August 27, 2012 - Montpellier (France)},
  pages = {13-18},
  publisher = {IRIT},
  address = {Toulouse},
  url = {https://fis.uni-bamberg.de/handle/uniba/1018},
  language = {eng}
}

@inproceedings{aguado2011_5492,
  title = {Computing with streams},
  author = {Aguado, Joaquín and Mendler, Michael},
  year = {2011},
  booktitle = {DAMP '11 Proceedings of the sixth workshop on Declarative aspects of multicore programming ; Austin, Texas, 23 Jan 2011},
  pages = {35-44},
  address = {New York, NY},
  url = {https://fis.uni-bamberg.de/handle/uniba/5492},
  language = {eng}
}

@article{aguado2011_5450,
  title = {Constructive semantics for instantaneous reactions},
  author = {Aguado, Joaquín and Mendler, Michael},
  year = {2011},
  journal = {Theoretical computer science : the journal of the EATCS},
  volume = {412},
  number = {11},
  pages = {931 - 961},
  issn = {0304-3975},
  url = {https://fis.uni-bamberg.de/handle/uniba/5450},
  language = {eng}
}

@article{mendler2011_5451,
  title = {Cut-free Gentzen Calculus for Multimodal CK},
  author = {Mendler, Michael and Scheele, Stephan},
  year = {2011},
  journal = {Information and computation},
  volume = {209},
  number = {12, December 2011: Intuitionistic Modal Logic and Applications (IMLA 2008)},
  pages = {1435 - 1538},
  issn = {0890-5401},
  url = {https://fis.uni-bamberg.de/handle/uniba/5451},
  language = {eng}
}

@inproceedings{aguado2011_5441,
  title = {Unifying Synchronous Data and Control Flow in the Lazy Lambda Calculus},
  author = {Aguado, Joaquín and Mendler, Michael and Pouzet, Marc},
  year = {2011},
  booktitle = {Proceedings of the 23rd Nordic Workshop on Programming Theory, October 26 - 28, 2011, Västerås, Sweden (NWPT 2011)},
  pages = {108 - 111},
  address = {Västerås, Sweden},
  series = {Technical report},
  url = {https://fis.uni-bamberg.de/handle/uniba/5441},
  language = {eng}
}

@inproceedings{mendler2011_4266,
  title = {An Algebra of Synchronous Scheduling Interfaces},
  author = {Mendler, Michael},
  year = {2011},
  booktitle = {Foundations of Interface Technologies : (FIT 2010), Paris, 30th August 2010},
  pages = {28 - 48},
  address = {Paris},
  url = {https://fis.uni-bamberg.de/handle/uniba/4266},
  language = {eng}
}

@inproceedings{mendler2010_4312,
  title = {Towards Strategies for Dataflow Programming},
  author = {Mendler, Michael and Aguado, Joaquín},
  year = {2010},
  booktitle = {Preproceedings of the 22nd Symposium on Implementation and Application of Functional Languages (IFL 2010)},
  pages = {372 - 423},
  url = {https://fis.uni-bamberg.de/handle/uniba/4312},
  language = {eng}
}

@incollection{roever2010_3847,
  title = {What is in a Step: New Perspectives on a Classical Question},
  author = {Roever, Willem-Paul de and Lüttgen, Gerald and Mendler, Michael},
  year = {2010},
  booktitle = {Time for verification : essays in memory of Amir Pnueli},
  pages = {370 - 399},
  address = {Berlin u.a.},
  isbn = {9783642137532},
  url = {https://fis.uni-bamberg.de/handle/uniba/3847},
  language = {eng}
}

@inproceedings{mendler2010_3806,
  title = {Is observational congruence on µ-expressions axiomatisable in equational horn logic?},
  author = {Mendler, Michael and Lüttgen, Gerald},
  year = {2010},
  volume = {208},
  number = {6 = Special Issue: 18th International Conference on Concurrency Theory (CONCUR 2007)},
  pages = {634 - 651},
  url = {https://fis.uni-bamberg.de/handle/uniba/3806},
  language = {eng}
}

@phdthesis{zeiner2010_270,
  title = {Die Seele im Gespräch mit sich selbst : Bewusstsein und die Fähigkeit zur Selbsterkenntnis und -veränderung},
  author = {Zeißner, Georg},
  year = {2010},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Schriften aus der Fakultät Humanwissenschaften der Otto-Friedrich-Universität Bamberg},
  isbn = {978-3-86309-005-0},
  doi = {10.20378/irb-270},
  urn = {urn:nbn:de:bvb:473-opus-3133},
  url = {https://fis.uni-bamberg.de/handle/uniba/270},
  language = {deu},
  abstract = {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.},
  keywords = {Bewusstsein , PSI-Theorie , komplexe Probleme , Selbstreflexion , Besonnenheit, consciousness , PSI-theory , complex problem-solving , self-reflection , deliberateness, Bewusstsein, PSI-Theorie, komplexe Probleme, Selbstreflexion, Besonnenheit, consciousness, PSI-theory, complex problem-solving, self-reflection, deliberateness},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{aguado2008_18126,
  title = {Electronic Notes in Theoretical Computer Science},
  editor = {Aguado, Joaquin and Mendler, Michael},
  year = {2008},
  volume = {203},
  number = {4, Proceedings of the International Workshop on Model-driven High-level Programming of Embedded Systems (SLA++P 2007), Braga, Portugal, 31 March 2007},
  pages = {1 - 140},
  issn = {1571-0661},
  url = {https://fis.uni-bamberg.de/handle/uniba/18126},
  language = {eng}
}

@inproceedings{mendler2008_18088,
  title = {Constructive Description Logic cALC as a Type System for Semantic Streams in the Domain of Auditing},
  author = {Mendler, Michael and Scheele, Stephan},
  year = {2008},
  booktitle = {Proceedings of the 1st International Workshop on Logics for Agents and Mobility 2008},
  publisher = {Bibliothek des Dep. Informatik, Univ.},
  address = {Hamburg},
  url = {https://fis.uni-bamberg.de/handle/uniba/18088},
  language = {eng}
}

@inproceedings{mendler2008_18094,
  title = {Towards Constructive DL for Abstraction and Refinement},
  author = {Mendler, Michael and Scheele, Stephan},
  year = {2008},
  booktitle = {Proceedings of the 21th ... ; (DL 2008), Dresden, May 13 - 16, 2008},
  pages = {1 - 11},
  url = {https://fis.uni-bamberg.de/handle/uniba/18094},
  language = {eng}
}

@article{hanxleden2008_18093,
  title = {WCRT Algebra and Scheduling Interfaces for Esterel- style Synchronous Multithreading},
  author = {Hanxleden, R. von and Mendler, Michael and Traulsen, C.},
  year = {2008},
  journal = {Technical Report},
  number = {Nr. 0807, vom 11 Juli 2008},
  pages = {3 - 37},
  url = {https://fis.uni-bamberg.de/handle/uniba/18093},
  language = {eng}
}

@misc{scheele2008_6173,
  title = {Towards Constructive Description Logics for Abstraction and Refinement},
  author = {Scheele, Stephan and Mendler, Michael},
  year = {2008},
  publisher = {opus},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  urn = {urn:nbn:de:bvb:473-opus4-101153},
  url = {https://fis.uni-bamberg.de/handle/uniba/6173},
  language = {eng},
  abstract = {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.}
}

@inproceedings{mendler2007_18098,
  title = {Is observational congruence axiomatisable in equational horn logic?},
  author = {Mendler, Michael and Lüttgen, Gerald},
  year = {2007},
  booktitle = {CONCUR 2007 - concurrency theory : 18th international conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007 ; proceedings},
  pages = {197 - 211},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  doi = {10.1007/978-3-540-74407-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/18098},
  language = {eng}
}

@book{mendler2007_15376,
  title = {Is observational congruence on µ-expressions axiomatisable in equational horn logic?},
  author = {Mendler, Michael and Lüttgen, Gerald},
  year = {2007},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/15376},
  language = {eng}
}

@inproceedings{aguado2007_15261,
  title = {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},
  editor = {Aguado, Joaquin and Mendler, Michael},
  year = {2007},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/15261},
  language = {eng}
}

@techreport{mendler2006_18092,
  title = {The Synchrony Hypothesis or the Importance of Being Constructive},
  author = {Mendler, Michael},
  year = {2006},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/18092},
  language = {eng}
}

@book{mendler2006_14022,
  title = {Constructive circuits and the exactness of ternary simulation},
  author = {Mendler, Michael and Shiple, Thomas R. and Berry, Gérard},
  year = {2006},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/14022},
  language = {eng}
}

@inproceedings{luttgen2005_12909,
  title = {Proceedings of the Second Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2004)},
  author = {Lüttgen, Gerald and Mendler, Michael},
  year = {2005},
  volume = {115},
  pages = {1 - 97},
  issn = {0304-3975},
  url = {https://fis.uni-bamberg.de/handle/uniba/12909},
  language = {eng}
}

@book{aguado2005_12313,
  title = {Constructive semantics for instantaneous reactions},
  author = {Aguado, Joaquin and Mendler, Michael},
  year = {2005},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/12313},
  language = {eng}
}

@inproceedings{luttgen2004_15256,
  title = {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},
  author = {Lüttgen, Gerald and Martínez Madrid, Natividad and Mendler, Michael},
  year = {2004},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/15256},
  language = {eng}
}

@article{broy2004_13594,
  title = {Editorial: Semantic Foundations of Engineering Design Languages},
  author = {Broy, Manfred and Lüttgen, Gerald and Mendler, Michael},
  year = {2004},
  journal = {Formal aspects of computing : the internat. journal of formal methods},
  volume = {16},
  number = {3 = Special issue},
  pages = {165},
  issn = {0934-5043},
  url = {https://fis.uni-bamberg.de/handle/uniba/13594},
  language = {eng}
}

@article{depaiva2004_12846,
  title = {Modalities in constructive modal logics and type theories},
  author = {De Paiva, V, and Gore, R. and Mendler, Michael},
  year = {2004},
  journal = {Journal of logic and computation},
  volume = {14},
  number = {4},
  pages = {439 - 446},
  issn = {0955-792X},
  url = {https://fis.uni-bamberg.de/handle/uniba/12846},
  language = {eng}
}

@misc{mendler2004_10079,
  title = {Formal aspects of computing : the international journal of formal methods},
  author = {Mendler, Michael},
  year = {2004},
  publisher = {Springer},
  address = {London u.a.},
  url = {https://fis.uni-bamberg.de/handle/uniba/10079},
  language = {eng}
}

@inproceedings{broy2003_13602,
  title = {Editorial: Where theory and practice meet},
  author = {Broy, Manfred and Lüttgen, Gerald and Mendler, Michael},
  year = {2003},
  volume = {15},
  number = {4 = Special Issue: Where theory and practice meet},
  pages = {297 - 298},
  url = {https://fis.uni-bamberg.de/handle/uniba/13602},
  language = {eng}
}

@inproceedings{norton2003_9771,
  title = {A compositional semantic theory for synchronous component-based design},
  author = {Norton, B. and Mendler, Michael and Lüttgen, Gerald},
  year = {2003},
  booktitle = {CONCUR 2003 - concurrency theory : 14th International Conference, Marseille, France, September 3 - 5, 2003 ; proceedings},
  pages = {461 - 476},
  address = {Berlin},
  series = {Lecture notes in computer science},
  url = {https://fis.uni-bamberg.de/handle/uniba/9771},
  language = {eng}
}

@article{fairtlough2003_9779,
  title = {Intensional completeness in an extension of Goedel- Dummett logic},
  author = {Fairtlough, M. and Mendler, Michael},
  year = {2003},
  journal = {Studia logica : an international journal for symbolic logic},
  volume = {73},
  number = {1},
  pages = {51 - 80},
  issn = {0039-3215},
  url = {https://fis.uni-bamberg.de/handle/uniba/9779},
  language = {eng}
}

@inproceedings{luttgen2003_9775,
  title = {Statecharts: from visual syntax to model-theoretic semantics},
  author = {Lüttgen, Gerald and Mendler, Michael},
  year = {2003},
  booktitle = {Wirtschaft und Wissenschaft in der network economy - Visionen und Wirklichkeit : Tagungsband der GI/OCG Jahrestagung 2001, 25. - 28. September 2001, Universität Wien},
  pages = {615 - 621},
  address = {Wien},
  series = {Books@ocg.at},
  url = {https://fis.uni-bamberg.de/handle/uniba/9775},
  language = {eng}
}

@inproceedings{luttgen2002_10081,
  title = {Towards a model-theory for Esterel},
  author = {Lüttgen, Gerald and Mendler, Michael},
  year = {2002},
  volume = {65},
  number = {5 = SLAP'2002 Synchronous Languages, Applications, and Programming, Grenoble, France, April 13, 2002},
  issn = {0304-3975},
  url = {https://fis.uni-bamberg.de/handle/uniba/10081},
  language = {eng}
}

@inproceedings{luttgen2002_9824,
  title = {Axiomatizing an algebra of step reactions for synchronous languages},
  author = {Lüttgen, Gerald and Mendler, Michael},
  year = {2002},
  booktitle = {CONCUR 2002 - Concurrency theory : 13th international conference, Brno, Czech Republic, August 20 - 23, 2002 ; proceedings},
  pages = {386 - 401},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  url = {https://fis.uni-bamberg.de/handle/uniba/9824},
  language = {eng}
}

@inproceedings{fairtlough2002_9776,
  title = {On the logical content of computational type theory: A solution to Curry's problem},
  author = {Fairtlough, M. and Mendler, Michael},
  year = {2002},
  booktitle = {Types for proofs and programs : international workshop, TYPES 2000, Durham, UK, December 8 - 12, 2000 ; selected papers},
  pages = {63 - 78},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  url = {https://fis.uni-bamberg.de/handle/uniba/9776},
  language = {eng}
}

@article{luttgen2002_9778,
  title = {The intuitionism behind statecharts steps},
  author = {Lüttgen, Gerald and Mendler, Michael},
  year = {2002},
  journal = {ACM transactions on computational logic : TOCL},
  volume = {3},
  number = {1},
  pages = {1 - 41},
  issn = {1529-3785},
  doi = {10.1145/504077.504078},
  url = {https://fis.uni-bamberg.de/handle/uniba/9778},
  language = {eng}
}

@inproceedings{mendler2002_7837,
  title = {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},
  author = {Mendler, Michael},
  editor = {Goré, Rajeev and Mendler, Michael},
  year = {2002},
  publisher = {Otto-Friedrich-Univ.},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/7837},
  language = {eng}
}

@inproceedings{cheng2001_10127,
  title = {Proofs as constraints for abstraction and refinement},
  author = {Cheng, Xiaochun and Fairtlough, Matt and Mendler, Michael},
  year = {2001},
  booktitle = {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)},
  pages = {1 - 11},
  address = {Siena},
  url = {https://fis.uni-bamberg.de/handle/uniba/10127},
  language = {eng}
}

@article{mendler2001_10075,
  title = {Special Issue: Modalities in Type Theory},
  author = {Mendler, Michael and Fairtlough, Matt and Moggi, Eugenio},
  year = {2001},
  journal = {Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science},
  volume = {11},
  number = {4},
  pages = {507-596},
  publisher = {Cambridge Univ. Press},
  address = {Cambridge},
  doi = {10.1017/S0960129501003310},
  url = {https://fis.uni-bamberg.de/handle/uniba/10075},
  language = {deu}
}

@inproceedings{fairtlough2001_9820,
  title = {Abstraction and refinement in higher order logic},
  author = {Fairtlough, M. and Mendler, Michael and Cheng, X.},
  year = {2001},
  booktitle = {Theorem proving in higher order logics : 14th international conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3 - 6,  2001 ; proceedings},
  pages = {201 - 216},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  url = {https://fis.uni-bamberg.de/handle/uniba/9820},
  language = {eng}
}

@inproceedings{alechina2001_9774,
  title = {Categorical and Kripke semantics for constructive S4 modal logic},
  author = {Alechina, N. and Mendler, Michael and De Paiva, V, and Ritter, E.},
  year = {2001},
  booktitle = {Computer science logic : 15th international workshop, CSL 2001, 10th annual conference of the EACSL Paris, France, September 10 - 13, 2001 ;proceedings},
  pages = {292 - 307},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  url = {https://fis.uni-bamberg.de/handle/uniba/9774},
  language = {eng}
}

@article{mendler2001_9780,
  title = {Modalities in type theory},
  author = {Mendler, Michael},
  year = {2001},
  journal = {Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science},
  volume = {11},
  number = {4},
  pages = {507 - 509},
  issn = {0960-1295},
  url = {https://fis.uni-bamberg.de/handle/uniba/9780},
  language = {deu}
}

@inproceedings{andersen1994_104022,
  title = {An asynchronous process algebra with multiple clocks},
  author = {Andersen, Henrik Reif and Mendler, Michael},
  year = {1994},
  booktitle = {Programming languages and systems : proceedings ; ESOP '94, 5th European Symposium on Programming, Edinburgh, UK, April 11 - 13, 1994},
  pages = {58-73},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-57880-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/104022},
  language = {eng},
  abstract = {-},
  keywords = {-}
}

@article{mendler1993_56619,
  title = {Newtonian Arbiters Cannot be Proven Correct},
  author = {Mendler, Michael and Stroup, Terry},
  year = {1993},
  journal = {Formal Methods in System Design},
  volume = {3},
  number = {3},
  pages = {233-257},
  publisher = {Kluwer},
  address = {Dordrecht [u.a.]},
  issn = {1572-8102},
  url = {https://fis.uni-bamberg.de/handle/uniba/56619},
  language = {eng}
}

@inproceedings{reinhardt1992_104020,
  title = {Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente},
  author = {Reinhardt, Tilmann and Mendler, Michael and Stroup, Terry},
  year = {1992},
  booktitle = {Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme : Vorträge der ITG-Fachtagung am 23. und 24. November 1992 in Darmstadt},
  pages = {273-274},
  publisher = {vde-Verl.},
  address = {Berlin ; Offenbach},
  series = {Informationstechnische Gesellschaft: ITG-Fachbericht},
  isbn = {978-3-8007-1905-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/104020},
  language = {deu},
  abstract = {-},
  keywords = {-}
}

@article{steffen1992_56620,
  title = {Compositional Characterization of Observable Program Properties},
  author = {Steffen, B. and Barry Jay, C. and Mendler, Michael},
  year = {1992},
  journal = {Theoretical informatics and applications},
  volume = {26},
  number = {5},
  pages = {403-424},
  publisher = {EDP Sciences},
  address = {Cambridge, Massachusetts, USA},
  issn = {0988-3754},
  doi = {10.1051/ita/1992260504031},
  url = {https://fis.uni-bamberg.de/handle/uniba/56620},
  language = {deu}
}

@inproceedings{mendler1991_104019,
  title = {Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification},
  author = {Mendler, Michael},
  year = {1991},
  booktitle = {Designing Correct Circuits : Workshop jointly organised by the Universities of Oxford and Glasgow, 26–28 September 1990, Oxford},
  pages = {1-28},
  publisher = {Springer},
  address = {London u.a.},
  isbn = {978-1-4471-3544-9},
  url = {https://fis.uni-bamberg.de/handle/uniba/104019},
  language = {eng},
  abstract = {-},
  keywords = {-}
}

