Doc. Mgr.

Adam Rogalewicz

Ph.D.

Docent

+420 54114 1188
rogalew@fit.vut.cz
kancelář A307

[photo]

Publikace

  • 2020

    HOLÍK Lukáš, IOSIF Radu, ROGALEWICZ Adam a VOJNAR Tomáš. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. Formal Methods in System Design, roč. 55, č. 3, s. 137-170. ISSN 0925-9856.
    Detail

  • 2018

    FIEDOR Tomáš, HOLÍK Lukáš, ROGALEWICZ Adam, SINN Moritz, VOJNAR Tomáš a ZULEGER Florian. From Shapes to Amortized Complexity. In: Proceedings of VMCAI'18. Lecture Notes in Computer Science, roč. 10145. Heidelberg: Springer Verlag, 2018, s. 205-225. ISBN 978-3-319-73720-1. ISSN 0302-9743.
    Detail

  • 2017

    HOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam a VOJNAR Tomáš. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In: Proceedings of VMCAI'17. Lecture Notes in Computer Science, roč. 10145. Cham: Springer Verlag, 2017, s. 288-309. ISBN 978-3-319-52234-0. ISSN 0302-9743.
    Detail

    HRUŠKA Martin, HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam a VOJNAR Tomáš. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Fakulta informačních technologií VUT v Brně, 2017.
    Detail

    HRUŠKA Martin, HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forester: From Heap Shapes to Automata Predicates. In: Proceedings of TACAS'17. Lecture Notes in Computer Science, roč. 10206. Heidelberg: Springer Verlag, 2017, s. 365-369. ISBN 978-3-662-54580-5.
    Detail

  • 2016

    IOSIF Radu, ROGALEWICZ Adam a VOJNAR Tomáš. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. In: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, roč. 9636. Heidelberg: Springer Verlag, 2016, s. 71-89. ISBN 978-3-662-49673-2.
    Detail

    HOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Run Forester, Run Backwards! (Competition Contribution). In: Proceedings of TACAS'16. Lecture Notes in Computer Science, roč. 9636. Heidelberg: Springer Verlag, 2016, s. 923-926. ISBN 978-3-662-49673-2.
    Detail

    ROGALEWICZ Adam. Symbolic Representations of Dynamic Data Structures in Program Analysis. Brno, 2016.
    Detail

    HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, SEKANINA Lukáš, VAŠÍČEK Zdeněk a VOJNAR Tomáš. Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology. In: 2nd Workshop on Approximate Computing (WAPCO 2016). Prague, 2016, s. 1-6.
    Detail

  • 2015

    HOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In: Proceedings of TACAS'15. Lecture Notes in Computer Science, roč. 9035. Heidelberg: Springer Verlag, 2015, s. 432-435. ISBN 978-3-662-46680-3.
    Detail

  • 2014

    IOSIF Radu, ROGALEWICZ Adam a VOJNAR Tomáš. Deciding Entailments in Inductive Separation Logic with Tree Automata. In: Proceedings of ATVA'14. Lecture Notes in Computer Science, roč. 8837. Heidelberg: Springer Verlag, 2014, s. 201-218. ISBN 978-3-319-11935-9.
    Detail

  • 2013

    IOSIF Radu a ROGALEWICZ Adam. Automata-Based Termination Proofs. Computing and Informatics, roč. 2013, č. 4, s. 739-775. ISSN 1335-9150.
    Detail

    HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Fully Automated Shape Analysis Based on Forest Automata. FIT-TR-2013-01, Brno: Fakulta informačních technologií VUT v Brně, 2013.
    Detail

    HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Fully Automated Shape Analysis Based on Forest Automata. In: Proceedings of CAV'13. Heidelberg: Springer Verlag, 2013, s. 740-755. ISBN 978-3-642-39798-1. ISSN 0302-9743.
    Detail

    IOSIF Radu, ROGALEWICZ Adam a ŠIMÁČEK Jiří. The Tree Width of Separation Logic with Recursive Definitions. In: Automated Deduction - CADE-24. Lecture Notes in Artificial Intelligence, roč. 2013. Berlin: Springer Verlag, 2013, s. 21-38. ISBN 978-3-642-38573-5. ISSN 0302-9743.
    Detail

    IOSIF Radu, ROGALEWICZ Adam a ŠIMÁČEK Jiří. The Tree Width of Separation Logic with Recursive Definitions. arXiv:1301.5139, 2013.
    Detail

  • 2012

    BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam a VOJNAR Tomáš. Abstract Regular (Tree) Model Checking. International Journal on Software Tools for Technology Transfer, roč. 14, č. 2, s. 167-191. ISSN 1433-2779.
    Detail

    HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Formal Methods in System Design, roč. 2012, č. 41, s. 83-106. ISSN 0925-9856.
    Detail

  • 2011

    HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Lecture Notes in Computer Science, roč. 2011, č. 6806, s. 424-440. ISSN 0302-9743.
    Detail

    HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. FIT-TR-2011-01, Brno: Fakulta informačních technologií VUT v Brně, 2011.
    Detail

  • 2009

    IOSIF Radu a ROGALEWICZ Adam. Automata-Based Termination Proofs. In: Implementation and Application of Automata. Lecture Notes in Computer Science, roč. 5642. Berlin: Springer Verlag, 2009, s. 165-177. ISBN 978-3-642-02978-3.
    Detail

  • 2008

    VOJNAR Tomáš, ČEŠKA Milan, ROGALEWICZ Adam, ERLEBACH Pavel, HOLÍK Lukáš, BOUAJJANI Ahmed, HABERMEHL Peter, TOUILI Tayssir a MORO Pierre. Automatická verifikace programů s dynamickými datovými strukturami. Inovační podnikání & transfer technologií, roč. 2008, č. 1, s. 21-22. ISSN 1210-4612.
    Detail

  • 2007

    HOLÍK Lukáš a ROGALEWICZ Adam. Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007, s. 59-66. ISBN 978-80-7355-077-6.
    Detail

    HABERMEHL Peter, IOSIF Radu, ROGALEWICZ Adam a VOJNAR Tomáš. Proving Termination of Tree Manipulating Programs. In: Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, roč. 4762. Berlin: Springer Verlag, 2007, s. 145-161. ISBN 978-3-540-75595-1.
    Detail

    ROGALEWICZ Adam. Verification of Programs with Complex Data Structures. Brno, 2007. ISBN 978-80-214-3548-3.
    Detail

  • 2006

    ROGALEWICZ Adam. Abstract Regular Model Checking of Complex Dynamic Data Structures - Implementation Details. In: Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Fakulta informačních technologií VUT v Brně, 2006, s. 198-205. ISBN 80-214-3287-X.
    Detail

    BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam a VOJNAR Tomáš. Abstract Regular Tree Model Checking. Electronic Notes in Theoretical Computer Science, roč. 149, č. 1, s. 37-48. ISSN 1571-0661.
    Detail

    BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam a VOJNAR Tomáš. Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In: Static Analysis. Lecture Notes in Computer Science, roč. 4134. Berlin: Springer Verlag, 2006, s. 52-70. ISBN 978-3-540-37756-6.
    Detail

  • 2005

    BOUAJJANI Ahmed, HABERMEHL Peter, ROGALEWICZ Adam a VOJNAR Tomáš. Abstract Regular Tree Model Checking. In: Proceedings of 7th International Workshop on Verification of Infinite-State Systems -- INFINITY 2005. Aarhus: Basic Research in Computer Science, Computer Science Departments of the Aarlborg and Aarhus Universities, 2005, s. 15-24. ISSN 0909-3206.
    Detail

    ROGALEWICZ Adam. Towards Applying Mona in Abstract Regular Tree Model Checking. In: Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2005, s. 663-667. ISBN 80-214-2890-2.
    Detail

  • 2004

    ROGALEWICZ Adam a VOJNAR Tomáš. Tree Automata In Modelling And Verification Of Concurrent Programs. In: Proceedings of ASIS 2004. Ostrava: MARQ, 2004, s. 197-202. ISBN 80-86840-03-4.
    Detail

Nahoru