Result for 04417EA19AEFA4C3CEC0DB2DC238E2179C42BFBA

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize73512
MD5D46FBAEDE56C5D2A6F4A101849D474DD
SHA-104417EA19AEFA4C3CEC0DB2DC238E2179C42BFBA
SHA-256F672D03FEFF6EE2FD69CA29BE857B76F9B7EF632DE97D88E6A4ABD4D52CF7153
SSDEEP1536:aBtmlhmv9oO1LcpCFjiTRruG2cOVm7TuIfOZ1lpxu:aBtmlhm1pYgxeRyG2cOVmdOZ/O
TLSHT1CA730B8DB663C677EA728CB40B45BA911C338119A0E7D572FF8D2B6E3432254BF46325
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5F9C8235187784074346CFAEF8C9E4F74
PackageArchi586
PackageDescriptionTranslate from Linear temporal logic (LTL) formulas to Buchi automata. LTL is a type of formal logic that extends formal logic with qualifiers involving time. A Buchi automaton is the extension of a finite state automaton to infinite inputs, and are useful for specifying behavior of non-terminating systems (such as hardware or operating systems). A Buchi automaton accepts an infinite input sequence if and only if there exists a run of the automaton which visits at least one of the final states infinitely often. The implementation is based on the translation algorithm by Gastin and Oddoux, presented at the CAV Conference, held in 2001, Paris, France 2001.
PackageMaintainermartinw <martinw>
PackageNameltl2ba
PackageRelease1.mga8
PackageVersion1.3
SHA-13C71C25B2C310BAC92B5C3094A49344E64D241FB
SHA-256C94CCC561FA25E8D3D8D670B3D86E3D1624B1288713C9149349A0118F4B20B36