Behavioral task
behavioral1
Sample
04e3d0af50cccdfa41aeeffe2694f650N.pdf
Resource
win7-20240729-en
Behavioral task
behavioral2
Sample
04e3d0af50cccdfa41aeeffe2694f650N.pdf
Resource
win10v2004-20240802-en
General
-
Target
04e3d0af50cccdfa41aeeffe2694f650N
-
Size
933KB
-
MD5
04e3d0af50cccdfa41aeeffe2694f650
-
SHA1
ed924532c27f1562b7a2eedfe684aeca08a4d409
-
SHA256
b5f2fb5fd1aebcf14b74057a79a6f02667a8e78fb2a529c8c16b2009a87b3a19
-
SHA512
ff2ad2441e9e984fe8c0475913a114b9e7958a9332b695fda3a48288c18a138508a51f99324462b61ed09887cc84c27c25a95f42cbb6d712e5b79e494b385bb7
-
SSDEEP
24576:xMxAA3vQ9Tx9TYP4WTn1Apa594tI9tEPiK3hgxyykdT4zeNVMg9972pwaDU:xMxhY9Tx9TYP4WTn1Apa594tI9tEPiKF
Malware Config
Signatures
Files
-
04e3d0af50cccdfa41aeeffe2694f650N.pdf
-
http://bitbucket.org/orosu/thesis-rascal,andcontainsapproximately400linesofcode
-
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.4999.[25]KevinLang,BarakPearlmutter,andRodneyPrice.ResultsoftheAbbadingoOneDFALearningCompetitionandaNewEvidence-DrivenStateMergingAlgorithm,1998.URLhttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.5084.[26]S.Crespi-Reghizzi,M.A.Melkano!,andL.Lichten.TheUseofGrammaticalInferenceforDesigningProgrammingLanguages.Commun.ACM,16,1973.URLhttp://doi.acm.org/10.1145/361952.361958.[27]StefanoCrespi-Reghizzi.ReductionofEnumerationinGrammarAcquisition.InProceedingsofthe2NdInternationalJointConferenceonArti�cialIntelligence,pages546�552.MorganKaufmannPublishersInc.,1971.URLhttp://dl.acm.org/citation.cfm?id=1622876.1622933.[28]JohnE.Hopcroft,RajeevMotwani,andJe!reyD.Ullman.IntroductiontoAu-tomataTheory,Languages,andComputation
-
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7234
-
http://dl.acm.org/citation.cfm?id=1314498.1314556.[19]AlexanderClark.DistributionalLearningofSomeContext-FreeLanguageswithaMinimallyAdequateTeacher.InJos�M.SempereandPedroGarc�a,editors,GrammaticalInference:TheoreticalResultsandApplications,volume6339,pages24�37.SpringerBerlinHeidelberg,2010.URLhttp://dx.doi.org/10.1007/978-3-642-15488-1_4.46
-
http://doi.acm.org/10.1145/1072997.1073000
-
http://doi.acm.org/10.1145/1953355.1953380.[11]DiptikalyanSaha.Gramin:AProgrammingLanguageGrammarInferenceSystem,2010.URLhttp://researcher.watson.ibm.com/researcher/files/in-diptsaha/gramin.pdf.[12]AlpanaDubey,PankajJalote,andSanjeevKumarAggarwal.InferringGram-marRulesofProgrammingLanguageDialects.InYasubumiSakakibara,SatoshiKobayashi,KengoSato,TetsuroNishino,andEtsujiTomita,editors,Grammati-calInference:AlgorithmsandApplications,volume4201,pages201�213.SpringerBerlinHeidelberg,2006.URLhttp://dx.doi.org/10.1007/11872436_17.[13]AlpanaDubey.GoodnessCriteriaforProgrammingLanguageGrammarRules.SIGPLANNot.,41:44�53,2006.URLhttp://doi.acm.org/10.1145/1229493.1229500.[14]A.Dubey,P.Jalote,andS.K.Aggarwal.Learningcontext-freegrammarrulesfromasetofprogram.Software,IET,2,2008.URLhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4543987.[15]OscarNierstrasz,MarkusKobel,TudorGirba,MicheleLanza,andHorstBunke.Example-DrivenReconstructionofSoftwareModels.InProceedingsofthe11thEuropeanConferenceonSoftwareMaintenanceandReengineering,pages275�286.IEEEComputerSociety,2007.URLhttp://dx.doi.org/10.1109/CSMR.2007.23.[16]MarkusKobel.ParsingbyExample.Diplomathesis,UniversityofBern,2005.URLhttp://scg.unibe.ch/archive/masters/Kobe05a.pdf.[17]DanaAngluin.LearningRegularSetsfromQueriesandCounterexamples.Inf.Comput.,75:87�106,1987.URLhttp://dx.doi.org/10.1016/0890-5401
-
http://doi.acm.org/10.1145/1968.1972
-
http://doi.acm.org/10.1145/1968.1972.8MingLiandPaulM.B.Vit�nyi.LearningSimpleConceptsUnderSimpleDistributions.SIAMJOURNALOFCOMPUTING,20:911�935,1991.URLhttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7234.9NoamChomsky.Threemodelsforthedescriptionoflanguage.IRETransactionsonInformationTheory,2:113�124,1956.URLhttp://www.chomsky.info/articles/195609--.pdf.45
-
http://dx.doi.org/10.1007/978-3-642-36089-3_12
-
http://dx.doi.org/10.1023/A:1022821128753
-
http://dx.doi.org/10.1023/A:1022821128753.7L.G.Valiant.ATheoryoftheLearnable.Commun.ACM,27
-
http://dx.doi.org/10.1109/MS.2001.922739
-
http://dx.doi.org/10.1109/MS.2001.922739.2PaulKlint,RalfL�mmel,andChrisVerhoef.TowardanEngineeringDisciplineforGrammarware.ACMTrans.Softw.Eng.Methodol.,14:331�380,2005.URLhttp://doi.acm.org/10.1145/1072997.1073000.3AndrewStevensonandJamesR.Cordy.GrammaticalInferenceinSoftwareEngineering:AnOverviewoftheStateoftheArt.InKrzysztofCzarneckiandG�relHedin,editors,SoftwareLanguageEngineering,volume7745,pages204�223.SpringerBerlinHeidelberg,2013.URLhttp://dx.doi.org/10.1007/978-3-642-36089-3_12.4EMarkGold.Languageidenti�cationintheLimit.InformationandControl,10
-
http://dx.doi.org/10.1162/153244304773936063.[31]M.A.Harrison.IntroductiontoFormalLanguageTheory.Addison-WesleyLong-manPublishingCo.,Inc.,1978.[32]JohnE.HopcroftandJe!reyD.Ullman.FormalLanguagesandTheirRelationtoAutomata.Addison-WesleyLongmanPublishingCo.,Inc.,1969.[33]MiguelBugalhoandArlindoL.Oliveira.InferenceofRegularLanguagesUsingStateMergingAlgorithmswithSearch.PatternRecogn.,38:1457�1467,2005.URLhttp://dx.doi.org/10.1016/j.patcog.2004.03.027.[34]Fran�oisCosteandJacquesNicolas.RegularInferenceasagraphcoloringprob-lem.InInWorkshoponGrammarInference,AutomataInduction,andLanguageAcquisition,pages9�7,1997.URLhttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4048.[35]ColindelaHiguera.GrammaticalInference:LearningAutomataandGrammars.CambridgeUniversityPress,2010.[36]AaronGorenstein.GreatAlgorithms:CYK,2013.URLhttp://pages.cs.wisc.edu/~agorenst/cyk.pdf.48
-
http://en.wikipedia.org/wiki/File:Chomsky-hierarchy.svg
-
http://www.chomsky.info/articles/195609--.pdf
-
http://www.sciencedirect.com/science/article/pii/002200008590056X.[21]ThomasA.Sudkamp.LanguagesandMachines:AnIntroductiontotheTheoryofComputerScience.Addison-WesleyLongmanPublishingCo.,Inc.,1997.[22]AlexanderClark,R�miEyraud,andAmauryHabrard.APolynomialAlgorithmfortheInferenceofContextFreeLanguages.InAlexanderClark,Fran�oisCoste,andLaurentMiclet,editors,GrammaticalInference:AlgorithmsandApplications,volume5278,pages29�42.SpringerBerlinHeidelberg,2008.URLhttp://dx.doi.org/10.1007/978-3-540-88009-7_3.[23]KevinJ.Lang.FasterAlgorithmsforFindingMinimalConsistentDFAs.Technicalreport,1999.URLhttp://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.7130.[24]ArlindoL.OliveiraandJoaoP.Marques-Silva.E
-
http://www.sciencedirect.com/science/article/pii/S0019995867911655
-
http://www.sciencedirect.com/science/article/pii/S0019995867911655.5DanaAngluin.InductiveInferenceofFormalLanguagesfromPositiveData.In-formationandControl,45
-
http://www.sciencedirect.com/science/article/pii/S0019995880902855
-
http://www.sciencedirect.com/science/article/pii/S0019995880902855.6DanaAngluin.QueriesandConceptLearning.Mach.Learn.,2
-
http://www.uva.nl/en/about-the-uva/organisation/faculties/content/faculteit-der-natuurwetenschappen-wiskunde-en-informatica/faculty-of-science.html
-
http://www.uva.nl/en/home
-
https://bitbucket.org/orosu/thesis-cpp
-
https://bitbucket.org/orosu/thesis-cpp,andcontainsapproximately1400linesofcodein7classes.Priortothis,wealsoimplementedExbaralgorithminRascalbutwedidnotcontinuewiththislanguageduetoperformanceconcerns.TheRascalsourcecodeisavailableathttps://[email protected]/orosu/thesis-rascal,andcontainsapproximately400linesofcodein5modules.Inordertovalidatethecorrectnessofthealgorithm,wemanuallycheckedtheresultsforthe�rstthreetrainingsets
-
https://bitbucket.org/orosu/thesis-cpp,andcontainsapproximately1500linesofcode
-
https://bitbucket.org/orosu/thesis-cpp,andcontainsapproximately2000linesofcodein12classes.Inordertovalidatethecorrectnessofthealgorithm,wemanuallycheckedtheresultsforthe�rstthreesamples
-
https://[email protected]/orosu/thesis-rascal
- Show all
-