---
_id: '572'
abstract:
- lang: eng
  text: Service-oriented computing (SOC) promises to solve many issues in the area
    of distributed software development, e.g. the realization of the loose coupling
    pattern in practice through service discovery and invocation. For this purpose,
    service descriptions must comprise structural as well as behavioral information
    of the services otherwise an accurate service discovery is not possible. We addressed
    this issue in our previous paper and proposed a UML-based rich service description
    language (RSDL) providing comprehensive notations to specify service requests
    and offers.However, the automatic matching of service requests and offers specified
    in a RSDL for the purpose of service discovery is a complex task, due to multifaceted
    heterogeneity of the service partners. This heterogeneity includes the use of
    different underlying ontologies or different levels of granularity in the specification
    itself resulting in complex mappings between service requests and offers. In this
    paper, we present an automatic matching mechanism for service requests and offers
    specified in a RSDL that overcomes the underlying heterogeneity of the service
    partners.
author:
- first_name: Zille
  full_name: Huma, Zille
  last_name: Huma
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Oliver
  full_name: Juwig, Oliver
  last_name: Juwig
citation:
  ama: 'Huma Z, Gerth C, Engels G, Juwig O. Towards an Automatic Service Discovery
    for UML-based Rich Service Descriptions. In: <i>Proceedings of the ACM/IEEE 15th
    International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>.
    LNCS. ; 2012:709--725. doi:<a href="https://doi.org/10.1007/978-3-642-33666-9_45">10.1007/978-3-642-33666-9_45</a>'
  apa: Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). Towards an Automatic
    Service Discovery for UML-based Rich Service Descriptions. In <i>Proceedings of
    the ACM/IEEE 15th International Conference on Model Driven Engineering Languages
    and Systems (MoDELS)</i> (pp. 709--725). <a href="https://doi.org/10.1007/978-3-642-33666-9_45">https://doi.org/10.1007/978-3-642-33666-9_45</a>
  bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={LNCS}, title={Towards
    an Automatic Service Discovery for UML-based Rich Service Descriptions}, DOI={<a
    href="https://doi.org/10.1007/978-3-642-33666-9_45">10.1007/978-3-642-33666-9_45</a>},
    booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model
    Driven Engineering Languages and Systems (MoDELS)}, author={Huma, Zille and Gerth,
    Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709--725},
    collection={LNCS} }'
  chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards
    an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In <i>Proceedings
    of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages
    and Systems (MoDELS)</i>, 709--725. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-33666-9_45">https://doi.org/10.1007/978-3-642-33666-9_45</a>.
  ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service
    Discovery for UML-based Rich Service Descriptions,” in <i>Proceedings of the ACM/IEEE
    15th International Conference on Model Driven Engineering Languages and Systems
    (MoDELS)</i>, 2012, pp. 709--725.
  mla: Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich
    Service Descriptions.” <i>Proceedings of the ACM/IEEE 15th International Conference
    on Model Driven Engineering Languages and Systems (MoDELS)</i>, 2012, pp. 709--725,
    doi:<a href="https://doi.org/10.1007/978-3-642-33666-9_45">10.1007/978-3-642-33666-9_45</a>.
  short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE
    15th International Conference on Model Driven Engineering Languages and Systems
    (MoDELS), 2012, pp. 709--725.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:37Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/978-3-642-33666-9_45
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:38:22Z
  date_updated: 2018-03-15T09:38:22Z
  file_id: '1270'
  file_name: 572-MODELS2012-Huma_Gerth_Engels_Juwig.pdf
  file_size: 518982
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:38:22Z
has_accepted_license: '1'
language:
- iso: eng
page: 709--725
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 ACM/IEEE 15th International Conference on Model Driven
  Engineering Languages and Systems (MoDELS)
series_title: LNCS
status: public
title: Towards an Automatic Service Discovery for UML-based Rich Service Descriptions
type: conference
user_id: '477'
year: '2012'
...
---
_id: '573'
abstract:
- lang: eng
  text: In software markets of the future, customer-specific software will be developed
    on demand from distributed software and hardware services available on world-wide
    markets. Having a request, services have to be automatically discovered and composed.
    For that purpose, services have to be matched based on their specifications. For
    the accurate matching, services have to be described comprehensively that requires
    the integration of different domain-specific languages (DSLs) used for functional,
    non-functional, and infrastructural properties. Since different service providers
    use plenty of language dialects to model the same service property, their integration
    is needed for the matching. In this paper, we propose a framework for integration
    of DSLs. It is based on a parameterized abstract core language that integrates
    key concepts needed to describe a service. Parts of the core language can be substituted
    with concrete DSLs. Thus, the framework serves as a basis for the comprehensive
    specification and automatic matching of services.
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
citation:
  ama: 'Arifulina S. Towards a Framework for the Integration of Modeling Languages.
    In: W. Eisenecker U, Bucholdt C, eds. <i>Proceedings of the Doctoral Symposium
    of the 5th International Conference on Software Language Engineering 2012, Dresden,
    Germany (SLE (Doctoral Symposium))</i>. CEUR Workshop Proceedings. ; 2012:23--26.'
  apa: Arifulina, S. (2012). Towards a Framework for the Integration of Modeling Languages.
    In U. W. Eisenecker &#38; C. Bucholdt (Eds.), <i>Proceedings of the Doctoral Symposium
    of the 5th International Conference on Software Language Engineering 2012, Dresden,
    Germany (SLE (Doctoral Symposium))</i> (pp. 23--26).
  bibtex: '@inproceedings{Arifulina_2012, series={CEUR Workshop Proceedings}, title={Towards
    a Framework for the Integration of Modeling Languages}, booktitle={Proceedings
    of the Doctoral Symposium of the 5th International Conference on Software Language
    Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}, author={Arifulina,
    Svetlana}, editor={W. Eisenecker, Ulrich and Bucholdt, ChristianEditors}, year={2012},
    pages={23--26}, collection={CEUR Workshop Proceedings} }'
  chicago: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling
    Languages.” In <i>Proceedings of the Doctoral Symposium of the 5th International
    Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral
    Symposium))</i>, edited by Ulrich W. Eisenecker and Christian Bucholdt, 23--26.
    CEUR Workshop Proceedings, 2012.
  ieee: S. Arifulina, “Towards a Framework for the Integration of Modeling Languages,”
    in <i>Proceedings of the Doctoral Symposium of the 5th International Conference
    on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>,
    2012, pp. 23--26.
  mla: Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.”
    <i>Proceedings of the Doctoral Symposium of the 5th International Conference on
    Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>,
    edited by Ulrich W. Eisenecker and Christian Bucholdt, 2012, pp. 23--26.
  short: 'S. Arifulina, in: U. W. Eisenecker, C. Bucholdt (Eds.), Proceedings of the
    Doctoral Symposium of the 5th International Conference on Software Language Engineering
    2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26.'
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:37Z
ddc:
- '040'
department:
- _id: '66'
editor:
- first_name: Ulrich
  full_name: W. Eisenecker, Ulrich
  last_name: W. Eisenecker
