Stefan Nagy, an assistant professor in the Kahlert School of Computing at University Utah, takes us on a tour recent research software fuzzing, or systematic testing programs via generation novel unexpected inputs. The first paper he discusses extends state art coverage-guided fuzzing with semantic notion "likely invariants," inferred techniques from property-based testing. second explores enco...

The paper deals with Ukrainian President’s Zelensky image in political cartoons and memes. They are forms of humour can be examined an interdisciplinary manner. first part describes theoretical aspects, functions, elements satire, main features types In the second part, corpus 198 1121 memes from March 2019 to December 2020 is analysed computer-aided content analysis multimodal discourse analys...

We des ribe eÆ ient onstru tions for various ryptographi primitives in private-key as well as publi -key ryptography. Our major results are two new onstru tions of pseudorandom fun tions. We prove the pseudo-randomness of one onstru tion under the assumption that fa toring (Blum integers) is hard while the other onstru tion is pseudo-random if the de isional version of the DiÆe-Hellman assumpti...

We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of categories, functors and natural transformations as well as a small set of proof tactics that automate proof search in this calculus. We demonstrate our approach by automating the proof that the functor categories Fun[C × D,E] and...

Even in thi s generality , it is clear that .!l' (I , ~) is a multiplicative se migroup with an ide ntity. The invariant I can be a scalar valued fun ction, e.g. , I (X) = det (X) ; or for that matter it can describe a property, e.g., m can equal M" (C) and I (X) can mean that X is unitary , so that we are simply asking for the s tructure of all linear transformation s T that map the unitary gr...