Adam Rogalewicz

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 17

Top Topics

Abductive Reasoning

Finite Automaton

Top Venues

Dagstuhl Artifacts Ser.

Publications

Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Deciding Boolean Separation Logic via Small Models (Technical Report). CoRR (2024)
Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Deciding Boolean Separation Logic via Small Models. TACAS (1) (2024)
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
Reasoning about Regular Properties: A Comparative Study. CoRR (2023)
Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Sound One-Phase Shape Analysis with Biabduction. CoRR (2023)
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
Reasoning About Regular Properties: A Comparative Study. CADE (2023)
Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar
Perun: Performance Version System. ICSME (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. ECOOP (2022)
Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar
Perun: Performance Version System. CoRR (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. CoRR (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction (Artifact). Dagstuhl Artifacts Ser. 8 (2) (2022)
Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55 (3) (2020)
Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) (2019)
Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger
From Shapes to Amortized Complexity. VMCAI (2018)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI (2017)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) (2017)
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. TACAS (2016)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Run Forester, Run Backwards! - (Competition Contribution). TACAS (2016)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: Shape Analysis Using Tree Automata - (Competition Contribution). TACAS (2015)
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Deciding Entailments in Inductive Separation Logic with Tree Automata. ATVA (2014)
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Abstraction Refinement for Trace Inclusion of Data Automata. CoRR (2014)
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Deciding Entailments in Inductive Separation Logic with Tree Automata. CoRR (2014)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata CoRR (2013)
Radu Iosif, Adam Rogalewicz, Jirí Simácek
The Tree Width of Separation Logic with Recursive Definitions CoRR (2013)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata. CAV (2013)
Radu Iosif, Adam Rogalewicz
Automata-Based Termination Proofs. Comput. Informatics 32 (4) (2013)
Radu Iosif, Adam Rogalewicz, Jirí Simácek
The Tree Width of Separation Logic with Recursive Definitions. CADE (2013)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. 14 (2) (2012)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41 (1) (2012)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest Automata for Verification of Heap Manipulation. CAV (2011)
Radu Iosif, Adam Rogalewicz
Automata-Based Termination Proofs. CIAA (2009)
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Proving Termination of Tree Manipulating Programs. ATVA (2007)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS (2006)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking. INFINITY (2005)