doc. Mgr.

Adam Rogalewicz

Ph.D.

FIT, UITS – docent

+420 54114 1188
rogalew@fit.vutbr.cz

Odeslat VUT zprávu

doc. Mgr. Adam Rogalewicz, Ph.D.

Publikace

  • 2020

    HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. FORMAL METHODS IN SYSTEM DESIGN, 2020, roč. 55, č. 3, s. 137-170. ISSN: 0925-9856.
    Detail | WWW

  • 2018

    FIEDOR, T.; HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; SINN, M.; ZULEGER, F. From Shapes to Amortized Complexity. In Proceedings of VMCAI'18. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2018. s. 205-225. ISBN: 978-3-319-73720-1. ISSN: 0302-9743.
    Detail | WWW

  • 2017

    HOLÍK, L.; HRUŠKA, M.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In Proceedings of VMCAI'17. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Cham: Springer Verlag, 2017. s. 288-309. ISBN: 978-3-319-52234-0. ISSN: 0302-9743.
    Detail | WWW

    HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Faculty of Information Technology BUT, 2017. s. 1-23.
    Detail

    HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T. Forester: From Heap Shapes to Automata Predicates. In Proceedings of TACAS'17. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2017. s. 365-369. ISBN: 978-3-662-54580-5.
    Detail | WWW

  • 2016

    HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Run Forester, Run Backwards! (Competition Contribution). In Proceedings of TACAS'16. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2016. s. 923-926. ISBN: 978-3-662-49673-2.
    Detail | WWW

    HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; SEKANINA, L.; VAŠÍČEK, Z.; VOJNAR, T. Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology. In 2nd Workshop on Approximate Computing (WAPCO 2016). Prague: 2016. s. 1-6.
    Detail | WWW

    ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R. 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. Heidelberg: Springer Verlag, 2016. s. 71-89. ISBN: 978-3-662-49673-2.
    Detail | WWW

    ROGALEWICZ, A. Symbolic Representations of Dynamic Data Structures in Program Analysis. Brno: 2016. s. 0-0.
    Detail | WWW

  • 2015

    HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In Proceedings of TACAS'15. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2015. s. 432-435. ISBN: 978-3-662-46680-3.
    Detail | WWW

  • 2014

    ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R. Deciding Entailments in Inductive Separation Logic with Tree Automata. In Proceedings of ATVA'14. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2014. s. 201-218. ISBN: 978-3-319-11935-9.
    Detail | WWW

  • 2013

    HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T. Fully Automated Shape Analysis Based on Forest Automata. In Proceedings of CAV'13. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2013. s. 740-755. ISBN: 978-3-642-39798-1. ISSN: 0302-9743.
    Detail

    ROGALEWICZ, A.; IOSIF, R. Automata-Based Termination Proofs. Computing and Informatics, 2013, roč. 2013, č. 4, s. 739-775. ISSN: 1335-9150.
    Detail | WWW

    ROGALEWICZ, A.; ŠIMÁČEK, J.; IOSIF, R. The Tree Width of Separation Logic with Recursive Definitions. In Automated Deduction - CADE-24. Lecture Notes in Computer Science. Lecture Notes in Artificial Intelligence. Berlin: Springer Verlag, 2013. s. 21-38. ISBN: 978-3-642-38573-5. ISSN: 0302-9743.
    Detail | WWW

  • 2012

    ROGALEWICZ, A.; VOJNAR, T.; HABERMEHL, P.; BOUAJJANI, A. Abstract Regular (Tree) Model Checking. International Journal on Software Tools for Technology Transfer, 2012, roč. 14, č. 2, s. 167-191. ISSN: 1433-2779.
    Detail | WWW

    HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P. Forest Automata for Verification of Heap Manipulation. FORMAL METHODS IN SYSTEM DESIGN, 2012, roč. 2012, č. 41, s. 83-106. ISSN: 0925-9856.
    Detail | WWW

  • 2011

    HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P. Forest Automata for Verification of Heap Manipulation. Lecture Notes in Computer Science, 2011, roč. 2011, č. 6806, s. 424-440. ISSN: 0302-9743.
    Detail | WWW

  • 2009

    IOSIF, R.; ROGALEWICZ, A. Automata-Based Termination Proofs. In Implementation and Application of Automata. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2009. s. 165-177. ISBN: 978-3-642-02978-3.
    Detail | WWW

  • 2008

    VOJNAR, T.; ČEŠKA, M.; ROGALEWICZ, A.; ERLEBACH, P.; HOLÍK, L.; BOUAJJANI, A.; HABERMEHL, P.; TOUILI, T.; MORO, P. Automatická verifikace programů s dynamickými datovými strukturami. Inovační podnikání & transfer technologií, 2008, roč. 2008, č. 1, s. 21-22. ISSN: 1210-4612.
    Detail | WWW

  • 2007

    HABERMEHL, P.; IOSIF, R.; ROGALEWICZ, A.; VOJNAR, T. Proving Termination of Tree Manipulating Programs. In Automated Technology for Verification and Analysis. LNCS 4762. Berlin: Springer Verlag, 2007. s. 145-161. ISBN: 978-3-540-75595- 1.
    Detail

    HOLÍK, L.; ROGALEWICZ, A. 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

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

  • 2006

    BOUAJJANI, A.; HABERMEHL, P.; ROGALEWICZ, A.; VOJNAR, T. Abstract Regular Tree Model Checking. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, roč. 149, č. 1, s. 37-48. ISSN: 1571- 0661.
    Detail

    ROGALEWICZ, A. Abstract Regular Model Checking of Complex Dynamic Data Structures - Implementation Details. In Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Information Technology BUT, 2006. s. 198-205. ISBN: 80-214-3287- X.
    Detail

    BOUAJJANI, A.; HABERMEHL, P.; ROGALEWICZ, A.; VOJNAR, T. Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In Static Analysis. LNCS 4134. Berlin: Springer Verlag, 2006. s. 52-70. ISBN: 978-3-540-37756- 6.
    Detail

  • 2005

    BOUAJJANI, A., HABERMEHL, P., ROGALEWICZ, A., VOJNAR, T. Abstract Regular Tree Model Checking. In Proceedings of 7th International Workshop on Verification of Infinite-State Systems -- INFINITY 2005. BRICS Notes Series. Aarhus: Basic Research in Computer Science, Computer Science Departments of the Aarlborg and Aarhus Universities, 2005. s. 15-24. ISSN: 0909- 3206.
    Detail | WWW

    ROGALEWICZ, A. Towards Applying Mona in Abstract Regular Tree Model Checking. In Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Faculty of Information Technology BUT, 2005. s. 663-667. ISBN: 80-214-2890- 2.
    Detail

  • 2004

    ROGALEWICZ, A., VOJNAR, T. Tree Automata In Modelling And Verification Of Concurrent Programs. In Proceedings of ASIS 2004. Ostrava: 2004. s. 197-202. ISBN: 80-86840-03- 4.
    Detail

*) Citace publikací se generují jednou za 24 hodin.