http://nts.imag.fr/index.php?action=history&feed=atom&title=Recent_publications 2026-05-06T15:54:49Z Revision history for this page on the wiki MediaWiki 1.26.2 http://nts.imag.fr/index.php?title=Recent_publications&diff=1253&oldid=prev 2026-04-28T09:02:13Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 09:02, 28 April 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l3" >Line 3:</td> <td colspan="2" class="diff-lineno">Line 3:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* M. Bozga, R. Iosif and F. Zuleger. Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs. [https://arxiv.org/abs/2604.24151 arXiv:2604.24151]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1239&oldid=prev 2026-03-10T09:16:07Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 09:16, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l10" >Line 10:</td> <td colspan="2" class="diff-lineno">Line 10:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. [https://<del class="diffchange diffchange-inline">arxiv</del>.org/<del class="diffchange diffchange-inline">abs/2310.04764 </del>Characterizations of Monadic Second Order Definable Context-free Sets of Graphs]. Logical Methods in Computer Science (LMCS) Volume 22, Issue 1, 2026, pp. 22:1–22:30</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. [https://<ins class="diffchange diffchange-inline">lmcs.episciences</ins>.org/<ins class="diffchange diffchange-inline">17687 </ins>Characterizations of Monadic Second Order Definable Context-free Sets of Graphs]. Logical Methods in Computer Science (LMCS) Volume 22, Issue 1, 2026, pp. 22:1–22:30</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1238&oldid=prev 2026-03-10T08:51:45Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 08:51, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l30" >Line 30:</td> <td colspan="2" class="diff-lineno">Line 30:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Conferences ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Conferences ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Florian Zuleger. [https://arxiv.org/abs/2510.06019 Iterating Non-Aggregative Structure Compositions]. FSTTCS 2025, <del class="diffchange diffchange-inline">to appear</del></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Florian Zuleger. [https://arxiv.org/abs/2510.06019 Iterating Non-Aggregative Structure Compositions]. FSTTCS 2025, <ins class="diffchange diffchange-inline">pp 18:1-18:18</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani. [https://dl.acm.org/doi/10.1007/978-3-031-98682-6_13 Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks] CAV 2025, pp 238-262</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani. [https://dl.acm.org/doi/10.1007/978-3-031-98682-6_13 Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks] CAV 2025, pp 238-262</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Florian Zuleger. [https://www.computer.org/csdl/proceedings-article/lics/2025/790000a704/2aFJRkxJDmE Regular Grammars for Sets of Graphs of Tree-Width 2]. LICS 2025, pp 704-717</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Marius Bozga, Radu Iosif, Florian Zuleger. [https://www.computer.org/csdl/proceedings-article/lics/2025/790000a704/2aFJRkxJDmE Regular Grammars for Sets of Graphs of Tree-Width 2]. LICS 2025, pp 704-717</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1237&oldid=prev 2026-03-10T08:50:37Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 08:50, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l15" >Line 15:</td> <td colspan="2" class="diff-lineno">Line 15:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. [https://www.sciencedirect.com/science/article/pii/S2352220820301061 Checking Deadlock Freedom of Parametric Component-based Systems]. Journal of Logical and Algebraic Methods in Programming (JLAMP) Volume 119 (2021)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. [https://www.sciencedirect.com/science/article/pii/S2352220820301061 Checking Deadlock Freedom of Parametric Component-based Systems]. Journal of Logical and Algebraic Methods in Programming (JLAMP) Volume 119 (2021)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif and N. Peltier. [https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]. ACM Transactions on Computational Logic (TOCL) 21(3): 19:1-19:46 (2020)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif and N. Peltier. [https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]. ACM Transactions on Computational Logic (TOCL) 21(3): 19:1-19:46 (2020)</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [https://doi.org/10.1007/s10703-020-00345-1 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]. Formal Methods in System Design (FMSD)&#160; Volume 55, pages 137–170<del class="diffchange diffchange-inline">, </del>(2020)</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [https://doi.org/10.1007/s10703-020-00345-1 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]. Formal Methods in System Design (FMSD)&#160; Volume 55, pages 137–170 (2020)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1236&oldid=prev 2026-03-10T08:50:24Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 08:50, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l10" >Line 10:</td> <td colspan="2" class="diff-lineno">Line 10:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. [https://arxiv.org/abs/2310.04764 Characterizations of Monadic Second Order Definable Context-free Sets of Graphs]. LMCS Volume 22, Issue 1, 2026, pp. 22:1–22:30</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. [https://arxiv.org/abs/2310.04764 Characterizations of Monadic Second Order Definable Context-free Sets of Graphs]. <ins class="diffchange diffchange-inline">Logical Methods in Computer Science (</ins>LMCS<ins class="diffchange diffchange-inline">) </ins>Volume 22, Issue 1, 2026, pp. 22:1–22:30</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. [https://www.sciencedirect.com/science/article/pii/S2352220820301061 Checking Deadlock Freedom of Parametric Component-based Systems]. Journal of Logical and Algebraic Methods in Programming (JLAMP) Volume 119 (2021)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. [https://www.sciencedirect.com/science/article/pii/S2352220820301061 Checking Deadlock Freedom of Parametric Component-based Systems]. Journal of Logical and Algebraic Methods in Programming (JLAMP) Volume 119 (2021)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif and N. Peltier. [https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]. ACM Transactions on Computational Logic (TOCL) 21(3): 19:1-19:46 (2020)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif and N. Peltier. [https://hal.archives-ouvertes.fr/hal-02388326 The Bernays-Schoenfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates]. ACM Transactions on Computational Logic (TOCL) 21(3): 19:1-19:46 (2020)</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [https://doi.org/10.1007/s10703-020-00345-1 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]. Formal Methods in System Design (FMSD) &#160;</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* L. Holik, R. Iosif, A. Rogalewicz and T. Vojnar. [https://doi.org/10.1007/s10703-020-00345-1 Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems]. Formal Methods in System Design (FMSD<ins class="diffchange diffchange-inline">)&#160; Volume 55, pages 137–170, (2020</ins>)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* P. Ganty, R. Iosif and F. Konecny. [http://link.springer.com/article/10.1007%2Fs10009-016-0420-7 Underapproximation of Procedure Summaries for Integer Programs] Software Tools for Technology Transfer, pp 1-20 [[http://arxiv.org/abs/1210.4289 arXiv:1210.4289]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. [http://arxiv.org/abs/1302.2762 Deciding Conditional Termination] Logical Methods in Computer Science, Vol. 10(3:8) 2014 pp 1-61</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1235&oldid=prev 2026-03-10T08:48:35Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 08:48, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l10" >Line 10:</td> <td colspan="2" class="diff-lineno">Line 10:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger<del class="diffchange diffchange-inline">. Characterizations of Monadic Second Order Definable Context-free Sets of Graphs</del>. [https://arxiv.org/abs/2310.04764 LMCS Volume 22, Issue 1, 2026, pp. 22:1–22:30<del class="diffchange diffchange-inline">]</del></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. [https://arxiv.org/abs/2310.04764 <ins class="diffchange diffchange-inline">Characterizations of Monadic Second Order Definable Context-free Sets of Graphs]. </ins>LMCS Volume 22, Issue 1, 2026, pp. 22:1–22:30</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1234&oldid=prev 2026-03-10T08:47:50Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 08:47, 10 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l5" >Line 5:</td> <td colspan="2" class="diff-lineno">Line 5:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* R. Iosif and F. Zuleger. Characterizations of Definable Context-Free Graphs. [https://arxiv.org/abs/2310.04764 arXiv:2310.04764]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. [https://arxiv.org/abs/1908.11345 arXiv:1908.11345]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and J. Sifakis. Local Reasoning about Parametric and Reconfigurable Component-based Systems. [https://arxiv.org/abs/1908.11345 arXiv:1908.11345]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops [http://arxiv.org/abs/1307.5321 arXiv:1307.5321]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif and F. Konecny. The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops [http://arxiv.org/abs/1307.5321 arXiv:1307.5321]</div></td></tr> <tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l11" >Line 11:</td> <td colspan="2" class="diff-lineno">Line 10:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Journals ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* R. Iosif and F. Zuleger. Characterizations of Monadic Second Order Definable Context-free Sets of Graphs. [https://arxiv.org/abs/2310.04764 LMCS Volume 22, Issue 1, 2026, pp. 22:1–22:30]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, R. Iosif, J. Sifakis. [https://doi.org/10.1016/j.tcs.2022.10.022 Verification of component-based systems with recursive architectures]. Theoretical Computer Science (TCS) Volume 940 pp 146-175 (2023)</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Echenim, R. Iosif, N. Peltier. [https://www.sciencedirect.com/science/article/pii/S0020019021000843?dgcid=coauthor Entailment is Undecidable for Symbolic Heap Separation Logic Formulae with Non-Established Inductive Rules]. Information Processing Letters (IPL) Volume 173 (2022)</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1229&oldid=prev 2025-11-11T15:34:57Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 15:34, 11 November 2025</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l3" >Line 3:</td> <td colspan="2" class="diff-lineno">Line 3:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">* M. Bozga, R. Iosif and F. Zuleger. Regular Grammars for Graph Sets of Tree-Width ≤ 2 [https://arxiv.org/abs/2408.01226 arXiv:2408.01226]</del></div></td><td colspan="2">&#160;</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* L. Bueri, R. Iosif and F. Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1228&oldid=prev 2025-11-11T15:34:36Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 15:34, 11 November 2025</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l31" >Line 31:</td> <td colspan="2" class="diff-lineno">Line 31:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Conferences ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Conferences ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Marius Bozga, Radu Iosif, Florian Zuleger. [https://arxiv.org/abs/2510.06019 Iterating Non-Aggregative Structure Compositions]. FSTTCS 2025, to appear</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani. [https://dl.acm.org/doi/10.1007/978-3-031-98682-6_13 Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks] CAV 2025, pp 238-262</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Marius Bozga, Radu Iosif, Florian Zuleger. [https://www.computer.org/csdl/proceedings-article/lics/2025/790000a704/2aFJRkxJDmE Regular Grammars for Sets of Graphs of Tree-Width 2]. LICS 2025, pp 704-717</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Radu Iosif, Arnaud Sangnier, Neven Villani. [https://dl.acm.org/doi/10.1007/978-3-032-00347-8_4 Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars]. NETYS 2025, pp 57-80</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Mark Chimes, Radu Iosif and Florian Zuleger. [https://easychair.org/publications/paper/8LGS Tree-Verifiable Graph Grammars]. LPAR 2024, pp 165-180</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Mark Chimes, Radu Iosif and Florian Zuleger. [https://easychair.org/publications/paper/8LGS Tree-Verifiable Graph Grammars]. LPAR 2024, pp 165-180</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Radu Iosif, Florian Zuleger. [https://drops.dagstuhl.de/opus/volltexte/2023/19014/ Expressiveness Results for an Inductive Logic of Separated Relations]. CONCUR 2023, pp 20:1-20:20</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* Radu Iosif, Florian Zuleger. [https://drops.dagstuhl.de/opus/volltexte/2023/19014/ Expressiveness Results for an Inductive Logic of Separated Relations]. CONCUR 2023, pp 20:1-20:20</div></td></tr> </table>

