default search action
Adam Rogalewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Tomás Dacík
, Adam Rogalewicz
Deciding Boolean Separation Logic via Small Models. TACAS (1) 2024: 188-206 - [i9]Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger:
Deciding Boolean Separation Logic via Small Models (Technical Report). CoRR abs/2403.18999 (2024) - 2023
- [c18]Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc
Reasoning About Regular Properties: A Comparative Study. CADE 2023: 286-306 - [i8]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 abs/2304.05064 (2023) - [i7]Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger:
Sound One-Phase Shape Analysis with Biabduction. CoRR abs/2307.06346 (2023) - 2022
- [j5]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): 11:1-11:6 (2022) - [c17]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. ECOOP 2022: 19:1-19:30 - [c16]Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar:
Perun: Performance Version System. ICSME 2022: 499-503 - [i6]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. CoRR abs/2205.02590 (2022) - [i5]Tomás Fiedor, Jirí Pavela, Adam Rogalewicz, Tomás Vojnar:
Perun: Performance Version System. CoRR abs/2207.12900 (2022) - 2020
- [j4]Lukás Holík
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55(3): 137-170 (2020)
2010 – 2019
- 2019
- [c15]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [d1]Ondrej Lengál
Forester Virtual Machine. Zenodo, 2019 - 2018
- [c14]Tomás Fiedor, Lukás Holík
From Shapes to Amortized Complexity. VMCAI 2018: 205-225 - 2017
- [c13]Lukás Holík
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) 2017: 365-369 - [c12]Lukás Holík
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI 2017: 288-309 - 2016
- [c11]Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. TACAS 2016: 71-89 - [c10]Lukás Holík
Run Forester, Run Backwards! - (Competition Contribution). TACAS 2016: 923-926 - 2015
- [c9]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: 432-435 - 2014
- [c8]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. ATVA 2014: 201-218 - [i4]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. CoRR abs/1402.2127 (2014) - [i3]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction Refinement for Trace Inclusion of Data Automata. CoRR abs/1410.5056 (2014) - 2013
- [j3]Radu Iosif, Adam Rogalewicz:
Automata-Based Termination Proofs. Comput. Informatics 32(4): 739-775 (2013) - [c7]Radu Iosif, Adam Rogalewicz, Jirí Simácek:
The Tree Width of Separation Logic with Recursive Definitions. CADE 2013: 21-38 - [c6]Lukás Holík
Fully Automated Shape Analysis Based on Forest Automata. CAV 2013: 740-755 - [i2]Radu Iosif, Adam Rogalewicz, Jirí Simácek:
The Tree Width of Separation Logic with Recursive Definitions. CoRR abs/1301.5139 (2013) - [i1]Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Fully Automated Shape Analysis Based on Forest Automata. CoRR abs/1304.5806 (2013) - 2012
- [j2]Peter Habermehl, Lukás Holík
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41(1): 83-106 (2012) - [j1]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. 14(2): 167-191 (2012) - 2011
- [c5]Peter Habermehl, Lukás Holík
Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440
2000 – 2009
- 2009
- [c4]Radu Iosif, Adam Rogalewicz:
Automata-Based Termination Proofs. CIAA 2009: 165-177 - 2007
- [c3]Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161 - 2006
- [c2]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar:
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS 2006: 52-70 - 2005
- [c1]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking. INFINITY 2005: 37-48
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: