101010.pl is one of the many independent Mastodon servers you can use to participate in the fediverse.
101010.pl czyli najstarszy polski serwer Mastodon. Posiadamy wpisy do 2048 znaków.

Server stats:

559
active users

#modelchecking

1 post1 participant0 posts today
Programming Languages Delft<p>Master thesis by Pepijn Vunderink: "Program Matching with Semantic Patterns"</p><p>"We propose the Dyno pattern language, in which concrete object language syntax can be used to express intuitive semantic patterns of programs. Pattern matching is performed by translating Dyno patterns to μ-calculus formulas and model checking these formulas against models extracted from object programs."</p><p><a href="https://repository.tudelft.nl/record/uuid:a18ab135-96b1-417c-b25e-46aa02521896" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">repository.tudelft.nl/record/u</span><span class="invisible">uid:a18ab135-96b1-417c-b25e-46aa02521896</span></a></p><p><a href="https://akademienl.social/tags/thesis" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>thesis</span></a> <a href="https://akademienl.social/tags/PatternMatching" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>PatternMatching</span></a> <a href="https://akademienl.social/tags/MuCalculus" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MuCalculus</span></a> <a href="https://akademienl.social/tags/ModelChecking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModelChecking</span></a> <a href="https://akademienl.social/tags/mCRL2" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>mCRL2</span></a></p>
Rob Sison<p>There's now a video up of the talk I gave at this year's seL4 Summit, on the status of UNSW's projects to verify Time Protection and Microkit-based userland OS services for the seL4 microkernel:</p><p><a href="https://youtu.be/7wcFx6OTEL4" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">youtu.be/7wcFx6OTEL4</span><span class="invisible"></span></a></p><p><a href="https://aus.social/tags/sel4summit" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>sel4summit</span></a> <a href="https://aus.social/tags/seL4" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>seL4</span></a> <a href="https://aus.social/tags/verification" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>verification</span></a> <a href="https://aus.social/tags/operatingsystems" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>operatingsystems</span></a> <a href="https://aus.social/tags/microkernel" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>microkernel</span></a> <a href="https://aus.social/tags/IsabelleHOL" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>IsabelleHOL</span></a> <a href="https://aus.social/tags/HOL4" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>HOL4</span></a> <a href="https://aus.social/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://aus.social/tags/modelchecking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>modelchecking</span></a> <a href="https://aus.social/tags/formalmethods" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>formalmethods</span></a> <a href="https://aus.social/tags/formalverification" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>formalverification</span></a> <a href="https://aus.social/tags/formal_methods" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>formal_methods</span></a> <a href="https://aus.social/tags/formal_verification" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>formal_verification</span></a></p>
Programming Languages Delft<p>Master thesis by Matteo Meluzzi: Model Checking the XMM Memory Model</p><p>"we present our design of a model checker algorithm for the XMM memory model called GenMC-XMM [...] GenMC-XMM is the first multi-execution model checker proven to be sound. We evaluated our tool against the state-of-the-art model checking tools for RC11, IMM, and Weakestmo2."</p><p><a href="https://repository.tudelft.nl/record/uuid:93937121-ae62-4253-a716-d3c911d85e9c" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">repository.tudelft.nl/record/u</span><span class="invisible">uid:93937121-ae62-4253-a716-d3c911d85e9c</span></a></p><p><a href="https://akademienl.social/tags/ModelChecking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModelChecking</span></a> <a href="https://akademienl.social/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compilers</span></a> <a href="https://akademienl.social/tags/multiexecution" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>multiexecution</span></a> <a href="https://akademienl.social/tags/thesis" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>thesis</span></a></p>
Ivan Enderlin 🦀<p>A Practical Approach for Model Checking C/C++11 code, <a href="http://plrg.eecs.uci.edu/publications/toplas16.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">http://</span><span class="ellipsis">plrg.eecs.uci.edu/publications</span><span class="invisible">/toplas16.pdf</span></a>.</p><p><a href="https://fosstodon.org/tags/testing" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>testing</span></a> <a href="https://fosstodon.org/tags/safety" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>safety</span></a> <a href="https://fosstodon.org/tags/ModelChecking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModelChecking</span></a> <a href="https://fosstodon.org/tags/cpp" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>cpp</span></a></p>
Dirk-Jan Swagerman<p>Mostly, software interfaces are only defined by their signature and without a formal description of the admissible behavior and timing assumptions.</p><p><a href="https://systems.social/tags/ComMA" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ComMA</span></a> provides a family of domain-specific languages that integrate existing techniques from formal behavioral and time modeling and is easily extensible.</p><p><a href="https://youtu.be/-bbJTg7pJ-k" rel="nofollow noopener" target="_blank"><span class="invisible">https://</span><span class="">youtu.be/-bbJTg7pJ-k</span><span class="invisible"></span></a></p><p><a href="https://systems.social/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>SoftwareEngineering</span></a><br><a href="https://systems.social/tags/Interfaces" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Interfaces</span></a><br><a href="https://systems.social/tags/Modelling" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Modelling</span></a><br><a href="https://systems.social/tags/ModelChecking" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ModelChecking</span></a><br><a href="https://systems.social/tags/CodeGeneration" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CodeGeneration</span></a></p>