Search

While the size and complexity of software are rapidly increasing, not only is the number of vulnerabilities increasing, but their forms are diversifying. Vulnerability has become an important factor in network attack and defense. Therefore, automatic vulnerability discovery has become critical to ensure software security. Fuzzing is one of the most important methods of vulnerability discovery. It is based on the initial input, i.e., a seed, to generate mutated test cases as new inputs of a tested program in the next execution loop. By monitoring the path coverage, fuzzing can choose high-value test cases for inclusion in the new seed set and capture crashes used for triggering vulnerabilities. Although there have been remarkable achievements in terms of the number of discovered vulnerabilities, the reduction of time cost is still inadequate. This paper proposes a fast directed greybox fuzzing model, FastAFLGo. A fast convergence formula of temperature is designed, and the energy scheduling scheme can quickly determine the best seed to make the program execute toward the target basic blocks. Experimental results show thatFastAFLGo can discover more vulnerabilities than the traditional fuzzing method in the same execution time. [ABSTRACT FROM AUTHOR]

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventies of the twentieth century by B. Zelinka and the first author (see e.g. [6] and the monograph [1] and the references therein). Since tolerances need not be transitive, their blocks may overlap and hence in general the set of all blocks of a tolerance cannot be converted into a quotient algebra in the same way as in the case of congruences. However, G. Czédli ([7]) showed that lattices can be factorized by means of tolerances in a natural way, and J. Grygiel and S. Radeleczki ([8]) proved some variant of an Isomorphism Theorem for tolerances on lattices. The aim of the present paper is to extend the concept of a tolerance on a lattice to posets in such a way that results similar to those obtained for tolerances on lattices can be derived. [ABSTRACT FROM AUTHOR]

In organ transplantation, there is a lack of ethical discussion about the recipient's right not to receive a transplant. Using the current situation of living organ transplantation and deceased organ transplantation in Japan as an example, we prospectively discussed to what extent the recipient's right not to receive a transplant is ethically acceptable. In directed transplantation from a living donor, a recipient may refuse organ donation from a particular donor. It is preferable that a recipient's request for organ donation from a donor occurs as part of a transparent process. In nondirected transplantation from a deceased donor, refusal of transplantation from a particular type of donor appears potentially justifiable. There are both moral and pragmatic considerations. Certain refusals based solely on belief are morally unacceptable, and refusal to transplant a recipient based on the donor's age jeopardizes the entire transplant system. When religious beliefs affect mental and physical health, individualized measures are required for transplant rejection. We also deductively developed a prospective argument based on the current status of donor–recipient communication in living organ transplantation in Japan and the 2010 amendment of the law allowing relatives to be given priority in organ transplantation from deceased donors. [ABSTRACT FROM AUTHOR]

Anti-elementarity is a strong way of ensuring that a class of structures, in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form ℒ ∞ λ . We prove that many naturally defined classes are anti-elementary, including the following: the class of all lattices of finitely generated convex ℓ -subgroups of members of any class of ℓ -groups containing all Archimedean ℓ -groups; the class of all semilattices of finitely generated ℓ -ideals of members of any nontrivial quasivariety of ℓ -groups; the class of all Stone duals of spectra of MV-algebras — this yields a negative solution to the MV-spectrum Problem; the class of all semilattices of finitely generated two-sided ideals of rings; the class of all semilattices of finitely generated submodules of modules; the class of all monoids encoding the nonstable K0-theory of von Neumann regular rings, respectively, C*-algebras of real rank zero; (assuming arbitrarily large Erdős cardinals) the class of all coordinatizable sectionally complemented modular lattices with a large 4 -frame. The main underlying principle is that under quite general conditions, for a functor Φ : 𝒜 → ℬ , if there exists a noncommutative diagram D → of 𝒜 , indexed by a common sort of poset called an almost join-semilattice, such that Φ D → I is a commutative diagram for every set I , Φ D → ≇ Φ X → for any commutative diagram X → in 𝒜 , then the range of Φ is anti-elementary. [ABSTRACT FROM AUTHOR]