- first_name: Christian
  full_name: Bucholdt, Christian
  last_name: Bucholdt
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:37:48Z
  date_updated: 2018-03-15T09:37:48Z
  file_id: '1269'
  file_name: 573-Framework_for_Integration_of_Modeling_Languages.pdf
  file_size: 321930
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:37:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 23--26
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 Doctoral Symposium of the 5th International Conference
  on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))
series_title: CEUR Workshop Proceedings
status: public
title: Towards a Framework for the Integration of Modeling Languages
type: conference
user_id: '477'
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: '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: '596'
abstract:
- lang: eng
  text: To meet quality-of-service requirements in changing environments, modern software
    systems adapt themselves. The structure, and correspondingly the behavior, of
    these systems undergoes continuous change. Model-driven performance engineering,
    however, assumes static system structures, behavior, and deployment. Hence, self-adaptive
    systems pose new challenges to model-driven performance engineering. There are
    a few surveys on self-adaptive systems, performance engineering, and the combination
    of both in the literature. In contrast to existing work, here we focus on model-driven
    performance analysis approaches. Based on a systematic literature review, we present
    a classication, identify open issues, and outline further research.
author:
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Markus
  full_name: Luckey, Markus
  last_name: Luckey
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
citation:
  ama: 'Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive
    Systems: A Survey. In: <i>Proceedings of the 8th ACM SigSoft International Conference
    on Quality of Software Architectures (QoSA’12)</i>. ; 2012:117-122. doi:<a href="https://doi.org/10.1145/2304696.2304716">10.1145/2304696.2304716</a>'
  apa: 'Becker, M., Luckey, M., &#38; Becker, S. (2012). Model-Driven Performance
    Engineering of Self-Adaptive Systems: A Survey. In <i>Proceedings of the 8th ACM
    SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>
    (pp. 117–122). <a href="https://doi.org/10.1145/2304696.2304716">https://doi.org/10.1145/2304696.2304716</a>'
  bibtex: '@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance
    Engineering of Self-Adaptive Systems: A Survey}, DOI={<a href="https://doi.org/10.1145/2304696.2304716">10.1145/2304696.2304716</a>},
    booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality
    of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus
    and Becker, Steffen}, year={2012}, pages={117–122} }'
  chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance
    Engineering of Self-Adaptive Systems: A Survey.” In <i>Proceedings of the 8th
    ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>,
    117–22, 2012. <a href="https://doi.org/10.1145/2304696.2304716">https://doi.org/10.1145/2304696.2304716</a>.'
  ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering
    of Self-Adaptive Systems: A Survey,” in <i>Proceedings of the 8th ACM SigSoft
    International Conference on Quality of Software Architectures (QoSA’12)</i>, 2012,
    pp. 117–122.'
  mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive
    Systems: A Survey.” <i>Proceedings of the 8th ACM SigSoft International Conference
    on Quality of Software Architectures (QoSA’12)</i>, 2012, pp. 117–22, doi:<a href="https://doi.org/10.1145/2304696.2304716">10.1145/2304696.2304716</a>.'
  short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft
    International Conference on Quality of Software Architectures (QoSA’12), 2012,
    pp. 117–122.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
ddc:
- '040'
doi: 10.1145/2304696.2304716
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:23:31Z
  date_updated: 2018-03-15T08:23:31Z
  file_id: '1256'
  file_name: 596-qosa25s-becker.pdf
  file_size: 141651
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:23:31Z
has_accepted_license: '1'
page: 117-122
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 8th ACM SigSoft International Conference on Quality
  of Software Architectures (QoSA'12)
status: public
title: 'Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey'
type: conference
user_id: '15504'
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: '610'
author:
- first_name: Mario
  full_name: Mohr, Mario
  last_name: Mohr
citation:
  ama: Mohr M. <i>Generating Prototypes of Adaptive Component-Based Software Systems
    for Performance Analysis</i>. Universität Paderborn; 2012.
  apa: Mohr, M. (2012). <i>Generating Prototypes of Adaptive Component-based Software
    Systems for Performance Analysis</i>. Universität Paderborn.
  bibtex: '@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based
    Software Systems for Performance Analysis}, publisher={Universität Paderborn},
    author={Mohr, Mario}, year={2012} }'
  chicago: Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software
    Systems for Performance Analysis</i>. Universität Paderborn, 2012.
  ieee: M. Mohr, <i>Generating Prototypes of Adaptive Component-based Software Systems
    for Performance Analysis</i>. Universität Paderborn, 2012.
  mla: Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software
    Systems for Performance Analysis</i>. Universität Paderborn, 2012.
  short: M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems
    for Performance Analysis, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:52Z
