---
_id: '580'
abstract:
- lang: eng
  text: We present and study a new model for energy-aware and profit-oriented scheduling
    on a single processor.The processor features dynamic speed scaling as well as
    suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different
    sizes, values, and deadlines.On the arrival of a new job, the scheduler may either
    accept or reject the job.Accepted jobs need a certain energy investment to be
    finished in time, while rejected jobs cause costs equal to their values.Here,
    power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy
    investment is power integrated over time.Additionally, the scheduler may decide
    to suspend the processor to a sleep mode in which no energy is consumed, though
    awaking entails fixed transition costs $\gamma$.The objective is to minimize the
    total value of rejected jobs plus the total energy.Our model combines aspects
    from advanced energy conservation techniques (namely speed scaling and sleep states)
    and profit-oriented scheduling models.We show that \emph{rejection-oblivious}
    schedulers (whose rejection decisions are not based on former decisions) have
    – in contrast to the model without sleep states – an unbounded competitive ratio.It
    turns out that the jobs' value densities (the ratio between a job's value and
    its work) are crucial for the performance of such schedulers.We give an algorithm
    whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum
    value density.If the maximum value density is not too large, the competitiveness
    becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict
    the value density of low-value jobs only.Using a technique from \cite{Chan:2010}
    we transfer our results to processors with a fixed maximum speed.
author:
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Fredrik
  full_name: Mallmann Trenn, Fredrik
  last_name: Mallmann Trenn
citation:
  ama: 'Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down & Sleep for Profit
    in Online Deadline Scheduling. In: Even G, Rawitz D, eds. <i>Proceedings of the
    1st Mediterranean Conference on Algorithms (MedAlg)</i>. LNCS. ; 2012:218-231.
    doi:<a href="https://doi.org/10.1007/978-3-642-34862-4_17">10.1007/978-3-642-34862-4_17</a>'
  apa: Cord-Landwehr, A., Kling, P., &#38; Mallmann Trenn, F. (2012). Slow Down &#38;
    Sleep for Profit in Online Deadline Scheduling. In G. Even &#38; D. Rawitz (Eds.),
    <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>
    (pp. 218–231). <a href="https://doi.org/10.1007/978-3-642-34862-4_17">https://doi.org/10.1007/978-3-642-34862-4_17</a>
  bibtex: '@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS},
    title={Slow Down &#38; Sleep for Profit in Online Deadline Scheduling}, DOI={<a
    href="https://doi.org/10.1007/978-3-642-34862-4_17">10.1007/978-3-642-34862-4_17</a>},
    booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)},
    author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik},
    editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS}
    }'
  chicago: Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow
    Down &#38; Sleep for Profit in Online Deadline Scheduling.” In <i>Proceedings
    of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy
    Even and Dror Rawitz, 218–31. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-34862-4_17">https://doi.org/10.1007/978-3-642-34862-4_17</a>.
  ieee: A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &#38; Sleep
    for Profit in Online Deadline Scheduling,” in <i>Proceedings of the 1st Mediterranean
    Conference on Algorithms (MedAlg)</i>, 2012, pp. 218–231.
  mla: Cord-Landwehr, Andreas, et al. “Slow Down &#38; Sleep for Profit in Online
    Deadline Scheduling.” <i>Proceedings of the 1st Mediterranean Conference on Algorithms
    (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:<a href="https://doi.org/10.1007/978-3-642-34862-4_17">10.1007/978-3-642-34862-4_17</a>.
  short: 'A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.),
    Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012,
    pp. 218–231.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-34862-4_17
editor:
- first_name: Guy
  full_name: Even, Guy
  last_name: Even
- first_name: Dror
  full_name: Rawitz, Dror
  last_name: Rawitz
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:03:39Z
  date_updated: 2018-03-15T09:03:39Z
  file_id: '1265'
  file_name: 580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf
  file_size: 325939
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:03:39Z
has_accepted_license: '1'
language:
- iso: eng
page: 218-231
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)
series_title: LNCS
status: public
title: Slow Down & Sleep for Profit in Online Deadline Scheduling
type: conference
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
  text: 'Nanoparticles are getting more and more in the focus of the scientic community
    since the potential for the development of very small particles interacting with
    each other and completing medical and other tasks is getting bigger year by year.
    In this work we introduce a distributed local algorithm for arranging a set of
    nanoparticles on the discrete plane into specic geometric shapes, for instance
    a rectangle. The concept of a particle we use can be seen as a simple mobile robot
    with the following restrictions: it can only view the state of robots it is physically
    connected to, is anonymous, has only a constant size memory, can only move by
    using other particles as an anchor point on which it pulls itself alongside, and
    it operates in Look-Compute-Move cycles. The main result of this work is the presentation
    of a random distributed local algorithm which transforms any given connected set
    of particles into a particular geometric shape. As an example we provide a version
    of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
    To the best of our knowledge this is the rst work that considers arrangement problems
    for these types of robots.'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Martina
  full_name: 'Hüllmann (married name: Eikel), Martina'
  last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
    Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and
    Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href="https://doi.org/10.1109/IPDPS.2012.116">10.1109/IPDPS.2012.116</a>'
  apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler,
    C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE
    International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283).
    <a href="https://doi.org/10.1109/IPDPS.2012.116">https://doi.org/10.1109/IPDPS.2012.116</a>'
  bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
    title={Self-Organizing Particle Systems}, DOI={<a href="https://doi.org/10.1109/IPDPS.2012.116">10.1109/IPDPS.2012.116</a>},
    booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
    Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
    name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
    pages={1272–1283} }'
  chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
    and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings
    of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>,
    1272–83, 2012. <a href="https://doi.org/10.1109/IPDPS.2012.116">https://doi.org/10.1109/IPDPS.2012.116</a>.'
  ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
    “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International
    Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283.'
  mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings
    of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>,
    2012, pp. 1272–83, doi:<a href="https://doi.org/10.1109/IPDPS.2012.116">10.1109/IPDPS.2012.116</a>.
  short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
    in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
    Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:39:33Z
  date_updated: 2018-03-15T08:39:33Z
  file_id: '1263'
  file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
  file_size: 373131
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
  Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '582'
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>.
    Universität Paderborn; 2012.
  apa: Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic
    Approach</i>. Universität Paderborn.
  bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim
    Frederik}, year={2012} }'
  chicago: Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach</i>. Universität Paderborn, 2012.
  ieee: T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic
    Approach</i>. Universität Paderborn, 2012.
  mla: Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach</i>. Universität Paderborn, 2012.
  short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '584'
