TY  - THES
A1  - Ashouri, Mohammadreza
T1  - TrainTrap
BT  - a hybrid technique for vulnerability analysis in JAVA
Y1  - 2020
ER  - 
TY  - JOUR
A1  - Luther, Laura
A1  - Tiberius, Victor
A1  - Brem, Alexander
T1  - User experience (UX) in business, management, and psychology
BT  - a bibliometric mapping of the current state of research
JF  - Multimodal technologies and interaction : open access journal
N2  - User Experience (UX) describes the holistic experience of a user before, during, and after interaction with a platform, product, or service. UX adds value and attraction to their sole functionality and is therefore highly relevant for firms. The increased interest in UX has produced a vast amount of scholarly research since 1983. The research field is, therefore, complex and scattered. Conducting a bibliometric analysis, we aim at structuring the field quantitatively and rather abstractly. We employed citation analyses, co-citation analyses, and content analyses to evaluate productivity and impact of extant research. We suggest that future research should focus more on business and management related topics.
KW  - bibliometric analysis
KW  - co-citation analysis
KW  - co-occurrence analysis
KW  - citation analysis
KW  - user experience
KW  - UX
Y1  - 2020
U6  - https://doi.org/10.3390/mti4020018
SN  - 2414-4088
VL  - 4
IS  - 2
PB  - MDPI
CY  - Basel
ER  - 
TY  - JOUR
A1  - Fandinno, Jorge
A1  - Lifschitz, Vladimir
A1  - Lühne, Patrick
A1  - Schaub, Torsten H.
T1  - Verifying tight logic programs with Anthem and Vampire
JF  - Theory and practice of logic programming
N2  - This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
Y1  - 2020
U6  - https://doi.org/10.1017/S1471068420000344
SN  - 1471-0684
SN  - 1475-3081
VL  - 20
IS  - 5
SP  - 735
EP  - 750
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  -