Search

Your search keyword '"Ábrahám, Erika"' showing total 666 results
Start Over Author "Ábrahám, Erika"

Refine your results

more »

more »

more »

more »
666 results on '"Ábrahám, Erika"'

201. Formal Techniques for Distributed Objects, Components, and Systems

Author

Ábrahám, Erika, Palamidessi, Catuscia, Rheinisch-Westfälische Technische Hochschule Aachen University (RWTH), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), TC 6, WG 6.1, Rheinisch-Westfälische Technische Hochschule Aachen (RWTH), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
[INFO]Computer Science [cs]
Abstract

International audience; Book Front Matter of LNCS 8461

Published
2014

202. Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)

Author

Ábrahám, Erika, Avritzer, Alberto, Remke, Anne, and Sanders, William H.

Subjects
000 Computer science, knowledge, general works, Computer Science
Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 14031 "Randomized Timed and Hybrid Models for Critical Infrastructures". Critical Infrastructures, such as power grid and water and gas distribution networks, are essential for the functioning of our society and economy. Randomized Timed and Hybrid Models appear as a natural choice for their modeling, and come with existing algorithms and tool support for their analysis. However, on the one hand, the Critical Infrastructures community does not yet make full use of recent advances for Randomized Timed and Hybrid Models. On the other hand, existing algorithms are not yet readily applicable to the special kind of problems arising in Critical Infrastructures. This seminar brought together researchers from these fields to communicate with each other and to exchange knowledge, experiences and needs.

Published
2014
Full Text
View/download PDF

203. Randomized Timed and Hybrid Models for Critical Infrastructures

Author

Ábrahám, Erika, Avritzer, Alberto, Remke, Anne, and Sanders, William H.

Abstract

Dagstuhl Seminar 14031 Randomized Timed and Hybrid Models for Critical Infrastructures, Dagstuhl, Germany, 12 Jan 2014 - 17 Jan 2014; Dagstuhl Reports 4(1), 37-82 (2014). doi:10.4230/DagRep.4.1.36, Published by Schloss Dagstuhl, Wadern

Published
2014
Full Text
View/download PDF

209. Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances

Author

Ábrahám, Erika, Palamidesi, Catuscia, Romero Hernandez, David, Frutos Escrig, David de, Ábrahám, Erika, Palamidesi, Catuscia, Romero Hernandez, David, and Frutos Escrig, David de

Abstract

Bisimulation captures in a coinductive way the quivalence between processes, or trees. Several authors have defined bisimulation distances based on the bisimulation game. However, this approach becomes too local: whenever we have in one of the compared processes a large collection of branches different from those of the other, only the farthest away is taken into account to define the distance. Alternatively, we have developed a more global approach to define these distances, based on the idea of how much we need to modify one of the compared processes to obtain the other. Our original definition only covered finite processes. Instead, now we present here a coinductive approach that extends our distance to infinite but finitary trees, without needing to consider any kind of approximation of infinite trees by their finite projections.

Published
2014

210. Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)

Author

Erika Ábrahám and Alberto Avritzer and Anne Remke and William H. Sanders, Ábrahám, Erika, Avritzer, Alberto, Remke, Anne, Sanders, William H., Erika Ábrahám and Alberto Avritzer and Anne Remke and William H. Sanders, Ábrahám, Erika, Avritzer, Alberto, Remke, Anne, and Sanders, William H.

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 14031 "Randomized Timed and Hybrid Models for Critical Infrastructures". Critical Infrastructures, such as power grid and water and gas distribution networks, are essential for the functioning of our society and economy. Randomized Timed and Hybrid Models appear as a natural choice for their modeling, and come with existing algorithms and tool support for their analysis. However, on the one hand, the Critical Infrastructures community does not yet make full use of recent advances for Randomized Timed and Hybrid Models. On the other hand, existing algorithms are not yet readily applicable to the special kind of problems arising in Critical Infrastructures. This seminar brought together researchers from these fields to communicate with each other and to exchange knowledge, experiences and needs.

Published
2014
Full Text
View/download PDF

211. APTE: An Algorithm for Proving Trace Equivalence

Author

Ábrahám, Erika, Havelund, Klaus, Cheval, Vincent, Ábrahám, Erika, Havelund, Klaus, and Cheval, Vincent

Abstract

