Result for 399CAA1D62ABA9C4BED579E93F6D291D8BC84F72

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize48992
MD59AE11C2D22C4DE4775E8E525E5F5707C
SHA-1399CAA1D62ABA9C4BED579E93F6D291D8BC84F72
SHA-256684EC49320FC14B016B73991A61CC184FAC8525AF42DB655ED9BFAD139D43CCE
SSDEEP768:D0lql1XyPukCxpvJkMrRYZ5XQgl5nlX98mmOofWIXXgJgt:aeXyKzHWZZQS5nlt8mzIXN
TLSHT13323B586F950C759C6D42AFFFB49C78837279BA891EBB505CC140A306BCB5660F37942
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
MD592473BC6EC469C9253E3062C21DFB464
PackageArcharmv7hl
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-14FF96703BE7AA6FA7716A7DB83193916C76857AE
SHA-2561E1B1EDCE107A20B8B79DC6B3BE5E8941DCA45163C56E5BD4BAC413CA13B63E8