citations.bib

@inproceedings{frolich_generic_2021,
	address = {Cham},
	title = {A {Generic} {Back}-{End} for {Exploratory} {Programming}},
	isbn = {9783030839789},
	doi = {10.1007/978-3-030-83978-9_2},
	abstract = {Exploratory programming is a form of incremental program development in which the programmer can try and compare definitions, receives immediate feedback and can simultaneously experiment with the language, the program and input data. Read-Eval-Print-Loop interpreters (REPLs) and computational notebooks are popular tools for exploratory programming. However, their usability, capabilities and user-friendliness are strongly dependent on the underlying interpreter and, in particular, on the ad hoc engineering required to ready the underlying interpreter for incremental program development. To break this dependency, this paper adopts a principled approach and implements a so-called exploring interpreter as a back-end to support various development environments for exploratory programming.},
	language = {en},
	booktitle = {Trends in {Functional} {Programming}},
	publisher = {Springer International Publishing},
	author = {Frolich, Damian and van Binsbergen, L. Thomas},
	editor = {Zsók, Viktória and Hughes, John},
	year = {2021},
	pages = {24--43},
}

@article{van_binsbergen_eflint:_2020,
	title = {{eFLINT}: a domain-specific language for executable norm specifications},
	shorttitle = {{eFLINT}},
	url = {https://dare.uva.nl/search?identifier=bb19cb35-c43e-4d70-81c9-8b6d3bdaa091},
	doi = {10.1145/3425898.3426958},
	language = {en},
	urldate = {2022-05-31},
	author = {van Binsbergen, L. T. and Liu, L.-C. and van Doesburg, R. and van Engers, T.},
	year = {2020},
}

@article{van_binsbergen_dynamic_2022,
	title = {Dynamic generation of access control policies from social policies},
	volume = {198},
	issn = {18770509},
	url = {https://linkinghub.elsevier.com/retrieve/pii/S1877050921024601},
	doi = {10.1016/j.procs.2021.12.221},
	language = {en},
	urldate = {2022-05-31},
	journal = {Procedia Computer Science},
	author = {van Binsbergen, L. Thomas and Kebede, Milen G. and Baugh, Joshua and Engers, Tom van and van Vuurden, Dannis G.},
	year = {2022},
	pages = {140--147},
}

@inproceedings{van_binsbergen_principled_2020,
	address = {New York, NY, USA},
	series = {Onward! 2020},
	title = {A principled approach to {REPL} interpreters},
	isbn = {9781450381789},
	url = {https://doi.org/10.1145/3426428.3426917},
	doi = {10.1145/3426428.3426917},
	abstract = {Read-eval-print-loops (REPLs) allow programmers to test out snippets of code, explore APIs, or even incrementally construct code, and get immediate feedback on their actions. However, even though many languages provide a REPL, the relation between the language as is and what is accepted at the REPL prompt is not always well-defined. Furthermore, implementing a REPL for new languages, such as DSLs, may incur significant language engineering cost. In this paper we survey the domain of REPLs and investigate the (formal) principles underlying REPLs. We identify and define the class of sequential languages, which admit a sound REPL implementation based on a definitional interpreter, and present design guidelines for extending existing language implementations to support REPL-style interfaces (including computational notebooks). The obtained REPLs can then be generically turned into an exploring interpreter, to allow exploration of the user's interaction. The approach is illustrated using three case studies, based on MiniJava, QL (a DSL for questionnaires), and eFLINT (a DSL for normative rules). We expect sequential languages, and the consequent design principles, to be stepping stones towards a better understanding of the essence of REPLs.},
	urldate = {2022-05-31},
	booktitle = {Proceedings of the 2020 {ACM} {SIGPLAN} {International} {Symposium} on {New} {Ideas}, {New} {Paradigms}, and {Reflections} on {Programming} and {Software}},
	publisher = {Association for Computing Machinery},
	author = {van Binsbergen, L. Thomas and Verano Merino, Mauricio and Jeanjean, Pierre and van der Storm, Tijs and Combemale, Benoit and Barais, Olivier},
	month = nov,
	year = {2020},
	keywords = {interpreters, note- books, software language engineering, language workbenches, meta-languages, REPLs},
	pages = {84--100},
}

@article{de_filippi_smart_2021,
	title = {Smart contracts},
	volume = {10},
	issn = {2197-6775},
	url = {https://policyreview.info/glossary/smart-contracts},
	doi = {10.14763/2021.2.1549},
	language = {en},
	number = {2},
	urldate = {2022-05-31},
	journal = {Internet Policy Review},
	author = {De Filippi, Primavera and Wray, Chris and Sileno, Giovanni},
	month = apr,
	year = {2021},
}

@incollection{rodriguez-doncel_critical_2021,
	address = {Cham},
	title = {A {Critical} {Reflection} on {ODRL}},
	volume = {13048},
	isbn = {9783030898106 9783030898113},
	url = {https://link.springer.com/10.1007/978-3-030-89811-3_4},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {{AI} {Approaches} to the {Complexity} of {Legal} {Systems} {XI}-{XII}},
	publisher = {Springer International Publishing},
	author = {Kebede, Milen G. and Sileno, Giovanni and Van Engers, Tom},
	editor = {Rodríguez-Doncel, Víctor and Palmirani, Monica and Araszkiewicz, Michał and Casanovas, Pompeu and Pagallo, Ugo and Sartor, Giovanni},
	year = {2021},
	doi = {10.1007/978-3-030-89811-3_4},
	pages = {48--61},
}

@incollection{schweighofer_computability_2021,
	title = {Computability of {Diagrammatic} {Theories} for {Normative} {Positions}},
	isbn = {9781643682525 9781643682532},
	url = {https://ebooks.iospress.nl/doi/10.3233/FAIA210333},
	abstract = {Normative positions are sometimes illustrated in diagrams, in particular in didactic contexts. Traditional examples are the Aristotelian polygons of opposition for deontic modalities (squares, triangles, hexagons, etc.), and the Hohfeldian squares for obligative and potestative concepts. Relying on previous work, we show that Hohfeld’s framework can be used as a basis for developing several Aristotelian polygons and more complex diagrams. Then, we illustrate how logical theories of increasing strength can be built based on these diagrams, and how those theories enable us to determine in a computably efficient way whether a set of normative positions can be derived from another set of normative positions.},
	urldate = {2022-05-31},
	booktitle = {Frontiers in {Artificial} {Intelligence} and {Applications}},
	publisher = {IOS Press},
	author = {Pascucci, Matteo and Sileno, Giovanni},
	editor = {Schweighofer, Erich},
	month = dec,
	year = {2021},
	doi = {10.3233/FAIA210333},
}

@inproceedings{basu_search_2021,
	address = {Cham},
	title = {The {Search} for {Symmetry} in {Hohfeldian} {Modalities}},
	volume = {12909},
	isbn = {9783030860615 9783030860622},
	url = {https://link.springer.com/10.1007/978-3-030-86062-2_9},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Diagrammatic {Representation} and {Inference}},
	publisher = {Springer International Publishing},
	author = {Pascucci, Matteo and Sileno, Giovanni},
	editor = {Basu, Amrita and Stapleton, Gem and Linker, Sven and Legg, Catherine and Manalo, Emmanuel and Viana, Petrucio},
	year = {2021},
	doi = {10.1007/978-3-030-86062-2_9},
	pages = {87--102},
}

@inproceedings{schweighofer_computability_2021-1,
	title = {Computability of {Diagrammatic} {Theories} for {Normative} {Positions}},
	isbn = {9781643682525 9781643682532},
	url = {https://ebooks.iospress.nl/doi/10.3233/FAIA210333},
	abstract = {Normative positions are sometimes illustrated in diagrams, in particular in didactic contexts. Traditional examples are the Aristotelian polygons of opposition for deontic modalities (squares, triangles, hexagons, etc.), and the Hohfeldian squares for obligative and potestative concepts. Relying on previous work, we show that Hohfeld’s framework can be used as a basis for developing several Aristotelian polygons and more complex diagrams. Then, we illustrate how logical theories of increasing strength can be built based on these diagrams, and how those theories enable us to determine in a computably efficient way whether a set of normative positions can be derived from another set of normative positions.},
	urldate = {2022-05-31},
	booktitle = {Frontiers in {Artificial} {Intelligence} and {Applications}},
	publisher = {IOS Press},
	author = {Pascucci, Matteo and Sileno, Giovanni},
	editor = {Schweighofer, Erich},
	month = dec,
	year = {2021},
	doi = {10.3233/FAIA210333},
}

@incollection{baratchi_solving_2021,
	address = {Cham},
	title = {Solving {Hofstadter}’s {Analogies} {Using} {Structural} {Information} {Theory}},
	volume = {1398},
	isbn = {9783030766399 9783030766405},
	url = {https://link.springer.com/10.1007/978-3-030-76640-5_7},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Artificial {Intelligence} and {Machine} {Learning}},
	publisher = {Springer International Publishing},
	author = {Rijsdijk, Geerten and Sileno, Giovanni},
	editor = {Baratchi, Mitra and Cao, Lu and Kosters, Walter A. and Lijffijt, Jefrey and van Rijn, Jan N. and Takes, Frank W.},
	year = {2021},
	doi = {10.1007/978-3-030-76640-5_7},
	pages = {106--121},
}

@inproceedings{sileno_accounting_2021,
	address = {Virtual Event USA},
	title = {Accounting {Value} {Effects} for {Responsible} {Networking}},
	isbn = {9781450386395},
	url = {https://dl.acm.org/doi/10.1145/3472951.3473507},
	doi = {10.1145/3472951.3473507},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Proceedings of the {ACM} {SIGCOMM} 2021 {Workshop} on {Technologies}, {Applications}, and {Uses} of a {Responsible} {Internet}},
	publisher = {ACM},
	author = {Sileno, Giovanni and Grosso, Paola},
	month = aug,
	year = {2021},
	pages = {29--35},
}

@incollection{rodriguez-doncel_like_2021,
	address = {Cham},
	title = {Like {Circles} in the {Water}: {Responsibility} as a {System}-{Level} {Function}},
	volume = {13048},
	isbn = {9783030898106 9783030898113},
	shorttitle = {Like {Circles} in the {Water}},
	url = {https://link.springer.com/10.1007/978-3-030-89811-3_14},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {{AI} {Approaches} to the {Complexity} of {Legal} {Systems} {XI}-{XII}},
	publisher = {Springer International Publishing},
	author = {Sileno, Giovanni and Boer, Alexander and Gordon, Geoff and Rieder, Bernhard},
	editor = {Rodríguez-Doncel, Víctor and Palmirani, Monica and Araszkiewicz, Michał and Casanovas, Pompeu and Pagallo, Ugo and Sartor, Giovanni},
	year = {2021},
	doi = {10.1007/978-3-030-89811-3_14},
	pages = {198--211},
}

@incollection{krzhizhanovskaya_integrating_2020,
	address = {Cham},
	title = {Integrating {Agent}-{Based} {Modelling} with {Copula} {Theory}: {Preliminary} {Insights} and {Open} {Problems}},
	volume = {12139},
	isbn = {9783030504199 9783030504205},
	shorttitle = {Integrating {Agent}-{Based} {Modelling} with {Copula} {Theory}},
	url = {http://link.springer.com/10.1007/978-3-030-50420-5_16},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Computational {Science} – {ICCS} 2020},
	publisher = {Springer International Publishing},
	author = {Fratrič, Peter and Sileno, Giovanni and van Engers, Tom and Klous, Sander},
	editor = {Krzhizhanovskaya, Valeria V. and Závodszky, Gábor and Lees, Michael H. and Dongarra, Jack J. and Sloot, Peter M. A. and Brissos, Sérgio and Teixeira, João},
	year = {2020},
	doi = {10.1007/978-3-030-50420-5_16},
	pages = {212--225},
}

@incollection{villata_digital_2020,
	title = {Digital {Enforceable} {Contracts} ({DEC}): {Making} {Smart} {Contracts} {Smarter}},
	isbn = {9781643681504 9781643681511},
	shorttitle = {Digital {Enforceable} {Contracts} ({DEC})},
	url = {http://ebooks.iospress.nl/doi/10.3233/FAIA200872},
	abstract = {The combination of smart contracts with blockchain technology enables the authentication of the contract and limits the risks of non-compliance. In principle, smart contracts can be processed more efficiently compared to traditional paper-based contracts. However, current smart contracts have very limited capabilities with respect to normative representations, making them too distant from actual contracts. In order to reduce this gap, the paper presents an architectural analysis to see the role of computational artifacts in terms of various ex-ante and ex-post enforcement mechanisms. The proposed framework is assessed using scenarios concerning data-sharing operations bound by legal requirements from the General Data Protection Regulation (GDPR) and data-sharing agreements.},
	urldate = {2022-05-31},
	booktitle = {Frontiers in {Artificial} {Intelligence} and {Applications}},
	publisher = {IOS Press},
	author = {Liu, Lu-Chi and Sileno, Giovanni and Van Engers, Tom},
	editor = {Villata, Serena and Harašta, Jakub and Křemen, Petr},
	month = dec,
	year = {2020},
	doi = {10.3233/FAIA200872},
}

@article{van_der_zwet_promises_2022,
	title = {Promises and pitfalls of computational modelling for insurgency conflicts},
	issn = {1548-5129, 1557-380X},
	url = {http://journals.sagepub.com/doi/10.1177/15485129211073612},
	doi = {10.1177/15485129211073612},
	abstract = {Insurgency conflicts pose significant challenges to societies globally. The increase of insurgency conflicts creates a need to understand how insurgencies arise, and to identify societal drivers of insurgencies or effective strategies to counter them. In this paper, we analyze the contributions of computational modeling methods for the analysis of insurgent conflicts. We formalize a specific literature-based analysis framework using the identified key factors and drivers, which enables the evaluation of specific models in this domain. Through a systematic literature search, we identify 64 computational models to apply our framework. We highlight the development and contributions of various methodologies through an in-depth analysis of 13 high-quality models. The evaluation of these computational models revealed promising directions and future topics to design specific simulation models for all identified factors. In addition, our analysis revealed specific pitfalls concerning validity issues for each of the modeling methods.},
	language = {en},
	urldate = {2022-05-31},
	journal = {The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology},
	author = {van der Zwet, Koen and Barros, Ana I and van Engers, Tom M and Sloot, Peter M A},
	month = jan,
	year = {2022},
	pages = {154851292110736},
}

@article{kwik_algorithmic_2021,
	title = {Algorithmic fog of war: {When} lack of transparency violates the law of armed conflict},
	volume = {2},
	issn = {25899961, 25899953},
	shorttitle = {Algorithmic fog of war},
	url = {https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/FRL-200019},
	doi = {10.3233/FRL-200019},
	abstract = {Under international law, weapon capabilities and their use are regulated by legal requirements set by International Humanitarian Law (IHL). Currently, there are strong military incentives to equip capabilities with increasingly advanced artificial intelligence (AI), which include opaque (less transparent) models. As opaque models sacrifice transparency for performance, it is necessary to examine whether their use remains in conformity with IHL obligations. First, we demonstrate that the incentives for automation drive AI toward complex task areas and dynamic and unstructured environments, which in turn necessitates resort to more opaque solutions. We subsequently discuss the ramifications of opaque models for foreseeability and explainability. Then, we analyse their impact on IHL requirements from a development, pre-deployment and post-deployment perspective. We find that while IHL does not regulate opaque AI directly, the lack of foreseeability and explainability frustrates the fulfilment of key IHL requirements to the extent that the use of fully opaque AI could violate international law. States are urged to implement interpretability during development and seriously consider the challenging complication of determining the appropriate balance between transparency and performance in their capabilities.},
	number = {1-2},
	urldate = {2022-05-31},
	journal = {Journal of Future Robot Life},
	author = {Kwik, Jonathan and Van Engers, Tom},
	month = dec,
	year = {2021},
	pages = {43--66},
}

@incollection{villata_digital_2020-1,
	title = {Digital {Enforceable} {Contracts} ({DEC}): {Making} {Smart} {Contracts} {Smarter}},
	isbn = {9781643681504 9781643681511},
	shorttitle = {Digital {Enforceable} {Contracts} ({DEC})},
	url = {http://ebooks.iospress.nl/doi/10.3233/FAIA200872},
	abstract = {The combination of smart contracts with blockchain technology enables the authentication of the contract and limits the risks of non-compliance. In principle, smart contracts can be processed more efficiently compared to traditional paper-based contracts. However, current smart contracts have very limited capabilities with respect to normative representations, making them too distant from actual contracts. In order to reduce this gap, the paper presents an architectural analysis to see the role of computational artifacts in terms of various ex-ante and ex-post enforcement mechanisms. The proposed framework is assessed using scenarios concerning data-sharing operations bound by legal requirements from the General Data Protection Regulation (GDPR) and data-sharing agreements.},
	urldate = {2022-05-31},
	booktitle = {Frontiers in {Artificial} {Intelligence} and {Applications}},
	publisher = {IOS Press},
	author = {Liu, Lu-Chi and Sileno, Giovanni and Van Engers, Tom},
	editor = {Villata, Serena and Harašta, Jakub and Křemen, Petr},
	month = dec,
	year = {2020},
	doi = {10.3233/FAIA200872},
}

@inproceedings{zhou_policy_2020,
	address = {Guangzhou, China},
	title = {Policy {Enforcement} for {Secure} and {Trustworthy} {Data} {Sharing} in {Multi}-domain {Infrastructures}},
	isbn = {9781665403962},
	url = {https://ieeexplore.ieee.org/document/9343348/},
	doi = {10.1109/BigDataSE50710.2020.00022},
	urldate = {2022-05-31},
	booktitle = {2020 {IEEE} 14th {International} {Conference} on {Big} {Data} {Science} and {Engineering} ({BigDataSE})},
	publisher = {IEEE},
	author = {Zhou, Xin and Cushing, Reginald and Koning, Ralph and Belloum, Adam and Grosso, Paola and Klous, Sander and van Engers, Tom and de Laat, Cees},
	month = dec,
	year = {2020},
	pages = {104--113},
}

@inproceedings{deljoo_managing_2019,
	address = {Quito, Ecuador},
	title = {Managing {Effective} {Collaboration} in {Cybersecurity} {Alliances} {Using} {Social} {Computational} {Trust}},
	isbn = {9781728139494},
	url = {https://ieeexplore.ieee.org/document/9108949/},
	doi = {10.1109/CSNet47905.2019.9108949},
	urldate = {2022-05-31},
	booktitle = {2019 3rd {Cyber} {Security} in {Networking} {Conference} ({CSNet})},
	publisher = {IEEE},
	author = {Deljoo, Ameneh and Koning, Ralph and van Engers, Tom and Gommans, Leon and de Laat, Cees},
	month = oct,
	year = {2019},
	pages = {50--57},
}

@inproceedings{deljoo_managing_2019-1,
	address = {Quito, Ecuador},
	title = {Managing {Effective} {Collaboration} in {Cybersecurity} {Alliances} {Using} {Social} {Computational} {Trust}},
	isbn = {9781728139494},
	url = {https://ieeexplore.ieee.org/document/9108949/},
	doi = {10.1109/CSNet47905.2019.9108949},
	urldate = {2022-05-31},
	booktitle = {2019 3rd {Cyber} {Security} in {Networking} {Conference} ({CSNet})},
	publisher = {IEEE},
	author = {Deljoo, Ameneh and Koning, Ralph and van Engers, Tom and Gommans, Leon and de Laat, Cees},
	month = oct,
	year = {2019},
	pages = {50--57},
}

@inproceedings{demchenko_open_2019,
	address = {Dublin, Ireland},
	title = {Open {Data} {Market} {Architecture} and {Functional} {Components}},
	isbn = {9781728144849},
	url = {https://ieeexplore.ieee.org/document/9188195/},
	doi = {10.1109/HPCS48598.2019.9188195},
	urldate = {2022-05-31},
	booktitle = {2019 {International} {Conference} on {High} {Performance} {Computing} \& {Simulation} ({HPCS})},
	publisher = {IEEE},
	author = {Demchenko, Yuri and Cushing, Reggie and Los, Wouter and Grosso, Paola and de Laat, Cees and Gommans, Leon},
	month = jul,
	year = {2019},
	pages = {1017--1021},
}

@inproceedings{demchenko_big_2019,
	address = {Oxford United Kingdom},
	title = {Big {Data} {Platforms} and {Tools} for {Data} {Analytics} in the {Data} {Science} {Engineering} {Curriculum}},
	isbn = {9781450371650},
	url = {https://dl.acm.org/doi/10.1145/3358505.3358512},
	doi = {10.1145/3358505.3358512},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Proceedings of the 2019 3rd {International} {Conference} on {Cloud} and {Big} {Data} {Computing}},
	publisher = {ACM},
	author = {Demchenko, Yuri},
	month = aug,
	year = {2019},
	pages = {60--64},
}

@inproceedings{demchenko_designing_2019,
	address = {London, United Kingdom},
	title = {Designing {Customisable} {Data} {Science} {Curriculum} {Using} {Ontology} for {Data} {Science} {Competences} and {Body} of {Knowledge}},
	isbn = {9781450361866},
	url = {http://dl.acm.org/citation.cfm?doid=3322134.3322143},
	doi = {10.1145/3322134.3322143},
	language = {en},
	urldate = {2022-05-31},
	booktitle = {Proceedings of the 2019 {International} {Conference} on {Big} {Data} and {Education}  - {ICBDE}'19},
	publisher = {ACM Press},
	author = {Demchenko, Yuri and Comminiello, Luca and Reali, Gianluca},
	year = {2019},
	pages = {124--128},
}

@inproceedings{abella_security_2021,
	address = {Bruges, Belgium},
	title = {Security, {Reliability} and {Test} {Aspects} of the {RISC}-{V} {Ecosystem}},
	isbn = {9781665418492},
	url = {https://ieeexplore.ieee.org/document/9465449/},
	doi = {10.1109/ETS50041.2021.9465449},
	urldate = {2022-05-31},
	booktitle = {2021 {IEEE} {European} {Test} {Symposium} ({ETS})},
	publisher = {IEEE},
	author = {Abella, Jaume and Alcaide, Sergi and Anders, Jens and Bas, Francisco and Becker, Steffen and De Mulder, Elke and Elhamawy, Nourhan and Gurkaynak, Frank K. and Handschuh, Helena and Hernandez, Carles and Hutter, Mike and Kosmidis, Leonidas and Polian, Ilia and Sauer, Matthias and Wagner, Stefan and Regazzoni, Francesco},
	month = may,
	year = {2021},
	pages = {1--10},
}

@inproceedings{bellizia_post-quantum_2021,
	address = {Athens, Greece},
	title = {Post-{Quantum} {Cryptography}: {Challenges} and {Opportunities} for {Robust} and {Secure} {HW} {Design}},
	isbn = {9781665416092},
	shorttitle = {Post-{Quantum} {Cryptography}},
	url = {https://ieeexplore.ieee.org/document/9568301/},
	doi = {10.1109/DFT52944.2021.9568301},
	urldate = {2022-05-31},
	booktitle = {2021 {IEEE} {International} {Symposium} on {Defect} and {Fault} {Tolerance} in {VLSI} and {Nanotechnology} {Systems} ({DFT})},
	publisher = {IEEE},
	author = {Bellizia, Davide and Mrabet, Nadia El and Fournaris, Apostolos P. and Pontie, Simon and Regazzoni, Francesco and Standaert, Francois-Xavier and Tasso, Elise and Valea, Emanuele},
	month = oct,
	year = {2021},
	pages = {1--6},
}

@article{bhasin_special_2021,
	title = {Special {Section} on {Attacking} and {Protecting} {Artificial} {Intelligence}},
	volume = {6},
	issn = {2468-2322, 2468-2322},
	url = {https://onlinelibrary.wiley.com/doi/10.1049/cit2.12023},
	doi = {10.1049/cit2.12023},
	language = {en},
	number = {1},
	urldate = {2022-05-31},
	journal = {CAAI Transactions on Intelligence Technology},
	author = {Bhasin, Shivam and Garg, Siddharth and Regazzoni, Francesco},
	month = mar,
	year = {2021},
	pages = {1--2},
}

@inproceedings{caforio_deeper_2021,
	address = {Grenoble, France},
	title = {A {Deeper} {Look} at the {Energy} {Consumption} of {Lightweight} {Block} {Ciphers}},
	isbn = {9783981926354},
	url = {https://ieeexplore.ieee.org/document/9474018/},
	doi = {10.23919/DATE51398.2021.9474018},
	urldate = {2022-05-31},
	booktitle = {2021 {Design}, {Automation} \& {Test} in {Europe} {Conference} \& {Exhibition} ({DATE})},
	publisher = {IEEE},
	author = {Caforio, Andrea and Balli, Fatih and Banik, Subhadeep and Regazzoni, Francesco},
	month = feb,
	year = {2021},
	pages = {170--175},
}

@article{cammarota_guest_2021,
	title = {Guest {Editors}’ {Introduction}: {Special} {Issue} on {Top} {Picks} in {Hardware} and {Embedded} {Security}},
	volume = {38},
	issn = {2168-2356, 2168-2364},
	shorttitle = {Guest {Editors}’ {Introduction}},
	url = {https://ieeexplore.ieee.org/document/9439147/},
	doi = {10.1109/MDAT.2021.3068938},
	number = {3},
	urldate = {2022-05-31},
	journal = {IEEE Design \& Test},
	author = {Cammarota, Rosario and Regazzoni, Francesco},
	month = jun,
	year = {2021},
	pages = {5--6},
}

@article{gao_instruction_2021,
	title = {An {Instruction} {Set} {Extension} to {Support} {Software}-{Based} {Masking}},
	issn = {2569-2925},
	url = {https://tches.iacr.org/index.php/TCHES/article/view/9067},
	doi = {10.46586/tches.v2021.i4.283-325},
	abstract = {In both hardware and software, masking can represent an effective means of hardening an implementation against side-channel attack vectors such as Differential Power Analysis (DPA). Focusing on software, however, the use of masking can present various challenges: specifically, it often 1) requires significant effort to translate any theoretical security properties into practice, and, even then, 2) imposes a significant overhead in terms of efficiency. To address both challenges, this paper explores the use of an Instruction Set Extension (ISE) to support masking in software-based implementations of a range of (symmetric) cryptographic kernels including AES: we design, implement, and evaluate such an ISE, using RISC-V as the base ISA. Our ISE-supported first-order masked implementation of AES, for example, is an order of magnitude more efficient than a software-only alternative with respect to both execution latency and memory footprint; this renders it comparable to an unmasked implementation using the same metrics, but also first-order secure.},
	urldate = {2022-05-31},
	journal = {IACR Transactions on Cryptographic Hardware and Embedded Systems},
	author = {Gao, Si and Großschädl, Johann and Marshall, Ben and Page, Dan and Pham, Thinh and Regazzoni, Francesco},
	month = aug,
	year = {2021},
	pages = {283--325},
}

@article{mann_decentralized_2022,
	title = {Decentralized application placement in fog computing},
	issn = {1558-2183},
	doi = {10.1109/TPDS.2022.3148985},
	abstract = {In recent years, cloud computing concepts have been extended towards the network edge, leading to paradigms like edge computing and fog computing. As a result, applications can be placed on a variety of resources, including fog nodes and cloud data centers. Application placement has significant impact on important metrics like latency. Finding an optimal application placement is computationally challenging, particularly because of the potentially huge number of infrastructure nodes and application components. To overcome the limited scalability of application placement algorithms, optimization can be decentralized, i.e., performed separately for different parts of the infrastructure. The infrastructure can be split into fog colonies, where a fog colony consists of the computational resources in a given geographical region. Application placement can then be performed for the individual fog colonies, thus mitigating the scalability problem. However, independent optimization of application placement in different fog colonies may lead to missed synergies and thus to sub-optimal overall results. Hence, some kind of coordination between fog colonies may be beneficial. In this paper, we analyze the effects of decentralization and coordination on the optimization results. In particular, we compare empirically four different approaches: (i) centralized decision-making, where decisions are made in one go for the entire infrastructure, (ii) independent fog colonies, where optimization is carried out in each fog colony independently from each other, (iii) fog colonies with communication, where excess application components in one fog colony can be sent to a neighboring fog colony, and (iv) fog colonies with overlaps, where shared resources may be dynamically distributed between neighboring fog colonies. Our experiments show that, for large problem instances, decentralization combined with coordination leads to the best results.},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	author = {Mann, Zoltan Adam},
	year = {2022},
	keywords = {Peer-to-peer computing, Cloud computing, Optimization, Scalability, Edge computing, Task analysis, Bandwidth, Fog computing, edge computing, application placement, distributed algorithms, fog colonies},
	pages = {1--1},
}

@article{mann_cost-optimized_2022,
	title = {Cost-optimized, data-protection-aware offloading between an edge data center and the cloud},
	issn = {1939-1374},
	doi = {10.1109/TSC.2022.3144645},
	abstract = {An edge data center can host applications that require low-latency access to nearby end devices. If the resource requirements of the applications exceed the capacity of the edge data center, some non-latency-critical application components may be offloaded to the cloud. Such offloading may incur financial costs both for the use of cloud resources and for data transfer between the edge data center and the cloud. Moreover, such offloading may violate data protection requirements if components process sensitive data. The operator of the edge data center has to decide which components to keep in the edge data center and which ones to offload to the cloud. In this paper, we formalize this problem and prove that it is strongly NP-hard. We introduce an optimization algorithm that is fast enough to be run online for dynamic and automatic offloading decisions, guarantees that the solution satisfies hard constraints regarding latency, data protection, and capacity, and achieves near-optimal costs. We also show how the algorithm can be extended to handle multiple edge data centers. Experiments show that the cost of the solution found by our algorithm is on average only 2.7\% higher than the optimum.},
	journal = {IEEE Transactions on Services Computing},
	author = {Mann, Zoltán Ádám and Metzger, Andreas and Prade, Johannes and Seidl, Robert and Pohl, Klaus},
	year = {2022},
	keywords = {Data centers, Cloud computing, Costs, Data protection, Connectors, Optimization, Heuristic algorithms, edge computing, fog computing, edge data center, offloading, resource optimization, data protection},
	pages = {1--1},
}

@inproceedings{mann_security-_2022,
	address = {Cham},
	title = {Security- and {Privacy}-{Aware} {IoT} {Application} {Placement} and {User} {Assignment}},
	isbn = {9783030954840},
	doi = {10.1007/978-3-030-95484-0_18},
	abstract = {Applications for the Internet of Things (IoT) may use, beyond the IoT devices themselves, also edge and cloud resources. Thus, the modules of an application can be placed on a variety of nodes with different capabilities in terms of security, trustworthiness, and capacity. Application modules may exist in multiple instances. This makes it possible to assign users to the most appropriate module instances, taking into account requirements on security, privacy, and latency. There is a non-trivial interplay between application placement decisions and user assignment decisions. For example, if a certain user is assigned to a module, then that module may not be allowed to be placed on nodes not trusted by the user. However, most existing research neglects this interplay and its implications on security and privacy. In this paper, we address the joint problem of application placement and user assignment. Beside capacity and latency constraints, we consider several types of security and privacy constraints: (i) module-level location constraints, (ii) user-level location constraints, (iii) co-location constraints, and (iv) k-anonymity constraints. We formalize the problem and develop an algorithm to solve it using quadratically constrained mixed integer programming. We demonstrate the applicability of the proposed approach by applying it to an IoT system in the smart home domain. Controlled experiments on problem instances of increasing size show that the algorithm can solve even large problem instances in acceptable time.},
	language = {en},
	booktitle = {Computer {Security}. {ESORICS} 2021 {International} {Workshops}},
	publisher = {Springer International Publishing},
	author = {Mann, Zoltán Ádám},
	editor = {Katsikas, Sokratis and Lambrinoudakis, Costas and Cuppens, Nora and Mylopoulos, John and Kalloniatis, Christos and Meng, Weizhi and Furnell, Steven and Pallas, Frank and Pohle, Jörg and Sasse, M. Angela and Abie, Habtamu and Ranise, Silvio and Verderame, Luca and Cambiaso, Enrico and Maestre Vidal, Jorge and Sotelo Monge, Marco Antonio},
	year = {2022},
	pages = {296--316},
}