author:
- first_name: Till
  full_name: Hohenberger, Till
  last_name: Hohenberger
citation:
  ama: Hohenberger T. <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn; 2012.
  apa: Hohenberger, T. (2012). <i>Queuing Latency at Cooperative Base Stations</i>.
    Universität Paderborn.
  bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations},
    publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }'
  chicago: Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>.
    Universität Paderborn, 2012.
  ieee: T. Hohenberger, <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn, 2012.
  mla: Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn, 2012.
  short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität
    Paderborn, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:43Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Queuing Latency at Cooperative Base Stations
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '586'
abstract:
- lang: eng
  text: FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They
    combine the computational power of application specific hardware with software-like
    flexibility. At runtime, they can adjust their functionality by downloading new
    hardware modules and integrating their functionality. Due to their growing capabilities,
    the demands made to reconfigurable hardware grow. Their deployment in increasingly
    security critical scenarios requires new ways of enforcing security since a failure
    in security has severe consequences. Aside from financial losses, a loss of human
    life and risks to national security are possible. With this work I present the
    novel and groundbreaking concept of proof-carrying hardware. It is a method for
    the verification of properties of hardware modules to guarantee security for a
    target platform at runtime. The producer of a hardware module delivers based on
    the consumer's safety policy a safety proof in combination with the reconfiguration
    bitstream. The extensive computation of a proof is a contrast to the comparatively
    undemanding checking of the proof. I present a prototype based on open-source
    tools and an abstract FPGA architecture and bitstream format. The proof of the
    usability of proof-carrying hardware provides the evaluation of the prototype
    with the exemplary application of securing combinational and bounded sequential
    equivalence of reference monitor modules for memory safety.
- lang: ger
  text: FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr
    wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit
    einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität
    anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität
    integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare
    Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue
    Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende
    Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von
    Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit
    stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor.
    Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um
    die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines
    Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten,
    einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige
    Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen
    Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend
    auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt
    Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware
    erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung
    von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen
    zur Speichersicherheit.
author:
- first_name: Stephanie
  full_name: Drzevitzky, Stephanie
  last_name: Drzevitzky
citation:
  ama: 'Drzevitzky S. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable
    Hardware Security</i>. Universität Paderborn; 2012.'
  apa: 'Drzevitzky, S. (2012). <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable
    Hardware Security</i>. Universität Paderborn.'
  bibtex: '@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach
    to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky,
    Stephanie}, year={2012} }'
  chicago: 'Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to
    Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.'
  ieee: 'S. Drzevitzky, <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable
    Hardware Security</i>. Universität Paderborn, 2012.'
  mla: 'Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable
    Hardware Security</i>. Universität Paderborn, 2012.'
  short: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable
    Hardware Security, Universität Paderborn, 2012.'
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:44Z
ddc:
- '040'
department:
- _id: '78'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:38:19Z
  date_updated: 2018-03-15T08:38:19Z
  file_id: '1261'
  file_name: 586-Drzevitzky-PhD_01.pdf
  file_size: 1438436
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:38:19Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423
oa: '1'
page: '114'
project:
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
publication_status: published
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
title: 'Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security'
type: dissertation
user_id: '477'
year: '2012'
...
---
_id: '587'
author:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Andreas
  full_name: Agne, Andreas
  last_name: Agne