ddc:
- '040'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:13:40Z
  date_updated: 2018-03-15T08:13:40Z
  file_id: '1248'
  file_name: 610-MA_Mohr_2012_final.pdf
  file_size: 1270467
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:13:40Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Generating Prototypes of Adaptive Component-based Software Systems for Performance
  Analysis
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '614'
author:
- first_name: Sebastian
  full_name: Lehrig, Sebastian
  last_name: Lehrig
citation:
  ama: Lehrig S. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>.
    Universität Paderborn; 2012.
  apa: Lehrig, S. (2012). <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>.
    Universität Paderborn.
  bibtex: '@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen},
    publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }'
  chicago: Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>.
    Universität Paderborn, 2012.
  ieee: S. Lehrig, <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>.
    Universität Paderborn, 2012.
  mla: Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>.
    Universität Paderborn, 2012.
  short: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:51Z
date_updated: 2022-01-06T07:02:53Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Empirischer, quantitativer Vergleich von Modelltransformationssprachen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '617'
abstract:
- lang: eng
  text: In this paper, a color based feature extraction and classification approach
    for image processing in embedded systems in presented. The algorithms and data
    structures developed for this approach pay particular attention to reduce memory
    consumption and computation power of the entire image processing, since embedded
    systems usually impose strong restrictions regarding those resources. The feature
    extraction is realized in terms of an image segmentation algorithm. The criteria
    of homogeneity for merging pixels and regions is provided by the color classification
    mechanism, which incorporates appropriate methods for defining, representing and
    accessing subspaces in the working color space. By doing so, pixels and regions
    with color values that belong to the same color class can be merged. Furthermore,
    pixels with redundant color values that do not belong to any pre-defined color
    class can be completely discarded in order to minimize computational effort. Subsequently,
    the extracted regions are converted to a more convenient feature representation
    in terms of statistical moments up to and including second order. For evaluation,
    the whole image processing approach is applied to a mobile representative of embedded
    systems within the scope of a simple real-world scenario.
author:
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Bernd
  full_name: Kleinjohann, Bernd
  last_name: Kleinjohann
- first_name: Elisabeth
  full_name: Kleinjohann, Elisabeth
  id: '15588'
  last_name: Kleinjohann
- first_name: Maarten
  full_name: Bieshaar, Maarten
  last_name: Bieshaar
citation:
  ama: 'Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based
    Image Segmentation and Feature Classification for Image Processing in Embedded
    Systems. In: <i>Proceedings of the Fourth International Conference on Resource
    Intensive Applications and Services (INTENSIVE)</i>. ; 2012:22-29.'
  apa: Jungmann, A., Kleinjohann, B., Kleinjohann, E., &#38; Bieshaar, M. (2012).
    Efficient Color-Based Image Segmentation and Feature Classification for Image
    Processing in Embedded Systems. In <i>Proceedings of the Fourth International
    Conference on Resource Intensive Applications and Services (INTENSIVE)</i> (pp.
    22–29).
  bibtex: '@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient
    Color-Based Image Segmentation and Feature Classification for Image Processing
    in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference
    on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann,
    Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten},
    year={2012}, pages={22–29} }'
  chicago: Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten
    Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification
    for Image Processing in Embedded Systems.” In <i>Proceedings of the Fourth International
    Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 22–29,
    2012.
  ieee: A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based
    Image Segmentation and Feature Classification for Image Processing in Embedded
    Systems,” in <i>Proceedings of the Fourth International Conference on Resource
    Intensive Applications and Services (INTENSIVE)</i>, 2012, pp. 22–29.
  mla: Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature
    Classification for Image Processing in Embedded Systems.” <i>Proceedings of the
    Fourth International Conference on Resource Intensive Applications and Services
    (INTENSIVE)</i>, 2012, pp. 22–29.
  short: 'A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings
    of the Fourth International Conference on Resource Intensive Applications and
    Services (INTENSIVE), 2012, pp. 22–29.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
ddc:
- '040'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:47:50Z
  date_updated: 2018-03-15T06:47:50Z
  file_id: '1245'
  file_name: 617-INTENSIVE2012-Jungmann.pdf
  file_size: 2787964
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:47:50Z
has_accepted_license: '1'
page: 22-29
project:
- _id: '1'
  name: SFB 901
- _id: '10'
  name: SFB 901 - Subprojekt B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the Fourth International Conference on Resource Intensive
  Applications and Services (INTENSIVE)
related_material:
  link:
  - relation: confirmation
    url: http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031
status: public
title: Efficient Color-Based Image Segmentation and Feature Classification for Image
  Processing in Embedded Systems