This paper presents APTE, a new tool for automatically proving the security of cryptographic protocols. It focuses on proving trace equivalence between processes, which is crucial for specifying privacy type properties such as anonymity and unlinkability. The tool can handle protocols expressed in a calculus similar to the applied-pi calculus, which allows us to capture most existing protocols that rely on classical cryptographic primitives. In particular, APTE handles private channels and else branches in protocols with bounded number of sessions. Unlike most equivalence verifier tools, APTE is guaranteed to terminate Moreover, APTE is the only tool that extends the usual notion of trace equivalence by considering ``side-channel'' information leaked to the attacker such as the length of messages and the execution times. We illustrate APTE on different case studies which allowed us to automatically (re)-discover attacks on protocols such as the Private Authentication protocol or the protocols of the electronic passports.

Published
2014

212. Behavioral interface description of an object-oriented language with futures and promises

Author

Ábrahám, Erika, Grabe, Immo, Grüner, Andreas, and Steffen, Martin

Subjects
opensystems, concurrentobject-orientedlanguages, observablebehavior, formalsemantics, Creol, concurrency, futuresandpromises
Abstract

This paper formalizes the observable interface behavior of an concurrent, objectoriented language with futures and promises. The calculus captures the core of Creol, a language, featuring in particular asynchronous method calls and, since recently, first-class futures. The focus of the paper are open systems and we formally characterize their behavior in terms of interactions at the interface between the program and its environment. The behavior is given by transitions between typing judgments, where the absent environment is represented abstractly by an assumption context. A particular challenge is the safe treatment of promises: The erroneous situation that a promise is fulfilled twice, i.e., bound to code twice, is prevented by a resource aware type system, enforcing linear use of the write-permission to a promise. We show subject reduction and the soundness of the abstract interface description.

Published
2007

216. Observable interface behaviour and inheritance.

Author

ÁBRAHÁM, ERIKA, TRAN, THI MAI THUONG, and STEFFEN, MARTIN

Subjects
COMPUTER interfaces, SET theory, SEMANTICS, MATHEMATICAL models, MATHEMATICAL functions, MATHEMATICAL domains
Abstract

This paper formalizes the observable interface behaviour of open systems for a strongly-typed, concurrent object-oriented language with single-class inheritance. We formally characterize the observable behaviour in terms of interactions at the program-environment interface. The behaviour is given by transitions between contextual judgments, where the absent environment is represented abstractly as assumption context. A particular challenge is the fact that, when the system is considered as open, code from the environment can be inherited to the component and vice versa. This requires to incorporate an abstract version of the heap into the environment assumptions when characterizing the interface behaviour. We prove the soundness of the abstract interface description. [ABSTRACT FROM PUBLISHER]

Published
2016
Full Text
View/download PDF

217. On collaboratively conveying computer science to pupils

Author

Ábrahám, Erika, primary, Bergner, Nadine, additional, Brauner, Philipp, additional, Corzilius, Florian, additional, Jansen, Nils, additional, Leonhardt, Thiemo, additional, Loup, Ulrich, additional, Nellen, Johanna, additional, and Schroeder, Ulrik, additional

Published
2011
Full Text
View/download PDF

224. HIGH-LEVEL COUNTEREXAMPLES FOR PROBABILISTIC AUTOMATA.

Author

WIMMER, RALF, JANSEN, NILS, ÁBRAHÁM, ERIKA, and KATOEN, JOOST-PIETER

Subjects
PROBABILISTIC automata, SYSTEMS theory, COMMAND languages (Computer science), DEBUGGING, COMPUTER systems
Abstract

Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system's states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language like the one used by the popular model checker PRISM. In this paper we describe how a smallest possible subset of the commands can be identified which together make the system erroneous. We additionally show how the selected commands can be further simplified to obtain a well-understandable counterexample. [ABSTRACT FROM AUTHOR]

Published
2015
Full Text
View/download PDF

225. Parallel SAT Solving in Bounded Model Checking.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Rangan, C. Pandu, Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Brim, Luboš, Haverkort, Boudewijn, Leucker, Martin, Pol, Jaco, and Ábrahám, Erika

Abstract

Bounded Model Checking (BMC) is an incremental refutation technique to search for counterexamples of increasing length. The existence of a counterexample of a fixed length is expressed by a first-order logic formula that is checked for satisfiability using a suitable solver. We apply communicating parallel solvers to check satisfiability of the BMC formulae. In contrast to other parallel solving techniques, our method does not parallelize the satisfiability check of a single formula, but the parallel solvers work on formulae for different counterexample lengths. We adapt the method of constraint sharing and replication of Shtrichman, originally developed for sequential BMC, to the parallel setting. Since the learning mechanism is now parallelized, it is not obvious whether there is a benefit from the concepts of Shtrichman in the parallel setting. We demonstrate on a number of benchmarks that adequate communication between the parallel solvers yields the desired results. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

226. Heap-Abstraction for an Object-Oriented Calculus with Thread Classes.

