https://m2.mtmt.hu/ hun 2026-09-06 04:12 true true 1 6 6 20 100 1 6 DESC publishedYear false ASC firstAuthor true ASC title true BookChapter 37488250 APPROVED true 0 false 2026-09-01T13:25:22.858+0000 2026-09-01T13:22:08.647+0000 2026-09-01T13:20:00.920+0000 true 10073070 Bajczi Levente /api/author/10073070 Author true 2026-09-01T13:22:08.907+0000 2026-09-01T13:22:08.907+0000 false false true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter true 10000312 Conference paper true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter /api/subtype/10000312 Konferenciaközlemény SubType 228 true 10000312 true 1 /api/category/1 Category true 1 Britikov, Konstantin CHC-Based Reachability Analysis via Cycle Summarization 205 225 Chapter 11 205, Chapter 11 21 2026 true true 2026 true true true true false NONE 2026-09-01 false 0 0 0 0 0 0 0 0 0 0 0 0 1 1 false false false false 2026-11-30T14:22:08.488+0000 5 17 0 3 0 true true 10002 English /api/language/10002 Angol Language true 2 false true 15258 true 10022 /api/country/10022 Country true 18 /api/city/15258 City true 10006686 true 32103929 /api/publicationidentifier/32103929 https://www.worldcat.org/search?q=isbn%3A9783032107930 9783032107930 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false true 32103930 /api/publicationidentifier/32103930 https://www.worldcat.org/search?q=isbn%3A9783032107947 9783032107947 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false /api/publication/37160758 true true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book INTEGRATED FORMAL METHODS, IFM 2025 false 37160758 false true true true true 10000144 Conference proceedings true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book /api/subtype/10000144 Konferenciakötet SubType 345 true 10000144 false Book 2026 true 1 /api/category/1 Category true 1 false Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 141483133 /api/authorship/141483133 1 0.33333334 true false false Britikov Konstantin true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483134 /api/authorship/141483134 2 0.33333334 false false false Fedyukovich Grigory true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483135 /api/authorship/141483135 3 0.33333334 false true false Sharygina Natasha true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 32919299 /api/publicationidentifier/32919299 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true 10.1007/978-3-032-10794-7_11 https://doi.org/10.1007/978-3-032-10794-7_11 false true PublicationIdentifier 32919301 /api/publicationidentifier/32919301 PlainSource 1 /api/publicationsource/1 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true WoS WoS https://www.webofscience.com/wos/woscc/full-record/@@@ true true 1 true 001717078900011 https://www.webofscience.com/wos/woscc/full-record/001717078900011 false true PublicationIdentifier 32919309 /api/publicationidentifier/32919309 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true 105022902300 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105022902300 false true PublicationIdentifier 32919300 /api/publicationidentifier/32919300 PlainSource 40 /api/publicationsource/40 PublicationSourceType 10006 /api/publicationsourcetype/10006 true true true Egyéb URL Other URL @@@ true true 40 true https://link.springer.com/10.1007/978-3-032-10794-7_11 https://link.springer.com/10.1007/978-3-032-10794-7_11 false true /api/publication/37488250 <div class="BookChapter Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Britikov Konstantin </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Fedyukovich Grigory </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Sharygina Natasha </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;37488250" target="_blank">CHC-Based Reachability Analysis via Cycle Summarization</a></div> <div class="InBook"><div class="chapter-in">In:</div> <div class="authors"> <div class="autype autype-1"> <span class="author-name" >Damiani F </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Farrell M </span> (szerk.) </div> </div> <div class="booktitle"><a href="/gui2/?mode=browse&params=publication;37160758" target="_blank">INTEGRATED FORMAL METHODS, IFM 2025 </a></div> <div class="conference"> Konferencia helye, ideje: <span class="location">Paris, Franciaország <span class="conference-date">2025.11.17. - 2025.11.21.</span> </div> <span class="publishedAt">Cham: <span class="publishers">Springer International Publishing</span>, <span class="page"> pp 205-225 Paper Chapter 11. </span> <span class="year">(2026)</span> ( <span class="seriesTitle">Lecture Notes in Computer Science</span> <span class="issn">0302-9743</span> <span class="issn">1611-3349</span> ) </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:black" title="10.1007/978-3-032-10794-7_11" target="_blank" href="https://doi.org/10.1007/978-3-032-10794-7_11"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="001717078900011" target="_blank" href="https://www.webofscience.com/wos/woscc/full-record/001717078900011"> WoS </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="105022902300" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105022902300"> Scopus </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="https://link.springer.com/10.1007/978-3-032-10794-7_11" target="_blank" href="https://link.springer.com/10.1007/978-3-032-10794-7_11"> Egyéb URL </a> </span> </span> <span class="bookchapter-ids">Befoglaló link(ek):</span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783032107930" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783032107930"> 9783032107930 </a> </span> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783032107947" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783032107947"> 9783032107947 </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;37488250&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 1 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 37488250</span> | <span class="status-data status-APPROVED"> Nyilvános </span> <span class="long-book-mtid">Befoglaló: 37160758</span> Idéző | <span class="type-subtype">Könyvrészlet ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">DOI XML</span> </div> <div class="lastModified">Utolsó módosítás: 2026.09.01. 15:22 Bajczi Levente (informatika) </div> </div> </div> BookChapter 36615315 VALIDATED true 0 false 2025-12-28T19:59:32.809+0000 2025-12-26T01:32:16.124+0000 2025-12-26T01:32:14.955+0000 true 521 Szuper Admin /api/admin/521 Admin true 2025-12-28T19:58:15.794+0000 2025-12-26T01:32:15.245+0000 true 521 Szuper Admin /api/admin/521 Admin true false false true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter true 10000312 Conference paper true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter /api/subtype/10000312 Konferenciaközlemény SubType 228 true 10000312 true 1 /api/category/1 Category true 1 De Angelis, Emanuele Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023) 38 51 38 14 2025 2025 true true true true false NONE 2025-12-28 false 0 0 0 0 0 0 0 0 0 0 0 0 3 3 false false false false 9 18 0 2 0 true true 10002 English /api/language/10002 Angol Language true 2 false true 15258 true 10022 /api/country/10022 Country true 18 /api/city/15258 City true 10006686 true 30614929 /api/publicationidentifier/30614929 https://www.worldcat.org/search?q=isbn%3A9783031676949 9783031676949 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false true 30614930 /api/publicationidentifier/30614930 https://www.worldcat.org/search?q=isbn%3A9783031676956 9783031676956 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false /api/publication/36615316 true true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book TOOLYMPICS CHALLENGE 2023 false 36615316 false true true true true 10000144 Conference proceedings true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book /api/subtype/10000144 Konferenciakötet SubType 345 true 10000144 false Book 2025 true 1 /api/category/1 Category true 1 false Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 130189899 /api/authorship/130189899 1 0.5 true false true De Angelis Emanuele true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 130189900 /api/authorship/130189900 2 0.5 false true true Krishnan Hari Govind Vediramana true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 30614932 /api/publicationidentifier/30614932 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true IDENTICAL 10.1007/978-3-031-67695-6_2 https://doi.org/10.1007/978-3-031-67695-6_2 false true PublicationIdentifier 30614931 /api/publicationidentifier/30614931 PlainSource 1 /api/publicationsource/1 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true WoS WoS https://www.webofscience.com/wos/woscc/full-record/@@@ true true 1 true IDENTICAL 001434957500002 https://www.webofscience.com/wos/woscc/full-record/001434957500002 false true Keyword 1196578 /api/keyword/1196578 true 1196578 true Keyword 1377532 /api/keyword/1377532 true 1377532 true Keyword 1540464 /api/keyword/1540464 true true Keyword 1919310 /api/keyword/1919310 true true /api/publication/36615315 <div class="BookChapter Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >De Angelis Emanuele ✉ </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Krishnan Hari Govind Vediramana ✉ </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;36615315" target="_blank">Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023)</a></div> <div class="InBook"><div class="chapter-in">In:</div> <div class="authors"> <div class="autype autype-1"> <span class="author-name" >Hartmanns A </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Kordon F </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Beyer D </span> (szerk.) </div> </div> <div class="booktitle"><a href="/gui2/?mode=browse&params=publication;36615316" target="_blank">TOOLYMPICS CHALLENGE 2023 </a></div> <div class="conference"> Konferencia helye, ideje: <span class="conference-date">2023.04.22. - 2023.04.27.</span> </div> <span class="publishedAt">Cham: <span class="publishers">SPRINGER INTERNATIONAL PUBLISHING AG</span>, <span class="page"> pp 38-51 </span> <span class="year">(2025)</span> ( <span class="seriesTitle">Lecture Notes in Computer Science</span> <span class="issn">0302-9743</span> <span class="issn">1611-3349</span> ) </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:blue" title="10.1007/978-3-031-67695-6_2" target="_blank" href="https://doi.org/10.1007/978-3-031-67695-6_2"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:blue" title="001434957500002" target="_blank" href="https://www.webofscience.com/wos/woscc/full-record/001434957500002"> WoS </a> </span> </span> <span class="bookchapter-ids">Befoglaló link(ek):</span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783031676949" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783031676949"> 9783031676949 </a> </span> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783031676956" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783031676956"> 9783031676956 </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;36615315&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 3 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 36615315</span> | <span class="status-data status-VALIDATED"> Egyeztetett </span> <span class="long-book-mtid">Befoglaló: 36615316</span> Idéző | <span class="type-subtype">Könyvrészlet ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">WoS-XML</span> </div> <div class="lastModified">Utolsó módosítás: 2025.12.26. 02:32 Szuper Admin (admin) </div> </div> </div> BookChapter 37488251 APPROVED true 0 false 2026-09-01T13:26:06.288+0000 2026-09-01T13:21:37.344+0000 2026-09-01T13:20:05.201+0000 true 10073070 Bajczi Levente /api/author/10073070 Author true 2026-09-01T13:21:37.663+0000 2026-09-01T13:21:37.663+0000 false false true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter true 10000312 Conference paper true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter /api/subtype/10000312 Konferenciaközlemény SubType 228 true 10000312 true 1 /api/category/1 Category true 1 Frohn, Florian Integrating Loop Acceleration Into Bounded Model Checking 73 91 Chapter 4 73, Chapter 4 19 2025 Bounded Model Checking (BMC) is a powerful technique for proving unsafety. However, finding deep counterexamples that require a large bound is challenging for BMC. On the other hand, acceleration techniques compute “shortcuts” that “compress” many execution steps into a single one. In this paper, we tightly integrate acceleration techniques into SMT-based bounded model checking. By adding suitable “shortcuts” on the fly, our approach can quickly detect deep counterexamples. Moreover, using so-called blocking clauses , our approach can prove safety of examples where BMC diverges. An empirical comparison with other state-of-the-art techniques shows that our approach is highly competitive for proving unsafety, and orthogonal to existing techniques for proving safety. true true 2026 true true true true false NONE 2026-09-01 false 0 0 0 0 0 0 0 0 0 0 0 0 1 1 false false false false 2026-11-30T14:21:37.165+0000 5 17 0 2 0 true true 10002 English /api/language/10002 Angol Language true 2 false true 15258 true 10022 /api/country/10022 Country true 18 /api/city/15258 City true 10006686 true 28834948 /api/publicationidentifier/28834948 https://www.worldcat.org/search?q=isbn%3A9783031711619 9783031711619 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false true 28834949 /api/publicationidentifier/28834949 https://www.worldcat.org/search?q=isbn%3A9783031711626 9783031711626 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false /api/publication/35912958 true true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book FORMAL METHODS, PT I, FM 2024 false 35912958 false true true true true 10000144 Conference proceedings true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book /api/subtype/10000144 Konferenciakötet SubType 345 true 10000144 false Book 2025 true 1 /api/category/1 Category true 1 false Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 141483136 /api/authorship/141483136 1 0.5 true false false Frohn Florian true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483137 /api/authorship/141483137 2 0.5 false true false Giesl Jürgen true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 32919302 /api/publicationidentifier/32919302 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true 10.1007/978-3-031-71162-6_4 https://doi.org/10.1007/978-3-031-71162-6_4 false true PublicationIdentifier 32919304 /api/publicationidentifier/32919304 PlainSource 1 /api/publicationsource/1 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true WoS WoS https://www.webofscience.com/wos/woscc/full-record/@@@ true true 1 true 001336893300004 https://www.webofscience.com/wos/woscc/full-record/001336893300004 false true PublicationIdentifier 32919310 /api/publicationidentifier/32919310 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true 85204604668 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85204604668 false true PublicationIdentifier 32919303 /api/publicationidentifier/32919303 PlainSource 40 /api/publicationsource/40 PublicationSourceType 10006 /api/publicationsourcetype/10006 true true true Egyéb URL Other URL @@@ true true 40 true https://link.springer.com/10.1007/978-3-031-71162-6_4 https://link.springer.com/10.1007/978-3-031-71162-6_4 false true /api/publication/37488251 <div class="BookChapter Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Frohn Florian </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Giesl Jürgen </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;37488251" target="_blank">Integrating Loop Acceleration Into Bounded Model Checking</a></div> <div class="InBook"><div class="chapter-in">In:</div> <div class="authors"> <div class="autype autype-1"> <span class="author-name" >Platzer A </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Rozier KY </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Pradella M </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Rossi M </span> (szerk.) </div> </div> <div class="booktitle"><a href="/gui2/?mode=browse&params=publication;35912958" target="_blank">FORMAL METHODS, PT I, FM 2024 </a></div> <div class="conference"> Konferencia helye, ideje: <span class="location">Milan, Olaszország <span class="conference-date">2024.09.09. - 2024.09.13.</span> </div> <span class="publishedAt">Cham: <span class="publishers">Springer International Publishing</span>, <span class="page"> pp 73-91 Paper Chapter 4. </span> <span class="year">(2025)</span> ( <span class="seriesTitle">Lecture Notes in Computer Science</span> <span class="issn">0302-9743</span> <span class="issn">1611-3349</span> ) </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:black" title="10.1007/978-3-031-71162-6_4" target="_blank" href="https://doi.org/10.1007/978-3-031-71162-6_4"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="001336893300004" target="_blank" href="https://www.webofscience.com/wos/woscc/full-record/001336893300004"> WoS </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="85204604668" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85204604668"> Scopus </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="https://link.springer.com/10.1007/978-3-031-71162-6_4" target="_blank" href="https://link.springer.com/10.1007/978-3-031-71162-6_4"> Egyéb URL </a> </span> </span> <span class="bookchapter-ids">Befoglaló link(ek):</span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783031711619" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783031711619"> 9783031711619 </a> </span> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9783031711626" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9783031711626"> 9783031711626 </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;37488251&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 1 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 37488251</span> | <span class="status-data status-APPROVED"> Nyilvános </span> <span class="long-book-mtid">Befoglaló: 35912958</span> Idéző | <span class="type-subtype">Könyvrészlet ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">DOI XML</span> </div> <div class="lastModified">Utolsó módosítás: 2026.09.01. 15:21 Bajczi Levente (informatika) </div> </div> </div> BookChapter 35863943 APPROVED true The University of Tokyo, Tokyo, Japan Tokyo University of Agriculture and Technology, Tokyo, Japan Export Date: 11 March 2025; Cited By: 0; Correspondence Address: H. Katsura; The University of Tokyo, Tokyo, Japan; email: h.katsura@is.s.u-tokyo.ac.jp; Conference name: 22nd Asian Symposium on Programming Languages and Systems, APLAS 2024; Conference date: 22 October 2024 through 24 October 2024; Conference code: 322529 0 false 2025-03-11T21:48:08.559+0000 2025-03-11T13:10:40.102+0000 2025-03-11T13:07:15.180+0000 true 10072271 Andódy Katalin /api/admin/10072271 Admin true 2025-03-11T13:10:40.333+0000 2025-03-11T13:10:40.333+0000 false false true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter true 10000312 Conference paper true 25 25 /api/publicationtype/25 PublicationType 2 true 25 BookChapter /api/subtype/10000312 Konferenciaközlemény SubType 228 true 10000312 true 1 /api/category/1 Category true 1 Katsura, H. Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem 325 345 325 21 2025 A logical approach to automated program verification has been drawing attention recently, where various program verification problems are transformed into formulas of fixpoint logics such as CHC and νHFL(Z), so that a given program satisfies a property just if the corresponding fixpoint formula is valid. In this paper, we show a kind of converse transformation, converting fixpoint logic formulas to programs so that a formula is valid just if the resulting program never evaluates to an (error) value. This, together with the aforementioned transformation from programs to formulas, allows us to go back and forth between logical formulas and programs. In particular, our transformation enables us to use random testing to disprove a given formula, implying that the original program does not satisfy the specified property. As the programs generated by a naive transformation are not suitable for random testing, we employ mode analysis to generate more test-friendly programs. We have implemented the mode-guided transformation and confirmed its effectiveness through experiments. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025. 2025 true true true true false false NONE 2025-03-11 false 0 0 0 0 0 0 0 0 0 0 0 0 1 1 false false false false 2025-06-09T12:08:09.847+0000 5 17 0 4 0 true true 10002 English /api/language/10002 Angol Language true 2 false true 10493 true 10074 /api/country/10074 Country true 2151549 /api/city/10493 City true 1027370 true 28718225 /api/publicationidentifier/28718225 https://www.worldcat.org/search?q=isbn%3A9789819789429 9789819789429 PublicationIdentifier true 122 ISBN https://www.worldcat.org/search?q=isbn%3A@@@ /api/publicationsource/122 ISBN PlainSource true true 10002 /api/publicationsourcetype/10002 PublicationSourceType true false 122 true false /api/publication/35863944 true true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book Programming Languages and Systems false 35863944 false true true true true 10000144 Conference proceedings true 23 23 /api/publicationtype/23 PublicationType 3 true 23 Book /api/subtype/10000144 Konferenciakötet SubType 345 true 10000144 false Book 2025 true 1 /api/category/1 Category true 1 false Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 124063600 /api/authorship/124063600 1 0.25 true false false Katsura H. true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 124063601 /api/authorship/124063601 2 0.25 false false false Kobayashi N. true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 124063602 /api/authorship/124063602 3 0.25 false false false Sakayori K. true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 124063603 /api/authorship/124063603 4 0.25 false true false Sato R. true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 28718227 /api/publicationidentifier/28718227 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true 10.1007/978-981-97-8943-6_16 https://doi.org/10.1007/978-981-97-8943-6_16 false true PublicationIdentifier 28718228 /api/publicationidentifier/28718228 PlainSource 1 /api/publicationsource/1 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true WoS WoS https://www.webofscience.com/wos/woscc/full-record/@@@ true true 1 true 001420111900016 https://www.webofscience.com/wos/woscc/full-record/001420111900016 false true PublicationIdentifier 28718226 /api/publicationidentifier/28718226 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true 85209806603 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85209806603 false true Keyword 1000917 /api/keyword/1000917 true 1000917 true Keyword 1050239 /api/keyword/1050239 true 1050239 true Keyword 1093915 /api/keyword/1093915 true 1093915 true Keyword 1122289 /api/keyword/1122289 true 1122289 true Keyword 1154070 /api/keyword/1154070 true 1154070 true Keyword 1303684 /api/keyword/1303684 true 1303684 true Keyword 1780129 /api/keyword/1780129 true true Keyword 1903216 /api/keyword/1903216 true true Keyword 2773511 /api/keyword/2773511 true true Keyword 2795158 /api/keyword/2795158 true true Keyword 2989845 /api/keyword/2989845 true true Keyword 3690262 /api/keyword/3690262 true true Keyword 3735506 /api/keyword/3735506 true true Keyword 3735507 /api/keyword/3735507 true true /api/publication/35863943 <div class="BookChapter Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Katsura H. </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Kobayashi N. </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Sakayori K. </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Sato R. </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;35863943" target="_blank">Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem</a></div> <div class="InBook"><div class="chapter-in">In:</div> <div class="authors"> <div class="autype autype-1"> <span class="author-name" >Kiselyov O. </span> (szerk.) </div> </div> <div class="booktitle"><a href="/gui2/?mode=browse&params=publication;35863944" target="_blank">Programming Languages and Systems : 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, October 22-24, 2024, Proceedings </a></div> <span class="publishedAt">Singapore: <span class="publishers">Springer</span>, <span class="page"> pp 325-345 </span> <span class="year">(2025)</span> ( <span class="seriesTitle">Lecture Notes in Computer Science</span> <span class="issn">0302-9743</span> <span class="issn">1611-3349</span> <span class="seriesVolume">; 15194 LNCS</span>) </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:black" title="10.1007/978-981-97-8943-6_16" target="_blank" href="https://doi.org/10.1007/978-981-97-8943-6_16"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="001420111900016" target="_blank" href="https://www.webofscience.com/wos/woscc/full-record/001420111900016"> WoS </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="85209806603" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85209806603"> Scopus </a> </span> </span> <span class="bookchapter-ids">Befoglaló link(ek):</span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <span class="isbnOrIssn"> ISBN: </span> <a style="color:black" title="9789819789429" target="_blank" href="https://www.worldcat.org/search?q=isbn%3A9789819789429"> 9789819789429 </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;35863943&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 1 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 35863943</span> | <span class="status-data status-APPROVED"> Nyilvános </span> <span class="long-book-mtid">Befoglaló: 35863944</span> Idéző | <span class="type-subtype">Könyvrészlet ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">Scopus</span> </div> <div class="lastModified">Utolsó módosítás: 2025.03.11. 14:10 Andódy Katalin (BME admin4) </div> <pre class="comment" style="margin-top: 0; margin-bottom: 0;"><u>Megjegyzés</u>: The University of Tokyo, Tokyo, Japan Tokyo University of Agriculture and Technology, Tokyo, Japan Export Date: 11 March 2025; Cited By: 0; Correspondence Address: H. Katsura; The University of Tokyo, Tokyo, Japan; email: h.katsura@is.s.u-tokyo.ac.jp; Conference name: 22nd Asian Symposium on Programming Languages and Systems, APLAS 2024; Conferenc...</pre> </div> </div> JournalArticle 37488252 APPROVED true 0 false 2026-09-01T13:26:29.474+0000 2026-09-01T13:21:08.642+0000 2026-09-01T13:20:06.573+0000 true 10073070 Bajczi Levente /api/author/10073070 Author true 5524346 2026-09-01T13:21:08.997+0000 2026-09-01T13:21:08.876+0000 Author 10073070 /api/author/10073070 Bajczi Levente true true SUSPECT 2026-09-01T13:21:08.876+0000 false false true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle true 1268360 Conference paper in journal true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle /api/subtype/1268360 Konferenciaközlemény SubType 109 true 1268360 true 1 /api/category/1 Category true 1 Otoni, Rodrigo Validation of CHC Satisfiability with ATHENA true true /api/journal/10005652 REVIEWED true false 10005652 false 10005652 true 0934-5043 1433-299X Journal 37 4 1 20 1 20 2025 Formal verification tooling increasingly relies on logic solvers as automated reasoning engines. A commonality among these solvers is the high complexity of their codebases, which makes bug occurrence disturbingly frequent. Tool competitions have showcased many examples of state-of-the-art solvers disagreeing on the satisfiability of logic formulas, be it solvers for Boolean satisfiability (SAT), satisfiability modulo theories (SMT), or constrained Horn clauses (CHC). The validation of solvers’ results is thus of paramount importance, in order to increase the confidence not only in the solvers themselves but also in the tooling which they underpin. Among the formalisms commonly used by modern verification tools, CHC is one that has seen, at the same time, extensive practical usage and very little effort in result validation. We propose a two-layered validation approach for witnesses of CHC satisfiability that validates CHC models via proof-backed SMT queries. We developed a modular evaluation framework, ATHENA, and assessed the approach’s viability via large scale experimentation, comparing three CHC solvers, five SMT solvers, and five proof checkers. Our results indicate that the approach is feasible, with the potential to be incorporated into CHC-based tooling, and also confirm the need for validation, with fourteen bugs being found in the tools used. true true 2026 true true true true false NONE 2026-09-01 false 0 0 0 0 0 0 0 0 0 0 0 0 1 1 false false false false 2026-11-30T14:21:08.479+0000 5 17 0 4 0 false Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 141483138 /api/authorship/141483138 1 0.25 true false false Otoni Rodrigo true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483139 /api/authorship/141483139 2 0.25 false false false Blicha Martin true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483140 /api/authorship/141483140 3 0.25 false false false Eugster Patrick true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PersonAuthorship 141483141 /api/authorship/141483141 4 0.25 false true false Sharygina Natasha true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 32919305 /api/publicationidentifier/32919305 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true 10.1145/3716505 https://doi.org/10.1145/3716505 false true PublicationIdentifier 32919311 /api/publicationidentifier/32919311 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true 105023828947 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105023828947 false true PublicationIdentifier 32919306 /api/publicationidentifier/32919306 PlainSource 40 /api/publicationsource/40 PublicationSourceType 10006 /api/publicationsourcetype/10006 true true true Egyéb URL Other URL @@@ true true 40 true https://dl.acm.org/doi/10.1145/3716505 https://dl.acm.org/doi/10.1145/3716505 false true /api/publication/37488252 <div class="JournalArticle Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Otoni Rodrigo </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Blicha Martin </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Eugster Patrick </span> ;&nbsp;&nbsp;&nbsp; <span class="author-name" >Sharygina Natasha </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;37488252" target="_blank">Validation of CHC Satisfiability with ATHENA</a></div> <div> <span class="journal-title">FORMAL ASPECTS OF COMPUTING</span> <span class="journal-issn">(<a target="_blank" href="https://portal.issn.org/resource/ISSN/0934-5043">0934-5043</a> <a target="_blank" href="https://portal.issn.org/resource/ISSN/1433-299X">1433-299X</a>)</span>: <span class="journal-volume">37</span> <span class="journal-issue">4</span> <span class="page"> pp 1-20 </span> <span class="year">(2025)</span> </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:black" title="10.1145/3716505" target="_blank" href="https://doi.org/10.1145/3716505"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="105023828947" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105023828947"> Scopus </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="https://dl.acm.org/doi/10.1145/3716505" target="_blank" href="https://dl.acm.org/doi/10.1145/3716505"> Egyéb URL </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;37488252&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 1 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 37488252</span> | <span class="status-data status-APPROVED"> Nyilvános </span> Idéző Duplumgyanú | <span class="type-subtype">Folyóiratcikk ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">DOI XML</span> </div> <div class="duplumMark">Duplumjelölés: 2026.09.01. 15:21 (Bajczi Levente (informatika)) </div> <div class="lastModified">Utolsó módosítás: 2026.09.01. 15:21 Bajczi Levente (informatika) </div> </div></div> JournalArticle 37488253 APPROVED true 0 false 2026-09-01T13:24:06.579+0000 2026-09-01T13:21:23.166+0000 2026-09-01T13:20:07.946+0000 true 10073070 Bajczi Levente /api/author/10073070 Author true 2026-09-01T13:21:23.409+0000 2026-09-01T13:21:23.409+0000 false false true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle true 1268360 Conference paper in journal true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle /api/subtype/1268360 Konferenciaközlemény SubType 109 true 1268360 true 1 /api/category/1 Category true 1 Непейвода, Николай Николаевич Логики условных вычислений с ошибками true false /api/journal/20102445 REVIEWED true false false 20102445 true 2413-2713 2074-1472 Journal 31 1 24 46 24 23 2025 В компьютерных программах недопустимо игнорировать практически неизбежное наличие ошибок. Как гласит аксиома Шуры-Буры: «Если программа на самом деле абсолютно правильна, она никому не нужна». А в задачах точных вычислений и в суперкомпьютерах возникает необходимость управления вычислениями от исключительных ситуаций. Для описания такого исполнения недостаточно адекватна двузначная и трехзначная логика. Некоторые ошибки, такие как переполнения или деление на ноль, могут быть обработаны и идентифицируются логическим значением u. Но такие, как «синий экран смерти», фатальны: исправлены внутри программы быть не могут. Множество значений пополняется мягкой ошибкой и фатальной ошибкой \(\bot\). Здесь рассматривается следующая семантика: это сигнал, что однозначное решение не найдено и интерпретируется как \(\{\mathfrak{t},\mathfrak{f}\}\) , а \(\bot\) — как логический провал \(\varnothing\). Рассматриваются лишь непрерывные в топологии \(\bot\) вычисления. Базисом логики принимается условный оператор if then else fi и логические константы \(\{\mathfrak{t},\mathfrak{f}, u, \bot\}\). Исследуются логики, соответствующие различным вариантам организации вычислений данного оператора. Полностью описаны взаимные выразимости этих вариантов. Показано, что различные вариации вычислений порождают, в частности, логики Клини, Лукасевича, Гёделя. true 2026 true false true true false NONE 2026-09-01 false 0 0 0 0 0 0 0 0 0 0 0 0 1 1 false false false false 2026-11-30T14:21:23.007+0000 5 17 0 1 0 false Language 10001 /api/language/10001 Magyar Hungarian true 1 true PersonAuthorship 141483142 /api/authorship/141483142 1 1.0 true false false Непейвода Николай Николаевич true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 32919307 /api/publicationidentifier/32919307 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true 10.21146/2074-1472-2025-31-1-24-46 https://doi.org/10.21146/2074-1472-2025-31-1-24-46 false true PublicationIdentifier 32919312 /api/publicationidentifier/32919312 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true 105011075253 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105011075253 false true PublicationIdentifier 32919308 /api/publicationidentifier/32919308 PlainSource 40 /api/publicationsource/40 PublicationSourceType 10006 /api/publicationsourcetype/10006 true true true Egyéb URL Other URL @@@ true true 40 true https://logicalinvestigations.ru/article/view/701 https://logicalinvestigations.ru/article/view/701 false true /api/publication/37488253 <div class="JournalArticle Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Непейвода Николай Николаевич </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;37488253" target="_blank">Логики условных вычислений с ошибками</a></div> <div> <span class="journal-title">Logical Investigations</span> <span class="journal-issn">(<a target="_blank" href="https://portal.issn.org/resource/ISSN/2413-2713">2413-2713</a> <a target="_blank" href="https://portal.issn.org/resource/ISSN/2074-1472">2074-1472</a>)</span>: <span class="journal-volume">31</span> <span class="journal-issue">1</span> <span class="page"> pp 24-46 </span> <span class="year">(2025)</span> </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Magyar | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:black" title="10.21146/2074-1472-2025-31-1-24-46" target="_blank" href="https://doi.org/10.21146/2074-1472-2025-31-1-24-46"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="105011075253" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-105011075253"> Scopus </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:black" title="https://logicalinvestigations.ru/article/view/701" target="_blank" href="https://logicalinvestigations.ru/article/view/701"> Egyéb URL </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;37488253&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 1 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 37488253</span> | <span class="status-data status-APPROVED"> Nyilvános </span> Idéző | <span class="type-subtype">Folyóiratcikk ( Konferenciaközlemény ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">DOI XML</span> </div> <div class="lastModified">Utolsó módosítás: 2026.09.01. 15:21 Bajczi Levente (informatika) </div> </div></div>