Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2019
Efficient and Precise Dynamic Construction of Control Flow Graphs
SBLP '19: Proceedings of the XXIII Brazilian Symposium on Programming LanguagesPages 19–26https://doi.org/10.1145/3355378.3355383The extraction of high-level information from binary code is an important problem in programming languages, whose solution supports the detection of malware in binary code and the construction of dynamic program slices. The Control Flow Graph is one of ...
- articleFebruary 2014
Efficient static checker for tainted variable attacks
Science of Computer Programming (SCPR), Volume 80Pages 91–105https://doi.org/10.1016/j.scico.2013.03.012Tainted flow attacks originate from program inputs maliciously crafted to exploit software vulnerabilities. These attacks are common in server-side scripting languages, such as PHP. In 1997, Orbaek and Palsberg formalized the problem of detecting these ...
- ArticleOctober 2013
SCGaz - A Synthetic Formal Context Generator with Density Control for Test and Evaluation of FCA Algorithms
SMC '13: Proceedings of the 2013 IEEE International Conference on Systems, Man, and CyberneticsPages 3464–3470https://doi.org/10.1109/SMC.2013.591An efficient way to evaluate FCA algorithms is through a comparative analysis of their performance in typical contexts. Comparisons are normally conducted using randomly generated contexts that may contain duplicated attributes and objects and other ...
- ArticleMarch 2011
Tainted flow analysis on e-SSA-form programs
Tainted flow attacks originate from program inputs maliciously crafted to exploit software vulnerabilities. These attacks are common in server-side scripting languages, such as PHP. In 1997, ørbæk and Palsberg formalized the problem of detecting these ...
- ArticleMay 2009
Evaluation of Different BDD Libraries to Extract Concepts in FCA --- Perspectives and Limitations
ICCS '09: Proceedings of the 9th International Conference on Computational Science: Part IPages 367–376https://doi.org/10.1007/978-3-642-01970-8_36This paper presents evaluation of different types of Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts and perform faster operations over different types ...
- ArticleMay 2009
Handling Large Formal Context Using BDD --- Perspectives and Limitations
ICFCA '09: Proceedings of the 7th International Conference on Formal Concept AnalysisPages 194–209https://doi.org/10.1007/978-3-642-01815-2_15This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main idea is to represent formal context using BDDs for later extraction of the ...