- first_name: Markus
  full_name: Happe, Markus
  last_name: Happe
- first_name: Enno
  full_name: Lübbers, Enno
  last_name: Lübbers
citation:
  ama: Plessl C, Platzner M, Agne A, Happe M, Lübbers E. <i>Programming Models for
    Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine; 2012.
  apa: Plessl, C., Platzner, M., Agne, A., Happe, M., &#38; Lübbers, E. (2012). <i>Programming
    models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine.
  bibtex: '@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models
    for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine},
    author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus
    and Lübbers, Enno}, year={2012} }'
  chicago: Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno
    Lübbers. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>.
    Awareness Magazine, 2012.
  ieee: C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, <i>Programming
    models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine, 2012.
  mla: Plessl, Christian, et al. <i>Programming Models for Reconfigurable Heterogeneous
    Multi-Cores</i>. Awareness Magazine, 2012.
  short: C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models
    for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:44Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:37:02Z
  date_updated: 2018-03-15T08:37:02Z
  file_id: '1260'
  file_name: 587-2012_plessl_awareness_magazine.pdf
  file_size: 353057
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:37:02Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Awareness Magazine
status: public
title: Programming models for reconfigurable heterogeneous multi-cores
type: misc
user_id: '398'
year: '2012'
...
---
_id: '590'
abstract:
- lang: eng
  text: 'Predicate abstraction is an established technique for reducing the size of
    the state space during verification. In this paper, we extend predication abstraction
    with block-abstraction memoization (BAM), which exploits the fact that blocks
    are often executed several times in a program. The verification can thus benefit
    from caching the values of previous block analyses and reusing them upon next
    entry into a block. In addition to function bodies, BAM also performs well for
    nested loops. To further increase effectiveness, block memoization has been integrated
    with lazy abstraction adopting a lazy strategy for cache refinement. Together,
    this achieves significant performance increases: our tool (an implementation within
    the configurable program analysis framework CPAchecker) has won the Competition
    on Software Verification 2012 in the category “Overall”.'
author:
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization.
    In: <i>Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)</i>. LNCS. ; 2012:332-347. doi:<a href="https://doi.org/10.1007/978-3-642-34281-3_24">10.1007/978-3-642-34281-3_24</a>'
  apa: Wonisch, D., &#38; Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction
    Memoization. In <i>Proceedings of the 14th International Conference on Formal
    Engineering Methods (ICFEM)</i> (pp. 332–347). <a href="https://doi.org/10.1007/978-3-642-34281-3_24">https://doi.org/10.1007/978-3-642-34281-3_24</a>
  bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis
    with Block-Abstraction Memoization}, DOI={<a href="https://doi.org/10.1007/978-3-642-34281-3_24">10.1007/978-3-642-34281-3_24</a>},
    booktitle={Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347},
    collection={LNCS} }'
  chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
    Memoization.” In <i>Proceedings of the 14th International Conference on Formal
    Engineering Methods (ICFEM)</i>, 332–47. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-34281-3_24">https://doi.org/10.1007/978-3-642-34281-3_24</a>.
  ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,”
    in <i>Proceedings of the 14th International Conference on Formal Engineering Methods
    (ICFEM)</i>, 2012, pp. 332–347.
  mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction
    Memoization.” <i>Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)</i>, 2012, pp. 332–47, doi:<a href="https://doi.org/10.1007/978-3-642-34281-3_24">10.1007/978-3-642-34281-3_24</a>.
  short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference
    on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_24
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:33:56Z
  date_updated: 2018-03-15T08:33:56Z
  file_id: '1258'
  file_name: 590-WonischWehrheim2012.pdf
  file_size: 320901
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:33:56Z
has_accepted_license: '1'
language:
- iso: eng
page: 332-347
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Formal Engineering
  Methods (ICFEM)
series_title: LNCS
status: public
title: Predicate Analysis with Block-Abstraction Memoization
type: conference
user_id: '477'
year: '2012'
...
---
_id: '593'
author:
- first_name: Tobias
  full_name: Rojahn, Tobias
  last_name: Rojahn
citation:
  ama: Rojahn T. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn; 2012.
  apa: Rojahn, T. (2012). <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn.
  bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten
    Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias},
    year={2012} }'
  chicago: Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  ieee: T. Rojahn, <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  mla: Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '601'
abstract:
- lang: eng
  text: Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen
    Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich
    selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur
    seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren
    Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen.
    In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich
    auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden
    k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen
    vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden
    obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz
    gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz
    mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie
    auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren
    hergeleitet.