Radu iosif http://nts.imag.fr/index.php?title=Recent_publications&diff=1203&oldid=prev 2024-09-05T07:47:21Z

<p></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;' lang='en'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 07:47, 5 September 2024</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l3" >Line 3:</td> <td colspan="2" class="diff-lineno">Line 3:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>==== Pending ====</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* <del class="diffchange diffchange-inline">Lucas </del>Bueri, <del class="diffchange diffchange-inline">Radu </del>Iosif and <del class="diffchange diffchange-inline">Florian </del>Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* <ins class="diffchange diffchange-inline">M. Bozga, R. Iosif and F. Zuleger. Regular Grammars for Graph Sets of Tree-Width ≤ 2 [https://arxiv.org/abs/2408.01226 arXiv:2408.01226]</ins></div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">* L. </ins>Bueri, <ins class="diffchange diffchange-inline">R. </ins>Iosif and <ins class="diffchange diffchange-inline">F. </ins>Zuleger. Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations [https://arxiv.org/abs/2402.16150 arXiv:2402.16150]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* M. Bozga, L. Bueri, R. Iosif and F. Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. [https://arxiv.org/abs/2310.09542 arXiv:2310.09542]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. Characterizations of Definable Context-Free Graphs. [https://arxiv.org/abs/2310.04764 arXiv:2310.04764]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* R. Iosif and F. Zuleger. Characterizations of Definable Context-Free Graphs. [https://arxiv.org/abs/2310.04764 arXiv:2310.04764]</div></td></tr> </table>

Radu iosif