type: conference
user_id: '477'
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: '624'
author:
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
citation:
  ama: Jakobs M-C. <i>Change and Validity Analysis in Deductive Program Verification</i>.
    Universität Paderborn; 2012.
  apa: Jakobs, M.-C. (2012). <i>Change and Validity Analysis in Deductive Program
    Verification</i>. Universität Paderborn.
  bibtex: '@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program
    Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine},
    year={2012} }'
  chicago: Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program
    Verification</i>. Universität Paderborn, 2012.
  ieee: M.-C. Jakobs, <i>Change and Validity Analysis in Deductive Program Verification</i>.
    Universität Paderborn, 2012.
  mla: Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program
    Verification</i>. Universität Paderborn, 2012.
  short: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Change and Validity Analysis in Deductive Program Verification
type: mastersthesis
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'
...
---
_id: '630'
abstract:
- lang: eng
  text: Maintaining software systems requires up-to-date models of these systems to
    systematically plan, analyse and execute the necessary reengineering steps. Often,
    no or only outdated models of such systems exist. Thus, a reverse engineering
    step is needed that recovers the system’s components, subsystems and connectors.
    However, reverse engineering methods are severely impacted by design deficiencies
    in the system’s code base, e.g., they lead to wrong component structures. Several
    approaches exist today for the reverse engineering of component-based systems,
    however, none of them explicitly integrates a systematic design deficiency removal
    into the process to improve the quality of the reverse engineered architecture.
    Therefore, in our Archimetrix approach, we propose to regard the most relevant
    deficiencies with respect to the reverse engineered component-based architecture
    and support reengineers by presenting the architectural consequences of removing
    a given deficiency. We validate our approach on the Common Component Modeling
    Example and show that we are able to identify relevant deficiencies and that their
    removal leads to an improved reengineered architecture.
author:
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Markus
  full_name: von Detten, Markus
  last_name: von Detten
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
citation:
  ama: 'Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture
    Recovery in the Presence of Design Deficiencies. In: <i>Proceedings of the 16th
    European Conference on Software Maintenance and Reengineering (CSMR)</i>. ; 2012:255-264.
    doi:<a href="https://doi.org/10.1109/CSMR.2012.33">10.1109/CSMR.2012.33</a>'
  apa: 'Platenius, M. C., von Detten, M., &#38; Becker, S. (2012). Archimetrix: Improved
    Software Architecture Recovery in the Presence of Design Deficiencies. In <i>Proceedings
    of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>
    (pp. 255–264). <a href="https://doi.org/10.1109/CSMR.2012.33">https://doi.org/10.1109/CSMR.2012.33</a>'
  bibtex: '@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved
    Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={<a
    href="https://doi.org/10.1109/CSMR.2012.33">10.1109/CSMR.2012.33</a>}, booktitle={Proceedings
    of the 16th European Conference on Software Maintenance and Reengineering (CSMR)},
    author={Platenius, Marie Christin and von Detten, Markus and Becker, Steffen},
    year={2012}, pages={255–264} }'
  chicago: 'Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix:
    Improved Software Architecture Recovery in the Presence of Design Deficiencies.”
    In <i>Proceedings of the 16th European Conference on Software Maintenance and
    Reengineering (CSMR)</i>, 255–64, 2012. <a href="https://doi.org/10.1109/CSMR.2012.33">https://doi.org/10.1109/CSMR.2012.33</a>.'
  ieee: 'M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software
    Architecture Recovery in the Presence of Design Deficiencies,” in <i>Proceedings
    of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>,
    2012, pp. 255–264.'
  mla: 'Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture
    Recovery in the Presence of Design Deficiencies.” <i>Proceedings of the 16th European
    Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–64,
    doi:<a href="https://doi.org/10.1109/CSMR.2012.33">10.1109/CSMR.2012.33</a>.'
  short: 'M.C. Platenius, M. von Detten, S. Becker, in: Proceedings of the 16th European
    Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '76'
doi: 10.1109/CSMR.2012.33
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:37:13Z
  date_updated: 2018-03-15T06:37:13Z
  file_id: '1236'
  file_name: 630-CSMR2012-PlateniusDettenBecker.pdf
  file_size: 723739
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:37:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 255-264
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 16th European Conference on Software Maintenance and
  Reengineering (CSMR)
status: public
title: 'Archimetrix: Improved Software Architecture Recovery in the Presence of Design
  Deficiencies'
type: conference
user_id: '477'
year: '2012'
...
---
_id: '631'
abstract:
- lang: eng
  text: Maintaining software systems requires up-to-date models of these systems to
    systematically plan, analyze, and execute the necessary reengineering steps. Often,
    no or only outdated models of such systems exist.Thus, a reverse engineering step
    is needed that recovers the system's components, subsystems, and connectors. However,
    reverse engineering methods are severely impacted by design deficiencies in the
    system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix
    enables the reengineer to detect the most relevant deficiencies with respect to
    a reverseengineered component-based architecture and supports him by presenting
    the architectural consequences of removinga given deficiency.
author:
- first_name: Markus
  full_name: von Detten, Markus
  last_name: von Detten
