---
_id: '162'
author:
- first_name: Guangli
full_name: Zhang, Guangli
last_name: Zhang
citation:
ama: 'Zhang G. Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn; 2016.'
apa: 'Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn.'
bibtex: '@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang,
Guangli}, year={2016} }'
chicago: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs
into Precise and Approximate Portions. Universität Paderborn, 2016.'
ieee: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions. Universität Paderborn, 2016.'
mla: 'Zhang, Guangli. Program Slicing: A Way of Separating WHILE Programs into
Precise and Approximate Portions. Universität Paderborn, 2016.'
short: 'G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise
and Approximate Portions, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:45Z
department:
- _id: '77'
language:
- iso: eng
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: 'Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate
Portions'
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '133'
abstract:
- lang: eng
text: .
author:
- first_name: Markus
full_name: Dewender, Markus
last_name: Dewender
citation:
ama: Dewender M. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn; 2016.
apa: Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin.
Universität Paderborn.
bibtex: '@book{Dewender_2016, title={Verifikation von Service Kompositionen mit
Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016}
}'
chicago: Dewender, Markus. Verifikation von Service Kompositionen mit Spin.
Universität Paderborn, 2016.
ieee: M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
mla: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität
Paderborn, 2016.
short: M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '77'
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Spin
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '134'
abstract:
- lang: eng
text: .
author:
- first_name: Philipp
full_name: Heinisch, Philipp
last_name: Heinisch
citation:
ama: Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn; 2016.
apa: Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn.
bibtex: '@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit
Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016}
}'
chicago: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
ieee: P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität
Paderborn, 2016.
mla: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog.
Universität Paderborn, 2016.
short: P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:34Z
department:
- _id: '77'
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Verifikation von Service Kompositionen mit Prolog
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '250'
abstract:
- lang: eng
text: Before execution, users should formally validate the correctness of software
received from untrusted providers. To accelerate this validation, in the proof
carrying code (PCC) paradigm the provider delivers the software together with
a certificate, a formal proof of the software’s correctness. Thus, the user only
checks if the attached certificate shows correctness of the delivered software.Recently,
we introduced configurable program certification, a generic, PCC based framework
supporting various software analyses and safety properties. Evaluation of our
framework revealed that validation suffers from certificate reading. In this paper,
we present two orthogonal approaches which improve certificate validation, both
reducing the impact of certificate reading. The first approach reduces the certificate
size, storing information only if it cannot easily be recomputed. The second approach
partitions the certificate into independently checkable parts. The trick is to
read parts of the certificate while already checking read parts. Our experiments
show that validation highly benefits from our improvements.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction
and Partitioning. In: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12'
apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning. In Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12
bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable
Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12},
booktitle={Proceedings of the 13th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174},
collection={LNCS} }'
chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation
by Certificate Reduction and Partitioning.” In Proceedings of the 13th International
Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS,
2015. https://doi.org/10.1007/978-3-319-22969-0_12.
ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning,” in Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.
mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate
Reduction and Partitioning.” Proceedings of the 13th International Conference
on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12.
short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software
Engineering and Formal Methods (SEFM), 2015, pp. 159--174.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-22969-0_12
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:45:15Z
date_updated: 2018-03-21T09:45:15Z
file_id: '1489'
file_name: 250-Jakobs2015.pdf
file_size: 724308
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:45:15Z
has_accepted_license: '1'
language:
- iso: eng
page: 159--174
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 13th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
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 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
citation:
ama: Besova G. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn; 2015.
apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn.
bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:47:14Z
date_updated: 2018-03-21T09:47:14Z
file_id: '1492'
file_name: 246-Dissertation_-_Besova.pdf
file_size: 10091866
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:47:14Z
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
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '262'
abstract:
- lang: eng
text: Programs from Proofs" is a generic method which generates new programs out
of correctness proofs of given programs. The technique ensures that the new and
given program are behaviorally equivalent and that the new program is easily verifiable,
thus serving as an alternative to proof-carrying code concepts. So far, this generic
method has one instantiation that verifies type-state properties of programs.
In this paper, we present a whole range of new instantiations, all based on data
ow analyses. More precisely, we show how an imprecise but fast data ow analysis
can be enhanced with a predicate analysis as to yield a precise but expensive
analysis. Out of the safety proofs of this analysis, we generate new programs,
again behaviorally equivalent to the given ones, which are easily verifiable"
in the sense that now the data ow analysis alone can yield precise results. An
experimental evaluation practically supports our claim of easy verification.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses.
In: Proceedings of the 30th Annual ACM Symposium on Applied Computing.
SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690'
apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated
Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied
Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690
bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs
from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690},
booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736},
collection={SAC ’15} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.
ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow
Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing,
2015, pp. 1729–1736.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium
on Applied Computing, 2015, pp. 1729–1736.'
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2695664.2695690
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:34Z
date_updated: 2018-03-21T09:35:34Z
file_id: '1483'
file_name: 262-mainSACfinal.pdf
file_size: 554583
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 1729-1736
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 30th Annual ACM Symposium on Applied Computing
series_title: SAC '15
status: public
title: Programs from Proofs of Predicated Dataflow Analyses
type: conference
user_id: '477'
year: '2015'
...
---
_id: '290'
abstract:
- lang: eng
text: 'Model transformation is a key concept in model-driven software engineering.
The definition of model transformations is usually based on meta-models describing
the abstract syntax of languages. While meta-models are thereby able to abstract
from uperfluous details of concrete syntax, they often loose structural information
inherent in languages, like information on model elements always occurring together
in particular shapes. As a consequence, model transformations cannot naturally
re-use language structures, thus leading to unnecessary complexity in their development
as well as in quality assurance.In this paper, we propose a new approach to model
transformation development which allows to simplify the developed transformations
and improve their quality via the exploitation of the languages׳ structures. The
approach is based on context-free graph grammars and transformations defined by
pairing productions of source and target grammars. We show that such transformations
have important properties: they terminate and are sound, complete, and deterministic.'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
- first_name: Dominik
full_name: Steenken, Dominik
last_name: Steenken
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition,
execution, and quality properties. Computer Languages, Systems & Structures.
2015:116-138. doi:10.1016/j.cl.2015.05.003'
apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations:
Definition, execution, and quality properties. Computer Languages, Systems
& Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003'
bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations:
Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003},
journal={Computer Languages, Systems & Structures}, publisher={Elsevier},
author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015},
pages={116–138} }'
chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model
Transformations: Definition, Execution, and Quality Properties.” Computer Languages,
Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.'
ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations:
Definition, execution, and quality properties,” Computer Languages, Systems
& Structures, pp. 116–138, 2015.'
mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution,
and Quality Properties.” Computer Languages, Systems & Structures,
Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.'
short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures
(2015) 116–138.
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:43Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.cl.2015.05.003
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:22:03Z
date_updated: 2018-03-21T09:22:03Z
file_id: '1464'
file_name: 290-BSW15-main.pdf
file_size: 1329478
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:22:03Z
has_accepted_license: '1'
language:
- iso: eng
page: 116-138
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Languages, Systems & Structures
publisher: Elsevier
status: public
title: 'Grammar-based model transformations: Definition, execution, and quality properties'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3162'
author:
- first_name: Steffen
full_name: Ziegert, Steffen
last_name: Ziegert
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration.
Computer Science - R & D. 2015;(3-4):303--320. doi:10.1007/s00450-014-0259-7
apa: Ziegert, S., & Wehrheim, H. (2015). Temporal plans for software architecture
reconfiguration. Computer Science - R & D, (3–4), 303--320. https://doi.org/10.1007/s00450-014-0259-7
bibtex: '@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture
reconfiguration}, DOI={10.1007/s00450-014-0259-7},
number={3–4}, journal={Computer Science - R & D}, author={Ziegert, Steffen
and Wehrheim, Heike}, year={2015}, pages={303--320} }'
chicago: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4 (2015): 303--320.
https://doi.org/10.1007/s00450-014-0259-7.'
ieee: S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,”
Computer Science - R & D, no. 3–4, pp. 303--320, 2015.
mla: Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture
Reconfiguration.” Computer Science - R & D, no. 3–4, 2015, pp. 303--320,
doi:10.1007/s00450-014-0259-7.
short: S. Ziegert, H. Wehrheim, Computer Science - R & D (2015) 303--320.
date_created: 2018-06-13T07:47:56Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/s00450-014-0259-7
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:52:13Z
date_updated: 2018-11-02T15:52:13Z
file_id: '5315'
file_name: TemporalPlansForSoftwareArchit.pdf
file_size: 2136451
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:52:13Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 303--320
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: Computer Science - R & D
status: public
title: Temporal plans for software architecture reconfiguration
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '3163'
author:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Meyer R, Wehrheim H. From Program Verification to Time and Space: The Scientific
Life of Ernst-R{\"{u}}diger Olderog. In: Meyer R, Platzer A, Wehrheim H, eds.
Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science. ; 2015:3--4. doi:10.1007/978-3-319-23506-6_1'
apa: 'Meyer, R., & Wehrheim, H. (2015). From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog. In R. Meyer, A. Platzer,
& H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger
Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9,
2015. Proceedings (pp. 3--4). https://doi.org/10.1007/978-3-319-23506-6_1'
bibtex: '@inproceedings{Meyer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog}, DOI={10.1007/978-3-319-23506-6_1},
booktitle={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, author={Meyer, Roland and Wehrheim, Heike}, editor={Meyer, Roland
and Platzer, Andr{\’{e}} and Wehrheim, HeikeEditors}, year={2015}, pages={3--4},
collection={Lecture Notes in Computer Science} }'
chicago: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time
and Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” In Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings,
edited by Roland Meyer, Andr{\’{e}} Platzer, and Heike Wehrheim, 3--4. Lecture
Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6_1.'
ieee: 'R. Meyer and H. Wehrheim, “From Program Verification to Time and Space: The
Scientific Life of Ernst-R{\"{u}}diger Olderog,” in Correct System Design -
Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th
Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp.
3--4.'
mla: 'Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and
Space: The Scientific Life of Ernst-R{\"{u}}diger Olderog.” Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, edited
by Roland Meyer et al., 2015, pp. 3--4, doi:10.1007/978-3-319-23506-6_1.'
short: 'R. Meyer, H. Wehrheim, in: R. Meyer, A. Platzer, H. Wehrheim (Eds.), Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015,
pp. 3--4.'
date_created: 2018-06-13T07:49:28Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6_1
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
page: 3--4
publication: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: 'From Program Verification to Time and Space: The Scientific Life of Ernst-R{\"{u}}diger
Olderog'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3164'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity
of a Transactional Mutex Lock. In: Bj{\o}rner N, S. de Boer F, eds. {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:161--177. doi:10.1007/978-3-319-19249-9_11'
apa: 'Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2015).
Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\o}rner & F. S.
de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo,
Norway, June 24-26, 2015, Proceedings (pp. 161--177). https://doi.org/10.1007/978-3-319-19249-9_11'
bibtex: '@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture
Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex
Lock}, DOI={10.1007/978-3-319-19249-9_11},
booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and
Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\o}rner,
Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike
Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In {FM} 2015:
Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015,
Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 161--177.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-19249-9_11.'
ieee: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying
Opacity of a Transactional Mutex Lock,” in {FM} 2015: Formal Methods - 20th
International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015,
pp. 161--177.'
mla: 'Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” {FM}
2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26,
2015, Proceedings, edited by Nikolaj Bj{\o}rner and Frank S. de Boer, 2015,
pp. 161--177, doi:10.1007/978-3-319-19249-9_11.'
short: 'J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\o}rner,
F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium,
Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.'
date_created: 2018-06-13T07:50:43Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-19249-9_11
editor:
- first_name: Nikolaj
full_name: Bj{\o}rner, Nikolaj
last_name: Bj{\o}rner
- first_name: Frank
full_name: S. de Boer, Frank
last_name: S. de Boer
page: 161--177
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: '{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway,
June 24-26, 2015, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verifying Opacity of a Transactional Mutex Lock
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3165'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
citation:
ama: 'Wehrheim H, Travkin O. {TSO} to {SC} via Symbolic Execution. In: Piterman
N, ed. Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings. Lecture Notes in Computer Science. ; 2015:104--119. doi:10.1007/978-3-319-26287-1_7'
apa: 'Wehrheim, H., & Travkin, O. (2015). {TSO} to {SC} via Symbolic Execution.
In N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th
International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November
17-19, 2015, Proceedings (pp. 104--119). https://doi.org/10.1007/978-3-319-26287-1_7'
bibtex: '@inproceedings{Wehrheim_Travkin_2015, series={Lecture Notes in Computer
Science}, title={{TSO} to {SC} via Symbolic Execution}, DOI={10.1007/978-3-319-26287-1_7},
booktitle={Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings}, author={Wehrheim, Heike and Travkin, Oleg}, editor={Piterman, NirEditor},
year={2015}, pages={104--119}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
In Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 104--119. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-26287-1_7.'
ieee: 'H. Wehrheim and O. Travkin, “{TSO} to {SC} via Symbolic Execution,” in Hardware
and Software: Verification and Testing - 11th International Haifa Verification
Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
2015, pp. 104--119.'
mla: 'Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.”
Hardware and Software: Verification and Testing - 11th International Haifa
Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings,
edited by Nir Piterman, 2015, pp. 104--119, doi:10.1007/978-3-319-26287-1_7.'
short: 'H. Wehrheim, O. Travkin, in: N. Piterman (Ed.), Hardware and Software: Verification
and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa,
Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119.'
date_created: 2018-06-13T07:52:44Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-26287-1_7
editor:
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
page: 104--119
publication: 'Hardware and Software: Verification and Testing - 11th International
Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015,
Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: '{TSO} to {SC} via Symbolic Execution'
type: conference
user_id: '29719'
year: '2015'
...
---
_id: '3166'
citation:
ama: Meyer R, Platzer A, Wehrheim H, eds. Correct System Design - Symposium in
Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings.; 2015. doi:10.1007/978-3-319-23506-6
apa: Meyer, R., Platzer, A., & Wehrheim, H. (Eds.). (2015). Correct System
Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of
His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings. https://doi.org/10.1007/978-3-319-23506-6
bibtex: '@book{Meyer_Platzer_Wehrheim_2015, series={Lecture Notes in Computer Science},
title={Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog
on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015.
Proceedings}, DOI={10.1007/978-3-319-23506-6},
year={2015}, collection={Lecture Notes in Computer Science} }'
chicago: Meyer, Roland, Andr{\’{e}} Platzer, and Heike Wehrheim, eds. Correct
System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion
of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings.
Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-23506-6.
ieee: R. Meyer, A. Platzer, and H. Wehrheim, Eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings. 2015.
mla: Meyer, Roland, et al., editors. Correct System Design - Symposium in Honor
of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg,
Germany, September 8-9, 2015. Proceedings. 2015, doi:10.1007/978-3-319-23506-6.
short: R. Meyer, A. Platzer, H. Wehrheim, eds., Correct System Design - Symposium
in Honor of Ernst-R{\"{u}}diger Olderog on the Occasion of His 60th Birthday,
Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015.
date_created: 2018-06-13T07:54:06Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-23506-6
editor:
- first_name: Roland
full_name: Meyer, Roland
last_name: Meyer
- first_name: Andr{\'{e}}
full_name: Platzer, Andr{\'{e}}
last_name: Platzer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
publication_identifier:
isbn:
- 978-3-319-23505-9
series_title: Lecture Notes in Computer Science
status: public
title: Correct System Design - Symposium in Honor of Ernst-R{\"{u}}diger Olderog on
the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings
type: conference_editor
user_id: '29719'
year: '2015'
...
---
_id: '336'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning. In this
paper, we propose a method to construct service compositions based on pre-verifiedtemplates.
Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Templates are proven correct
using an abstract semantics, leaving the specific meaning of ontology concepts
open, however, only up to given ontology rules. Construction of service compositions
amounts to instantiation of templates with domain-specific services.Correctness
of an instantiation can then simply be checked by verifying that the domain ontology(a)
adheres to the rules of the template ontology, and (b) fulfills the constraints
of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Walther S, Wehrheim H. Verified Service Compositions by Template-Based Construction.
In: Lanese I, Madelaine E, eds. Proceedings of the 11th International Symposium
on Formal Aspects of Component Software (FACS). LNCS. ; 2014:31-48. doi:10.1007/978-3-319-15317-9_3'
apa: Walther, S., & Wehrheim, H. (2014). Verified Service Compositions by Template-Based
Construction. In I. Lanese & E. Madelaine (Eds.), Proceedings of the 11th
International Symposium on Formal Aspects of Component Software (FACS) (pp.
31–48). https://doi.org/10.1007/978-3-319-15317-9_3
bibtex: '@inproceedings{Walther_Wehrheim_2014, series={LNCS}, title={Verified Service
Compositions by Template-Based Construction}, DOI={10.1007/978-3-319-15317-9_3},
booktitle={Proceedings of the 11th International Symposium on Formal Aspects of
Component Software (FACS)}, author={Walther, Sven and Wehrheim, Heike}, editor={Lanese,
Ivan and Madelaine, EricEditors}, year={2014}, pages={31–48}, collection={LNCS}
}'
chicago: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
Construction.” In Proceedings of the 11th International Symposium on Formal
Aspects of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine,
31–48. LNCS, 2014. https://doi.org/10.1007/978-3-319-15317-9_3.
ieee: S. Walther and H. Wehrheim, “Verified Service Compositions by Template-Based
Construction,” in Proceedings of the 11th International Symposium on Formal
Aspects of Component Software (FACS), 2014, pp. 31–48.
mla: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
Construction.” Proceedings of the 11th International Symposium on Formal Aspects
of Component Software (FACS), edited by Ivan Lanese and Eric Madelaine, 2014,
pp. 31–48, doi:10.1007/978-3-319-15317-9_3.
short: 'S. Walther, H. Wehrheim, in: I. Lanese, E. Madelaine (Eds.), Proceedings
of the 11th International Symposium on Formal Aspects of Component Software (FACS),
2014, pp. 31–48.'
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-15317-9_3
editor:
- first_name: Ivan
full_name: Lanese, Ivan
last_name: Lanese
- first_name: Eric
full_name: Madelaine, Eric
last_name: Madelaine
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:29:29Z
date_updated: 2018-03-20T07:29:29Z
file_id: '1423'
file_name: 336-facs2014_walther.pdf
file_size: 484422
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:29:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 31-48
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 11th International Symposium on Formal Aspects of
Component Software (FACS)
series_title: LNCS
status: public
title: Verified Service Compositions by Template-Based Construction
type: conference
user_id: '477'
year: '2014'
...
---
_id: '340'
author:
- first_name: Philipp
full_name: Korth, Philipp
last_name: Korth
citation:
ama: Korth P. Untersuchung transitiver Eigenschaften der Technik “Programs from
Proofs.” Universität Paderborn; 2014.
apa: Korth, P. (2014). Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn.
bibtex: '@book{Korth_2014, title={Untersuchung transitiver Eigenschaften der Technik
“Programs from Proofs”}, publisher={Universität Paderborn}, author={Korth, Philipp},
year={2014} }'
chicago: Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
ieee: P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
mla: Korth, Philipp. Untersuchung transitiver Eigenschaften der Technik “Programs
from Proofs.” Universität Paderborn, 2014.
short: P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from
Proofs,” Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
department:
- _id: '77'
language:
- iso: ger
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
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Untersuchung transitiver Eigenschaften der Technik "Programs from Proofs"
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '344'
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- 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
citation:
ama: 'Becker M, Becker S, Besova G, Walther S, Wehrheim H. Towards Systematic Configuration
for Architecture Validation. In: Proceedings of the 40th Euromicro Conference
on Software Engineering and Advanced Applications (Work in Progress Session).
; 2014.'
apa: Becker, M., Becker, S., Besova, G., Walther, S., & Wehrheim, H. (2014).
Towards Systematic Configuration for Architecture Validation. In Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session).
bibtex: '@inproceedings{Becker_Becker_Besova_Walther_Wehrheim_2014, title={Towards
Systematic Configuration for Architecture Validation}, booktitle={Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session)}, author={Becker, Matthias and Becker, Steffen and
Besova, Galina and Walther, Sven and Wehrheim, Heike}, year={2014} }'
chicago: Becker, Matthias, Steffen Becker, Galina Besova, Sven Walther, and Heike
Wehrheim. “Towards Systematic Configuration for Architecture Validation.” In Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session), 2014.
ieee: M. Becker, S. Becker, G. Besova, S. Walther, and H. Wehrheim, “Towards Systematic
Configuration for Architecture Validation,” in Proceedings of the 40th Euromicro
Conference on Software Engineering and Advanced Applications (Work in Progress
Session), 2014.
mla: Becker, Matthias, et al. “Towards Systematic Configuration for Architecture
Validation.” Proceedings of the 40th Euromicro Conference on Software Engineering
and Advanced Applications (Work in Progress Session), 2014.
short: 'M. Becker, S. Becker, G. Besova, S. Walther, H. Wehrheim, in: Proceedings
of the 40th Euromicro Conference on Software Engineering and Advanced Applications
(Work in Progress Session), 2014.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:17Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:27:54Z
date_updated: 2018-03-20T07:27:54Z
file_id: '1420'
file_name: 344-paper_CAMERA_READY.pdf
file_size: 80674
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:27:54Z
has_accepted_license: '1'
language:
- iso: eng
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 40th Euromicro Conference on Software Engineering
and Advanced Applications (Work in Progress Session)
status: public
title: Towards Systematic Configuration for Architecture Validation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '353'
abstract:
- lang: eng
text: 'There are many technologies for the automation of processesthat deal with
services; examples are service discovery and composition.Automation of these processes
requires that the services are described semantically. However, semantically described
services are currently not oronly rarely available, which limits the applicability
of discovery and composition approaches. The systematic support for creating new
semanticservices usable by automated technologies is an open problem.We tackle
this problem with a template based approach: Domain independent templates are
instantiated with domain specific services andboolean expressions. The obtained
services have semantic descriptionswhose correctness directly follows from the
correctness of the template.Besides the theory, we present experimental results
for a service repository in which 85% of the services were generated automatically.'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: 'Mohr F, Walther S. Template-based Generation of Semantic Services. In: Proceedings
of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2014:188-203.
doi:10.1007/978-3-319-14130-5_14'
apa: Mohr, F., & Walther, S. (2014). Template-based Generation of Semantic Services.
In Proceedings of the 14th International Conference on Software Reuse (ICSR)
(pp. 188–203). https://doi.org/10.1007/978-3-319-14130-5_14
bibtex: '@inproceedings{Mohr_Walther_2014, series={LNCS}, title={Template-based
Generation of Semantic Services}, DOI={10.1007/978-3-319-14130-5_14},
booktitle={Proceedings of the 14th International Conference on Software Reuse
(ICSR)}, author={Mohr, Felix and Walther, Sven}, year={2014}, pages={188–203},
collection={LNCS} }'
chicago: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
In Proceedings of the 14th International Conference on Software Reuse (ICSR),
188–203. LNCS, 2014. https://doi.org/10.1007/978-3-319-14130-5_14.
ieee: F. Mohr and S. Walther, “Template-based Generation of Semantic Services,”
in Proceedings of the 14th International Conference on Software Reuse (ICSR),
2014, pp. 188–203.
mla: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
Proceedings of the 14th International Conference on Software Reuse (ICSR),
2014, pp. 188–203, doi:10.1007/978-3-319-14130-5_14.
short: 'F. Mohr, S. Walther, in: Proceedings of the 14th International Conference
on Software Reuse (ICSR), 2014, pp. 188–203.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:22Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
doi: 10.1007/978-3-319-14130-5_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:23:32Z
date_updated: 2018-03-20T07:23:32Z
file_id: '1414'
file_name: 353-icsr2015_submission_17.pdf
file_size: 431778
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:23:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 188-203
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 14th International Conference on Software Reuse (ICSR)
series_title: LNCS
status: public
title: Template-based Generation of Semantic Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
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 Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...