@article{KrasnovaVeltriSpengleretal.2013,
  author    = {Krasnova, Hanna and Veltri, Natasha F. and Spengler, Klaus and G{\"u}nther, Oliver},
  title     = {"Deal of the Day" Platforms what drives Consumer loyalty?},
  series = {Business \& information systems engineering : the international journal of Wirtschaftsinformatik},
  volume    = {5},
  journal   = {Business \& information systems engineering : the international journal of Wirtschaftsinformatik},
  number    = {3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1867-0202},
  doi       = {10.1007/s12599-013-0268-2},
  pages     = {165 -- 177},
  year      = {2013},
  abstract  = {"Deal of the Day" (DoD) platforms have quickly become popular by offering savings on local services, products and vacations. For merchants, these platforms represent a new marketing channel to advertise their products and services and attract new customers. DoD platform providers, however, struggle to maintaining a stable market share and profitability, because entry and switching costs are low. To sustain a competitive market position, DoD providers are looking for ways to build a loyal customer base. However, research examining the determinants of user loyalty in this novel context is scarce. To fill this gap, this study employs Grounded Theory methodology to develop a conceptual model of customer loyalty to a DoD provider. In the next step, qualitative insights are enriched and validated using quantitative data from a survey of 202 DoD users. The authors find that customer loyalty is in large part driven by monetary incentives, but can be eroded if impressions from merchant encounters are below expectations. In addition, enhancing the share of deals relevant for consumers, i.e. signal-to-noise ratio, and mitigating perceived risks of a transaction emerge as challenges. Beyond theoretical value, the results offer practical insights into how customer loyalty to a DoD provider can be promoted.},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{JuergensenKonstantinidis2006,
  author    = {J{\"u}rgensen, Helmut and Konstantinidis, Stavros},
  title     = {(Near-)inverses of sequences},
  issn      = {0020-7160},
  doi       = {10.1080/00207160500537801},
  year      = {2006},
  abstract  = {We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses},
  language  = {en}
}
@inproceedings{KnothKiy2014,
  author    = {Knoth, Alexander Henning and Kiy, Alexander},
  title     = {(Self-)confident through the introductory study phase with the Reflect App},
  series = {CEUR Workshop Proceedings},
  booktitle = {CEUR Workshop Proceedings},
  number    = {1227},
  publisher = {CEUR-WS},
  address   = {Freiburg},
  issn      = {1613-0073},
  pages     = {172 -- 179},
  year      = {2014},
  language  = {en}
}
@inproceedings{OPUS4-39635,
  title     = {11. Workshop Testmethoden und Zuverl{\"a}ssigkeit von Schaltungen und Systemen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-9806494-1-4},
  pages     = {137 Seiten},
  year      = {1999},
  language  = {de}
}
@phdthesis{Holz2013,
  author    = {Holz, Christian},
  title     = {3D from 2D touch},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-67796},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {While interaction with computers used to be dominated by mice and keyboards, new types of sensors now allow users to interact through touch, speech, or using their whole body in 3D space. These new interaction modalities are often referred to as "natural user interfaces" or "NUIs." While 2D NUIs have experienced major success on billions of mobile touch devices sold, 3D NUI systems have so far been unable to deliver a mobile form factor, mainly due to their use of cameras. The fact that cameras require a certain distance from the capture volume has prevented 3D NUI systems from reaching the flat form factor mobile users expect. In this dissertation, we address this issue by sensing 3D input using flat 2D sensors. The systems we present observe the input from 3D objects as 2D imprints upon physical contact. By sampling these imprints at very high resolutions, we obtain the objects' textures. In some cases, a texture uniquely identifies a biometric feature, such as the user's fingerprint. In other cases, an imprint stems from the user's clothing, such as when walking on multitouch floors. By analyzing from which part of the 3D object the 2D imprint results, we reconstruct the object's pose in 3D space. While our main contribution is a general approach to sensing 3D input on 2D sensors upon physical contact, we also demonstrate three applications of our approach. (1) We present high-accuracy touch devices that allow users to reliably touch targets that are a third of the size of those on current touch devices. We show that different users and 3D finger poses systematically affect touch sensing, which current devices perceive as random input noise. We introduce a model for touch that compensates for this systematic effect by deriving the 3D finger pose and the user's identity from each touch imprint. We then investigate this systematic effect in detail and explore how users conceptually touch targets. Our findings indicate that users aim by aligning visual features of their fingers with the target. We present a visual model for touch input that eliminates virtually all systematic effects on touch accuracy. (2) From each touch, we identify users biometrically by analyzing their fingerprints. Our prototype Fiberio integrates fingerprint scanning and a display into the same flat surface, solving a long-standing problem in human-computer interaction: secure authentication on touchscreens. Sensing 3D input and authenticating users upon touch allows Fiberio to implement a variety of applications that traditionally require the bulky setups of current 3D NUI systems. (3) To demonstrate the versatility of 3D reconstruction on larger touch surfaces, we present a high-resolution pressure-sensitive floor that resolves the texture of objects upon touch. Using the same principles as before, our system GravitySpace analyzes all imprints and identifies users based on their shoe soles, detects furniture, and enables accurate touch input using feet. By classifying all imprints, GravitySpace detects the users' body parts that are in contact with the floor and then reconstructs their 3D body poses using inverse kinematics. GravitySpace thus enables a range of applications for future 3D NUI systems based on a flat sensor, such as smart rooms in future homes. We conclude this dissertation by projecting into the future of mobile devices. Focusing on the mobility aspect of our work, we explore how NUI devices may one day augment users directly in the form of implanted devices.},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Wang, Kewen},
  title     = {A classification and survey of preference handling approchaches in nonmonotonic reasoning},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles},
  language  = {en}
}
@article{Wang2001,
  author    = {Wang, Kewen},
  title     = {A comparative study of disjunctive well-founded semantics},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  year      = {2001},
  language  = {en}
}
@article{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  isbn      = {1-558-60777-3},
  issn      = {1045-0823},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compilation of Brewka and Eiter's approach to prioritizationtion},
  isbn      = {3-540-41131-3},
  year      = {2000},
  language  = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
  author    = {Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A compiler for nested logic programming},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compiler for ordered logic programs},
  year      = {2000},
  language  = {en}
}
@phdthesis{Awad2010,
  author    = {Awad, Ahmed Mahmoud Hany Aly},
  title     = {A compliance management framework for business process models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49222},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Companies develop process models to explicitly describe their business operations. In the same time, business operations, business processes, must adhere to various types of compliance requirements. Regulations, e.g., Sarbanes Oxley Act of 2002, internal policies, best practices are just a few sources of compliance requirements. In some cases, non-adherence to compliance requirements makes the organization subject to legal punishment. In other cases, non-adherence to compliance leads to loss of competitive advantage and thus loss of market share. Unlike the classical domain-independent behavioral correctness of business processes, compliance requirements are domain-specific. Moreover, compliance requirements change over time. New requirements might appear due to change in laws and adoption of new policies. Compliance requirements are offered or enforced by different entities that have different objectives behind these requirements. Finally, compliance requirements might affect different aspects of business processes, e.g., control flow and data flow. As a result, it is infeasible to hard-code compliance checks in tools. Rather, a repeatable process of modeling compliance rules and checking them against business processes automatically is needed. This thesis provides a formal approach to support process design-time compliance checking. Using visual patterns, it is possible to model compliance requirements concerning control flow, data flow and conditional flow rules. Each pattern is mapped into a temporal logic formula. The thesis addresses the problem of consistency checking among various compliance requirements, as they might stem from divergent sources. Also, the thesis contributes to automatically check compliance requirements against process models using model checking. We show that extra domain knowledge, other than expressed in compliance rules, is needed to reach correct decisions. In case of violations, we are able to provide a useful feedback to the user. The feedback is in the form of parts of the process model whose execution causes the violation. In some cases, our approach is capable of providing automated remedy of the violation.},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{BrueningSchaub2000,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A connection calculus for handling incomplete information},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based framework for merging knowledge bases},
  issn      = {1570-8683},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub1993,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {A context-based framework for default logics},
  isbn      = {0-262-51071-5},
  year      = {1993},
  language  = {en}
}
@phdthesis{Luckow2009,
  author    = {Luckow, Andr{\´e}},
  title     = {A dependable middleware for enhancing the fault tolerance of distributed computations in grid environments},
  address   = {Potsdam},
  pages     = {235 S.},
  year      = {2009},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  language  = {en}
}
@article{KreowskyStabernack2021,
  author    = {Kreowsky, Philipp and Stabernack, Christian Benno},
  title     = {A full-featured FPGA-based pipelined architecture for SIFT extraction},
  series = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  volume    = {9},
  journal   = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {New York, NY},
  issn      = {2169-3536},
  doi       = {10.1109/ACCESS.2021.3104387},
  pages     = {128564 -- 128573},
  year      = {2021},
  abstract  = {Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A general framework for expressing preferences in causal reasoning and planning},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exm046},
  year      = {2007},
  abstract  = {We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.},
  language  = {en}
}
@article{DelgrandeSchaubTompits2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A generic compiler for ordered logic programs},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@incollection{KiyGessnerLuckeetal.2015,
  author    = {Kiy, Alexander and Geßner, Hendrik and Lucke, Ulrike and Gr{\"u}newald, Franka},
  title     = {A Hybrid and Modular Framework for Mobile Campus Applications},
  series = {i-com},
  volume    = {2015},
  booktitle = {i-com},
  number    = {14},
  publisher = {de Gruyter},
  address   = {Berlin},
  issn      = {2196-6826},
  doi       = {10.1515/icom-2015-0016},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {63 -- 73},
  year      = {2015},
  abstract  = {Mobile devices and associated applications (apps) are an indispensable part of daily life and provide access to important information anytime and anywhere. However, the availability of university-wide services in the mobile sector is still poor. If they exist they usually result from individual activities of students and teachers. Mobile applications can have an essential impact on the improvement of students' self-organization as well as on the design and enhancement of specific learning scenarios, though. This article introduces a mobile campus app framework, which integrates central campus services and decentralized learning applications. An analysis of strengths and weaknesses of different approaches is presented to summarize and evaluate them in terms of requirements, development, maintenance and operation. The article discusses the underlying service-oriented architecture that allows transferring the campus app to other universities or institutions at reasonable cost. It concludes with a presentation of the results as well as ongoing discussions and future work},
  language  = {en}
}
@article{TiwariPrakashGrossetal.2020,
  author    = {Tiwari, Abhishek and Prakash, Jyoti and Groß, Sascha and Hammer, Christian},
  title     = {A large scale analysis of Android},
  series = {The journal of systems and software},
  volume    = {170},
  journal   = {The journal of systems and software},
  publisher = {Elsevier},
  address   = {New York},
  issn      = {0164-1212},
  doi       = {10.1016/j.jss.2020.110775},
  pages     = {17},
  year      = {2020},
  abstract  = {Many Android applications embed webpages via WebView components and execute JavaScript code within Android. Hybrid applications leverage dedicated APIs to load a resource and render it in a WebView. Furthermore, Android objects can be shared with the JavaScript world. However, bridging the interfaces of the Android and JavaScript world might also incur severe security threats: Potentially untrusted webpages and their JavaScript might interfere with the Android environment and its access to native features. No general analysis is currently available to assess the implications of such hybrid apps bridging the two worlds. To understand the semantics and effects of hybrid apps, we perform a large-scale study on the usage of the hybridization APIs in the wild. We analyze and categorize the parameters to hybridization APIs for 7,500 randomly selected and the 196 most popular applications from the Google Playstore as well as 1000 malware samples. Our results advance the general understanding of hybrid applications, as well as implications for potential program analyses, and the current security situation: We discovered thousands of flows of sensitive data from Android to JavaScript, the vast majority of which could flow to potentially untrustworthy code. Our analysis identified numerous web pages embedding vulnerabilities, which we exemplarily exploited. Additionally, we discovered a multitude of applications in which potentially untrusted JavaScript code may interfere with (trusted) Android objects, both in benign and malign applications.},
  language  = {en}
}
@article{HlawiczkaGoesselSogomonyan1997,
  author    = {Hlawiczka, A. and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A linear code-preserving signature analyzer COPMISR},
  isbn      = {0-8186-7810-0},
  year      = {1997},
  language  = {en}
}
@unpublished{Arnold2009,
  author    = {Arnold, Holger},
  title     = {A linearized DPLL calculus with clause learning (2nd, revised version)},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29080},
  year      = {2009},
  abstract  = {Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.},
  language  = {en}
}
@article{Arnold2007,
  author    = {Arnold, Holger},
  title     = {A linearized DPLL calculus with learning},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-15421},
  year      = {2007},
  abstract  = {This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus.},
  language  = {en}
}
@phdthesis{Scherfenberg2012,
  author    = {Scherfenberg, Ivonne},
  title     = {A logic-based Framwork to enable Attribute Assurance for Digital Identities in Service-oriented Architectures and the Web},
  address   = {Potsdam},
  pages     = {126 S.},
  year      = {2012},
  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{SaposhnikovSaposhnikovGoesseletal.1999,
  author    = {Saposhnikov, V. V. and Saposhnikov, Vl. V. and G{\"o}ssel, Michael and Morosov, Andrej},
  title     = {A method of construction of combinational self-checking units with detection of all single faults},
  year      = {1999},
  language  = {en}
}
@phdthesis{Andjelkovic2021,
  author    = {Andjelkovic, Marko},
  title     = {A methodology for characterization, modeling and mitigation of single event transient effects in CMOS standard combinational cells},
  doi       = {10.25932/publishup-53484},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-534843},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xxiv, 216},
  year      = {2021},
  abstract  = {With the downscaling of CMOS technologies, the radiation-induced Single Event Transient (SET) effects in combinational logic have become a critical reliability issue for modern integrated circuits (ICs) intended for operation under harsh radiation conditions. The SET pulses generated in combinational logic may propagate through the circuit and eventually result in soft errors. It has thus become an imperative to address the SET effects in the early phases of the radiation-hard IC design. In general, the soft error mitigation solutions should accommodate both static and dynamic measures to ensure the optimal utilization of available resources. An efficient soft-error-aware design should address synergistically three main aspects: (i) characterization and modeling of soft errors, (ii) multi-level soft error mitigation, and (iii) online soft error monitoring. Although significant results have been achieved, the effectiveness of SET characterization methods, accuracy of predictive SET models, and efficiency of SET mitigation measures are still critical issues. Therefore, this work addresses the following topics: (i) Characterization and modeling of SET effects in standard combinational cells, (ii) Static mitigation of SET effects in standard combinational cells, and (iii) Online particle detection, as a support for dynamic soft error mitigation. Since the standard digital libraries are widely used in the design of radiation-hard ICs, the characterization of SET effects in standard cells and the availability of accurate SET models for the Soft Error Rate (SER) evaluation are the main prerequisites for efficient radiation-hard design. This work introduces an approach for the SPICE-based standard cell characterization with the reduced number of simulations, improved SET models and optimized SET sensitivity database. It has been shown that the inherent similarities in the SET response of logic cells for different input levels can be utilized to reduce the number of required simulations. Based on characterization results, the fitting models for the SET sensitivity metrics (critical charge, generated SET pulse width and propagated SET pulse width) have been developed. The proposed models are based on the principle of superposition, and they express explicitly the dependence of the SET sensitivity of individual combinational cells on design, operating and irradiation parameters. In contrast to the state-of-the-art characterization methodologies which employ extensive look-up tables (LUTs) for storing the simulation results, this work proposes the use of LUTs for storing the fitting coefficients of the SET sensitivity models derived from the characterization results. In that way the amount of characterization data in the SET sensitivity database is reduced significantly. The initial step in enhancing the robustness of combinational logic is the application of gate-level mitigation techniques. As a result, significant improvement of the overall SER can be achieved with minimum area, delay and power overheads. For the SET mitigation in standard cells, it is essential to employ the techniques that do not require modifying the cell structure. This work introduces the use of decoupling cells for improving the robustness of standard combinational cells. By insertion of two decoupling cells at the output of a target cell, the critical charge of the cell's output node is increased and the attenuation of short SETs is enhanced. In comparison to the most common gate-level techniques (gate upsizing and gate duplication), the proposed approach provides better SET filtering. However, as there is no single gate-level mitigation technique with optimal performance, a combination of multiple techniques is required. This work introduces a comprehensive characterization of gate-level mitigation techniques aimed to quantify their impact on the SET robustness improvement, as well as introduced area, delay and power overhead per gate. By characterizing the gate-level mitigation techniques together with the standard cells, the required effort in subsequent SER analysis of a target design can be reduced. The characterization database of the hardened standard cells can be utilized as a guideline for selection of the most appropriate mitigation solution for a given design. As a support for dynamic soft error mitigation techniques, it is important to enable the online detection of energetic particles causing the soft errors. This allows activating the power-greedy fault-tolerant configurations based on N-modular redundancy only at the high radiation levels. To enable such a functionality, it is necessary to monitor both the particle flux and the variation of particle LET, as these two parameters contribute significantly to the system SER. In this work, a particle detection approach based on custom-sized pulse stretching inverters is proposed. Employing the pulse stretching inverters connected in parallel enables to measure the particle flux in terms of the number of detected SETs, while the particle LET variations can be estimated from the distribution of SET pulse widths. This approach requires a purely digital processing logic, in contrast to the standard detectors which require complex mixed-signal processing. Besides the possibility of LET monitoring, additional advantages of the proposed particle detector are low detection latency and power consumption, and immunity to error accumulation. The results achieved in this thesis can serve as a basis for establishment of an overall soft-error-aware database for a given digital library, and a comprehensive multi-level radiation-hard design flow that can be implemented with the standard IC design tools. The following step will be to evaluate the achieved results with the irradiation experiments.},
  language  = {en}
}
@phdthesis{Wolter2010,
  author    = {Wolter, Christian},
  title     = {A methodology for model-driven process security},
  address   = {Potsdam},
  pages     = {xv, 144 S. : graph. Darst.},
  year      = {2010},
  language  = {en}
}
@article{BrueningSchaub1996,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A model-based approach to consistency-checking},
  isbn      = {3-540-61286-6},
  year      = {1996},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2013,
  author    = {Delgrande, James and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A model-theoretic approach to belief change in answer set programming},
  series = {ACM transactions on computational logic},
  volume    = {14},
  journal   = {ACM transactions on computational logic},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1529-3785},
  doi       = {10.1145/2480759.2480766},
  pages     = {46},
  year      = {2013},
  abstract  = {We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs. We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision. We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets. Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.},
  language  = {en}
}
@article{SogomonyanSinghGoessel1998,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1998},
  language  = {en}
}
@article{SogomonyanSinghGoessel1999,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1999},
  language  = {en}
}
@phdthesis{Ghasemzadeh2005,
  author    = {Ghasemzadeh, Mohammad},
  title     = {A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-6378},
  school      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Quantified Boolean formulas (QBFs) play an important role in theoretical computer science. QBF extends propositional logic in such a way that many advanced forms of reasoning can be easily formulated and evaluated. In this dissertation we present our ZQSAT, which is an algorithm for evaluating quantified Boolean formulas. ZQSAT is based on ZBDD: Zero-Suppressed Binary Decision Diagram , which is a variant of BDD, and an adopted version of the DPLL algorithm. It has been implemented in C using the CUDD: Colorado University Decision Diagram package. The capability of ZBDDs in storing sets of subsets efficiently enabled us to store the clauses of a QBF very compactly and let us to embed the notion of memoization to the DPLL algorithm. These points led us to implement the search algorithm in such a way that we could store and reuse the results of all previously solved subformulas with a little overheads. ZQSAT can solve some sets of standard QBF benchmark problems (known to be hard for DPLL based algorithms) faster than the best existing solvers. In addition to prenex-CNF, ZQSAT accepts prenex-NNF formulas. We show and prove how this capability can be exponentially beneficial.},
  subject      = {Bin{\"a}res Entscheidungsdiagramm},
  language  = {en}
}
@article{Gohlke1995,
  author    = {Gohlke, Mario},
  title     = {A new approach for model-based recognition using colour regions},
  year      = {1995},
  language  = {en}
}
@article{SaposhnikovMorosovSaposhnikovetal.1998,
  author    = {Saposhnikov, V. V. and Morosov, Andrej and Saposhnikov, Vl. V. and G{\"o}ssel, Michael},
  title     = {A new design method for self-checking unidirectional combinational circuits},
  year      = {1998},
  language  = {en}
}
@article{Richter1995,
  author    = {Richter, Peter},
  title     = {A new deterministic approach for the optimization of cable layouts for power supply systems},
  year      = {1995},
  language  = {en}
}
@article{Goessel1999,
  author    = {G{\"o}ssel, Michael},
  title     = {A new method of redundancy addition for circuit optimization},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 08},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {9 Bl.},
  year      = {1999},
  language  = {en}
}
@article{SogomonyanGoessel1995,
  author    = {Sogomonyan, Egor S. and G{\"o}ssel, Michael},
  title     = {A new parity preserving multi-input signature analyser},
  year      = {1995},
  language  = {en}
}
@book{SogomonyanMarienfeldOcheretnijetal.2003,
  author    = {Sogomonyan, Egor S. and Marienfeld, Daniel and Ocheretnij, V. and G{\"o}ssel, Michael},
  title     = {A new self-checking sum-bit duplicated carry-select adder},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 5},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {10 S.},
  year      = {2003},
  language  = {en}
}
@article{GoesselSogomonyan1996,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A new self-testing parity checker for ultra-reliable applications},
  year      = {1996},
  language  = {en}
}
@article{GoesselSogomonyanMorosov1999,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S. and Morosov, Andrej},
  title     = {A new totally error propagating compactor for arbitrary cores with digital interfaces},
  year      = {1999},
  language  = {en}
}
@article{KawanabeBlanchardSugiyamaetal.2006,
  author    = {Kawanabe, Motoaki and Blanchard, Gilles and Sugiyama, Masashi and Spokoiny, Vladimir G. and M{\"u}ller, Klaus-Robert},
  title     = {A novel dimension reduction procedure for searching non-Gaussian subspaces},
  issn      = {0302-9743},
  doi       = {10.1007/11679363_19},
  year      = {2006},
  abstract  = {In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method},
  language  = {en}
}