citation:
  ama: 'von Detten M. Archimetrix: A Tool for Deficiency-Aware Software Architecture
    Reconstruction. In: <i>Proceedings of the 19th Working Conference on Reverse Engineering
    (WCRE)</i>. ; 2012:503-504. doi:<a href="https://doi.org/10.1109/WCRE.2012.61">10.1109/WCRE.2012.61</a>'
  apa: 'von Detten, M. (2012). Archimetrix: A Tool for Deficiency-Aware Software Architecture
    Reconstruction. In <i>Proceedings of the 19th Working Conference on Reverse Engineering
    (WCRE)</i> (pp. 503–504). <a href="https://doi.org/10.1109/WCRE.2012.61">https://doi.org/10.1109/WCRE.2012.61</a>'
  bibtex: '@inproceedings{von Detten_2012, title={Archimetrix: A Tool for Deficiency-Aware
    Software Architecture Reconstruction}, DOI={<a href="https://doi.org/10.1109/WCRE.2012.61">10.1109/WCRE.2012.61</a>},
    booktitle={Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)},
    author={von Detten, Markus}, year={2012}, pages={503–504} }'
  chicago: 'Detten, Markus von. “Archimetrix: A Tool for Deficiency-Aware Software
    Architecture Reconstruction.” In <i>Proceedings of the 19th Working Conference
    on Reverse Engineering (WCRE)</i>, 503–4, 2012. <a href="https://doi.org/10.1109/WCRE.2012.61">https://doi.org/10.1109/WCRE.2012.61</a>.'
  ieee: 'M. von Detten, “Archimetrix: A Tool for Deficiency-Aware Software Architecture
    Reconstruction,” in <i>Proceedings of the 19th Working Conference on Reverse Engineering
    (WCRE)</i>, 2012, pp. 503–504.'
  mla: 'von Detten, Markus. “Archimetrix: A Tool for Deficiency-Aware Software Architecture
    Reconstruction.” <i>Proceedings of the 19th Working Conference on Reverse Engineering
    (WCRE)</i>, 2012, pp. 503–04, doi:<a href="https://doi.org/10.1109/WCRE.2012.61">10.1109/WCRE.2012.61</a>.'
  short: 'M. von Detten, in: Proceedings of the 19th Working Conference on Reverse
    Engineering (WCRE), 2012, pp. 503–504.'
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
ddc:
- '040'
doi: 10.1109/WCRE.2012.61
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:36:37Z
  date_updated: 2018-03-15T06:36:37Z
  file_id: '1235'
  file_name: 631-WCRE2012-vonDetten.pdf
  file_size: 258563
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:36:37Z
has_accepted_license: '1'
page: '503 - 504 '
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 19th Working Conference on Reverse Engineering (WCRE)
status: public
title: 'Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '639'
abstract:
- lang: eng
  text: Service-oriented computing (SOC) emerges as a promising trend solving many
    issues in distributed software development. Following the essence of SOC, service
    descriptions are dened by the service partners based on current standards, e.g.,
    WSDL [15]. However, these standards are mostly structural and do not provide any
    behavioral description, which may lead to inaccurate service discovery results.
    There is a requirement for a rich service description language for service partners
    that encompasses the structural as well as behavioral information in the service
    description. Furthermore, service discovery based on an automatic matching of
    these comprehensive service descriptions is a complex task, which is further complicated
    through the heterogeneity of the service partners' domains in terms of dierent
    underlying ontologies. In this paper, we propose a rich service description language
    based on UML, which allows the specication of structural and behavioral features
    of a service. In addition, we also briefly discuss how some existing matching
    approaches can be extended to dene an automatic matching mechanism for rich service
    descriptions resolving the underlying heterogeneity.
author:
- first_name: Zille
  full_name: Huma, Zille
  last_name: Huma
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Oliver
  full_name: Juwig, Oliver
  last_name: Juwig
citation:
  ama: 'Huma Z, Gerth C, Engels G, Juwig O. A UML-based Rich Service Description for
    Automatic Service Discovery. In: <i>Proceedings of the Forum at the CAiSE’12 Conference
    on Advanced Information Systems Engineering</i>. CEUR Workshop Proceedings. ;
    2012:90--97.'
  apa: Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). A UML-based Rich Service
    Description for Automatic Service Discovery. In <i>Proceedings of the Forum at
    the CAiSE’12 Conference on Advanced Information Systems Engineering</i> (pp. 90--97).
  bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={CEUR Workshop Proceedings},
    title={A UML-based Rich Service Description for Automatic Service Discovery},
    booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information
    Systems Engineering}, author={Huma, Zille and Gerth, Christian and Engels, Gregor
    and Juwig, Oliver}, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings}
    }'
  chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “A UML-Based
    Rich Service Description for Automatic Service Discovery.” In <i>Proceedings of
    the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>,
    90--97. CEUR Workshop Proceedings, 2012.
  ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “A UML-based Rich Service Description
    for Automatic Service Discovery,” in <i>Proceedings of the Forum at the CAiSE’12
    Conference on Advanced Information Systems Engineering</i>, 2012, pp. 90--97.
  mla: Huma, Zille, et al. “A UML-Based Rich Service Description for Automatic Service
    Discovery.” <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced
    Information Systems Engineering</i>, 2012, pp. 90--97.
  short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the Forum at
    the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp.
    90--97.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:03Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T14:13:48Z
  date_updated: 2018-03-14T14:13:48Z
  file_id: '1231'
  file_name: 639-HumaGerthCAiSE12.pdf
  file_size: 693236
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T14:13:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 90--97
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 Forum at the CAiSE'12 Conference on Advanced Information
  Systems Engineering
series_title: CEUR Workshop Proceedings
status: public
title: A UML-based Rich Service Description for Automatic Service Discovery
type: conference
user_id: '477'
year: '2012'
...
---
_id: '5183'
author:
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
- first_name: Patrick
  full_name: Lam, Patrick
  last_name: Lam
- first_name: Laurie
  full_name: Hendren, Laurie
  last_name: Hendren
