---
_id: '3159'
author:
- 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: 'Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique
for Starvation Freedom. In: Huisman M, ed. Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings.
Lecture Notes in Computer Science. ; 2016:193--209. doi:10.1007/978-3-319-33693-0_13'
apa: Schellhorn, G., Travkin, O., & Wehrheim, H. (2016). Towards a Thread-Local
Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal
Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June
1-5, 2016, Proceedings (pp. 193--209). https://doi.org/10.1007/978-3-319-33693-0_13
bibtex: '@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes
in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation
Freedom}, DOI={10.1007/978-3-319-33693-0_13},
booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard
and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016},
pages={193--209}, collection={Lecture Notes in Computer Science} }'
chicago: Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local
Proof Technique for Starvation Freedom.” In Integrated Formal Methods - 12th
International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings,
edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016.
https://doi.org/10.1007/978-3-319-33693-0_13.
ieee: G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof
Technique for Starvation Freedom,” in Integrated Formal Methods - 12th International
Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016,
pp. 193--209.
mla: Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation
Freedom.” Integrated Formal Methods - 12th International Conference, {IFM}
2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman,
2016, pp. 193--209, doi:10.1007/978-3-319-33693-0_13.
short: 'G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated
Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland,
June 1-5, 2016, Proceedings, 2016, pp. 193--209.'
date_created: 2018-06-13T07:42:34Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.1007/978-3-319-33693-0_13
editor:
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
page: 193--209
publication: Integrated Formal Methods - 12th International Conference, {IFM} 2016,
Reykjavik, Iceland, June 1-5, 2016, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Thread-Local Proof Technique for Starvation Freedom
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3160'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity
of a Pessimistic {STM}. In: Fatourou P, Jim{\’{e}}nez E, Pedone F, eds. 20th
International Conference on Principles of Distributed Systems, {OPODIS} 2016,
December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35'
apa: Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016).
Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\’{e}}nez, &
F. Pedone (Eds.), 20th International Conference on Principles of Distributed
Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).
https://doi.org/10.4230/LIPIcs.OPODIS.2016.35
bibtex: '@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs},
title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35},
booktitle={20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and
Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike},
editor={Fatourou, Panagiota and Jim{\’{e}}nez, Ernesto and Pedone, FernandoEditors},
year={2016}, pages={35:1--35:17}, collection={LIPIcs} }'
chicago: Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike
Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference
on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid,
Spain, edited by Panagiota Fatourou, Ernesto Jim{\’{e}}nez, and Fernando Pedone,
35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.
ieee: S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving
Opacity of a Pessimistic {STM},” in 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain,
2016, pp. 35:1--35:17.
mla: Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International
Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16,
2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17,
doi:10.4230/LIPIcs.OPODIS.2016.35.
short: 'S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou,
E. Jim{\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles
of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016,
pp. 35:1--35:17.'
date_created: 2018-06-13T07:44:15Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
doi: 10.4230/LIPIcs.OPODIS.2016.35
editor:
- first_name: Panagiota
full_name: Fatourou, Panagiota
last_name: Fatourou
- first_name: Ernesto
full_name: Jim{\'{e}}nez, Ernesto
last_name: Jim{\'{e}}nez
- first_name: Fernando
full_name: Pedone, Fernando
last_name: Pedone
page: 35:1--35:17
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: 20th International Conference on Principles of Distributed Systems, {OPODIS}
2016, December 13-16, 2016, Madrid, Spain
series_title: LIPIcs
status: public
title: Proving Opacity of a Pessimistic {STM}
type: conference
user_id: '29719'
year: '2016'
...
---
_id: '3161'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie{-}Christine
full_name: Jakobs, Marie{-}Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation
tolerance constraints from verification runs. CoRR. 2016.
apa: Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016).
Deriving approximation tolerance constraints from verification runs. CoRR.
bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation
tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg,
Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016}
}'
chicago: Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR,
2016.
ieee: T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation
tolerance constraints from verification runs,” CoRR, 2016.
mla: Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from
Verification Runs.” CoRR, 2016.
short: T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).
date_created: 2018-06-13T07:45:27Z
date_updated: 2022-01-06T06:59:01Z
department:
- _id: '77'
publication: CoRR
status: public
title: Deriving approximation tolerance constraints from verification runs
type: journal_article
user_id: '29719'
year: '2016'
...
---
_id: '175'
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 for constructing service compositions based on pre-verified
templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Their meaning is defined by
an abstract semantics, leaving the specific meaning of ontology concepts open,
however, only up to given ontology rules. Templates are proven correct using a
Hoare-style proof calculus, extended by a specific rule for service calls. 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. On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23.
doi:10.1016/j.scico.2016.04.002
apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs. Science of Computer Programming,
2--23. https://doi.org/10.1016/j.scico.2016.04.002
bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002},
journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs.” Science of Computer Programming,
2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.
ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs,” Science of Computer Programming,
pp. 2--23, 2016.
mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
Service Compositions - Templates and Proofs.” Science of Computer Programming,
Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.
short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:38:40Z
date_updated: 2018-03-21T12:38:40Z
file_id: '1536'
file_name: 175-1-s2.0-S0167642316300028-main.pdf
file_size: 630739
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '186'
abstract:
- lang: eng
text: Software verification is an established method to ensure software safety.
Nevertheless, verification still often fails, either because it consumes too much
resources, e.g., time or memory, or the technique is not mature enough to verify
the property. Often then discarding the partial verification, the validation process
proceeds with techniques like testing.To enable standard testing to profit from
previous, partial verification, we use a summary of the verification effort to
simplify the program for subsequent testing. Our techniques use this summary to
construct a residual program which only contains program paths with unproven assertions.
Afterwards, the residual program can be used with standard testing tools.Our first
experiments show that testing profits from the partial verification.The test effort
is reduced and combined verification and testing is faster than a complete verification.
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: Jens
Knoop UZ, ed. Software Engineering 2016. Lecture Notes in Informatics.
; 2016:17-18.'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2016). Just test what you cannot
verify! In U. Z. Jens Knoop (Ed.), Software Engineering 2016 (pp. 17–18).
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics},
title={Just test what you cannot verify!}, booktitle={Software Engineering 2016},
author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens
Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes
in Informatics} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Software Engineering 2016, edited by Uwe Zdun Jens
Knoop, 17–18. Lecture Notes in Informatics, 2016.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Software Engineering 2016, 2016, pp. 17–18.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Software Engineering
2016, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software
Engineering 2016, 2016, pp. 17–18.'
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:43Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Uwe Zdun
full_name: Jens Knoop, Uwe Zdun
last_name: Jens Knoop
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:32:11Z
date_updated: 2018-03-21T12:32:11Z
file_id: '1532'
file_name: 186-SEsubmission8.pdf
file_size: 55775
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:32:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 17-18
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering 2016
series_title: Lecture Notes in Informatics
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2016'
...
---
_id: '224'
abstract:
- lang: eng
text: In modern software development, paradigms like component-based software engineering
(CBSE) and service-oriented architectures (SOA) emphasize the construction of
large software systems out of existing components or services. Therein, a service
is a self-contained piece of software, which adheres to a specified interface.
In a model-based software design, this interface constitutes our sole knowledge
of the service at design time, while service implementations are not available.
Therefore, correctness checks or detection of potential errors in service compositions
has to be carried out without the possibility of executing services. This challenges
the usage of standard software error localization techniques for service compositions.
In this paper, we review state-of-the-art approaches for error localization of
software and discuss their applicability to service compositions.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A short survey on using software error localization
for service compositions. In: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016). LNCS. ; 2016:248--262.
doi:10.1007/978-3-319-44482-6_16'
apa: Krämer, J., & Wehrheim, H. (2016). A short survey on using software error
localization for service compositions. In Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262). https://doi.org/10.1007/978-3-319-44482-6_16
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey
on using software error localization for service compositions}, DOI={10.1007/978-3-319-44482-6_16},
booktitle={Proceedings of the 5th European Conference on Service-Oriented and
Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016},
pages={248--262}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” In Proceedings of the 5th European
Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 248--262.
LNCS, 2016. https://doi.org/10.1007/978-3-319-44482-6_16.
ieee: J. Krämer and H. Wehrheim, “A short survey on using software error localization
for service compositions,” in Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.
mla: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error
Localization for Service Compositions.” Proceedings of the 5th European Conference
on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262,
doi:10.1007/978-3-319-44482-6_16.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 5th European Conference on
Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.'
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-44482-6_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:35:04Z
date_updated: 2018-03-21T10:35:04Z
file_id: '1509'
file_name: 224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf
file_size: 389042
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:35:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--262
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 5th European Conference on Service-Oriented and Cloud
Computing (ESOCC 2016)
series_title: LNCS
status: public
title: A short survey on using software error localization for service compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '226'
abstract:
- lang: eng
text: Error detection, localization and correction are time-intensive tasks in software
development, but crucial to deliver functionally correct products. Thus, automated
approaches to these tasks have been intensively studied for standard software
systems. For model-based software systems, the situation is different. While error
detection is still well-studied, error localization and correction is a less-studied
domain. In this paper, we examine error localization and correction for models
of service compositions. Based on formal definitions of error and correction in
this context, we show that the classical approach of error localization and correction,
i.e. first determining a set of suspicious statements and then proposing changes
to these statements, is ineffective in our context. In fact, it lessens the chance
to succeed in finding a correction at all.In this paper, we introduce correction
proposal as a novel approach on error correction in service compositions integrating
error localization and correction in one combined step. In addition, we provide
an algorithm to compute such correction proposals automatically.
author:
- first_name: Julia
full_name: Krämer, Julia
last_name: Krämer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction
in Service Compositions. In: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016).
LNCS. ; 2016:445--457. doi:10.1007/978-3-319-50230-4_35'
apa: Krämer, J., & Wehrheim, H. (2016). A Formal Approach to Error Localization
and Correction in Service Compositions. In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016) (pp. 445--457). https://doi.org/10.1007/978-3-319-50230-4_35
bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach
to Error Localization and Correction in Service Compositions}, DOI={10.1007/978-3-319-50230-4_35},
booktitle={Proceedings of the 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia
and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }'
chicago: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” In Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 445--457. LNCS, 2016. https://doi.org/10.1007/978-3-319-50230-4_35.
ieee: J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction
in Service Compositions,” in Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.
mla: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization
and Correction in Service Compositions.” Proceedings of the 1st International
Workshop on Formal to Practical Software Verification and Composition (VeryComp
2016), 2016, pp. 445--457, doi:10.1007/978-3-319-50230-4_35.
short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop
on Formal to Practical Software Verification and Composition (VeryComp 2016),
2016, pp. 445--457.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:37Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-50230-4_35
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:34:08Z
date_updated: 2018-03-21T10:34:08Z
file_id: '1507'
file_name: 226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf
file_size: 492018
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:34:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 445--457
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 1st International Workshop on Formal to Practical
Software Verification and Composition (VeryComp 2016)
series_title: LNCS
status: public
title: A Formal Approach to Error Localization and Correction in Service Compositions
type: conference
user_id: '477'
year: '2016'
...
---
_id: '227'
abstract:
- lang: eng
text: Information flow analysis studies the flow of data between program entities
(e.g. variables), where the allowed flow is specified via security policies. Typical
information flow analyses compute a conservative (over-)approximation of the flows
in a program. Such an analysis may thus signal non-existing violations of the
security policy.In this paper, we propose a new technique for inspecting the reported
violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement
(CEGAR) in software verification, we use the result of this inspection to improve
the next round of the analysis. We prove soundness of this scheme.
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. A CEGAR Scheme for Information Flow Analysis. In: Proceedings
of the 18th International Conference on Formal Engineering Methods (ICFEM 2016).
LNCS. ; 2016:466--483. doi:10.1007/978-3-319-47846-3_29'
apa: Töws, M., & Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis.
In Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016) (pp. 466--483). https://doi.org/10.1007/978-3-319-47846-3_29
bibtex: '@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme
for Information Flow Analysis}, DOI={10.1007/978-3-319-47846-3_29},
booktitle={Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016)}, author={Töws, Manuel and Wehrheim, Heike}, year={2016},
pages={466--483}, collection={LNCS} }'
chicago: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow
Analysis.” In Proceedings of the 18th International Conference on Formal Engineering
Methods (ICFEM 2016), 466--483. LNCS, 2016. https://doi.org/10.1007/978-3-319-47846-3_29.
ieee: M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483.
mla: Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.”
Proceedings of the 18th International Conference on Formal Engineering Methods
(ICFEM 2016), 2016, pp. 466--483, doi:10.1007/978-3-319-47846-3_29.
short: 'M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference
on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.'
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:39Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-47846-3_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:33:38Z
date_updated: 2018-03-21T10:33:38Z
file_id: '1506'
file_name: 227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf
file_size: 682849
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:33:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 466--483
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 Formal Engineering
Methods (ICFEM 2016)
series_title: LNCS
status: public
title: A CEGAR Scheme for Information Flow Analysis
type: conference
user_id: '477'
year: '2016'
...
---
_id: '170'
abstract:
- lang: eng
text: We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related
security threats like overprivilege, existence of permission redelegation and
permission flows. PAndA2 comes along with a textual and graphical visualization
of the analysis result and even supports the comparison of analysis results for
different android app versions.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
citation:
ama: 'Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. Workshop
on Formal and Model-Driven Techniques for Developing Trustworthy Systems.
School of Computing Science Technical Report Series. ; 2016.'
apa: 'Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission
Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky
A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems.'
bibtex: '@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science
Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine
and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna
EEditor}, year={2016}, collection={School of Computing Science Technical Report
Series} }'
chicago: 'Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing
Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on
Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited
by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical
Report Series, 2016.'
ieee: 'M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use
and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven
Techniques for Developing Trustworthy Systems, 2016.'
mla: 'Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay
in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques
for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky
A, 2016.'
short: 'M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.),
Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems,
2016.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:01Z
ddc:
- '040'
department:
- _id: '77'
editor:
- first_name: Troubitsyna E
full_name: Ishikawa F, Romanovsky A, Troubitsyna E
last_name: Ishikawa F, Romanovsky A
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:40:27Z
date_updated: 2018-03-21T12:40:27Z
file_id: '1539'
file_name: 170-main_04.pdf
file_size: 285299
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:40:27Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Workshop on Formal and Model-Driven Techniques for Developing Trustworthy
Systems
related_material:
link:
- relation: contains
url: https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf
series_title: School of Computing Science Technical Report Series
status: public
title: 'PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)'
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '1190'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Induction-Based Verification of Timed Systems. Universität
Paderborn; 2016.
apa: Isenberg, T. (2016). Induction-based Verification of Timed Systems.
Universität Paderborn.
bibtex: '@book{Isenberg_2016, title={Induction-based Verification of Timed Systems},
publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }'
chicago: Isenberg, Tobias. Induction-Based Verification of Timed Systems.
Universität Paderborn, 2016.
ieee: T. Isenberg, Induction-based Verification of Timed Systems. Universität
Paderborn, 2016.
mla: Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität
Paderborn, 2016.
short: T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn,
2016.
date_created: 2018-03-05T10:11:48Z
date_updated: 2022-01-06T06:51:12Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-08T06:23:21Z
date_updated: 2018-03-08T09:14:11Z
file_id: '1195'
file_name: 1190-thesis_abgabeversion.pdf
file_size: 3354335
relation: main_file
file_date_updated: 2018-03-08T09:14:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Induction-based Verification of Timed Systems
type: dissertation
user_id: '477'
year: '2016'
...
---
_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'
...