[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-81678-en":3,"doc-seo-81678-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":13,"seo_description":14,"update_tm":27,"read_time":28},81678,1649267921044,"Ava Thompson","https://us-avatar.wpscdn.com/avatar/1800007509477c92dfb?_k=1782875107921204101",8,"Research & Report","PaSTTeL Parallel Analysis Framework for Termination and non-Termination of Lasso Programs","PaSTTeL provides a modular, generic parallel portfolio framework for proving termination or non-termination of lasso programs. It targets linear lasso programs by unifying ranking-function synthesis and geometric non-termination arguments within a concurrent execution model. The framework supports integrating new analysis techniques into a unified portfolio, running registered strategies in parallel, and delivering (non-)termination proof certificates. Initial experiments show competitive performance versus state-of-the-art tools on the SV-COMP 2025 benchmark suite.","arXiv :2606 . 18977v2 [ cs .LO] 10 Jul 2026  \nPaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs  \nAnissa Kheireddine \\# Ñ Sorbonne University, LIP6, France Dowsers, France  \nSouheib Baarir \\# Ñ Sorbonne University, LIP6, France, Paris-Nanterre University, France  \nHugo De Sa Pereira Pinto \\# Dowsers, France  \n~~ Abstract ~~  \nProving termination or non-termination of lasso programs is a challenging problem in program verification. To unify state-of-the-art approaches under a common execution framework, we present PaSTTeL, a modular and generic parallel portfolio framework for termination and non-termination analysis of lasso programs. PaSTTeL is designed to: (1) facilitate the integration of new analysis algorithms into the portfolio, (2) execute registered strategies concurrently, and (3) act as a selfcontained library component that can be seamlessly embedded into any external project requiring (non-)termination analysis. Initial experiments demonstrate that an instantiation of PaSTTeL performs competitively against state-of-the-art tools.  \n2012 ACM Subject Classification ; Security and privacy → Logic and verification Keywords and phrases termination analysis, verification, SMT, parallel.  \n 1  Introduction  \nProving the termination of a program is one of the most fundamental correctness properties in computer science, and is known to be undecidable in the general case. A practical way to approach this problem is to search for explicit termination or non-termination arguments. The existence of a certain termination argument—such as a linear ranking function—is decidable [1, 7 , 9] and implies termination. However, if no linear ranking function can be found, we cannot conclude non-termination. Conversely, the existence of a non-termination argument, e.g., a linear recurrence set [6] or a geometric non-termination argument [8], is decidable and implies non-termination, but a failure to find one cannot conclude termination. These analyses can be applied to lasso programs: execution traces consisting of a single while loop preceded by straight-line code, whose control flow graph takes the characteristic shape of a lasso. In typical use cases, a lasso program is extracted from a control flow graph to represent a candidate infinite execution path, as encountered in CEGAR-based termination synthesis [2, 3, 4, 5] .  \nIn this work, we introduce PaSTTeL 1 , a parallel analysis framework for the termination and non-termination of linear lasso programs (llp) . PaSTTeL unifies state-of-the-art techniques within a concurrent portfolio that combines both termination and non-termination approaches. Our main contributions are as follows:  \n1 [https://github.com/akheireddine/PaSTTeL.git](https://github.com/akheireddine/PaSTTeL.git)  \n2 PaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs  \n– We propose a modular and generic framework for implementing termination and nontermination strategies, designed to facilitate their integration into a unified portfolio.  \n– We implement several state-of-the-art constraint-based techniques, including ranking function synthesis [7] and geometric non-termination arguments [8] .  \n– We evaluate an instance of our framework on the SV-COMP 20252 benchmark suite, comparing its performance with the state-of-the-art Ultimate LassoRanker (ULR)3 . The results show that the modularity and genericity of PaSTTeL do not compromise performance, while its C++-based implementation yields a significant speedup in execution time.  \nBeyond its standalone use, PaSTTeL is designed as a self-contained library that any external project can integrate to leverage (non-)termination analysis capabilities without knowledge  \nof its internal design.  \n 2  Architecture of the Framework  \n Interface  Instantiable Class  Aggregation  Association  \n\n| Parallelization\u003Cbr>\u003Cbr>PortfolioAnalyzer\u003Cbr>N |  | Sequential Analyzer |  |  |  |  |  | SMT Engine |  |  |\n| ","cbCaigzw23JCaaOE","https://ap.wps.com/l/cbCaigzw23JCaaOE","pdf",639356,1,6,"English","en",105,"# Introduction\n# Architecture of the Framework\n## Interface\n## Instantiation Engine","[{\"question\":\"What problem does PaSTTeL address in program verification?\",\"answer\":\"PaSTTeL addresses the challenge of proving termination or non-termination for lasso programs, particularly linear lasso programs, which is difficult in the general case of program verification.\"},{\"question\":\"How does PaSTTeL organize its analysis methods?\",\"answer\":\"PaSTTeL uses a modular parallel portfolio that combines termination and non-termination strategies, enabling techniques such as ranking function synthesis and geometric non-termination arguments to run under a unified framework.\"},{\"question\":\"Which tools and benchmarks are used to evaluate PaSTTeL?\",\"answer\":\"PaSTTeL is evaluated on the SV-COMP 2025 benchmark suite and compared with the state-of-the-art Ultimate LassoRanker (ULR), showing speed improvements from its C++17 implementation.\"}]",1784175359,15,{"code":4,"msg":30,"data":31},"ok",{"site_id":24,"language":23,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"pasttel-parallel-analysis-framework-for-termination-and-non-termination-of-lasso-programs","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/pasttel-parallel-analysis-framework-for-termination-and-non-termination-of-lasso-programs/81678/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":23,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-17","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What problem does PaSTTeL address in program verification?","Question",{"text":75,"@type":76},"PaSTTeL addresses the challenge of proving termination or non-termination for lasso programs, particularly linear lasso programs, which is difficult in the general case of program verification.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How does PaSTTeL organize its analysis methods?",{"text":80,"@type":76},"PaSTTeL uses a modular parallel portfolio that combines termination and non-termination strategies, enabling techniques such as ranking function synthesis and geometric non-termination arguments to run under a unified framework.",{"name":82,"@type":73,"acceptedAnswer":83},"Which tools and benchmarks are used to evaluate PaSTTeL?",{"text":84,"@type":76},"PaSTTeL is evaluated on the SV-COMP 2025 benchmark suite and compared with the state-of-the-art Ultimate LassoRanker (ULR), showing speed improvements from its C++17 implementation.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,114,119,122,127,130,134],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":21,"doc_module":4,"doc_module_name":45,"category_name":111,"show_sort_weight":112,"slug":113},"Technology",50,"technology",{"id":115,"doc_module":4,"doc_module_name":45,"category_name":116,"show_sort_weight":117,"slug":118},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":120,"slug":121},30,"research-report",{"id":123,"doc_module":4,"doc_module_name":45,"category_name":124,"show_sort_weight":125,"slug":126},9,"Religion & Spirituality",20,"religion-spirituality",{"id":125,"doc_module":4,"doc_module_name":45,"category_name":128,"show_sort_weight":125,"slug":129},"World Cup","world-cup",{"id":131,"doc_module":4,"doc_module_name":45,"category_name":132,"show_sort_weight":131,"slug":133},10,"Lifestyle","lifestyle",{"id":135,"doc_module":4,"doc_module_name":45,"category_name":136,"show_sort_weight":106,"slug":137},19,"General","general"]