citation:
  ama: Bodden E, Lam P, Hendren L. Partially Evaluating Finite-State Runtime Monitors
    Ahead of Time. <i>ACM Transactions on Programming Languages and Systems</i>. 2012;34(2):1-52.
    doi:<a href="https://doi.org/10.1145/2220365.2220366">10.1145/2220365.2220366</a>
  apa: Bodden, E., Lam, P., &#38; Hendren, L. (2012). Partially Evaluating Finite-State
    Runtime Monitors Ahead of Time. <i>ACM Transactions on Programming Languages and
    Systems</i>, <i>34</i>(2), 1–52. <a href="https://doi.org/10.1145/2220365.2220366">https://doi.org/10.1145/2220365.2220366</a>
  bibtex: '@article{Bodden_Lam_Hendren_2012, title={Partially Evaluating Finite-State
    Runtime Monitors Ahead of Time}, volume={34}, DOI={<a href="https://doi.org/10.1145/2220365.2220366">10.1145/2220365.2220366</a>},
    number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={Association
    for Computing Machinery (ACM)}, author={Bodden, Eric and Lam, Patrick and Hendren,
    Laurie}, year={2012}, pages={1–52} }'
  chicago: 'Bodden, Eric, Patrick Lam, and Laurie Hendren. “Partially Evaluating Finite-State
    Runtime Monitors Ahead of Time.” <i>ACM Transactions on Programming Languages
    and Systems</i> 34, no. 2 (2012): 1–52. <a href="https://doi.org/10.1145/2220365.2220366">https://doi.org/10.1145/2220365.2220366</a>.'
  ieee: E. Bodden, P. Lam, and L. Hendren, “Partially Evaluating Finite-State Runtime
    Monitors Ahead of Time,” <i>ACM Transactions on Programming Languages and Systems</i>,
    vol. 34, no. 2, pp. 1–52, 2012.
  mla: Bodden, Eric, et al. “Partially Evaluating Finite-State Runtime Monitors Ahead
    of Time.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 34,
    no. 2, Association for Computing Machinery (ACM), 2012, pp. 1–52, doi:<a href="https://doi.org/10.1145/2220365.2220366">10.1145/2220365.2220366</a>.
  short: E. Bodden, P. Lam, L. Hendren, ACM Transactions on Programming Languages
    and Systems 34 (2012) 1–52.
date_created: 2018-10-31T10:43:13Z
date_updated: 2022-01-06T07:01:41Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1145/2220365.2220366
extern: '1'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:42:24Z
  date_updated: 2018-11-02T15:42:24Z
  file_id: '5310'
  file_name: a7-bodden.pdf
  file_size: 2280938
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:42:24Z
has_accepted_license: '1'
intvolume: '        34'
issue: '2'
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/blh12partially.pdf
page: 1-52
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '12'
  name: SFB 901 - Subproject B4
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
  issn:
  - 0164-0925
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Partially Evaluating Finite-State Runtime Monitors Ahead of Time
type: journal_article
user_id: '477'
volume: 34
year: '2012'
...
---
_id: '565'
abstract:
- lang: eng
  text: 'In model-driven development of multi-layer systems (e.g. application, platform
    and infrastructure), each layer is usually described by separate models. When
    generating analysis models or code, these separate models rst of all need to be
    linked. Hence, existing model transformations for single layers cannot be simply
    re-used. In this paper, we present a modular approach to the transformation of
    multi-layer systems. It employs model weaving to dene the interconnections between
    models of dierent layers. The weaving models themselves are subject to model transformations:
    The result of transforming a weaving model constitutes a conguration for the models
    obtained by transforming single layers, thereby allowing for a re-use of existing
    model transformations. We exemplify our approach by the generation of analysis
    models for component-based software.'
author:
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
citation:
  ama: 'Besova G, Walther S, Wehrheim H, Becker S. Weaving-based configuration and
    modular transformation of multi-layer systems. In: <i>Proceedings of the 15th
    International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>.
    LNCS. ; 2012:776-792. doi:<a href="https://doi.org/10.1007/978-3-642-33666-9_49">10.1007/978-3-642-33666-9_49</a>'
  apa: Besova, G., Walther, S., Wehrheim, H., &#38; Becker, S. (2012). Weaving-based
    configuration and modular transformation of multi-layer systems. In <i>Proceedings
    of the 15th International Conference on Model Driven Engineering Languages &#38;
    Systems (MoDELS)</i> (pp. 776–792). <a href="https://doi.org/10.1007/978-3-642-33666-9_49">https://doi.org/10.1007/978-3-642-33666-9_49</a>
  bibtex: '@inproceedings{Besova_Walther_Wehrheim_Becker_2012, series={LNCS}, title={Weaving-based
    configuration and modular transformation of multi-layer systems}, DOI={<a href="https://doi.org/10.1007/978-3-642-33666-9_49">10.1007/978-3-642-33666-9_49</a>},
    booktitle={Proceedings of the 15th International Conference on Model Driven Engineering
    Languages &#38; Systems (MoDELS)}, author={Besova, Galina and Walther, Sven and
    Wehrheim, Heike and Becker, Steffen}, year={2012}, pages={776–792}, collection={LNCS}
    }'
  chicago: Besova, Galina, Sven Walther, Heike Wehrheim, and Steffen Becker. “Weaving-Based
    Configuration and Modular Transformation of Multi-Layer Systems.” In <i>Proceedings
    of the 15th International Conference on Model Driven Engineering Languages &#38;
    Systems (MoDELS)</i>, 776–92. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-33666-9_49">https://doi.org/10.1007/978-3-642-33666-9_49</a>.
  ieee: G. Besova, S. Walther, H. Wehrheim, and S. Becker, “Weaving-based configuration
    and modular transformation of multi-layer systems,” in <i>Proceedings of the 15th
    International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS)</i>,
    2012, pp. 776–792.
  mla: Besova, Galina, et al. “Weaving-Based Configuration and Modular Transformation
    of Multi-Layer Systems.” <i>Proceedings of the 15th International Conference on
    Model Driven Engineering Languages &#38; Systems (MoDELS)</i>, 2012, pp. 776–92,
    doi:<a href="https://doi.org/10.1007/978-3-642-33666-9_49">10.1007/978-3-642-33666-9_49</a>.
  short: 'G. Besova, S. Walther, H. Wehrheim, S. Becker, in: Proceedings of the 15th
    International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS),
    2012, pp. 776–792.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:20Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-33666-9_49
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:24:06Z
  date_updated: 2018-03-15T10:24:06Z
  file_id: '1276'
  file_name: 565-Besova_et_al._-_2012_-_Weaving-Based_Configuration_and_Modular_Transformation_of_Multi-layer_Systems_01.pdf
  file_size: 589972
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:24:06Z
has_accepted_license: '1'
language:
- iso: eng
page: 776-792
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Model Driven Engineering
  Languages & Systems (MoDELS)
