( en | de | ru )

 

Disambiguation of "Rogalewicz, Adam"

Author of the publication

copydeleteadd this publication to your clipboard
Low-Level Bi-Abduction.

, , , , , and . ECOOP, volume 222 of LIPIcs, page 19:1-19:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephan Adam

Georg Adam

Rainer Adam

Rolf Adam

Rolf Adam

 

Other publications of authors with the same name

Automata-Based Termination Proofs., and . CIAA, volume 5642 of Lecture Notes in Computer Science, page 165-177. Springer, (2009)Deciding Boolean Separation Logic via Small Models., , , and . TACAS (1), volume 14570 of Lecture Notes in Computer Science, page 188-206. Springer, (2024)SL-COMP: Competition of Solvers for Separation Logic., , , , , , , , , and 14 other author(s). TACAS (3), volume 11429 of Lecture Notes in Computer Science, page 116-132. Springer, (2019)Counterexample Validation and Interpolation-Based Refinement for Forest Automata., , , , and . VMCAI, volume 10145 of Lecture Notes in Computer Science, page 288-309. Springer, (2017)Low-Level Bi-Abduction., , , , , and . ECOOP, volume 222 of LIPIcs, page 19:1-19:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems., , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 71-89. Springer, (2016)Deciding Entailments in Inductive Separation Logic with Tree Automata., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 201-218. Springer, (2014)From Shapes to Amortized Complexity., , , , , and . VMCAI, volume 10747 of Lecture Notes in Computer Science, page 205-225. Springer, (2018)Perun: Performance Version System., , , and . ICSME, page 499-503. IEEE, (2022)Abstract Regular Tree Model Checking., , , and . INFINITY, volume 149 of Electronic Notes in Theoretical Computer Science, page 37-48. Elsevier, (2005)