Author

Beckmann, Arnold, Berger, Ulrich, Löwe, Benedikt, Tucker, John V., Ábrahám, Erika, Grüner, Andreas, and Steffen, Martin

Abstract

This paper formalizes an open semantics for a calculus featuring thread classes, where the environment, consisting in particular of an overapproximation of the heap topology, is abstractly represented. We extend our prior work not only by adding thread classes, but also in that thread names may be communicated, which means that the semantics needs to account explicitly for the possible acquaintance of objects with threads. We show soundness of the abstraction. Keywords: class-based oo languages, thread-based concurrency, open systems, formal semantics, heap abstraction, observable behavior. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

227. Abstract Interface Behavior of Object-Oriented Languages with Monitors.

Author

Gorrieri, Roberto, Wehrheim, Heike, Ábrahám, Erika, Grüner, Andreas, and Steffen, Martin

Abstract

We characterize the observable behavior of multi-threaded, object-oriented programs with re-entrant monitors. The observable uncertainty at the interface is captured by may- and must-approximations for potential resp. necessary lock ownership. The concepts are formalized in an object calculus. We show the soundness of the abstractions. Keywords: oo languages, formal semantics, thread-based concurrency, monitors, open systems, observable behavior. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

228. Observability, Connectivity, and Replay in a Sequential Calculus of Classes.

Author

Graf, Susanne, Roever, Willem-Paul, Ábrahám, Erika, Bonsangue, Marcello M., Boer, Frank S., Grüner, Andreas, and Steffen, Martin

