Emanuel Kieronski

61 papers A* 9A 1B 15Journal 25Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic. Log. Methods Comput. Sci. Oskar Fiuk, Emanuel Kieronski
2025	—	`conf`	Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Abstract). DL Bartosz Bednarczyk, Emanuel Kieronski
2025	J	`jnl`	Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version). CoRR Bartosz Bednarczyk, Emanuel Kieronski
2025	A*	`conf`	Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards. KR Bartosz Bednarczyk, Emanuel Kieronski
2025	A*	`conf`	Two-Variable Logic for Hierarchically Partitioned and Ordered Data. KR Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2025	J	`jnl`	Two-Variable Logic for Hierarchically Partitioned and Ordered Data. CoRR Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2024	J	`jnl`	Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic. CoRR Oskar Fiuk, Emanuel Kieronski
2024	—	`conf`	On the Complexity of Maslov's Class K (Extended Abstract). Description Logics Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2024	A*	`conf`	On the complexity of Maslov's class K. LICS Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2024	J	`jnl`	On the complexity of Maslov's class K. CoRR Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2023	—	`conf`	A Uniform One-Dimensional Fragment with Alternation of Quantifiers. GandALF Emanuel Kieronski
2023	B	`conf`	An excursion to the border of decidability: between two- and three-variable logic. LPAR Oskar Fiuk, Emanuel Kieronski
2022	A*	`conf`	Finite Entailment of Local Queries in the Z Family of Description Logics. AAAI Bartosz Bednarczyk, Emanuel Kieronski
2022	J	`jnl`	One-dimensional fragment over words and trees. J. Log. Comput. Emanuel Kieronski, Antti Kuusisto
2021	J	`jnl`	Completing the Picture: Complexity of Graded Modal Logics with Converse. Theory Pract. Log. Program. Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2021	—	`conf`	Finite Model Theory of the Triguarded Fragment and Related Logics (Extended Abstract). Description Logics Emanuel Kieronski, Sebastian Rudolph
2021	A*	`conf`	Finite Model Theory of the Triguarded Fragment and Related Logics. LICS Emanuel Kieronski, Sebastian Rudolph
2021	J	`jnl`	Finite Model Theory of the Triguarded Fragment and Related Logics. CoRR Emanuel Kieronski, Sebastian Rudolph
2021	—	`conf`	Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract). Description Logics Bartosz Bednarczyk, Emanuel Kieronski
2021	J	`jnl`	One-Dimensional Fragment over Words and Trees. CoRR Emanuel Kieronski, Antti Kuusisto
2020	B	`conf`	The Triguarded Fragment with Transitivity. LPAR Emanuel Kieronski, Adam Malinowski
2019	—	`conf`	Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract). Description Logics Daniel Danielski, Emanuel Kieronski
2019	B	`conf`	Finite Satisfiability of Unary Negation Fragment with Transitivity. MFCS Daniel Danielski, Emanuel Kieronski
2019	B	`conf`	On the Complexity of Graded Modal Logics with Converse. JELIA Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2019	B	`conf`	One-Dimensional Guarded Fragments. MFCS Emanuel Kieronski
2019	J	`jnl`	One-dimensional guarded fragments. CoRR Emanuel Kieronski
2018	J	`jnl`	Finite Satisfiability of Unary Negation Fragment with Transitivity. CoRR Daniel Danielski, Emanuel Kieronski
2018	J	`jnl`	Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. ACM Trans. Comput. Log. Emanuel Kieronski, Lidia Tendera
2018	J	`jnl`	On the Complexity of Graded Modal Logics with Converse. CoRR Bartosz Bednarczyk, Emanuel Kieronski, Piotr Witkowski
2018	J	`jnl`	Two-variable logics with counting and semantic constraints. ACM SIGLOG News Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
2018	A*	`conf`	Unary negation fragment with equivalence relations has the finite model property. LICS Daniel Danielski, Emanuel Kieronski
2018	J	`jnl`	Unary negation fragment with equivalence relations has the finite model property. CoRR Daniel Danielski, Emanuel Kieronski
2017	J	`jnl`	Equivalence closure in the two-variable guarded fragment. J. Log. Comput. Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
2017	B	`conf`	Extending Two-Variable Logic on Trees. CSL Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
2017	B	`conf`	One-Dimensional Logic over Trees. MFCS Emanuel Kieronski, Antti Kuusisto
2016	J	`jnl`	Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2016	J	`jnl`	Extending Two-Variable Logic on Trees. CoRR Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
2016	J	`jnl`	Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. CoRR Emanuel Kieronski, Lidia Tendera
2016	B	`conf`	One-Dimensional Logic over Words. CSL Emanuel Kieronski
2015	J	`jnl`	On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. Jakub Michaliszyn, Jan Otop, Emanuel Kieronski
2015	B	`conf`	Uniform One-Dimensional Fragments with One Equivalence Relation. CSL Emanuel Kieronski, Antti Kuusisto
2014	—	`conf`	Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. MFCS (1) Emanuel Kieronski, Antti Kuusisto
2014	J	`jnl`	Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. CoRR Emanuel Kieronski, Antti Kuusisto
2014	—	`conf`	Decidability of weak logics with deterministic transitive closure. CSL-LICS Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
2014	J	`jnl`	Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
2013	—	`conf`	Complexity of Two-Variable Logic on Finite Trees. ICALP (2) Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2013	J	`jnl`	Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees CoRR Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
2012	B	`conf`	Finite Satisfiability of Modal Logic over Horn~Definable Classes of Frames. Advances in Modal Logic Jakub Michaliszyn, Emanuel Kieronski
2012	J	`jnl`	Small substructures and decidability issues for first-order logic with two variables. J. Symb. Log. Emanuel Kieronski, Martin Otto
2012	A*	`conf`	Two-Variable First-Order Logic with Equivalence Closure. LICS Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
2012	B	`conf`	Two-Variable Universal Logic with Transitive Closure. CSL Emanuel Kieronski, Jakub Michaliszyn
2011	B	`conf`	Decidability Issues for Two-Variable Logics with Several Linear Orders. CSL Emanuel Kieronski
2011	—	`conf`	Modal Logics Definable by Universal Three-Variable Formulas. FSTTCS Emanuel Kieronski, Jakub Michaliszyn, Jan Otop
2010	—	`conf`	B and D Are Enough to Make the Halpern-Shoham Logic Undecidable. ICALP (2) Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kieronski
2009	A*	`conf`	On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. LICS Emanuel Kieronski, Lidia Tendera
2007	B	`conf`	On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. LPAR Emanuel Kieronski, Lidia Tendera
2006	J	`jnl`	On the complexity of the two-variable guarded fragment with transitive guards. Inf. Comput. Emanuel Kieronski
2005	B	`conf`	Results on the Guarded Fragment with Equivalence or Transitive Relations. CSL Emanuel Kieronski
2005	A*	`conf`	Small Substructures and Decidability Issues for First-Order Logic with Two Variables. LICS Emanuel Kieronski, Martin Otto
2003	B	`conf`	The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard. FoSSaCS Emanuel Kieronski
2002	A	`conf`	EXPSPACE-Complete Variant of Guarded Fragment with Transitivity. STACS Emanuel Kieronski

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.