author:
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
citation:
  ama: Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 2012.
  apa: Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol.
    302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Local strategies for robot formation problems}, volume={302},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes,
    Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn} }'
  chicago: Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>.
    Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
  ieee: B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
  mla: Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
  short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:16:44Z
  date_updated: 2018-03-15T08:16:44Z
  file_id: '1252'
  file_name: 601-Kempkes-PhD.pdf
  file_size: 3805310
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:16:44Z
has_accepted_license: '1'
intvolume: '       302'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication_identifier:
  isbn:
  - 978-3-942647-21-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local strategies for robot formation problems
type: dissertation
user_id: '5786'
volume: 302
year: '2012'
...
---
_id: '603'
abstract:
- lang: eng
  text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
    lightpaths in case not enough resources are available to setup a new lightpath
    in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
    to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
    properties of the network topology are required by the applications running on
    the network, these requirements have to be known by the RWA algorithm. Otherwise
    it might happen that by preempting a particular lightpath these requirements are
    violated. If, however, these requirements include parameters only known at the
    nodes running the application, the RWA algorithm cannot evaluate the requirements.
    For this reason a RWA algorithm is needed which involves its users in the preemption
    decisions. We present a family of preemptive RWA algorithms for WDM networks.
    These algorithms have two distinguishing features: a) they can handle dynamic
    traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration
    decisions and thus influence the preemption decision of the RWA algorithm, leading
    to networks which adapt directly to application needs. This is different from
    traffic engineering where the network is (slowly) adapted to observed traffic patterns.
    Our algorithms handle various WDM network configurations including networks consisting
    of heterogeneous WDM hardware. To this end, we are using the layered graph approach
    together with a newly developed graph model that is used to determine conflicting
    lightpaths.'
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength
    Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn;
    2012.
  apa: Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing
    and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität
    Paderborn.
  bibtex: '@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing
    and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität
    Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }'
  chicago: Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing
    and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität
    Paderborn, 2012.
  ieee: P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength
    assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn,
    2012.
  mla: Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing
    and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität
    Paderborn, 2012.
  short: P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength
    Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:51Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: hkarl
  date_created: 2018-03-09T09:57:26Z
  date_updated: 2018-03-09T09:57:26Z
  file_id: '1205'
  file_name: underlayMod2.pdf
  file_size: 717326
  relation: main_file
  success: 1
file_date_updated: 2018-03-09T09:57:26Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Introducing feedback to preemptive routing and wavelength assignment algorithms
  for dynamic traffic scenarios
type: report
user_id: '126'
year: '2012'
...
---
_id: '606'
author:
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn; 2012.
  apa: Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
    für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn.
  bibtex: '@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
    für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas},
    publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }'
  chicago: Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für
    Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  ieee: N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  mla: Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  short: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität
    Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage
  von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas
type: bachelorsthesis
user_id: '13703'
year: '2012'
...
---
_id: '607'
author:
- first_name: Thomas
  full_name: Haarhoff, Thomas
  last_name: Haarhoff
citation:
  ama: Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.
  apa: Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.
  bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn},
    author={Haarhoff, Thomas}, year={2012} }'
  chicago: Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  ieee: T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  mla: Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von
    Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper
  der Charakteristik 2
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '608'
abstract:
- lang: eng
  text: 'Predicate abstraction is an established technique in software verification.
    It inherently includes an abstraction refinement loop successively adding predicates
    until the right level of abstraction is found. For concurrent systems, predicate
    abstraction can be combined with spotlight abstraction, further reducing the state
    space by abstracting away certain processes. Refinement then has to decide whether
    to add a new predicate or a new process. Selecting the right predicates and processes
    is a crucial task: The positive effect of abstraction may be compromised by unfavourable
    refinement decisions. Here we present a heuristic approach to abstraction refinement.
    The basis for a decision is a set of refinement candidates, derived by multiple
    counterexample-generation. Candidates are evaluated with respect to their influence
    on other components in the system. Experimental results show that our technique
    can significantly speed up verification as compared to a naive abstraction refinement.'
author:
- first_name: Nils
  full_name: Timm, Nils
  last_name: Timm
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Mike
  full_name: Czech, Mike
  last_name: Czech