Abstract

Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented languages is class-based. Considering classes as part of a component makes instantiation a possible interaction between component and environment. As a consequence, one needs to take connectivity information into account. We formulate an operational semantics that incorporates the connectivity information into the scoping mechanism of the calculus. Furthermore, we formalize a notion of equivalence on traces which captures the uncertainty of observation cause by the fact that the observer may fall into separate groups of objects. We use a corresponding trace semantics for full abstraction wrt. a simple notion of observability. This requires to capture the notion of determinism for traces where classes may be instantiated into more than one instance during a run and showing thus twice an equivalent behavior (doing a "replay"), a problem absent in an object-based setting. Keywords:class-based object-oriented languages, formal semantics, determinism, full abstraction. [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

229. Optimizing Bounded Model Checking for Linear Hybrid Systems.

Author

Cousot, Radhia, Ábrahám, Erika, Becker, Bernd, Klaedtke, Felix, and Steffen, Martin

Abstract

Bounded model checking (BMC) is an automatic verification method that is based on finitely unfolding the system's transition relation. BMC has been successfully applied, in particular, for discovering bugs in digital system design. Its success is based on the effectiveness of satisfiability solvers that are used to check for a finite unfolding whether a violating state is reachable. In this paper we improve the BMC approach for linear hybrid systems. Our improvements are tailored to lazy satisfiability solving and follow two complementary directions. First, we optimize the formula representation of the finite unfoldings of the transition relations of linear hybrid systems, and second, we accelerate the satisfiability checks by accumulating and generalizing data that is generated during earlier satisfiability checks. Experimental results show that the presented techniques accelerate the satisfiability checks significantly. [ABSTRACT FROM AUTHOR]

Published
2005

230. Object Connectivity and Full Abstraction for a Concurrent Calculus of Classes.

Author

Zhiming Liu, Araki, Keijiro, Ábrahám, Erika, Bonsangue, Marcello M., Boer, Frank S., and Steffen, Martin

Abstract

The concurrent object calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. The combination of this form of concurrency with objects corresponds to features known from the popular language Java. One distinctive feature, however, of the concurrent object calculus is that it is object-based, whereas the mainstream of object-oriented languages is class-based. This work explores the semantical consequences of introducing classes to the calculus. Considering classes as part of a component makes instantiation a possible interaction between component and environment. A striking consequence is that to characterize the observable behavior we must take connectivity information into account, i.e., the way objects may have knowledge of each other. In particular, unconnected environment objects can neither determine the absolute order of interaction and furthermore cannot exchange information to compare object identities. We formulate an operational semantics that incorporates the connectivity information into the scoping mechanism of the calculus. As instantiation itself is unobservable, objects are instantiated only when accessed for the first time ("lazy instantiation"). Furthermore we use a corresponding trace semantics for full abstraction wrt. a may-testing based notion of observability. Keywords: multithreading, class-based object-oriented languages, formal semantics, full abstraction. [ABSTRACT FROM AUTHOR]

Published
2005

231. Parallel SAT Solving in Bounded Model Checking.

Author

ÁBRAHÁM, ERIKA, SCHUBERT, TOBIAS, BECKER, BERND, FRÄNZLE, MARTIN, and HERDE, CHRISTIAN

Subjects
BOUNDARY value problems, MATHEMATICAL models, COUNTERFACTUALS (Logic), MATHEMATICAL formulas, MATHEMATICAL logic
Abstract

Bounded model checking (BMC) is an incremental refutation technique to search for counterexamples of increasing length. The existence of a counterexample of a fixed length is expressed by a first-order logic formula that is checked for satisfiability using a suitable solver. We apply communicating parallel solvers to check satisfiability of the BMC formulae. In contrast to other parallel solving techniques, our method does not parallelize the satisfiability check of a single formula, but the parallel solvers work on formulae for different counterexample lengths. We adapt the method of constraint sharing and replication of Shtrichman, originally developed for sequential BMC, to the parallel setting. Since the learning mechanism is now parallelized, it is not obvious whether there is a benefit from the concepts of Shtrichman in the parallel setting. We demonstrate on a number of benchmarks that adequate communication between the parallel solvers yields the desired results. [ABSTRACT FROM PUBLISHER]

Published
2011
Full Text
View/download PDF

232. A Deductive Proof System for Multithreaded Java with Exceptions.

Author

Ábrahám, Erika, De Roever, Willem-Paul, De Boer, Frank S., and Steffen, Martin

Subjects
*JAVA programming language, *PROGRAMMING languages, *COMPUTER programming, *COMPUTER algorithms, *SYSTEMS development
Abstract

Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. Besides that, the language offers a flexible exception mechanism for handling errors or exceptional program conditions. To reason about safety-properties of Java-programs and extending previous work on the proof theory for monitor synchronization, we introduce in this paper an assertional proof method for JavaMT ("Multi-Threaded Java"), a small concurrent sublanguage of Java, covering concurrency and especially exception handling. We show soundness and relative completeness of the proof method. [ABSTRACT FROM AUTHOR]

Published
2008

234. Towards Efficient Runtime Verified Linearizable Algorithms

Author

Rodríguez, Gilde Valeria, Castañeda, Armando, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

236. Distributed Monitoring of Timed Properties

Author

Henry, Léo, Jéron, Thierry, Markey, Nicolas, Roussanaly, Victor, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

237. Case Study: Runtime Safety Verification of Neural Network Controlled System

Author

Yang, Frank, Zhan, Sinong Simon, Wang, Yixuan, Huang, Chao, Zhu, Qi, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

238. Gaussian-Based and Outside-the-Box Runtime Monitoring Join Forces

Author

Hashemi, Vahid, Křetínský, Jan, Rieder, Sabine, Schön, Torsten, Vorhoff, Jan, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

239. TimelyMon: A Streaming Parallel First-Order Monitor

Author

Reese, Lennard, Silva, Rafael Castro G., Traytel, Dmitriy, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

240. The Complexity of Data-Free Nfer

Author

Kauffman, Sean, Guldstrand Larsen, Kim, Zimmermann, Martin, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

242. faRM-LTL: A Domain-Specific Architecture for Flexible and Accelerated Runtime Monitoring of LTL Properties

Author

Benny, Amrutha, Chandran, Sandeep, Kalayappan, Rajshekar, Phawade, Ramchandra, Kurur, Piyush P., Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

244. Sampling-Based and Gradient-Based Efficient Scenario Generation

Author

Kudalkar, Vidisha, Hashemi, Navid, Mukhopadhyay, Shilpa, Mallick, Swapnil, Budnik, Christof, Nagaraja, Parinitha, Deshmukh, Jyotirmoy V., Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

245. Adding State to Stream Runtime Verification

Author

Caldeira, Manuel, Kallwies, Hannes, Leucker, Martin, Thoma, Daniel, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

246. Efficient Offline Monitoring for Dynamic Metric Temporal Logic

Author

Mamouras, Konstantinos, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

247. Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption

Author

Waga, Masaki, Matsuoka, Kotaro, Suwa, Takashi, Matsumoto, Naoki, Banno, Ryotaro, Bian, Song, Suenaga, Kohei, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

248. Dynamic, Multi-objective Specification and Falsification of Autonomous CPS

Author

Chang, Kevin Kai-Chun, Xu, Kaifei, Kim, Edward, Sangiovanni-Vincentelli, Alberto, Seshia, Sanjit A., Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

249. Stream-Based Monitoring Under Measurement Noise

Author

Finkbeiner, Bernd, Fränzle, Martin, Kohn, Florian, Kröger, Paul, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ábrahám, Erika, editor, and Abbas, Houssam, editor

Published
2025
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results