---
_id: '116'
author:
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: Liske G. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-220
apa: Liske, G. (2017). CCA-Security for Predicate Encryption Schemes. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-220
bibtex: '@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes},
DOI={10.17619/UNIPB/1-220},
publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }'
chicago: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-220.
ieee: G. Liske, CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017.
mla: Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität
Paderborn, 2017, doi:10.17619/UNIPB/1-220.
short: G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:04Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-220
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: CCA-Security for Predicate Encryption Schemes
type: dissertation
user_id: '25078'
year: '2017'
...
---
_id: '17652'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows
in Networks. In: Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I. Lecture Notes in Computer Science. Cham: Springer International Publishing;
2017:3-17. doi:10.1007/978-3-319-71150-8_1'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering
Undesirable Flows in Networks. In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1'
bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture
Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1},
booktitle={Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer
International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso,
Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering
Undesirable Flows in Networks.” In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.'
ieee: 'G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable
Flows in Networks,” in Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I, 2017, pp. 3–17.'
mla: 'Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial
Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai,
China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.'
short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization
and Applications: 11th International Conference, COCOA 2017, Shanghai, China,
December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
Cham, 2017, pp. 3–17.'
date_created: 2020-08-06T15:19:48Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71150-8_1
extern: '1'
keyword:
- flow
- filter
- MMSA
- set cover
- approximation
- local ratio algorithm
language:
- iso: eng
page: 3-17
place: Cham
publication: 'Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I'
publication_identifier:
isbn:
- 978-3-319-71150-8
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Filtering Undesirable Flows in Networks
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17653'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of
the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In
Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation
Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial
Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.},
year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer,
2017.
ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings
of the 29th Benelux Conference on Artificial Intelligence, 2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings
of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:09Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- interaction
- reciprocation
- contribute
- shared effort
- curbing
- convergence
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Reciprocation Effort Games
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17654'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer;
2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative
Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition
between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference
on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de
Weerdt, M.M.}, year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.”
In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
CCIS. Springer, 2017.
ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,”
in Proceedings of the 29th Benelux Conference on Artificial Intelligence,
2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.”
Proceedings of the 29th Benelux Conference on Artificial Intelligence,
Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:19Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agents
- projects
- contribute
- shared effort game
- competition
- quota
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Competition between Cooperative Projects
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '1767'
abstract:
- lang: eng
text: 'Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure
of risk over two paramount economic domains: the insurance domain and the financial
domain; α∈(0,1) is the confidence level. In this work, we study the strategic
equilibria for an economic system modeled as a game, where risk-averse players
seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in
a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We
establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value
property: For any best-response of a player, each mixed strategy in the support
gives the same cost to the player. This follows directly from the concavity of
CVaRα in the involved probabilities, which we establish. (2) The Crawford property:
For every α, there is a 2-player game with no CVaRα-equilibrium. The property
is established using the Optimal-Value property and a new functional property
of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties,
we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium
is strongly NP-hard even for 2-player games. As our other main result, we show
the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player
games, for any valuation V with the Optimal-Value and the Crawford properties.
This result has a rich potential since we prove that the very significant and
broad class of strictly quasiconcave valuations has the Optimal-Value property.'
author:
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
citation:
ama: 'Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity
of Equilibria. In: Proceedings of the 10th International Symposium on Algorithmic
Game Theory (SAGT 2017). Vol 10504. LNCS. ; 2017:131--143. doi:10.1007/978-3-319-66700-3_11'
apa: 'Mavronicolas, M., & Monien, B. (2017). Conditional Value-at-Risk: Structure
and Complexity of Equilibria. In Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017) (Vol. 10504, pp. 131--143). L’Aquila,
Italy. https://doi.org/10.1007/978-3-319-66700-3_11'
bibtex: '@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional
Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={10.1007/978-3-319-66700-3_11},
booktitle={Proceedings of the 10th International Symposium on Algorithmic Game
Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017},
pages={131--143}, collection={LNCS} }'
chicago: 'Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk:
Structure and Complexity of Equilibria.” In Proceedings of the 10th International
Symposium on Algorithmic Game Theory (SAGT 2017), 10504:131--143. LNCS, 2017.
https://doi.org/10.1007/978-3-319-66700-3_11.'
ieee: 'M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and
Complexity of Equilibria,” in Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), L’Aquila, Italy, 2017, vol. 10504,
pp. 131--143.'
mla: 'Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure
and Complexity of Equilibria.” Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), vol. 10504, 2017, pp. 131--143, doi:10.1007/978-3-319-66700-3_11.'
short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium
on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143.'
conference:
end_date: 2017-09-14
location: L'Aquila, Italy
name: 10th International Symposium on Algorithmic Game Theory (SAGT 2017)
start_date: 2017-09-12
date_created: 2018-03-23T13:58:02Z
date_updated: 2022-01-06T06:53:16Z
ddc:
- '000'
department:
- _id: '7'
doi: 10.1007/978-3-319-66700-3_11
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:53:56Z
date_updated: 2018-11-02T14:53:56Z
file_id: '5287'
file_name: ConditionalValue-at-RiskStruct.pdf
file_size: 352365
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:53:56Z
has_accepted_license: '1'
intvolume: ' 10504'
language:
- iso: eng
page: 131--143
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the 10th International Symposium on Algorithmic Game Theory
(SAGT 2017)
series_title: LNCS
status: public
title: 'Conditional Value-at-Risk: Structure and Complexity of Equilibria'
type: conference
user_id: '477'
volume: 10504
year: '2017'
...
---
_id: '17811'
abstract:
- lang: eng
text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional
grid. A basic task for such a swarm is the gathering process: All\r\nrobots have
to gather at one (not predefined) place. A common local model for\r\nextremely
simple robots is the following: The robots do not have a common\r\ncompass, only
have a constant viewing radius, are autonomous and\r\nindistinguishable, can move
at most a constant distance in each step, cannot\r\ncommunicate, are oblivious
and do not have flags or states. The only gathering\r\nalgorithm under this robot
model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works
in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the
fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case
of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same
time and a similar local model additionally require a\r\nconstant memory, states
and \"flags\" to communicate these states to neighbors in\r\nviewing range. They
gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the
best of our knowledge) first\r\ngathering algorithm on the grid that works under
the same simple local model as\r\nthe above mentioned Euclidean plane strategy,
i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness
and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$
time model. This time bound\r\nmatches the time bound of the best known algorithm
for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots
are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such
configurations cannot be\r\nsolved."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots
on a Grid. arXiv:170203400. 2017.
apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous,
Oblivious Robots on a Grid. ArXiv:1702.03400.
bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous,
Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias
and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }'
chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering
Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
Robots on a Grid,” arXiv:1702.03400. 2017.
mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
ArXiv:1702.03400, 2017.
short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).
date_created: 2020-08-11T13:48:38Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:1702.03400
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: preprint
user_id: '15415'
year: '2017'
...
---
_id: '2343'
article_number: '24'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Löken N. Searchable Encryption with Access Control. In: Proceedings of
the 12th International Conference on Availability, Reliability and Security -
ARES ’17. ICPS. ACM Press; 2017. doi:10.1145/3098954.3098987'
apa: Löken, N. (2017). Searchable Encryption with Access Control. In Proceedings
of the 12th International Conference on Availability, Reliability and Security
- ARES ’17. ACM Press. https://doi.org/10.1145/3098954.3098987
bibtex: '@inproceedings{Löken_2017, series={ICPS}, title={Searchable Encryption
with Access Control}, DOI={10.1145/3098954.3098987},
number={24}, booktitle={Proceedings of the 12th International Conference on Availability,
Reliability and Security - ARES ’17}, publisher={ACM Press}, author={Löken, Nils},
year={2017}, collection={ICPS} }'
chicago: Löken, Nils. “Searchable Encryption with Access Control.” In Proceedings
of the 12th International Conference on Availability, Reliability and Security
- ARES ’17. ICPS. ACM Press, 2017. https://doi.org/10.1145/3098954.3098987.
ieee: N. Löken, “Searchable Encryption with Access Control,” in Proceedings of
the 12th International Conference on Availability, Reliability and Security -
ARES ’17, 2017.
mla: Löken, Nils. “Searchable Encryption with Access Control.” Proceedings of
the 12th International Conference on Availability, Reliability and Security -
ARES ’17, 24, ACM Press, 2017, doi:10.1145/3098954.3098987.
short: 'N. Löken, in: Proceedings of the 12th International Conference on Availability,
Reliability and Security - ARES ’17, ACM Press, 2017.'
date_created: 2018-04-13T11:40:23Z
date_updated: 2022-01-06T06:55:54Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3098954.3098987
file:
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2018-11-08T10:56:15Z
date_updated: 2018-11-08T10:56:15Z
file_id: '5431'
file_name: searchable_encryption_access_control_website.pdf
file_size: 658797
relation: main_file
file_date_updated: 2018-11-08T10:56:15Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2017/679
oa: '1'
project:
- _id: '43'
name: Securing the Financial Cloud
publication: Proceedings of the 12th International Conference on Availability, Reliability
and Security - ARES '17
publication_identifier:
isbn:
- '9781450352574'
publication_status: published
publisher: ACM Press
series_title: ICPS
status: public
title: Searchable Encryption with Access Control
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '2344'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
for Access Control in Large-Scale Organizations. In: Foundations and Practice
of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1'
apa: 'Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations
and Practice of Security (pp. 3–17). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-75650-9_1'
bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={10.1007/978-3-319-75650-9_1},
booktitle={Foundations and Practice of Security}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
Löken, Nils}, year={2017}, pages={3–17} }'
chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations.” In Foundations
and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.
https://doi.org/10.1007/978-3-319-75650-9_1.'
ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
as a Service for Access Control in Large-Scale Organizations,” in Foundations
and Practice of Security, 2017, pp. 3–17.
mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
Control in Large-Scale Organizations.” Foundations and Practice of Security,
Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:04:13Z
date_updated: 2018-11-02T15:04:13Z
file_id: '5292'
file_name: Attribute-BasedEncryptionAsASe.pdf
file_size: 634736
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2018-11-08T09:53:34Z
date_updated: 2018-11-08T09:53:34Z
file_id: '5425'
file_name: abe_aas.pdf
file_size: 522516
relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '43'
name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
isbn:
- '9783319756493'
- '9783319756509'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '2381'
abstract:
- lang: eng
text: Metric facility location and K-means are well-known problems of combinatorial
optimization. Both admit a fairly simple heuristic called single-swap, which adds,
drops or swaps open facilities until it reaches a local optimum. For both problems,
it is known that this algorithm produces a solution that is at most a constant
factor worse than the respective global optimum. In this paper, we show that single-swap
applied to the weighted metric uncapacitated facility location and weighted discrete
K-means problem is tightly PLS-complete and hence has exponential worst-case running
time.
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: 'Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. Lecture
Notes in Computer Science. Vol 10236. Cham: Springer International Publishing;
2017:116-127. doi:10.1007/978-3-319-57586-5_11'
apa: 'Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems. In D. Fotakis, A. Pagourtzis, & V. T. Paschos
(Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-319-57586-5_11'
bibtex: '@inbook{Brauer_2017, place={Cham}, title={Complexity of Single-Swap Heuristics
for Metric Facility Location and Related Problems}, volume={10236}, DOI={10.1007/978-3-319-57586-5_11},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Brauer, Sascha}, editor={Fotakis, Dimitris and Pagourtzis,
Aris and Paschos, Vangelis Th.Editors}, year={2017}, pages={116–127} }'
chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems.” In Lecture Notes in Computer Science, edited
by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27.
Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-57586-5_11.'
ieee: 'S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems,” in Lecture Notes in Computer Science, vol. 10236,
D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International
Publishing, 2017, pp. 116–127.'
mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems.” Lecture Notes in Computer Science, edited by Dimitris
Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27,
doi:10.1007/978-3-319-57586-5_11.
short: 'S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes
in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.'
conference:
end_date: 2017-05-26
location: Athens, Greece
name: 10th International Conference on Algorithms and Complexity
start_date: 2017-05-24
date_created: 2018-04-17T12:20:53Z
date_updated: 2022-01-06T06:56:00Z
department:
- _id: '64'
doi: 10.1007/978-3-319-57586-5_11
editor:
- first_name: Dimitris
full_name: Fotakis, Dimitris
last_name: Fotakis
- first_name: Aris
full_name: Pagourtzis, Aris
last_name: Pagourtzis
- first_name: Vangelis Th.
full_name: Paschos, Vangelis Th.
last_name: Paschos
intvolume: ' 10236'
language:
- iso: eng
page: 116-127
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319575858'
- '9783319575865'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Complexity of Single-Swap Heuristics for Metric Facility Location and Related
Problems
type: book_chapter
user_id: '13291'
volume: 10236
year: '2017'
...
---
_id: '20552'
abstract:
- lang: eng
text: Das Zukunftsszenario der Industrie 4.0 ist gepr{\"a}gt durch einen massiven
Anstieg der unternehmens{\"u}bergreifenden Vernetzung. Um einer Bedrohung durch
unautorisierte Weitergabe oder Sabotage vertraulicher Daten entgegenzuwirken,
muss der Informationssicherheit bereits im Entwurf der cyber-physischen Produktionssysteme
ein hoher Stellenwert einger{\"a}umt werden. Dieses Paradigma wird als Security
by Design bezeichnet. {\"U}ber den gesamten Entstehungsprozess hinweg muss nachverfolgt
werden k{\"o}nnen, ob die Systeme spezifische Anforderungen an die Informationssicherheit
erf{\"u}llen und damit die Eigenschaft der Industrial Security gew{\"a}hrleisten.
Dieser Beitrag stellt einen Entwurfsansatz zur Nachverfolgung der Informationssicherheit
vor, der durch Integration softwaretechnischer Methoden in das Systems Engineering
eine Entwicklung nach dem Paradigma Security by Design erm{\"o}glicht.
author:
- first_name: Christopher
full_name: Gerking, Christopher
last_name: Gerking
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Gerking C, Bodden E, Schäfer W. Industrial Security by Design. In: Maier GW,
Engels G, Steffen E, eds. Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten.
Springer Berlin Heidelberg; 2017:1-24. doi:10.1007/978-3-662-52903-4_8-1'
apa: Gerking, C., Bodden, E., & Schäfer, W. (2017). Industrial Security by Design.
In G. W. Maier, G. Engels, & E. Steffen (Eds.), Handbuch Gestaltung digitaler
und vernetzter Arbeitswelten (pp. 1–24). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-52903-4_8-1
bibtex: '@inbook{Gerking_Bodden_Schäfer_2017, place={Berlin, Heidelberg}, title={Industrial
Security by Design}, DOI={10.1007/978-3-662-52903-4_8-1},
booktitle={Handbuch Gestaltung digitaler und vernetzter Arbeitswelten}, publisher={Springer
Berlin Heidelberg}, author={Gerking, Christopher and Bodden, Eric and Schäfer,
Wilhelm}, editor={Maier, Günter W. and Engels, Gregor and Steffen, Eckhard}, year={2017},
pages={1–24} }'
chicago: 'Gerking, Christopher, Eric Bodden, and Wilhelm Schäfer. “Industrial Security
by Design.” In Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten,
edited by Günter W. Maier, Gregor Engels, and Eckhard Steffen, 1–24. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2017. https://doi.org/10.1007/978-3-662-52903-4_8-1.'
ieee: 'C. Gerking, E. Bodden, and W. Schäfer, “Industrial Security by Design,” in
Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, G. W. Maier,
G. Engels, and E. Steffen, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg,
2017, pp. 1–24.'
mla: Gerking, Christopher, et al. “Industrial Security by Design.” Handbuch Gestaltung
Digitaler Und Vernetzter Arbeitswelten, edited by Günter W. Maier et al.,
Springer Berlin Heidelberg, 2017, pp. 1–24, doi:10.1007/978-3-662-52903-4_8-1.
short: 'C. Gerking, E. Bodden, W. Schäfer, in: G.W. Maier, G. Engels, E. Steffen
(Eds.), Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2017, pp. 1–24.'
date_created: 2020-11-30T09:56:23Z
date_updated: 2022-01-06T06:54:29Z
department:
- _id: '76'
doi: 10.1007/978-3-662-52903-4_8-1
editor:
- first_name: Günter W.
full_name: Maier, Günter W.
last_name: Maier
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
- first_name: Eckhard
full_name: Steffen, Eckhard
last_name: Steffen
keyword:
- ITSECWEBSITE
language:
- iso: eng
page: 1-24
place: Berlin, Heidelberg
publication: Handbuch Gestaltung digitaler und vernetzter Arbeitswelten
publication_identifier:
isbn:
- 978-3-662-52903-4
publisher: Springer Berlin Heidelberg
status: public
title: Industrial Security by Design
type: book_chapter
user_id: '5786'
year: '2017'
...
---
_id: '20553'
abstract:
- lang: eng
text: Finding and fixing software vulnerabilities have become a major struggle for
most software development companies. While generally without alternative, such
fixing efforts are a major cost factor, which is why companies have a vital interest
in focusing their secure software development activities such that they obtain
an optimal return on this investment. We investigate, in this paper, quantitatively
the major factors that impact the time it takes to fix a given security issue
based on data collected automatically within SAP's secure development process,
and we show how the issue fix time could be used to monitor the fixing process.
We use three machine learning methods and evaluate their predictive power in predicting
the time to fix issues. Interestingly, the models indicate that vulnerability
type has less dominant impact on issue fix time than previously believed. The
time it takes to fix an issue instead seems much more related to the component
in which the potential vulnerability resides, the project related to the issue,
the development groups that address the issue, and the closeness of the software
release date. This indicates that the software structure, the fixing processes,
and the development groups are the dominant factors that impact the time spent
to address security issues. SAP can use the models to implement a continuous improvement
of its secure software development process and to measure the impact of individual
improvements. The development teams at SAP develop different types of software,
adopt different internal development processes, use different programming languages
and platforms, and are located in different cities and countries. Other organizations,
may use the results---with precaution---and be learning organizations.
author:
- first_name: Lotfi
full_name: Ben Othmane, Lotfi
last_name: Ben Othmane
- first_name: Golriz
full_name: Chehrazi, Golriz
last_name: Chehrazi
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Petar
full_name: Tsalovski, Petar
last_name: Tsalovski
- first_name: Achim D.
full_name: Brucker, Achim D.
last_name: Brucker
citation:
ama: 'Ben Othmane L, Chehrazi G, Bodden E, Tsalovski P, Brucker AD. Time for Addressing
Software Security Issues: Prediction Models and Impacting Factors. Data Science
and Engineering. 2017;2(2):107-124. doi:https://doi.org/10.1007/s41019-016-0019-8'
apa: 'Ben Othmane, L., Chehrazi, G., Bodden, E., Tsalovski, P., & Brucker, A.
D. (2017). Time for Addressing Software Security Issues: Prediction Models and
Impacting Factors. Data Science and Engineering, 2(2), 107–124.
https://doi.org/10.1007/s41019-016-0019-8'
bibtex: '@article{Ben Othmane_Chehrazi_Bodden_Tsalovski_Brucker_2017, title={Time
for Addressing Software Security Issues: Prediction Models and Impacting Factors},
volume={2}, DOI={https://doi.org/10.1007/s41019-016-0019-8},
number={2}, journal={Data Science and Engineering}, author={Ben Othmane, Lotfi
and Chehrazi, Golriz and Bodden, Eric and Tsalovski, Petar and Brucker, Achim
D.}, year={2017}, pages={107–124} }'
chicago: 'Ben Othmane, Lotfi, Golriz Chehrazi, Eric Bodden, Petar Tsalovski, and
Achim D. Brucker. “Time for Addressing Software Security Issues: Prediction Models
and Impacting Factors.” Data Science and Engineering 2, no. 2 (2017): 107–24.
https://doi.org/10.1007/s41019-016-0019-8.'
ieee: 'L. Ben Othmane, G. Chehrazi, E. Bodden, P. Tsalovski, and A. D. Brucker,
“Time for Addressing Software Security Issues: Prediction Models and Impacting
Factors,” Data Science and Engineering, vol. 2, no. 2, pp. 107–124, 2017,
doi: https://doi.org/10.1007/s41019-016-0019-8.'
mla: 'Ben Othmane, Lotfi, et al. “Time for Addressing Software Security Issues:
Prediction Models and Impacting Factors.” Data Science and Engineering,
vol. 2, no. 2, 2017, pp. 107–24, doi:https://doi.org/10.1007/s41019-016-0019-8.'
short: L. Ben Othmane, G. Chehrazi, E. Bodden, P. Tsalovski, A.D. Brucker, Data
Science and Engineering 2 (2017) 107–124.
date_created: 2020-11-30T10:24:50Z
date_updated: 2022-01-06T06:54:29Z
department:
- _id: '76'
doi: https://doi.org/10.1007/s41019-016-0019-8
intvolume: ' 2'
issue: '2'
language:
- iso: eng
page: 107-124
publication: Data Science and Engineering
publication_identifier:
issn:
- 2364-1541
related_material:
link:
- relation: confirmation
url: http://bodden.de/pubs/bcb17time.pdf
status: public
title: 'Time for Addressing Software Security Issues: Prediction Models and Impacting
Factors'
type: journal_article
user_id: '5786'
volume: 2
year: '2017'
...
---
_id: '20554'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Bodden E. Self-Adaptive Static Analysis.; 2017.
apa: Bodden, E. (2017). Self-adaptive static analysis.
bibtex: '@book{Bodden_2017, title={Self-adaptive static analysis}, author={Bodden,
Eric}, year={2017} }'
chicago: Bodden, Eric. Self-Adaptive Static Analysis, 2017.
ieee: E. Bodden, Self-adaptive static analysis. 2017.
mla: Bodden, Eric. Self-Adaptive Static Analysis. 2017.
short: E. Bodden, Self-Adaptive Static Analysis, 2017.
date_created: 2020-11-30T10:27:21Z
date_updated: 2022-01-06T06:54:29Z
department:
- _id: '76'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1710.07430
report_number: arXiv:1710.07430
status: public
title: Self-adaptive static analysis
type: report
user_id: '5786'
year: '2017'
...
---
_id: '20557'
author:
- first_name: Max
full_name: Lillack, Max
last_name: Lillack
- first_name: Christian
full_name: Kästner, Christian
last_name: Kästner
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Lillack M, Kästner C, Bodden E. Tracking Load-time Configuration Options. IEEE
Transactions on Software Engineering. 2017;PP(99):1-1. doi:10.1109/TSE.2017.2756048
apa: Lillack, M., Kästner, C., & Bodden, E. (2017). Tracking Load-time Configuration
Options. IEEE Transactions on Software Engineering, PP(99), 1–1.
https://doi.org/10.1109/TSE.2017.2756048
bibtex: '@article{Lillack_Kästner_Bodden_2017, title={Tracking Load-time Configuration
Options}, volume={PP}, DOI={10.1109/TSE.2017.2756048},
number={99}, journal={IEEE Transactions on Software Engineering}, author={Lillack,
Max and Kästner, Christian and Bodden, Eric}, year={2017}, pages={1–1} }'
chicago: 'Lillack, Max, Christian Kästner, and Eric Bodden. “Tracking Load-Time
Configuration Options.” IEEE Transactions on Software Engineering PP, no.
99 (2017): 1–1. https://doi.org/10.1109/TSE.2017.2756048.'
ieee: 'M. Lillack, C. Kästner, and E. Bodden, “Tracking Load-time Configuration
Options,” IEEE Transactions on Software Engineering, vol. PP, no. 99, pp.
1–1, 2017, doi: 10.1109/TSE.2017.2756048.'
mla: Lillack, Max, et al. “Tracking Load-Time Configuration Options.” IEEE Transactions
on Software Engineering, vol. PP, no. 99, 2017, pp. 1–1, doi:10.1109/TSE.2017.2756048.
short: M. Lillack, C. Kästner, E. Bodden, IEEE Transactions on Software Engineering
PP (2017) 1–1.
date_created: 2020-11-30T11:06:43Z
date_updated: 2022-01-06T06:54:30Z
department:
- _id: '76'
doi: 10.1109/TSE.2017.2756048
issue: '99'
keyword:
- Androids
- Bluetooth
- Humanoid robots
- Java
- Software
- Tools
- Configuration options
- Static analysis
- Variability mining
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/lkb17lotrack.pdf
page: 1-1
publication: IEEE Transactions on Software Engineering
publication_identifier:
issn:
- 0098-5589
status: public
title: Tracking Load-time Configuration Options
type: journal_article
user_id: '5786'
volume: PP
year: '2017'
...
---
_id: '20558'
author:
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Sarah
full_name: Nadi, Sarah
last_name: Nadi
- first_name: Michael
full_name: Reif, Michael
last_name: Reif
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Florian
full_name: Göpfert, Florian
last_name: Göpfert
- first_name: Felix
full_name: Günther, Felix
last_name: Günther
- first_name: Christian
full_name: Weinert, Christian
last_name: Weinert
- first_name: Daniel
full_name: Demmler, Daniel
last_name: Demmler
- first_name: Ram
full_name: Kamath, Ram
last_name: Kamath
citation:
ama: 'Krüger S, Nadi S, Reif M, et al. CogniCrypt: Supporting Developers in using
Cryptography. In: International Conference on Automated Software Engineering
(ASE 2017), Tool Demo Track. ; 2017.'
apa: 'Krüger, S., Nadi, S., Reif, M., Ali, K., Mezini, M., Bodden, E., Göpfert,
F., Günther, F., Weinert, C., Demmler, D., & Kamath, R. (2017). CogniCrypt:
Supporting Developers in using Cryptography. International Conference on Automated
Software Engineering (ASE 2017), Tool Demo Track.'
bibtex: '@inproceedings{Krüger_Nadi_Reif_Ali_Mezini_Bodden_Göpfert_Günther_Weinert_Demmler_et
al._2017, title={CogniCrypt: Supporting Developers in using Cryptography}, booktitle={International
Conference on Automated Software Engineering (ASE 2017), Tool Demo Track}, author={Krüger,
Stefan and Nadi, Sarah and Reif, Michael and Ali, Karim and Mezini, Mira and Bodden,
Eric and Göpfert, Florian and Günther, Felix and Weinert, Christian and Demmler,
Daniel and et al.}, year={2017} }'
chicago: 'Krüger, Stefan, Sarah Nadi, Michael Reif, Karim Ali, Mira Mezini, Eric
Bodden, Florian Göpfert, et al. “CogniCrypt: Supporting Developers in Using Cryptography.”
In International Conference on Automated Software Engineering (ASE 2017), Tool
Demo Track, 2017.'
ieee: 'S. Krüger et al., “CogniCrypt: Supporting Developers in using Cryptography,”
2017.'
mla: 'Krüger, Stefan, et al. “CogniCrypt: Supporting Developers in Using Cryptography.”
International Conference on Automated Software Engineering (ASE 2017), Tool
Demo Track, 2017.'
short: 'S. Krüger, S. Nadi, M. Reif, K. Ali, M. Mezini, E. Bodden, F. Göpfert, F.
Günther, C. Weinert, D. Demmler, R. Kamath, in: International Conference on Automated
Software Engineering (ASE 2017), Tool Demo Track, 2017.'
date_created: 2020-11-30T11:08:26Z
date_updated: 2022-01-06T06:54:30Z
department:
- _id: '76'
keyword:
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/knr+17cognicrypt.pdf
publication: International Conference on Automated Software Engineering (ASE 2017),
Tool Demo Track
status: public
title: 'CogniCrypt: Supporting Developers in using Cryptography'
type: conference
user_id: '5786'
year: '2017'
...
---
_id: '20559'
author:
- first_name: Lisa Nguyen Quang
full_name: Do, Lisa Nguyen Quang
last_name: Do
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Benjamin
full_name: Livshits, Benjamin
last_name: Livshits
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Justin
full_name: Smith, Justin
last_name: Smith
- first_name: Emerson
full_name: Murphy-Hill, Emerson
last_name: Murphy-Hill
citation:
ama: 'Do LNQ, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. Just-in-time
Static Analysis. In: Proceedings of the 26th ACM SIGSOFT International Symposium
on Software Testing and Analysis. ISSTA 2017. ACM; 2017:307-317. doi:10.1145/3092703.3092705'
apa: Do, L. N. Q., Ali, K., Livshits, B., Bodden, E., Smith, J., & Murphy-Hill,
E. (2017). Just-in-time Static Analysis. Proceedings of the 26th ACM SIGSOFT
International Symposium on Software Testing and Analysis, 307–317. https://doi.org/10.1145/3092703.3092705
bibtex: '@inproceedings{Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2017, place={New
York, NY, USA}, series={ISSTA 2017}, title={Just-in-time Static Analysis}, DOI={10.1145/3092703.3092705}, booktitle={Proceedings
of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis},
publisher={ACM}, author={Do, Lisa Nguyen Quang and Ali, Karim and Livshits, Benjamin
and Bodden, Eric and Smith, Justin and Murphy-Hill, Emerson}, year={2017}, pages={307–317},
collection={ISSTA 2017} }'
chicago: 'Do, Lisa Nguyen Quang, Karim Ali, Benjamin Livshits, Eric Bodden, Justin
Smith, and Emerson Murphy-Hill. “Just-in-Time Static Analysis.” In Proceedings
of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis,
307–17. ISSTA 2017. New York, NY, USA: ACM, 2017. https://doi.org/10.1145/3092703.3092705.'
ieee: 'L. N. Q. Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill,
“Just-in-time Static Analysis,” in Proceedings of the 26th ACM SIGSOFT International
Symposium on Software Testing and Analysis, 2017, pp. 307–317, doi: 10.1145/3092703.3092705.'
mla: Do, Lisa Nguyen Quang, et al. “Just-in-Time Static Analysis.” Proceedings
of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis,
ACM, 2017, pp. 307–17, doi:10.1145/3092703.3092705.
short: 'L.N.Q. Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill, in:
Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing
and Analysis, ACM, New York, NY, USA, 2017, pp. 307–317.'
date_created: 2020-11-30T11:10:01Z
date_updated: 2022-01-06T06:54:30Z
department:
- _id: '76'
doi: 10.1145/3092703.3092705
keyword:
- Just-in-Time
- Layered analysis
- Static analysis
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/nal+17jit.pdf
page: 307-317
place: New York, NY, USA
publication: Proceedings of the 26th ACM SIGSOFT International Symposium on Software
Testing and Analysis
publication_identifier:
isbn:
- 978-1-4503-5076-1
publisher: ACM
series_title: ISSTA 2017
status: public
title: Just-in-time Static Analysis
type: conference
user_id: '5786'
year: '2017'
...
---
_id: '20715'
author:
- first_name: Lisa
full_name: Nguyen Quang Do, Lisa
last_name: Nguyen Quang Do
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Benjamin
full_name: Livshits, Benjamin
last_name: Livshits
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Justin
full_name: Smith, Justin
last_name: Smith
- first_name: Emerson
full_name: Murphy-Hill, Emerson
last_name: Murphy-Hill
citation:
ama: 'Nguyen Quang Do L, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. Cheetah:
Just-in-Time Taint Analysis for Android Apps. In: International Conference
for Software Engineering (ICSE), Tool Demonstrations Track. ; 2017.'
apa: 'Nguyen Quang Do, L., Ali, K., Livshits, B., Bodden, E., Smith, J., & Murphy-Hill,
E. (2017). Cheetah: Just-in-Time Taint Analysis for Android Apps. International
Conference for Software Engineering (ICSE), Tool Demonstrations Track.'
bibtex: '@inproceedings{Nguyen Quang Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2017,
title={Cheetah: Just-in-Time Taint Analysis for Android Apps}, booktitle={International
Conference for Software Engineering (ICSE), Tool Demonstrations Track}, author={Nguyen
Quang Do, Lisa and Ali, Karim and Livshits, Benjamin and Bodden, Eric and Smith,
Justin and Murphy-Hill, Emerson}, year={2017} }'
chicago: 'Nguyen Quang Do, Lisa, Karim Ali, Benjamin Livshits, Eric Bodden, Justin
Smith, and Emerson Murphy-Hill. “Cheetah: Just-in-Time Taint Analysis for Android
Apps.” In International Conference for Software Engineering (ICSE), Tool Demonstrations
Track, 2017.'
ieee: 'L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill,
“Cheetah: Just-in-Time Taint Analysis for Android Apps,” 2017.'
mla: 'Nguyen Quang Do, Lisa, et al. “Cheetah: Just-in-Time Taint Analysis for Android
Apps.” International Conference for Software Engineering (ICSE), Tool Demonstrations
Track, 2017.'
short: 'L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill,
in: International Conference for Software Engineering (ICSE), Tool Demonstrations
Track, 2017.'
date_created: 2020-12-14T11:51:44Z
date_updated: 2022-01-06T06:54:34Z
department:
- _id: '76'
keyword:
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/dal17cheetah.pdf
publication: International Conference for Software Engineering (ICSE), Tool Demonstrations
Track
status: public
title: 'Cheetah: Just-in-Time Taint Analysis for Android Apps'
type: conference
user_id: '5786'
year: '2017'
...
---
_id: '20792'
author:
- first_name: Stefano
full_name: Schivo, Stefano
last_name: Schivo
- first_name: Bugra M.
full_name: Yildiz., Bugra M.
last_name: Yildiz.
- first_name: Enno
full_name: Ruijters, Enno
last_name: Ruijters
- first_name: Christopher
full_name: Gerking, Christopher
last_name: Gerking
- first_name: Rajesh
full_name: Kumar, Rajesh
last_name: Kumar
- first_name: Stefan
full_name: Dziwok, Stefan
id: '3901'
last_name: Dziwok
orcid: http://orcid.org/0000-0002-8679-6673
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'Schivo S, Yildiz. BM, Ruijters E, et al. How to Efficiently Build a Front-End
Tool for UPPAAL: A Model-Driven Approach. In: Larsen KG, Sokolsky O, Wang J, eds.
Dependable Software Engineering, 3rd International Symposium (SETTA 2017).
Lecture Notes in Computer Science. Springer; 2017:319-336. doi:10.1007/978-3-319-69483-2_19'
apa: 'Schivo, S., Yildiz., B. M., Ruijters, E., Gerking, C., Kumar, R., Dziwok,
S., Rensink, A., & Stoelinga, M. (2017). How to Efficiently Build a Front-End
Tool for UPPAAL: A Model-Driven Approach. In K. G. Larsen, O. Sokolsky, &
J. Wang (Eds.), Dependable Software Engineering, 3rd International Symposium
(SETTA 2017) (Issue 10606, pp. 319–336). Springer. https://doi.org/10.1007/978-3-319-69483-2_19'
bibtex: '@inproceedings{Schivo_Yildiz._Ruijters_Gerking_Kumar_Dziwok_Rensink_Stoelinga_2017,
place={Changsha}, series={Lecture Notes in Computer Science}, title={How to Efficiently
Build a Front-End Tool for UPPAAL: A Model-Driven Approach}, DOI={10.1007/978-3-319-69483-2_19},
number={10606}, booktitle={Dependable Software Engineering, 3rd International
Symposium (SETTA 2017)}, publisher={Springer}, author={Schivo, Stefano and Yildiz.,
Bugra M. and Ruijters, Enno and Gerking, Christopher and Kumar, Rajesh and Dziwok,
Stefan and Rensink, Arend and Stoelinga, Mariëlle}, editor={Larsen, Kim G. and
Sokolsky, Oleg and Wang, Ji}, year={2017}, pages={319–336}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Schivo, Stefano, Bugra M. Yildiz., Enno Ruijters, Christopher Gerking,
Rajesh Kumar, Stefan Dziwok, Arend Rensink, and Mariëlle Stoelinga. “How to Efficiently
Build a Front-End Tool for UPPAAL: A Model-Driven Approach.” In Dependable
Software Engineering, 3rd International Symposium (SETTA 2017), edited by
Kim G. Larsen, Oleg Sokolsky, and Ji Wang, 319–36. Lecture Notes in Computer Science.
Changsha: Springer, 2017. https://doi.org/10.1007/978-3-319-69483-2_19.'
ieee: 'S. Schivo et al., “How to Efficiently Build a Front-End Tool for UPPAAL:
A Model-Driven Approach,” in Dependable Software Engineering, 3rd International
Symposium (SETTA 2017), 2017, no. 10606, pp. 319–336, doi: 10.1007/978-3-319-69483-2_19.'
mla: 'Schivo, Stefano, et al. “How to Efficiently Build a Front-End Tool for UPPAAL:
A Model-Driven Approach.” Dependable Software Engineering, 3rd International
Symposium (SETTA 2017), edited by Kim G. Larsen et al., no. 10606, Springer,
2017, pp. 319–36, doi:10.1007/978-3-319-69483-2_19.'
short: 'S. Schivo, B.M. Yildiz., E. Ruijters, C. Gerking, R. Kumar, S. Dziwok, A.
Rensink, M. Stoelinga, in: K.G. Larsen, O. Sokolsky, J. Wang (Eds.), Dependable
Software Engineering, 3rd International Symposium (SETTA 2017), Springer, Changsha,
2017, pp. 319–336.'
date_created: 2020-12-17T13:30:15Z
date_updated: 2022-01-06T06:54:38Z
department:
- _id: '76'
- _id: '241'
doi: 10.1007/978-3-319-69483-2_19
editor:
- first_name: Kim G.
full_name: Larsen, Kim G.
last_name: Larsen
- first_name: Oleg
full_name: Sokolsky, Oleg
last_name: Sokolsky
- first_name: Ji
full_name: Wang, Ji
last_name: Wang
issue: '10606'
language:
- iso: eng
page: 319-336
place: Changsha
publication: Dependable Software Engineering, 3rd International Symposium (SETTA 2017)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach'
type: conference
user_id: '5786'
year: '2017'
...
---
_id: '20794'
abstract:
- lang: eng
text: Cyber-physische Systeme (CPSs) sind die nächste Generation von eingebetteten
Systemen, die fortwährend ihre Zusammenarbeit koordinieren, um anspruchsvolle
Funktionen zu erfüllen. Die Koordination zwischen ihnen kann in Software mittels
asynchroner Nachrichtenkommunikation realisiert werden. Um die funktionale Korrektheit
der Software zu gewährleisten, ist aufgrund der Kritikalität dieser Systeme eine
formale Verifikation wie z.B. Model Checking notwendig. Die Eingabesprache eines
Model Checkers unterstützt jedoch domänenspezifische Aspekte wie asynchrone Kommunikation
nicht direkt, wodurch diese vom Softwareingenieur mittels zahlreicher Modellelemente
spezifiziert werden müssen. Dies ist hochgradig komplex und somit fehleranfällig.
Im Rahmen dieser Arbeit wird eine modellgetriebene Methode zur domänenspezifischen
Spezifikation und vollautomatischen Verifikation der nachrichtenbasierten Koordination
von CPSs präsentiert. Mit Hilfe dieser Methode kann der Softwareingenieur die
Koordination kompakt modellieren und muss nicht länger verstehen, wie seine Spezifikation
auf der Ebene des Model Checkers ausgedrückt wird. Insgesamt wird die Komplexität
für den Softwareingenieur somit deutlich handhabbarer. Bezüglich der Spezifikation
einer solchen Koordination definiert die Arbeit eine domänenspezifische Sprache
namens Real-Time Coordination Protocols (RTCPs). Darüber hinaus wird eine domänenspezifische
Sprache zur Spezifikation von Verifikationseigenschaften eingeführt und Entwurfsmuster
für RTCPs präsentiert, um die Anzahl der Modellierungsfehler zu senken.
author:
- first_name: Stefan
full_name: Dziwok, Stefan
id: '3901'
last_name: Dziwok
orcid: http://orcid.org/0000-0002-8679-6673
citation:
ama: Dziwok S. Specification and Verification for Real-Time Coordination Protocols
of Cyber-Physical Systems. Paderborn University; 2017.
apa: Dziwok, S. (2017). Specification and Verification for Real-Time Coordination
Protocols of Cyber-physical Systems. Paderborn University.
bibtex: '@book{Dziwok_2017, title={Specification and Verification for Real-Time
Coordination Protocols of Cyber-physical Systems}, publisher={Paderborn University},
author={Dziwok, Stefan}, year={2017} }'
chicago: Dziwok, Stefan. Specification and Verification for Real-Time Coordination
Protocols of Cyber-Physical Systems. Paderborn University, 2017.
ieee: S. Dziwok, Specification and Verification for Real-Time Coordination Protocols
of Cyber-physical Systems. Paderborn University, 2017.
mla: Dziwok, Stefan. Specification and Verification for Real-Time Coordination
Protocols of Cyber-Physical Systems. Paderborn University, 2017.
short: S. Dziwok, Specification and Verification for Real-Time Coordination Protocols
of Cyber-Physical Systems, Paderborn University, 2017.
date_created: 2020-12-17T13:32:52Z
date_updated: 2022-01-06T06:54:38Z
department:
- _id: '76'
- _id: '241'
language:
- iso: eng
publisher: Paderborn University
status: public
title: Specification and Verification for Real-Time Coordination Protocols of Cyber-physical
Systems
type: dissertation
user_id: '5786'
year: '2017'
...
---
_id: '20797'
author:
- first_name: Christopher
full_name: Gerking, Christopher
last_name: Gerking
- first_name: David
full_name: Schubert, David
id: '9106'
last_name: Schubert
- first_name: Ingo
full_name: Budde, Ingo
id: '13693'
last_name: Budde
orcid: https://orcid.org/0000-0003-0124-6291
citation:
ama: 'Gerking C, Schubert D, Budde I. Reducing the Verbosity of Imperative Model
Refinements by using General-Purpose Language Facilities. In: Guerra E, van den
Brand M, eds. Theory and Practice of Model Transformation, 10th International
Conference (ICMT 2017). Lecture Notes in Computer Science. Springer; 2017:19-34.'
apa: Gerking, C., Schubert, D., & Budde, I. (2017). Reducing the Verbosity of
Imperative Model Refinements by using General-Purpose Language Facilities. In
E. Guerra & M. van den Brand (Eds.), Theory and Practice of Model Transformation,
10th International Conference (ICMT 2017) (Issue 10374, pp. 19–34). Springer.
bibtex: '@inproceedings{Gerking_Schubert_Budde_2017, place={Marburg}, series={Lecture
Notes in Computer Science}, title={Reducing the Verbosity of Imperative Model
Refinements by using General-Purpose Language Facilities}, number={10374}, booktitle={Theory
and Practice of Model Transformation, 10th International Conference (ICMT 2017)},
publisher={Springer}, author={Gerking, Christopher and Schubert, David and Budde,
Ingo}, editor={Guerra, Esther and van den Brand, Mark}, year={2017}, pages={19–34},
collection={Lecture Notes in Computer Science} }'
chicago: 'Gerking, Christopher, David Schubert, and Ingo Budde. “Reducing the Verbosity
of Imperative Model Refinements by Using General-Purpose Language Facilities.”
In Theory and Practice of Model Transformation, 10th International Conference
(ICMT 2017), edited by Esther Guerra and Mark van den Brand, 19–34. Lecture
Notes in Computer Science. Marburg: Springer, 2017.'
ieee: C. Gerking, D. Schubert, and I. Budde, “Reducing the Verbosity of Imperative
Model Refinements by using General-Purpose Language Facilities,” in Theory
and Practice of Model Transformation, 10th International Conference (ICMT 2017),
2017, no. 10374, pp. 19–34.
mla: Gerking, Christopher, et al. “Reducing the Verbosity of Imperative Model Refinements
by Using General-Purpose Language Facilities.” Theory and Practice of Model
Transformation, 10th International Conference (ICMT 2017), edited by Esther
Guerra and Mark van den Brand, no. 10374, Springer, 2017, pp. 19–34.
short: 'C. Gerking, D. Schubert, I. Budde, in: E. Guerra, M. van den Brand (Eds.),
Theory and Practice of Model Transformation, 10th International Conference (ICMT
2017), Springer, Marburg, 2017, pp. 19–34.'
date_created: 2020-12-17T13:36:44Z
date_updated: 2022-01-06T06:54:39Z
department:
- _id: '76'
- _id: '241'
editor:
- first_name: Esther
full_name: Guerra, Esther
last_name: Guerra
- first_name: Mark
full_name: van den Brand, Mark
last_name: van den Brand
issue: '10374'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-3-319-61473-1_2
page: 19-34
place: Marburg
publication: Theory and Practice of Model Transformation, 10th International Conference
(ICMT 2017)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Reducing the Verbosity of Imperative Model Refinements by using General-Purpose
Language Facilities
type: conference
user_id: '5786'
year: '2017'
...
---
_id: '20804'
abstract:
- lang: eng
text: Modern Cyber-physical Systems are executed in physical environments and distributed
over several Electronic Control Units using multiple cores for execution. These
systems perform safety-critical tasks and, therefore, have to fulfill hard real-time
requirements. To face these requirements systematically, system engineers de-
velop these systems model-driven and prove the fulfillment of these requirements
via model checking. It is important to ensure that the runtime scheduling does
not violate the verified requirements by neglecting the model checking assumptions.
Currently, there is a gap in the process for model-driven approaches to derive
a feasible runtime scheduling that respects these assumptions. In this paper,
we present an approach for a semi- automatic synthesis of behavioral models into
a deterministic scheduling that respects real-time requirements at runtime. We
evaluate our approach using an example of a distributed automotive system with
hard real-time requirements specified with the MechatronicUML method.
author:
- first_name: Johannes
full_name: Geismann, Johannes
id: '20063'
last_name: Geismann
orcid: https://orcid.org/0000-0003-2015-2047
- first_name: Uwe
full_name: Pohlmann, Uwe
last_name: Pohlmann
- first_name: David
full_name: Schmelter, David
id: '40982'
last_name: Schmelter
orcid: 0000-0001-7787-5380
citation:
ama: 'Geismann J, Pohlmann U, Schmelter D. Towards an Automated Synthesis of a Real-time
Scheduling for Cyber-physical Multi-core Systems. In: Proceedings of the 5th
International Conference on Model-Driven Engineering and Software Development.
; 2017.'
apa: Geismann, J., Pohlmann, U., & Schmelter, D. (2017). Towards an Automated
Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems. Proceedings
of the 5th International Conference on Model-Driven Engineering and Software Development.
bibtex: '@inproceedings{Geismann_Pohlmann_Schmelter_2017, title={Towards an Automated
Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems}, booktitle={Proceedings
of the 5th International Conference on Model-Driven Engineering and Software Development},
author={Geismann, Johannes and Pohlmann, Uwe and Schmelter, David}, year={2017}
}'
chicago: Geismann, Johannes, Uwe Pohlmann, and David Schmelter. “Towards an Automated
Synthesis of a Real-Time Scheduling for Cyber-Physical Multi-Core Systems.” In
Proceedings of the 5th International Conference on Model-Driven Engineering
and Software Development, 2017.
ieee: J. Geismann, U. Pohlmann, and D. Schmelter, “Towards an Automated Synthesis
of a Real-time Scheduling for Cyber-physical Multi-core Systems,” 2017.
mla: Geismann, Johannes, et al. “Towards an Automated Synthesis of a Real-Time Scheduling
for Cyber-Physical Multi-Core Systems.” Proceedings of the 5th International
Conference on Model-Driven Engineering and Software Development, 2017.
short: 'J. Geismann, U. Pohlmann, D. Schmelter, in: Proceedings of the 5th International
Conference on Model-Driven Engineering and Software Development, 2017.'
date_created: 2020-12-17T13:59:04Z
date_updated: 2022-01-06T06:54:39Z
department:
- _id: '76'
- _id: '241'
- _id: '662'
language:
- iso: eng
publication: Proceedings of the 5th International Conference on Model-Driven Engineering
and Software Development
status: public
title: Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical
Multi-core Systems
type: conference
user_id: '5786'
year: '2017'
...