<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>D3s-Project-Gacr20-07487S on D3S</title>
    <link>https://d3s.mff.cuni.cz/tags/d3s-project-gacr20-07487s/</link>
    <description>Recent content in D3s-Project-Gacr20-07487S on D3S</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://d3s.mff.cuni.cz/tags/d3s-project-gacr20-07487s/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Checking Just Pairs of Threads for Efficient and Scalable Incremental Verification of Multithreaded Programs</title>
      <link>https://d3s.mff.cuni.cz/publications/parizek_checking_2023/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/parizek_checking_2023/</guid>
      <description></description>
    </item>
    <item>
      <title>Farkas-Based Tree Interpolation</title>
      <link>https://d3s.mff.cuni.cz/publications/asadi_farkasbased_2020/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/asadi_farkasbased_2020/</guid>
      <description></description>
    </item>
    <item>
      <title>Incremental Verification by SMT-based Summary Repair</title>
      <link>https://d3s.mff.cuni.cz/publications/asadi_incremental_2020/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/asadi_incremental_2020/</guid>
      <description></description>
    </item>
    <item>
      <title>Incremental Verification of Multithreaded Programs by Checking Interleavings for Pairs of Threads</title>
      <link>https://d3s.mff.cuni.cz/publications/parizek_incremental_report_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/parizek_incremental_report_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>PeachPie: Mature PHP to CLI compiler</title>
      <link>https://d3s.mff.cuni.cz/publications/husak_peachpie_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/husak_peachpie_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>SolCMC: Solidity Compiler’s Model Checker</title>
      <link>https://d3s.mff.cuni.cz/publications/alt_solcmc_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/alt_solcmc_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>Split Transition Power Abstraction for Unbounded Safety</title>
      <link>https://d3s.mff.cuni.cz/publications/blicha_split_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/blicha_split_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>Summarization of branching loops</title>
      <link>https://d3s.mff.cuni.cz/publications/blicha_summarization_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/blicha_summarization_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>Transition Power Abstractions for Deep Counterexample Detection</title>
      <link>https://d3s.mff.cuni.cz/publications/blicha_transition_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/blicha_transition_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>Using linear algebra in decomposition of Farkas interpolants</title>
      <link>https://d3s.mff.cuni.cz/publications/blicha_using_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/blicha_using_2022/</guid>
      <description></description>
    </item>
    <item>
      <title>Using Procedure Cloning for Performance Optimization of Compiled Dynamic Languages</title>
      <link>https://d3s.mff.cuni.cz/publications/husak_using_2022/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://d3s.mff.cuni.cz/publications/husak_using_2022/</guid>
      <description></description>
    </item>
  </channel>
</rss>