citation:
  ama: 'Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent
    Systems. In: <i>Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)</i>. LNCS. ; 2012:348-363. doi:<a href="https://doi.org/10.1007/978-3-642-34281-3_25">10.1007/978-3-642-34281-3_25</a>'
  apa: Timm, N., Wehrheim, H., &#38; Czech, M. (2012). Heuristic-Guided Abstraction
    Refinement for Concurrent Systems. In <i>Proceedings of the 14th International
    Conference on Formal Engineering Methods (ICFEM)</i> (pp. 348–363). <a href="https://doi.org/10.1007/978-3-642-34281-3_25">https://doi.org/10.1007/978-3-642-34281-3_25</a>
  bibtex: '@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided
    Abstraction Refinement for Concurrent Systems}, DOI={<a href="https://doi.org/10.1007/978-3-642-34281-3_25">10.1007/978-3-642-34281-3_25</a>},
    booktitle={Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012},
    pages={348–363}, collection={LNCS} }'
  chicago: Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction
    Refinement for Concurrent Systems.” In <i>Proceedings of the 14th International
    Conference on Formal Engineering Methods (ICFEM)</i>, 348–63. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-34281-3_25">https://doi.org/10.1007/978-3-642-34281-3_25</a>.
  ieee: N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement
    for Concurrent Systems,” in <i>Proceedings of the 14th International Conference
    on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–363.
  mla: Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent
    Systems.” <i>Proceedings of the 14th International Conference on Formal Engineering
    Methods (ICFEM)</i>, 2012, pp. 348–63, doi:<a href="https://doi.org/10.1007/978-3-642-34281-3_25">10.1007/978-3-642-34281-3_25</a>.
  short: 'N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International
    Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.'
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:52Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-34281-3_25
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:15:33Z
  date_updated: 2018-03-15T08:15:33Z
  file_id: '1250'
  file_name: 608-Timm2013-0main.pdf
  file_size: 396337
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:15:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 348-363
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Formal Engineering
  Methods (ICFEM)
series_title: LNCS
status: public
title: Heuristic-Guided Abstraction Refinement for Concurrent Systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '619'
abstract:
- lang: eng
  text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving
    in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer
    networks, evolution in social networks, and many others. In order to understand
    such kinds of dynamics, and to design distributed algorithms that behave well
    under dynamics, many ways to model dynamics are introduced and analyzed w.r.t.
    correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman
    have introduced a very general, worst case type model of dynamics: The edge set
    of the network may change arbitrarily from step to step, the only restriction
    is that it is connected at all times and the set of nodes does not change. An
    extended model demands that a xed connected subnetwork is maintained over each
    time interval of length T (T-interval dynamics). They have presented, among others,
    algorithms for counting the number of nodes under such general models of dynamics.In
    this paper, we generalize their models and algorithms by adding random edge faults,
    i.e., we consider fault-prone dynamic networks: We assume that an edge currently
    existing may fail to transmit data with some probability p. We rst observe that
    strong counting, i.e., each node knows the correct count and stops, is not possible
    in a model with random edge faults. Our main two positive results are feasibility
    and runtime bounds for weak counting, i.e., stopping is no longer required (but
    still a correct count in each node), and for strong counting with an upper bound,
    i.e., an upper bound N on n is known to all nodes.'
author:
- first_name: Philipp
  full_name: Brandes, Philipp
  last_name: Brandes
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic
    Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic
    Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>'
  apa: Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in
    Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href="https://doi.org/10.1145/2414815.2414818">https://doi.org/10.1145/2414815.2414818</a>
  bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed
    Computing in Fault-Prone Dynamic Networks}, DOI={<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>},
    booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
    Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm},
    year={2012}, pages={9–14}, collection={ICPS} }'
  chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
    in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href="https://doi.org/10.1145/2414815.2414818">https://doi.org/10.1145/2414815.2414818</a>.
  ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone
    Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects
    of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.
  mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
    in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>.
  short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop
    on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2414815.2414818
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:47:15Z
  date_updated: 2018-03-15T06:47:15Z
  file_id: '1244'
  file_name: 619-Brandes_MadHTADDS12_01.pdf
  file_size: 346044
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:47:15Z
has_accepted_license: '1'
page: 9-14
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
  Systems (TADDS)
series_title: ICPS
status: public
title: Distributed Computing in Fault-Prone Dynamic Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '622'
abstract:
- lang: eng
  text: Behavioral modeling languages are most useful if their behavior is specified
    formally such that it can e.g. be analyzed and executed automatically. Obviously,
    the quality of such behavior specifications is crucial. The rule-based semantics
    specification technique Dynamic Meta Modeling (DMM) honors this by using the approach
    of Test-driven Semantics Specification (TDSS), which makes sure that the specification
    at hand at least describes the correct behavior for a suite of test models. However,
    in its current state TDSS does not provide any means to measure the quality of
    such a test suite. In this paper, we describe how we have applied the idea of
    test coverage to TDSS. Similar to common approaches of defining test coverage
    criteria, we describe a data structure called invocation graph containing possible
    orders of applications ofDMM rules. Then we define different coverage criteria
    based on that data structure, taking the rule applications caused by the test
    suite’s models into account. Our implementation of the described approach gives
    the language engineer using DMM a means to reason about the quality of the language’s
    test suite, and also provides hints on how to improve that quality by adding dedicated
    test models to the test suite.
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Christian
  full_name: Soltenborn, Christian
  id: '1737'
  last_name: Soltenborn
  orcid: 0000-0002-0342-8227
