Adam Rogalewicz

35 papers A* 2A 7B 5C 1Journal 14Unranked 6
YearRankTypeTitle / Venue / Authors
2025 — conf
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration.
ESOP (2)
Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
2024 J jnl
Deciding Boolean Separation Logic via Small Models (Technical Report).
CoRR
Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
2024 — conf
Deciding Boolean Separation Logic via Small Models.
TACAS (1)
Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
2024 — conf
Efficient Manipulation of Control Flow Models in Evolving Software.
EUROCAST (1)
Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar
2023 A conf
Reasoning About Regular Properties: A Comparative Study.
CADE
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
2023 J jnl
Reasoning about Regular Properties: A Comparative Study.
CoRR
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
2023 J jnl
Sound One-Phase Shape Analysis with Biabduction.
CoRR
Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
2022 J jnl
Low-Level Bi-Abduction (Artifact).
Dagstuhl Artifacts Ser.
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022 A conf
Low-Level Bi-Abduction.
ECOOP
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022 J jnl
Low-Level Bi-Abduction.
CoRR
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
2022 A conf
Perun: Performance Version System.
ICSME
Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar
2022 J jnl
Perun: Performance Version System.
CoRR
Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar
2020 J jnl
Abstraction refinement and antichains for trace inclusion of infinite state systems.
Formal Methods Syst. Des.
Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2019 — conf
SL-COMP: Competition of Solvers for Separation Logic.
TACAS (3)
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
2018 B conf
From Shapes to Amortized Complexity.
VMCAI
Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger
2017 B conf
Counterexample Validation and Interpolation-Based Refinement for Forest Automata.
VMCAI
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar
2017 — conf
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution).
TACAS (2)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2016 A conf
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems.
TACAS
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2016 A conf
Run Forester, Run Backwards! - (Competition Contribution).
TACAS
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2015 A conf
Forester: Shape Analysis Using Tree Automata - (Competition Contribution).
TACAS
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2014 J jnl
Abstraction Refinement for Trace Inclusion of Data Automata.
CoRR
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2014 B conf
Deciding Entailments in Inductive Separation Logic with Tree Automata.
ATVA
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2014 J jnl
Deciding Entailments in Inductive Separation Logic with Tree Automata.
CoRR
Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2013 J jnl
Automata-Based Termination Proofs.
Comput. Informatics
Radu Iosif, Adam Rogalewicz
2013 J jnl
Fully Automated Shape Analysis Based on Forest Automata
CoRR
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2013 A* conf
Fully Automated Shape Analysis Based on Forest Automata.
CAV
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2013 J jnl
The Tree Width of Separation Logic with Recursive Definitions
CoRR
Radu Iosif, Adam Rogalewicz, Jirí Simácek
2013 A conf
The Tree Width of Separation Logic with Recursive Definitions.
CADE
Radu Iosif, Adam Rogalewicz, Jirí Simácek
2012 J jnl
Abstract regular (tree) model checking.
Int. J. Softw. Tools Technol. Transf.
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
2012 J jnl
Forest automata for verification of heap manipulation.
Formal Methods Syst. Des.
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2011 A* conf
Forest Automata for Verification of Heap Manipulation.
CAV
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2009 C conf
Automata-Based Termination Proofs.
CIAA
Radu Iosif, Adam Rogalewicz
2007 B conf
Proving Termination of Tree Manipulating Programs.
ATVA
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2006 B conf
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
SAS
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
2005 — conf
Abstract Regular Tree Model Checking.
INFINITY
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar