Federico Heras

28 papers A* 6A 4B 2Misc 1Journal 9Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Impact of Extended Clauses on Local Search Solvers for Max-SAT. ICAART (3) Federico Heras
2023	—	`conf`	A Comparison of Enterprise Architecture Tools. ICSBT Federico Heras
2023	—	`conf`	Evolution and Comparative Analysis of Enterprise Architecture Tools. ICSBT (Revised Selected Papers) Federico Heras
2015	J	`jnl`	MaxSAT-based encodings for Group MaxSAT. AI Commun. Federico Heras, António Morgado, João Marques-Silva
2013	J	`jnl`	Incomplete inference for graph problems. Optim. Lett. Federico Heras, David Bañeres
2013	J	`jnl`	Iterative and core-guided MaxSAT solving: A survey and assessment. Constraints An Int. J. António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, João Marques-Silva
2013	B	`conf`	Model-Guided Approaches for MaxSAT Solving. ICTAI António Morgado, Federico Heras, João Marques-Silva
2013	A*	`conf`	On Computing Minimal Correction Subsets. IJCAI João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov
2012	—	`conf`	An Empirical Study of Encodings for Group MaxSAT. Canadian AI Federico Heras, António Morgado, João Marques-Silva
2012	A	`conf`	Improvements to Core-Guided Binary Search for MaxSAT. SAT António Morgado, Federico Heras, João Marques-Silva
2012	B	`conf`	Iterative SAT Solving for Minimum Satisfiability. ICTAI Federico Heras, António Morgado, Jordi Planes, João Marques-Silva
2012	—	`conf`	Lower Bounds and Upper Bounds for MaxSAT. LION Federico Heras, António Morgado, João Marques-Silva
2011	A*	`conf`	Core-Guided Binary Search Algorithms for Maximum Satisfiability. AAAI Federico Heras, António Morgado, João Marques-Silva
2011	A*	`conf`	Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms. IJCAI Federico Heras, João Marques-Silva
2010	—	`conf`	New Research Lines for Max-SAT - Exploiting the Recent Resolution Rule for Max-Sat. ICAART (1) Federico Heras
2010	J	`jnl`	The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers. J. Satisf. Boolean Model. Comput. Federico Heras, David Bañeres
2008	J	`jnl`	2006 and 2007 Max-SAT Evaluations: Contributed Instances. J. Satisf. Boolean Model. Comput. Federico Heras, Javier Larrosa, Simon de Givry, Thomas Schiex
2008	A	`conf`	A Max-SAT Inference-Based Pre-processing for Max-Clique. SAT Federico Heras, Javier Larrosa
2008	J	`jnl`	A logical approach to efficient Max-SAT solving. Artif. Intell. Javier Larrosa, Federico Heras, Simon de Givry
2008	J	`jnl`	MiniMaxSAT: An Efficient Weighted Max-SAT solver. J. Artif. Intell. Res. Federico Heras, Javier Larrosa, Albert Oliveras
2008	Misc	`conf`	On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization. FLAIRS Federico Heras, Vasco Manquinho, João Marques-Silva
2007	A	`conf`	MiniMaxSat: A New Weighted Max-SAT Solver. SAT Federico Heras, Javier Larrosa, Albert Oliveras
2006	J	`jnl`	A Logical Approach to Efficient Max-SAT solving CoRR Javier Larrosa, Federico Heras, Simon de Givry
2006	J	`jnl`	Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. J. Heuristics Federico Heras, Javier Larrosa
2006	A*	`conf`	New Inference Rules for Efficient Max-SAT Solving. AAAI Federico Heras, Javier Larrosa
2005	A*	`conf`	Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. IJCAI Simon de Givry, Federico Heras, Matthias Zytnicki, Javier Larrosa
2005	A	`conf`	Local Consistency in Weighted CSPs and Inference in Max-SAT. CP Federico Heras, Javier Larrosa
2005	A*	`conf`	Resolution in Max-SAT and its relation to local consistency in weighted CSPs. IJCAI Javier Larrosa, Federico Heras

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.