citation:
  ama: 'Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications.
    In: <i>Proceedings of the 11th International Workshop on Graph Transformation
    and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the
    EASST. ; 2012. doi:<a href="https://doi.org/10.14279/tuj.eceasst.47.718">10.14279/tuj.eceasst.47.718</a>'
  apa: Arifulina, S., Engels, G., &#38; Soltenborn, C. (2012). Coverage Criteria for
    Testing DMM Specifications. In <i>Proceedings of the 11th International Workshop
    on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. <a href="https://doi.org/10.14279/tuj.eceasst.47.718">https://doi.org/10.14279/tuj.eceasst.47.718</a>
  bibtex: '@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications
    of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={<a
    href="https://doi.org/10.14279/tuj.eceasst.47.718">10.14279/tuj.eceasst.47.718</a>},
    booktitle={Proceedings of the 11th International Workshop on Graph Transformation
    and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels,
    Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications
    of the EASST} }'
  chicago: Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage
    Criteria for Testing DMM Specifications.” In <i>Proceedings of the 11th International
    Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>.
    Electronic Communications of the EASST, 2012. <a href="https://doi.org/10.14279/tuj.eceasst.47.718">https://doi.org/10.14279/tuj.eceasst.47.718</a>.
  ieee: S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing
    DMM Specifications,” in <i>Proceedings of the 11th International Workshop on Graph
    Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012.
  mla: Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.”
    <i>Proceedings of the 11th International Workshop on Graph Transformation and
    Visual Modeling Techniques (GT-VMT)</i>, 2012, doi:<a href="https://doi.org/10.14279/tuj.eceasst.47.718">10.14279/tuj.eceasst.47.718</a>.
  short: 'S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International
    Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:57Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.14279/tuj.eceasst.47.718
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:46:40Z
  date_updated: 2018-03-15T06:46:40Z
  file_id: '1243'
  file_name: 622-gtvmt2012-Arifulina_01.pdf
  file_size: 301602
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:46:40Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Workshop on Graph Transformation
  and Visual Modeling Techniques (GT-VMT)
series_title: Electronic Communications of the EASST
status: public
title: Coverage Criteria for Testing DMM Specifications
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
  text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
    allocate a shared communication medium among a set of K co-existing networks in
    the presence of arbitrary external interference? While most literature on medium
    access focuses on how to share a medium among nodes, these approaches are often
    either not directly applicable to co-existing networks as they would violate the
    independence requirement, or they yield a low throughput if applied to multiple
    networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
    that a given communication channel is shared fairly among competing and independent
    networks, and that the available bandwidth is used efficiently. These performance
    guarantees hold in the presence of arbitrary external interference or even under
    adversarial jamming. Concretely, we show that the co-existing networks can use
    a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
    message transmissions, where ε is the (arbitrarily distributed) fraction of time
    which is not jammed.'
author:
- first_name: Andrea W.
  full_name: Richa, Andrea W.
  last_name: Richa
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
- first_name: 'Jin '
  full_name: 'Zhang, Jin '
  last_name: Zhang
citation:
  ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
    for co-existing networks under adversarial interference. In: <i>Proceedings of
    the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
    (PODC)</i>. ; 2012:291-300. doi:<a href="https://doi.org/10.1145/2332432.2332488">10.1145/2332432.2332488</a>'
  apa: Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive
    and fair throughput for co-existing networks under adversarial interference. In
    <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
    Distributed Computing (PODC)</i> (pp. 291–300). <a href="https://doi.org/10.1145/2332432.2332488">https://doi.org/10.1145/2332432.2332488</a>
  bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
    fair throughput for co-existing networks under adversarial interference}, DOI={<a
    href="https://doi.org/10.1145/2332432.2332488">10.1145/2332432.2332488</a>}, booktitle={Proceedings
    of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
    (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
    and Zhang, Jin }, year={2012}, pages={291–300} }'
  chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang.
    “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
    In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
    and Distributed Computing (PODC)</i>, 291–300, 2012. <a href="https://doi.org/10.1145/2332432.2332488">https://doi.org/10.1145/2332432.2332488</a>.
  ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
    throughput for co-existing networks under adversarial interference,” in <i>Proceedings
    of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
    (PODC)</i>, 2012, pp. 291–300.
  mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
    under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS
    Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300,
    doi:<a href="https://doi.org/10.1145/2332432.2332488">10.1145/2332432.2332488</a>.
  short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
    Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
    2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:45:25Z
  date_updated: 2018-03-15T06:45:25Z
  file_id: '1241'
  file_name: 623-PODC-2012_01.pdf
  file_size: 210382
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
  and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
  interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '625'
abstract:
- lang: eng
  text: 'This paper initiates the study of self-adjusting distributed data structures
    for networks. In particular, we present SplayNets: a binary search tree based
    network that is self-adjusting to routing request.We derive entropy bounds on
    the amortized routing cost and show that our splaying algorithm has some interesting
    properties.'
