Carlo Traverso

30 papers B 12Journal 6Unranked 10
YearRankTypeTitle / Venue / Authors
2011 J jnl
J. Symb. Comput.
Massimo Caboara, Fabrizio Caruso, Carlo Traverso
2009 ch.
Gröbner Bases, Coding, and Cryptography
Françoise Levy-dit-Vehel, Maria Grazia Marinari, Ludovic Perret, Carlo Traverso
2009 book
Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret
2008 B conf
ISSAC
Massimo Caboara, Fabrizio Caruso, Carlo Traverso
2005 conf
Algorithmic Algebra and Logic
Pasqualina Conti, Carlo Traverso
2005 B conf
CASC
Laureano González-Vega, Carlo Traverso, Alberto Zanoni
2003 J jnl
J. Symb. Comput.
Elisabetta Fortuna, Patrizia M. Gianni, Paola Parenti, Carlo Traverso
2002 B conf
ISSAC
Elisabetta Fortuna, Patrizia M. Gianni, Paola Parenti, Carlo Traverso
2002 B conf
ISSAC
Carlo Traverso, Alberto Zanoni
2000 conf
Automated Deduction in Geometry
Pasqualina Conti, Carlo Traverso
2000 J jnl
SIGSAM Bull.
María José González-López, Laureano González-Vega, Carlo Traverso, Alberto Zanoni
2000 B ed.
ISSAC
Carlo Traverso
1998 B conf
ISSAC
Massimo Caboara, Carlo Traverso
1997 conf
AAECC
Massimo Caboara, Pasqualina Conti, Carlo Traverso
1996 J jnl
J. Symb. Comput.
Carlo Traverso
1996 J jnl
J. Symb. Comput.
Giuseppe Attardi, Carlo Traverso
1995 conf
AAECC
Pasqualina Conti, Carlo Traverso
1994 conf
PASCO
Giuseppe Attardi, Carlo Traverso
1994 B conf
ISSAC
Eberhard Becker, Teo Mora, Maria Grazia Marinari, Carlo Traverso
1993 conf
AAECC
Anna Maria Bigatti, Pasqualina Conti, Lorenzo Robbiano, Carlo Traverso
1992 B conf
ISSAC
H. Michael Möller, Teo Mora, Carlo Traverso
1991 B conf
ISSAC
Alessandro Giovini, Teo Mora, Gianfranco Niesi, Lorenzo Robbiano, Carlo Traverso
1991 conf
AAECC
Paola Cellini, Patrizia M. Gianni, Carlo Traverso
1991 conf
AAECC
Pasqualina Conti, Carlo Traverso
1991 J jnl
Discret. Appl. Math.
Pasqualina Conti, Carlo Traverso
1989 B conf
ISSAC
Carlo Traverso, L. Donati
1989 conf
Computers and Mathematics
André Galligo, Carlo Traverso
1988 B conf
ISSAC
André Galligo, Loic Pottier, Carlo Traverso
1988 B conf
ISSAC
Carlo Traverso
1987 conf
AAECC
Roberto Dvornicich, Carlo Traverso
redb/extractors/decompiler/bninja/similarity/minhashcustom.py
← Index redb/extractors/decompiler/bninja/similarity/minhashcustom.py python
import numpy as np
import mmh3

class MinHashCustom:
    """
    DTO for an actual MinHash
    <minhash>: a binary sequence of packed int8/32 values
    <minhash_int>: the equivalent representation of <minhash> but as list of int8/32
    """

    _HASH_MAX = 0xFFFFFFFF
    _MINHASH_BITS = 32

    def getSignatureEntrySize(self):
        return 1 if self.MINHASH_BITS <= 8 else 4

    def __init__(self, function_addr=None, minhash_bytes=None, minhash_signature=None, minhash_bits=32):
        self.minhash = b""
        self.minhash_int = []
        if minhash_bits:
            self._MINHASH_BITS = minhash_bits
        if minhash_bytes and minhash_signature:
            raise ValueError("Can use only one keyword argument")
        if minhash_bytes:
            if self._MINHASH_BITS <= 8:
                minhash_signature = np.frombuffer(minhash_bytes, dtype=np.uint8)
            else:
                minhash_signature = np.frombuffer(minhash_bytes, dtype=np.uint32)
            self.setMinHash(minhash_signature)
        elif minhash_signature:
            self.setMinHash(minhash_signature)

        self.shingler_composition = {}
        self.function_addr = function_addr

    def hasMinHash(self):
        return len(self.minhash) > 0

    def getMinHash(self):
        return self.minhash

    def getMinHashInt(self):
        return self.minhash_int

    def setMinHash(self, minhash_signature):
        self.minhash_int = [i % 2 ** self._MINHASH_BITS for i in minhash_signature]
        if self._MINHASH_BITS <= 8:
            self.minhash = np.array(self.minhash_int, dtype=np.uint8).tobytes()
        else:
            self.minhash = np.array(self.minhash_int, dtype=np.uint32).tobytes()

    def getComposition(self):
        return self.shingler_composition

    def scoreAgainst(self, other):
        return self.calculateMinHashScore(self.minhash, other.minhash, minhash_bits=self._MINHASH_BITS)

    @staticmethod
    def getHashMax():
        return MinHashCustom._HASH_MAX

    @staticmethod
    def hashData(data, seed) -> int:
        if isinstance(data, (str, bytes, bytearray)):
            return mmh3.hash(data, seed) & MinHashCustom._HASH_MAX
        elif isinstance(data, (list, tuple)):
            to_hash = "|".join(str(elem) for elem in data)
            return mmh3.hash(to_hash, seed) & MinHashCustom._HASH_MAX
        else:
            raise NotImplementedError(
                f"Type not supported for hashData: {type(data).__name__}"
            )

    @staticmethod
    def calculateMinHashScore(first, second, minhash_bits=32):
        if minhash_bits <= 8:
            first_np = np.frombuffer(first, dtype=np.uint8)
            second_np = np.frombuffer(second, dtype=np.uint8)
        else:
            first_np = np.frombuffer(first, dtype=np.uint32)
            second_np = np.frombuffer(second, dtype=np.uint32)
        return 100.0 * sum(first_np == second_np) / len(first_np)

    @staticmethod
    def calculateMinHashIntScore(first, second):
        score = 0
        num_hashes = len(first)
        if num_hashes:
            for index, part in enumerate(first):
                score += 1 if part == second[index] else 0
            return 100.0 * score / num_hashes
        return 0.0

    @property
    def MINHASH_BITS(self):
        return self._MINHASH_BITS