{"id":109,"date":"2021-05-06T15:52:32","date_gmt":"2021-05-06T15:52:32","guid":{"rendered":"http:\/\/themeplugs.com\/wp\/batpa\/event\/?page_id=28"},"modified":"2025-10-28T14:28:30","modified_gmt":"2025-10-28T14:28:30","slug":"speakers","status":"publish","type":"page","link":"http:\/\/vecos-world.org\/2025\/speakers\/","title":{"rendered":"Invited Speakers"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Invited Speakers<\/h2>\t\t\t\t
\n\t\t\t\t\t

\"Mohamed
Mohamed Faouzi Atig<\/a>, UPPSALA University<\/p>\n

Professor in computer systems at the Department of Information Technology, Uppsala University. its research interests broadly span model checking, verification of infinite-state systems, weak memory models, and automata theory.<\/p>\n

Abstract<\/strong>: We study the consistency checking problem, which consists in determining whether, for a given program and a trace (e.g., an execution graph), there exists an execution of the program that satisfies all the relations of the trace. This problem has been widely explored for various programming models In this work, we focus on event-driven programs, which extend concurrent shared-memory programs by allowing threads\u2014called handlers\u2014to send and receive messages. Each handler has a mailbox for incoming messages, which are processed sequentially. However, message executions of different handlers may interleave. We propose an equivalent axiomatic model for event-driven programs and analyze the complexity of their consistency checking problem.<\/p>\n

\"Me\"
Sylvain Conchon<\/a>, Paris-Saclay University<\/p>\n

Professor at Paris-Saclay University and a member of LMF (the Formal Methods Laboratory - ULMR 9061) and the Toccata team, a joint project with INRIA Saclay - \u00cele-de-France. Previously, He was Senior Research Associate in the OBASCO team at Ecole des Mines de Nantes, Senior Research Associate in the PacSoft team at the OGI School of Science & Engineering at OHSU and Ph.D student at INRIA Rocquencourt in the MOCSOVA team<\/p>\n

The Cubicle Fuzzy Loop : A Fuzzing-Based Framework for the Cubicle Model Checkler<\/strong>
Abstract:<\/strong> This talk presents the Cubicle Fuzzy Loop (CFL), a fuzzing-based extension for Cubicle, a model checker for parameterized systems. To prove safety, Cubicle generates invariants, making use of forward exploration strategies like BFS or DFS on finite model instances. However, these standard algorithms are quickly faced with the state explosion problem due to Cubicle\u2019s purely nondeterministic semantics. This causes them to struggle at discovering critical states, hindering invariant generation. CFL replaces this approach with a powerful DFS-like algorithm inspired by fuzzing. Cubicle\u2019s purely nondeterministic execution loop is modified to provide feedback on newly discovered states and visited transitions. This\u00a0feedback is used by CFL to construct schedulers that guide the model exploration. Not only does this provide Cubicle with a bigger variety of states for generating invariants, it also quickly identifies unsafe models. As a bonus, it adds testing capabilities to Cubicle, such as the ability to detect deadlocks.\u00a0Our first experiments have yielded promising results. CFL effectively allows Cubicle to generate crucial invariants, useful to handle hierarchical systems, while also being able to trap bad states and deadlocks in hard-to-reach areas of such models.<\/span><\/span><\/p>\n\t\t\t\t<\/div>\n\t\t\t<\/div><\/div>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Invited Speakers Mohamed Faouzi Atig, UPPSALA University Professor in computer systems at the Department of Information Technology, Uppsala University. its research interests broadly span model checking, verification of infinite-state systems, weak memory models, and automata theory. Abstract: We study the consistency checking problem, which consists in determining whether, for a given program and a trace … <\/p>\n

Read More “Invited Speakers”<\/span><\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_header_footer","meta":{"footnotes":""},"class_list":["post-109","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/pages\/109","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/comments?post=109"}],"version-history":[{"count":22,"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/pages\/109\/revisions"}],"predecessor-version":[{"id":809,"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/pages\/109\/revisions\/809"}],"wp:attachment":[{"href":"http:\/\/vecos-world.org\/2025\/wp-json\/wp\/v2\/media?parent=109"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}