author:
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
- first_name: Chen
  full_name: Avin, Chen
  last_name: Avin
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Bernhard
  full_name: Häupler, Bernhard
  last_name: Häupler
- first_name: Zvi
  full_name: Lotker, Zvi
  last_name: Lotker
citation:
  ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets
    - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the
    26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440.
    doi:<a href="https://doi.org/10.1007/978-3-642-33651-5_47">10.1007/978-3-642-33651-5_47</a>'
  apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012).
    Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
    In <i>Proceedings of the 26th International Symposium on Distributed Computing
    (DISC)</i> (pp. 439–440). <a href="https://doi.org/10.1007/978-3-642-33651-5_47">https://doi.org/10.1007/978-3-642-33651-5_47</a>'
  bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS},
    title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data
    Structures}, DOI={<a href="https://doi.org/10.1007/978-3-642-33651-5_47">10.1007/978-3-642-33651-5_47</a>},
    booktitle={Proceedings of the 26th International Symposium on Distributed Computing
    (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler,
    Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }'
  chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and
    Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed
    Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed
    Computing (DISC)</i>, 439–40. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-33651-5_47">https://doi.org/10.1007/978-3-642-33651-5_47</a>.'
  ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement:
    SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings
    of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012,
    pp. 439–440.'
  mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting
    Distributed Data Structures.” <i>Proceedings of the 26th International Symposium
    on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href="https://doi.org/10.1007/978-3-642-33651-5_47">10.1007/978-3-642-33651-5_47</a>.'
  short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings
    of the 26th International Symposium on Distributed Computing (DISC), 2012, pp.
    439–440.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_47
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:44:09Z
  date_updated: 2018-03-15T06:44:09Z
  file_id: '1240'
  file_name: 625-disc12adjBAshort.pdf
  file_size: 717284
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:44:09Z
has_accepted_license: '1'
page: 439-440
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
  (DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '6250'
author:
- first_name: Volker
  full_name: Paelke, Volker
  last_name: Paelke
- first_name: Karsten
  full_name: Nebe, Karsten
  last_name: Nebe
- first_name: Christian
  full_name: Geiger, Christian
  last_name: Geiger
- first_name: Florian
  full_name: Klompmaker, Florian
  last_name: Klompmaker
- first_name: Holger Gerhard
  full_name: Fischer, Holger Gerhard
  id: '30457'
  last_name: Fischer
citation:
  ama: Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch
    Interaction with Maps in Disaster Management Applications. <i>ISPRS - International
    Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>.
    2012;XXXIX-B8:55-60. doi:<a href="https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012">10.5194/isprsarchives-xxxix-b8-55-2012</a>
  apa: Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., &#38; Fischer, H. G. (2012).
    Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.
    <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial
    Information Sciences</i>, <i>XXXIX</i>-<i>B8</i>, 55–60. <a href="https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>
  bibtex: '@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal,
    Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8},
    DOI={<a href="https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012">10.5194/isprsarchives-xxxix-b8-55-2012</a>},
    journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing
    and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke,
    Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer,
    Holger Gerhard}, year={2012}, pages={55–60} }'
  chicago: 'Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and
    Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster
    Management Applications.” <i>ISPRS - International Archives of the Photogrammetry,
    Remote Sensing and Spatial Information Sciences</i> XXXIX-B8 (2012): 55–60. <a
    href="https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>.'
  ieee: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal,
    Multi-Touch Interaction with Maps in Disaster Management Applications,” <i>ISPRS
    - International Archives of the Photogrammetry, Remote Sensing and Spatial Information
    Sciences</i>, vol. XXXIX-B8, pp. 55–60, 2012.
  mla: Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster
    Management Applications.” <i>ISPRS - International Archives of the Photogrammetry,
    Remote Sensing and Spatial Information Sciences</i>, vol. XXXIX-B8, Copernicus
    GmbH, 2012, pp. 55–60, doi:<a href="https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012">10.5194/isprsarchives-xxxix-b8-55-2012</a>.
  short: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International
    Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
    XXXIX-B8 (2012) 55–60.
date_created: 2018-12-18T10:18:13Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.5194/isprsarchives-xxxix-b8-55-2012
language:
- iso: eng
page: 55-60
publication: ISPRS - International Archives of the Photogrammetry, Remote Sensing
  and Spatial Information Sciences
publication_identifier:
  issn:
  - 1682-1777
