@article{BandyopadhyaySarkarMandaletal.2022,
  author    = {Bandyopadhyay, Soumyadip and Sarkar, Dipankar and Mandal, Chittaranjan and Giese, Holger},
  title     = {Translation validation of coloured Petri net models of programs on integers},
  series = {Acta informatica},
  volume    = {59},
  journal   = {Acta informatica},
  number    = {6},
  publisher = {Springer},
  address   = {New York},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-022-00419-z},
  pages     = {725 -- 759},
  year      = {2022},
  abstract  = {Programs are often subjected to significant optimizing and parallelizing transformations based on extensive dependence analysis. Formal validation of such transformations needs modelling paradigms which can capture both control and data dependences in the program vividly. Being value-based with an inherent scope of capturing parallelism, the untimed coloured Petri net (CPN) models, reported in the literature, fit the bill well; accordingly, they are likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like sequential control flow graphs (CFGs). In this work, an efficient path-based equivalence checking method for CPN models of programs on integers is presented. Extensive experimentation has been carried out on several sequential and parallel examples. Complexity and correctness issues have been treated rigorously for the method.},
  language  = {en}
}
@article{BarnesKennewell2015,
  author    = {Barnes, Jan and Kennewell, Steve},
  title     = {Teacher Perceptions of Key Competencies in ICT},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82604},
  pages     = {61 -- 75},
  year      = {2015},
  abstract  = {Regardless of what is intended by government curriculum specifications and advised by educational experts, the competencies taught and learned in and out of classrooms can vary considerably. In this paper, we discuss in particular how we can investigate the perceptions that individual teachers have of competencies in ICT, and how these and other factors may influence students' learning. We report case study research which identifies contradictions within the teaching of ICT competencies as an activity system, highlighting issues concerning the object of the curriculum, the roles of the participants and the school cultures. In a particular case, contradictions in the learning objectives between higher order skills and the use of application tools have been resolved by a change in the teacher's perceptions which have not led to changes in other aspects of the activity system. We look forward to further investigation of the effects of these contradictions in other case studies and on forthcoming curriculum change.},
  language  = {en}
}
@article{BauerHerwigLienhardetal.2021,
  author    = {Bauer, Chris and Herwig, Ralf and Lienhard, Matthias and Prasse, Paul and Scheffer, Tobias and Schuchhardt, Johannes},
  title     = {Large-scale literature mining to assess the relation between anti-cancer drugs and cancer types},
  series = {Journal of translational medicine},
  volume    = {19},
  journal   = {Journal of translational medicine},
  number    = {1},
  publisher = {BioMed Central},
  address   = {London},
  issn      = {1479-5876},
  doi       = {10.1186/s12967-021-02941-z},
  pages     = {13},
  year      = {2021},
  abstract  = {Background: There is a huge body of scientific literature describing the relation between tumor types and anti-cancer drugs. The vast amount of scientific literature makes it impossible for researchers and physicians to extract all relevant information manually. Methods: In order to cope with the large amount of literature we applied an automated text mining approach to assess the relations between 30 most frequent cancer types and 270 anti-cancer drugs. We applied two different approaches, a classical text mining based on named entity recognition and an AI-based approach employing word embeddings. The consistency of literature mining results was validated with 3 independent methods: first, using data from FDA approvals, second, using experimentally measured IC-50 cell line data and third, using clinical patient survival data. Results: We demonstrated that the automated text mining was able to successfully assess the relation between cancer types and anti-cancer drugs. All validation methods showed a good correspondence between the results from literature mining and independent confirmatory approaches. The relation between most frequent cancer types and drugs employed for their treatment were visualized in a large heatmap. All results are accessible in an interactive web-based knowledge base using the following link: . Conclusions: Our approach is able to assess the relations between compounds and cancer types in an automated manner. Both, cancer types and compounds could be grouped into different clusters. Researchers can use the interactive knowledge base to inspect the presented results and follow their own research questions, for example the identification of novel indication areas for known drugs.},
  language  = {en}
}
@book{Becker2010,
  author    = {Becker, Basil},
  title     = {Model-based extension of AUTOSAR for architectural online reconfiguration},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{BeerenwinkelSingLengaueretal.2005,
  author    = {Beerenwinkel, Niko and Sing, Tobias and Lengauer, Thomas and Rahnenfuhrer, Joerg and Roomp, Kirsten and Savenkov, Igor and Fischer, Roman and Hoffmann, Daniel and Selbig, Joachim and Korn, Klaus and Walter, Hauke and Berg, Thomas and Braun, Patrick and Faetkenheuer, Gerd and Oette, Mark and Rockstroh, Juergen and Kupfer, Bernd and Kaiser, Rolf and Daeumer, Martin},
  title     = {Computational methods for the design of effective therapies against drug resistant HIV strains},
  year      = {2005},
  abstract  = {The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1998,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Extension calculus and query answering in prioritized default logic},
  isbn      = {3-540- 64993-X},
  year      = {1998},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1998,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Extension calculus and query answering in prioritized default logic},
  isbn      = {3-540-64993-X},
  year      = {1998},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@phdthesis{Bensch2008,
  author    = {Bensch, Suna},
  title     = {Parallel systems as mildly context-sensitive grammar formalisms},
  pages     = {I, 103 S.},
  year      = {2008},
  language  = {en}
}
@article{BenschBordihnHolzeretal.2009,
  author    = {Bensch, Suna and Bordihn, Henning and Holzer, Markus and Kutrib, Martin},
  title     = {On input-revolving deterministic and nondeterministic finite automata},
  issn      = {0890-5401},
  doi       = {10.1016/J.Ic.2009.03.002},
  year      = {2009},
  abstract  = {We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with the additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to the left, revolving to the right, and circular-interchanging. We investigate the computational capacities of these three types of automata and their deterministic variants, comparing any of the six classes of automata with each other and with further classes of well-known automata. In particular, it is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any deterministic automaton of the same type. Concerning the closure properties most of the deterministic language families studied are not closed under standard operations. For example, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.},
  language  = {en}
}
@article{BesnardFanselowSchaub2002,
  author    = {Besnard, Philippe and Fanselow, Gisbert and Schaub, Torsten},
  title     = {Optimality theory as a family of cumulative logics},
  year      = {2002},
  language  = {en}
}
@article{BesnardHunter2001,
  author    = {Besnard, Philippe and Hunter, Anthony},
  title     = {A logic-based theory of deductive arguments},
  issn      = {0004-3702},
  year      = {2001},
  language  = {en}
}
@article{BesnardHunter2000,
  author    = {Besnard, Philippe and Hunter, Anthony},
  title     = {Towards a logic-based theory of argumentation},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{BesnardLang2000,
  author    = {Besnard, Philippe and Lang, Jerome},
  title     = {Graded paraconsistency},
  isbn      = {0-86380-253-2},
  year      = {2000},
  language  = {en}
}
@article{BesnardMercerSchaub2002,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten},
  title     = {Optimality Theory via Default Logic},
  year      = {2002},
  language  = {en}
}
@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{BesnardSchaub1995,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {An approach to context-based default reasoning},
  issn      = {0169-2968},
  year      = {1995},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Characterization of non-monotone non-constructive systems},
  issn      = {1012-2443},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Signed systems for paraconsistent reasoning},
  issn      = {0168-7433},
  year      = {1998},
  language  = {en}
}