series_title: LNCS
status: public
title: Weaving-based configuration and modular transformation of multi-layer systems
type: conference
user_id: '477'
year: '2012'
...
---
_id: '644'
abstract:
- lang: eng
  text: In reverse engineering, dynamic pattern detection is accomplished by collecting
    execution traces and comparing them to expected behavioral patterns. The traces
    are collected by manually executing the program in question and therefore represent
    only part of all relevant program behavior. This can lead to false conclusions
    about the detected patterns. In this paper, we propose to generate all relevant
    program traces by using symbolic execution. In order to reduce the created trace
    data, we allow to limit the trace collection to a user-selectable subset of the
    statically detected pattern candidates.
author:
- first_name: Markus
  full_name: von Detten, Markus
  last_name: von Detten
citation:
  ama: 'von Detten M. Towards Systematic, Comprehensive Trace Generation for Behavioral
    Pattern Detection through Symbolic Execution. In: <i>Proceedings of the 10th ACM
    SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
    (PASTE)</i>. ; 2011:17-20. doi:<a href="https://doi.org/10.1145/2024569.2024573">10.1145/2024569.2024573</a>'
  apa: von Detten, M. (2011). Towards Systematic, Comprehensive Trace Generation for
    Behavioral Pattern Detection through Symbolic Execution. In <i>Proceedings of
    the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and
    Engineering (PASTE)</i> (pp. 17–20). <a href="https://doi.org/10.1145/2024569.2024573">https://doi.org/10.1145/2024569.2024573</a>
  bibtex: '@inproceedings{von Detten_2011, title={Towards Systematic, Comprehensive
    Trace Generation for Behavioral Pattern Detection through Symbolic Execution},
    DOI={<a href="https://doi.org/10.1145/2024569.2024573">10.1145/2024569.2024573</a>},
    booktitle={Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis
    for Software Tools and Engineering (PASTE)}, author={von Detten, Markus}, year={2011},
    pages={17–20} }'
  chicago: Detten, Markus von. “Towards Systematic, Comprehensive Trace Generation
    for Behavioral Pattern Detection through Symbolic Execution.” In <i>Proceedings
    of the 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools
    and Engineering (PASTE)</i>, 17–20, 2011. <a href="https://doi.org/10.1145/2024569.2024573">https://doi.org/10.1145/2024569.2024573</a>.
  ieee: M. von Detten, “Towards Systematic, Comprehensive Trace Generation for Behavioral
    Pattern Detection through Symbolic Execution,” in <i>Proceedings of the 10th ACM
    SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
    (PASTE)</i>, 2011, pp. 17–20.
  mla: von Detten, Markus. “Towards Systematic, Comprehensive Trace Generation for
    Behavioral Pattern Detection through Symbolic Execution.” <i>Proceedings of the
    10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
    (PASTE)</i>, 2011, pp. 17–20, doi:<a href="https://doi.org/10.1145/2024569.2024573">10.1145/2024569.2024573</a>.
  short: 'M. von Detten, in: Proceedings of the 10th ACM SIGPLAN/SIGSOFT Workshop
    on Program Analysis for Software Tools and Engineering (PASTE), 2011, pp. 17–20.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
doi: 10.1145/2024569.2024573
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T14:08:32Z
  date_updated: 2018-03-14T14:08:32Z
  file_id: '1229'
  file_name: 644-paste09s-vonDetten_01.pdf
  file_size: 121611
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T14:08:32Z
has_accepted_license: '1'
page: 17-20
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 10th ACM SIGPLAN/SIGSOFT Workshop on Program Analysis
  for Software Tools and Engineering (PASTE)
