Adam Rogalewicz

Orcid: 0000-0002-7911-0549

According to our database1, Adam Rogalewicz authored at least 25 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deciding Boolean Separation Logic via Small Models (Technical Report).
CoRR, 2024

Deciding Boolean Separation Logic via Small Models.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

2023
Sound One-Phase Shape Analysis with Biabduction.
CoRR, 2023

Reasoning About Regular Properties: A Comparative Study.
Proceedings of the Automated Deduction - CADE 29, 2023

2022
Low-Level Bi-Abduction (Artifact).
Dagstuhl Artifacts Ser., 2022

Perun: Performance Version System.
Proceedings of the IEEE International Conference on Software Maintenance and Evolution, 2022

Low-Level Bi-Abduction.
Proceedings of the 36th European Conference on Object-Oriented Programming, 2022

2020
Abstraction refinement and antichains for trace inclusion of infinite state systems.
Formal Methods Syst. Des., 2020

2019


2018
From Shapes to Amortized Complexity.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

2017
Counterexample Validation and Interpolation-Based Refinement for Forest Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Forester: From Heap Shapes to Automata Predicates - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Run Forester, Run Backwards! - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

2015
Forester: Shape Analysis Using Tree Automata - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

2014
Abstraction Refinement for Trace Inclusion of Data Automata.
CoRR, 2014

Deciding Entailments in Inductive Separation Logic with Tree Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Automata-Based Termination Proofs.
Comput. Informatics, 2013

Fully Automated Shape Analysis Based on Forest Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

The Tree Width of Separation Logic with Recursive Definitions.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
Abstract regular (tree) model checking.
Int. J. Softw. Tools Technol. Transf., 2012

Forest automata for verification of heap manipulation.
Formal Methods Syst. Des., 2012

2007
Proving Termination of Tree Manipulating Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
Proceedings of the Static Analysis, 13th International Symposium, 2006


  Loading...