publication_status: published
publisher: Copernicus GmbH
status: public
title: Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications
type: journal_article
user_id: '30457'
volume: XXXIX-B8
year: '2012'
...
---
_id: '626'
abstract:
- lang: eng
  text: The design of ecient search structures for peer-to-peer systems has attracted
    a lot of attention in recent years. In this announcement we address the problem
    of nding the predecessor in a key set and present an ecient data structure called
    hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports
    PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses
    when u is the size of the universe of the keys. That is the costs only depend
    on u and not the size of the data structure. One feature of our approach is that
    it only uses the lookup interface of the hash table and therefore hash table accesses
    may be realized by any distributed hash table (DHT).
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia
    Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.
    In: <i>Proceedings of the 26th International Symposium on Distributed Computing
    (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href="https://doi.org/10.1007/978-3-642-33651-5_45">10.1007/978-3-642-33651-5_45</a>'
  apa: 'Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor
    Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
    Systems. In <i>Proceedings of the 26th International Symposium on Distributed
    Computing (DISC)</i> (pp. 435–436). <a href="https://doi.org/10.1007/978-3-642-33651-5_45">https://doi.org/10.1007/978-3-642-33651-5_45</a>'
  bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief
    Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient
    Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href="https://doi.org/10.1007/978-3-642-33651-5_45">10.1007/978-3-642-33651-5_45</a>},
    booktitle={Proceedings of the 26th International Symposium on Distributed Computing
    (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012},
    pages={435–436}, collection={LNCS} }'
  chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement:
    Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor
    Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International
    Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-33651-5_45">https://doi.org/10.1007/978-3-642-33651-5_45</a>.'
  ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor
    Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
    Systems,” in <i>Proceedings of the 26th International Symposium on Distributed
    Computing (DISC)</i>, 2012, pp. 435–436.'
  mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed
    Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries
    in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on
    Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href="https://doi.org/10.1007/978-3-642-33651-5_45">10.1007/978-3-642-33651-5_45</a>.'
  short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International
    Symposium on Distributed Computing (DISC), 2012, pp. 435–436.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_45
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:42:40Z
  date_updated: 2018-03-15T06:42:40Z
  file_id: '1239'
  file_name: 626-Predecessor-Kniesburges_Scheideler.pdf
  file_size: 184095
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:42:40Z
has_accepted_license: '1'
page: 435-436
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
  (DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for
  Efficient Predecessor Queries in Peer-to-Peer Systems'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '627'
abstract:
- lang: eng
  text: Block Abstraction Memoization (ABM) is a technique in software model checking
    that exploits the modularity of programs during verification by caching. To this
    end, ABM records the results of block analyses and reuses them if possible when
    revisiting the same block again. In this paper we present an implementation of
    ABM into the predicate-analysis component of the software-verification framework
    CPAchecker. With our participation at the Competition on Software Verification
    we aim at providing evidence that ABM can not only substantially increase the
    efficiency of predicate analysis but also enables verification of a wider range
    of programs.
author:
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
citation:
  ama: 'Wonisch D. Block Abstraction Memoization for CPAchecker. In: <i>Proceedings
    of the 18th International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems (TACAS)</i>. LNCS. ; 2012:531-533. doi:<a href="https://doi.org/10.1007/978-3-642-28756-5_41">10.1007/978-3-642-28756-5_41</a>'
  apa: Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In <i>Proceedings
    of the 18th International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems (TACAS)</i> (pp. 531–533). <a href="https://doi.org/10.1007/978-3-642-28756-5_41">https://doi.org/10.1007/978-3-642-28756-5_41</a>
  bibtex: '@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization
    for CPAchecker}, DOI={<a href="https://doi.org/10.1007/978-3-642-28756-5_41">10.1007/978-3-642-28756-5_41</a>},
    booktitle={Proceedings of the 18th International Conference on Tools and Algorithms
    for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel},
    year={2012}, pages={531–533}, collection={LNCS} }'
  chicago: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In <i>Proceedings
    of the 18th International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems (TACAS)</i>, 531–33. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-28756-5_41">https://doi.org/10.1007/978-3-642-28756-5_41</a>.
  ieee: D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in <i>Proceedings
    of the 18th International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems (TACAS)</i>, 2012, pp. 531–533.
  mla: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” <i>Proceedings
    of the 18th International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems (TACAS)</i>, 2012, pp. 531–33, doi:<a href="https://doi.org/10.1007/978-3-642-28756-5_41">10.1007/978-3-642-28756-5_41</a>.
  short: 'D. Wonisch, in: Proceedings of the 18th International Conference on Tools
    and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp.
    531–533.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-28756-5_41
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:46:05Z
  date_updated: 2018-03-15T06:46:05Z
  file_id: '1242'
  file_name: 627-WonischSV-Comp2012_01.pdf
  file_size: 184000
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:46:05Z
has_accepted_license: '1'
language:
- iso: eng
page: 531-533
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 18th International Conference on Tools and Algorithms
  for the Construction and Analysis of Systems (TACAS)
series_title: LNCS
status: public
title: Block Abstraction Memoization for CPAchecker
type: conference
user_id: '477'
year: '2012'
...