status: public
title: Towards Systematic, Comprehensive Trace Generation for Behavioral Pattern Detection
  through Symbolic Execution
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '647'
author:
- first_name: Michael
  full_name: Leuschel, Michael
  last_name: Leuschel
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: Leuschel M, Wehrheim H. Selected papers on Integrated Formal Methods (iFM09).
    <i>Science of Computer Programming</i>. 2011;(10):835--836. doi:<a href="https://doi.org/10.1016/j.scico.2011.01.009">10.1016/j.scico.2011.01.009</a>
  apa: Leuschel, M., &#38; Wehrheim, H. (2011). Selected papers on Integrated Formal
    Methods (iFM09). <i>Science of Computer Programming</i>, (10), 835--836. <a href="https://doi.org/10.1016/j.scico.2011.01.009">https://doi.org/10.1016/j.scico.2011.01.009</a>
  bibtex: '@article{Leuschel_Wehrheim_2011, title={Selected papers on Integrated Formal
    Methods (iFM09)}, DOI={<a href="https://doi.org/10.1016/j.scico.2011.01.009">10.1016/j.scico.2011.01.009</a>},
    number={10}, journal={Science of Computer Programming}, publisher={Elsevier},
    author={Leuschel, Michael and Wehrheim, Heike}, year={2011}, pages={835--836}
    }'
  chicago: 'Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated
    Formal Methods (IFM09).” <i>Science of Computer Programming</i>, no. 10 (2011):
    835--836. <a href="https://doi.org/10.1016/j.scico.2011.01.009">https://doi.org/10.1016/j.scico.2011.01.009</a>.'
  ieee: M. Leuschel and H. Wehrheim, “Selected papers on Integrated Formal Methods
    (iFM09),” <i>Science of Computer Programming</i>, no. 10, pp. 835--836, 2011.
  mla: Leuschel, Michael, and Heike Wehrheim. “Selected Papers on Integrated Formal
    Methods (IFM09).” <i>Science of Computer Programming</i>, no. 10, Elsevier, 2011,
    pp. 835--836, doi:<a href="https://doi.org/10.1016/j.scico.2011.01.009">10.1016/j.scico.2011.01.009</a>.
  short: M. Leuschel, H. Wehrheim, Science of Computer Programming (2011) 835--836.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2011.01.009
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T13:56:48Z
  date_updated: 2018-03-14T13:56:48Z
  file_id: '1226'
  file_name: 647-LeuschelWehrheim.pdf
  file_size: 139105
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T13:56:48Z
has_accepted_license: '1'
issue: '10'
language:
- iso: eng
page: 835--836
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: Selected papers on Integrated Formal Methods (iFM09)
type: journal_article
user_id: '477'
year: '2011'
...
---
_id: '649'
abstract:
- lang: eng
  text: 'Today, the concept of service oriented architectures provides a way of building
    integrated solutions out of existing services. To this end, services from different
    providers are composed using advanced orchestration and choreography techniques.
    However, while this principle allows for greater flexibility at a smaller cost,
    the use of third party services also includes a risk: Deployed services might
    not work as claimed by their providers. In this paper, we propose a technique
    for analyzing the expected reliability of service compositions based on ratings
    given by (previous) service users. Every service thereby comes with a reputation,
    and the analysis computes an overall reliability of a service composition from
    the reputations of its constituent services. The proposed model-driven approach
    proceeds by translating statechart models of service compositions into input for
    a probabilistic model checker (PRISM) using state-of-the-art model transformations
    techniques. The approach has been implemented as an Eclipse plug-in and is fully
    compliant with UML.'
author:
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Annika
  full_name: Wagner, Annika
  last_name: Wagner
citation:
  ama: Besova G, Wehrheim H, Wagner A. Reputation-based Reliability Prediction of
    Service Compositions. <i>Electronic Notes in Theoretical Computer Science</i>.
    2011;(2):3-16. doi:<a href="https://doi.org/10.1016/j.entcs.2011.11.008">10.1016/j.entcs.2011.11.008</a>
  apa: Besova, G., Wehrheim, H., &#38; Wagner, A. (2011). Reputation-based Reliability
    Prediction of Service Compositions. <i>Electronic Notes in Theoretical Computer
    Science</i>, (2), 3–16. <a href="https://doi.org/10.1016/j.entcs.2011.11.008">https://doi.org/10.1016/j.entcs.2011.11.008</a>
  bibtex: '@article{Besova_Wehrheim_Wagner_2011, title={Reputation-based Reliability
    Prediction of Service Compositions}, DOI={<a href="https://doi.org/10.1016/j.entcs.2011.11.008">10.1016/j.entcs.2011.11.008</a>},
    number={2}, journal={Electronic Notes in Theoretical Computer Science}, publisher={Elsevier},
    author={Besova, Galina and Wehrheim, Heike and Wagner, Annika}, year={2011}, pages={3–16}
    }'
  chicago: 'Besova, Galina, Heike Wehrheim, and Annika Wagner. “Reputation-Based Reliability
    Prediction of Service Compositions.” <i>Electronic Notes in Theoretical Computer
    Science</i>, no. 2 (2011): 3–16. <a href="https://doi.org/10.1016/j.entcs.2011.11.008">https://doi.org/10.1016/j.entcs.2011.11.008</a>.'
  ieee: G. Besova, H. Wehrheim, and A. Wagner, “Reputation-based Reliability Prediction
    of Service Compositions,” <i>Electronic Notes in Theoretical Computer Science</i>,
    no. 2, pp. 3–16, 2011.
  mla: Besova, Galina, et al. “Reputation-Based Reliability Prediction of Service
    Compositions.” <i>Electronic Notes in Theoretical Computer Science</i>, no. 2,
    Elsevier, 2011, pp. 3–16, doi:<a href="https://doi.org/10.1016/j.entcs.2011.11.008">10.1016/j.entcs.2011.11.008</a>.
  short: G. Besova, H. Wehrheim, A. Wagner, Electronic Notes in Theoretical Computer
    Science (2011) 3–16.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.entcs.2011.11.008
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T13:55:38Z
  date_updated: 2018-03-14T13:55:38Z
  file_id: '1225'
  file_name: 649-ETAPS2011-Besova-Wehrheim-Wagner_01.pdf
  file_size: 534727
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T13:55:38Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 3-16
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Electronic Notes in Theoretical Computer Science
publisher: Elsevier
status: public
title: Reputation-based Reliability Prediction of Service Compositions
type: journal_article
user_id: '477'
year: '2011'
...