Speaker: Mihai Stancu
Abstract:
The security trend today is to stop security threats even before they
arrive on the target machine or system.
With that in mind we will explore, what packers are and what they do to
transform original malicious code in into something that is much harder to
confidently mark as a threat.
This talk will be focused on executables in the PE format running on the
Windows platform and during the presentation we will form a basic
understanding of the executable structure, packing technique, and other
anti-dumping and anti-debug techniques work to protect and run the original
payload.
Andrei Sipoș (TU Darmstadt & IMAR).
The goal of proof mining is to extract quantitative information out of proofs in mainstream mathematics which are not necessarily fully constructive. Often, such proofs make use of strong mathematical principles, but a preliminary analysis may show that they are not actually needed, so the proof may be carried out in a system of strength corresponding roughly to first-order arithmetic. Following a number of significant advances in this vein by Kohlenbach in 2011 and by Kohlenbach and Leuștean in 2012, we now tackle a long-standing open question: the quantitative analysis of the strong convergence of resolvents in classes of Banach spaces more general than Hilbert spaces.
This result was proven for the class of uniformly smooth Banach spaces by Reich in 1980. What we do is to analyze a proof given in 1990 by Morales, showing that adding the hypothesis of the space being uniformly convex, and thus still covering the case of L^p spaces, can serve to eliminate the strongest principles used in the proof by way of a modulus of convexity for the squared norm of such spaces. A further procedure of arithmetization brings the proof down to System T so the proper analysis may proceed. After obtaining a non-effective realizer of the metastability statement, this is majorized in order to obtain the desired rate. Subsequent considerations calibrate this bound to T_1. It particular, this result completes some analyses that had previously been obtained only partially, yielding rates of metastability within the above-considered class of Banach spaces for the Halpern and Bruck iterations.
These results are joint work with Ulrich Kohlenbach.
References:
Presenter: Traian Serbanuta.
This week we continue exploring Coq based on the Logical Foundations volume of Software Foundations, chapter “IMP: Simple Imperative Programs”
Presenter: Traian Serbanuta.
This week we continue exploring Coq based on the Logical Foundations volume of Software Foundations, chapter “IMP: Simple Imperative Programs”
Partea a doua a cursului “Topici speciale în logică și securitate” se tine în laboratorul 321.
Instructor: Elena Burceanu (Bitdefender)
Subiect: Introducere în metode de învățare automată pentru securitate
Materiale: informatii, cursuri,
notare
Speaker: Ciprian Păduraru
Abstract:
Even with access to the source code of a program, it is not easy to reverse engineer a program to find inputs for specific programs. This presentation starts with a practical walkthrough over classic methods for automating software testing, such as fuzz testing, symbolic and concolic execution. Then, a tool named RIVER is presented in its current state, together with the technical plans for improving it to achieve at least the same features set with similar tools such as KLEE. By using its reversible execution capabilities, and advanced tracing support, we think that by putting efforts in the implementation plan described in the presentation, we can obtain improved test coverage in relation to resources consumed. Research ideas for various parts including RIVER symbolic/concolic execution, tracers improvements, and combining these techniques with machine learning will be presented.
Speaker: Miriam Costan.
This week we continue exploring Coq based on the Logical Foundations volume of Software Foundations, chapter “Total and Partial Maps”
Se acordă două burse de merit în semestrele II, III și IV, în funcție de rezultatele din semestrul anterior. Condiții de acordare a burselor: studentul trebuie să fie integralist și să aibă media finală peste 9.00. Cuantumul burselor este de 2500 RON (500 RON/luna, timp de 5 luni).
Se acordă premii de cercetare studenților care fac practică de cercetare și obțin rezultate deosebite. Subiectele pot fi de teoretice sau aplicate, dar trebuie să aibă o componenta de cercetare, să reprezinte un punct de pornire pentru obținerea unor rezultate noi în domeniu. Subiectul de cercetare trebuie să fie relevant pentru domeniul masterului. Premiile vor avea un cuantum între 500 RON si 5000 RON, în funcție de: buget, numărul de concurenți, rezultatele obținute. Premiile vor fi acordate de o comisie, la sfârșitul semestrului în care s-a desfășurat activitatea. Pentru a aplica la premiu, studentii trebuie să trimită pe adresa sla@unibuc.ro un raport de activitate cuprinzător care să evidențieze subiectele studiate și rezultatele obținute.
Se acordă burse de cercetare cu un cuantum de 1000 RON pe luna, timp de 5 luni (un semestru), pentru desfășurarea activității de cercetare în semestrul respectiv. Pentru a aplica la o bursa de cercetare studenții trebuie sa își găsească un coordonator care să fie un cercetător cunoscut în domeniu și să trimită un proiect de cercetare pe adresa sla@unibuc.ro Bursele de cercetare se acorda numai studenților care nu sunt angajați sau sunt angajați cu maxim jumatate de norma. Bursierul trebuie să prezinte periodic evoluția proiectului, acordarea bursei putând să fie oprită dacă activitatea nu este satisfăcătoare. Aplicațiile pentru burse de cercetare în semestrele II (pentru anul I) si IV(pentru anul II) se primesc până la data de 17 Februarie 2020.
.
Speaker: Roberto Giuntini (University of Cagliari).
We investigate certain Brouwer-Zadeh lattices that serve as abstract counterparts of lattices of effects in Hilbert spaces under the spectral ordering. These algebras, called PBZ∗-lattices, can also be seen as generalisations of orthomodular lattices and are remarkable for the collapse of three notions of “sharpness” that are distinct in general Brouwer-Zadeh lattices. We investigate the structure theory of PBZ∗-lattices and their reducts; in particular, we prove some embedding results for PBZ∗-lattices and provide an initial description of the lattice of PBZ∗-varieties.
Speaker: Paul Irofti (University of Bucharest).
Machine learning helps us tackle large and apparently intractable optimization problems. Even though neural networks are by far the most popular choice in the field, we focus on dictionary learning (DL) for sparse representations (SR) instead. Our preference is motivated by the much simpler model that provides faster methods with a solid theoretical background, understanding and interpretability.
In fact it has been recently shown that the forward pass inside neural networks is equivalent to performing sparse representation. Thus performing dictionary learning can be interpreted as a backward pass on a much simpler and smaller model. This relaxation comes with a small performance hit in exchange for the large reduction in algorithm complexity.
Our talk will focus on adapting DL to Big Data conditions, DL classification and the problem of malware identification, nomaly detection, online DL and Internet of Things applications.
