<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml">
<url><loc>https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/></url>
<url><loc>https://scifaro.com/zh/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-bi-intuitionistic-logic-extended-version-0704.1707"/></url>
<url><loc>https://scifaro.com/en/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/></url>
<url><loc>https://scifaro.com/zh/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unicast-and-multicast-qos-routing-with-soft-constraint-logic-programming-0704.1783"/></url>
<url><loc>https://scifaro.com/en/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/></url>
<url><loc>https://scifaro.com/zh/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-logics-and-optimal-reduction-completeness-and-complexity-0704.2448"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-theories-0704.2900</loc><lastmod>2008-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-theories-0704.2900"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/higher-order-theories-0704.2900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-theories-0704.2900"/></url>
<url><loc>https://scifaro.com/zh/abs/higher-order-theories-0704.2900</loc><lastmod>2008-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-theories-0704.2900"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/higher-order-theories-0704.2900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-theories-0704.2900"/></url>
<url><loc>https://scifaro.com/en/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238</loc><lastmod>2011-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/></url>
<url><loc>https://scifaro.com/zh/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238</loc><lastmod>2011-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternative-axiomatics-and-complexity-of-deliberative-stit-theories-0704.3238"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/></url>
<url><loc>https://scifaro.com/zh/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-model-checking-higher-order-fixpoint-logic-0704.3931"/></url>
<url><loc>https://scifaro.com/en/abs/undirected-graphs-of-entanglement-two-0705.0419</loc><lastmod>2009-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undirected-graphs-of-entanglement-two-0705.0419"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/undirected-graphs-of-entanglement-two-0705.0419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undirected-graphs-of-entanglement-two-0705.0419"/></url>
<url><loc>https://scifaro.com/zh/abs/undirected-graphs-of-entanglement-two-0705.0419</loc><lastmod>2009-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undirected-graphs-of-entanglement-two-0705.0419"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/undirected-graphs-of-entanglement-two-0705.0419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undirected-graphs-of-entanglement-two-0705.0419"/></url>
<url><loc>https://scifaro.com/en/abs/logic-column-18-alternative-logics-a-book-review-0705.1367</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/></url>
<url><loc>https://scifaro.com/zh/abs/logic-column-18-alternative-logics-a-book-review-0705.1367</loc><lastmod>2007-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-column-18-alternative-logics-a-book-review-0705.1367"/></url>
<url><loc>https://scifaro.com/en/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/></url>
<url><loc>https://scifaro.com/zh/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-nondeterministic-b-uchi-and-streett-automata-to-deterministic-parity-automata-0705.2205"/></url>
<url><loc>https://scifaro.com/en/abs/linearly-bounded-infinite-graphs-0705.3487</loc><lastmod>2007-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearly-bounded-infinite-graphs-0705.3487"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/linearly-bounded-infinite-graphs-0705.3487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearly-bounded-infinite-graphs-0705.3487"/></url>
<url><loc>https://scifaro.com/zh/abs/linearly-bounded-infinite-graphs-0705.3487</loc><lastmod>2007-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearly-bounded-infinite-graphs-0705.3487"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/linearly-bounded-infinite-graphs-0705.3487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearly-bounded-infinite-graphs-0705.3487"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561</loc><lastmod>2007-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/></url>
<url><loc>https://scifaro.com/zh/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561</loc><lastmod>2007-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-consistency-and-other-constraint-properties-to-quantified-constraints-0705.3561"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610</loc><lastmod>2007-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/></url>
<url><loc>https://scifaro.com/zh/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610</loc><lastmod>2007-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-reachable-patterns-in-linked-data-structures-0705.3610"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/></url>
<url><loc>https://scifaro.com/zh/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-higher-order-context-free-processes-0705.3888"/></url>
<url><loc>https://scifaro.com/en/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/></url>
<url><loc>https://scifaro.com/zh/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-a-first-order-modal-language-to-relational-algebra-0705.3949"/></url>
<url><loc>https://scifaro.com/en/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/></url>
<url><loc>https://scifaro.com/zh/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064</loc><lastmod>2007-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-term-rewriting-systems-having-a-rational-derivation-0705.4064"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226</loc><lastmod>2007-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/></url>
<url><loc>https://scifaro.com/zh/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226</loc><lastmod>2007-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-type-isomorphisms-through-game-semantics-0705.4226"/></url>
<url><loc>https://scifaro.com/en/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228</loc><lastmod>2007-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/></url>
<url><loc>https://scifaro.com/zh/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228</loc><lastmod>2007-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curry-style-type-isomorphisms-and-game-semantics-0705.4228"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604</loc><lastmod>2007-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/></url>
<url><loc>https://scifaro.com/zh/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604</loc><lastmod>2007-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-runtime-verification-using-monadic-difference-logic-0705.4604"/></url>
<url><loc>https://scifaro.com/en/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/></url>
<url><loc>https://scifaro.com/zh/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-concepts-and-two-logics-of-algorithmic-reduction-0706.0103"/></url>
<url><loc>https://scifaro.com/en/abs/interpolant-based-transition-relation-approximation-0706.0523</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolant-based-transition-relation-approximation-0706.0523"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interpolant-based-transition-relation-approximation-0706.0523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolant-based-transition-relation-approximation-0706.0523"/></url>
<url><loc>https://scifaro.com/zh/abs/interpolant-based-transition-relation-approximation-0706.0523</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolant-based-transition-relation-approximation-0706.0523"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interpolant-based-transition-relation-approximation-0706.0523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolant-based-transition-relation-approximation-0706.0523"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/></url>
<url><loc>https://scifaro.com/zh/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-interval-temporal-logic-and-duration-calculus-with-infinite-intervals-complete-proof-systems-0706.0692"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-games-innocence-without-alternation-0706.1118</loc><lastmod>2007-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-games-innocence-without-alternation-0706.1118"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/asynchronous-games-innocence-without-alternation-0706.1118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-games-innocence-without-alternation-0706.1118"/></url>
<url><loc>https://scifaro.com/zh/abs/asynchronous-games-innocence-without-alternation-0706.1118</loc><lastmod>2007-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-games-innocence-without-alternation-0706.1118"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/asynchronous-games-innocence-without-alternation-0706.1118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-games-innocence-without-alternation-0706.1118"/></url>
<url><loc>https://scifaro.com/en/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/></url>
<url><loc>https://scifaro.com/zh/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-semantics-of-simply-typed-lambda-terms-for-infinite-runs-of-br-automata-0706.2076"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-machines-for-dialogue-games-0706.2544</loc><lastmod>2007-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-machines-for-dialogue-games-0706.2544"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-machines-for-dialogue-games-0706.2544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-machines-for-dialogue-games-0706.2544"/></url>
<url><loc>https://scifaro.com/zh/abs/abstract-machines-for-dialogue-games-0706.2544</loc><lastmod>2007-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-machines-for-dialogue-games-0706.2544"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/abstract-machines-for-dialogue-games-0706.2544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-machines-for-dialogue-games-0706.2544"/></url>
<url><loc>https://scifaro.com/en/abs/decisive-markov-chains-0706.2585</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decisive-markov-chains-0706.2585"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/decisive-markov-chains-0706.2585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decisive-markov-chains-0706.2585"/></url>
<url><loc>https://scifaro.com/zh/abs/decisive-markov-chains-0706.2585</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decisive-markov-chains-0706.2585"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/decisive-markov-chains-0706.2585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decisive-markov-chains-0706.2585"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-omega-regular-games-with-imperfect-information-0706.2619</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-omega-regular-games-with-imperfect-information-0706.2619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-omega-regular-games-with-imperfect-information-0706.2619"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-for-modelling-interferences-0706.3341</loc><lastmod>2007-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/></url>
<url><loc>https://scifaro.com/zh/abs/a-sequent-calculus-for-modelling-interferences-0706.3341</loc><lastmod>2007-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-for-modelling-interferences-0706.3341"/></url>
<url><loc>https://scifaro.com/en/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523</loc><lastmod>2008-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/></url>
<url><loc>https://scifaro.com/zh/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523</loc><lastmod>2008-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/there-exist-some-omega-powers-of-any-borel-rank-0706.3523"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723</loc><lastmod>2008-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/></url>
<url><loc>https://scifaro.com/zh/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723</loc><lastmod>2008-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariant-mso-is-stronger-than-counting-mso-in-the-finite-0706.3723"/></url>
<url><loc>https://scifaro.com/en/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/></url>
<url><loc>https://scifaro.com/zh/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pspace-bounds-for-rank-1-modal-logics-0706.4044"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323</loc><lastmod>2007-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/></url>
<url><loc>https://scifaro.com/zh/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323</loc><lastmod>2007-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-finite-or-infinite-trees-revisited-0706.4323"/></url>
<url><loc>https://scifaro.com/en/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556</loc><lastmod>2010-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/></url>
<url><loc>https://scifaro.com/zh/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556</loc><lastmod>2010-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determinacy-in-a-synchronous-pi-calculus-0707.0556"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-non-context-free-extension-of-pdl-0707.0562</loc><lastmod>2007-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/></url>
<url><loc>https://scifaro.com/zh/abs/on-a-non-context-free-extension-of-pdl-0707.0562</loc><lastmod>2007-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-non-context-free-extension-of-pdl-0707.0562"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744</loc><lastmod>2007-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/></url>
<url><loc>https://scifaro.com/zh/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744</loc><lastmod>2007-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-based-framework-for-promise-theory-0707.0744"/></url>
<url><loc>https://scifaro.com/en/abs/are-there-hilbert-style-pure-type-systems-0707.0890</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/></url>
<url><loc>https://scifaro.com/zh/abs/are-there-hilbert-style-pure-type-systems-0707.0890</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-there-hilbert-style-pure-type-systems-0707.0890"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-proving-support-in-programming-language-semantics-0707.0926</loc><lastmod>2007-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/></url>
<url><loc>https://scifaro.com/zh/abs/theorem-proving-support-in-programming-language-semantics-0707.0926</loc><lastmod>2007-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-proving-support-in-programming-language-semantics-0707.0926"/></url>
<url><loc>https://scifaro.com/en/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266</loc><lastmod>2007-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/></url>
<url><loc>https://scifaro.com/zh/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266</loc><lastmod>2007-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-decision-procedures-in-the-calculus-of-inductive-constructions-0707.1266"/></url>
<url><loc>https://scifaro.com/en/abs/computability-closure-ten-years-later-0707.1372</loc><lastmod>2007-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-closure-ten-years-later-0707.1372"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/computability-closure-ten-years-later-0707.1372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-closure-ten-years-later-0707.1372"/></url>
<url><loc>https://scifaro.com/zh/abs/computability-closure-ten-years-later-0707.1372</loc><lastmod>2007-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-closure-ten-years-later-0707.1372"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/computability-closure-ten-years-later-0707.1372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-closure-ten-years-later-0707.1372"/></url>
<url><loc>https://scifaro.com/en/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/></url>
<url><loc>https://scifaro.com/zh/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normalizing-intuitionistic-set-theory-with-inaccessible-sets-0707.1981"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/></url>
<url><loc>https://scifaro.com/zh/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterisation-of-first-order-constraint-satisfaction-problems-0707.2562"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/></url>
<url><loc>https://scifaro.com/zh/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-definition-and-domain-theoretic-properties-of-fully-abstract-0707.3170"/></url>
<url><loc>https://scifaro.com/en/abs/neutrality-and-many-valued-logics-0707.3205</loc><lastmod>2007-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neutrality-and-many-valued-logics-0707.3205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neutrality-and-many-valued-logics-0707.3205"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/></url>
<url><loc>https://scifaro.com/zh/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-i-axiomatization-0707.3782"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/></url>
<url><loc>https://scifaro.com/zh/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-small-step-algorithms-ii-abstract-state-machines-and-the-br-characterization-theorem-0707.3789"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-shortest-developments-0708.0200</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-shortest-developments-0708.0200"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-shortest-developments-0708.0200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-shortest-developments-0708.0200"/></url>
<url><loc>https://scifaro.com/zh/abs/a-note-on-shortest-developments-0708.0200</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-shortest-developments-0708.0200"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-note-on-shortest-developments-0708.0200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-shortest-developments-0708.0200"/></url>
<url><loc>https://scifaro.com/en/abs/edit-and-verify-0708.0713</loc><lastmod>2007-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edit-and-verify-0708.0713"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/edit-and-verify-0708.0713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edit-and-verify-0708.0713"/></url>
<url><loc>https://scifaro.com/zh/abs/edit-and-verify-0708.0713</loc><lastmod>2007-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/edit-and-verify-0708.0713"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/edit-and-verify-0708.0713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/edit-and-verify-0708.0713"/></url>
<url><loc>https://scifaro.com/en/abs/valid-formulas-games-and-network-protocols-0708.1480</loc><lastmod>2007-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valid-formulas-games-and-network-protocols-0708.1480"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/valid-formulas-games-and-network-protocols-0708.1480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valid-formulas-games-and-network-protocols-0708.1480"/></url>
<url><loc>https://scifaro.com/zh/abs/valid-formulas-games-and-network-protocols-0708.1480</loc><lastmod>2007-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valid-formulas-games-and-network-protocols-0708.1480"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/valid-formulas-games-and-network-protocols-0708.1480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valid-formulas-games-and-network-protocols-0708.1480"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-branching-time-logics-0708.1723</loc><lastmod>2007-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-branching-time-logics-0708.1723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-branching-time-logics-0708.1723"/></url>
<url><loc>https://scifaro.com/en/abs/collection-analysis-for-horn-clause-programs-0708.2230</loc><lastmod>2007-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collection-analysis-for-horn-clause-programs-0708.2230"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/collection-analysis-for-horn-clause-programs-0708.2230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collection-analysis-for-horn-clause-programs-0708.2230"/></url>
<url><loc>https://scifaro.com/zh/abs/collection-analysis-for-horn-clause-programs-0708.2230</loc><lastmod>2007-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collection-analysis-for-horn-clause-programs-0708.2230"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/collection-analysis-for-horn-clause-programs-0708.2230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collection-analysis-for-horn-clause-programs-0708.2230"/></url>
<url><loc>https://scifaro.com/en/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252</loc><lastmod>2007-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/></url>
<url><loc>https://scifaro.com/zh/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252</loc><lastmod>2007-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focusing-and-polarization-in-intuitionistic-logic-0708.2252"/></url>
<url><loc>https://scifaro.com/en/abs/the-church-synthesis-problem-with-parameters-0708.3477</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-church-synthesis-problem-with-parameters-0708.3477"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-church-synthesis-problem-with-parameters-0708.3477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-church-synthesis-problem-with-parameters-0708.3477"/></url>
<url><loc>https://scifaro.com/zh/abs/the-church-synthesis-problem-with-parameters-0708.3477</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-church-synthesis-problem-with-parameters-0708.3477"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-church-synthesis-problem-with-parameters-0708.3477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-church-synthesis-problem-with-parameters-0708.3477"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-security-properties-for-cryptographic-protocols-application-to-key-cycles-0708.3564</loc><lastmod>2009-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-security-properties-for-cryptographic-protocols-application-to-key-cycles-0708.3564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-security-properties-for-cryptographic-protocols-application-to-key-cycles-0708.3564"/></url>
<url><loc>https://scifaro.com/en/abs/horpo-with-computability-closure-a-reconstruction-0708.3582</loc><lastmod>2007-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horpo-with-computability-closure-a-reconstruction-0708.3582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horpo-with-computability-closure-a-reconstruction-0708.3582"/></url>
<url><loc>https://scifaro.com/en/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446</loc><lastmod>2007-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/></url>
<url><loc>https://scifaro.com/zh/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446</loc><lastmod>2007-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-column-19-symbolic-model-checking-for-temporal-epistemic-logics-0709.0446"/></url>
<url><loc>https://scifaro.com/en/abs/cirquent-calculus-deepened-0709.1308</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cirquent-calculus-deepened-0709.1308"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/cirquent-calculus-deepened-0709.1308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cirquent-calculus-deepened-0709.1308"/></url>
<url><loc>https://scifaro.com/zh/abs/cirquent-calculus-deepened-0709.1308</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cirquent-calculus-deepened-0709.1308"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/cirquent-calculus-deepened-0709.1308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cirquent-calculus-deepened-0709.1308"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/></url>
<url><loc>https://scifaro.com/zh/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-strong-normalisation-using-domain-theory-0709.1401"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699</loc><lastmod>2007-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/></url>
<url><loc>https://scifaro.com/zh/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699</loc><lastmod>2007-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-tabling-mechanisms-for-transaction-logic-programs-0709.1699"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962</loc><lastmod>2010-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/></url>
<url><loc>https://scifaro.com/zh/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962</loc><lastmod>2010-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-characterization-of-logically-defined-tree-languages-0709.2962"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118</loc><lastmod>2008-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/></url>
<url><loc>https://scifaro.com/zh/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118</loc><lastmod>2008-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-based-on-abstract-interpretation-0709.4118"/></url>
<url><loc>https://scifaro.com/en/abs/two-algorithms-in-search-of-a-type-system-0710.0824</loc><lastmod>2008-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/></url>
<url><loc>https://scifaro.com/zh/abs/two-algorithms-in-search-of-a-type-system-0710.0824</loc><lastmod>2008-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-algorithms-in-search-of-a-type-system-0710.0824"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-ptime-reducibility-for-system-f-terms-type-inference-in-br-dual-light-affine-logic-0710.1153</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-ptime-reducibility-for-system-f-terms-type-inference-in-br-dual-light-affine-logic-0710.1153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-ptime-reducibility-for-system-f-terms-type-inference-in-br-dual-light-affine-logic-0710.1153"/></url>
<url><loc>https://scifaro.com/en/abs/diagrammatic-inference-0710.1208</loc><lastmod>2009-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagrammatic-inference-0710.1208"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/diagrammatic-inference-0710.1208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagrammatic-inference-0710.1208"/></url>
<url><loc>https://scifaro.com/zh/abs/diagrammatic-inference-0710.1208</loc><lastmod>2009-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagrammatic-inference-0710.1208"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/diagrammatic-inference-0710.1208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagrammatic-inference-0710.1208"/></url>
<url><loc>https://scifaro.com/en/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419</loc><lastmod>2008-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/></url>
<url><loc>https://scifaro.com/zh/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419</loc><lastmod>2008-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-variable-hierarchy-for-the-games-mu-calculus-0710.2419"/></url>
<url><loc>https://scifaro.com/en/abs/generic-trace-semantics-via-coinduction-0710.2505</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-trace-semantics-via-coinduction-0710.2505"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/generic-trace-semantics-via-coinduction-0710.2505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-trace-semantics-via-coinduction-0710.2505"/></url>
<url><loc>https://scifaro.com/zh/abs/generic-trace-semantics-via-coinduction-0710.2505</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-trace-semantics-via-coinduction-0710.2505"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/generic-trace-semantics-via-coinduction-0710.2505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-trace-semantics-via-coinduction-0710.2505"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-methods-for-analyzing-non-repudiation-protocols-with-an-active-intruder-0710.3305</loc><lastmod>2007-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-methods-for-analyzing-non-repudiation-protocols-with-an-active-intruder-0710.3305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-methods-for-analyzing-non-repudiation-protocols-with-an-active-intruder-0710.3305"/></url>
<url><loc>https://scifaro.com/en/abs/model-and-program-repair-via-sat-solving-0710.3332</loc><lastmod>2008-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-and-program-repair-via-sat-solving-0710.3332"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/model-and-program-repair-via-sat-solving-0710.3332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-and-program-repair-via-sat-solving-0710.3332"/></url>
<url><loc>https://scifaro.com/zh/abs/model-and-program-repair-via-sat-solving-0710.3332</loc><lastmod>2008-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-and-program-repair-via-sat-solving-0710.3332"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/model-and-program-repair-via-sat-solving-0710.3332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-and-program-repair-via-sat-solving-0710.3332"/></url>
<url><loc>https://scifaro.com/en/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764</loc><lastmod>2007-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/></url>
<url><loc>https://scifaro.com/zh/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764</loc><lastmod>2007-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-of-a-distributed-reachability-algorithm-for-analysis-of-linear-hybrid-automata-0710.3764"/></url>
<url><loc>https://scifaro.com/en/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499</loc><lastmod>2007-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/></url>
<url><loc>https://scifaro.com/zh/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499</loc><lastmod>2007-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remarks-on-jurdzinski-and-lorys-proof-that-palindromes-are-not-a-church-rosser-language-0710.4499"/></url>
<url><loc>https://scifaro.com/en/abs/space-efficient-bounded-model-checking-0710.4629</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-efficient-bounded-model-checking-0710.4629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-efficient-bounded-model-checking-0710.4629"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/></url>
<url><loc>https://scifaro.com/zh/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-embedded-memory-systems-using-efficient-memory-modeling-0710.4666"/></url>
<url><loc>https://scifaro.com/en/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/></url>
<url><loc>https://scifaro.com/zh/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-equivalence-checking-for-verification-of-algebraic-transformations-on-array-intensive-source-code-0710.4689"/></url>
<url><loc>https://scifaro.com/en/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/></url>
<url><loc>https://scifaro.com/zh/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-synthesis-of-3-qubit-quantum-circuits-from-non-binary-quantum-gates-using-multiple-valued-logic-and-group-theory-0710.4694"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/></url>
<url><loc>https://scifaro.com/zh/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-complete-don-t-care-computation-for-network-optimization-0710.4695"/></url>
<url><loc>https://scifaro.com/en/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/></url>
<url><loc>https://scifaro.com/zh/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-synthesis-of-assertion-monitors-using-visual-specifications-0710.4698"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/></url>
<url><loc>https://scifaro.com/zh/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-solution-of-language-equations-using-partitioned-representations-0710.4743"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/></url>
<url><loc>https://scifaro.com/zh/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-safety-critical-timing-and-memory-usage-properties-of-embedded-software-by-abstract-interpretation-0710.4753"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/></url>
<url><loc>https://scifaro.com/zh/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-verification-methodology-for-checking-data-integrity-0710.4848"/></url>
<url><loc>https://scifaro.com/en/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/></url>
<url><loc>https://scifaro.com/zh/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-reusable-verification-environment-for-bca-and-rtl-models-0710.4851"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-factorization-forest-theorem-0710.5130</loc><lastmod>2007-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/></url>
<url><loc>https://scifaro.com/zh/abs/a-proof-of-the-factorization-forest-theorem-0710.5130</loc><lastmod>2007-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-factorization-forest-theorem-0710.5130"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/></url>
<url><loc>https://scifaro.com/zh/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-synchronized-products-of-infinite-transition-systems-0710.5659"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/></url>
<url><loc>https://scifaro.com/zh/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-proof-principles-for-stochastic-processes-0711.0194"/></url>
<url><loc>https://scifaro.com/en/abs/an-interface-group-for-process-components-0711.0834</loc><lastmod>2010-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interface-group-for-process-components-0711.0834"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-interface-group-for-process-components-0711.0834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interface-group-for-process-components-0711.0834"/></url>
<url><loc>https://scifaro.com/zh/abs/an-interface-group-for-process-components-0711.0834</loc><lastmod>2010-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interface-group-for-process-components-0711.0834"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-interface-group-for-process-components-0711.0834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interface-group-for-process-components-0711.0834"/></url>
<url><loc>https://scifaro.com/en/abs/a-thread-calculus-with-molecular-dynamics-0711.0840</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/></url>
<url><loc>https://scifaro.com/zh/abs/a-thread-calculus-with-molecular-dynamics-0711.0840</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-thread-calculus-with-molecular-dynamics-0711.0840"/></url>
<url><loc>https://scifaro.com/en/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016</loc><lastmod>2008-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/></url>
<url><loc>https://scifaro.com/zh/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016</loc><lastmod>2008-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/><xhtml:link rel="alternate" hreflang="zh" href="https://scifaro.com/zh/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-on-the-fly-tableau-based-decision-procedure-for-pdl-satisfiability-0711.1016"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-hybrid-knowledge-bases-0711.2155</loc><lastmod>2007-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-hybrid-knowledge-bases-0711.2155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-hybrid-knowledge-bases-0711.2155"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-of-izf-with-replacement-0711.2546</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-of-izf-with-replacement-0711.2546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-of-izf-with-replacement-0711.2546"/></url>
<url><loc>https://scifaro.com/en/abs/from-vectors-to-mnesors-0712.0084</loc><lastmod>2009-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-vectors-to-mnesors-0712.0084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-vectors-to-mnesors-0712.0084"/></url>
<url><loc>https://scifaro.com/en/abs/on-decidability-properties-of-local-sentences-0712.0164</loc><lastmod>2007-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-decidability-properties-of-local-sentences-0712.0164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-decidability-properties-of-local-sentences-0712.0164"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-rogers-and-rice-theorems-revisited-in-c-and-in-bash-0712.1279</loc><lastmod>2007-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-rogers-and-rice-theorems-revisited-in-c-and-in-bash-0712.1279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-rogers-and-rice-theorems-revisited-in-c-and-in-bash-0712.1279"/></url>
<url><loc>https://scifaro.com/en/abs/about-algorithm-for-transformation-of-logic-functions-atlf-0712.1310</loc><lastmod>2007-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-algorithm-for-transformation-of-logic-functions-atlf-0712.1310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-algorithm-for-transformation-of-logic-functions-atlf-0712.1310"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-rational-power-series-0712.1337</loc><lastmod>2008-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-rational-power-series-0712.1337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-rational-power-series-0712.1337"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-operators-in-computability-logic-0712.1345</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-operators-in-computability-logic-0712.1345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-operators-in-computability-logic-0712.1345"/></url>
<url><loc>https://scifaro.com/en/abs/borel-ranks-and-wadge-degrees-of-context-free-omega-languages-0712.1359</loc><lastmod>2007-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borel-ranks-and-wadge-degrees-of-context-free-omega-languages-0712.1359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borel-ranks-and-wadge-degrees-of-context-free-omega-languages-0712.1359"/></url>
<url><loc>https://scifaro.com/en/abs/undecidable-problems-about-timed-automata-0712.1363</loc><lastmod>2007-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidable-problems-about-timed-automata-0712.1363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidable-problems-about-timed-automata-0712.1363"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computational-complexity-of-cut-reduction-0712.1499</loc><lastmod>2007-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-cut-reduction-0712.1499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computational-complexity-of-cut-reduction-0712.1499"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-of-the-difficulty-of-quantifier-elimination-in-constraint-databases-the-alibi-query-in-moving-object-databases-0712.1996</loc><lastmod>2007-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-of-the-difficulty-of-quantifier-elimination-in-constraint-databases-the-alibi-query-in-moving-object-databases-0712.1996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-of-the-difficulty-of-quantifier-elimination-in-constraint-databases-the-alibi-query-in-moving-object-databases-0712.1996"/></url>
<url><loc>https://scifaro.com/en/abs/clones-and-genoids-in-lambda-calculus-and-first-order-logic-0712.3088</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clones-and-genoids-in-lambda-calculus-and-first-order-logic-0712.3088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clones-and-genoids-in-lambda-calculus-and-first-order-logic-0712.3088"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-overlap-graph-for-gene-assembly-in-ciliates-0712.3380</loc><lastmod>2007-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-overlap-graph-for-gene-assembly-in-ciliates-0712.3380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-overlap-graph-for-gene-assembly-in-ciliates-0712.3380"/></url>
<url><loc>https://scifaro.com/en/abs/tuplix-calculus-0712.3423</loc><lastmod>2009-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tuplix-calculus-0712.3423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tuplix-calculus-0712.3423"/></url>
<url><loc>https://scifaro.com/en/abs/weak-affine-light-typing-polytime-intensional-expressivity-soundness-and-completeness-0712.4222</loc><lastmod>2008-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-affine-light-typing-polytime-intensional-expressivity-soundness-and-completeness-0712.4222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-affine-light-typing-polytime-intensional-expressivity-soundness-and-completeness-0712.4222"/></url>
<url><loc>https://scifaro.com/en/abs/finite-automata-based-on-quantum-logic-and-their-determinization-0712.4341</loc><lastmod>2007-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-automata-based-on-quantum-logic-and-their-determinization-0712.4341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-automata-based-on-quantum-logic-and-their-determinization-0712.4341"/></url>
<url><loc>https://scifaro.com/en/abs/topology-and-ambiguity-in-omega-context-free-languages-0801.0533</loc><lastmod>2008-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-and-ambiguity-in-omega-context-free-languages-0801.0533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-and-ambiguity-in-omega-context-free-languages-0801.0533"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-length-of-the-wadge-hierarchy-of-omega-context-free-languages-0801.0534</loc><lastmod>2008-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-length-of-the-wadge-hierarchy-of-omega-context-free-languages-0801.0534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-length-of-the-wadge-hierarchy-of-omega-context-free-languages-0801.0534"/></url>
<url><loc>https://scifaro.com/en/abs/an-omega-power-of-a-finitary-language-which-is-a-borel-set-of-infinite-rank-0801.0535</loc><lastmod>2008-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-omega-power-of-a-finitary-language-which-is-a-borel-set-of-infinite-rank-0801.0535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-omega-power-of-a-finitary-language-which-is-a-borel-set-of-infinite-rank-0801.0535"/></url>
<url><loc>https://scifaro.com/en/abs/on-infinite-real-trace-rational-languages-of-maximum-topological-complexity-0801.0537</loc><lastmod>2008-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-infinite-real-trace-rational-languages-of-maximum-topological-complexity-0801.0537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-infinite-real-trace-rational-languages-of-maximum-topological-complexity-0801.0537"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-analysis-of-entanglement-and-separability-in-quantum-higher-order-functions-0801.0649</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-analysis-of-entanglement-and-separability-in-quantum-higher-order-functions-0801.0649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-analysis-of-entanglement-and-separability-in-quantum-higher-order-functions-0801.0649"/></url>
<url><loc>https://scifaro.com/en/abs/finite-state-concurrent-programs-can-be-expressed-pairwise-0801.0677</loc><lastmod>2008-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-state-concurrent-programs-can-be-expressed-pairwise-0801.0677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-state-concurrent-programs-can-be-expressed-pairwise-0801.0677"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-non-linear-model-for-a-computational-call-by-value-lambda-calculus-extended-abstract-0801.0813</loc><lastmod>2008-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-non-linear-model-for-a-computational-call-by-value-lambda-calculus-extended-abstract-0801.0813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-non-linear-model-for-a-computational-call-by-value-lambda-calculus-extended-abstract-0801.0813"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-refinement-of-liveness-properties-of-distributed-systems-0801.0949</loc><lastmod>2008-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-refinement-of-liveness-properties-of-distributed-systems-0801.0949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-refinement-of-liveness-properties-of-distributed-systems-0801.0949"/></url>
<url><loc>https://scifaro.com/en/abs/linear-logic-by-levels-and-bounded-time-complexity-0801.1253</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-logic-by-levels-and-bounded-time-complexity-0801.1253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-logic-by-levels-and-bounded-time-complexity-0801.1253"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-large-dynamic-concurrent-programs-from-dynamic-specifications-0801.1687</loc><lastmod>2008-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-large-dynamic-concurrent-programs-from-dynamic-specifications-0801.1687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-large-dynamic-concurrent-programs-from-dynamic-specifications-0801.1687"/></url>
<url><loc>https://scifaro.com/en/abs/an-application-of-the-feferman-vaught-theorem-to-automata-and-logics-for-br-words-over-an-infinite-alphabet-0801.2498</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-application-of-the-feferman-vaught-theorem-to-automata-and-logics-for-br-words-over-an-infinite-alphabet-0801.2498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-application-of-the-feferman-vaught-theorem-to-automata-and-logics-for-br-words-over-an-infinite-alphabet-0801.2498"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-generic-judgments-and-induction-0801.3065</loc><lastmod>2008-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-generic-judgments-and-induction-0801.3065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-generic-judgments-and-induction-0801.3065"/></url>
<url><loc>https://scifaro.com/en/abs/a-hierarchy-of-behavioral-equivalences-in-the-pi-calculus-with-noisy-channels-0801.3117</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hierarchy-of-behavioral-equivalences-in-the-pi-calculus-with-noisy-channels-0801.3117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hierarchy-of-behavioral-equivalences-in-the-pi-calculus-with-noisy-channels-0801.3117"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-propositional-logspace-reasoning-0801.4105</loc><lastmod>2008-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-propositional-logspace-reasoning-0801.4105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-propositional-logspace-reasoning-0801.4105"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-entanglement-analysis-based-on-abstract-interpretation-0801.4230</loc><lastmod>2008-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-entanglement-analysis-based-on-abstract-interpretation-0801.4230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-entanglement-analysis-based-on-abstract-interpretation-0801.4230"/></url>
<url><loc>https://scifaro.com/en/abs/shallow-models-for-non-iterative-modal-logics-0802.0116</loc><lastmod>2008-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shallow-models-for-non-iterative-modal-logics-0802.0116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shallow-models-for-non-iterative-modal-logics-0802.0116"/></url>
<url><loc>https://scifaro.com/en/abs/independence-and-concurrent-separation-logic-0802.0820</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/independence-and-concurrent-separation-logic-0802.0820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/independence-and-concurrent-separation-logic-0802.0820"/></url>
<url><loc>https://scifaro.com/en/abs/combining-generic-judgments-with-recursive-definitions-0802.0865</loc><lastmod>2008-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-generic-judgments-with-recursive-definitions-0802.0865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-generic-judgments-with-recursive-definitions-0802.0865"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-complementation-of-omega-automata-via-the-full-automata-technique-0802.1226</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-complementation-of-omega-automata-via-the-full-automata-technique-0802.1226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-complementation-of-omega-automata-via-the-full-automata-technique-0802.1226"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-jordan-curve-theorem-a-proof-formalized-in-coq-with-hypermaps-0802.2853</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-jordan-curve-theorem-a-proof-formalized-in-coq-with-hypermaps-0802.2853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-jordan-curve-theorem-a-proof-formalized-in-coq-with-hypermaps-0802.2853"/></url>
<url><loc>https://scifaro.com/en/abs/compatibility-of-shelah-and-stupp-s-and-muchnik-s-iteration-with-fragments-of-monadic-second-order-logic-0802.2862</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatibility-of-shelah-and-stupp-s-and-muchnik-s-iteration-with-fragments-of-monadic-second-order-logic-0802.2862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatibility-of-shelah-and-stupp-s-and-muchnik-s-iteration-with-fragments-of-monadic-second-order-logic-0802.2862"/></url>
<url><loc>https://scifaro.com/en/abs/cardinality-and-counting-quantifiers-on-omega-automatic-structures-0802.2866</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cardinality-and-counting-quantifiers-on-omega-automatic-structures-0802.2866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cardinality-and-counting-quantifiers-on-omega-automatic-structures-0802.2866"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-games-for-the-quantitative-mu-calculus-0802.2871</loc><lastmod>2008-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-games-for-the-quantitative-mu-calculus-0802.2871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-games-for-the-quantitative-mu-calculus-0802.2871"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-formalization-of-budgets-0802.3617</loc><lastmod>2008-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-formalization-of-budgets-0802.3617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-formalization-of-budgets-0802.3617"/></url>
<url><loc>https://scifaro.com/en/abs/color-graphs-an-efficient-model-for-two-dimensional-cellular-automata-linear-rules-0802.3626</loc><lastmod>2008-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/color-graphs-an-efficient-model-for-two-dimensional-cellular-automata-linear-rules-0802.3626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/color-graphs-an-efficient-model-for-two-dimensional-cellular-automata-linear-rules-0802.3626"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-diagrams-as-a-formalism-for-representation-of-syntactic-relations-of-formal-languages-0802.3974</loc><lastmod>2008-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-diagrams-as-a-formalism-for-representation-of-syntactic-relations-of-formal-languages-0802.3974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-diagrams-as-a-formalism-for-representation-of-syntactic-relations-of-formal-languages-0802.3974"/></url>
<url><loc>https://scifaro.com/en/abs/a-qualitative-modal-representation-of-quantum-register-transformations-0802.4057</loc><lastmod>2008-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-qualitative-modal-representation-of-quantum-register-transformations-0802.4057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-qualitative-modal-representation-of-quantum-register-transformations-0802.4057"/></url>
<url><loc>https://scifaro.com/en/abs/language-of-boolean-functions-its-grammar-and-machine-0802.4131</loc><lastmod>2008-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/language-of-boolean-functions-its-grammar-and-machine-0802.4131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/language-of-boolean-functions-its-grammar-and-machine-0802.4131"/></url>
<url><loc>https://scifaro.com/en/abs/safety-alternating-automata-on-data-words-0802.4237</loc><lastmod>2010-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-alternating-automata-on-data-words-0802.4237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-alternating-automata-on-data-words-0802.4237"/></url>
<url><loc>https://scifaro.com/en/abs/automated-termination-proofs-for-logic-programs-by-term-rewriting-0803.0014</loc><lastmod>2008-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-termination-proofs-for-logic-programs-by-term-rewriting-0803.0014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-termination-proofs-for-logic-programs-by-term-rewriting-0803.0014"/></url>
<url><loc>https://scifaro.com/en/abs/thread-algebra-for-poly-threading-0803.0378</loc><lastmod>2011-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thread-algebra-for-poly-threading-0803.0378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thread-algebra-for-poly-threading-0803.0378"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantifier-elimination-algorithm-for-linear-real-arithmetic-0803.1575</loc><lastmod>2008-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantifier-elimination-algorithm-for-linear-real-arithmetic-0803.1575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantifier-elimination-algorithm-for-linear-real-arithmetic-0803.1575"/></url>
<url><loc>https://scifaro.com/en/abs/on-winning-conditions-of-high-borel-complexity-in-pushdown-games-0803.1830</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-winning-conditions-of-high-borel-complexity-in-pushdown-games-0803.1830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-winning-conditions-of-high-borel-complexity-in-pushdown-games-0803.1830"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-topological-complexity-of-infinitary-rational-relations-0803.1841</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-topological-complexity-of-infinitary-rational-relations-0803.1841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-topological-complexity-of-infinitary-rational-relations-0803.1841"/></url>
<url><loc>https://scifaro.com/en/abs/closure-properties-of-locally-finite-omega-languages-0803.1842</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-properties-of-locally-finite-omega-languages-0803.1842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-properties-of-locally-finite-omega-languages-0803.1842"/></url>
<url><loc>https://scifaro.com/en/abs/the-abella-interactive-theorem-prover-system-description-0803.2305</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-abella-interactive-theorem-prover-system-description-0803.2305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-abella-interactive-theorem-prover-system-description-0803.2305"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-decision-procedures-for-logics-of-strategic-ability-in-multi-agent-systems-0803.2306</loc><lastmod>2008-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-decision-procedures-for-logics-of-strategic-ability-in-multi-agent-systems-0803.2306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-decision-procedures-for-logics-of-strategic-ability-in-multi-agent-systems-0803.2306"/></url>
<url><loc>https://scifaro.com/en/abs/lissom-a-source-level-proof-carrying-code-platform-0803.2317</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lissom-a-source-level-proof-carrying-code-platform-0803.2317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lissom-a-source-level-proof-carrying-code-platform-0803.2317"/></url>
<url><loc>https://scifaro.com/en/abs/logical-queries-over-views-decidability-and-expressiveness-0803.2559</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-queries-over-views-decidability-and-expressiveness-0803.2559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-queries-over-views-decidability-and-expressiveness-0803.2559"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-composition-and-algebras-of-events-actions-and-processes-0803.3099</loc><lastmod>2008-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-composition-and-algebras-of-events-actions-and-processes-0803.3099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-composition-and-algebras-of-events-actions-and-processes-0803.3099"/></url>
<url><loc>https://scifaro.com/en/abs/labeled-natural-deduction-systems-for-a-family-of-tense-logics-0803.3187</loc><lastmod>2008-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labeled-natural-deduction-systems-for-a-family-of-tense-logics-0803.3187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labeled-natural-deduction-systems-for-a-family-of-tense-logics-0803.3187"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-a-behavioural-pseudometric-without-discount-for-br-probabilistic-systems-0803.3796</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-a-behavioural-pseudometric-without-discount-for-br-probabilistic-systems-0803.3796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-a-behavioural-pseudometric-without-discount-for-br-probabilistic-systems-0803.3796"/></url>
<url><loc>https://scifaro.com/en/abs/binary-decision-diagrams-for-affine-approximation-0804.0066</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-decision-diagrams-for-affine-approximation-0804.0066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-decision-diagrams-for-affine-approximation-0804.0066"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-0804.0273</loc><lastmod>2009-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-0804.0273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-0804.0273"/></url>
<url><loc>https://scifaro.com/en/abs/weak-affine-light-typing-is-complete-with-respect-to-safe-recursion-on-notation-0804.0660</loc><lastmod>2008-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-affine-light-typing-is-complete-with-respect-to-safe-recursion-on-notation-0804.0660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-affine-light-typing-is-complete-with-respect-to-safe-recursion-on-notation-0804.0660"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-interaction-of-differential-interaction-nets-0804.1435</loc><lastmod>2008-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-interaction-of-differential-interaction-nets-0804.1435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-interaction-of-differential-interaction-nets-0804.1435"/></url>
<url><loc>https://scifaro.com/en/abs/mechanizing-the-metatheory-of-lf-0804.1667</loc><lastmod>2010-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanizing-the-metatheory-of-lf-0804.1667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanizing-the-metatheory-of-lf-0804.1667"/></url>
<url><loc>https://scifaro.com/en/abs/on-affine-usages-in-signal-based-communication-0804.1729</loc><lastmod>2010-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-affine-usages-in-signal-based-communication-0804.1729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-affine-usages-in-signal-based-communication-0804.1729"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-free-logical-frameworks-0804.1879</loc><lastmod>2008-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-free-logical-frameworks-0804.1879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-free-logical-frameworks-0804.1879"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-programming-framework-for-combinational-circuit-synthesis-0804.2095</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-programming-framework-for-combinational-circuit-synthesis-0804.2095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-programming-framework-for-combinational-circuit-synthesis-0804.2095"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-and-complexity-of-atl-0804.2435</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-and-complexity-of-atl-0804.2435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-and-complexity-of-atl-0804.2435"/></url>
<url><loc>https://scifaro.com/en/abs/short-proofs-of-strong-normalization-0804.2535</loc><lastmod>2008-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-proofs-of-strong-normalization-0804.2535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-proofs-of-strong-normalization-0804.2535"/></url>
<url><loc>https://scifaro.com/en/abs/experiments-in-model-checking-optimistic-replication-algorithms-0804.3023</loc><lastmod>2009-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experiments-in-model-checking-optimistic-replication-algorithms-0804.3023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experiments-in-model-checking-optimistic-replication-algorithms-0804.3023"/></url>
<url><loc>https://scifaro.com/en/abs/visibly-tree-automata-with-memory-and-constraints-0804.3065</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibly-tree-automata-with-memory-and-constraints-0804.3065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibly-tree-automata-with-memory-and-constraints-0804.3065"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-on-web-services-composition-0804.3105</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-on-web-services-composition-0804.3105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-on-web-services-composition-0804.3105"/></url>
<url><loc>https://scifaro.com/en/abs/wadge-degrees-of-infinitary-rational-relations-0804.3266</loc><lastmod>2009-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wadge-degrees-of-infinitary-rational-relations-0804.3266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wadge-degrees-of-infinitary-rational-relations-0804.3266"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-multiple-heads-in-chr-0804.3351</loc><lastmod>2011-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-multiple-heads-in-chr-0804.3351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-multiple-heads-in-chr-0804.3351"/></url>
<url><loc>https://scifaro.com/en/abs/lecture-notes-on-the-lambda-calculus-0804.3434</loc><lastmod>2013-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lecture-notes-on-the-lambda-calculus-0804.3434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lecture-notes-on-the-lambda-calculus-0804.3434"/></url>
<url><loc>https://scifaro.com/en/abs/from-formal-proofs-to-mathematical-proofs-a-safe-incremental-way-for-building-in-first-order-decision-procedures-0804.3762</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-formal-proofs-to-mathematical-proofs-a-safe-incremental-way-for-building-in-first-order-decision-procedures-0804.3762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-formal-proofs-to-mathematical-proofs-a-safe-incremental-way-for-building-in-first-order-decision-procedures-0804.3762"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-in-abella-about-structural-operational-semantics-specifications-0804.3914</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-in-abella-about-structural-operational-semantics-specifications-0804.3914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-in-abella-about-structural-operational-semantics-specifications-0804.3914"/></url>
<url><loc>https://scifaro.com/en/abs/logic-mining-using-neural-networks-0804.4071</loc><lastmod>2008-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-mining-using-neural-networks-0804.4071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-mining-using-neural-networks-0804.4071"/></url>
<url><loc>https://scifaro.com/en/abs/grainy-numbers-0804.4073</loc><lastmod>2009-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grainy-numbers-0804.4073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grainy-numbers-0804.4073"/></url>
<url><loc>https://scifaro.com/en/abs/logic-learning-in-hopfield-networks-0804.4075</loc><lastmod>2008-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-learning-in-hopfield-networks-0804.4075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-learning-in-hopfield-networks-0804.4075"/></url>
<url><loc>https://scifaro.com/en/abs/practical-automated-partial-verification-of-multi-paradigm-real-time-models-0804.4383</loc><lastmod>2013-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-automated-partial-verification-of-multi-paradigm-real-time-models-0804.4383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-automated-partial-verification-of-multi-paradigm-real-time-models-0804.4383"/></url>
<url><loc>https://scifaro.com/en/abs/data-linkage-algebra-data-linkage-dynamics-and-priority-rewriting-0804.4565</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-linkage-algebra-data-linkage-dynamics-and-priority-rewriting-0804.4565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-linkage-algebra-data-linkage-dynamics-and-priority-rewriting-0804.4565"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-automata-on-data-trees-and-xpath-satisfiability-0805.0330</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-automata-on-data-trees-and-xpath-satisfiability-0805.0330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-automata-on-data-trees-and-xpath-satisfiability-0805.0330"/></url>
<url><loc>https://scifaro.com/en/abs/the-tractability-of-model-checking-for-ltl-the-good-the-bad-and-the-ugly-fragments-0805.0498</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tractability-of-model-checking-for-ltl-the-good-the-bad-and-the-ugly-fragments-0805.0498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tractability-of-model-checking-for-ltl-the-good-the-bad-and-the-ugly-fragments-0805.0498"/></url>
<url><loc>https://scifaro.com/en/abs/relational-parametricity-and-separation-logic-0805.0783</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-parametricity-and-separation-logic-0805.0783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-parametricity-and-separation-logic-0805.0783"/></url>
<url><loc>https://scifaro.com/en/abs/presentation-of-a-game-semantics-for-first-order-propositional-logic-0805.0845</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presentation-of-a-game-semantics-for-first-order-propositional-logic-0805.0845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presentation-of-a-game-semantics-for-first-order-propositional-logic-0805.0845"/></url>
<url><loc>https://scifaro.com/en/abs/a-language-for-mathematical-knowledge-management-0805.1386</loc><lastmod>2011-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-language-for-mathematical-knowledge-management-0805.1386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-language-for-mathematical-knowledge-management-0805.1386"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-algorithm-for-weak-parity-games-0805.1391</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-algorithm-for-weak-parity-games-0805.1391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-algorithm-for-weak-parity-games-0805.1391"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-one-clock-priced-timed-automata-0805.1457</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-one-clock-priced-timed-automata-0805.1457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-one-clock-priced-timed-automata-0805.1457"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-simulating-higher-order-arithmetic-by-a-first-order-theory-modulo-0805.1464</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-simulating-higher-order-arithmetic-by-a-first-order-theory-modulo-0805.1464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-simulating-higher-order-arithmetic-by-a-first-order-theory-modulo-0805.1464"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bound-for-the-communication-complexity-of-the-russian-cards-problem-0805.1974</loc><lastmod>2008-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bound-for-the-communication-complexity-of-the-russian-cards-problem-0805.1974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bound-for-the-communication-complexity-of-the-russian-cards-problem-0805.1974"/></url>
<url><loc>https://scifaro.com/en/abs/replication-via-invalidating-the-applicability-of-the-fixed-point-theorem-0805.2063</loc><lastmod>2008-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/replication-via-invalidating-the-applicability-of-the-fixed-point-theorem-0805.2063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/replication-via-invalidating-the-applicability-of-the-fixed-point-theorem-0805.2063"/></url>
<url><loc>https://scifaro.com/en/abs/mnesors-for-databases-0805.2179</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mnesors-for-databases-0805.2179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mnesors-for-databases-0805.2179"/></url>
<url><loc>https://scifaro.com/en/abs/certified-exact-transcendental-real-number-computation-in-coq-0805.2438</loc><lastmod>2010-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-exact-transcendental-real-number-computation-in-coq-0805.2438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-exact-transcendental-real-number-computation-in-coq-0805.2438"/></url>
<url><loc>https://scifaro.com/en/abs/proof-search-specifications-of-bisimulation-and-modal-logics-for-the-pi-calculus-0805.2785</loc><lastmod>2009-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-search-specifications-of-bisimulation-and-modal-logics-for-the-pi-calculus-0805.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-search-specifications-of-bisimulation-and-modal-logics-for-the-pi-calculus-0805.2785"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-event-b-by-encoding-into-alloy-0805.3256</loc><lastmod>2008-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-event-b-by-encoding-into-alloy-0805.3256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-event-b-by-encoding-into-alloy-0805.3256"/></url>
<url><loc>https://scifaro.com/en/abs/k-hyperarc-consistency-for-soft-constraints-over-divisible-residuated-lattices-0805.3261</loc><lastmod>2008-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-hyperarc-consistency-for-soft-constraints-over-divisible-residuated-lattices-0805.3261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-hyperarc-consistency-for-soft-constraints-over-divisible-residuated-lattices-0805.3261"/></url>
<url><loc>https://scifaro.com/en/abs/enriched-mu-calculi-module-checking-0805.3462</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enriched-mu-calculi-module-checking-0805.3462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enriched-mu-calculi-module-checking-0805.3462"/></url>
<url><loc>https://scifaro.com/en/abs/towards-applied-theories-based-on-computability-logic-0805.3521</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-applied-theories-based-on-computability-logic-0805.3521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-applied-theories-based-on-computability-logic-0805.3521"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-uniformity-for-boolean-circuits-0805.4072</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-uniformity-for-boolean-circuits-0805.4072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-uniformity-for-boolean-circuits-0805.4072"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-calculi-with-n-k-ary-quantifiers-0806.0081</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-calculi-with-n-k-ary-quantifiers-0806.0081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-calculi-with-n-k-ary-quantifiers-0806.0081"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-clique-width-and-tree-width-for-structures-0806.0103</loc><lastmod>2008-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-clique-width-and-tree-width-for-structures-0806.0103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-clique-width-and-tree-width-for-structures-0806.0103"/></url>
<url><loc>https://scifaro.com/en/abs/on-convergence-sensitive-bisimulation-and-the-embedding-of-ccs-in-timed-ccs-0806.0936</loc><lastmod>2010-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-convergence-sensitive-bisimulation-and-the-embedding-of-ccs-in-timed-ccs-0806.0936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-convergence-sensitive-bisimulation-and-the-embedding-of-ccs-in-timed-ccs-0806.0936"/></url>
<url><loc>https://scifaro.com/en/abs/significant-diagnostic-counterexamples-in-probabilistic-model-checking-0806.1139</loc><lastmod>2008-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/significant-diagnostic-counterexamples-in-probabilistic-model-checking-0806.1139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/significant-diagnostic-counterexamples-in-probabilistic-model-checking-0806.1139"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-programs-from-constructive-hol-proofs-via-izf-set-theoretic-br-semantics-0806.1281</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-programs-from-constructive-hol-proofs-via-izf-set-theoretic-br-semantics-0806.1281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-programs-from-constructive-hol-proofs-via-izf-set-theoretic-br-semantics-0806.1281"/></url>
<url><loc>https://scifaro.com/en/abs/topological-complexity-of-context-free-omega-languages-a-survey-0806.1413</loc><lastmod>2013-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-complexity-of-context-free-omega-languages-a-survey-0806.1413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-complexity-of-context-free-omega-languages-a-survey-0806.1413"/></url>
<url><loc>https://scifaro.com/en/abs/data-complexity-of-the-two-variable-fragment-with-counting-quantifiers-0806.1636</loc><lastmod>2024-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-complexity-of-the-two-variable-fragment-with-counting-quantifiers-0806.1636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-complexity-of-the-two-variable-fragment-with-counting-quantifiers-0806.1636"/></url>
<url><loc>https://scifaro.com/en/abs/consistency-and-completeness-of-rewriting-in-the-calculus-of-constructions-0806.1749</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistency-and-completeness-of-rewriting-in-the-calculus-of-constructions-0806.1749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistency-and-completeness-of-rewriting-in-the-calculus-of-constructions-0806.1749"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-a-recursively-typed-lambda-calculus-with-parallel-conditional-0806.1827</loc><lastmod>2008-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-a-recursively-typed-lambda-calculus-with-parallel-conditional-0806.1827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-a-recursively-typed-lambda-calculus-with-parallel-conditional-0806.1827"/></url>
<url><loc>https://scifaro.com/en/abs/logical-reasoning-for-higher-order-functions-with-local-state-0806.2448</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-reasoning-for-higher-order-functions-with-local-state-0806.2448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-reasoning-for-higher-order-functions-with-local-state-0806.2448"/></url>
<url><loc>https://scifaro.com/en/abs/the-computability-path-ordering-the-end-of-a-quest-0806.2517</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computability-path-ordering-the-end-of-a-quest-0806.2517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computability-path-ordering-the-end-of-a-quest-0806.2517"/></url>
<url><loc>https://scifaro.com/en/abs/data-oblivious-stream-productivity-0806.2680</loc><lastmod>2008-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-oblivious-stream-productivity-0806.2680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-oblivious-stream-productivity-0806.2680"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-with-temporally-accessible-iteration-0806.2802</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-with-temporally-accessible-iteration-0806.2802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-with-temporally-accessible-iteration-0806.2802"/></url>
<url><loc>https://scifaro.com/en/abs/the-kleene-rosser-paradox-the-liar-s-paradox-a-fuzzy-logic-programming-paradox-imply-sat-is-not-np-complete-0806.2947</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-kleene-rosser-paradox-the-liar-s-paradox-a-fuzzy-logic-programming-paradox-imply-sat-is-not-np-complete-0806.2947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-kleene-rosser-paradox-the-liar-s-paradox-a-fuzzy-logic-programming-paradox-imply-sat-is-not-np-complete-0806.2947"/></url>
<url><loc>https://scifaro.com/en/abs/a-computer-verified-theory-of-compact-sets-0806.3209</loc><lastmod>2010-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computer-verified-theory-of-compact-sets-0806.3209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computer-verified-theory-of-compact-sets-0806.3209"/></url>
<url><loc>https://scifaro.com/en/abs/separability-in-the-ambient-logic-0806.3849</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separability-in-the-ambient-logic-0806.3849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separability-in-the-ambient-logic-0806.3849"/></url>
<url><loc>https://scifaro.com/en/abs/data-linkage-dynamics-with-shedding-0806.4034</loc><lastmod>2012-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-linkage-dynamics-with-shedding-0806.4034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-linkage-dynamics-with-shedding-0806.4034"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-hybrid-logics-over-transitive-frames-0806.4130</loc><lastmod>2008-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-hybrid-logics-over-transitive-frames-0806.4130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-hybrid-logics-over-transitive-frames-0806.4130"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-in-local-theory-extensions-0806.4553</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-in-local-theory-extensions-0806.4553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-in-local-theory-extensions-0806.4553"/></url>
<url><loc>https://scifaro.com/en/abs/the-heap-lambda-machine-0806.4631</loc><lastmod>2010-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-heap-lambda-machine-0806.4631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-heap-lambda-machine-0806.4631"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-lambda-calculus-with-the-extra-call-by-value-rule-known-as-assoc-0806.4859</loc><lastmod>2008-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-lambda-calculus-with-the-extra-call-by-value-rule-known-as-assoc-0806.4859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-lambda-calculus-with-the-extra-call-by-value-rule-known-as-assoc-0806.4859"/></url>
<url><loc>https://scifaro.com/en/abs/game-refinement-relations-and-metrics-0806.4956</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-refinement-relations-and-metrics-0806.4956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-refinement-relations-and-metrics-0806.4956"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-bases-over-algebraic-models-some-notes-about-informational-equivalence-0807.0704</loc><lastmod>2008-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-bases-over-algebraic-models-some-notes-about-informational-equivalence-0807.0704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-bases-over-algebraic-models-some-notes-about-informational-equivalence-0807.0704"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-framework-for-sound-and-complete-floyd-hoare-logics-0807.1016</loc><lastmod>2013-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-framework-for-sound-and-complete-floyd-hoare-logics-0807.1016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-framework-for-sound-and-complete-floyd-hoare-logics-0807.1016"/></url>
<url><loc>https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-0807.1165</loc><lastmod>2008-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-0807.1165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-0807.1165"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-and-coinductive-components-of-corecursive-functions-in-coq-0807.1524</loc><lastmod>2008-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-and-coinductive-components-of-corecursive-functions-in-coq-0807.1524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-and-coinductive-components-of-corecursive-functions-in-coq-0807.1524"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-formal-reasoning-in-exact-real-arithmetic-0807.1669</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-formal-reasoning-in-exact-real-arithmetic-0807.1669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-formal-reasoning-in-exact-real-arithmetic-0807.1669"/></url>
<url><loc>https://scifaro.com/en/abs/two-fuzzy-logic-programming-paradoxes-imply-continuum-hypothesis-false-axiom-of-choice-false-imply-zfc-is-inconsistent-0807.2543</loc><lastmod>2009-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-fuzzy-logic-programming-paradoxes-imply-continuum-hypothesis-false-axiom-of-choice-false-imply-zfc-is-inconsistent-0807.2543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-fuzzy-logic-programming-paradoxes-imply-continuum-hypothesis-false-axiom-of-choice-false-imply-zfc-is-inconsistent-0807.2543"/></url>
<url><loc>https://scifaro.com/en/abs/topological-observations-on-multiplicative-additive-linear-logic-0807.2636</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-observations-on-multiplicative-additive-linear-logic-0807.2636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-observations-on-multiplicative-additive-linear-logic-0807.2636"/></url>
<url><loc>https://scifaro.com/en/abs/perturbed-affine-arithmetic-for-invariant-computation-in-numerical-program-analysis-0807.2961</loc><lastmod>2008-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perturbed-affine-arithmetic-for-invariant-computation-in-numerical-program-analysis-0807.2961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perturbed-affine-arithmetic-for-invariant-computation-in-numerical-program-analysis-0807.2961"/></url>
<url><loc>https://scifaro.com/en/abs/proposition-algebra-with-projective-limits-0807.3648</loc><lastmod>2011-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proposition-algebra-with-projective-limits-0807.3648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proposition-algebra-with-projective-limits-0807.3648"/></url>
<url><loc>https://scifaro.com/en/abs/rational-streams-coalgebraically-0807.4073</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-streams-coalgebraically-0807.4073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-streams-coalgebraically-0807.4073"/></url>
<url><loc>https://scifaro.com/en/abs/exhaustible-sets-in-higher-type-computation-0808.0441</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exhaustible-sets-in-higher-type-computation-0808.0441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exhaustible-sets-in-higher-type-computation-0808.0441"/></url>
<url><loc>https://scifaro.com/en/abs/logics-for-the-relational-syllogistic-0808.0521</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-for-the-relational-syllogistic-0808.0521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-for-the-relational-syllogistic-0808.0521"/></url>
<url><loc>https://scifaro.com/en/abs/executable-set-theory-and-arithmetic-encodings-in-prolog-0808.0540</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/executable-set-theory-and-arithmetic-encodings-in-prolog-0808.0540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/executable-set-theory-and-arithmetic-encodings-in-prolog-0808.0540"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-and-unranking-of-hereditarily-finite-functions-and-permutations-0808.0554</loc><lastmod>2008-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-and-unranking-of-hereditarily-finite-functions-and-permutations-0808.0554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-and-unranking-of-hereditarily-finite-functions-and-permutations-0808.0554"/></url>
<url><loc>https://scifaro.com/en/abs/pairing-functions-boolean-evaluation-and-binary-decision-diagrams-in-prolog-0808.0555</loc><lastmod>2009-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pairing-functions-boolean-evaluation-and-binary-decision-diagrams-in-prolog-0808.0555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pairing-functions-boolean-evaluation-and-binary-decision-diagrams-in-prolog-0808.0555"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-peterson-s-algorithm-for-leader-election-in-a-unidirectional-asynchronous-ring-using-nusmv-0808.0962</loc><lastmod>2008-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-peterson-s-algorithm-for-leader-election-in-a-unidirectional-asynchronous-ring-using-nusmv-0808.0962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-peterson-s-algorithm-for-leader-election-in-a-unidirectional-asynchronous-ring-using-nusmv-0808.0962"/></url>
<url><loc>https://scifaro.com/en/abs/flow-faster-efficient-decision-algorithms-for-probabilistic-simulations-0808.3651</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flow-faster-efficient-decision-algorithms-for-probabilistic-simulations-0808.3651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flow-faster-efficient-decision-algorithms-for-probabilistic-simulations-0808.3651"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strength-of-proof-irrelevant-type-theories-0808.3928</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strength-of-proof-irrelevant-type-theories-0808.3928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strength-of-proof-irrelevant-type-theories-0808.3928"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-operators-of-common-and-distributed-knowledge-0808.4133</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-operators-of-common-and-distributed-knowledge-0808.4133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-operators-of-common-and-distributed-knowledge-0808.4133"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-probabilistic-timed-automata-with-one-or-two-clocks-0809.0060</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-probabilistic-timed-automata-with-one-or-two-clocks-0809.0060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-probabilistic-timed-automata-with-one-or-two-clocks-0809.0060"/></url>
<url><loc>https://scifaro.com/en/abs/light-logics-and-the-call-by-value-lambda-calculus-0809.0195</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-logics-and-the-call-by-value-lambda-calculus-0809.0195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-logics-and-the-call-by-value-lambda-calculus-0809.0195"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-enriched-mu-calculi-0809.0360</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-enriched-mu-calculi-0809.0360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-enriched-mu-calculi-0809.0360"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-grammars-0809.0494</loc><lastmod>2008-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-grammars-0809.0494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-grammars-0809.0494"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-underapproximations-0809.1236</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-underapproximations-0809.1236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-underapproximations-0809.1236"/></url>
<url><loc>https://scifaro.com/en/abs/a-computer-verified-monadic-functional-implementation-of-the-integral-0809.1552</loc><lastmod>2010-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computer-verified-monadic-functional-implementation-of-the-integral-0809.1552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computer-verified-monadic-functional-implementation-of-the-integral-0809.1552"/></url>
<url><loc>https://scifaro.com/en/abs/computing-with-classical-real-numbers-0809.1644</loc><lastmod>2010-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-with-classical-real-numbers-0809.1644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-with-classical-real-numbers-0809.1644"/></url>
<url><loc>https://scifaro.com/en/abs/topological-complexity-of-omega-powers-extended-abstract-0809.1812</loc><lastmod>2008-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-complexity-of-omega-powers-extended-abstract-0809.1812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-complexity-of-omega-powers-extended-abstract-0809.1812"/></url>
<url><loc>https://scifaro.com/en/abs/weyl-s-predicative-classical-mathematics-as-a-logic-enriched-type-theory-0809.2061</loc><lastmod>2009-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weyl-s-predicative-classical-mathematics-as-a-logic-enriched-type-theory-0809.2061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weyl-s-predicative-classical-mathematics-as-a-logic-enriched-type-theory-0809.2061"/></url>
<url><loc>https://scifaro.com/en/abs/on-omega-regular-model-checking-0809.2214</loc><lastmod>2009-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-omega-regular-model-checking-0809.2214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-omega-regular-model-checking-0809.2214"/></url>
<url><loc>https://scifaro.com/en/abs/datalog-and-constraint-satisfaction-with-infinite-templates-0809.2386</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/datalog-and-constraint-satisfaction-with-infinite-templates-0809.2386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/datalog-and-constraint-satisfaction-with-infinite-templates-0809.2386"/></url>
<url><loc>https://scifaro.com/en/abs/structures-de-r-ealisabilit-e-ram-et-ultrafiltre-sur-n-0809.2394</loc><lastmod>2008-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structures-de-r-ealisabilit-e-ram-et-ultrafiltre-sur-n-0809.2394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structures-de-r-ealisabilit-e-ram-et-ultrafiltre-sur-n-0809.2394"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-pi-calculus-using-nominal-logic-0809.3960</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-pi-calculus-using-nominal-logic-0809.3960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-pi-calculus-using-nominal-logic-0809.3960"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-and-behaviour-preserving-reconfigurations-of-open-petri-nets-0809.4115</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-and-behaviour-preserving-reconfigurations-of-open-petri-nets-0809.4115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-and-behaviour-preserving-reconfigurations-of-open-petri-nets-0809.4115"/></url>
<url><loc>https://scifaro.com/en/abs/an-evidential-path-logic-for-multi-relational-networks-0810.1481</loc><lastmod>2009-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-evidential-path-logic-for-multi-relational-networks-0810.1481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-evidential-path-logic-for-multi-relational-networks-0810.1481"/></url>
<url><loc>https://scifaro.com/en/abs/on-characterising-strong-bisimilarity-in-a-fragment-of-ccs-with-replication-0810.2061</loc><lastmod>2008-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-characterising-strong-bisimilarity-in-a-fragment-of-ccs-with-replication-0810.2061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-characterising-strong-bisimilarity-in-a-fragment-of-ccs-with-replication-0810.2061"/></url>
<url><loc>https://scifaro.com/en/abs/structural-abstract-interpretation-a-formal-study-using-coq-0810.2179</loc><lastmod>2008-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-abstract-interpretation-a-formal-study-using-coq-0810.2179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-abstract-interpretation-a-formal-study-using-coq-0810.2179"/></url>
<url><loc>https://scifaro.com/en/abs/on-combinations-of-local-theory-extensions-0810.2653</loc><lastmod>2008-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-combinations-of-local-theory-extensions-0810.2653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-combinations-of-local-theory-extensions-0810.2653"/></url>
<url><loc>https://scifaro.com/en/abs/sheaves-and-geometric-logic-and-applications-to-the-modular-verification-of-complex-systems-0810.2877</loc><lastmod>2008-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sheaves-and-geometric-logic-and-applications-to-the-modular-verification-of-complex-systems-0810.2877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sheaves-and-geometric-logic-and-applications-to-the-modular-verification-of-complex-systems-0810.2877"/></url>
<url><loc>https://scifaro.com/en/abs/taming-modal-impredicativity-superlazy-reduction-0810.2891</loc><lastmod>2008-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-modal-impredicativity-superlazy-reduction-0810.2891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-modal-impredicativity-superlazy-reduction-0810.2891"/></url>
<url><loc>https://scifaro.com/en/abs/clone-theory-its-syntax-and-semantics-applications-to-universal-algebra-lambda-calculus-and-algebraic-logic-0810.3162</loc><lastmod>2008-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clone-theory-its-syntax-and-semantics-applications-to-universal-algebra-lambda-calculus-and-algebraic-logic-0810.3162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clone-theory-its-syntax-and-semantics-applications-to-universal-algebra-lambda-calculus-and-algebraic-logic-0810.3162"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-testing-preorders-for-finite-probabilistic-processes-0810.3708</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-testing-preorders-for-finite-probabilistic-processes-0810.3708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-testing-preorders-for-finite-probabilistic-processes-0810.3708"/></url>
<url><loc>https://scifaro.com/en/abs/binding-bigraphs-as-symmetric-monoidal-closed-theories-0810.4419</loc><lastmod>2009-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binding-bigraphs-as-symmetric-monoidal-closed-theories-0810.4419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binding-bigraphs-as-symmetric-monoidal-closed-theories-0810.4419"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-presentations-of-symmetric-monoidal-closed-theories-0810.4420</loc><lastmod>2009-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-presentations-of-symmetric-monoidal-closed-theories-0810.4420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-presentations-of-symmetric-monoidal-closed-theories-0810.4420"/></url>
<url><loc>https://scifaro.com/en/abs/on-finite-bases-for-weak-semantics-failures-versus-impossible-futures-0810.4904</loc><lastmod>2008-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finite-bases-for-weak-semantics-failures-versus-impossible-futures-0810.4904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finite-bases-for-weak-semantics-failures-versus-impossible-futures-0810.4904"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-structures-of-bounded-degree-revisited-0810.4998</loc><lastmod>2008-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-structures-of-bounded-degree-revisited-0810.4998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-structures-of-bounded-degree-revisited-0810.4998"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-model-checking-of-tense-logics-on-rational-kripke-models-0810.5516</loc><lastmod>2008-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-model-checking-of-tense-logics-on-rational-kripke-models-0810.5516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-model-checking-of-tense-logics-on-rational-kripke-models-0810.5516"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-memoryful-linear-time-logics-over-one-counter-automata-0810.5517</loc><lastmod>2010-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-memoryful-linear-time-logics-over-one-counter-automata-0810.5517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-memoryful-linear-time-logics-over-one-counter-automata-0810.5517"/></url>
<url><loc>https://scifaro.com/en/abs/a-triangle-based-logic-for-affine-invariant-querying-of-spatial-and-spatio-temporal-data-0810.5725</loc><lastmod>2008-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-triangle-based-logic-for-affine-invariant-querying-of-spatial-and-spatio-temporal-data-0810.5725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-triangle-based-logic-for-affine-invariant-querying-of-spatial-and-spatio-temporal-data-0810.5725"/></url>
<url><loc>https://scifaro.com/en/abs/multi-objective-model-checking-of-markov-decision-processes-0810.5728</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-objective-model-checking-of-markov-decision-processes-0810.5728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-objective-model-checking-of-markov-decision-processes-0810.5728"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-non-ground-logic-programs-into-autoepistemic-logic-for-knowledge-base-combination-0811.0359</loc><lastmod>2010-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-non-ground-logic-programs-into-autoepistemic-logic-for-knowledge-base-combination-0811.0359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-non-ground-logic-programs-into-autoepistemic-logic-for-knowledge-base-combination-0811.0359"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-and-temporal-logics-for-nested-words-0811.0537</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-and-temporal-logics-for-nested-words-0811.0537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-and-temporal-logics-for-nested-words-0811.0537"/></url>
<url><loc>https://scifaro.com/en/abs/one-useful-logic-that-defines-its-own-truth-0811.0964</loc><lastmod>2008-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-useful-logic-that-defines-its-own-truth-0811.0964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-useful-logic-that-defines-its-own-truth-0811.0964"/></url>
<url><loc>https://scifaro.com/en/abs/two-forms-of-one-useful-logic-existential-fixed-point-logic-and-liberal-datalog-0811.0977</loc><lastmod>2008-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-forms-of-one-useful-logic-existential-fixed-point-logic-and-liberal-datalog-0811.0977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-forms-of-one-useful-logic-existential-fixed-point-logic-and-liberal-datalog-0811.0977"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-trees-with-lemmas-resolution-refinements-that-characterize-dll-algorithms-with-clause-learning-0811.1075</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-trees-with-lemmas-resolution-refinements-that-characterize-dll-algorithms-with-clause-learning-0811.1075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-trees-with-lemmas-resolution-refinements-that-characterize-dll-algorithms-with-clause-learning-0811.1075"/></url>
<url><loc>https://scifaro.com/en/abs/a-tla-proof-system-0811.1914</loc><lastmod>2008-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tla-proof-system-0811.1914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tla-proof-system-0811.1914"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-automata-theory-basic-results-0811.1976</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-automata-theory-basic-results-0811.1976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-automata-theory-basic-results-0811.1976"/></url>
<url><loc>https://scifaro.com/en/abs/compactly-accessible-categories-and-quantum-key-distribution-0811.2113</loc><lastmod>2016-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compactly-accessible-categories-and-quantum-key-distribution-0811.2113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compactly-accessible-categories-and-quantum-key-distribution-0811.2113"/></url>
<url><loc>https://scifaro.com/en/abs/the-church-problem-for-countable-ordinals-0811.2198</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-church-problem-for-countable-ordinals-0811.2198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-church-problem-for-countable-ordinals-0811.2198"/></url>
<url><loc>https://scifaro.com/en/abs/a-cloning-pushout-approach-to-term-graph-transformation-0811.3400</loc><lastmod>2008-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cloning-pushout-approach-to-term-graph-transformation-0811.3400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cloning-pushout-approach-to-term-graph-transformation-0811.3400"/></url>
<url><loc>https://scifaro.com/en/abs/craig-interpolation-for-quantifier-free-presburger-arithmetic-0811.3521</loc><lastmod>2008-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/craig-interpolation-for-quantifier-free-presburger-arithmetic-0811.3521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/craig-interpolation-for-quantifier-free-presburger-arithmetic-0811.3521"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-a-definitional-two-level-approach-to-reasoning-with-higher-order-abstract-syntax-0811.4367</loc><lastmod>2010-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-a-definitional-two-level-approach-to-reasoning-with-higher-order-abstract-syntax-0811.4367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-a-definitional-two-level-approach-to-reasoning-with-higher-order-abstract-syntax-0811.4367"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphism-preservation-on-quasi-wide-classes-0811.4497</loc><lastmod>2009-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphism-preservation-on-quasi-wide-classes-0811.4497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphism-preservation-on-quasi-wide-classes-0811.4497"/></url>
<url><loc>https://scifaro.com/en/abs/automated-induction-for-complex-data-structures-0811.4720</loc><lastmod>2008-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-induction-for-complex-data-structures-0811.4720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-induction-for-complex-data-structures-0811.4720"/></url>
<url><loc>https://scifaro.com/en/abs/graph-polynomials-from-recursive-definitions-to-subset-expansion-formulas-0812.1364</loc><lastmod>2013-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-polynomials-from-recursive-definitions-to-subset-expansion-formulas-0812.1364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-polynomials-from-recursive-definitions-to-subset-expansion-formulas-0812.1364"/></url>
<url><loc>https://scifaro.com/en/abs/the-wadge-hierarchy-of-deterministic-tree-languages-0812.1729</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-wadge-hierarchy-of-deterministic-tree-languages-0812.1729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-wadge-hierarchy-of-deterministic-tree-languages-0812.1729"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-of-decidable-first-order-logics-over-integers-and-reals-0812.1967</loc><lastmod>2008-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-of-decidable-first-order-logics-over-integers-and-reals-0812.1967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-of-decidable-first-order-logics-over-integers-and-reals-0812.1967"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-flat-modal-fixpoint-logics-0812.2390</loc><lastmod>2008-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-flat-modal-fixpoint-logics-0812.2390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-flat-modal-fixpoint-logics-0812.2390"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-2-stack-visibly-pushdown-automata-0812.2423</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-2-stack-visibly-pushdown-automata-0812.2423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-2-stack-visibly-pushdown-automata-0812.2423"/></url>
<url><loc>https://scifaro.com/en/abs/standard-logics-are-valuation-nonmonotonic-0812.2702</loc><lastmod>2008-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/standard-logics-are-valuation-nonmonotonic-0812.2702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/standard-logics-are-valuation-nonmonotonic-0812.2702"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-with-explicit-divergence-0812.3068</loc><lastmod>2008-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-with-explicit-divergence-0812.3068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-with-explicit-divergence-0812.3068"/></url>
<url><loc>https://scifaro.com/en/abs/bootstrapping-inductive-and-coinductive-types-in-hascasl-0812.3836</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bootstrapping-inductive-and-coinductive-types-in-hascasl-0812.3836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bootstrapping-inductive-and-coinductive-types-in-hascasl-0812.3836"/></url>
<url><loc>https://scifaro.com/en/abs/induction-and-co-induction-in-sequent-calculus-0812.4727</loc><lastmod>2009-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-and-co-induction-in-sequent-calculus-0812.4727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-and-co-induction-in-sequent-calculus-0812.4727"/></url>
<url><loc>https://scifaro.com/en/abs/nominalistic-logic-extended-abstract-0812.4814</loc><lastmod>2008-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominalistic-logic-extended-abstract-0812.4814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominalistic-logic-extended-abstract-0812.4814"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-generalized-satisfiability-for-linear-temporal-logic-0812.4848</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-generalized-satisfiability-for-linear-temporal-logic-0812.4848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-generalized-satisfiability-for-linear-temporal-logic-0812.4848"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-common-sense-for-scalable-inconsistency-robust-information-integration-using-direct-logic-tm-reasoning-and-the-actor-model-0812.4852</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-common-sense-for-scalable-inconsistency-robust-information-integration-using-direct-logic-tm-reasoning-and-the-actor-model-0812.4852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-common-sense-for-scalable-inconsistency-robust-information-integration-using-direct-logic-tm-reasoning-and-the-actor-model-0812.4852"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-and-asymmetric-asynchronous-interaction-0901.0043</loc><lastmod>2009-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-and-asymmetric-asynchronous-interaction-0901.0043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-and-asymmetric-asynchronous-interaction-0901.0043"/></url>
<url><loc>https://scifaro.com/en/abs/on-synchronous-and-asynchronous-interaction-in-distributed-systems-0901.0048</loc><lastmod>2009-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-synchronous-and-asynchronous-interaction-in-distributed-systems-0901.0048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-synchronous-and-asynchronous-interaction-in-distributed-systems-0901.0048"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-based-query-answering-for-semantic-access-to-relational-databases-a-research-note-0901.0339</loc><lastmod>2009-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-based-query-answering-for-semantic-access-to-relational-databases-a-research-note-0901.0339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-based-query-answering-for-semantic-access-to-relational-databases-a-research-note-0901.0339"/></url>
<url><loc>https://scifaro.com/en/abs/highly-undecidable-problems-for-infinite-computations-0901.0373</loc><lastmod>2009-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/highly-undecidable-problems-for-infinite-computations-0901.0373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/highly-undecidable-problems-for-infinite-computations-0901.0373"/></url>
<url><loc>https://scifaro.com/en/abs/contextual-hypotheses-and-semantics-of-logic-programs-0901.0733</loc><lastmod>2011-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contextual-hypotheses-and-semantics-of-logic-programs-0901.0733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contextual-hypotheses-and-semantics-of-logic-programs-0901.0733"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-deciding-call-by-need-0901.0869</loc><lastmod>2011-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-deciding-call-by-need-0901.0869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-deciding-call-by-need-0901.0869"/></url>
<url><loc>https://scifaro.com/en/abs/the-compositional-construction-of-markov-processes-0901.2434</loc><lastmod>2009-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-compositional-construction-of-markov-processes-0901.2434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-compositional-construction-of-markov-processes-0901.2434"/></url>
<url><loc>https://scifaro.com/en/abs/a-faithful-semantics-for-generalised-symbolic-trajectory-evaluation-0901.2518</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faithful-semantics-for-generalised-symbolic-trajectory-evaluation-0901.2518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faithful-semantics-for-generalised-symbolic-trajectory-evaluation-0901.2518"/></url>
<url><loc>https://scifaro.com/en/abs/automating-access-control-logics-in-simple-type-theory-with-leo-ii-0901.3574</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-access-control-logics-in-simple-type-theory-with-leo-ii-0901.3574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-access-control-logics-in-simple-type-theory-with-leo-ii-0901.3574"/></url>
<url><loc>https://scifaro.com/en/abs/resource-adaptive-agents-in-interactive-theorem-proving-0901.3585</loc><lastmod>2009-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-adaptive-agents-in-interactive-theorem-proving-0901.3585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-adaptive-agents-in-interactive-theorem-proving-0901.3585"/></url>
<url><loc>https://scifaro.com/en/abs/on-recognizable-languages-of-infinite-pictures-0901.3828</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-recognizable-languages-of-infinite-pictures-0901.3828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-recognizable-languages-of-infinite-pictures-0901.3828"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-to-handle-linear-temporal-properties-in-omega-regular-model-checking-0901.4080</loc><lastmod>2009-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-to-handle-linear-temporal-properties-in-omega-regular-model-checking-0901.4080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-to-handle-linear-temporal-properties-in-omega-regular-model-checking-0901.4080"/></url>
<url><loc>https://scifaro.com/en/abs/neighbourhood-structures-bisimilarity-and-basic-model-theory-0901.4430</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighbourhood-structures-bisimilarity-and-basic-model-theory-0901.4430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighbourhood-structures-bisimilarity-and-basic-model-theory-0901.4430"/></url>
<url><loc>https://scifaro.com/en/abs/square-root-meadows-0901.4664</loc><lastmod>2009-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/square-root-meadows-0901.4664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/square-root-meadows-0901.4664"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-automata-which-includes-both-classical-and-quantum-entities-0901.4754</loc><lastmod>2009-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-automata-which-includes-both-classical-and-quantum-entities-0901.4754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-automata-which-includes-both-classical-and-quantum-entities-0901.4754"/></url>
<url><loc>https://scifaro.com/en/abs/cut-simulation-and-impredicativity-0902.0043</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-simulation-and-impredicativity-0902.0043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-simulation-and-impredicativity-0902.0043"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-datalog-on-linear-orders-0902.1179</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-datalog-on-linear-orders-0902.1179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-datalog-on-linear-orders-0902.1179"/></url>
<url><loc>https://scifaro.com/en/abs/forward-analysis-for-wsts-part-i-completions-0902.1587</loc><lastmod>2009-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-i-completions-0902.1587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-i-completions-0902.1587"/></url>
<url><loc>https://scifaro.com/en/abs/strong-completeness-of-coalgebraic-modal-logics-0902.2072</loc><lastmod>2009-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-completeness-of-coalgebraic-modal-logics-0902.2072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-completeness-of-coalgebraic-modal-logics-0902.2072"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-size-analysis-of-first-order-shapely-functions-0902.2073</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-size-analysis-of-first-order-shapely-functions-0902.2073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-size-analysis-of-first-order-shapely-functions-0902.2073"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-decision-procedure-for-full-coalitional-multiagent-temporal-epistemic-logic-of-linear-time-0902.2104</loc><lastmod>2019-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-full-coalitional-multiagent-temporal-epistemic-logic-of-linear-time-0902.2104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-full-coalitional-multiagent-temporal-epistemic-logic-of-linear-time-0902.2104"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-procedure-for-deciding-satisfiability-in-the-full-coalitional-multiagent-epistemic-logic-0902.2125</loc><lastmod>2009-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-procedure-for-deciding-satisfiability-in-the-full-coalitional-multiagent-epistemic-logic-0902.2125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-procedure-for-deciding-satisfiability-in-the-full-coalitional-multiagent-epistemic-logic-0902.2125"/></url>
<url><loc>https://scifaro.com/en/abs/a-formally-verified-compiler-back-end-0902.2137</loc><lastmod>2009-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formally-verified-compiler-back-end-0902.2137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formally-verified-compiler-back-end-0902.2137"/></url>
<url><loc>https://scifaro.com/en/abs/ptarithmetic-0902.2969</loc><lastmod>2013-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ptarithmetic-0902.2969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ptarithmetic-0902.2969"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-meta-theorems-0902.3616</loc><lastmod>2009-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-meta-theorems-0902.3616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-meta-theorems-0902.3616"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimalistic-look-at-widening-operators-0902.3722</loc><lastmod>2009-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimalistic-look-at-widening-operators-0902.3722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimalistic-look-at-widening-operators-0902.3722"/></url>
<url><loc>https://scifaro.com/en/abs/why-would-you-trust-b-0902.3858</loc><lastmod>2009-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/why-would-you-trust-b-0902.3858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/why-would-you-trust-b-0902.3858"/></url>
<url><loc>https://scifaro.com/en/abs/a-few-remarks-about-formal-development-of-secure-systems-0902.3861</loc><lastmod>2009-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-few-remarks-about-formal-development-of-secure-systems-0902.3861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-few-remarks-about-formal-development-of-secure-systems-0902.3861"/></url>
<url><loc>https://scifaro.com/en/abs/yet-another-deep-embedding-of-b-extending-de-bruijn-notations-0902.3865</loc><lastmod>2009-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/yet-another-deep-embedding-of-b-extending-de-bruijn-notations-0902.3865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/yet-another-deep-embedding-of-b-extending-de-bruijn-notations-0902.3865"/></url>
<url><loc>https://scifaro.com/en/abs/antichains-for-the-automata-based-approach-to-model-checking-0902.3958</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/antichains-for-the-automata-based-approach-to-model-checking-0902.3958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/antichains-for-the-automata-based-approach-to-model-checking-0902.3958"/></url>
<url><loc>https://scifaro.com/en/abs/on-ground-word-problem-of-term-equation-systems-0902.4348</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-ground-word-problem-of-term-equation-systems-0902.4348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-ground-word-problem-of-term-equation-systems-0902.4348"/></url>
<url><loc>https://scifaro.com/en/abs/lectures-on-jacques-herbrand-as-a-logician-0902.4682</loc><lastmod>2014-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lectures-on-jacques-herbrand-as-a-logician-0902.4682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lectures-on-jacques-herbrand-as-a-logician-0902.4682"/></url>
<url><loc>https://scifaro.com/en/abs/degrees-of-undecidability-in-rewriting-0902.4723</loc><lastmod>2009-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degrees-of-undecidability-in-rewriting-0902.4723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degrees-of-undecidability-in-rewriting-0902.4723"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-finite-meadows-0903.1196</loc><lastmod>2009-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-finite-meadows-0903.1196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-finite-meadows-0903.1196"/></url>
<url><loc>https://scifaro.com/en/abs/the-omega-rule-is-mathbf-pi-1-1-complete-in-the-lambda-beta-calculus-0903.1374</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-omega-rule-is-mathbf-pi-1-1-complete-in-the-lambda-beta-calculus-0903.1374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-omega-rule-is-mathbf-pi-1-1-complete-in-the-lambda-beta-calculus-0903.1374"/></url>
<url><loc>https://scifaro.com/en/abs/continuation-passing-style-and-strong-normalisation-for-intuitionistic-sequent-calculi-0903.1822</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuation-passing-style-and-strong-normalisation-for-intuitionistic-sequent-calculi-0903.1822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuation-passing-style-and-strong-normalisation-for-intuitionistic-sequent-calculi-0903.1822"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semi-lattices-induced-by-continuous-reducibilities-0903.2177</loc><lastmod>2010-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semi-lattices-induced-by-continuous-reducibilities-0903.2177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semi-lattices-induced-by-continuous-reducibilities-0903.2177"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-logics-and-equivalences-for-probabilistic-systems-0903.2445</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-logics-and-equivalences-for-probabilistic-systems-0903.2445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-logics-and-equivalences-for-probabilistic-systems-0903.2445"/></url>
<url><loc>https://scifaro.com/en/abs/positive-logic-with-adjoint-modalities-proof-theory-semantics-and-reasoning-about-information-0903.2448</loc><lastmod>2009-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-logic-with-adjoint-modalities-proof-theory-semantics-and-reasoning-about-information-0903.2448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-logic-with-adjoint-modalities-proof-theory-semantics-and-reasoning-about-information-0903.2448"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-policy-language-for-history-based-transaction-monitoring-0903.2904</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-policy-language-for-history-based-transaction-monitoring-0903.2904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-policy-language-for-history-based-transaction-monitoring-0903.2904"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-calculus-with-finitary-comprehended-terms-0903.2914</loc><lastmod>2013-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-calculus-with-finitary-comprehended-terms-0903.2914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-calculus-with-finitary-comprehended-terms-0903.2914"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-framework-for-reasoning-about-dynamic-networks-of-infinite-state-processes-0903.3126</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-framework-for-reasoning-about-dynamic-networks-of-infinite-state-processes-0903.3126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-framework-for-reasoning-about-dynamic-networks-of-infinite-state-processes-0903.3126"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-effect-categories-are-freyd-categories-0903.3311</loc><lastmod>2009-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-effect-categories-are-freyd-categories-0903.3311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-effect-categories-are-freyd-categories-0903.3311"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-f-accounting-for-scalars-0903.3741</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-f-accounting-for-scalars-0903.3741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-f-accounting-for-scalars-0903.3741"/></url>
<url><loc>https://scifaro.com/en/abs/using-structural-recursion-for-corecursion-0903.3850</loc><lastmod>2009-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-structural-recursion-for-corecursion-0903.3850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-structural-recursion-for-corecursion-0903.3850"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-fractran-and-productivity-0903.4366</loc><lastmod>2009-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-fractran-and-productivity-0903.4366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-fractran-and-productivity-0903.4366"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-functions-for-size-change-termination-ii-0903.4382</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-functions-for-size-change-termination-ii-0903.4382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-functions-for-size-change-termination-ii-0903.4382"/></url>
<url><loc>https://scifaro.com/en/abs/on-decidability-properties-of-one-dimensional-cellular-automata-0903.4615</loc><lastmod>2010-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-decidability-properties-of-one-dimensional-cellular-automata-0903.4615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-decidability-properties-of-one-dimensional-cellular-automata-0903.4615"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iv-the-exponentials-and-decomposition-0903.5259</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iv-the-exponentials-and-decomposition-0903.5259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iv-the-exponentials-and-decomposition-0903.5259"/></url>
<url><loc>https://scifaro.com/en/abs/on-solving-boolean-multilevel-optimization-problems-0904.0019</loc><lastmod>2009-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-solving-boolean-multilevel-optimization-problems-0904.0019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-solving-boolean-multilevel-optimization-problems-0904.0019"/></url>
<url><loc>https://scifaro.com/en/abs/ccs-based-dynamic-logics-for-communicating-concurrent-programs-0904.0034</loc><lastmod>2009-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ccs-based-dynamic-logics-for-communicating-concurrent-programs-0904.0034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ccs-based-dynamic-logics-for-communicating-concurrent-programs-0904.0034"/></url>
<url><loc>https://scifaro.com/en/abs/the-derivational-complexity-induced-by-the-dependency-pair-method-0904.0570</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-derivational-complexity-induced-by-the-dependency-pair-method-0904.0570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-derivational-complexity-induced-by-the-dependency-pair-method-0904.0570"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-description-logic-reasoning-in-prolog-the-dlog-system-0904.0578</loc><lastmod>2009-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-description-logic-reasoning-in-prolog-the-dlog-system-0904.0578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-description-logic-reasoning-in-prolog-the-dlog-system-0904.0578"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-linguistic-logic-programming-and-its-applications-0904.0589</loc><lastmod>2009-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-linguistic-logic-programming-and-its-applications-0904.0589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-linguistic-logic-programming-and-its-applications-0904.0589"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-tableau-decision-procedures-for-pdl-0904.0721</loc><lastmod>2011-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-tableau-decision-procedures-for-pdl-0904.0721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-tableau-decision-procedures-for-pdl-0904.0721"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-pairs-and-polynomial-path-orders-0904.0981</loc><lastmod>2011-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-pairs-and-polynomial-path-orders-0904.0981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-pairs-and-polynomial-path-orders-0904.0981"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterised-intractability-of-monadic-second-order-logic-0904.1302</loc><lastmod>2009-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterised-intractability-of-monadic-second-order-logic-0904.1302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterised-intractability-of-monadic-second-order-logic-0904.1302"/></url>
<url><loc>https://scifaro.com/en/abs/computing-stuttering-simulations-0904.1488</loc><lastmod>2009-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-stuttering-simulations-0904.1488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-stuttering-simulations-0904.1488"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-word-problem-for-sp-categories-and-the-properties-of-two-way-communication-0904.1529</loc><lastmod>2009-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-word-problem-for-sp-categories-and-the-properties-of-two-way-communication-0904.1529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-word-problem-for-sp-categories-and-the-properties-of-two-way-communication-0904.1529"/></url>
<url><loc>https://scifaro.com/en/abs/the-star-height-hierarchy-vs-the-variable-hierarchy-0904.1701</loc><lastmod>2009-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-star-height-hierarchy-vs-the-variable-hierarchy-0904.1701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-star-height-hierarchy-vs-the-variable-hierarchy-0904.1701"/></url>
<url><loc>https://scifaro.com/en/abs/on-distributed-model-checking-of-mso-on-graphs-0904.1902</loc><lastmod>2009-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-distributed-model-checking-of-mso-on-graphs-0904.1902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-distributed-model-checking-of-mso-on-graphs-0904.1902"/></url>
<url><loc>https://scifaro.com/en/abs/logical-locality-entails-frugal-distributed-computation-over-graphs-0904.1915</loc><lastmod>2009-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-locality-entails-frugal-distributed-computation-over-graphs-0904.1915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-locality-entails-frugal-distributed-computation-over-graphs-0904.1915"/></url>
<url><loc>https://scifaro.com/en/abs/on-stratified-regions-0904.2076</loc><lastmod>2010-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-stratified-regions-0904.2076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-stratified-regions-0904.2076"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-fairness-in-testing-semantics-0904.2340</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-fairness-in-testing-semantics-0904.2340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-fairness-in-testing-semantics-0904.2340"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-theoretic-solution-of-recursive-program-schemes-0904.2385</loc><lastmod>2011-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-theoretic-solution-of-recursive-program-schemes-0904.2385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-theoretic-solution-of-recursive-program-schemes-0904.2385"/></url>
<url><loc>https://scifaro.com/en/abs/universal-structures-and-the-logic-of-forbidden-patterns-0904.2521</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-structures-and-the-logic-of-forbidden-patterns-0904.2521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-structures-and-the-logic-of-forbidden-patterns-0904.2521"/></url>
<url><loc>https://scifaro.com/en/abs/better-quality-in-synthesis-through-quantitative-objectives-0904.2638</loc><lastmod>2013-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-quality-in-synthesis-through-quantitative-objectives-0904.2638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-quality-in-synthesis-through-quantitative-objectives-0904.2638"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-linear-logic-revisited-0904.2675</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-linear-logic-revisited-0904.2675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-linear-logic-revisited-0904.2675"/></url>
<url><loc>https://scifaro.com/en/abs/on-fo2-quantifier-alternation-over-words-0904.2894</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-fo2-quantifier-alternation-over-words-0904.2894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-fo2-quantifier-alternation-over-words-0904.2894"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-robustness-in-logic-programs-0904.3036</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-robustness-in-logic-programs-0904.3036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-robustness-in-logic-programs-0904.3036"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distributed-evaluation-of-recursive-queries-over-graphs-0904.3157</loc><lastmod>2009-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distributed-evaluation-of-recursive-queries-over-graphs-0904.3157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distributed-evaluation-of-recursive-queries-over-graphs-0904.3157"/></url>
<url><loc>https://scifaro.com/en/abs/toggling-operators-in-computability-logic-0904.3469</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toggling-operators-in-computability-logic-0904.3469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toggling-operators-in-computability-logic-0904.3469"/></url>
<url><loc>https://scifaro.com/en/abs/on-using-floating-point-computations-to-help-an-exact-linear-arithmetic-decision-procedure-0904.3525</loc><lastmod>2009-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-using-floating-point-computations-to-help-an-exact-linear-arithmetic-decision-procedure-0904.3525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-using-floating-point-computations-to-help-an-exact-linear-arithmetic-decision-procedure-0904.3525"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-linear-programs-with-nonlinear-constraints-0904.3588</loc><lastmod>2009-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-linear-programs-with-nonlinear-constraints-0904.3588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-linear-programs-with-nonlinear-constraints-0904.3588"/></url>
<url><loc>https://scifaro.com/en/abs/formally-specifying-and-proving-operational-aspects-of-forensic-lucid-in-isabelle-0904.3789</loc><lastmod>2009-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-specifying-and-proving-operational-aspects-of-forensic-lucid-in-isabelle-0904.3789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-specifying-and-proving-operational-aspects-of-forensic-lucid-in-isabelle-0904.3789"/></url>
<url><loc>https://scifaro.com/en/abs/two-way-unary-temporal-logic-over-trees-0904.4119</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-way-unary-temporal-logic-over-trees-0904.4119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-way-unary-temporal-logic-over-trees-0904.4119"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-syntactic-logic-expressions-for-optimization-problems-and-duality-using-lagrangian-dual-to-characterize-optimality-conditions-0904.4331</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-syntactic-logic-expressions-for-optimization-problems-and-duality-using-lagrangian-dual-to-characterize-optimality-conditions-0904.4331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-syntactic-logic-expressions-for-optimization-problems-and-duality-using-lagrangian-dual-to-characterize-optimality-conditions-0904.4331"/></url>
<url><loc>https://scifaro.com/en/abs/models-and-theories-of-lambda-calculus-0904.4756</loc><lastmod>2009-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-and-theories-of-lambda-calculus-0904.4756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-and-theories-of-lambda-calculus-0904.4756"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-reachability-using-first-order-logic-with-applications-to-verification-of-linked-data-structures-0904.4902</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-reachability-using-first-order-logic-with-applications-to-verification-of-linked-data-structures-0904.4902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-reachability-using-first-order-logic-with-applications-to-verification-of-linked-data-structures-0904.4902"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-0905.2195</loc><lastmod>2009-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-0905.2195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-0905.2195"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-complexity-of-the-satisfiability-problem-for-graded-modal-logics-0905.3108</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-complexity-of-the-satisfiability-problem-for-graded-modal-logics-0905.3108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-complexity-of-the-satisfiability-problem-for-graded-modal-logics-0905.3108"/></url>
<url><loc>https://scifaro.com/en/abs/lindstrom-theorems-for-fragments-of-first-order-logic-0905.3668</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lindstrom-theorems-for-fragments-of-first-order-logic-0905.3668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lindstrom-theorems-for-fragments-of-first-order-logic-0905.3668"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-identifying-head-elementary-set-free-programs-0905.3802</loc><lastmod>2009-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-identifying-head-elementary-set-free-programs-0905.3802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-identifying-head-elementary-set-free-programs-0905.3802"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-transformers-and-linear-logic-yet-another-denotational-model-0905.3998</loc><lastmod>2009-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-transformers-and-linear-logic-yet-another-denotational-model-0905.3998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-transformers-and-linear-logic-yet-another-denotational-model-0905.3998"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-and-finiteness-spaces-0905.4059</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-and-finiteness-spaces-0905.4059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-and-finiteness-spaces-0905.4059"/></url>
<url><loc>https://scifaro.com/en/abs/a-completeness-theorem-for-total-boolean-functions-0905.4060</loc><lastmod>2009-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-completeness-theorem-for-total-boolean-functions-0905.4060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-completeness-theorem-for-total-boolean-functions-0905.4060"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-systems-and-linear-logic-a-different-games-semantics-0905.4062</loc><lastmod>2009-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-systems-and-linear-logic-a-different-games-semantics-0905.4062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-systems-and-linear-logic-a-different-games-semantics-0905.4062"/></url>
<url><loc>https://scifaro.com/en/abs/programming-interfaces-and-basic-topology-0905.4063</loc><lastmod>2009-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programming-interfaces-and-basic-topology-0905.4063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programming-interfaces-and-basic-topology-0905.4063"/></url>
<url><loc>https://scifaro.com/en/abs/contraction-free-proofs-and-finitary-games-for-linear-logic-0905.4064</loc><lastmod>2009-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contraction-free-proofs-and-finitary-games-for-linear-logic-0905.4064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contraction-free-proofs-and-finitary-games-for-linear-logic-0905.4064"/></url>
<url><loc>https://scifaro.com/en/abs/synchronous-games-simulations-and-lambda-calculus-0905.4066</loc><lastmod>2009-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronous-games-simulations-and-lambda-calculus-0905.4066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronous-games-simulations-and-lambda-calculus-0905.4066"/></url>
<url><loc>https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0905.4090</loc><lastmod>2009-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0905.4090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0905.4090"/></url>
<url><loc>https://scifaro.com/en/abs/variable-binding-symmetric-monoidal-closed-theories-and-bigraphs-0905.4200</loc><lastmod>2009-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-binding-symmetric-monoidal-closed-theories-and-bigraphs-0905.4200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-binding-symmetric-monoidal-closed-theories-and-bigraphs-0905.4200"/></url>
<url><loc>https://scifaro.com/en/abs/execution-time-of-lambda-terms-via-denotational-semantics-and-intersection-types-0905.4251</loc><lastmod>2009-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/execution-time-of-lambda-terms-via-denotational-semantics-and-intersection-types-0905.4251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/execution-time-of-lambda-terms-via-denotational-semantics-and-intersection-types-0905.4251"/></url>
<url><loc>https://scifaro.com/en/abs/on-expressive-power-and-class-invariance-0905.4332</loc><lastmod>2009-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-expressive-power-and-class-invariance-0905.4332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-expressive-power-and-class-invariance-0905.4332"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-results-for-a-quantum-lambda-calculus-with-measurements-0905.4567</loc><lastmod>2009-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-results-for-a-quantum-lambda-calculus-with-measurements-0905.4567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-results-for-a-quantum-lambda-calculus-with-measurements-0905.4567"/></url>
<url><loc>https://scifaro.com/en/abs/straight-line-instruction-sequence-completeness-for-total-calculation-on-cancellation-meadows-0905.4612</loc><lastmod>2009-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/straight-line-instruction-sequence-completeness-for-total-calculation-on-cancellation-meadows-0905.4612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/straight-line-instruction-sequence-completeness-for-total-calculation-on-cancellation-meadows-0905.4612"/></url>
<url><loc>https://scifaro.com/en/abs/aspects-regarding-operations-with-fuzzy-processes-0905.4905</loc><lastmod>2009-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aspects-regarding-operations-with-fuzzy-processes-0905.4905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aspects-regarding-operations-with-fuzzy-processes-0905.4905"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-manipulations-with-fuzzy-processes-0905.4906</loc><lastmod>2009-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-manipulations-with-fuzzy-processes-0905.4906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-manipulations-with-fuzzy-processes-0905.4906"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automated-deduction-in-blackmail-case-analysis-with-forensic-lucid-0906.0049</loc><lastmod>2009-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automated-deduction-in-blackmail-case-analysis-with-forensic-lucid-0906.0049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automated-deduction-in-blackmail-case-analysis-with-forensic-lucid-0906.0049"/></url>
<url><loc>https://scifaro.com/en/abs/observational-equivalence-and-full-abstraction-in-the-symmetric-interaction-combinators-0906.0380</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observational-equivalence-and-full-abstraction-in-the-symmetric-interaction-combinators-0906.0380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observational-equivalence-and-full-abstraction-in-the-symmetric-interaction-combinators-0906.0380"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-of-ground-reachability-problems-for-cryptographic-protocols-extended-version-0906.1199</loc><lastmod>2009-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-of-ground-reachability-problems-for-cryptographic-protocols-extended-version-0906.1199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-of-ground-reachability-problems-for-cryptographic-protocols-extended-version-0906.1199"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-fragments-of-hybrid-logic-part-i-0906.1489</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-fragments-of-hybrid-logic-part-i-0906.1489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-fragments-of-hybrid-logic-part-i-0906.1489"/></url>
<url><loc>https://scifaro.com/en/abs/classical-predicative-logic-enriched-type-theories-0906.1726</loc><lastmod>2010-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-predicative-logic-enriched-type-theories-0906.1726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-predicative-logic-enriched-type-theories-0906.1726"/></url>
<url><loc>https://scifaro.com/en/abs/from-formulas-to-cirquents-in-computability-logic-0906.2154</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-formulas-to-cirquents-in-computability-logic-0906.2154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-formulas-to-cirquents-in-computability-logic-0906.2154"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-equilibrium-logic-and-nested-logic-programs-reductions-and-complexity-0906.2228</loc><lastmod>2009-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-equilibrium-logic-and-nested-logic-programs-reductions-and-complexity-0906.2228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-equilibrium-logic-and-nested-logic-programs-reductions-and-complexity-0906.2228"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-branching-time-logics-0906.2521</loc><lastmod>2009-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-branching-time-logics-0906.2521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-branching-time-logics-0906.2521"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hybrid-extension-of-ctl-and-ctl-0906.2541</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hybrid-extension-of-ctl-and-ctl-0906.2541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hybrid-extension-of-ctl-and-ctl-0906.2541"/></url>
<url><loc>https://scifaro.com/en/abs/busy-beavers-gone-wild-0906.3257</loc><lastmod>2009-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/busy-beavers-gone-wild-0906.3257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/busy-beavers-gone-wild-0906.3257"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-rules-with-well-founded-semantics-0906.3815</loc><lastmod>2010-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-rules-with-well-founded-semantics-0906.3815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-rules-with-well-founded-semantics-0906.3815"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-theory-for-higher-order-intensional-logic-support-for-variable-bindings-in-hybrid-intensional-imperative-programs-in-gipsy-0906.3919</loc><lastmod>2009-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-theory-for-higher-order-intensional-logic-support-for-variable-bindings-in-hybrid-intensional-imperative-programs-in-gipsy-0906.3919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-theory-for-higher-order-intensional-logic-support-for-variable-bindings-in-hybrid-intensional-imperative-programs-in-gipsy-0906.3919"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-testing-semantics-for-non-interleaving-0906.3994</loc><lastmod>2009-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-testing-semantics-for-non-interleaving-0906.3994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-testing-semantics-for-non-interleaving-0906.3994"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relation-between-size-based-termination-and-semantic-labelling-0906.4173</loc><lastmod>2009-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relation-between-size-based-termination-and-semantic-labelling-0906.4173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relation-between-size-based-termination-and-semantic-labelling-0906.4173"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-definition-of-non-deterministic-mechanisms-0906.4216</loc><lastmod>2009-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-definition-of-non-deterministic-mechanisms-0906.4216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-definition-of-non-deterministic-mechanisms-0906.4216"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-based-synthesis-of-distributed-systems-using-event-structures-0906.4315</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-based-synthesis-of-distributed-systems-using-event-structures-0906.4315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-based-synthesis-of-distributed-systems-using-event-structures-0906.4315"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-generation-of-craig-interpolants-in-satisfiability-modulo-theories-0906.4492</loc><lastmod>2009-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-generation-of-craig-interpolants-in-satisfiability-modulo-theories-0906.4492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-generation-of-craig-interpolants-in-satisfiability-modulo-theories-0906.4492"/></url>
<url><loc>https://scifaro.com/en/abs/on-relaxing-metric-information-in-linear-temporal-logic-0906.4711</loc><lastmod>2013-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-relaxing-metric-information-in-linear-temporal-logic-0906.4711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-relaxing-metric-information-in-linear-temporal-logic-0906.4711"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-a-simulated-printer-case-investigation-with-forensic-lucid-0906.5181</loc><lastmod>2013-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-a-simulated-printer-case-investigation-with-forensic-lucid-0906.5181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-a-simulated-printer-case-investigation-with-forensic-lucid-0906.5181"/></url>
<url><loc>https://scifaro.com/en/abs/common-knowledge-in-interaction-structures-0907.0403</loc><lastmod>2009-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-knowledge-in-interaction-structures-0907.0403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-knowledge-in-interaction-structures-0907.0403"/></url>
<url><loc>https://scifaro.com/en/abs/structure-theorem-and-strict-alternation-hierarchy-for-fo-2-on-words-0907.0616</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-theorem-and-strict-alternation-hierarchy-for-fo-2-on-words-0907.0616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-theorem-and-strict-alternation-hierarchy-for-fo-2-on-words-0907.0616"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-reduction-of-program-verification-conditions-0907.1357</loc><lastmod>2011-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-reduction-of-program-verification-conditions-0907.1357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-reduction-of-program-verification-conditions-0907.1357"/></url>
<url><loc>https://scifaro.com/en/abs/testing-probabilistic-processes-can-random-choices-be-unobservable-0907.1540</loc><lastmod>2009-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-probabilistic-processes-can-random-choices-be-unobservable-0907.1540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-probabilistic-processes-can-random-choices-be-unobservable-0907.1540"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-concurrency-with-comtraces-and-generalized-comtraces-0907.1722</loc><lastmod>2011-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-concurrency-with-comtraces-and-generalized-comtraces-0907.1722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-concurrency-with-comtraces-and-generalized-comtraces-0907.1722"/></url>
<url><loc>https://scifaro.com/en/abs/rational-synthesis-0907.3019</loc><lastmod>2009-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-synthesis-0907.3019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-synthesis-0907.3019"/></url>
<url><loc>https://scifaro.com/en/abs/a-metric-encoding-for-bounded-model-checking-extended-version-0907.3085</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-metric-encoding-for-bounded-model-checking-extended-version-0907.3085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-metric-encoding-for-bounded-model-checking-extended-version-0907.3085"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-timed-automata-using-rewrite-rules-and-strategies-0907.3123</loc><lastmod>2009-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-timed-automata-using-rewrite-rules-and-strategies-0907.3123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-timed-automata-using-rewrite-rules-and-strategies-0907.3123"/></url>
<url><loc>https://scifaro.com/en/abs/from-causal-semantics-to-duration-timed-models-0907.3226</loc><lastmod>2010-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-causal-semantics-to-duration-timed-models-0907.3226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-causal-semantics-to-duration-timed-models-0907.3226"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-oracle-queries-in-type-2-machines-extended-abstract-0907.3230</loc><lastmod>2009-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-oracle-queries-in-type-2-machines-extended-abstract-0907.3230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-oracle-queries-in-type-2-machines-extended-abstract-0907.3230"/></url>
<url><loc>https://scifaro.com/en/abs/gentzen-prawitz-natural-deduction-as-a-teaching-tool-0907.3599</loc><lastmod>2009-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gentzen-prawitz-natural-deduction-as-a-teaching-tool-0907.3599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gentzen-prawitz-natural-deduction-as-a-teaching-tool-0907.3599"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-higher-order-matching-0907.3804</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-higher-order-matching-0907.3804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-higher-order-matching-0907.3804"/></url>
<url><loc>https://scifaro.com/en/abs/modular-verification-of-recursive-programs-0907.4316</loc><lastmod>2009-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-verification-of-recursive-programs-0907.4316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-verification-of-recursive-programs-0907.4316"/></url>
<url><loc>https://scifaro.com/en/abs/clone-theory-and-algebraic-logic-0907.4531</loc><lastmod>2009-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clone-theory-and-algebraic-logic-0907.4531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clone-theory-and-algebraic-logic-0907.4531"/></url>
<url><loc>https://scifaro.com/en/abs/integrated-modeling-and-verification-of-real-time-systems-through-multiple-paradigms-0907.5074</loc><lastmod>2013-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrated-modeling-and-verification-of-real-time-systems-through-multiple-paradigms-0907.5074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrated-modeling-and-verification-of-real-time-systems-through-multiple-paradigms-0907.5074"/></url>
<url><loc>https://scifaro.com/en/abs/rewrite-based-verification-of-xml-updates-0907.5125</loc><lastmod>2009-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewrite-based-verification-of-xml-updates-0907.5125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewrite-based-verification-of-xml-updates-0907.5125"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-at-work-complexity-analysis-of-term-rewrite-systems-0907.5527</loc><lastmod>2009-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-at-work-complexity-analysis-of-term-rewrite-systems-0907.5527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-at-work-complexity-analysis-of-term-rewrite-systems-0907.5527"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-the-semantics-of-functional-logic-programming-in-isabelle-0908.0494</loc><lastmod>2009-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-the-semantics-of-functional-logic-programming-in-isabelle-0908.0494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-the-semantics-of-functional-logic-programming-in-isabelle-0908.0494"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-abstraction-0908.1390</loc><lastmod>2010-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-abstraction-0908.1390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-abstraction-0908.1390"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-metric-coinduction-0908.2793</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-metric-coinduction-0908.2793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-metric-coinduction-0908.2793"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterization-process-as-a-categorical-construction-0908.3634</loc><lastmod>2009-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterization-process-as-a-categorical-construction-0908.3634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterization-process-as-a-categorical-construction-0908.3634"/></url>
<url><loc>https://scifaro.com/en/abs/diagrammatic-logic-applied-to-a-parameterization-process-0908.3737</loc><lastmod>2009-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagrammatic-logic-applied-to-a-parameterization-process-0908.3737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagrammatic-logic-applied-to-a-parameterization-process-0908.3737"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-first-order-causality-0908.3994</loc><lastmod>2009-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-first-order-causality-0908.3994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-first-order-causality-0908.3994"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterization-process-functorially-0908.4491</loc><lastmod>2009-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterization-process-functorially-0908.4491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterization-process-functorially-0908.4491"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-extension-and-canonicity-via-dcpo-presentations-0909.0171</loc><lastmod>2012-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-extension-and-canonicity-via-dcpo-presentations-0909.0171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-extension-and-canonicity-via-dcpo-presentations-0909.0171"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problems-for-turing-machines-0909.0736</loc><lastmod>2009-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problems-for-turing-machines-0909.0736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problems-for-turing-machines-0909.0736"/></url>
<url><loc>https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0909.1102</loc><lastmod>2009-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0909.1102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0909.1102"/></url>
<url><loc>https://scifaro.com/en/abs/a-rich-hierarchy-of-functionals-of-finite-types-0909.1198</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rich-hierarchy-of-functionals-of-finite-types-0909.1198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rich-hierarchy-of-functionals-of-finite-types-0909.1198"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-analysis-of-partially-observable-markov-decision-processes-0909.1645</loc><lastmod>2015-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-analysis-of-partially-observable-markov-decision-processes-0909.1645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-analysis-of-partially-observable-markov-decision-processes-0909.1645"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-weighted-automata-0909.1647</loc><lastmod>2009-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-weighted-automata-0909.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-weighted-automata-0909.1647"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-data-objects-with-initial-algebras-0909.3596</loc><lastmod>2009-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-data-objects-with-initial-algebras-0909.3596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-data-objects-with-initial-algebras-0909.3596"/></url>
<url><loc>https://scifaro.com/en/abs/a-better-reduction-theorem-for-store-buffers-0909.4637</loc><lastmod>2009-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-better-reduction-theorem-for-store-buffers-0909.4637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-better-reduction-theorem-for-store-buffers-0909.4637"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-sn-from-psn-a-general-proof-technique-0909.5045</loc><lastmod>2009-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-sn-from-psn-a-general-proof-technique-0909.5045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-sn-from-psn-a-general-proof-technique-0909.5045"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-scope-of-the-universal-algebraic-approach-to-constraint-satisfaction-0909.5097</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-scope-of-the-universal-algebraic-approach-to-constraint-satisfaction-0909.5097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-scope-of-the-universal-algebraic-approach-to-constraint-satisfaction-0909.5097"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-full-wave-rectifier-a-case-study-0909.5393</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-full-wave-rectifier-a-case-study-0909.5393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-full-wave-rectifier-a-case-study-0909.5393"/></url>
<url><loc>https://scifaro.com/en/abs/acceptable-complexity-measures-of-theorems-0910.0045</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acceptable-complexity-measures-of-theorems-0910.0045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acceptable-complexity-measures-of-theorems-0910.0045"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-specifying-prototyping-and-reasoning-about-computational-systems-0910.0747</loc><lastmod>2009-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-specifying-prototyping-and-reasoning-about-computational-systems-0910.0747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-specifying-prototyping-and-reasoning-about-computational-systems-0910.0747"/></url>
<url><loc>https://scifaro.com/en/abs/design-of-asynchronous-supervisors-0910.0868</loc><lastmod>2009-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-of-asynchronous-supervisors-0910.0868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-of-asynchronous-supervisors-0910.0868"/></url>
<url><loc>https://scifaro.com/en/abs/a-formally-specified-type-system-and-operational-semantics-for-higher-order-procedural-variables-0910.1020</loc><lastmod>2009-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formally-specified-type-system-and-operational-semantics-for-higher-order-procedural-variables-0910.1020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formally-specified-type-system-and-operational-semantics-for-higher-order-procedural-variables-0910.1020"/></url>
<url><loc>https://scifaro.com/en/abs/weak-kleene-algebra-is-sound-and-possibly-complete-for-simulation-0910.1028</loc><lastmod>2009-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-kleene-algebra-is-sound-and-possibly-complete-for-simulation-0910.1028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-kleene-algebra-is-sound-and-possibly-complete-for-simulation-0910.1028"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-infinite-computations-in-models-of-set-theory-0910.1268</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-infinite-computations-in-models-of-set-theory-0910.1268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-infinite-computations-in-models-of-set-theory-0910.1268"/></url>
<url><loc>https://scifaro.com/en/abs/a-zonotopic-framework-for-functional-abstractions-0910.1763</loc><lastmod>2009-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-zonotopic-framework-for-functional-abstractions-0910.1763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-zonotopic-framework-for-functional-abstractions-0910.1763"/></url>
<url><loc>https://scifaro.com/en/abs/decreasing-diagrams-and-relative-termination-0910.2853</loc><lastmod>2009-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decreasing-diagrams-and-relative-termination-0910.2853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decreasing-diagrams-and-relative-termination-0910.2853"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-second-order-logic-spanning-trees-and-network-flows-0910.3085</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-second-order-logic-spanning-trees-and-network-flows-0910.3085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-second-order-logic-spanning-trees-and-network-flows-0910.3085"/></url>
<url><loc>https://scifaro.com/en/abs/least-and-greatest-fixed-points-in-linear-logic-0910.3383</loc><lastmod>2010-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/least-and-greatest-fixed-points-in-linear-logic-0910.3383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/least-and-greatest-fixed-points-in-linear-logic-0910.3383"/></url>
<url><loc>https://scifaro.com/en/abs/comparison-of-algorithms-for-checking-emptiness-on-buechi-automata-0910.3766</loc><lastmod>2009-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparison-of-algorithms-for-checking-emptiness-on-buechi-automata-0910.3766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparison-of-algorithms-for-checking-emptiness-on-buechi-automata-0910.3766"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-confluence-0910.4081</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-confluence-0910.4081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-confluence-0910.4081"/></url>
<url><loc>https://scifaro.com/en/abs/a-history-of-until-0910.4500</loc><lastmod>2009-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-history-of-until-0910.4500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-history-of-until-0910.4500"/></url>
<url><loc>https://scifaro.com/en/abs/classification-with-tarskian-system-executions-bakery-algorithms-as-an-example-0910.4565</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-with-tarskian-system-executions-bakery-algorithms-as-an-example-0910.4565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-with-tarskian-system-executions-bakery-algorithms-as-an-example-0910.4565"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-metatheorems-for-decidable-ltl-model-checking-over-infinite-systems-0910.4932</loc><lastmod>2009-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-metatheorems-for-decidable-ltl-model-checking-over-infinite-systems-0910.4932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-metatheorems-for-decidable-ltl-model-checking-over-infinite-systems-0910.4932"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-and-securing-cryptographic-protocols-0910.5099</loc><lastmod>2009-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-and-securing-cryptographic-protocols-0910.5099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-and-securing-cryptographic-protocols-0910.5099"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-model-for-imperative-computation-0910.5399</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-model-for-imperative-computation-0910.5399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-model-for-imperative-computation-0910.5399"/></url>
<url><loc>https://scifaro.com/en/abs/instruction-sequence-processing-operators-0910.5564</loc><lastmod>2012-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instruction-sequence-processing-operators-0910.5564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instruction-sequence-processing-operators-0910.5564"/></url>
<url><loc>https://scifaro.com/en/abs/functions-definable-by-numerical-set-expressions-0911.0105</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functions-definable-by-numerical-set-expressions-0911.0105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functions-definable-by-numerical-set-expressions-0911.0105"/></url>
<url><loc>https://scifaro.com/en/abs/order-algebras-a-quantitative-model-of-interaction-0911.0630</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-algebras-a-quantitative-model-of-interaction-0911.0630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-algebras-a-quantitative-model-of-interaction-0911.0630"/></url>
<url><loc>https://scifaro.com/en/abs/unique-normal-forms-in-infinitary-weakly-orthogonal-term-rewriting-0911.1009</loc><lastmod>2009-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-normal-forms-in-infinitary-weakly-orthogonal-term-rewriting-0911.1009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-normal-forms-in-infinitary-weakly-orthogonal-term-rewriting-0911.1009"/></url>
<url><loc>https://scifaro.com/en/abs/from-abstract-rewriting-systems-to-abstract-proof-systems-0911.1412</loc><lastmod>2013-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-abstract-rewriting-systems-to-abstract-proof-systems-0911.1412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-abstract-rewriting-systems-to-abstract-proof-systems-0911.1412"/></url>
<url><loc>https://scifaro.com/en/abs/industrial-strength-formally-certified-sat-solving-0911.1678</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/industrial-strength-formally-certified-sat-solving-0911.1678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/industrial-strength-formally-certified-sat-solving-0911.1678"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-formulae-for-fixed-point-semantics-a-general-framework-0911.1862</loc><lastmod>2009-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-formulae-for-fixed-point-semantics-a-general-framework-0911.1862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-formulae-for-fixed-point-semantics-a-general-framework-0911.1862"/></url>
<url><loc>https://scifaro.com/en/abs/expressing-the-behavior-of-three-very-different-concurrent-systems-by-using-natural-extensions-of-separation-logic-0911.2034</loc><lastmod>2009-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressing-the-behavior-of-three-very-different-concurrent-systems-by-using-natural-extensions-of-separation-logic-0911.2034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressing-the-behavior-of-three-very-different-concurrent-systems-by-using-natural-extensions-of-separation-logic-0911.2034"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logic-and-the-approximation-induction-principle-0911.2035</loc><lastmod>2009-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logic-and-the-approximation-induction-principle-0911.2035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logic-and-the-approximation-induction-principle-0911.2035"/></url>
<url><loc>https://scifaro.com/en/abs/orthomodular-lattices-induced-by-the-concurrency-relation-0911.2319</loc><lastmod>2009-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthomodular-lattices-induced-by-the-concurrency-relation-0911.2319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthomodular-lattices-induced-by-the-concurrency-relation-0911.2319"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-required-excluded-elements-in-cls-0911.2323</loc><lastmod>2009-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-required-excluded-elements-in-cls-0911.2323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-required-excluded-elements-in-cls-0911.2323"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-of-a-bisimulation-type-faster-than-preorder-0911.2760</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-of-a-bisimulation-type-faster-than-preorder-0911.2760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-of-a-bisimulation-type-faster-than-preorder-0911.2760"/></url>
<url><loc>https://scifaro.com/en/abs/np-datalog-a-logic-language-for-expressing-np-search-and-optimization-problems-0911.2785</loc><lastmod>2009-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-datalog-a-logic-language-for-expressing-np-search-and-optimization-problems-0911.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-datalog-a-logic-language-for-expressing-np-search-and-optimization-problems-0911.2785"/></url>
<url><loc>https://scifaro.com/en/abs/a-two-level-logic-approach-to-reasoning-about-computations-0911.2993</loc><lastmod>2010-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-two-level-logic-approach-to-reasoning-about-computations-0911.2993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-two-level-logic-approach-to-reasoning-about-computations-0911.2993"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-combine-diagrammatic-logics-0911.3005</loc><lastmod>2009-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-combine-diagrammatic-logics-0911.3005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-combine-diagrammatic-logics-0911.3005"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-16th-international-workshop-on-expressiveness-in-concurrency-0911.3189</loc><lastmod>2009-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-16th-international-workshop-on-expressiveness-in-concurrency-0911.3189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-16th-international-workshop-on-expressiveness-in-concurrency-0911.3189"/></url>
<url><loc>https://scifaro.com/en/abs/bifinite-chu-spaces-0911.3214</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bifinite-chu-spaces-0911.3214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bifinite-chu-spaces-0911.3214"/></url>
<url><loc>https://scifaro.com/en/abs/automated-predicate-abstraction-for-real-time-models-0911.3277</loc><lastmod>2009-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-predicate-abstraction-for-real-time-models-0911.3277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-predicate-abstraction-for-real-time-models-0911.3277"/></url>
<url><loc>https://scifaro.com/en/abs/some-models-and-tools-for-open-systems-0911.3299</loc><lastmod>2009-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-models-and-tools-for-open-systems-0911.3299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-models-and-tools-for-open-systems-0911.3299"/></url>
<url><loc>https://scifaro.com/en/abs/dense-choice-counter-machines-revisited-0911.3405</loc><lastmod>2009-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dense-choice-counter-machines-revisited-0911.3405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dense-choice-counter-machines-revisited-0911.3405"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-international-workshop-on-verification-of-infinite-state-systems-0911.3440</loc><lastmod>2009-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-verification-of-infinite-state-systems-0911.3440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-verification-of-infinite-state-systems-0911.3440"/></url>
<url><loc>https://scifaro.com/en/abs/graph-rewriting-with-polarized-cloning-0911.3786</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-rewriting-with-polarized-cloning-0911.3786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-rewriting-with-polarized-cloning-0911.3786"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-polynomial-time-on-interval-graphs-0911.3799</loc><lastmod>2011-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-polynomial-time-on-interval-graphs-0911.3799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-polynomial-time-on-interval-graphs-0911.3799"/></url>
<url><loc>https://scifaro.com/en/abs/a-computational-definition-of-the-notion-of-vectorial-space-0911.4051</loc><lastmod>2009-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computational-definition-of-the-notion-of-vectorial-space-0911.4051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computational-definition-of-the-notion-of-vectorial-space-0911.4051"/></url>
<url><loc>https://scifaro.com/en/abs/covering-of-ordinals-0911.4792</loc><lastmod>2010-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-of-ordinals-0911.4792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-of-ordinals-0911.4792"/></url>
<url><loc>https://scifaro.com/en/abs/o-minimal-hybrid-reachability-games-0911.4833</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/o-minimal-hybrid-reachability-games-0911.4833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/o-minimal-hybrid-reachability-games-0911.4833"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-interpretation-for-probabilistic-termination-of-biological-systems-0911.4988</loc><lastmod>2009-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-interpretation-for-probabilistic-termination-of-biological-systems-0911.4988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-interpretation-for-probabilistic-termination-of-biological-systems-0911.4988"/></url>
<url><loc>https://scifaro.com/en/abs/autosolvability-of-halting-problem-instances-for-instruction-sequences-0911.5018</loc><lastmod>2010-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autosolvability-of-halting-problem-instances-for-instruction-sequences-0911.5018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autosolvability-of-halting-problem-instances-for-instruction-sequences-0911.5018"/></url>
<url><loc>https://scifaro.com/en/abs/complex-algebras-of-arithmetic-0911.5246</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complex-algebras-of-arithmetic-0911.5246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complex-algebras-of-arithmetic-0911.5246"/></url>
<url><loc>https://scifaro.com/en/abs/coordination-via-interaction-constraints-i-local-logic-0911.5445</loc><lastmod>2009-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coordination-via-interaction-constraints-i-local-logic-0911.5445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coordination-via-interaction-constraints-i-local-logic-0911.5445"/></url>
<url><loc>https://scifaro.com/en/abs/integrated-structure-and-semantics-for-reo-connectors-and-petri-nets-0911.5447</loc><lastmod>2009-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrated-structure-and-semantics-for-reo-connectors-and-petri-nets-0911.5447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrated-structure-and-semantics-for-reo-connectors-and-petri-nets-0911.5447"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-embedding-of-graph-transformation-in-intuitionistic-linear-logic-0911.5525</loc><lastmod>2009-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-embedding-of-graph-transformation-in-intuitionistic-linear-logic-0911.5525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-embedding-of-graph-transformation-in-intuitionistic-linear-logic-0911.5525"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-sampling-for-continuous-time-metric-temporal-logic-0911.5642</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-sampling-for-continuous-time-metric-temporal-logic-0911.5642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-sampling-for-continuous-time-metric-temporal-logic-0911.5642"/></url>
<url><loc>https://scifaro.com/en/abs/answering-hilbert-s-1st-problem-0912.0228</loc><lastmod>2021-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answering-hilbert-s-1st-problem-0912.0228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answering-hilbert-s-1st-problem-0912.0228"/></url>
<url><loc>https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-0912.0419</loc><lastmod>2009-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-0912.0419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-0912.0419"/></url>
<url><loc>https://scifaro.com/en/abs/a-non-interleaving-process-calculus-for-multi-party-synchronisation-0912.0555</loc><lastmod>2009-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-non-interleaving-process-calculus-for-multi-party-synchronisation-0912.0555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-non-interleaving-process-calculus-for-multi-party-synchronisation-0912.0555"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-2nd-interaction-and-concurrency-experience-structured-interactions-0912.0759</loc><lastmod>2009-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-2nd-interaction-and-concurrency-experience-structured-interactions-0912.0759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-2nd-interaction-and-concurrency-experience-structured-interactions-0912.0759"/></url>
<url><loc>https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0912.0931</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0912.0931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthomodular-lattices-foulis-semigroups-and-dagger-kernel-categories-0912.0931"/></url>
<url><loc>https://scifaro.com/en/abs/markovian-testing-equivalence-and-exponentially-timed-internal-actions-0912.1899</loc><lastmod>2009-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markovian-testing-equivalence-and-exponentially-timed-internal-actions-0912.1899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markovian-testing-equivalence-and-exponentially-timed-internal-actions-0912.1899"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-safety-linking-proof-based-verification-with-model-checking-for-probabilistic-systems-0912.1900</loc><lastmod>2009-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-safety-linking-proof-based-verification-with-model-checking-for-probabilistic-systems-0912.1900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-safety-linking-proof-based-verification-with-model-checking-for-probabilistic-systems-0912.1900"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-clock-synchronization-in-the-chess-gmac-wsn-protocol-0912.1901</loc><lastmod>2009-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-clock-synchronization-in-the-chess-gmac-wsn-protocol-0912.1901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-clock-synchronization-in-the-chess-gmac-wsn-protocol-0912.1901"/></url>
<url><loc>https://scifaro.com/en/abs/strong-weak-and-branching-bisimulation-for-transition-systems-and-markov-reward-chains-a-unifying-matrix-approach-0912.1902</loc><lastmod>2009-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-weak-and-branching-bisimulation-for-transition-systems-and-markov-reward-chains-a-unifying-matrix-approach-0912.1902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-weak-and-branching-bisimulation-for-transition-systems-and-markov-reward-chains-a-unifying-matrix-approach-0912.1902"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-real-time-systems-using-explicit-time-description-methods-0912.1903</loc><lastmod>2009-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-real-time-systems-using-explicit-time-description-methods-0912.1903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-real-time-systems-using-explicit-time-description-methods-0912.1903"/></url>
<url><loc>https://scifaro.com/en/abs/computation-tree-logic-with-deadlock-detection-0912.2109</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-tree-logic-with-deadlock-detection-0912.2109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-tree-logic-with-deadlock-detection-0912.2109"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-quantitative-formal-methods-theory-and-applications-0912.2128</loc><lastmod>2009-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-quantitative-formal-methods-theory-and-applications-0912.2128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-quantitative-formal-methods-theory-and-applications-0912.2128"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-totality-towards-completeness-0912.2349</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-totality-towards-completeness-0912.2349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-totality-towards-completeness-0912.2349"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-branching-bisimulation-minimization-by-inductive-signatures-0912.2550</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-branching-bisimulation-minimization-by-inductive-signatures-0912.2550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-branching-bisimulation-minimization-by-inductive-signatures-0912.2550"/></url>
<url><loc>https://scifaro.com/en/abs/tarmo-a-framework-for-parallelized-bounded-model-checking-0912.2552</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tarmo-a-framework-for-parallelized-bounded-model-checking-0912.2552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tarmo-a-framework-for-parallelized-bounded-model-checking-0912.2552"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-explicit-time-description-method-for-timed-model-checking-0912.2553</loc><lastmod>2009-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-explicit-time-description-method-for-timed-model-checking-0912.2553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-explicit-time-description-method-for-timed-model-checking-0912.2553"/></url>
<url><loc>https://scifaro.com/en/abs/is-ramsey-s-theorem-omega-automatic-0912.2625</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-ramsey-s-theorem-omega-automatic-0912.2625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-ramsey-s-theorem-omega-automatic-0912.2625"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-symbolic-state-space-exploration-is-difficult-but-what-is-the-alternative-0912.2785</loc><lastmod>2009-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-symbolic-state-space-exploration-is-difficult-but-what-is-the-alternative-0912.2785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-symbolic-state-space-exploration-is-difficult-but-what-is-the-alternative-0912.2785"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-parallel-and-distributed-methods-in-verification-0912.3036</loc><lastmod>2009-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-parallel-and-distributed-methods-in-verification-0912.3036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-parallel-and-distributed-methods-in-verification-0912.3036"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-the-interval-temporal-logic-abbar-over-the-natural-numbers-0912.3429</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-the-interval-temporal-logic-abbar-over-the-natural-numbers-0912.3429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-the-interval-temporal-logic-abbar-over-the-natural-numbers-0912.3429"/></url>
<url><loc>https://scifaro.com/en/abs/configuration-structures-event-structures-and-petri-nets-0912.4023</loc><lastmod>2009-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/configuration-structures-event-structures-and-petri-nets-0912.4023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/configuration-structures-event-structures-and-petri-nets-0912.4023"/></url>
<url><loc>https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0912.4117</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0912.4117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-time-model-checking-of-one-counter-processes-0912.4117"/></url>
<url><loc>https://scifaro.com/en/abs/scope-logic-extending-hoare-logic-for-pointer-program-verification-0912.4184</loc><lastmod>2009-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scope-logic-extending-hoare-logic-for-pointer-program-verification-0912.4184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scope-logic-extending-hoare-logic-for-pointer-program-verification-0912.4184"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-modal-satisfiability-0912.4941</loc><lastmod>2009-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-modal-satisfiability-0912.4941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-modal-satisfiability-0912.4941"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-normalising-reduction-strategies-0912.4947</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-normalising-reduction-strategies-0912.4947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-combinatory-reduction-systems-normalising-reduction-strategies-0912.4947"/></url>
<url><loc>https://scifaro.com/en/abs/a-user-s-guide-to-zot-0912.5014</loc><lastmod>2009-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-user-s-guide-to-zot-0912.5014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-user-s-guide-to-zot-0912.5014"/></url>
<url><loc>https://scifaro.com/en/abs/loopw-technical-reference-v0-3-0912.5515</loc><lastmod>2010-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loopw-technical-reference-v0-3-0912.5515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loopw-technical-reference-v0-3-0912.5515"/></url>
<url><loc>https://scifaro.com/en/abs/least-and-greatest-fixpoints-in-game-semantics-1001.0641</loc><lastmod>2010-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/least-and-greatest-fixpoints-in-game-semantics-1001.0641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/least-and-greatest-fixpoints-in-game-semantics-1001.0641"/></url>
<url><loc>https://scifaro.com/en/abs/named-models-in-coalgebraic-hybrid-logic-1001.0735</loc><lastmod>2010-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/named-models-in-coalgebraic-hybrid-logic-1001.0735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/named-models-in-coalgebraic-hybrid-logic-1001.0735"/></url>
<url><loc>https://scifaro.com/en/abs/states-and-exceptions-considered-as-dual-effects-1001.1662</loc><lastmod>2011-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/states-and-exceptions-considered-as-dual-effects-1001.1662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/states-and-exceptions-considered-as-dual-effects-1001.1662"/></url>
<url><loc>https://scifaro.com/en/abs/formal-theories-for-logspace-counting-1001.1960</loc><lastmod>2010-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-theories-for-logspace-counting-1001.1960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-theories-for-logspace-counting-1001.1960"/></url>
<url><loc>https://scifaro.com/en/abs/the-isomorphism-problem-on-classes-of-automatic-structures-1001.2086</loc><lastmod>2010-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-isomorphism-problem-on-classes-of-automatic-structures-1001.2086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-isomorphism-problem-on-classes-of-automatic-structures-1001.2086"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-decidable-about-sequences-1001.2100</loc><lastmod>2013-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-decidable-about-sequences-1001.2100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-decidable-about-sequences-1001.2100"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-logics-for-nested-words-and-algebraic-formal-power-series-1001.2175</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-logics-for-nested-words-and-algebraic-formal-power-series-1001.2175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-logics-for-nested-words-and-algebraic-formal-power-series-1001.2175"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-output-distribution-and-selection-probabilities-of-a-stack-filter-from-the-dnf-of-its-positive-boolean-function-1001.2416</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-output-distribution-and-selection-probabilities-of-a-stack-filter-from-the-dnf-of-its-positive-boolean-function-1001.2416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-output-distribution-and-selection-probabilities-of-a-stack-filter-from-the-dnf-of-its-positive-boolean-function-1001.2416"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-sets-of-real-numbers-recognized-by-finite-automata-in-multiple-bases-1001.2508</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-sets-of-real-numbers-recognized-by-finite-automata-in-multiple-bases-1001.2508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-sets-of-real-numbers-recognized-by-finite-automata-in-multiple-bases-1001.2508"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-definability-and-polynomial-time-on-chordal-graphs-and-line-graphs-1001.2572</loc><lastmod>2010-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-definability-and-polynomial-time-on-chordal-graphs-and-line-graphs-1001.2572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-definability-and-polynomial-time-on-chordal-graphs-and-line-graphs-1001.2572"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-amba-ahb-from-formal-specification-1001.2811</loc><lastmod>2010-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-amba-ahb-from-formal-specification-1001.2811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-amba-ahb-from-formal-specification-1001.2811"/></url>
<url><loc>https://scifaro.com/en/abs/a-finiteness-structure-on-resource-terms-1001.3219</loc><lastmod>2010-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finiteness-structure-on-resource-terms-1001.3219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finiteness-structure-on-resource-terms-1001.3219"/></url>
<url><loc>https://scifaro.com/en/abs/a-real-world-mechanism-for-testing-satisfiability-in-polynomial-time-1001.3263</loc><lastmod>2010-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-real-world-mechanism-for-testing-satisfiability-in-polynomial-time-1001.3263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-real-world-mechanism-for-testing-satisfiability-in-polynomial-time-1001.3263"/></url>
<url><loc>https://scifaro.com/en/abs/linear-recursion-1001.3368</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-recursion-1001.3368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-recursion-1001.3368"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-ccsp-synchronous-semantics-in-pvs-1001.3464</loc><lastmod>2010-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-ccsp-synchronous-semantics-in-pvs-1001.3464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-ccsp-synchronous-semantics-in-pvs-1001.3464"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimal-propositional-type-theory-1001.4021</loc><lastmod>2010-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimal-propositional-type-theory-1001.4021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimal-propositional-type-theory-1001.4021"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-class-of-nested-iterated-schemata-extended-version-1001.4251</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-class-of-nested-iterated-schemata-extended-version-1001.4251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-class-of-nested-iterated-schemata-extended-version-1001.4251"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-sub-boolean-fragments-of-alc-1001.4255</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-sub-boolean-fragments-of-alc-1001.4255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-for-sub-boolean-fragments-of-alc-1001.4255"/></url>
<url><loc>https://scifaro.com/en/abs/stream-productivity-by-outermost-termination-1001.4381</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stream-productivity-by-outermost-termination-1001.4381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stream-productivity-by-outermost-termination-1001.4381"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-framework-of-virtual-organisations-as-agent-societies-1001.4405</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-framework-of-virtual-organisations-as-agent-societies-1001.4405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-framework-of-virtual-organisations-as-agent-societies-1001.4405"/></url>
<url><loc>https://scifaro.com/en/abs/superdevelopments-for-weak-reduction-1001.4429</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superdevelopments-for-weak-reduction-1001.4429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superdevelopments-for-weak-reduction-1001.4429"/></url>
<url><loc>https://scifaro.com/en/abs/extending-context-sensitivity-in-term-rewriting-1001.4437</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-context-sensitivity-in-term-rewriting-1001.4437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-context-sensitivity-in-term-rewriting-1001.4437"/></url>
<url><loc>https://scifaro.com/en/abs/principal-typings-in-a-restricted-intersection-type-system-for-beta-normal-forms-with-de-bruijn-indices-1001.4438</loc><lastmod>2010-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/principal-typings-in-a-restricted-intersection-type-system-for-beta-normal-forms-with-de-bruijn-indices-1001.4438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/principal-typings-in-a-restricted-intersection-type-system-for-beta-normal-forms-with-de-bruijn-indices-1001.4438"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1001.4898</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1001.4898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1001.4898"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-monadic-second-order-logic-1001.5019</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-monadic-second-order-logic-1001.5019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-the-complexity-of-monadic-second-order-logic-1001.5019"/></url>
<url><loc>https://scifaro.com/en/abs/energy-parity-games-1001.5183</loc><lastmod>2012-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-parity-games-1001.5183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-parity-games-1001.5183"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-and-cut-free-tableaux-for-propositional-dynamic-logic-with-converse-1002.0172</loc><lastmod>2010-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-and-cut-free-tableaux-for-propositional-dynamic-logic-with-converse-1002.0172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-and-cut-free-tableaux-for-propositional-dynamic-logic-with-converse-1002.0172"/></url>
<url><loc>https://scifaro.com/en/abs/execution-models-for-choreographies-and-cryptoprotocols-1002.0935</loc><lastmod>2010-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/execution-models-for-choreographies-and-cryptoprotocols-1002.0935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/execution-models-for-choreographies-and-cryptoprotocols-1002.0935"/></url>
<url><loc>https://scifaro.com/en/abs/parikh-images-of-regular-languages-complexity-and-applications-1002.1464</loc><lastmod>2010-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parikh-images-of-regular-languages-complexity-and-applications-1002.1464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parikh-images-of-regular-languages-complexity-and-applications-1002.1464"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-and-verification-of-real-time-systems-1002.1796</loc><lastmod>2010-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-and-verification-of-real-time-systems-1002.1796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-and-verification-of-real-time-systems-1002.1796"/></url>
<url><loc>https://scifaro.com/en/abs/the-full-abstraction-problem-for-higher-order-functional-logic-programs-1002.1833</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-full-abstraction-problem-for-higher-order-functional-logic-programs-1002.1833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-full-abstraction-problem-for-higher-order-functional-logic-programs-1002.1833"/></url>
<url><loc>https://scifaro.com/en/abs/towards-parameterized-regular-type-inference-using-set-constraints-1002.1836</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-parameterized-regular-type-inference-using-set-constraints-1002.1836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-parameterized-regular-type-inference-using-set-constraints-1002.1836"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-product-approach-to-zonotope-intersection-1002.2236</loc><lastmod>2014-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-product-approach-to-zonotope-intersection-1002.2236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-product-approach-to-zonotope-intersection-1002.2236"/></url>
<url><loc>https://scifaro.com/en/abs/modular-construction-of-fixed-point-combinators-and-clocked-boehm-trees-1002.2578</loc><lastmod>2010-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-construction-of-fixed-point-combinators-and-clocked-boehm-trees-1002.2578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-construction-of-fixed-point-combinators-and-clocked-boehm-trees-1002.2578"/></url>
<url><loc>https://scifaro.com/en/abs/a-bisimulation-based-method-for-proving-the-validity-of-equations-in-gsos-languages-1002.2864</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bisimulation-based-method-for-proving-the-validity-of-equations-in-gsos-languages-1002.2864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bisimulation-based-method-for-proving-the-validity-of-equations-in-gsos-languages-1002.2864"/></url>
<url><loc>https://scifaro.com/en/abs/a-fully-abstract-symbolic-semantics-for-psi-calculi-1002.2867</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fully-abstract-symbolic-semantics-for-psi-calculi-1002.2867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fully-abstract-symbolic-semantics-for-psi-calculi-1002.2867"/></url>
<url><loc>https://scifaro.com/en/abs/causality-in-the-semantics-of-esterel-revisited-1002.2868</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-in-the-semantics-of-esterel-revisited-1002.2868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-in-the-semantics-of-esterel-revisited-1002.2868"/></url>
<url><loc>https://scifaro.com/en/abs/on-barbs-and-labels-in-reactive-systems-1002.2869</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-barbs-and-labels-in-reactive-systems-1002.2869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-barbs-and-labels-in-reactive-systems-1002.2869"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-bisimulations-on-stable-configuration-structures-1002.2871</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-bisimulations-on-stable-configuration-structures-1002.2871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-bisimulations-on-stable-configuration-structures-1002.2871"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-boolean-equation-systems-through-structure-graphs-1002.2873</loc><lastmod>2010-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-boolean-equation-systems-through-structure-graphs-1002.2873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-boolean-equation-systems-through-structure-graphs-1002.2873"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-proving-the-discrete-jordan-curve-theorem-1002.2954</loc><lastmod>2010-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-proving-the-discrete-jordan-curve-theorem-1002.2954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-proving-the-discrete-jordan-curve-theorem-1002.2954"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-workshop-on-structural-operational-semantics-1002.2978</loc><lastmod>2010-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-structural-operational-semantics-1002.2978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-structural-operational-semantics-1002.2978"/></url>
<url><loc>https://scifaro.com/en/abs/l2c2-logic-based-lsc-consistency-checking-1002.3083</loc><lastmod>2010-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l2c2-logic-based-lsc-consistency-checking-1002.3083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l2c2-logic-based-lsc-consistency-checking-1002.3083"/></url>
<url><loc>https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-without-weakenings-1002.3131</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-without-weakenings-1002.3131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-without-weakenings-1002.3131"/></url>
<url><loc>https://scifaro.com/en/abs/structural-analysis-of-boolean-equation-systems-1002.3222</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-analysis-of-boolean-equation-systems-1002.3222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-analysis-of-boolean-equation-systems-1002.3222"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-relationship-between-semantic-models-an-approach-for-ccsp-1002.3330</loc><lastmod>2010-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-relationship-between-semantic-models-an-approach-for-ccsp-1002.3330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-relationship-between-semantic-models-an-approach-for-ccsp-1002.3330"/></url>
<url><loc>https://scifaro.com/en/abs/alg-ebres-de-r-ealisabilit-e-un-programme-pour-bien-ordonner-r-1002.3438</loc><lastmod>2010-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alg-ebres-de-r-ealisabilit-e-un-programme-pour-bien-ordonner-r-1002.3438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alg-ebres-de-r-ealisabilit-e-un-programme-pour-bien-ordonner-r-1002.3438"/></url>
<url><loc>https://scifaro.com/en/abs/redundancy-deduction-schemes-and-minimum-size-bases-for-association-rules-1002.4286</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/redundancy-deduction-schemes-and-minimum-size-bases-for-association-rules-1002.4286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/redundancy-deduction-schemes-and-minimum-size-bases-for-association-rules-1002.4286"/></url>
<url><loc>https://scifaro.com/en/abs/on-semantic-generalizations-of-the-bernays-sch-onfinkel-ramsey-class-with-finite-or-co-finite-spectra-1002.4334</loc><lastmod>2016-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-semantic-generalizations-of-the-bernays-sch-onfinkel-ramsey-class-with-finite-or-co-finite-spectra-1002.4334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-semantic-generalizations-of-the-bernays-sch-onfinkel-ramsey-class-with-finite-or-co-finite-spectra-1002.4334"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-19th-workshop-on-logic-based-methods-in-programming-environments-wlpe-2009-1002.4535</loc><lastmod>2010-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-19th-workshop-on-logic-based-methods-in-programming-environments-wlpe-2009-1002.4535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-19th-workshop-on-logic-based-methods-in-programming-environments-wlpe-2009-1002.4535"/></url>
<url><loc>https://scifaro.com/en/abs/robust-vacuity-for-branching-temporal-logic-1002.4616</loc><lastmod>2010-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-vacuity-for-branching-temporal-logic-1002.4616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-vacuity-for-branching-temporal-logic-1002.4616"/></url>
<url><loc>https://scifaro.com/en/abs/a-concrete-representation-of-observational-equivalence-for-pcf-1003.0107</loc><lastmod>2010-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concrete-representation-of-observational-equivalence-for-pcf-1003.0107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concrete-representation-of-observational-equivalence-for-pcf-1003.0107"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-and-verification-of-multiple-uav-mission-using-smv-1003.0381</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-and-verification-of-multiple-uav-mission-using-smv-1003.0381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-and-verification-of-multiple-uav-mission-using-smv-1003.0381"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-basis-for-constructive-systems-1003.0425</loc><lastmod>2012-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-basis-for-constructive-systems-1003.0425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-basis-for-constructive-systems-1003.0425"/></url>
<url><loc>https://scifaro.com/en/abs/re-verification-of-a-lip-synchronization-protocol-using-robust-reachability-1003.0431</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/re-verification-of-a-lip-synchronization-protocol-using-robust-reachability-1003.0431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/re-verification-of-a-lip-synchronization-protocol-using-robust-reachability-1003.0431"/></url>
<url><loc>https://scifaro.com/en/abs/s-program-calculus-1003.0773</loc><lastmod>2010-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-program-calculus-1003.0773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-program-calculus-1003.0773"/></url>
<url><loc>https://scifaro.com/en/abs/on-probabilistic-alternating-simulations-1003.0788</loc><lastmod>2010-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-probabilistic-alternating-simulations-1003.0788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-probabilistic-alternating-simulations-1003.0788"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-positive-first-order-logic-without-equality-1003.0802</loc><lastmod>2010-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-positive-first-order-logic-without-equality-1003.0802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-positive-first-order-logic-without-equality-1003.0802"/></url>
<url><loc>https://scifaro.com/en/abs/levels-of-undecidability-in-infinitary-rewriting-normalization-and-reachability-1003.1057</loc><lastmod>2010-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/levels-of-undecidability-in-infinitary-rewriting-normalization-and-reachability-1003.1057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/levels-of-undecidability-in-infinitary-rewriting-normalization-and-reachability-1003.1057"/></url>
<url><loc>https://scifaro.com/en/abs/unification-and-matching-on-compressed-terms-1003.1632</loc><lastmod>2010-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-and-matching-on-compressed-terms-1003.1632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-and-matching-on-compressed-terms-1003.1632"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-rabin-1-synthesis-1003.1684</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-rabin-1-synthesis-1003.1684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-rabin-1-synthesis-1003.1684"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-logic-programming-in-databases-from-datalog-to-dl-log-1003.2586</loc><lastmod>2010-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-logic-programming-in-databases-from-datalog-to-dl-log-1003.2586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-logic-programming-in-databases-from-datalog-to-dl-log-1003.2586"/></url>
<url><loc>https://scifaro.com/en/abs/the-role-of-semantics-in-mining-frequent-patterns-from-knowledge-bases-in-description-logics-with-rules-1003.2700</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-role-of-semantics-in-mining-frequent-patterns-from-knowledge-bases-in-description-logics-with-rules-1003.2700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-role-of-semantics-in-mining-frequent-patterns-from-knowledge-bases-in-description-logics-with-rules-1003.2700"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-the-model-theory-of-epistemic-plausibility-models-1003.2790</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-the-model-theory-of-epistemic-plausibility-models-1003.2790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-the-model-theory-of-epistemic-plausibility-models-1003.2790"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-theorem-and-aperiodic-tilings-1003.2801</loc><lastmod>2010-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-theorem-and-aperiodic-tilings-1003.2801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-theorem-and-aperiodic-tilings-1003.2801"/></url>
<url><loc>https://scifaro.com/en/abs/effective-closed-subshifts-in-1d-can-be-implemented-in-2d-1003.3103</loc><lastmod>2010-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-closed-subshifts-in-1d-can-be-implemented-in-2d-1003.3103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-closed-subshifts-in-1d-can-be-implemented-in-2d-1003.3103"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-networks-1003.3629</loc><lastmod>2010-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-networks-1003.3629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-networks-1003.3629"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-of-multi-threaded-software-using-smt-solvers-1003.3830</loc><lastmod>2010-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-of-multi-threaded-software-using-smt-solvers-1003.3830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-of-multi-threaded-software-using-smt-solvers-1003.3830"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-and-reasoning-over-distributed-systems-using-aspect-oriented-graph-grammars-1003.4090</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-and-reasoning-over-distributed-systems-using-aspect-oriented-graph-grammars-1003.4090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-and-reasoning-over-distributed-systems-using-aspect-oriented-graph-grammars-1003.4090"/></url>
<url><loc>https://scifaro.com/en/abs/graph-creation-visualisation-and-transformation-1003.4326</loc><lastmod>2010-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-creation-visualisation-and-transformation-1003.4326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-creation-visualisation-and-transformation-1003.4326"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-logic-for-termgraph-rewriting-1003.4369</loc><lastmod>2010-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-logic-for-termgraph-rewriting-1003.4369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-logic-for-termgraph-rewriting-1003.4369"/></url>
<url><loc>https://scifaro.com/en/abs/involutive-categories-and-monoids-with-a-gns-correspondence-1003.4552</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/involutive-categories-and-monoids-with-a-gns-correspondence-1003.4552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/involutive-categories-and-monoids-with-a-gns-correspondence-1003.4552"/></url>
<url><loc>https://scifaro.com/en/abs/an-implementation-of-nested-pattern-matching-in-interaction-nets-1003.4562</loc><lastmod>2010-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implementation-of-nested-pattern-matching-in-interaction-nets-1003.4562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implementation-of-nested-pattern-matching-in-interaction-nets-1003.4562"/></url>
<url><loc>https://scifaro.com/en/abs/the-semantics-of-graph-programs-1003.4563</loc><lastmod>2010-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-semantics-of-graph-programs-1003.4563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-semantics-of-graph-programs-1003.4563"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-clarithmetic-i-1003.4719</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-i-1003.4719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-i-1003.4719"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-tom-1003.4799</loc><lastmod>2010-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-tom-1003.4799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-tom-1003.4799"/></url>
<url><loc>https://scifaro.com/en/abs/object-oriented-programming-laws-for-annotated-java-programs-1003.4800</loc><lastmod>2010-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/object-oriented-programming-laws-for-annotated-java-programs-1003.4800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/object-oriented-programming-laws-for-annotated-java-programs-1003.4800"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-generation-of-proof-tactics-for-finite-valued-logics-1003.4802</loc><lastmod>2010-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-generation-of-proof-tactics-for-finite-valued-logics-1003.4802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-generation-of-proof-tactics-for-finite-valued-logics-1003.4802"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-temporal-regular-properties-of-abstractions-of-term-rewriting-systems-1003.4803</loc><lastmod>2010-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-temporal-regular-properties-of-abstractions-of-term-rewriting-systems-1003.4803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-temporal-regular-properties-of-abstractions-of-term-rewriting-systems-1003.4803"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-relations-between-automata-stochastic-differential-equations-and-petri-nets-1003.4812</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-relations-between-automata-stochastic-differential-equations-and-petri-nets-1003.4812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-relations-between-automata-stochastic-differential-equations-and-petri-nets-1003.4812"/></url>
<url><loc>https://scifaro.com/en/abs/feedback-control-logic-synthesis-for-non-safe-petri-nets-1003.4905</loc><lastmod>2010-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feedback-control-logic-synthesis-for-non-safe-petri-nets-1003.4905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feedback-control-logic-synthesis-for-non-safe-petri-nets-1003.4905"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fm-09-workshop-on-formal-methods-for-aerospace-1003.5363</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fm-09-workshop-on-formal-methods-for-aerospace-1003.5363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fm-09-workshop-on-formal-methods-for-aerospace-1003.5363"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-logics-with-connectedness-predicates-1003.5399</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-logics-with-connectedness-predicates-1003.5399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-logics-with-connectedness-predicates-1003.5399"/></url>
<url><loc>https://scifaro.com/en/abs/relating-nominal-and-higher-order-abstract-syntax-specifications-1003.5447</loc><lastmod>2010-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-nominal-and-higher-order-abstract-syntax-specifications-1003.5447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-nominal-and-higher-order-abstract-syntax-specifications-1003.5447"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-models-for-a-semantically-linear-lambda-calculus-1003.5511</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-models-for-a-semantically-linear-lambda-calculus-1003.5511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-models-for-a-semantically-linear-lambda-calculus-1003.5511"/></url>
<url><loc>https://scifaro.com/en/abs/resource-bound-quantification-for-graph-transformation-1003.5512</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-bound-quantification-for-graph-transformation-1003.5512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-bound-quantification-for-graph-transformation-1003.5512"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-typing-for-resource-management-in-message-passing-concurrency-1003.5513</loc><lastmod>2010-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-typing-for-resource-management-in-message-passing-concurrency-1003.5513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-typing-for-resource-management-in-message-passing-concurrency-1003.5513"/></url>
<url><loc>https://scifaro.com/en/abs/labelled-lambda-calculi-with-explicit-copy-and-erase-1003.5515</loc><lastmod>2010-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labelled-lambda-calculi-with-explicit-copy-and-erase-1003.5515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labelled-lambda-calculi-with-explicit-copy-and-erase-1003.5515"/></url>
<url><loc>https://scifaro.com/en/abs/on-linear-information-systems-1003.5518</loc><lastmod>2010-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-linear-information-systems-1003.5518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-linear-information-systems-1003.5518"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-linearity-1003.5716</loc><lastmod>2010-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-linearity-1003.5716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-linearity-1003.5716"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-of-generic-process-shape-types-1003.6096</loc><lastmod>2010-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-of-generic-process-shape-types-1003.6096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-of-generic-process-shape-types-1003.6096"/></url>
<url><loc>https://scifaro.com/en/abs/the-isomorphism-problem-for-omega-automatic-trees-1004.0610</loc><lastmod>2010-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-isomorphism-problem-for-omega-automatic-trees-1004.0610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-isomorphism-problem-for-omega-automatic-trees-1004.0610"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-and-synthesizing-systems-in-probabilistic-environments-1004.0739</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-and-synthesizing-systems-in-probabilistic-environments-1004.0739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-and-synthesizing-systems-in-probabilistic-environments-1004.0739"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-reachability-for-temporal-logic-over-constraint-systems-1004.1077</loc><lastmod>2010-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-reachability-for-temporal-logic-over-constraint-systems-1004.1077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-reachability-for-temporal-logic-over-constraint-systems-1004.1077"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-abstraction-of-b-models-to-generate-tests-1004.1262</loc><lastmod>2010-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-abstraction-of-b-models-to-generate-tests-1004.1262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-abstraction-of-b-models-to-generate-tests-1004.1262"/></url>
<url><loc>https://scifaro.com/en/abs/genesyst-a-tool-to-reason-about-behavioral-aspects-of-b-event-specifications-application-to-security-properties-1004.1472</loc><lastmod>2010-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/genesyst-a-tool-to-reason-about-behavioral-aspects-of-b-event-specifications-application-to-security-properties-1004.1472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/genesyst-a-tool-to-reason-about-behavioral-aspects-of-b-event-specifications-application-to-security-properties-1004.1472"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-1004.1845</loc><lastmod>2010-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-1004.1845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-1004.1845"/></url>
<url><loc>https://scifaro.com/en/abs/analytic-tableaux-for-simple-type-theory-and-its-first-order-fragment-1004.1947</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analytic-tableaux-for-simple-type-theory-and-its-first-order-fragment-1004.1947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analytic-tableaux-for-simple-type-theory-and-its-first-order-fragment-1004.1947"/></url>
<url><loc>https://scifaro.com/en/abs/gist-a-solver-for-probabilistic-games-1004.2367</loc><lastmod>2010-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gist-a-solver-for-probabilistic-games-1004.2367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gist-a-solver-for-probabilistic-games-1004.2367"/></url>
<url><loc>https://scifaro.com/en/abs/some-mathematicians-are-not-turing-machines-1004.2436</loc><lastmod>2010-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-mathematicians-are-not-turing-machines-1004.2436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-mathematicians-are-not-turing-machines-1004.2436"/></url>
<url><loc>https://scifaro.com/en/abs/assume-guarantee-synthesis-for-digital-contract-signing-1004.2697</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assume-guarantee-synthesis-for-digital-contract-signing-1004.2697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assume-guarantee-synthesis-for-digital-contract-signing-1004.2697"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-flat-coalgebraic-fixpoint-logics-1004.2717</loc><lastmod>2016-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-flat-coalgebraic-fixpoint-logics-1004.2717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-flat-coalgebraic-fixpoint-logics-1004.2717"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-fault-diagnosis-algorithms-1004.2764</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-fault-diagnosis-algorithms-1004.2764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-fault-diagnosis-algorithms-1004.2764"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-approach-to-the-problem-of-unique-decomposition-of-processes-1004.2780</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-approach-to-the-problem-of-unique-decomposition-of-processes-1004.2780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-approach-to-the-problem-of-unique-decomposition-of-processes-1004.2780"/></url>
<url><loc>https://scifaro.com/en/abs/forward-analysis-and-model-checking-for-trace-bounded-wsts-1004.2802</loc><lastmod>2016-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-analysis-and-model-checking-for-trace-bounded-wsts-1004.2802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-analysis-and-model-checking-for-trace-bounded-wsts-1004.2802"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-verification-of-ltl-specifications-with-integer-constraints-and-its-application-to-runtime-checking-of-service-substitutability-1004.2873</loc><lastmod>2010-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-verification-of-ltl-specifications-with-integer-constraints-and-its-application-to-runtime-checking-of-service-substitutability-1004.2873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-verification-of-ltl-specifications-with-integer-constraints-and-its-application-to-runtime-checking-of-service-substitutability-1004.2873"/></url>
<url><loc>https://scifaro.com/en/abs/focusing-in-asynchronous-games-1004.3134</loc><lastmod>2015-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focusing-in-asynchronous-games-1004.3134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focusing-in-asynchronous-games-1004.3134"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-clarithmetic-ii-1004.3236</loc><lastmod>2016-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-ii-1004.3236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-ii-1004.3236"/></url>
<url><loc>https://scifaro.com/en/abs/transport-of-finiteness-structures-and-applications-1004.3655</loc><lastmod>2016-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transport-of-finiteness-structures-and-applications-1004.3655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transport-of-finiteness-structures-and-applications-1004.3655"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-object-oriented-programs-a-transformational-approach-1004.4656</loc><lastmod>2011-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-object-oriented-programs-a-transformational-approach-1004.4656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-object-oriented-programs-a-transformational-approach-1004.4656"/></url>
<url><loc>https://scifaro.com/en/abs/computing-in-coq-with-infinite-algebraic-data-structures-1004.4998</loc><lastmod>2010-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-in-coq-with-infinite-algebraic-data-structures-1004.4998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-in-coq-with-infinite-algebraic-data-structures-1004.4998"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proof-of-schur-conjugate-function-1004.5034</loc><lastmod>2010-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proof-of-schur-conjugate-function-1004.5034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proof-of-schur-conjugate-function-1004.5034"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-model-checking-for-knowledge-based-program-implementation-an-application-to-anonymous-broadcast-1004.5130</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-model-checking-for-knowledge-based-program-implementation-an-application-to-anonymous-broadcast-1004.5130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-model-checking-for-knowledge-based-program-implementation-an-application-to-anonymous-broadcast-1004.5130"/></url>
<url><loc>https://scifaro.com/en/abs/query-strategy-for-sequential-ontology-debugging-1004.5339</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-strategy-for-sequential-ontology-debugging-1004.5339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-strategy-for-sequential-ontology-debugging-1004.5339"/></url>
<url><loc>https://scifaro.com/en/abs/interface-building-for-software-by-modular-three-valued-abstraction-refinement-1004.5382</loc><lastmod>2010-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interface-building-for-software-by-modular-three-valued-abstraction-refinement-1004.5382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interface-building-for-software-by-modular-three-valued-abstraction-refinement-1004.5382"/></url>
<url><loc>https://scifaro.com/en/abs/simple-type-theory-as-framework-for-combining-logics-1004.5500</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-type-theory-as-framework-for-combining-logics-1004.5500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-type-theory-as-framework-for-combining-logics-1004.5500"/></url>
<url><loc>https://scifaro.com/en/abs/size-change-termination-monotonicity-constraints-and-ranking-functions-1005.0253</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-change-termination-monotonicity-constraints-and-ranking-functions-1005.0253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-change-termination-monotonicity-constraints-and-ranking-functions-1005.0253"/></url>
<url><loc>https://scifaro.com/en/abs/smart-matching-1005.0349</loc><lastmod>2010-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smart-matching-1005.0349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smart-matching-1005.0349"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-evidence-systems-with-common-knowledge-1005.0484</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-evidence-systems-with-common-knowledge-1005.0484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-evidence-systems-with-common-knowledge-1005.0484"/></url>
<url><loc>https://scifaro.com/en/abs/on-decidable-growth-rate-properties-of-imperative-programs-1005.0518</loc><lastmod>2010-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-decidable-growth-rate-properties-of-imperative-programs-1005.0518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-decidable-growth-rate-properties-of-imperative-programs-1005.0518"/></url>
<url><loc>https://scifaro.com/en/abs/general-ramified-recurrence-is-sound-for-polynomial-time-1005.0521</loc><lastmod>2010-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-ramified-recurrence-is-sound-for-polynomial-time-1005.0521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-ramified-recurrence-is-sound-for-polynomial-time-1005.0521"/></url>
<url><loc>https://scifaro.com/en/abs/safe-recursion-on-notation-into-a-light-logic-by-levels-1005.0522</loc><lastmod>2010-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-recursion-on-notation-into-a-light-logic-by-levels-1005.0522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-recursion-on-notation-into-a-light-logic-by-levels-1005.0522"/></url>
<url><loc>https://scifaro.com/en/abs/church-scott-ptime-an-application-of-resource-sensitive-realizability-1005.0524</loc><lastmod>2010-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/church-scott-ptime-an-application-of-resource-sensitive-realizability-1005.0524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/church-scott-ptime-an-application-of-resource-sensitive-realizability-1005.0524"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-international-workshop-on-developments-in-implicit-computational-complexity-1005.0653</loc><lastmod>2010-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-developments-in-implicit-computational-complexity-1005.0653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-developments-in-implicit-computational-complexity-1005.0653"/></url>
<url><loc>https://scifaro.com/en/abs/yapa-a-generic-tool-for-computing-intruder-knowledge-1005.0737</loc><lastmod>2010-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/yapa-a-generic-tool-for-computing-intruder-knowledge-1005.0737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/yapa-a-generic-tool-for-computing-intruder-knowledge-1005.0737"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1005.0824</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1005.0824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proof-of-a-wave-equation-resolution-scheme-the-method-error-1005.0824"/></url>
<url><loc>https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-1005.0835</loc><lastmod>2010-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-1005.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-affine-intuitionistic-system-of-types-and-effects-confluence-and-termination-1005.0835"/></url>
<url><loc>https://scifaro.com/en/abs/horn-versus-full-first-order-complexity-dichotomies-in-algebraic-constraint-satisfaction-1005.1141</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-versus-full-first-order-complexity-dichotomies-in-algebraic-constraint-satisfaction-1005.1141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-versus-full-first-order-complexity-dichotomies-in-algebraic-constraint-satisfaction-1005.1141"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-model-checking-an-overview-1005.1327</loc><lastmod>2010-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-model-checking-an-overview-1005.1327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-model-checking-an-overview-1005.1327"/></url>
<url><loc>https://scifaro.com/en/abs/classical-bi-its-semantics-and-proof-theory-1005.2340</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-bi-its-semantics-and-proof-theory-1005.2340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-bi-its-semantics-and-proof-theory-1005.2340"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-algebras-a-program-to-well-order-r-1005.2395</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-algebras-a-program-to-well-order-r-1005.2395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-algebras-a-program-to-well-order-r-1005.2395"/></url>
<url><loc>https://scifaro.com/en/abs/proviola-a-tool-for-proof-re-animation-1005.2672</loc><lastmod>2010-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proviola-a-tool-for-proof-re-animation-1005.2672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proviola-a-tool-for-proof-re-animation-1005.2672"/></url>
<url><loc>https://scifaro.com/en/abs/call-by-value-call-by-name-and-the-vectorial-behaviour-of-the-algebraic-lambda-calculus-1005.2897</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/call-by-value-call-by-name-and-the-vectorial-behaviour-of-the-algebraic-lambda-calculus-1005.2897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/call-by-value-call-by-name-and-the-vectorial-behaviour-of-the-algebraic-lambda-calculus-1005.2897"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-realizers-and-monads-1005.2907</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-realizers-and-monads-1005.2907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-realizers-and-monads-1005.2907"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-temporal-logics-1005.3199</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-temporal-logics-1005.3199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-temporal-logics-1005.3199"/></url>
<url><loc>https://scifaro.com/en/abs/real-time-and-probabilistic-temporal-logics-an-overview-1005.3200</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-time-and-probabilistic-temporal-logics-an-overview-1005.3200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-time-and-probabilistic-temporal-logics-an-overview-1005.3200"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-unification-from-a-higher-order-perspective-1005.3731</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-unification-from-a-higher-order-perspective-1005.3731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-unification-from-a-higher-order-perspective-1005.3731"/></url>
<url><loc>https://scifaro.com/en/abs/a-meta-programming-approach-to-realizing-dependently-typed-logic-programming-1005.4379</loc><lastmod>2010-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-meta-programming-approach-to-realizing-dependently-typed-logic-programming-1005.4379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-meta-programming-approach-to-realizing-dependently-typed-logic-programming-1005.4379"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-1005.4508</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-1005.4508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-analysis-of-intruder-theories-1005.4508"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-modular-abstractions-for-template-numerical-constraints-1005.4844</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-modular-abstractions-for-template-numerical-constraints-1005.4844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-modular-abstractions-for-template-numerical-constraints-1005.4844"/></url>
<url><loc>https://scifaro.com/en/abs/unprovability-of-the-logical-characterization-of-bisimulation-1005.5142</loc><lastmod>2010-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unprovability-of-the-logical-characterization-of-bisimulation-1005.5142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unprovability-of-the-logical-characterization-of-bisimulation-1005.5142"/></url>
<url><loc>https://scifaro.com/en/abs/on-infinitary-rational-relations-and-borel-sets-1005.5608</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-infinitary-rational-relations-and-borel-sets-1005.5608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-infinitary-rational-relations-and-borel-sets-1005.5608"/></url>
<url><loc>https://scifaro.com/en/abs/a-tree-logic-with-graded-paths-and-nominals-1005.5623</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tree-logic-with-graded-paths-and-nominals-1005.5623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tree-logic-with-graded-paths-and-nominals-1005.5623"/></url>
<url><loc>https://scifaro.com/en/abs/on-omega-context-free-languages-which-are-borel-sets-of-infinite-rank-1005.5633</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-omega-context-free-languages-which-are-borel-sets-of-infinite-rank-1005.5633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-omega-context-free-languages-which-are-borel-sets-of-infinite-rank-1005.5633"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-extension-of-the-wagner-hierarchy-to-blind-counter-automata-1005.5635</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-extension-of-the-wagner-hierarchy-to-blind-counter-automata-1005.5635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-extension-of-the-wagner-hierarchy-to-blind-counter-automata-1005.5635"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-outermost-into-context-sensitive-rewriting-1005.5648</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-outermost-into-context-sensitive-rewriting-1005.5648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-outermost-into-context-sensitive-rewriting-1005.5648"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-contribution-of-backward-jumps-to-instruction-sequence-expressiveness-1005.5662</loc><lastmod>2010-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-contribution-of-backward-jumps-to-instruction-sequence-expressiveness-1005.5662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-contribution-of-backward-jumps-to-instruction-sequence-expressiveness-1005.5662"/></url>
<url><loc>https://scifaro.com/en/abs/an-implicit-characterization-of-pspace-1006.0030</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implicit-characterization-of-pspace-1006.0030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implicit-characterization-of-pspace-1006.0030"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-reasoning-for-fragments-of-autoepistemic-logic-1006.0220</loc><lastmod>2010-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-reasoning-for-fragments-of-autoepistemic-logic-1006.0220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-reasoning-for-fragments-of-autoepistemic-logic-1006.0220"/></url>
<url><loc>https://scifaro.com/en/abs/a-domain-theoretic-investigation-of-posets-of-sub-sigma-algebras-extended-abstract-1006.0393</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-domain-theoretic-investigation-of-posets-of-sub-sigma-algebras-extended-abstract-1006.0393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-domain-theoretic-investigation-of-posets-of-sub-sigma-algebras-extended-abstract-1006.0393"/></url>
<url><loc>https://scifaro.com/en/abs/computation-with-advice-1006.0395</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-with-advice-1006.0395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-with-advice-1006.0395"/></url>
<url><loc>https://scifaro.com/en/abs/the-cardinality-of-an-oracle-in-blum-shub-smale-computation-1006.0396</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cardinality-of-an-oracle-in-blum-shub-smale-computation-1006.0396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cardinality-of-an-oracle-in-blum-shub-smale-computation-1006.0396"/></url>
<url><loc>https://scifaro.com/en/abs/effective-capacity-and-randomness-of-closed-sets-1006.0397</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-capacity-and-randomness-of-closed-sets-1006.0397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-capacity-and-randomness-of-closed-sets-1006.0397"/></url>
<url><loc>https://scifaro.com/en/abs/real-analytic-machines-and-degrees-1006.0398</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-analytic-machines-and-degrees-1006.0398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-analytic-machines-and-degrees-1006.0398"/></url>
<url><loc>https://scifaro.com/en/abs/np-logic-systems-and-model-equivalence-reductions-1006.0403</loc><lastmod>2010-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-logic-systems-and-model-equivalence-reductions-1006.0403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-logic-systems-and-model-equivalence-reductions-1006.0403"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-rewriting-with-right-flat-rules-modulo-permutative-theories-1006.0706</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-rewriting-with-right-flat-rules-modulo-permutative-theories-1006.0706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-rewriting-with-right-flat-rules-modulo-permutative-theories-1006.0706"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-of-a-provenance-enabled-authorization-logic-1006.0880</loc><lastmod>2010-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-of-a-provenance-enabled-authorization-logic-1006.0880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-of-a-provenance-enabled-authorization-logic-1006.0880"/></url>
<url><loc>https://scifaro.com/en/abs/discounting-in-games-across-time-scales-1006.1403</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discounting-in-games-across-time-scales-1006.1403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discounting-in-games-across-time-scales-1006.1403"/></url>
<url><loc>https://scifaro.com/en/abs/on-modal-mu-calculus-over-finite-graphs-with-bounded-strongly-connected-components-1006.1406</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-modal-mu-calculus-over-finite-graphs-with-bounded-strongly-connected-components-1006.1406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-modal-mu-calculus-over-finite-graphs-with-bounded-strongly-connected-components-1006.1406"/></url>
<url><loc>https://scifaro.com/en/abs/begin-after-and-later-a-maximal-decidable-interval-temporal-logic-1006.1407</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/begin-after-and-later-a-maximal-decidable-interval-temporal-logic-1006.1407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/begin-after-and-later-a-maximal-decidable-interval-temporal-logic-1006.1407"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-the-temporal-logic-hierarchy-and-the-non-confluence-property-for-efficient-ltl-synthesis-1006.1408</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-the-temporal-logic-hierarchy-and-the-non-confluence-property-for-efficient-ltl-synthesis-1006.1408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-the-temporal-logic-hierarchy-and-the-non-confluence-property-for-efficient-ltl-synthesis-1006.1408"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-markovian-process-calculi-with-durational-and-durationless-actions-1006.1412</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-markovian-process-calculi-with-durational-and-durationless-actions-1006.1412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-markovian-process-calculi-with-durational-and-durationless-actions-1006.1412"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-an-alternating-time-temporal-logic-with-knowledge-imperfect-information-perfect-recall-and-communicating-coalitions-1006.1414</loc><lastmod>2010-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-an-alternating-time-temporal-logic-with-knowledge-imperfect-information-perfect-recall-and-communicating-coalitions-1006.1414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-an-alternating-time-temporal-logic-with-knowledge-imperfect-information-perfect-recall-and-communicating-coalitions-1006.1414"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-symmetry-reduction-and-the-use-of-state-symmetries-for-symbolic-model-checking-1006.1416</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-symmetry-reduction-and-the-use-of-state-symmetries-for-symbolic-model-checking-1006.1416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-symmetry-reduction-and-the-use-of-state-symmetries-for-symbolic-model-checking-1006.1416"/></url>
<url><loc>https://scifaro.com/en/abs/causality-and-the-semantics-of-provenance-1006.1429</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-and-the-semantics-of-provenance-1006.1429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-and-the-semantics-of-provenance-1006.1429"/></url>
<url><loc>https://scifaro.com/en/abs/equilibrium-and-termination-1006.1430</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilibrium-and-termination-1006.1430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilibrium-and-termination-1006.1430"/></url>
<url><loc>https://scifaro.com/en/abs/the-space-of-measurement-outcomes-as-a-spectrum-for-non-commutative-algebras-1006.1432</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-space-of-measurement-outcomes-as-a-spectrum-for-non-commutative-algebras-1006.1432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-space-of-measurement-outcomes-as-a-spectrum-for-non-commutative-algebras-1006.1432"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-a-typed-algebraic-lambda-calculus-1006.1433</loc><lastmod>2010-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-a-typed-algebraic-lambda-calculus-1006.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-a-typed-algebraic-lambda-calculus-1006.1433"/></url>
<url><loc>https://scifaro.com/en/abs/mean-payoff-automaton-expressions-1006.1492</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mean-payoff-automaton-expressions-1006.1492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mean-payoff-automaton-expressions-1006.1492"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-graph-transformation-systems-through-constraint-handling-rules-1006.1497</loc><lastmod>2010-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-graph-transformation-systems-through-constraint-handling-rules-1006.1497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-graph-transformation-systems-through-constraint-handling-rules-1006.1497"/></url>
<url><loc>https://scifaro.com/en/abs/the-duality-of-computation-under-focus-1006.2283</loc><lastmod>2010-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-duality-of-computation-under-focus-1006.2283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-duality-of-computation-under-focus-1006.2283"/></url>
<url><loc>https://scifaro.com/en/abs/does-treewidth-help-in-modal-satisfiability-1006.2461</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/does-treewidth-help-in-modal-satisfiability-1006.2461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/does-treewidth-help-in-modal-satisfiability-1006.2461"/></url>
<url><loc>https://scifaro.com/en/abs/mirrored-language-structure-and-innate-logic-of-the-human-brain-as-a-computable-model-of-the-oracle-turing-machine-1006.2495</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mirrored-language-structure-and-innate-logic-of-the-human-brain-as-a-computable-model-of-the-oracle-turing-machine-1006.2495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mirrored-language-structure-and-innate-logic-of-the-human-brain-as-a-computable-model-of-the-oracle-turing-machine-1006.2495"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-program-extraction-in-elementary-linear-logic-1006.2772</loc><lastmod>2010-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-program-extraction-in-elementary-linear-logic-1006.2772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-program-extraction-in-elementary-linear-logic-1006.2772"/></url>
<url><loc>https://scifaro.com/en/abs/internalized-realizability-in-pure-type-systems-1006.2867</loc><lastmod>2011-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internalized-realizability-in-pure-type-systems-1006.2867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internalized-realizability-in-pure-type-systems-1006.2867"/></url>
<url><loc>https://scifaro.com/en/abs/instantiation-of-smt-problems-modulo-integers-1006.2921</loc><lastmod>2010-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instantiation-of-smt-problems-modulo-integers-1006.2921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instantiation-of-smt-problems-modulo-integers-1006.2921"/></url>
<url><loc>https://scifaro.com/en/abs/modularity-of-convergence-and-strong-convergence-in-infinitary-rewriting-1006.2944</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modularity-of-convergence-and-strong-convergence-in-infinitary-rewriting-1006.2944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modularity-of-convergence-and-strong-convergence-in-infinitary-rewriting-1006.2944"/></url>
<url><loc>https://scifaro.com/en/abs/two-domain-dna-strand-displacement-1006.2993</loc><lastmod>2010-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-domain-dna-strand-displacement-1006.2993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-domain-dna-strand-displacement-1006.2993"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-theories-over-nominal-sets-1006.3027</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-theories-over-nominal-sets-1006.3027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-theories-over-nominal-sets-1006.3027"/></url>
<url><loc>https://scifaro.com/en/abs/classical-and-intuitionistic-subexponential-logics-are-equally-expressive-1006.3134</loc><lastmod>2010-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-and-intuitionistic-subexponential-logics-are-equally-expressive-1006.3134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-and-intuitionistic-subexponential-logics-are-equally-expressive-1006.3134"/></url>
<url><loc>https://scifaro.com/en/abs/a-convenient-differential-category-1006.3140</loc><lastmod>2010-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-convenient-differential-category-1006.3140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-convenient-differential-category-1006.3140"/></url>
<url><loc>https://scifaro.com/en/abs/functional-answer-set-programming-1006.3678</loc><lastmod>2010-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-answer-set-programming-1006.3678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-answer-set-programming-1006.3678"/></url>
<url><loc>https://scifaro.com/en/abs/extended-computation-tree-logic-1006.3709</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-computation-tree-logic-1006.3709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-computation-tree-logic-1006.3709"/></url>
<url><loc>https://scifaro.com/en/abs/the-question-of-expressiveness-in-the-generation-of-referring-expressions-1006.4621</loc><lastmod>2010-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-question-of-expressiveness-in-the-generation-of-referring-expressions-1006.4621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-question-of-expressiveness-in-the-generation-of-referring-expressions-1006.4621"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-and-proof-search-for-bi-intuitionistic-tense-logic-1006.4793</loc><lastmod>2010-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-and-proof-search-for-bi-intuitionistic-tense-logic-1006.4793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-and-proof-search-for-bi-intuitionistic-tense-logic-1006.4793"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-order-equivalency-1006.4939</loc><lastmod>2010-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-order-equivalency-1006.4939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-order-equivalency-1006.4939"/></url>
<url><loc>https://scifaro.com/en/abs/sound-bisimulations-for-higher-order-distributed-process-calculus-1006.4943</loc><lastmod>2011-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-bisimulations-for-higher-order-distributed-process-calculus-1006.4943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-bisimulations-for-higher-order-distributed-process-calculus-1006.4943"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-music-composition-using-answer-set-programming-1006.4948</loc><lastmod>2010-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-music-composition-using-answer-set-programming-1006.4948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-music-composition-using-answer-set-programming-1006.4948"/></url>
<url><loc>https://scifaro.com/en/abs/local-termination-theory-and-practice-1006.4955</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-termination-theory-and-practice-1006.4955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-termination-theory-and-practice-1006.4955"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-testing-equivalence-based-on-time-probability-and-observed-behavior-1006.5094</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-testing-equivalence-based-on-time-probability-and-observed-behavior-1006.5094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-testing-equivalence-based-on-time-probability-and-observed-behavior-1006.5094"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-probabilistic-program-verification-through-random-variable-abstraction-1006.5096</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-probabilistic-program-verification-through-random-variable-abstraction-1006.5096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-probabilistic-program-verification-through-random-variable-abstraction-1006.5096"/></url>
<url><loc>https://scifaro.com/en/abs/injecting-abstract-interpretations-into-linear-cost-models-1006.5098</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/injecting-abstract-interpretations-into-linear-cost-models-1006.5098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/injecting-abstract-interpretations-into-linear-cost-models-1006.5098"/></url>
<url><loc>https://scifaro.com/en/abs/testing-reactive-probabilistic-processes-1006.5100</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-reactive-probabilistic-processes-1006.5100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-reactive-probabilistic-processes-1006.5100"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-based-safety-analysis-1006.5101</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-based-safety-analysis-1006.5101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-based-safety-analysis-1006.5101"/></url>
<url><loc>https://scifaro.com/en/abs/an-expectation-transformer-approach-to-predicate-abstraction-and-data-independence-for-probabilistic-programs-1006.5102</loc><lastmod>2010-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expectation-transformer-approach-to-predicate-abstraction-and-data-independence-for-probabilistic-programs-1006.5102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expectation-transformer-approach-to-predicate-abstraction-and-data-independence-for-probabilistic-programs-1006.5102"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-preserving-recognizability-of-finite-tree-languages-1006.5516</loc><lastmod>2010-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-preserving-recognizability-of-finite-tree-languages-1006.5516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-preserving-recognizability-of-finite-tree-languages-1006.5516"/></url>
<url><loc>https://scifaro.com/en/abs/domain-representable-spaces-defined-by-strictly-positive-induction-1006.5561</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-representable-spaces-defined-by-strictly-positive-induction-1006.5561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-representable-spaces-defined-by-strictly-positive-induction-1006.5561"/></url>
<url><loc>https://scifaro.com/en/abs/acyclic-solos-and-differential-interaction-nets-1007.0120</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acyclic-solos-and-differential-interaction-nets-1007.0120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acyclic-solos-and-differential-interaction-nets-1007.0120"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-inconsistencies-in-large-biological-networks-with-answer-set-programming-1007.0134</loc><lastmod>2010-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-inconsistencies-in-large-biological-networks-with-answer-set-programming-1007.0134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-inconsistencies-in-large-biological-networks-with-answer-set-programming-1007.0134"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-checking-of-real-time-systems-with-fairness-assumptions-1007.0523</loc><lastmod>2010-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-checking-of-real-time-systems-with-fairness-assumptions-1007.0523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-checking-of-real-time-systems-with-fairness-assumptions-1007.0523"/></url>
<url><loc>https://scifaro.com/en/abs/redundancies-in-dependently-typed-lambda-calculi-and-their-relevance-to-proof-search-1007.0779</loc><lastmod>2010-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/redundancies-in-dependently-typed-lambda-calculi-and-their-relevance-to-proof-search-1007.0779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/redundancies-in-dependently-typed-lambda-calculi-and-their-relevance-to-proof-search-1007.0779"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometric-presentation-of-probabilistic-satisfiability-1007.0788</loc><lastmod>2010-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometric-presentation-of-probabilistic-satisfiability-1007.0788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometric-presentation-of-probabilistic-satisfiability-1007.0788"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-logics-for-component-configuration-1007.0831</loc><lastmod>2010-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-logics-for-component-configuration-1007.0831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-logics-for-component-configuration-1007.0831"/></url>
<url><loc>https://scifaro.com/en/abs/handling-software-upgradeability-problems-with-milp-solvers-1007.1020</loc><lastmod>2010-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/handling-software-upgradeability-problems-with-milp-solvers-1007.1020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/handling-software-upgradeability-problems-with-milp-solvers-1007.1020"/></url>
<url><loc>https://scifaro.com/en/abs/solving-linux-upgradeability-problems-using-boolean-optimization-1007.1021</loc><lastmod>2010-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-linux-upgradeability-problems-using-boolean-optimization-1007.1021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-linux-upgradeability-problems-using-boolean-optimization-1007.1021"/></url>
<url><loc>https://scifaro.com/en/abs/separating-the-basic-logics-of-the-basic-recurrences-1007.1324</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-the-basic-logics-of-the-basic-recurrences-1007.1324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-the-basic-logics-of-the-basic-recurrences-1007.1324"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-mean-payoff-and-energy-games-1007.1669</loc><lastmod>2010-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-mean-payoff-and-energy-games-1007.1669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-mean-payoff-and-energy-games-1007.1669"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-analysis-of-probabilistic-programs-with-unbounded-recursion-1007.1710</loc><lastmod>2012-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-analysis-of-probabilistic-programs-with-unbounded-recursion-1007.1710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-analysis-of-probabilistic-programs-with-unbounded-recursion-1007.1710"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-learning-based-realizability-for-heyting-arithmetic-with-em1-1007.1785</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-learning-based-realizability-for-heyting-arithmetic-with-em1-1007.1785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-learning-based-realizability-for-heyting-arithmetic-with-em1-1007.1785"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-1007.2131</loc><lastmod>2010-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-1007.2131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-1007.2131"/></url>
<url><loc>https://scifaro.com/en/abs/trichotomy-and-dichotomy-results-on-the-complexity-of-reasoning-with-disjunctive-logic-programs-1007.2816</loc><lastmod>2014-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trichotomy-and-dichotomy-results-on-the-complexity-of-reasoning-with-disjunctive-logic-programs-1007.2816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trichotomy-and-dichotomy-results-on-the-complexity-of-reasoning-with-disjunctive-logic-programs-1007.2816"/></url>
<url><loc>https://scifaro.com/en/abs/ackermannian-and-primitive-recursive-bounds-with-dickson-s-lemma-1007.2989</loc><lastmod>2011-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ackermannian-and-primitive-recursive-bounds-with-dickson-s-lemma-1007.2989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ackermannian-and-primitive-recursive-bounds-with-dickson-s-lemma-1007.2989"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-to-abstract-machines-introduction-to-the-theory-of-configuration-machines-1007.3303</loc><lastmod>2010-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-to-abstract-machines-introduction-to-the-theory-of-configuration-machines-1007.3303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-to-abstract-machines-introduction-to-the-theory-of-configuration-machines-1007.3303"/></url>
<url><loc>https://scifaro.com/en/abs/formal-study-of-plane-delaunay-triangulation-1007.3350</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-study-of-plane-delaunay-triangulation-1007.3350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-study-of-plane-delaunay-triangulation-1007.3350"/></url>
<url><loc>https://scifaro.com/en/abs/making-abstraction-refinement-efficient-in-model-checking-1007.3569</loc><lastmod>2010-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-abstraction-refinement-efficient-in-model-checking-1007.3569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-abstraction-refinement-efficient-in-model-checking-1007.3569"/></url>
<url><loc>https://scifaro.com/en/abs/a-declarative-semantics-for-clp-with-qualification-and-proximity-1007.3629</loc><lastmod>2010-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-declarative-semantics-for-clp-with-qualification-and-proximity-1007.3629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-declarative-semantics-for-clp-with-qualification-and-proximity-1007.3629"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-self-assembling-systems-1007.3712</loc><lastmod>2010-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-self-assembling-systems-1007.3712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-self-assembling-systems-1007.3712"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-kleene-coalgebras-1007.3769</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-kleene-coalgebras-1007.3769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-kleene-coalgebras-1007.3769"/></url>
<url><loc>https://scifaro.com/en/abs/open-graphs-and-computational-reasoning-1007.3794</loc><lastmod>2010-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-graphs-and-computational-reasoning-1007.3794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-graphs-and-computational-reasoning-1007.3794"/></url>
<url><loc>https://scifaro.com/en/abs/fo-fd-extending-classical-logic-with-rule-based-fixpoint-definitions-1007.3819</loc><lastmod>2010-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-fd-extending-classical-logic-with-rule-based-fixpoint-definitions-1007.3819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-fd-extending-classical-logic-with-rule-based-fixpoint-definitions-1007.3819"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-and-terminating-execution-model-for-constraint-handling-rules-1007.3829</loc><lastmod>2010-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-and-terminating-execution-model-for-constraint-handling-rules-1007.3829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-and-terminating-execution-model-for-constraint-handling-rules-1007.3829"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-1007.4018</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-1007.4018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-and-closure-properties-for-quantitative-languages-1007.4018"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctive-asp-with-functions-decidable-queries-and-effective-computation-1007.4028</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctive-asp-with-functions-decidable-queries-and-effective-computation-1007.4028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctive-asp-with-functions-decidable-queries-and-effective-computation-1007.4028"/></url>
<url><loc>https://scifaro.com/en/abs/a-translational-approach-to-constraint-answer-set-solving-1007.4114</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-translational-approach-to-constraint-answer-set-solving-1007.4114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-translational-approach-to-constraint-answer-set-solving-1007.4114"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-symmetries-1007.4172</loc><lastmod>2010-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-symmetries-1007.4172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-symmetries-1007.4172"/></url>
<url><loc>https://scifaro.com/en/abs/initial-algebra-semantics-for-cyclic-sharing-tree-structures-1007.4266</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-algebra-semantics-for-cyclic-sharing-tree-structures-1007.4266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-algebra-semantics-for-cyclic-sharing-tree-structures-1007.4266"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-properties-for-fragments-of-chr-1007.4476</loc><lastmod>2010-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-properties-for-fragments-of-chr-1007.4476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-properties-for-fragments-of-chr-1007.4476"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-for-message-passing-systems-1007.4764</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-message-passing-systems-1007.4764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-message-passing-systems-1007.4764"/></url>
<url><loc>https://scifaro.com/en/abs/automated-termination-analysis-for-logic-programs-with-cut-1007.4908</loc><lastmod>2010-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-termination-analysis-for-logic-programs-with-cut-1007.4908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-termination-analysis-for-logic-programs-with-cut-1007.4908"/></url>
<url><loc>https://scifaro.com/en/abs/the-system-kato-detecting-cases-of-plagiarism-for-answer-set-programs-1007.4971</loc><lastmod>2010-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-system-kato-detecting-cases-of-plagiarism-for-answer-set-programs-1007.4971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-system-kato-detecting-cases-of-plagiarism-for-answer-set-programs-1007.4971"/></url>
<url><loc>https://scifaro.com/en/abs/timed-automata-semantics-for-analyzing-creol-1007.5095</loc><lastmod>2010-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-automata-semantics-for-analyzing-creol-1007.5095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-automata-semantics-for-analyzing-creol-1007.5095"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-probabilistic-processes-logically-1007.5188</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-probabilistic-processes-logically-1007.5188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-probabilistic-processes-logically-1007.5188"/></url>
<url><loc>https://scifaro.com/en/abs/on-csp-and-the-algebraic-theory-of-effects-1007.5488</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-csp-and-the-algebraic-theory-of-effects-1007.5488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-csp-and-the-algebraic-theory-of-effects-1007.5488"/></url>
<url><loc>https://scifaro.com/en/abs/the-coarsest-precongruences-respecting-safety-and-liveness-properties-1007.5491</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coarsest-precongruences-respecting-safety-and-liveness-properties-1007.5491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coarsest-precongruences-respecting-safety-and-liveness-properties-1007.5491"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-clarithmetic-iii-1008.0770</loc><lastmod>2012-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-iii-1008.0770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-clarithmetic-iii-1008.0770"/></url>
<url><loc>https://scifaro.com/en/abs/classical-mathematics-for-a-constructive-world-1008.1213</loc><lastmod>2011-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-mathematics-for-a-constructive-world-1008.1213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-mathematics-for-a-constructive-world-1008.1213"/></url>
<url><loc>https://scifaro.com/en/abs/towards-arrow-theoretic-semantics-of-ontologies-conceptories-1008.1309</loc><lastmod>2010-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-arrow-theoretic-semantics-of-ontologies-conceptories-1008.1309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-arrow-theoretic-semantics-of-ontologies-conceptories-1008.1309"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplification-of-a-real-time-verification-problem-1008.1417</loc><lastmod>2010-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplification-of-a-real-time-verification-problem-1008.1417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplification-of-a-real-time-verification-problem-1008.1417"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-breaking-answer-set-solving-1008.1809</loc><lastmod>2010-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-breaking-answer-set-solving-1008.1809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-breaking-answer-set-solving-1008.1809"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-workshop-on-structural-operational-semantics-1008.1906</loc><lastmod>2010-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-structural-operational-semantics-1008.1906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-structural-operational-semantics-1008.1906"/></url>
<url><loc>https://scifaro.com/en/abs/a-single-instance-incremental-sat-formulation-of-proof-and-counterexample-based-abstraction-1008.2021</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-single-instance-incremental-sat-formulation-of-proof-and-counterexample-based-abstraction-1008.2021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-single-instance-incremental-sat-formulation-of-proof-and-counterexample-based-abstraction-1008.2021"/></url>
<url><loc>https://scifaro.com/en/abs/equational-characterization-of-covariant-contravariant-simulation-and-conformance-simulation-semantics-1008.2108</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-characterization-of-covariant-contravariant-simulation-and-conformance-simulation-semantics-1008.2108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-characterization-of-covariant-contravariant-simulation-and-conformance-simulation-semantics-1008.2108"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-from-the-operator-s-point-of-view-compositionality-requirements-on-process-semantics-1008.2109</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-from-the-operator-s-point-of-view-compositionality-requirements-on-process-semantics-1008.2109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-from-the-operator-s-point-of-view-compositionality-requirements-on-process-semantics-1008.2109"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchical-states-in-the-compositional-interchange-format-1008.2110</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchical-states-in-the-compositional-interchange-format-1008.2110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchical-states-in-the-compositional-interchange-format-1008.2110"/></url>
<url><loc>https://scifaro.com/en/abs/structural-decomposition-of-reactions-of-graph-like-objects-1008.2111</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-decomposition-of-reactions-of-graph-like-objects-1008.2111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-decomposition-of-reactions-of-graph-like-objects-1008.2111"/></url>
<url><loc>https://scifaro.com/en/abs/resumptions-weak-bisimilarity-and-big-step-semantics-for-while-with-interactive-i-o-an-exercise-in-mixed-induction-coinduction-1008.2112</loc><lastmod>2010-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resumptions-weak-bisimilarity-and-big-step-semantics-for-while-with-interactive-i-o-an-exercise-in-mixed-induction-coinduction-1008.2112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resumptions-weak-bisimilarity-and-big-step-semantics-for-while-with-interactive-i-o-an-exercise-in-mixed-induction-coinduction-1008.2112"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-propagation-for-first-order-logic-and-inductive-definitions-1008.2121</loc><lastmod>2011-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-propagation-for-first-order-logic-and-inductive-definitions-1008.2121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-propagation-for-first-order-logic-and-inductive-definitions-1008.2121"/></url>
<url><loc>https://scifaro.com/en/abs/well-definedness-of-streams-by-transformation-and-termination-1008.2590</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-definedness-of-streams-by-transformation-and-termination-1008.2590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-definedness-of-streams-by-transformation-and-termination-1008.2590"/></url>
<url><loc>https://scifaro.com/en/abs/ultrametric-and-generalized-ultrametric-in-computational-logic-and-in-data-analysis-1008.3585</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ultrametric-and-generalized-ultrametric-in-computational-logic-and-in-data-analysis-1008.3585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ultrametric-and-generalized-ultrametric-in-computational-logic-and-in-data-analysis-1008.3585"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-scheme-for-qualified-logic-programming-1008.3863</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-scheme-for-qualified-logic-programming-1008.3863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-scheme-for-qualified-logic-programming-1008.3863"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-based-reasoning-in-qualified-logic-programming-1008.3867</loc><lastmod>2010-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-based-reasoning-in-qualified-logic-programming-1008.3867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-based-reasoning-in-qualified-logic-programming-1008.3867"/></url>
<url><loc>https://scifaro.com/en/abs/fundamental-results-on-fluid-approximations-of-stochastic-process-algebra-models-1008.4754</loc><lastmod>2010-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fundamental-results-on-fluid-approximations-of-stochastic-process-algebra-models-1008.4754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fundamental-results-on-fluid-approximations-of-stochastic-process-algebra-models-1008.4754"/></url>
<url><loc>https://scifaro.com/en/abs/reformulation-of-global-constraints-in-answer-set-programming-1008.5029</loc><lastmod>2010-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reformulation-of-global-constraints-in-answer-set-programming-1008.5029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reformulation-of-global-constraints-in-answer-set-programming-1008.5029"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-breaking-for-answer-set-programming-1008.5033</loc><lastmod>2010-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-breaking-for-answer-set-programming-1008.5033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-breaking-for-answer-set-programming-1008.5033"/></url>
<url><loc>https://scifaro.com/en/abs/system-description-h-pilot-version-1-9-1009.0673</loc><lastmod>2010-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-description-h-pilot-version-1-9-1009.0673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-description-h-pilot-version-1-9-1009.0673"/></url>
<url><loc>https://scifaro.com/en/abs/the-general-vector-addition-system-reachability-problem-by-presburger-inductive-invariants-1009.1076</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-general-vector-addition-system-reachability-problem-by-presburger-inductive-invariants-1009.1076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-general-vector-addition-system-reachability-problem-by-presburger-inductive-invariants-1009.1076"/></url>
<url><loc>https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1009.1976</loc><lastmod>2010-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1009.1976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1009.1976"/></url>
<url><loc>https://scifaro.com/en/abs/fixpoint-proof-theoretic-semantics-for-clp-with-qualification-and-proximity-1009.1977</loc><lastmod>2011-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixpoint-proof-theoretic-semantics-for-clp-with-qualification-and-proximity-1009.1977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixpoint-proof-theoretic-semantics-for-clp-with-qualification-and-proximity-1009.1977"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1009.2189</loc><lastmod>2010-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1009.2189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1009.2189"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-processes-1009.2259</loc><lastmod>2010-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-processes-1009.2259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-processes-1009.2259"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-substitutions-for-contextual-type-theory-1009.2789</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-substitutions-for-contextual-type-theory-1009.2789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-substitutions-for-contextual-type-theory-1009.2789"/></url>
<url><loc>https://scifaro.com/en/abs/generating-bijections-between-hoas-and-the-natural-numbers-1009.2790</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-bijections-between-hoas-and-the-natural-numbers-1009.2790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-bijections-between-hoas-and-the-natural-numbers-1009.2790"/></url>
<url><loc>https://scifaro.com/en/abs/closed-nominal-rewriting-and-efficiently-computable-nominal-algebra-equality-1009.2791</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closed-nominal-rewriting-and-efficiently-computable-nominal-algebra-equality-1009.2791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closed-nominal-rewriting-and-efficiently-computable-nominal-algebra-equality-1009.2791"/></url>
<url><loc>https://scifaro.com/en/abs/pure-type-systems-without-explicit-contexts-1009.2792</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pure-type-systems-without-explicit-contexts-1009.2792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pure-type-systems-without-explicit-contexts-1009.2792"/></url>
<url><loc>https://scifaro.com/en/abs/representing-isabelle-in-lf-1009.2794</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-isabelle-in-lf-1009.2794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-isabelle-in-lf-1009.2794"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-unification-for-the-lambda-calculus-with-linear-and-affine-types-1009.2795</loc><lastmod>2010-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-unification-for-the-lambda-calculus-with-linear-and-affine-types-1009.2795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-unification-for-the-lambda-calculus-with-linear-and-affine-types-1009.2795"/></url>
<url><loc>https://scifaro.com/en/abs/on-second-order-monadic-monoidal-and-groupoidal-quantifiers-1009.2893</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-second-order-monadic-monoidal-and-groupoidal-quantifiers-1009.2893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-second-order-monadic-monoidal-and-groupoidal-quantifiers-1009.2893"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-ontology-representation-using-owl-2-1009.3391</loc><lastmod>2010-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-ontology-representation-using-owl-2-1009.3391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-ontology-representation-using-owl-2-1009.3391"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-typed-lambda-calculus-with-constructors-1009.3429</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-typed-lambda-calculus-with-constructors-1009.3429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-typed-lambda-calculus-with-constructors-1009.3429"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-view-on-syntax-with-sharing-1009.3682</loc><lastmod>2011-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-view-on-syntax-with-sharing-1009.3682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-view-on-syntax-with-sharing-1009.3682"/></url>
<url><loc>https://scifaro.com/en/abs/a-test-automation-framework-for-mercury-1009.3765</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-test-automation-framework-for-mercury-1009.3765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-test-automation-framework-for-mercury-1009.3765"/></url>
<url><loc>https://scifaro.com/en/abs/realizing-evaluation-strategies-by-hierarchical-graph-rewriting-1009.3770</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizing-evaluation-strategies-by-hierarchical-graph-rewriting-1009.3770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizing-evaluation-strategies-by-hierarchical-graph-rewriting-1009.3770"/></url>
<url><loc>https://scifaro.com/en/abs/dnf-sampling-for-problog-inference-1009.3798</loc><lastmod>2010-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dnf-sampling-for-problog-inference-1009.3798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dnf-sampling-for-problog-inference-1009.3798"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-approximation-of-the-infimum-reachability-probability-for-probabilistic-finite-automata-1009.3822</loc><lastmod>2010-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-approximation-of-the-infimum-reachability-probability-for-probabilistic-finite-automata-1009.3822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-approximation-of-the-infimum-reachability-probability-for-probabilistic-finite-automata-1009.3822"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-rewriting-techniques-for-real-time-systems-1009.3982</loc><lastmod>2010-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-rewriting-techniques-for-real-time-systems-1009.3982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-rewriting-techniques-for-real-time-systems-1009.3982"/></url>
<url><loc>https://scifaro.com/en/abs/dist-orc-a-rewriting-based-distributed-implementation-of-orc-with-formal-analysis-1009.4260</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dist-orc-a-rewriting-based-distributed-implementation-of-orc-with-formal-analysis-1009.4260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dist-orc-a-rewriting-based-distributed-implementation-of-orc-with-formal-analysis-1009.4260"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-real-time-maude-semantics-of-ptolemy-to-hierarchical-de-models-1009.4261</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-real-time-maude-semantics-of-ptolemy-to-hierarchical-de-models-1009.4261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-real-time-maude-semantics-of-ptolemy-to-hierarchical-de-models-1009.4261"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-logic-based-technique-for-modeling-thermal-systems-1009.4263</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-logic-based-technique-for-modeling-thermal-systems-1009.4263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-logic-based-technique-for-modeling-thermal-systems-1009.4263"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-classes-of-metric-ltl-properties-of-object-oriented-real-time-maude-specifications-1009.4264</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-classes-of-metric-ltl-properties-of-object-oriented-real-time-maude-specifications-1009.4264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-classes-of-metric-ltl-properties-of-object-oriented-real-time-maude-specifications-1009.4264"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-verification-of-distributed-embedded-systems-a-traffic-intersection-product-family-1009.4265</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-verification-of-distributed-embedded-systems-a-traffic-intersection-product-family-1009.4265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-verification-of-distributed-embedded-systems-a-traffic-intersection-product-family-1009.4265"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-real-time-emulation-of-formally-defined-patterns-for-safe-medical-device-control-1009.4266</loc><lastmod>2010-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-real-time-emulation-of-formally-defined-patterns-for-safe-medical-device-control-1009.4266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-real-time-emulation-of-formally-defined-patterns-for-safe-medical-device-control-1009.4266"/></url>
<url><loc>https://scifaro.com/en/abs/game-semantics-for-first-order-logic-1009.4400</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-semantics-for-first-order-logic-1009.4400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-semantics-for-first-order-logic-1009.4400"/></url>
<url><loc>https://scifaro.com/en/abs/using-the-pals-architecture-to-verify-a-distributed-topology-control-protocol-for-wireless-multi-hop-networks-in-the-presence-of-node-failures-1009.4601</loc><lastmod>2010-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-the-pals-architecture-to-verify-a-distributed-topology-control-protocol-for-wireless-multi-hop-networks-in-the-presence-of-node-failures-1009.4601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-the-pals-architecture-to-verify-a-distributed-topology-control-protocol-for-wireless-multi-hop-networks-in-the-presence-of-node-failures-1009.4601"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-linear-time-temporal-logic-over-the-class-of-ordinals-1009.5206</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-linear-time-temporal-logic-over-the-class-of-ordinals-1009.5206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-linear-time-temporal-logic-over-the-class-of-ordinals-1009.5206"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-induction-and-co-induction-1009.6171</loc><lastmod>2010-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-induction-and-co-induction-1009.6171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-a-logic-with-induction-and-co-induction-1009.6171"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-global-cardinality-constraints-1010.0201</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-global-cardinality-constraints-1010.0201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-global-cardinality-constraints-1010.0201"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-perfect-recall-using-next-step-temporal-operators-in-s5-and-sub-s5-epistemic-temporal-logic-1010.0225</loc><lastmod>2011-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-perfect-recall-using-next-step-temporal-operators-in-s5-and-sub-s5-epistemic-temporal-logic-1010.0225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-perfect-recall-using-next-step-temporal-operators-in-s5-and-sub-s5-epistemic-temporal-logic-1010.0225"/></url>
<url><loc>https://scifaro.com/en/abs/an-explicit-framework-for-interaction-nets-1010.1066</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-explicit-framework-for-interaction-nets-1010.1066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-explicit-framework-for-interaction-nets-1010.1066"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logics-on-words-with-multiple-data-values-1010.1139</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logics-on-words-with-multiple-data-values-1010.1139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logics-on-words-with-multiple-data-values-1010.1139"/></url>
<url><loc>https://scifaro.com/en/abs/backward-reachability-of-array-based-systems-by-smt-solving-termination-and-invariant-synthesis-1010.1872</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/backward-reachability-of-array-based-systems-by-smt-solving-termination-and-invariant-synthesis-1010.1872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/backward-reachability-of-array-based-systems-by-smt-solving-termination-and-invariant-synthesis-1010.1872"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-for-epistemic-model-checking-of-dining-cryptographers-based-protocols-1010.2287</loc><lastmod>2010-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-for-epistemic-model-checking-of-dining-cryptographers-based-protocols-1010.2287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-for-epistemic-model-checking-of-dining-cryptographers-based-protocols-1010.2287"/></url>
<url><loc>https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-ii-classification-information-processing-and-duality-1010.2595</loc><lastmod>2010-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-ii-classification-information-processing-and-duality-1010.2595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-ii-classification-information-processing-and-duality-1010.2595"/></url>
<url><loc>https://scifaro.com/en/abs/asms-and-operational-algorithmic-completeness-of-lambda-calculus-1010.2597</loc><lastmod>2010-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asms-and-operational-algorithmic-completeness-of-lambda-calculus-1010.2597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asms-and-operational-algorithmic-completeness-of-lambda-calculus-1010.2597"/></url>
<url><loc>https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-i-information-theory-and-randomnes-1010.3201</loc><lastmod>2010-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-i-information-theory-and-randomnes-1010.3201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kolmogorov-complexity-in-perspective-part-i-information-theory-and-randomnes-1010.3201"/></url>
<url><loc>https://scifaro.com/en/abs/short-circuit-logic-1010.3674</loc><lastmod>2013-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-circuit-logic-1010.3674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-circuit-logic-1010.3674"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-interpolant-generation-in-satisfiability-modulo-linear-integer-arithmetic-1010.4422</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-interpolant-generation-in-satisfiability-modulo-linear-integer-arithmetic-1010.4422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-interpolant-generation-in-satisfiability-modulo-linear-integer-arithmetic-1010.4422"/></url>
<url><loc>https://scifaro.com/en/abs/the-last-paper-on-the-halpern-shoham-interval-temporal-logic-1010.4529</loc><lastmod>2010-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-last-paper-on-the-halpern-shoham-interval-temporal-logic-1010.4529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-last-paper-on-the-halpern-shoham-interval-temporal-logic-1010.4529"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-using-pres-model-1010.4953</loc><lastmod>2010-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-using-pres-model-1010.4953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-checking-in-embedded-systems-design-verification-using-pres-model-1010.4953"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-interaction-and-concurrency-experience-guaranteed-interaction-1010.5308</loc><lastmod>2010-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-interaction-and-concurrency-experience-guaranteed-interaction-1010.5308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-interaction-and-concurrency-experience-guaranteed-interaction-1010.5308"/></url>
<url><loc>https://scifaro.com/en/abs/port-protocols-for-deadlock-freedom-of-component-systems-1010.5565</loc><lastmod>2010-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/port-protocols-for-deadlock-freedom-of-component-systems-1010.5565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/port-protocols-for-deadlock-freedom-of-component-systems-1010.5565"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-time-constrained-automata-1010.5571</loc><lastmod>2010-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-time-constrained-automata-1010.5571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-time-constrained-automata-1010.5571"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-desynchronisable-closed-loop-system-1010.5572</loc><lastmod>2010-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-desynchronisable-closed-loop-system-1010.5572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-desynchronisable-closed-loop-system-1010.5572"/></url>
<url><loc>https://scifaro.com/en/abs/safety-guarantee-controller-synthesis-for-cyber-physical-systems-1010.5665</loc><lastmod>2010-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-guarantee-controller-synthesis-for-cyber-physical-systems-1010.5665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-guarantee-controller-synthesis-for-cyber-physical-systems-1010.5665"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-workshop-on-membrane-computing-and-biologically-inspired-process-calculi-2010-1011.0051</loc><lastmod>2010-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-membrane-computing-and-biologically-inspired-process-calculi-2010-1011.0051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-membrane-computing-and-biologically-inspired-process-calculi-2010-1011.0051"/></url>
<url><loc>https://scifaro.com/en/abs/folk-theorems-on-the-correspondence-between-state-based-and-event-based-systems-1011.0136</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folk-theorems-on-the-correspondence-between-state-based-and-event-based-systems-1011.0136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folk-theorems-on-the-correspondence-between-state-based-and-event-based-systems-1011.0136"/></url>
<url><loc>https://scifaro.com/en/abs/functional-dependence-of-secrets-in-a-collaboration-network-1011.0399</loc><lastmod>2010-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-dependence-of-secrets-in-a-collaboration-network-1011.0399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-dependence-of-secrets-in-a-collaboration-network-1011.0399"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-finding-for-parameterized-verification-1011.0447</loc><lastmod>2010-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-finding-for-parameterized-verification-1011.0447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-finding-for-parameterized-verification-1011.0447"/></url>
<url><loc>https://scifaro.com/en/abs/aspects-of-multiscale-modelling-in-a-process-algebra-for-biological-systems-1011.0491</loc><lastmod>2010-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aspects-of-multiscale-modelling-in-a-process-algebra-for-biological-systems-1011.0491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aspects-of-multiscale-modelling-in-a-process-algebra-for-biological-systems-1011.0491"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-verification-of-asynchronous-programs-1011.0551</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-verification-of-asynchronous-programs-1011.0551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-verification-of-asynchronous-programs-1011.0551"/></url>
<url><loc>https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-1011.0688</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-1011.0688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-parity-games-complexity-and-robustness-1011.0688"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-quantifier-free-interpolation-in-extensions-of-presburger-arithmetic-extended-technical-report-1011.1036</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-quantifier-free-interpolation-in-extensions-of-presburger-arithmetic-extended-technical-report-1011.1036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-quantifier-free-interpolation-in-extensions-of-presburger-arithmetic-extended-technical-report-1011.1036"/></url>
<url><loc>https://scifaro.com/en/abs/logics-and-games-for-true-concurrency-1011.1172</loc><lastmod>2010-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-and-games-for-true-concurrency-1011.1172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-and-games-for-true-concurrency-1011.1172"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-checking-for-propositional-projection-temporal-logic-1011.1321</loc><lastmod>2010-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-checking-for-propositional-projection-temporal-logic-1011.1321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-checking-for-propositional-projection-temporal-logic-1011.1321"/></url>
<url><loc>https://scifaro.com/en/abs/deduction-as-reduction-1011.1330</loc><lastmod>2010-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deduction-as-reduction-1011.1330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deduction-as-reduction-1011.1330"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-proof-that-adding-some-permutation-rules-to-beta-preserves-sn-1011.1335</loc><lastmod>2010-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-proof-that-adding-some-permutation-rules-to-beta-preserves-sn-1011.1335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-proof-that-adding-some-permutation-rules-to-beta-preserves-sn-1011.1335"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-meaning-of-logical-completeness-1011.1625</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-meaning-of-logical-completeness-1011.1625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-meaning-of-logical-completeness-1011.1625"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-a-categorical-model-of-the-differential-and-the-resource-lambda-calculi-1011.2307</loc><lastmod>2010-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-a-categorical-model-of-the-differential-and-the-resource-lambda-calculi-1011.2307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-a-categorical-model-of-the-differential-and-the-resource-lambda-calculi-1011.2307"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-reduction-for-probabilistic-systems-extended-version-1011.2314</loc><lastmod>2010-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-reduction-for-probabilistic-systems-extended-version-1011.2314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-reduction-for-probabilistic-systems-extended-version-1011.2314"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-safety-properties-with-the-tla-proof-system-1011.2560</loc><lastmod>2010-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-safety-properties-with-the-tla-proof-system-1011.2560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-safety-properties-with-the-tla-proof-system-1011.2560"/></url>
<url><loc>https://scifaro.com/en/abs/optimally-solving-the-mcm-problem-using-pseudo-boolean-satisfiability-1011.2685</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimally-solving-the-mcm-problem-using-pseudo-boolean-satisfiability-1011.2685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimally-solving-the-mcm-problem-using-pseudo-boolean-satisfiability-1011.2685"/></url>
<url><loc>https://scifaro.com/en/abs/towards-theory-of-massive-parallel-proofs-cellular-automata-approach-1011.2790</loc><lastmod>2010-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-theory-of-massive-parallel-proofs-cellular-automata-approach-1011.2790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-theory-of-massive-parallel-proofs-cellular-automata-approach-1011.2790"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-higher-order-pi-calculus-to-spatial-logics-1011.2896</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-higher-order-pi-calculus-to-spatial-logics-1011.2896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-higher-order-pi-calculus-to-spatial-logics-1011.2896"/></url>
<url><loc>https://scifaro.com/en/abs/reified-unit-resolution-and-the-failed-literal-rule-1011.2898</loc><lastmod>2010-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reified-unit-resolution-and-the-failed-literal-rule-1011.2898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reified-unit-resolution-and-the-failed-literal-rule-1011.2898"/></url>
<url><loc>https://scifaro.com/en/abs/the-hamiltonian-syllogistic-1011.2973</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hamiltonian-syllogistic-1011.2973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hamiltonian-syllogistic-1011.2973"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-for-nondeterministic-labeled-markov-processes-1011.3362</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-for-nondeterministic-labeled-markov-processes-1011.3362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-for-nondeterministic-labeled-markov-processes-1011.3362"/></url>
<url><loc>https://scifaro.com/en/abs/generic-modal-cut-elimination-applied-to-conditional-logics-1011.3479</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-modal-cut-elimination-applied-to-conditional-logics-1011.3479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-modal-cut-elimination-applied-to-conditional-logics-1011.3479"/></url>
<url><loc>https://scifaro.com/en/abs/linearity-in-the-non-deterministic-call-by-value-setting-1011.3542</loc><lastmod>2012-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearity-in-the-non-deterministic-call-by-value-setting-1011.3542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearity-in-the-non-deterministic-call-by-value-setting-1011.3542"/></url>
<url><loc>https://scifaro.com/en/abs/linear-lambda-calculus-with-explicit-substitutions-as-proof-search-in-deep-inference-1011.3668</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-lambda-calculus-with-explicit-substitutions-as-proof-search-in-deep-inference-1011.3668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-lambda-calculus-with-explicit-substitutions-as-proof-search-in-deep-inference-1011.3668"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problems-for-petri-nets-with-names-1011.3964</loc><lastmod>2010-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problems-for-petri-nets-with-names-1011.3964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problems-for-petri-nets-with-names-1011.3964"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-story-of-a-subtle-error-in-ltl-formulas-reduction-and-divine-incorrectness-1011.4214</loc><lastmod>2016-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-story-of-a-subtle-error-in-ltl-formulas-reduction-and-divine-incorrectness-1011.4214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-story-of-a-subtle-error-in-ltl-formulas-reduction-and-divine-incorrectness-1011.4214"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-memory-and-serialization-for-lambda-calculus-1011.4330</loc><lastmod>2010-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-memory-and-serialization-for-lambda-calculus-1011.4330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-memory-and-serialization-for-lambda-calculus-1011.4330"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-magic-sets-for-super-consistent-answer-set-programs-1011.4377</loc><lastmod>2010-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-magic-sets-for-super-consistent-answer-set-programs-1011.4377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-magic-sets-for-super-consistent-answer-set-programs-1011.4377"/></url>
<url><loc>https://scifaro.com/en/abs/on-constructive-connectives-and-systems-1011.4384</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-constructive-connectives-and-systems-1011.4384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-constructive-connectives-and-systems-1011.4384"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-and-definability-in-modal-first-order-fragments-1011.4718</loc><lastmod>2010-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-and-definability-in-modal-first-order-fragments-1011.4718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-and-definability-in-modal-first-order-fragments-1011.4718"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-charaterisation-of-ordered-disjunction-1011.4833</loc><lastmod>2010-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-charaterisation-of-ordered-disjunction-1011.4833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-charaterisation-of-ordered-disjunction-1011.4833"/></url>
<url><loc>https://scifaro.com/en/abs/logical-foundations-and-complexity-of-4ql-a-query-language-with-unrestricted-negation-1011.5105</loc><lastmod>2024-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-foundations-and-complexity-of-4ql-a-query-language-with-unrestricted-negation-1011.5105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-foundations-and-complexity-of-4ql-a-query-language-with-unrestricted-negation-1011.5105"/></url>
<url><loc>https://scifaro.com/en/abs/covered-clause-elimination-1011.5202</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covered-clause-elimination-1011.5202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covered-clause-elimination-1011.5202"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimization-for-reasoning-with-forest-logic-programs-1011.5894</loc><lastmod>2010-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimization-for-reasoning-with-forest-logic-programs-1011.5894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimization-for-reasoning-with-forest-logic-programs-1011.5894"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-expressiveness-in-concurrency-1011.6012</loc><lastmod>2010-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-expressiveness-in-concurrency-1011.6012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-expressiveness-in-concurrency-1011.6012"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-costed-computations-1011.6308</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-costed-computations-1011.6308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-costed-computations-1011.6308"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-modulo-bisimilarity-of-regular-expressions-with-parallel-composition-extended-abstract-1011.6429</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-modulo-bisimilarity-of-regular-expressions-with-parallel-composition-extended-abstract-1011.6429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-modulo-bisimilarity-of-regular-expressions-with-parallel-composition-extended-abstract-1011.6429"/></url>
<url><loc>https://scifaro.com/en/abs/a-criterion-for-separating-process-calculi-1011.6430</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-criterion-for-separating-process-calculi-1011.6430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-criterion-for-separating-process-calculi-1011.6430"/></url>
<url><loc>https://scifaro.com/en/abs/light-logics-and-higher-order-processes-1011.6431</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/light-logics-and-higher-order-processes-1011.6431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/light-logics-and-higher-order-processes-1011.6431"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-calculus-for-expressing-finite-place-transition-petri-nets-1011.6433</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-calculus-for-expressing-finite-place-transition-petri-nets-1011.6433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-calculus-for-expressing-finite-place-transition-petri-nets-1011.6433"/></url>
<url><loc>https://scifaro.com/en/abs/models-for-csp-with-availability-information-1011.6434</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-for-csp-with-availability-information-1011.6434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-for-csp-with-availability-information-1011.6434"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-of-equations-under-operational-extensions-1011.6435</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-of-equations-under-operational-extensions-1011.6435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-of-equations-under-operational-extensions-1011.6435"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-symmetries-1011.6437</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-symmetries-1011.6437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-symmetries-1011.6437"/></url>
<url><loc>https://scifaro.com/en/abs/process-behaviour-formulae-vs-tests-extended-abstract-1011.6438</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-behaviour-formulae-vs-tests-extended-abstract-1011.6438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-behaviour-formulae-vs-tests-extended-abstract-1011.6438"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-of-consistent-component-based-software-updates-1011.6496</loc><lastmod>2010-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-of-consistent-component-based-software-updates-1011.6496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-of-consistent-component-based-software-updates-1011.6496"/></url>
<url><loc>https://scifaro.com/en/abs/terminating-tableaux-for-graded-hybrid-logic-with-global-modalities-and-role-hierarchies-1012.0746</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terminating-tableaux-for-graded-hybrid-logic-with-global-modalities-and-role-hierarchies-1012.0746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terminating-tableaux-for-graded-hybrid-logic-with-global-modalities-and-role-hierarchies-1012.0746"/></url>
<url><loc>https://scifaro.com/en/abs/initial-semantics-for-higher-order-typed-syntax-in-coq-1012.1010</loc><lastmod>2011-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-semantics-for-higher-order-typed-syntax-in-coq-1012.1010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-semantics-for-higher-order-typed-syntax-in-coq-1012.1010"/></url>
<url><loc>https://scifaro.com/en/abs/functional-interpretations-of-intuitionistic-linear-logic-1012.1174</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-interpretations-of-intuitionistic-linear-logic-1012.1174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-interpretations-of-intuitionistic-linear-logic-1012.1174"/></url>
<url><loc>https://scifaro.com/en/abs/compactly-generating-all-satisfying-truth-assignments-of-a-horn-formula-1012.1769</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compactly-generating-all-satisfying-truth-assignments-of-a-horn-formula-1012.1769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compactly-generating-all-satisfying-truth-assignments-of-a-horn-formula-1012.1769"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-correctness-proof-for-magic-transformation-1012.2299</loc><lastmod>2010-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-correctness-proof-for-magic-transformation-1012.2299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-correctness-proof-for-magic-transformation-1012.2299"/></url>
<url><loc>https://scifaro.com/en/abs/scope-logic-with-local-reasoning-and-pre-post-state-properties-1012.2553</loc><lastmod>2010-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scope-logic-with-local-reasoning-and-pre-post-state-properties-1012.2553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scope-logic-with-local-reasoning-and-pre-post-state-properties-1012.2553"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-carrying-code-framework-for-inlined-reference-monitors-in-java-bytecode-1012.2995</loc><lastmod>2010-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-carrying-code-framework-for-inlined-reference-monitors-in-java-bytecode-1012.2995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-carrying-code-framework-for-inlined-reference-monitors-in-java-bytecode-1012.2995"/></url>
<url><loc>https://scifaro.com/en/abs/on-probabilistic-parallel-programs-with-process-creation-and-synchronisation-1012.2998</loc><lastmod>2010-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-probabilistic-parallel-programs-with-process-creation-and-synchronisation-1012.2998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-probabilistic-parallel-programs-with-process-creation-and-synchronisation-1012.2998"/></url>
<url><loc>https://scifaro.com/en/abs/numerically-representing-a-stochastic-process-algebra-1012.3040</loc><lastmod>2010-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/numerically-representing-a-stochastic-process-algebra-1012.3040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/numerically-representing-a-stochastic-process-algebra-1012.3040"/></url>
<url><loc>https://scifaro.com/en/abs/a-focused-sequent-calculus-framework-for-proof-search-in-pure-type-systems-1012.3372</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-focused-sequent-calculus-framework-for-proof-search-in-pure-type-systems-1012.3372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-focused-sequent-calculus-framework-for-proof-search-in-pure-type-systems-1012.3372"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-timeout-based-extension-of-propositional-linear-temporal-logic-1012.3704</loc><lastmod>2010-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-timeout-based-extension-of-propositional-linear-temporal-logic-1012.3704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-timeout-based-extension-of-propositional-linear-temporal-logic-1012.3704"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-in-equilibrium-logic-and-answer-set-programming-the-propositional-case-1012.3947</loc><lastmod>2010-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-in-equilibrium-logic-and-answer-set-programming-the-propositional-case-1012.3947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-in-equilibrium-logic-and-answer-set-programming-the-propositional-case-1012.3947"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-the-vectorial-aspect-of-the-linear-algebraic-lambda-calculus-1012.4032</loc><lastmod>2012-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-the-vectorial-aspect-of-the-linear-algebraic-lambda-calculus-1012.4032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-the-vectorial-aspect-of-the-linear-algebraic-lambda-calculus-1012.4032"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-24th-international-workshop-on-unification-1012.4554</loc><lastmod>2010-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-24th-international-workshop-on-unification-1012.4554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-24th-international-workshop-on-unification-1012.4554"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-workshop-on-partiality-and-recursion-in-interactive-theorem-provers-1012.4555</loc><lastmod>2010-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-workshop-on-partiality-and-recursion-in-interactive-theorem-provers-1012.4555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-workshop-on-partiality-and-recursion-in-interactive-theorem-provers-1012.4555"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-unification-revisited-1012.4890</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-unification-revisited-1012.4890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-unification-revisited-1012.4890"/></url>
<url><loc>https://scifaro.com/en/abs/a-machine-checked-model-of-idempotent-mgu-axioms-for-lists-of-equational-constraints-1012.4892</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-machine-checked-model-of-idempotent-mgu-axioms-for-lists-of-equational-constraints-1012.4892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-machine-checked-model-of-idempotent-mgu-axioms-for-lists-of-equational-constraints-1012.4892"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-definitions-of-monadic-functions-1012.4895</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-definitions-of-monadic-functions-1012.4895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-definitions-of-monadic-functions-1012.4895"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-and-well-definedness-within-a-proof-system-1012.4897</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-and-well-definedness-within-a-proof-system-1012.4897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-and-well-definedness-within-a-proof-system-1012.4897"/></url>
<url><loc>https://scifaro.com/en/abs/beating-the-productivity-checker-using-embedded-languages-1012.4898</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beating-the-productivity-checker-using-embedded-languages-1012.4898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beating-the-productivity-checker-using-embedded-languages-1012.4898"/></url>
<url><loc>https://scifaro.com/en/abs/general-recursion-and-formal-topology-1012.4899</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-recursion-and-formal-topology-1012.4899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-recursion-and-formal-topology-1012.4899"/></url>
<url><loc>https://scifaro.com/en/abs/on-hoare-mccarthy-algebras-1012.5059</loc><lastmod>2010-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hoare-mccarthy-algebras-1012.5059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hoare-mccarthy-algebras-1012.5059"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-international-workshop-on-strategies-in-rewriting-proving-and-programming-1012.5337</loc><lastmod>2010-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-strategies-in-rewriting-proving-and-programming-1012.5337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-strategies-in-rewriting-proving-and-programming-1012.5337"/></url>
<url><loc>https://scifaro.com/en/abs/extending-b-uchi-automata-with-constraints-on-data-values-1012.5439</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-b-uchi-automata-with-constraints-on-data-values-1012.5439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-b-uchi-automata-with-constraints-on-data-values-1012.5439"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-rewriting-with-and-automated-synthesis-of-forbidden-patterns-1012.5562</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-rewriting-with-and-automated-synthesis-of-forbidden-patterns-1012.5562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-rewriting-with-and-automated-synthesis-of-forbidden-patterns-1012.5562"/></url>
<url><loc>https://scifaro.com/en/abs/loops-under-strategies-continued-1012.5563</loc><lastmod>2010-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loops-under-strategies-continued-1012.5563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loops-under-strategies-continued-1012.5563"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-notions-of-termination-1012.5803</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-notions-of-termination-1012.5803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-notions-of-termination-1012.5803"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-dynamic-logic-of-phenomena-and-cognition-1101.0082</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-dynamic-logic-of-phenomena-and-cognition-1101.0082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-dynamic-logic-of-phenomena-and-cognition-1101.0082"/></url>
<url><loc>https://scifaro.com/en/abs/the-degree-structure-of-weihrauch-reducibility-1101.0112</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-degree-structure-of-weihrauch-reducibility-1101.0112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-degree-structure-of-weihrauch-reducibility-1101.0112"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-types-as-higher-order-dependency-pairs-1101.0968</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-types-as-higher-order-dependency-pairs-1101.0968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-types-as-higher-order-dependency-pairs-1101.0968"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-variant-of-projection-temporal-logic-1101.1379</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-variant-of-projection-temporal-logic-1101.1379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-variant-of-projection-temporal-logic-1101.1379"/></url>
<url><loc>https://scifaro.com/en/abs/formal-theories-for-linear-algebra-1101.1449</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-theories-for-linear-algebra-1101.1449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-theories-for-linear-algebra-1101.1449"/></url>
<url><loc>https://scifaro.com/en/abs/automata-and-temporal-logic-over-arbitrary-linear-time-1101.1731</loc><lastmod>2011-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-and-temporal-logic-over-arbitrary-linear-time-1101.1731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-and-temporal-logic-over-arbitrary-linear-time-1101.1731"/></url>
<url><loc>https://scifaro.com/en/abs/from-coinductive-proofs-to-exact-real-arithmetic-theory-and-applications-1101.2162</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-coinductive-proofs-to-exact-real-arithmetic-theory-and-applications-1101.2162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-coinductive-proofs-to-exact-real-arithmetic-theory-and-applications-1101.2162"/></url>
<url><loc>https://scifaro.com/en/abs/powermonads-and-tensors-of-unranked-effects-1101.2777</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/powermonads-and-tensors-of-unranked-effects-1101.2777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/powermonads-and-tensors-of-unranked-effects-1101.2777"/></url>
<url><loc>https://scifaro.com/en/abs/on-logical-extension-of-algebraic-division-1101.2798</loc><lastmod>2011-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-logical-extension-of-algebraic-division-1101.2798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-logical-extension-of-algebraic-division-1101.2798"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-topology-via-chu-spaces-1101.2999</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-topology-via-chu-spaces-1101.2999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-topology-via-chu-spaces-1101.2999"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-valuations-1101.3132</loc><lastmod>2011-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-valuations-1101.3132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-valuations-1101.3132"/></url>
<url><loc>https://scifaro.com/en/abs/psi-calculi-a-framework-for-mobile-processes-with-nominal-data-and-logic-1101.3262</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/psi-calculi-a-framework-for-mobile-processes-with-nominal-data-and-logic-1101.3262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/psi-calculi-a-framework-for-mobile-processes-with-nominal-data-and-logic-1101.3262"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-abstract-rewriting-systems-and-functoriality-of-graph-transformation-1101.3417</loc><lastmod>2011-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-abstract-rewriting-systems-and-functoriality-of-graph-transformation-1101.3417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-abstract-rewriting-systems-and-functoriality-of-graph-transformation-1101.3417"/></url>
<url><loc>https://scifaro.com/en/abs/borel-hierarchy-and-omega-context-free-languages-1101.3443</loc><lastmod>2011-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borel-hierarchy-and-omega-context-free-languages-1101.3443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borel-hierarchy-and-omega-context-free-languages-1101.3443"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-of-continuous-time-markov-chains-against-timed-automata-specifications-1101.3694</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-of-continuous-time-markov-chains-against-timed-automata-specifications-1101.3694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-of-continuous-time-markov-chains-against-timed-automata-specifications-1101.3694"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-workshop-on-intersection-types-and-related-systems-1101.4104</loc><lastmod>2011-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-intersection-types-and-related-systems-1101.4104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-intersection-types-and-related-systems-1101.4104"/></url>
<url><loc>https://scifaro.com/en/abs/relating-coalgebraic-notions-of-bisimulation-1101.4223</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-coalgebraic-notions-of-bisimulation-1101.4223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-coalgebraic-notions-of-bisimulation-1101.4223"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-foundations-for-interface-technologies-1101.4266</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-foundations-for-interface-technologies-1101.4266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-foundations-for-interface-technologies-1101.4266"/></url>
<url><loc>https://scifaro.com/en/abs/existential-witness-extraction-in-classical-realizability-and-via-a-negative-translation-1101.4364</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-witness-extraction-in-classical-realizability-and-via-a-negative-translation-1101.4364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-witness-extraction-in-classical-realizability-and-via-a-negative-translation-1101.4364"/></url>
<url><loc>https://scifaro.com/en/abs/relating-church-style-and-curry-style-subtyping-1101.4423</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-church-style-and-curry-style-subtyping-1101.4423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-church-style-and-curry-style-subtyping-1101.4423"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-logic-in-sequent-calculus-style-1101.4424</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-logic-in-sequent-calculus-style-1101.4424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-logic-in-sequent-calculus-style-1101.4424"/></url>
<url><loc>https://scifaro.com/en/abs/sound-and-complete-typing-for-lambda-mu-1101.4425</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-and-complete-typing-for-lambda-mu-1101.4425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-and-complete-typing-for-lambda-mu-1101.4425"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-for-unbind-and-rebind-1101.4426</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-for-unbind-and-rebind-1101.4426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-for-unbind-and-rebind-1101.4426"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-collapse-situations-i-non-termination-and-unrecoverable-errors-1101.4465</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-collapse-situations-i-non-termination-and-unrecoverable-errors-1101.4465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-collapse-situations-i-non-termination-and-unrecoverable-errors-1101.4465"/></url>
<url><loc>https://scifaro.com/en/abs/team-building-with-answer-set-programming-in-the-gioia-tauro-seaport-1101.4554</loc><lastmod>2011-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/team-building-with-answer-set-programming-in-the-gioia-tauro-seaport-1101.4554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/team-building-with-answer-set-programming-in-the-gioia-tauro-seaport-1101.4554"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-synchronous-scheduling-interfaces-1101.4733</loc><lastmod>2011-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-synchronous-scheduling-interfaces-1101.4733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-synchronous-scheduling-interfaces-1101.4733"/></url>
<url><loc>https://scifaro.com/en/abs/a-few-considerations-on-structural-and-logical-composition-in-specification-theories-1101.4734</loc><lastmod>2011-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-few-considerations-on-structural-and-logical-composition-in-specification-theories-1101.4734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-few-considerations-on-structural-and-logical-composition-in-specification-theories-1101.4734"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-first-order-causality-extended-version-1101.4813</loc><lastmod>2011-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-first-order-causality-extended-version-1101.4813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-first-order-causality-extended-version-1101.4813"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-higher-order-recursion-schemes-1101.4929</loc><lastmod>2019-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-higher-order-recursion-schemes-1101.4929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-higher-order-recursion-schemes-1101.4929"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-international-workshop-on-classical-logic-and-computation-1101.5200</loc><lastmod>2011-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-international-workshop-on-classical-logic-and-computation-1101.5200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-international-workshop-on-classical-logic-and-computation-1101.5200"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-the-control-software-of-the-compact-muon-solenoid-experiment-at-the-large-hadron-collider-1101.5324</loc><lastmod>2013-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-the-control-software-of-the-compact-muon-solenoid-experiment-at-the-large-hadron-collider-1101.5324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-the-control-software-of-the-compact-muon-solenoid-experiment-at-the-large-hadron-collider-1101.5324"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-learning-based-realizability-and-1-backtracking-games-1101.5441</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-learning-based-realizability-and-1-backtracking-games-1101.5441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-learning-based-realizability-and-1-backtracking-games-1101.5441"/></url>
<url><loc>https://scifaro.com/en/abs/on-various-negative-translations-1101.5442</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-various-negative-translations-1101.5442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-various-negative-translations-1101.5442"/></url>
<url><loc>https://scifaro.com/en/abs/superdeduction-in-lambda-bar-mu-mu-tilde-1101.5443</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superdeduction-in-lambda-bar-mu-mu-tilde-1101.5443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superdeduction-in-lambda-bar-mu-mu-tilde-1101.5443"/></url>
<url><loc>https://scifaro.com/en/abs/an-applicative-theory-for-fph-1101.5444</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-applicative-theory-for-fph-1101.5444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-applicative-theory-for-fph-1101.5444"/></url>
<url><loc>https://scifaro.com/en/abs/relating-sequent-calculi-for-bi-intuitionistic-propositional-logic-1101.5445</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-sequent-calculi-for-bi-intuitionistic-propositional-logic-1101.5445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-sequent-calculi-for-bi-intuitionistic-propositional-logic-1101.5445"/></url>
<url><loc>https://scifaro.com/en/abs/dialectica-interpretation-with-marked-counterexamples-1101.5446</loc><lastmod>2011-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dialectica-interpretation-with-marked-counterexamples-1101.5446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dialectica-interpretation-with-marked-counterexamples-1101.5446"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-memory-efficient-real-time-controllers-for-safety-objectives-full-version-1101.5842</loc><lastmod>2011-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-memory-efficient-real-time-controllers-for-safety-objectives-full-version-1101.5842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-memory-efficient-real-time-controllers-for-safety-objectives-full-version-1101.5842"/></url>
<url><loc>https://scifaro.com/en/abs/weak-mu-equality-is-decidable-1102.0155</loc><lastmod>2011-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-mu-equality-is-decidable-1102.0155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-mu-equality-is-decidable-1102.0155"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-via-strong-normalisation-in-an-algebraic-lambda-calculus-with-rewriting-1102.0749</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-via-strong-normalisation-in-an-algebraic-lambda-calculus-with-rewriting-1102.0749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-via-strong-normalisation-in-an-algebraic-lambda-calculus-with-rewriting-1102.0749"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-face-of-the-branching-recurrence-of-computability-logic-1102.1054</loc><lastmod>2012-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-face-of-the-branching-recurrence-of-computability-logic-1102.1054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-face-of-the-branching-recurrence-of-computability-logic-1102.1054"/></url>
<url><loc>https://scifaro.com/en/abs/residuated-park-theories-1102.1139</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/residuated-park-theories-1102.1139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/residuated-park-theories-1102.1139"/></url>
<url><loc>https://scifaro.com/en/abs/type-classes-for-mathematics-in-type-theory-1102.1323</loc><lastmod>2011-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-classes-for-mathematics-in-type-theory-1102.1323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-classes-for-mathematics-in-type-theory-1102.1323"/></url>
<url><loc>https://scifaro.com/en/abs/ologs-a-categorical-framework-for-knowledge-representation-1102.1889</loc><lastmod>2015-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ologs-a-categorical-framework-for-knowledge-representation-1102.1889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ologs-a-categorical-framework-for-knowledge-representation-1102.1889"/></url>
<url><loc>https://scifaro.com/en/abs/on-paraconsistent-weakening-of-intuitionistic-negation-1102.1935</loc><lastmod>2011-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-paraconsistent-weakening-of-intuitionistic-negation-1102.1935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-paraconsistent-weakening-of-intuitionistic-negation-1102.1935"/></url>
<url><loc>https://scifaro.com/en/abs/erratum-to-model-checking-continuous-time-markov-chains-by-aziz-et-al-1102.2079</loc><lastmod>2011-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/erratum-to-model-checking-continuous-time-markov-chains-by-aziz-et-al-1102.2079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/erratum-to-model-checking-continuous-time-markov-chains-by-aziz-et-al-1102.2079"/></url>
<url><loc>https://scifaro.com/en/abs/linear-temporal-logic-and-propositional-schemata-back-and-forth-extended-version-1102.2174</loc><lastmod>2011-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-temporal-logic-and-propositional-schemata-back-and-forth-extended-version-1102.2174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-temporal-logic-and-propositional-schemata-back-and-forth-extended-version-1102.2174"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-expansions-of-labelled-linear-orderings-1102.2232</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-expansions-of-labelled-linear-orderings-1102.2232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-expansions-of-labelled-linear-orderings-1102.2232"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-computing-with-terms-and-graphs-1102.2268</loc><lastmod>2011-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-computing-with-terms-and-graphs-1102.2268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-computing-with-terms-and-graphs-1102.2268"/></url>
<url><loc>https://scifaro.com/en/abs/stuttering-equivalence-for-parity-games-1102.2366</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stuttering-equivalence-for-parity-games-1102.2366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stuttering-equivalence-for-parity-games-1102.2366"/></url>
<url><loc>https://scifaro.com/en/abs/a-modular-type-checking-algorithm-for-type-theory-with-singleton-types-and-proof-irrelevance-1102.2405</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modular-type-checking-algorithm-for-type-theory-with-singleton-types-and-proof-irrelevance-1102.2405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modular-type-checking-algorithm-for-type-theory-with-singleton-types-and-proof-irrelevance-1102.2405"/></url>
<url><loc>https://scifaro.com/en/abs/co-ordering-and-type-2-co-ordering-1102.2489</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-ordering-and-type-2-co-ordering-1102.2489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-ordering-and-type-2-co-ordering-1102.2489"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-method-for-policy-enforcement-over-evolving-audit-logs-1102.2521</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-method-for-policy-enforcement-over-evolving-audit-logs-1102.2521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-method-for-policy-enforcement-over-evolving-audit-logs-1102.2521"/></url>
<url><loc>https://scifaro.com/en/abs/term-graph-rewriting-and-parallel-term-rewriting-1102.2651</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/term-graph-rewriting-and-parallel-term-rewriting-1102.2651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/term-graph-rewriting-and-parallel-term-rewriting-1102.2651"/></url>
<url><loc>https://scifaro.com/en/abs/dependently-typed-formalisation-of-typed-term-graphs-1102.2653</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependently-typed-formalisation-of-typed-term-graphs-1102.2653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependently-typed-formalisation-of-typed-term-graphs-1102.2653"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-graphical-calculus-of-proofs-1102.2655</loc><lastmod>2011-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-graphical-calculus-of-proofs-1102.2655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-graphical-calculus-of-proofs-1102.2655"/></url>
<url><loc>https://scifaro.com/en/abs/finitely-generated-free-heyting-algebras-via-birkhoff-duality-and-coalgebra-1102.2828</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitely-generated-free-heyting-algebras-via-birkhoff-duality-and-coalgebra-1102.2828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitely-generated-free-heyting-algebras-via-birkhoff-duality-and-coalgebra-1102.2828"/></url>
<url><loc>https://scifaro.com/en/abs/tight-upper-bounds-for-streett-and-parity-complementation-1102.2960</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-upper-bounds-for-streett-and-parity-complementation-1102.2960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-upper-bounds-for-streett-and-parity-complementation-1102.2960"/></url>
<url><loc>https://scifaro.com/en/abs/a-tight-lower-bound-for-streett-complementation-1102.2963</loc><lastmod>2011-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-streett-complementation-1102.2963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tight-lower-bound-for-streett-complementation-1102.2963"/></url>
<url><loc>https://scifaro.com/en/abs/automated-complexity-analysis-based-on-the-dependency-pair-method-1102.3129</loc><lastmod>2011-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-complexity-analysis-based-on-the-dependency-pair-method-1102.3129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-complexity-analysis-based-on-the-dependency-pair-method-1102.3129"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-higher-order-rewriting-1102.3465</loc><lastmod>2011-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-higher-order-rewriting-1102.3465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-5th-international-workshop-on-higher-order-rewriting-1102.3465"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-permissiveness-in-parity-games-mean-payoff-parity-games-revisited-1102.3615</loc><lastmod>2013-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-permissiveness-in-parity-games-mean-payoff-parity-games-revisited-1102.3615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-permissiveness-in-parity-games-mean-payoff-parity-games-revisited-1102.3615"/></url>
<url><loc>https://scifaro.com/en/abs/swapping-a-natural-bridge-between-named-and-indexed-explicit-substitution-calculi-1102.3730</loc><lastmod>2011-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/swapping-a-natural-bridge-between-named-and-indexed-explicit-substitution-calculi-1102.3730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/swapping-a-natural-bridge-between-named-and-indexed-explicit-substitution-calculi-1102.3730"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-implementation-of-dynamic-patterns-1102.3731</loc><lastmod>2011-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-implementation-of-dynamic-patterns-1102.3731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-implementation-of-dynamic-patterns-1102.3731"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-rewriting-for-executable-compiler-specifications-1102.3732</loc><lastmod>2011-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-rewriting-for-executable-compiler-specifications-1102.3732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-rewriting-for-executable-compiler-specifications-1102.3732"/></url>
<url><loc>https://scifaro.com/en/abs/uncurrying-for-innermost-termination-and-derivational-complexity-1102.3733</loc><lastmod>2011-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uncurrying-for-innermost-termination-and-derivational-complexity-1102.3733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uncurrying-for-innermost-termination-and-derivational-complexity-1102.3733"/></url>
<url><loc>https://scifaro.com/en/abs/a-standardisation-proof-for-algebraic-pattern-calculi-1102.3734</loc><lastmod>2011-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-standardisation-proof-for-algebraic-pattern-calculi-1102.3734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-standardisation-proof-for-algebraic-pattern-calculi-1102.3734"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-aspects-of-synthesis-1102.4117</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-aspects-of-synthesis-1102.4117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-aspects-of-synthesis-1102.4117"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-systems-with-optimal-average-case-behavior-for-ratio-objectives-1102.4118</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-systems-with-optimal-average-case-behavior-for-ratio-objectives-1102.4118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-systems-with-optimal-average-case-behavior-for-ratio-objectives-1102.4118"/></url>
<url><loc>https://scifaro.com/en/abs/a-ltl-fragment-for-gr-1-synthesis-1102.4119</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ltl-fragment-for-gr-1-synthesis-1102.4119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ltl-fragment-for-gr-1-synthesis-1102.4119"/></url>
<url><loc>https://scifaro.com/en/abs/synchronizing-objectives-for-markov-decision-processes-1102.4121</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronizing-objectives-for-markov-decision-processes-1102.4121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronizing-objectives-for-markov-decision-processes-1102.4121"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-atl-under-imperfect-information-and-perfect-recall-semantics-is-undecidable-1102.4225</loc><lastmod>2011-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-atl-under-imperfect-information-and-perfect-recall-semantics-is-undecidable-1102.4225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-atl-under-imperfect-information-and-perfect-recall-semantics-is-undecidable-1102.4225"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-of-relational-syllogistic-incorporating-full-boolean-reasoning-1102.4496</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-of-relational-syllogistic-incorporating-full-boolean-reasoning-1102.4496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-of-relational-syllogistic-incorporating-full-boolean-reasoning-1102.4496"/></url>
<url><loc>https://scifaro.com/en/abs/modal-calculus-of-illocutionary-logic-1102.4636</loc><lastmod>2011-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-calculus-of-illocutionary-logic-1102.4636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-calculus-of-illocutionary-logic-1102.4636"/></url>
<url><loc>https://scifaro.com/en/abs/a-spatial-epistemic-logic-for-reasoning-about-security-protocols-1102.5584</loc><lastmod>2011-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spatial-epistemic-logic-for-reasoning-about-security-protocols-1102.5584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spatial-epistemic-logic-for-reasoning-about-security-protocols-1102.5584"/></url>
<url><loc>https://scifaro.com/en/abs/on-expressive-powers-of-timed-logics-comparing-boundedness-non-punctuality-and-deterministic-freezing-1102.5638</loc><lastmod>2013-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-expressive-powers-of-timed-logics-comparing-boundedness-non-punctuality-and-deterministic-freezing-1102.5638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-expressive-powers-of-timed-logics-comparing-boundedness-non-punctuality-and-deterministic-freezing-1102.5638"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-representation-theorem-for-many-valued-modal-logics-1103.0217</loc><lastmod>2011-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-representation-theorem-for-many-valued-modal-logics-1103.0217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-representation-theorem-for-many-valued-modal-logics-1103.0217"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-and-asynchronous-semantics-via-normalized-coalgebras-1103.0437</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-and-asynchronous-semantics-via-normalized-coalgebras-1103.0437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-and-asynchronous-semantics-via-normalized-coalgebras-1103.0437"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-logic-many-valuedness-and-intensionality-1103.0676</loc><lastmod>2011-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-logic-many-valuedness-and-intensionality-1103.0676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-logic-many-valuedness-and-intensionality-1103.0676"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-modality-and-intensionality-1103.0680</loc><lastmod>2011-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-modality-and-intensionality-1103.0680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-modality-and-intensionality-1103.0680"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-satisfiability-for-the-description-logic-alc-1103.0853</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-satisfiability-for-the-description-logic-alc-1103.0853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-satisfiability-for-the-description-logic-alc-1103.0853"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-many-valued-into-two-valued-modal-logics-1103.0920</loc><lastmod>2011-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-many-valued-into-two-valued-modal-logics-1103.0920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-many-valued-into-two-valued-modal-logics-1103.0920"/></url>
<url><loc>https://scifaro.com/en/abs/intensionality-and-two-steps-interpretations-1103.0967</loc><lastmod>2011-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intensionality-and-two-steps-interpretations-1103.0967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intensionality-and-two-steps-interpretations-1103.0967"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-probabilistic-logic-programs-state-and-revision-1103.1061</loc><lastmod>2011-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-probabilistic-logic-programs-state-and-revision-1103.1061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-probabilistic-logic-programs-state-and-revision-1103.1061"/></url>
<url><loc>https://scifaro.com/en/abs/binary-sequent-calculi-for-truth-invariance-entailment-of-finite-many-valued-logics-1103.1334</loc><lastmod>2011-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-sequent-calculi-for-truth-invariance-entailment-of-finite-many-valued-logics-1103.1334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-sequent-calculi-for-truth-invariance-entailment-of-finite-many-valued-logics-1103.1334"/></url>
<url><loc>https://scifaro.com/en/abs/well-structured-program-equivalence-is-highly-undecidable-1103.1433</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-structured-program-equivalence-is-highly-undecidable-1103.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-structured-program-equivalence-is-highly-undecidable-1103.1433"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-a-time-triggered-hardware-interface-1103.2246</loc><lastmod>2011-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-a-time-triggered-hardware-interface-1103.2246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-a-time-triggered-hardware-interface-1103.2246"/></url>
<url><loc>https://scifaro.com/en/abs/three-qubit-entanglement-within-graphical-z-x-calculus-1103.2811</loc><lastmod>2011-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-qubit-entanglement-within-graphical-z-x-calculus-1103.2811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-qubit-entanglement-within-graphical-z-x-calculus-1103.2811"/></url>
<url><loc>https://scifaro.com/en/abs/the-ghz-w-calculus-contains-rational-arithmetic-1103.2812</loc><lastmod>2011-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ghz-w-calculus-contains-rational-arithmetic-1103.2812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ghz-w-calculus-contains-rational-arithmetic-1103.2812"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-types-for-proofs-and-programs-revised-selected-papers-1103.3111</loc><lastmod>2011-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-types-for-proofs-and-programs-revised-selected-papers-1103.3111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-types-for-proofs-and-programs-revised-selected-papers-1103.3111"/></url>
<url><loc>https://scifaro.com/en/abs/generic-trace-logics-1103.3239</loc><lastmod>2011-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-trace-logics-1103.3239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-trace-logics-1103.3239"/></url>
<url><loc>https://scifaro.com/en/abs/superposition-as-a-logical-glue-1103.3319</loc><lastmod>2011-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superposition-as-a-logical-glue-1103.3319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superposition-as-a-logical-glue-1103.3319"/></url>
<url><loc>https://scifaro.com/en/abs/nonuniform-coercions-via-unification-hints-1103.3320</loc><lastmod>2011-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonuniform-coercions-via-unification-hints-1103.3320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonuniform-coercions-via-unification-hints-1103.3320"/></url>
<url><loc>https://scifaro.com/en/abs/typed-operational-semantics-for-dependent-record-types-1103.3321</loc><lastmod>2011-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-operational-semantics-for-dependent-record-types-1103.3321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-operational-semantics-for-dependent-record-types-1103.3321"/></url>
<url><loc>https://scifaro.com/en/abs/stateless-hol-1103.3322</loc><lastmod>2011-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateless-hol-1103.3322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateless-hol-1103.3322"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-paraconsistent-logics-1103.4324</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-paraconsistent-logics-1103.4324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-paraconsistent-logics-1103.4324"/></url>
<url><loc>https://scifaro.com/en/abs/multiply-recursive-upper-bounds-with-higman-s-lemma-1103.4399</loc><lastmod>2011-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiply-recursive-upper-bounds-with-higman-s-lemma-1103.4399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiply-recursive-upper-bounds-with-higman-s-lemma-1103.4399"/></url>
<url><loc>https://scifaro.com/en/abs/real-islamic-logic-1103.4515</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-islamic-logic-1103.4515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-islamic-logic-1103.4515"/></url>
<url><loc>https://scifaro.com/en/abs/logical-metric-and-algorithmic-characterisations-of-probabilistic-bisimulation-1103.4577</loc><lastmod>2011-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-metric-and-algorithmic-characterisations-of-probabilistic-bisimulation-1103.4577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-metric-and-algorithmic-characterisations-of-probabilistic-bisimulation-1103.4577"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-synthesis-of-switching-controllers-for-linear-hybrid-automata-1103.4584</loc><lastmod>2011-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-synthesis-of-switching-controllers-for-linear-hybrid-automata-1103.4584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-synthesis-of-switching-controllers-for-linear-hybrid-automata-1103.4584"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-and-inductive-calculi-are-equivalent-1103.4694</loc><lastmod>2011-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-and-inductive-calculi-are-equivalent-1103.4694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-and-inductive-calculi-are-equivalent-1103.4694"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-ctl-is-almost-always-inherently-sequential-1103.4990</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-ctl-is-almost-always-inherently-sequential-1103.4990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-ctl-is-almost-always-inherently-sequential-1103.4990"/></url>
<url><loc>https://scifaro.com/en/abs/termination-proofs-in-the-dependency-pair-framework-may-induce-multiple-recursive-derivational-complexity-1103.5082</loc><lastmod>2011-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-proofs-in-the-dependency-pair-framework-may-induce-multiple-recursive-derivational-complexity-1103.5082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-proofs-in-the-dependency-pair-framework-may-induce-multiple-recursive-derivational-complexity-1103.5082"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-randomized-matching-algorithms-1103.5215</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-randomized-matching-algorithms-1103.5215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-randomized-matching-algorithms-1103.5215"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-correspondence-between-display-postulates-and-deep-inference-in-nested-sequent-calculi-for-tense-logics-1103.5286</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-correspondence-between-display-postulates-and-deep-inference-in-nested-sequent-calculi-for-tense-logics-1103.5286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-correspondence-between-display-postulates-and-deep-inference-in-nested-sequent-calculi-for-tense-logics-1103.5286"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-processes-of-place-transition-systems-1103.5916</loc><lastmod>2011-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-processes-of-place-transition-systems-1103.5916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-processes-of-place-transition-systems-1103.5916"/></url>
<url><loc>https://scifaro.com/en/abs/the-decidability-frontier-for-probabilistic-automata-on-infinite-words-1104.0127</loc><lastmod>2011-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-decidability-frontier-for-probabilistic-automata-on-infinite-words-1104.0127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-decidability-frontier-for-probabilistic-automata-on-infinite-words-1104.0127"/></url>
<url><loc>https://scifaro.com/en/abs/linear-dependent-types-and-relative-completeness-1104.0193</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-dependent-types-and-relative-completeness-1104.0193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-dependent-types-and-relative-completeness-1104.0193"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-operational-semantics-for-the-lambda-calculus-1104.0195</loc><lastmod>2011-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-operational-semantics-for-the-lambda-calculus-1104.0195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-operational-semantics-for-the-lambda-calculus-1104.0195"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-of-connectedness-constraints-in-2d-and-3d-euclidean-spaces-1104.0219</loc><lastmod>2011-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-of-connectedness-constraints-in-2d-and-3d-euclidean-spaces-1104.0219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-of-connectedness-constraints-in-2d-and-3d-euclidean-spaces-1104.0219"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theoretic-soundness-and-completeness-1104.0379</loc><lastmod>2022-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theoretic-soundness-and-completeness-1104.0379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theoretic-soundness-and-completeness-1104.0379"/></url>
<url><loc>https://scifaro.com/en/abs/a-cut-free-exptime-tableau-decision-procedure-for-the-logic-extending-converse-pdl-with-regular-inclusion-axioms-1104.0405</loc><lastmod>2012-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cut-free-exptime-tableau-decision-procedure-for-the-logic-extending-converse-pdl-with-regular-inclusion-axioms-1104.0405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cut-free-exptime-tableau-decision-procedure-for-the-logic-extending-converse-pdl-with-regular-inclusion-axioms-1104.0405"/></url>
<url><loc>https://scifaro.com/en/abs/ludics-with-repetitions-exponentials-interactive-types-and-completeness-1104.0504</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ludics-with-repetitions-exponentials-interactive-types-and-completeness-1104.0504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ludics-with-repetitions-exponentials-interactive-types-and-completeness-1104.0504"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-results-for-modal-dependence-logic-1104.0607</loc><lastmod>2011-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-results-for-modal-dependence-logic-1104.0607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-results-for-modal-dependence-logic-1104.0607"/></url>
<url><loc>https://scifaro.com/en/abs/computing-optimal-coverability-costs-in-priced-timed-petri-nets-1104.0617</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-optimal-coverability-costs-in-priced-timed-petri-nets-1104.0617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-optimal-coverability-costs-in-priced-timed-petri-nets-1104.0617"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-model-checking-for-modal-dependence-logic-1104.1034</loc><lastmod>2012-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-model-checking-for-modal-dependence-logic-1104.1034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-model-checking-for-modal-dependence-logic-1104.1034"/></url>
<url><loc>https://scifaro.com/en/abs/logical-varieties-in-normative-reasoning-1104.1466</loc><lastmod>2011-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-varieties-in-normative-reasoning-1104.1466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-varieties-in-normative-reasoning-1104.1466"/></url>
<url><loc>https://scifaro.com/en/abs/a-family-of-encodings-for-translating-pseudo-boolean-constraints-into-sat-1104.1479</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-family-of-encodings-for-translating-pseudo-boolean-constraints-into-sat-1104.1479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-family-of-encodings-for-translating-pseudo-boolean-constraints-into-sat-1104.1479"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-emptiness-check-for-timed-b-uchi-automata-extended-version-1104.1540</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-emptiness-check-for-timed-b-uchi-automata-extended-version-1104.1540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-emptiness-check-for-timed-b-uchi-automata-extended-version-1104.1540"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-turing-machines-1104.1738</loc><lastmod>2013-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-turing-machines-1104.1738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-turing-machines-1104.1738"/></url>
<url><loc>https://scifaro.com/en/abs/on-bisimulations-for-description-logics-1104.1964</loc><lastmod>2015-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bisimulations-for-description-logics-1104.1964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bisimulations-for-description-logics-1104.1964"/></url>
<url><loc>https://scifaro.com/en/abs/the-structure-of-differential-invariants-and-differential-cut-elimination-1104.1987</loc><lastmod>2015-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-structure-of-differential-invariants-and-differential-cut-elimination-1104.1987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-structure-of-differential-invariants-and-differential-cut-elimination-1104.1987"/></url>
<url><loc>https://scifaro.com/en/abs/amortised-resource-analysis-with-separation-logic-1104.1998</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/amortised-resource-analysis-with-separation-logic-1104.1998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/amortised-resource-analysis-with-separation-logic-1104.1998"/></url>
<url><loc>https://scifaro.com/en/abs/finite-satisfiability-for-guarded-fixpoint-logic-1104.2262</loc><lastmod>2012-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-satisfiability-for-guarded-fixpoint-logic-1104.2262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-satisfiability-for-guarded-fixpoint-logic-1104.2262"/></url>
<url><loc>https://scifaro.com/en/abs/towards-normal-forms-for-ghz-w-calculus-1104.2480</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-normal-forms-for-ghz-w-calculus-1104.2480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-normal-forms-for-ghz-w-calculus-1104.2480"/></url>
<url><loc>https://scifaro.com/en/abs/sound-and-complete-axiomatizations-of-coalgebraic-language-equivalence-1104.2803</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-and-complete-axiomatizations-of-coalgebraic-language-equivalence-1104.2803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-and-complete-axiomatizations-of-coalgebraic-language-equivalence-1104.2803"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-for-uniform-interpolation-and-forgetting-in-expressive-description-logics-1104.2825</loc><lastmod>2011-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-for-uniform-interpolation-and-forgetting-in-expressive-description-logics-1104.2825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-for-uniform-interpolation-and-forgetting-in-expressive-description-logics-1104.2825"/></url>
<url><loc>https://scifaro.com/en/abs/description-logic-tboxes-model-theoretic-characterizations-and-rewritability-1104.2844</loc><lastmod>2011-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/description-logic-tboxes-model-theoretic-characterizations-and-rewritability-1104.2844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/description-logic-tboxes-model-theoretic-characterizations-and-rewritability-1104.2844"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-calculus-for-asynchronous-side-effecting-processes-1104.2936</loc><lastmod>2011-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-calculus-for-asynchronous-side-effecting-processes-1104.2936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-calculus-for-asynchronous-side-effecting-processes-1104.2936"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-two-variable-dependence-logic-and-if-logic-1104.3148</loc><lastmod>2011-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-two-variable-dependence-logic-and-if-logic-1104.3148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-two-variable-dependence-logic-and-if-logic-1104.3148"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-breaking-for-distributed-multi-context-systems-1104.3931</loc><lastmod>2011-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-breaking-for-distributed-multi-context-systems-1104.3931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-breaking-for-distributed-multi-context-systems-1104.3931"/></url>
<url><loc>https://scifaro.com/en/abs/automated-synthesis-of-tableau-calculi-1104.4131</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-synthesis-of-tableau-calculi-1104.4131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-synthesis-of-tableau-calculi-1104.4131"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-csl-model-checking-using-stratification-1104.4983</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-csl-model-checking-using-stratification-1104.4983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-csl-model-checking-using-stratification-1104.4983"/></url>
<url><loc>https://scifaro.com/en/abs/on-reachability-for-hybrid-automata-over-bounded-time-1104.5335</loc><lastmod>2011-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reachability-for-hybrid-automata-over-bounded-time-1104.5335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reachability-for-hybrid-automata-over-bounded-time-1104.5335"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-module-system-1105.0548</loc><lastmod>2011-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-module-system-1105.0548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-module-system-1105.0548"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-of-boolean-process-models-1105.0653</loc><lastmod>2011-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-of-boolean-process-models-1105.0653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-of-boolean-process-models-1105.0653"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplest-undecidable-modal-logic-1105.0845</loc><lastmod>2011-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplest-undecidable-modal-logic-1105.0845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplest-undecidable-modal-logic-1105.0845"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-the-efficiency-of-asynchronous-systems-with-fase-1105.1369</loc><lastmod>2011-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-the-efficiency-of-asynchronous-systems-with-fase-1105.1369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-the-efficiency-of-asynchronous-systems-with-fase-1105.1369"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-the-evaluation-of-worst-case-system-efficiency-1105.1370</loc><lastmod>2011-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-the-evaluation-of-worst-case-system-efficiency-1105.1370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-the-evaluation-of-worst-case-system-efficiency-1105.1370"/></url>
<url><loc>https://scifaro.com/en/abs/finitary-deduction-systems-1105.1376</loc><lastmod>2011-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitary-deduction-systems-1105.1376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitary-deduction-systems-1105.1376"/></url>
<url><loc>https://scifaro.com/en/abs/noncomputable-functions-in-the-blum-shub-smale-model-1105.1380</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/noncomputable-functions-in-the-blum-shub-smale-model-1105.1380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/noncomputable-functions-in-the-blum-shub-smale-model-1105.1380"/></url>
<url><loc>https://scifaro.com/en/abs/exptime-tableaux-for-the-coalgebraic-mu-calculus-1105.2246</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exptime-tableaux-for-the-coalgebraic-mu-calculus-1105.2246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exptime-tableaux-for-the-coalgebraic-mu-calculus-1105.2246"/></url>
<url><loc>https://scifaro.com/en/abs/trx-a-formally-verified-parser-interpreter-1105.2576</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trx-a-formally-verified-parser-interpreter-1105.2576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trx-a-formally-verified-parser-interpreter-1105.2576"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-backward-slicing-of-rewriting-logic-computations-1105.2665</loc><lastmod>2011-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-backward-slicing-of-rewriting-logic-computations-1105.2665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-backward-slicing-of-rewriting-logic-computations-1105.2665"/></url>
<url><loc>https://scifaro.com/en/abs/a-foundational-view-on-integration-problems-1105.2725</loc><lastmod>2011-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-foundational-view-on-integration-problems-1105.2725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-foundational-view-on-integration-problems-1105.2725"/></url>
<url><loc>https://scifaro.com/en/abs/computer-certified-efficient-exact-reals-in-coq-1105.2751</loc><lastmod>2011-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-certified-efficient-exact-reals-in-coq-1105.2751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-certified-efficient-exact-reals-in-coq-1105.2751"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchies-in-dependence-logic-1105.3324</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchies-in-dependence-logic-1105.3324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchies-in-dependence-logic-1105.3324"/></url>
<url><loc>https://scifaro.com/en/abs/relating-weight-constraint-and-aggregate-programs-semantics-and-representation-1105.3414</loc><lastmod>2011-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-weight-constraint-and-aggregate-programs-semantics-and-representation-1105.3414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-weight-constraint-and-aggregate-programs-semantics-and-representation-1105.3414"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-query-evaluation-on-structures-of-bounded-degree-1105.3583</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-query-evaluation-on-structures-of-bounded-degree-1105.3583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-query-evaluation-on-structures-of-bounded-degree-1105.3583"/></url>
<url><loc>https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-i-1105.3853</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-i-1105.3853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-i-1105.3853"/></url>
<url><loc>https://scifaro.com/en/abs/logical-modelling-of-physarum-polycephalum-1105.4060</loc><lastmod>2011-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-modelling-of-physarum-polycephalum-1105.4060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-modelling-of-physarum-polycephalum-1105.4060"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-kleene-algebras-in-coq-1105.4537</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-kleene-algebras-in-coq-1105.4537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-kleene-algebras-in-coq-1105.4537"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-construction-of-hanf-sentences-1105.5487</loc><lastmod>2011-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-construction-of-hanf-sentences-1105.5487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-construction-of-hanf-sentences-1105.5487"/></url>
<url><loc>https://scifaro.com/en/abs/generic-traces-and-constraints-gentra4cp-revisited-1105.6210</loc><lastmod>2011-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-traces-and-constraints-gentra4cp-revisited-1105.6210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-traces-and-constraints-gentra4cp-revisited-1105.6210"/></url>
<url><loc>https://scifaro.com/en/abs/monotonicity-constraints-for-termination-in-the-integer-domain-1105.6317</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonicity-constraints-for-termination-in-the-integer-domain-1105.6317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonicity-constraints-for-termination-in-the-integer-domain-1105.6317"/></url>
<url><loc>https://scifaro.com/en/abs/focalization-and-phase-models-for-classical-extensions-of-non-associative-lambek-calculus-1106.0399</loc><lastmod>2011-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focalization-and-phase-models-for-classical-extensions-of-non-associative-lambek-calculus-1106.0399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focalization-and-phase-models-for-classical-extensions-of-non-associative-lambek-calculus-1106.0399"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-second-international-symposium-on-games-automata-logics-and-formal-verification-1106.0814</loc><lastmod>2011-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-second-international-symposium-on-games-automata-logics-and-formal-verification-1106.0814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-second-international-symposium-on-games-automata-logics-and-formal-verification-1106.0814"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-from-recursive-components-libraries-1106.1228</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-from-recursive-components-libraries-1106.1228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-from-recursive-components-libraries-1106.1228"/></url>
<url><loc>https://scifaro.com/en/abs/improving-bdd-based-symbolic-model-checking-with-isomorphism-exploiting-transition-relations-1106.1229</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-bdd-based-symbolic-model-checking-with-isomorphism-exploiting-transition-relations-1106.1229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-bdd-based-symbolic-model-checking-with-isomorphism-exploiting-transition-relations-1106.1229"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-reveals-relation-in-occurrence-nets-1106.1230</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-reveals-relation-in-occurrence-nets-1106.1230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-reveals-relation-in-occurrence-nets-1106.1230"/></url>
<url><loc>https://scifaro.com/en/abs/automated-analysis-of-mutex-algorithms-with-fase-1106.1231</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-analysis-of-mutex-algorithms-with-fase-1106.1231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-analysis-of-mutex-algorithms-with-fase-1106.1231"/></url>
<url><loc>https://scifaro.com/en/abs/type-inference-for-bimorphic-recursion-1106.1234</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-inference-for-bimorphic-recursion-1106.1234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-inference-for-bimorphic-recursion-1106.1234"/></url>
<url><loc>https://scifaro.com/en/abs/new-results-on-pushdown-module-checking-with-imperfect-information-1106.1239</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-results-on-pushdown-module-checking-with-imperfect-information-1106.1239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-results-on-pushdown-module-checking-with-imperfect-information-1106.1239"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-decision-procedure-for-mpnl-over-the-integers-1106.1241</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-decision-procedure-for-mpnl-over-the-integers-1106.1241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-decision-procedure-for-mpnl-over-the-integers-1106.1241"/></url>
<url><loc>https://scifaro.com/en/abs/separation-of-test-free-propositional-dynamic-logics-over-context-free-languages-1106.1242</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-of-test-free-propositional-dynamic-logics-over-context-free-languages-1106.1242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-of-test-free-propositional-dynamic-logics-over-context-free-languages-1106.1242"/></url>
<url><loc>https://scifaro.com/en/abs/on-p-transitive-graphs-and-applications-1106.1243</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-p-transitive-graphs-and-applications-1106.1243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-p-transitive-graphs-and-applications-1106.1243"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-reachability-for-3-dimensional-multi-linear-systems-1106.1245</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-reachability-for-3-dimensional-multi-linear-systems-1106.1245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-reachability-for-3-dimensional-multi-linear-systems-1106.1245"/></url>
<url><loc>https://scifaro.com/en/abs/towards-efficient-exact-synthesis-for-linear-hybrid-systems-1106.1246</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-efficient-exact-synthesis-for-linear-hybrid-systems-1106.1246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-efficient-exact-synthesis-for-linear-hybrid-systems-1106.1246"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-abstractions-with-arbitrary-domains-1106.1364</loc><lastmod>2011-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-abstractions-with-arbitrary-domains-1106.1364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-abstractions-with-arbitrary-domains-1106.1364"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-dynamically-propositional-logic-structures-in-sat-1106.1370</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-dynamically-propositional-logic-structures-in-sat-1106.1370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-dynamically-propositional-logic-structures-in-sat-1106.1370"/></url>
<url><loc>https://scifaro.com/en/abs/phase-selection-heuristics-for-satisfiability-solvers-1106.1372</loc><lastmod>2011-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phase-selection-heuristics-for-satisfiability-solvers-1106.1372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phase-selection-heuristics-for-satisfiability-solvers-1106.1372"/></url>
<url><loc>https://scifaro.com/en/abs/coarse-abstractions-make-zeno-behaviours-difficult-to-detect-1106.1850</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coarse-abstractions-make-zeno-behaviours-difficult-to-detect-1106.1850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coarse-abstractions-make-zeno-behaviours-difficult-to-detect-1106.1850"/></url>
<url><loc>https://scifaro.com/en/abs/ticket-entailment-is-decidable-1106.1875</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ticket-entailment-is-decidable-1106.1875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ticket-entailment-is-decidable-1106.1875"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-results-for-1-safe-petri-nets-1106.2122</loc><lastmod>2011-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-results-for-1-safe-petri-nets-1106.2122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-results-for-1-safe-petri-nets-1106.2122"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-meet-pctl-equivalences-for-probabilistic-automata-1106.2181</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-meet-pctl-equivalences-for-probabilistic-automata-1106.2181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-meet-pctl-equivalences-for-probabilistic-automata-1106.2181"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-and-completeness-of-the-cirquent-calculus-system-cl6-for-computability-logic-1106.2272</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-and-completeness-of-the-cirquent-calculus-system-cl6-for-computability-logic-1106.2272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-and-completeness-of-the-cirquent-calculus-system-cl6-for-computability-logic-1106.2272"/></url>
<url><loc>https://scifaro.com/en/abs/cut-free-exptime-tableaux-for-checking-satisfiability-of-a-knowledge-base-in-the-description-logic-shi-1106.2305</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-free-exptime-tableaux-for-checking-satisfiability-of-a-knowledge-base-in-the-description-logic-shi-1106.2305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-free-exptime-tableaux-for-checking-satisfiability-of-a-knowledge-base-in-the-description-logic-shi-1106.2305"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-embedded-c-software-with-timing-constraints-using-an-untimed-model-checker-1106.2320</loc><lastmod>2011-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-embedded-c-software-with-timing-constraints-using-an-untimed-model-checker-1106.2320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-embedded-c-software-with-timing-constraints-using-an-untimed-model-checker-1106.2320"/></url>
<url><loc>https://scifaro.com/en/abs/cognitive-binary-logic-the-natural-unified-formal-theory-of-propositional-binary-logic-1106.2352</loc><lastmod>2011-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cognitive-binary-logic-the-natural-unified-formal-theory-of-propositional-binary-logic-1106.2352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cognitive-binary-logic-the-natural-unified-formal-theory-of-propositional-binary-logic-1106.2352"/></url>
<url><loc>https://scifaro.com/en/abs/co-c-e-spheres-and-cells-in-computable-metric-spaces-1106.2769</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-c-e-spheres-and-cells-in-computable-metric-spaces-1106.2769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-c-e-spheres-and-cells-in-computable-metric-spaces-1106.2769"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-randomness-and-capacity-of-closed-sets-1106.2993</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-randomness-and-capacity-of-closed-sets-1106.2993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-randomness-and-capacity-of-closed-sets-1106.2993"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-mean-payoff-automaton-expression-1106.3054</loc><lastmod>2012-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-mean-payoff-automaton-expression-1106.3054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-mean-payoff-automaton-expression-1106.3054"/></url>
<url><loc>https://scifaro.com/en/abs/type-classes-for-efficient-exact-real-arithmetic-in-coq-1106.3448</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-classes-for-efficient-exact-real-arithmetic-in-coq-1106.3448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-classes-for-efficient-exact-real-arithmetic-in-coq-1106.3448"/></url>
<url><loc>https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-ii-1106.3705</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-ii-1106.3705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-taming-of-recurrences-in-computability-logic-through-cirquent-calculus-part-ii-1106.3705"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-quantum-programs-1106.4063</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-quantum-programs-1106.4063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-quantum-programs-1106.4063"/></url>
<url><loc>https://scifaro.com/en/abs/discovery-of-invariants-through-automated-theory-formation-1106.4090</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discovery-of-invariants-through-automated-theory-formation-1106.4090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discovery-of-invariants-through-automated-theory-formation-1106.4090"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-by-interpretation-in-pi-institutions-1106.4093</loc><lastmod>2019-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-by-interpretation-in-pi-institutions-1106.4093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-by-interpretation-in-pi-institutions-1106.4093"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-based-verification-of-sequential-implementations-of-stateflow-charts-1106.4094</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-based-verification-of-sequential-implementations-of-stateflow-charts-1106.4094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-based-verification-of-sequential-implementations-of-stateflow-charts-1106.4094"/></url>
<url><loc>https://scifaro.com/en/abs/model-exploration-and-analysis-for-quantitative-safety-refinement-in-probabilistic-b-1106.4096</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-exploration-and-analysis-for-quantitative-safety-refinement-in-probabilistic-b-1106.4096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-exploration-and-analysis-for-quantitative-safety-refinement-in-probabilistic-b-1106.4096"/></url>
<url><loc>https://scifaro.com/en/abs/a-csp-account-of-event-b-refinement-1106.4098</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-csp-account-of-event-b-refinement-1106.4098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-csp-account-of-event-b-refinement-1106.4098"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-scheduling-of-event-b-models-1106.4100</loc><lastmod>2011-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-scheduling-of-event-b-models-1106.4100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-scheduling-of-event-b-models-1106.4100"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-existence-and-construction-of-a-complement-of-a-given-function-1106.4102</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-existence-and-construction-of-a-complement-of-a-given-function-1106.4102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-existence-and-construction-of-a-complement-of-a-given-function-1106.4102"/></url>
<url><loc>https://scifaro.com/en/abs/permission-based-separation-logic-for-message-passing-concurrency-1106.5128</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permission-based-separation-logic-for-message-passing-concurrency-1106.5128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permission-based-separation-logic-for-message-passing-concurrency-1106.5128"/></url>
<url><loc>https://scifaro.com/en/abs/set-systems-order-types-continuous-nondeterministic-deformations-and-quasi-orders-1106.5294</loc><lastmod>2011-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-systems-order-types-continuous-nondeterministic-deformations-and-quasi-orders-1106.5294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-systems-order-types-continuous-nondeterministic-deformations-and-quasi-orders-1106.5294"/></url>
<url><loc>https://scifaro.com/en/abs/connection-and-dispersion-of-computation-1106.5470</loc><lastmod>2011-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connection-and-dispersion-of-computation-1106.5470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connection-and-dispersion-of-computation-1106.5470"/></url>
<url><loc>https://scifaro.com/en/abs/typing-a-core-binary-field-arithmetic-in-a-light-logic-1106.5622</loc><lastmod>2011-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typing-a-core-binary-field-arithmetic-in-a-light-logic-1106.5622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typing-a-core-binary-field-arithmetic-in-a-light-logic-1106.5622"/></url>
<url><loc>https://scifaro.com/en/abs/combining-explicit-and-symbolic-approaches-for-better-on-the-fly-ltl-model-checking-1106.5700</loc><lastmod>2011-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-explicit-and-symbolic-approaches-for-better-on-the-fly-ltl-model-checking-1106.5700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-explicit-and-symbolic-approaches-for-better-on-the-fly-ltl-model-checking-1106.5700"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamic-algebraic-specification-for-social-networks-1106.6267</loc><lastmod>2011-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamic-algebraic-specification-for-social-networks-1106.6267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamic-algebraic-specification-for-social-networks-1106.6267"/></url>
<url><loc>https://scifaro.com/en/abs/formal-model-engineering-for-embedded-systems-using-real-time-maude-1107.0063</loc><lastmod>2011-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-model-engineering-for-embedded-systems-using-real-time-maude-1107.0063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-model-engineering-for-embedded-systems-using-real-time-maude-1107.0063"/></url>
<url><loc>https://scifaro.com/en/abs/typed-lambda-terms-in-categorical-attributed-graph-transformation-1107.0065</loc><lastmod>2011-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-lambda-terms-in-categorical-attributed-graph-transformation-1107.0065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-lambda-terms-in-categorical-attributed-graph-transformation-1107.0065"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-epistemic-coalition-logic-with-group-knowledge-1107.0278</loc><lastmod>2011-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-epistemic-coalition-logic-with-group-knowledge-1107.0278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-epistemic-coalition-logic-with-group-knowledge-1107.0278"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-finite-satisfiability-vs-tree-automata-in-safety-verification-1107.0349</loc><lastmod>2011-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-finite-satisfiability-vs-tree-automata-in-safety-verification-1107.0349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-finite-satisfiability-vs-tree-automata-in-safety-verification-1107.0349"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-term-graph-rewriting-1107.0666</loc><lastmod>2011-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-term-graph-rewriting-1107.0666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-term-graph-rewriting-1107.0666"/></url>
<url><loc>https://scifaro.com/en/abs/the-first-order-theory-of-ground-tree-rewrite-graphs-1107.0919</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-first-order-theory-of-ground-tree-rewrite-graphs-1107.0919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-first-order-theory-of-ground-tree-rewrite-graphs-1107.0919"/></url>
<url><loc>https://scifaro.com/en/abs/real-reward-testing-for-probabilistic-processes-extended-abstract-1107.1201</loc><lastmod>2011-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-reward-testing-for-probabilistic-processes-extended-abstract-1107.1201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-reward-testing-for-probabilistic-processes-extended-abstract-1107.1201"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-non-linear-probabilistic-hybrid-systems-1107.1204</loc><lastmod>2011-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-non-linear-probabilistic-hybrid-systems-1107.1204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-non-linear-probabilistic-hybrid-systems-1107.1204"/></url>
<url><loc>https://scifaro.com/en/abs/distances-for-weighted-transition-systems-games-and-properties-1107.1205</loc><lastmod>2011-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distances-for-weighted-transition-systems-games-and-properties-1107.1205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distances-for-weighted-transition-systems-games-and-properties-1107.1205"/></url>
<url><loc>https://scifaro.com/en/abs/hype-with-stochastic-events-1107.1233</loc><lastmod>2011-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hype-with-stochastic-events-1107.1233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hype-with-stochastic-events-1107.1233"/></url>
<url><loc>https://scifaro.com/en/abs/on-counting-untyped-lambda-terms-1107.1327</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-counting-untyped-lambda-terms-1107.1327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-counting-untyped-lambda-terms-1107.1327"/></url>
<url><loc>https://scifaro.com/en/abs/conway-games-algebraically-and-coalgebraically-1107.1351</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conway-games-algebraically-and-coalgebraically-1107.1351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conway-games-algebraically-and-coalgebraically-1107.1351"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-synthesizing-priorities-in-component-based-systems-1107.1383</loc><lastmod>2011-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-synthesizing-priorities-in-component-based-systems-1107.1383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-synthesizing-priorities-in-component-based-systems-1107.1383"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-equality-identity-types-and-direct-computational-paths-1107.1901</loc><lastmod>2013-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-equality-identity-types-and-direct-computational-paths-1107.1901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-equality-identity-types-and-direct-computational-paths-1107.1901"/></url>
<url><loc>https://scifaro.com/en/abs/the-parallel-versus-branching-recurrences-in-computability-logic-1107.2284</loc><lastmod>2016-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parallel-versus-branching-recurrences-in-computability-logic-1107.2284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parallel-versus-branching-recurrences-in-computability-logic-1107.2284"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-topological-systems-1107.2513</loc><lastmod>2011-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-topological-systems-1107.2513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-topological-systems-1107.2513"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-how-description-logic-ontologies-benefit-from-formal-concept-analysis-1107.2822</loc><lastmod>2011-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-how-description-logic-ontologies-benefit-from-formal-concept-analysis-1107.2822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-how-description-logic-ontologies-benefit-from-formal-concept-analysis-1107.2822"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mathematical-synthesis-of-equational-logics-1107.3031</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mathematical-synthesis-of-equational-logics-1107.3031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mathematical-synthesis-of-equational-logics-1107.3031"/></url>
<url><loc>https://scifaro.com/en/abs/randomisation-and-derandomisation-in-descriptive-complexity-theory-1107.3430</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomisation-and-derandomisation-in-descriptive-complexity-theory-1107.3430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomisation-and-derandomisation-in-descriptive-complexity-theory-1107.3430"/></url>
<url><loc>https://scifaro.com/en/abs/the-countable-versus-uncountable-branching-recurrences-in-computability-logic-1107.3706</loc><lastmod>2011-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-countable-versus-uncountable-branching-recurrences-in-computability-logic-1107.3706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-countable-versus-uncountable-branching-recurrences-in-computability-logic-1107.3706"/></url>
<url><loc>https://scifaro.com/en/abs/event-clock-automata-from-theory-to-practice-1107.4138</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/event-clock-automata-from-theory-to-practice-1107.4138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/event-clock-automata-from-theory-to-practice-1107.4138"/></url>
<url><loc>https://scifaro.com/en/abs/functions-as-proofs-as-processes-1107.4160</loc><lastmod>2011-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functions-as-proofs-as-processes-1107.4160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functions-as-proofs-as-processes-1107.4160"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-undecidability-of-fuzzy-description-logics-with-gcis-with-lukasiewicz-t-norm-1107.4212</loc><lastmod>2011-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-undecidability-of-fuzzy-description-logics-with-gcis-with-lukasiewicz-t-norm-1107.4212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-undecidability-of-fuzzy-description-logics-with-gcis-with-lukasiewicz-t-norm-1107.4212"/></url>
<url><loc>https://scifaro.com/en/abs/soft-session-types-long-version-1107.4478</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soft-session-types-long-version-1107.4478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soft-session-types-long-version-1107.4478"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-programming-to-mine-knowledge-for-a-modern-medical-expert-system-1107.4651</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-programming-to-mine-knowledge-for-a-modern-medical-expert-system-1107.4651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-programming-to-mine-knowledge-for-a-modern-medical-expert-system-1107.4651"/></url>
<url><loc>https://scifaro.com/en/abs/extended-initiality-for-typed-abstract-syntax-1107.4751</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-initiality-for-typed-abstract-syntax-1107.4751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-initiality-for-typed-abstract-syntax-1107.4751"/></url>
<url><loc>https://scifaro.com/en/abs/public-announcement-logic-in-geometric-frameworks-1107.4935</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/public-announcement-logic-in-geometric-frameworks-1107.4935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/public-announcement-logic-in-geometric-frameworks-1107.4935"/></url>
<url><loc>https://scifaro.com/en/abs/paraconsistency-and-topological-semantics-1107.4939</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paraconsistency-and-topological-semantics-1107.4939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paraconsistency-and-topological-semantics-1107.4939"/></url>
<url><loc>https://scifaro.com/en/abs/normative-design-using-inductive-learning-1107.4967</loc><lastmod>2011-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normative-design-using-inductive-learning-1107.4967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normative-design-using-inductive-learning-1107.4967"/></url>
<url><loc>https://scifaro.com/en/abs/on-combining-linear-based-strategies-for-tabled-evaluation-of-logic-programs-1107.5030</loc><lastmod>2011-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-combining-linear-based-strategies-for-tabled-evaluation-of-logic-programs-1107.5030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-combining-linear-based-strategies-for-tabled-evaluation-of-logic-programs-1107.5030"/></url>
<url><loc>https://scifaro.com/en/abs/finite-countermodels-for-safety-verification-of-parameterized-tree-systems-1107.5142</loc><lastmod>2011-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-countermodels-for-safety-verification-of-parameterized-tree-systems-1107.5142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-countermodels-for-safety-verification-of-parameterized-tree-systems-1107.5142"/></url>
<url><loc>https://scifaro.com/en/abs/the-magic-of-logical-inference-in-probabilistic-programming-1107.5152</loc><lastmod>2011-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-magic-of-logical-inference-in-probabilistic-programming-1107.5152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-magic-of-logical-inference-in-probabilistic-programming-1107.5152"/></url>
<url><loc>https://scifaro.com/en/abs/alpprolog-a-new-logic-programming-method-for-dynamic-domains-1107.5242</loc><lastmod>2011-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alpprolog-a-new-logic-programming-method-for-dynamic-domains-1107.5242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alpprolog-a-new-logic-programming-method-for-dynamic-domains-1107.5242"/></url>
<url><loc>https://scifaro.com/en/abs/modules-over-relative-monads-for-syntax-and-semantics-1107.5252</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modules-over-relative-monads-for-syntax-and-semantics-1107.5252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modules-over-relative-monads-for-syntax-and-semantics-1107.5252"/></url>
<url><loc>https://scifaro.com/en/abs/termination-in-a-pi-calculus-with-subtyping-1107.5722</loc><lastmod>2011-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-in-a-pi-calculus-with-subtyping-1107.5722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-in-a-pi-calculus-with-subtyping-1107.5722"/></url>
<url><loc>https://scifaro.com/en/abs/complex-optimization-in-answer-set-programming-1107.5742</loc><lastmod>2011-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complex-optimization-in-answer-set-programming-1107.5742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complex-optimization-in-answer-set-programming-1107.5742"/></url>
<url><loc>https://scifaro.com/en/abs/three-applications-to-rational-relations-of-the-high-undecidability-of-the-infinite-post-correspondence-problem-in-a-regular-omega-language-1107.5886</loc><lastmod>2013-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-applications-to-rational-relations-of-the-high-undecidability-of-the-infinite-post-correspondence-problem-in-a-regular-omega-language-1107.5886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-applications-to-rational-relations-of-the-high-undecidability-of-the-infinite-post-correspondence-problem-in-a-regular-omega-language-1107.5886"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-specification-of-the-semantic-web-1107.5897</loc><lastmod>2011-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-specification-of-the-semantic-web-1107.5897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-specification-of-the-semantic-web-1107.5897"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-termination-analysis-using-monotonicity-constraints-over-the-integers-1107.5980</loc><lastmod>2011-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-termination-analysis-using-monotonicity-constraints-over-the-integers-1107.5980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-termination-analysis-using-monotonicity-constraints-over-the-integers-1107.5980"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-interaction-and-concurrency-experience-1108.0144</loc><lastmod>2011-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-interaction-and-concurrency-experience-1108.0144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-interaction-and-concurrency-experience-1108.0144"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-algebra-for-linked-data-1108.0229</loc><lastmod>2011-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-algebra-for-linked-data-1108.0229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-algebra-for-linked-data-1108.0229"/></url>
<url><loc>https://scifaro.com/en/abs/small-witnesses-accepting-lassos-and-winning-strategies-in-omega-automata-and-games-1108.0315</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-witnesses-accepting-lassos-and-winning-strategies-in-omega-automata-and-games-1108.0315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-witnesses-accepting-lassos-and-winning-strategies-in-omega-automata-and-games-1108.0315"/></url>
<url><loc>https://scifaro.com/en/abs/co-inductive-semantics-for-constraint-handling-rules-1108.0330</loc><lastmod>2011-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-inductive-semantics-for-constraint-handling-rules-1108.0330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-inductive-semantics-for-constraint-handling-rules-1108.0330"/></url>
<url><loc>https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-1108.0463</loc><lastmod>2011-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-1108.0463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-1108.0463"/></url>
<url><loc>https://scifaro.com/en/abs/structured-operational-semantics-for-graph-rewriting-1108.0465</loc><lastmod>2011-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-operational-semantics-for-graph-rewriting-1108.0465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-operational-semantics-for-graph-rewriting-1108.0465"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-quantum-systems-using-process-calculus-1108.0469</loc><lastmod>2011-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-quantum-systems-using-process-calculus-1108.0469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-quantum-systems-using-process-calculus-1108.0469"/></url>
<url><loc>https://scifaro.com/en/abs/on-berry-s-conjectures-about-the-stable-order-in-pcf-1108.0556</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-berry-s-conjectures-about-the-stable-order-in-pcf-1108.0556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-berry-s-conjectures-about-the-stable-order-in-pcf-1108.0556"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-process-algebra-and-coordination-1108.1452</loc><lastmod>2011-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-process-algebra-and-coordination-1108.1452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-process-algebra-and-coordination-1108.1452"/></url>
<url><loc>https://scifaro.com/en/abs/applying-algebraic-specifications-on-digital-right-management-systems-1108.1482</loc><lastmod>2011-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-algebraic-specifications-on-digital-right-management-systems-1108.1482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-algebraic-specifications-on-digital-right-management-systems-1108.1482"/></url>
<url><loc>https://scifaro.com/en/abs/towards-reduction-of-paradigm-coordination-models-1108.1861</loc><lastmod>2011-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-reduction-of-paradigm-coordination-models-1108.1861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-reduction-of-paradigm-coordination-models-1108.1861"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-algebra-for-supervisory-coordination-1108.1863</loc><lastmod>2011-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-for-supervisory-coordination-1108.1863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-for-supervisory-coordination-1108.1863"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-safety-properties-in-ad-hoc-network-protocols-1108.1864</loc><lastmod>2011-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-safety-properties-in-ad-hoc-network-protocols-1108.1864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-safety-properties-in-ad-hoc-network-protocols-1108.1864"/></url>
<url><loc>https://scifaro.com/en/abs/a-theorem-proving-framework-for-the-formal-verification-of-web-services-composition-1108.2348</loc><lastmod>2011-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theorem-proving-framework-for-the-formal-verification-of-web-services-composition-1108.2348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theorem-proving-framework-for-the-formal-verification-of-web-services-composition-1108.2348"/></url>
<url><loc>https://scifaro.com/en/abs/debugging-of-web-applications-with-web-tlr-1108.2358</loc><lastmod>2011-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/debugging-of-web-applications-with-web-tlr-1108.2358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/debugging-of-web-applications-with-web-tlr-1108.2358"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-semantics-for-inference-of-types-and-effects-in-a-multi-tier-web-language-1108.2359</loc><lastmod>2011-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-semantics-for-inference-of-types-and-effects-in-a-multi-tier-web-language-1108.2359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-semantics-for-inference-of-types-and-effects-in-a-multi-tier-web-language-1108.2359"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-eight-workshop-on-structural-operational-semantics-2011-1108.2796</loc><lastmod>2011-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-eight-workshop-on-structural-operational-semantics-2011-1108.2796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-eight-workshop-on-structural-operational-semantics-2011-1108.2796"/></url>
<url><loc>https://scifaro.com/en/abs/equilibria-und-weiteres-heiteres-ii-1108.3033</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilibria-und-weiteres-heiteres-ii-1108.3033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilibria-und-weiteres-heiteres-ii-1108.3033"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-gsos-with-predicates-1108.3124</loc><lastmod>2011-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-gsos-with-predicates-1108.3124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-gsos-with-predicates-1108.3124"/></url>
<url><loc>https://scifaro.com/en/abs/formal-component-based-semantics-1108.3125</loc><lastmod>2011-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-component-based-semantics-1108.3125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-component-based-semantics-1108.3125"/></url>
<url><loc>https://scifaro.com/en/abs/regular-expression-matching-and-operational-semantics-1108.3126</loc><lastmod>2011-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-expression-matching-and-operational-semantics-1108.3126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-expression-matching-and-operational-semantics-1108.3126"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-unification-of-process-semantics-logical-semantics-1108.3127</loc><lastmod>2011-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-unification-of-process-semantics-logical-semantics-1108.3127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-unification-of-process-semantics-logical-semantics-1108.3127"/></url>
<url><loc>https://scifaro.com/en/abs/a-testing-framework-for-p-systems-1108.3424</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-testing-framework-for-p-systems-1108.3424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-testing-framework-for-p-systems-1108.3424"/></url>
<url><loc>https://scifaro.com/en/abs/a-spatial-calculus-of-wrapped-compartments-1108.3426</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spatial-calculus-of-wrapped-compartments-1108.3426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spatial-calculus-of-wrapped-compartments-1108.3426"/></url>
<url><loc>https://scifaro.com/en/abs/brane-calculi-systems-a-static-preview-of-their-possible-behaviour-1108.3429</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brane-calculi-systems-a-static-preview-of-their-possible-behaviour-1108.3429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brane-calculi-systems-a-static-preview-of-their-possible-behaviour-1108.3429"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-of-genetic-regulatory-mechanisms-with-greg-1108.3436</loc><lastmod>2011-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-of-genetic-regulatory-mechanisms-with-greg-1108.3436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-of-genetic-regulatory-mechanisms-with-greg-1108.3436"/></url>
<url><loc>https://scifaro.com/en/abs/aig-rewriting-using-5-input-cuts-1108.3675</loc><lastmod>2011-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aig-rewriting-using-5-input-cuts-1108.3675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aig-rewriting-using-5-input-cuts-1108.3675"/></url>
<url><loc>https://scifaro.com/en/abs/computational-models-of-certain-hyperspaces-of-quasi-metric-spaces-1108.3736</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-models-of-certain-hyperspaces-of-quasi-metric-spaces-1108.3736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-models-of-certain-hyperspaces-of-quasi-metric-spaces-1108.3736"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-expressiveness-in-concurrency-1108.4077</loc><lastmod>2011-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-expressiveness-in-concurrency-1108.4077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-expressiveness-in-concurrency-1108.4077"/></url>
<url><loc>https://scifaro.com/en/abs/coquet-a-coq-library-for-verifying-hardware-1108.4253</loc><lastmod>2011-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coquet-a-coq-library-for-verifying-hardware-1108.4253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coquet-a-coq-library-for-verifying-hardware-1108.4253"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-abstract-state-transition-systems-for-sat-1108.4368</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-abstract-state-transition-systems-for-sat-1108.4368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-abstract-state-transition-systems-for-sat-1108.4368"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-representation-of-covariant-contravariant-modal-formulae-1108.4464</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-representation-of-covariant-contravariant-modal-formulae-1108.4464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-representation-of-covariant-contravariant-modal-formulae-1108.4464"/></url>
<url><loc>https://scifaro.com/en/abs/read-operators-and-their-expressiveness-in-process-algebras-1108.4466</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/read-operators-and-their-expressiveness-in-process-algebras-1108.4466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/read-operators-and-their-expressiveness-in-process-algebras-1108.4466"/></url>
<url><loc>https://scifaro.com/en/abs/soft-session-types-1108.4467</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soft-session-types-1108.4467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soft-session-types-1108.4467"/></url>
<url><loc>https://scifaro.com/en/abs/linearization-of-cif-through-sos-1108.4468</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearization-of-cif-through-sos-1108.4468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearization-of-cif-through-sos-1108.4468"/></url>
<url><loc>https://scifaro.com/en/abs/synchrony-vs-causality-in-the-asynchronous-pi-calculus-1108.4469</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchrony-vs-causality-in-the-asynchronous-pi-calculus-1108.4469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchrony-vs-causality-in-the-asynchronous-pi-calculus-1108.4469"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-with-reverse-modalities-for-history-preserving-bisimulations-1108.4470</loc><lastmod>2011-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-with-reverse-modalities-for-history-preserving-bisimulations-1108.4470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-with-reverse-modalities-for-history-preserving-bisimulations-1108.4470"/></url>
<url><loc>https://scifaro.com/en/abs/simple-characterizations-for-commutativity-of-quantum-weakest-preconditions-1108.4607</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-characterizations-for-commutativity-of-quantum-weakest-preconditions-1108.4607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-characterizations-for-commutativity-of-quantum-weakest-preconditions-1108.4607"/></url>
<url><loc>https://scifaro.com/en/abs/transfer-of-semantics-from-argumentation-frameworks-to-logic-programming-a-preliminary-report-1108.5281</loc><lastmod>2011-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transfer-of-semantics-from-argumentation-frameworks-to-logic-programming-a-preliminary-report-1108.5281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transfer-of-semantics-from-argumentation-frameworks-to-logic-programming-a-preliminary-report-1108.5281"/></url>
<url><loc>https://scifaro.com/en/abs/each-normal-logic-program-has-a-2-valued-minimal-hypotheses-semantics-1108.5766</loc><lastmod>2011-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/each-normal-logic-program-has-a-2-valued-minimal-hypotheses-semantics-1108.5766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/each-normal-logic-program-has-a-2-valued-minimal-hypotheses-semantics-1108.5766"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-workshop-on-logics-for-component-configuration-1108.6097</loc><lastmod>2011-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-logics-for-component-configuration-1108.6097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-logics-for-component-configuration-1108.6097"/></url>
<url><loc>https://scifaro.com/en/abs/blending-margins-the-modal-logic-k-has-nullary-unification-type-1108.6240</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blending-margins-the-modal-logic-k-has-nullary-unification-type-1108.6240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blending-margins-the-modal-logic-k-has-nullary-unification-type-1108.6240"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-admissible-rules-of-l-ukasiewicz-logic-1108.6261</loc><lastmod>2013-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-admissible-rules-of-l-ukasiewicz-logic-1108.6261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-admissible-rules-of-l-ukasiewicz-logic-1108.6261"/></url>
<url><loc>https://scifaro.com/en/abs/every-formula-based-logic-program-has-a-least-infinite-valued-model-1108.6274</loc><lastmod>2011-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/every-formula-based-logic-program-has-a-least-infinite-valued-model-1108.6274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/every-formula-based-logic-program-has-a-least-infinite-valued-model-1108.6274"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-loco-a-logic-for-configuration-problems-1109.0115</loc><lastmod>2011-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-loco-a-logic-for-configuration-problems-1109.0115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-loco-a-logic-for-configuration-problems-1109.0115"/></url>
<url><loc>https://scifaro.com/en/abs/a-kif-formalization-for-the-iff-category-theory-ontology-1109.0333</loc><lastmod>2011-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kif-formalization-for-the-iff-category-theory-ontology-1109.0333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kif-formalization-for-the-iff-category-theory-ontology-1109.0333"/></url>
<url><loc>https://scifaro.com/en/abs/warranted-derivations-of-preferred-answer-1109.0375</loc><lastmod>2011-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/warranted-derivations-of-preferred-answer-1109.0375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/warranted-derivations-of-preferred-answer-1109.0375"/></url>
<url><loc>https://scifaro.com/en/abs/solving-modular-model-expansion-tasks-1109.0583</loc><lastmod>2011-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-modular-model-expansion-tasks-1109.0583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-modular-model-expansion-tasks-1109.0583"/></url>
<url><loc>https://scifaro.com/en/abs/eliciting-implicit-assumptions-of-proofs-in-the-mizar-mathematical-library-by-property-omission-1109.0633</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliciting-implicit-assumptions-of-proofs-in-the-mizar-mathematical-library-by-property-omission-1109.0633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliciting-implicit-assumptions-of-proofs-in-the-mizar-mathematical-library-by-property-omission-1109.0633"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-sound-conclusions-from-unsound-premises-1109.0915</loc><lastmod>2011-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-sound-conclusions-from-unsound-premises-1109.0915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-sound-conclusions-from-unsound-premises-1109.0915"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-placement-of-valves-in-a-water-distribution-network-with-clp-fd-1109.1248</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-placement-of-valves-in-a-water-distribution-network-with-clp-fd-1109.1248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-placement-of-valves-in-a-water-distribution-network-with-clp-fd-1109.1248"/></url>
<url><loc>https://scifaro.com/en/abs/lifted-unit-propagation-for-effective-grounding-1109.1317</loc><lastmod>2011-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifted-unit-propagation-for-effective-grounding-1109.1317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifted-unit-propagation-for-effective-grounding-1109.1317"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-spatial-interactions-in-the-arbuscular-mycorrhizal-symbiosis-using-the-calculus-of-wrapped-compartments-1109.1363</loc><lastmod>2011-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-spatial-interactions-in-the-arbuscular-mycorrhizal-symbiosis-using-the-calculus-of-wrapped-compartments-1109.1363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-spatial-interactions-in-the-arbuscular-mycorrhizal-symbiosis-using-the-calculus-of-wrapped-compartments-1109.1363"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-verification-in-computational-modeling-of-bone-pathologies-1109.1368</loc><lastmod>2011-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-verification-in-computational-modeling-of-bone-pathologies-1109.1368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-verification-in-computational-modeling-of-bone-pathologies-1109.1368"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-post-embedding-problems-1109.1691</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-post-embedding-problems-1109.1691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-post-embedding-problems-1109.1691"/></url>
<url><loc>https://scifaro.com/en/abs/kripke-semantics-for-martin-l-of-s-extensional-type-theory-1109.1702</loc><lastmod>2023-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kripke-semantics-for-martin-l-of-s-extensional-type-theory-1109.1702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kripke-semantics-for-martin-l-of-s-extensional-type-theory-1109.1702"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-based-deadlock-checking-of-high-level-specifications-1109.2015</loc><lastmod>2011-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-based-deadlock-checking-of-high-level-specifications-1109.2015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-based-deadlock-checking-of-high-level-specifications-1109.2015"/></url>
<url><loc>https://scifaro.com/en/abs/side-effects-in-steering-fragments-1109.2222</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/side-effects-in-steering-fragments-1109.2222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/side-effects-in-steering-fragments-1109.2222"/></url>
<url><loc>https://scifaro.com/en/abs/the-standard-aspect-of-dialectical-logic-1109.2247</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-standard-aspect-of-dialectical-logic-1109.2247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-standard-aspect-of-dialectical-logic-1109.2247"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-workshop-on-formal-languages-and-analysis-of-contract-oriented-software-1109.2399</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-formal-languages-and-analysis-of-contract-oriented-software-1109.2399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-formal-languages-and-analysis-of-contract-oriented-software-1109.2399"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-of-communication-in-answer-set-programming-1109.2434</loc><lastmod>2011-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-of-communication-in-answer-set-programming-1109.2434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-of-communication-in-answer-set-programming-1109.2434"/></url>
<url><loc>https://scifaro.com/en/abs/timed-automata-semantics-for-visual-e-contracts-1109.2654</loc><lastmod>2011-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-automata-semantics-for-visual-e-contracts-1109.2654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-automata-semantics-for-visual-e-contracts-1109.2654"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-system-contract-monitoring-1109.2655</loc><lastmod>2011-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-system-contract-monitoring-1109.2655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-system-contract-monitoring-1109.2655"/></url>
<url><loc>https://scifaro.com/en/abs/handling-conflicts-in-depth-first-search-for-ltl-tableau-to-debug-compliance-based-languages-1109.2656</loc><lastmod>2011-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/handling-conflicts-in-depth-first-search-for-ltl-tableau-to-debug-compliance-based-languages-1109.2656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/handling-conflicts-in-depth-first-search-for-ltl-tableau-to-debug-compliance-based-languages-1109.2656"/></url>
<url><loc>https://scifaro.com/en/abs/nested-hoare-triples-and-frame-rules-for-higher-order-store-1109.3031</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-hoare-triples-and-frame-rules-for-higher-order-store-1109.3031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-hoare-triples-and-frame-rules-for-higher-order-store-1109.3031"/></url>
<url><loc>https://scifaro.com/en/abs/common-knowledge-in-email-exchanges-1109.3322</loc><lastmod>2012-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-knowledge-in-email-exchanges-1109.3322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-knowledge-in-email-exchanges-1109.3322"/></url>
<url><loc>https://scifaro.com/en/abs/effectively-nonblocking-consensus-procedures-can-execute-forever-a-constructive-version-of-flp-1109.3370</loc><lastmod>2011-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectively-nonblocking-consensus-procedures-can-execute-forever-a-constructive-version-of-flp-1109.3370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectively-nonblocking-consensus-procedures-can-execute-forever-a-constructive-version-of-flp-1109.3370"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-coalgebraic-interpretation-of-propositional-dynamic-logic-1109.3685</loc><lastmod>2011-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-coalgebraic-interpretation-of-propositional-dynamic-logic-1109.3685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-coalgebraic-interpretation-of-propositional-dynamic-logic-1109.3685"/></url>
<url><loc>https://scifaro.com/en/abs/kara-a-system-for-visualising-and-visual-editing-of-interpretations-for-answer-set-programs-1109.4095</loc><lastmod>2011-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kara-a-system-for-visualising-and-visual-editing-of-interpretations-for-answer-set-programs-1109.4095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kara-a-system-for-visualising-and-visual-editing-of-interpretations-for-answer-set-programs-1109.4095"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-confluence-of-lambda-calculus-with-conditional-rewriting-1109.4353</loc><lastmod>2011-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-confluence-of-lambda-calculus-with-conditional-rewriting-1109.4353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-confluence-of-lambda-calculus-with-conditional-rewriting-1109.4353"/></url>
<url><loc>https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-expanded-version-1109.4356</loc><lastmod>2012-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-expanded-version-1109.4356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/innocent-strategies-as-presheaves-and-interactive-equivalences-for-ccs-expanded-version-1109.4356"/></url>
<url><loc>https://scifaro.com/en/abs/argument-filterings-and-usable-rules-in-higher-order-rewrite-systems-1109.4357</loc><lastmod>2011-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/argument-filterings-and-usable-rules-in-higher-order-rewrite-systems-1109.4357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/argument-filterings-and-usable-rules-in-higher-order-rewrite-systems-1109.4357"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-in-x-does-not-agree-with-intersection-and-union-types-extended-abstract-1109.4570</loc><lastmod>2011-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-in-x-does-not-agree-with-intersection-and-union-types-extended-abstract-1109.4570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-in-x-does-not-agree-with-intersection-and-union-types-extended-abstract-1109.4570"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-predicate-types-and-approximation-for-class-based-object-oriented-programming-1109.4618</loc><lastmod>2011-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-predicate-types-and-approximation-for-class-based-object-oriented-programming-1109.4618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-predicate-types-and-approximation-for-class-based-object-oriented-programming-1109.4618"/></url>
<url><loc>https://scifaro.com/en/abs/dependence-logic-with-a-majority-quantifier-1109.4750</loc><lastmod>2013-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependence-logic-with-a-majority-quantifier-1109.4750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependence-logic-with-a-majority-quantifier-1109.4750"/></url>
<url><loc>https://scifaro.com/en/abs/from-x-to-pi-representing-the-classical-sequent-calculus-in-the-pi-calculus-1109.4817</loc><lastmod>2011-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-x-to-pi-representing-the-classical-sequent-calculus-in-the-pi-calculus-1109.4817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-x-to-pi-representing-the-classical-sequent-calculus-in-the-pi-calculus-1109.4817"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-a-simple-type-system-for-non-interference-1109.4843</loc><lastmod>2011-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-a-simple-type-system-for-non-interference-1109.4843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-a-simple-type-system-for-non-interference-1109.4843"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-model-checking-recursion-schemes-for-fragments-of-the-modal-mu-calculus-1109.5267</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-model-checking-recursion-schemes-for-fragments-of-the-modal-mu-calculus-1109.5267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-model-checking-recursion-schemes-for-fragments-of-the-modal-mu-calculus-1109.5267"/></url>
<url><loc>https://scifaro.com/en/abs/static-dependency-pair-method-based-on-strong-computability-for-higher-order-rewrite-systems-1109.5468</loc><lastmod>2011-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-dependency-pair-method-based-on-strong-computability-for-higher-order-rewrite-systems-1109.5468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-dependency-pair-method-based-on-strong-computability-for-higher-order-rewrite-systems-1109.5468"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-spurious-counterexamples-efficiently-in-abstract-model-checking-1109.5506</loc><lastmod>2011-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-spurious-counterexamples-efficiently-in-abstract-model-checking-1109.5506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-spurious-counterexamples-efficiently-in-abstract-model-checking-1109.5506"/></url>
<url><loc>https://scifaro.com/en/abs/shared-memory-concurrent-system-verification-using-kronecker-algebra-1109.5522</loc><lastmod>2011-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shared-memory-concurrent-system-verification-using-kronecker-algebra-1109.5522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shared-memory-concurrent-system-verification-using-kronecker-algebra-1109.5522"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mso1-model-checking-1109.5804</loc><lastmod>2012-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mso1-model-checking-1109.5804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-on-the-complexity-of-mso1-model-checking-1109.5804"/></url>
<url><loc>https://scifaro.com/en/abs/structural-focalization-1109.6273</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-focalization-1109.6273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-focalization-1109.6273"/></url>
<url><loc>https://scifaro.com/en/abs/an-interpretation-of-belief-functions-by-means-of-a-probabilistic-multi-modal-logic-1109.6401</loc><lastmod>2011-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interpretation-of-belief-functions-by-means-of-a-probabilistic-multi-modal-logic-1109.6401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interpretation-of-belief-functions-by-means-of-a-probabilistic-multi-modal-logic-1109.6401"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relation-between-differential-privacy-and-quantitative-information-flow-1109.6761</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relation-between-differential-privacy-and-quantitative-information-flow-1109.6761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relation-between-differential-privacy-and-quantitative-information-flow-1109.6761"/></url>
<url><loc>https://scifaro.com/en/abs/autonomous-agents-coordination-action-languages-meet-clp-fd-and-linda-1110.0624</loc><lastmod>2011-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autonomous-agents-coordination-action-languages-meet-clp-fd-and-linda-1110.0624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autonomous-agents-coordination-action-languages-meet-clp-fd-and-linda-1110.0624"/></url>
<url><loc>https://scifaro.com/en/abs/generalization-strategies-for-the-verification-of-infinite-state-systems-1110.0999</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalization-strategies-for-the-verification-of-infinite-state-systems-1110.0999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalization-strategies-for-the-verification-of-infinite-state-systems-1110.0999"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-logic-with-two-order-relations-1110.1439</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-logic-with-two-order-relations-1110.1439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-logic-with-two-order-relations-1110.1439"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-completeness-of-first-order-logic-1110.1614</loc><lastmod>2016-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-completeness-of-first-order-logic-1110.1614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-completeness-of-first-order-logic-1110.1614"/></url>
<url><loc>https://scifaro.com/en/abs/the-syllogistic-with-unity-1110.2317</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-syllogistic-with-unity-1110.2317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-syllogistic-with-unity-1110.2317"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-with-forest-logic-programs-and-f-hybrid-knowledge-bases-1110.2773</loc><lastmod>2011-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-with-forest-logic-programs-and-f-hybrid-knowledge-bases-1110.2773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-with-forest-logic-programs-and-f-hybrid-knowledge-bases-1110.2773"/></url>
<url><loc>https://scifaro.com/en/abs/using-non-convex-approximations-for-efficient-analysis-of-timed-automata-1110.3704</loc><lastmod>2011-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-non-convex-approximations-for-efficient-analysis-of-timed-automata-1110.3704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-non-convex-approximations-for-efficient-analysis-of-timed-automata-1110.3704"/></url>
<url><loc>https://scifaro.com/en/abs/better-abstractions-for-timed-automata-1110.3705</loc><lastmod>2016-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-abstractions-for-timed-automata-1110.3705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-abstractions-for-timed-automata-1110.3705"/></url>
<url><loc>https://scifaro.com/en/abs/topological-logics-with-connectedness-over-euclidean-spaces-1110.4034</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-logics-with-connectedness-over-euclidean-spaces-1110.4034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-logics-with-connectedness-over-euclidean-spaces-1110.4034"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-true-concurrency-1110.4094</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-true-concurrency-1110.4094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-true-concurrency-1110.4094"/></url>
<url><loc>https://scifaro.com/en/abs/declarative-event-based-workflow-as-distributed-dynamic-condition-response-graphs-1110.4161</loc><lastmod>2011-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/declarative-event-based-workflow-as-distributed-dynamic-condition-response-graphs-1110.4161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/declarative-event-based-workflow-as-distributed-dynamic-condition-response-graphs-1110.4161"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1110.4473</loc><lastmod>2011-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1110.4473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1110.4473"/></url>
<url><loc>https://scifaro.com/en/abs/toward-the-verification-of-a-simple-hypervisor-1110.4672</loc><lastmod>2011-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-the-verification-of-a-simple-hypervisor-1110.4672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-the-verification-of-a-simple-hypervisor-1110.4672"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-an-iterative-low-power-x86-floating-point-multiplier-with-redundant-feedback-1110.4675</loc><lastmod>2011-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-an-iterative-low-power-x86-floating-point-multiplier-with-redundant-feedback-1110.4675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-an-iterative-low-power-x86-floating-point-multiplier-with-redundant-feedback-1110.4675"/></url>
<url><loc>https://scifaro.com/en/abs/bit-blasting-acl2-theorems-1110.4676</loc><lastmod>2011-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bit-blasting-acl2-theorems-1110.4676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bit-blasting-acl2-theorems-1110.4676"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-a-deadlock-detection-algorithm-1110.4677</loc><lastmod>2011-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-a-deadlock-detection-algorithm-1110.4677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-a-deadlock-detection-algorithm-1110.4677"/></url>
<url><loc>https://scifaro.com/en/abs/logic-control-on-program-construction-and-verification-1110.4978</loc><lastmod>2017-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-control-on-program-construction-and-verification-1110.4978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-control-on-program-construction-and-verification-1110.4978"/></url>
<url><loc>https://scifaro.com/en/abs/from-total-assignment-enumeration-to-modern-sat-solver-1110.5867</loc><lastmod>2011-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-total-assignment-enumeration-to-modern-sat-solver-1110.5867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-total-assignment-enumeration-to-modern-sat-solver-1110.5867"/></url>
<url><loc>https://scifaro.com/en/abs/can-nondeterminism-help-complementation-1110.5942</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-nondeterminism-help-complementation-1110.5942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-nondeterminism-help-complementation-1110.5942"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1110.6685</loc><lastmod>2011-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1110.6685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1110.6685"/></url>
<url><loc>https://scifaro.com/en/abs/an-incremental-knowledge-compilation-in-first-order-logic-1110.6738</loc><lastmod>2011-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-incremental-knowledge-compilation-in-first-order-logic-1110.6738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-incremental-knowledge-compilation-in-first-order-logic-1110.6738"/></url>
<url><loc>https://scifaro.com/en/abs/a-lambda-term-representation-inspired-by-linear-ordered-logic-1111.0085</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lambda-term-representation-inspired-by-linear-ordered-logic-1111.0085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lambda-term-representation-inspired-by-linear-ordered-logic-1111.0085"/></url>
<url><loc>https://scifaro.com/en/abs/a-bigraph-relational-model-1111.0086</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bigraph-relational-model-1111.0086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bigraph-relational-model-1111.0086"/></url>
<url><loc>https://scifaro.com/en/abs/multi-level-contextual-type-theory-1111.0087</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-level-contextual-type-theory-1111.0087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-level-contextual-type-theory-1111.0087"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-logic-with-equations-only-1111.0088</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-logic-with-equations-only-1111.0088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-logic-with-equations-only-1111.0088"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-henkin-semantics-simply-typed-lambda-calculus-models-in-nominal-sets-1111.0089</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-henkin-semantics-simply-typed-lambda-calculus-models-in-nominal-sets-1111.0089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-henkin-semantics-simply-typed-lambda-calculus-models-in-nominal-sets-1111.0089"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-implementation-and-abstract-interface-for-hybrid-1111.0090</loc><lastmod>2011-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-implementation-and-abstract-interface-for-hybrid-1111.0090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-implementation-and-abstract-interface-for-hybrid-1111.0090"/></url>
<url><loc>https://scifaro.com/en/abs/proof-irrelevant-model-of-cc-with-predicative-induction-and-judgmental-equality-1111.0123</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-irrelevant-model-of-cc-with-predicative-induction-and-judgmental-equality-1111.0123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-irrelevant-model-of-cc-with-predicative-induction-and-judgmental-equality-1111.0123"/></url>
<url><loc>https://scifaro.com/en/abs/variations-on-multi-core-nested-depth-first-search-1111.0369</loc><lastmod>2011-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-on-multi-core-nested-depth-first-search-1111.0369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-on-multi-core-nested-depth-first-search-1111.0369"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-decomposition-for-distributed-decision-procedures-1111.0371</loc><lastmod>2011-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-decomposition-for-distributed-decision-procedures-1111.0371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-decomposition-for-distributed-decision-procedures-1111.0371"/></url>
<url><loc>https://scifaro.com/en/abs/pkind-a-parallel-k-induction-based-model-checker-1111.0372</loc><lastmod>2011-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pkind-a-parallel-k-induction-based-model-checker-1111.0372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pkind-a-parallel-k-induction-based-model-checker-1111.0372"/></url>
<url><loc>https://scifaro.com/en/abs/context-bounded-analysis-for-concurrent-programs-with-dynamic-creation-of-threads-1111.1011</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-bounded-analysis-for-concurrent-programs-with-dynamic-creation-of-threads-1111.1011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-bounded-analysis-for-concurrent-programs-with-dynamic-creation-of-threads-1111.1011"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-verification-of-infinite-state-systems-1111.2678</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-verification-of-infinite-state-systems-1111.2678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-verification-of-infinite-state-systems-1111.2678"/></url>
<url><loc>https://scifaro.com/en/abs/graded-ctl-model-checking-for-test-generation-1111.2768</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-ctl-model-checking-for-test-generation-1111.2768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-ctl-model-checking-for-test-generation-1111.2768"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automated-verification-of-web-services-1111.2824</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automated-verification-of-web-services-1111.2824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automated-verification-of-web-services-1111.2824"/></url>
<url><loc>https://scifaro.com/en/abs/model-based-trace-checking-1111.2825</loc><lastmod>2011-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-based-trace-checking-1111.2825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-based-trace-checking-1111.2825"/></url>
<url><loc>https://scifaro.com/en/abs/practical-distributed-control-synthesis-1111.3106</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-distributed-control-synthesis-1111.3106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-distributed-control-synthesis-1111.3106"/></url>
<url><loc>https://scifaro.com/en/abs/trees-over-infinite-structures-and-path-logics-with-synchronization-1111.3107</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-over-infinite-structures-and-path-logics-with-synchronization-1111.3107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-over-infinite-structures-and-path-logics-with-synchronization-1111.3107"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-switching-rules-for-ensuring-reachability-properties-of-sampled-linear-systems-1111.3108</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-switching-rules-for-ensuring-reachability-properties-of-sampled-linear-systems-1111.3108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-switching-rules-for-ensuring-reachability-properties-of-sampled-linear-systems-1111.3108"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-semantics-of-the-unlimited-register-machine-1111.3109</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-semantics-of-the-unlimited-register-machine-1111.3109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-semantics-of-the-unlimited-register-machine-1111.3109"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-temporal-logic-with-frequency-operators-and-its-model-checking-1111.3111</loc><lastmod>2011-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-temporal-logic-with-frequency-operators-and-its-model-checking-1111.3111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-temporal-logic-with-frequency-operators-and-its-model-checking-1111.3111"/></url>
<url><loc>https://scifaro.com/en/abs/from-nominal-sets-binding-to-functions-and-lambda-abstraction-connecting-the-logic-of-permutation-models-with-the-logic-of-functions-1111.4611</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-nominal-sets-binding-to-functions-and-lambda-abstraction-connecting-the-logic-of-permutation-models-with-the-logic-of-functions-1111.4611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-nominal-sets-binding-to-functions-and-lambda-abstraction-connecting-the-logic-of-permutation-models-with-the-logic-of-functions-1111.4611"/></url>
<url><loc>https://scifaro.com/en/abs/coupling-policy-iteration-with-semi-definite-relaxation-to-compute-accurate-numerical-invariants-in-static-analysis-1111.5223</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coupling-policy-iteration-with-semi-definite-relaxation-to-compute-accurate-numerical-invariants-in-static-analysis-1111.5223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coupling-policy-iteration-with-semi-definite-relaxation-to-compute-accurate-numerical-invariants-in-static-analysis-1111.5223"/></url>
<url><loc>https://scifaro.com/en/abs/ground-interpolation-for-the-theory-of-equality-1111.5652</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ground-interpolation-for-the-theory-of-equality-1111.5652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ground-interpolation-for-the-theory-of-equality-1111.5652"/></url>
<url><loc>https://scifaro.com/en/abs/type-inference-in-mathematics-1111.5885</loc><lastmod>2012-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-inference-in-mathematics-1111.5885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-inference-in-mathematics-1111.5885"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-expressive-power-of-linear-orders-1111.5901</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-expressive-power-of-linear-orders-1111.5901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-expressive-power-of-linear-orders-1111.5901"/></url>
<url><loc>https://scifaro.com/en/abs/reflexivity-and-the-diagonal-argument-in-proofs-of-limitative-theorems-1111.6954</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflexivity-and-the-diagonal-argument-in-proofs-of-limitative-theorems-1111.6954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflexivity-and-the-diagonal-argument-in-proofs-of-limitative-theorems-1111.6954"/></url>
<url><loc>https://scifaro.com/en/abs/a-cook-s-tour-of-the-finitary-non-well-founded-sets-1111.7148</loc><lastmod>2011-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cook-s-tour-of-the-finitary-non-well-founded-sets-1111.7148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cook-s-tour-of-the-finitary-non-well-founded-sets-1111.7148"/></url>
<url><loc>https://scifaro.com/en/abs/a-structural-approach-to-reversible-computation-1111.7154</loc><lastmod>2011-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-structural-approach-to-reversible-computation-1111.7154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-structural-approach-to-reversible-computation-1111.7154"/></url>
<url><loc>https://scifaro.com/en/abs/sequentiality-vs-concurrency-in-games-and-logic-1111.7159</loc><lastmod>2011-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequentiality-vs-concurrency-in-games-and-logic-1111.7159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequentiality-vs-concurrency-in-games-and-logic-1111.7159"/></url>
<url><loc>https://scifaro.com/en/abs/domain-theory-and-the-logic-of-observable-properties-1112.0347</loc><lastmod>2011-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-theory-and-the-logic-of-observable-properties-1112.0347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-theory-and-the-logic-of-observable-properties-1112.0347"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-kahn-principle-for-abstract-asynchronous-networks-1112.0427</loc><lastmod>2011-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-kahn-principle-for-abstract-asynchronous-networks-1112.0427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-kahn-principle-for-abstract-asynchronous-networks-1112.0427"/></url>
<url><loc>https://scifaro.com/en/abs/how-big-is-bci-fragment-of-bck-logic-1112.0643</loc><lastmod>2011-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-big-is-bci-fragment-of-bck-logic-1112.0643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-big-is-bci-fragment-of-bck-logic-1112.0643"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-of-qualitative-optimization-problems-1112.0791</loc><lastmod>2011-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-of-qualitative-optimization-problems-1112.0791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-of-qualitative-optimization-problems-1112.0791"/></url>
<url><loc>https://scifaro.com/en/abs/finite-and-infinite-support-in-nominal-algebra-and-logic-nominal-completeness-theorems-for-free-1112.0923</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-and-infinite-support-in-nominal-algebra-and-logic-nominal-completeness-theorems-for-free-1112.0923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-and-infinite-support-in-nominal-algebra-and-logic-nominal-completeness-theorems-for-free-1112.0923"/></url>
<url><loc>https://scifaro.com/en/abs/generic-environments-in-coq-1112.1316</loc><lastmod>2011-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-environments-in-coq-1112.1316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-environments-in-coq-1112.1316"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1554</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1554"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-priority-synthesis-and-its-applications-1112.1783</loc><lastmod>2012-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-priority-synthesis-and-its-applications-1112.1783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-priority-synthesis-and-its-applications-1112.1783"/></url>
<url><loc>https://scifaro.com/en/abs/wave-equation-numerical-resolution-a-comprehensive-mechanized-proof-of-a-c-program-1112.1795</loc><lastmod>2013-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wave-equation-numerical-resolution-a-comprehensive-mechanized-proof-of-a-c-program-1112.1795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wave-equation-numerical-resolution-a-comprehensive-mechanized-proof-of-a-c-program-1112.1795"/></url>
<url><loc>https://scifaro.com/en/abs/a-formally-specified-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1848</loc><lastmod>2011-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formally-specified-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formally-specified-program-logic-for-higher-order-procedural-variables-and-non-local-jumps-1112.1848"/></url>
<url><loc>https://scifaro.com/en/abs/qbf-based-boolean-function-bi-decomposition-1112.2313</loc><lastmod>2011-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qbf-based-boolean-function-bi-decomposition-1112.2313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qbf-based-boolean-function-bi-decomposition-1112.2313"/></url>
<url><loc>https://scifaro.com/en/abs/a-duality-between-exceptions-and-states-1112.2394</loc><lastmod>2011-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-duality-between-exceptions-and-states-1112.2394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-duality-between-exceptions-and-states-1112.2394"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-a-hoare-floyd-logic-for-non-local-jumps-from-a-formulae-as-types-notion-of-control-1112.2950</loc><lastmod>2011-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-a-hoare-floyd-logic-for-non-local-jumps-from-a-formulae-as-types-notion-of-control-1112.2950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-a-hoare-floyd-logic-for-non-local-jumps-from-a-formulae-as-types-notion-of-control-1112.2950"/></url>
<url><loc>https://scifaro.com/en/abs/estimation-of-the-length-of-interactions-in-arena-game-semantics-1112.3053</loc><lastmod>2011-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/estimation-of-the-length-of-interactions-in-arena-game-semantics-1112.3053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/estimation-of-the-length-of-interactions-in-arena-game-semantics-1112.3053"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-1112.3198</loc><lastmod>2011-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-1112.3198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-1112.3198"/></url>
<url><loc>https://scifaro.com/en/abs/the-biequivalence-of-locally-cartesian-closed-categories-and-martin-l-of-type-theories-1112.3456</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-biequivalence-of-locally-cartesian-closed-categories-and-martin-l-of-type-theories-1112.3456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-biequivalence-of-locally-cartesian-closed-categories-and-martin-l-of-type-theories-1112.3456"/></url>
<url><loc>https://scifaro.com/en/abs/causality-knowledge-and-coordination-in-distributed-systems-1112.4428</loc><lastmod>2011-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-knowledge-and-coordination-in-distributed-systems-1112.4428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-knowledge-and-coordination-in-distributed-systems-1112.4428"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-strategies-on-the-model-checking-problem-1112.6275</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-the-model-checking-problem-1112.6275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-the-model-checking-problem-1112.6275"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-workshop-on-developments-in-implicit-computational-complexity-1201.0345</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-developments-in-implicit-computational-complexity-1201.0345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-developments-in-implicit-computational-complexity-1201.0345"/></url>
<url><loc>https://scifaro.com/en/abs/open-bisimulation-for-quantum-processes-1201.0416</loc><lastmod>2012-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-bisimulation-for-quantum-processes-1201.0416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-bisimulation-for-quantum-processes-1201.0416"/></url>
<url><loc>https://scifaro.com/en/abs/absorbing-subalgebras-cyclic-terms-and-the-constraint-satisfaction-problem-1201.0557</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/absorbing-subalgebras-cyclic-terms-and-the-constraint-satisfaction-problem-1201.0557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/absorbing-subalgebras-cyclic-terms-and-the-constraint-satisfaction-problem-1201.0557"/></url>
<url><loc>https://scifaro.com/en/abs/an-extension-of-data-automata-that-captures-xpath-1201.0597</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-data-automata-that-captures-xpath-1201.0597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-data-automata-that-captures-xpath-1201.0597"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-nondeterministic-quantum-programs-1201.0891</loc><lastmod>2012-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-nondeterministic-quantum-programs-1201.0891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-nondeterministic-quantum-programs-1201.0891"/></url>
<url><loc>https://scifaro.com/en/abs/sciduction-combining-induction-deduction-and-structure-for-verification-and-synthesis-1201.0979</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sciduction-combining-induction-deduction-and-structure-for-verification-and-synthesis-1201.0979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sciduction-combining-induction-deduction-and-structure-for-verification-and-synthesis-1201.0979"/></url>
<url><loc>https://scifaro.com/en/abs/provably-total-functions-of-arithmetic-with-basic-terms-1201.1121</loc><lastmod>2012-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provably-total-functions-of-arithmetic-with-basic-terms-1201.1121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provably-total-functions-of-arithmetic-with-basic-terms-1201.1121"/></url>
<url><loc>https://scifaro.com/en/abs/relating-operator-spaces-via-adjunctions-1201.1272</loc><lastmod>2012-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-operator-spaces-via-adjunctions-1201.1272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-operator-spaces-via-adjunctions-1201.1272"/></url>
<url><loc>https://scifaro.com/en/abs/is-it-a-good-encoding-of-mixed-choice-technical-report-1201.1410</loc><lastmod>2012-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-it-a-good-encoding-of-mixed-choice-technical-report-1201.1410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-it-a-good-encoding-of-mixed-choice-technical-report-1201.1410"/></url>
<url><loc>https://scifaro.com/en/abs/on-completeness-of-reducibility-candidates-as-a-semantics-of-strong-normalization-1201.1705</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-completeness-of-reducibility-candidates-as-a-semantics-of-strong-normalization-1201.1705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-completeness-of-reducibility-candidates-as-a-semantics-of-strong-normalization-1201.1705"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-reduction-theory-for-systems-with-replicated-components-1201.1716</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-reduction-theory-for-systems-with-replicated-components-1201.1716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-reduction-theory-for-systems-with-replicated-components-1201.1716"/></url>
<url><loc>https://scifaro.com/en/abs/characterisations-of-testing-preorders-for-a-finite-probabilistic-pi-calculus-1201.2258</loc><lastmod>2012-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterisations-of-testing-preorders-for-a-finite-probabilistic-pi-calculus-1201.2258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterisations-of-testing-preorders-for-a-finite-probabilistic-pi-calculus-1201.2258"/></url>
<url><loc>https://scifaro.com/en/abs/mean-payoff-pushdown-games-1201.2829</loc><lastmod>2016-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mean-payoff-pushdown-games-1201.2829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mean-payoff-pushdown-games-1201.2829"/></url>
<url><loc>https://scifaro.com/en/abs/on-paths-based-criteria-for-polynomial-time-complexity-in-proof-nets-1201.2956</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-paths-based-criteria-for-polynomial-time-complexity-in-proof-nets-1201.2956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-paths-based-criteria-for-polynomial-time-complexity-in-proof-nets-1201.2956"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-sequences-and-zip-specifications-1201.3251</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-sequences-and-zip-specifications-1201.3251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-sequences-and-zip-specifications-1201.3251"/></url>
<url><loc>https://scifaro.com/en/abs/a-synthesis-of-the-procedural-and-declarative-styles-of-interactive-theorem-proving-1201.3601</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-synthesis-of-the-procedural-and-declarative-styles-of-interactive-theorem-proving-1201.3601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-synthesis-of-the-procedural-and-declarative-styles-of-interactive-theorem-proving-1201.3601"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-interactive-proofs-formal-theory-of-knowledge-transfer-1201.3667</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-interactive-proofs-formal-theory-of-knowledge-transfer-1201.3667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-interactive-proofs-formal-theory-of-knowledge-transfer-1201.3667"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proofs-in-real-algebraic-geometry-from-ordered-fields-to-quantifier-elimination-1201.3731</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proofs-in-real-algebraic-geometry-from-ordered-fields-to-quantifier-elimination-1201.3731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proofs-in-real-algebraic-geometry-from-ordered-fields-to-quantifier-elimination-1201.3731"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-classical-realizability-1201.4307</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-classical-realizability-1201.4307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-classical-realizability-1201.4307"/></url>
<url><loc>https://scifaro.com/en/abs/faster-algorithms-for-alternating-refinement-relations-1201.4449</loc><lastmod>2012-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-algorithms-for-alternating-refinement-relations-1201.4449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-algorithms-for-alternating-refinement-relations-1201.4449"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-level-semantics-1201.4462</loc><lastmod>2012-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-level-semantics-1201.4462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-level-semantics-1201.4462"/></url>
<url><loc>https://scifaro.com/en/abs/ramified-structural-recursion-and-corecursion-1201.4567</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ramified-structural-recursion-and-corecursion-1201.4567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ramified-structural-recursion-and-corecursion-1201.4567"/></url>
<url><loc>https://scifaro.com/en/abs/a-pspace-complete-first-order-fragment-of-computability-logic-1201.4856</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pspace-complete-first-order-fragment-of-computability-logic-1201.4856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pspace-complete-first-order-fragment-of-computability-logic-1201.4856"/></url>
<url><loc>https://scifaro.com/en/abs/queue-dispatch-asynchronous-systems-1201.4871</loc><lastmod>2012-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/queue-dispatch-asynchronous-systems-1201.4871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/queue-dispatch-asynchronous-systems-1201.4871"/></url>
<url><loc>https://scifaro.com/en/abs/word-automaticity-of-tree-automatic-scattered-linear-orderings-is-decidable-1201.5070</loc><lastmod>2012-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-automaticity-of-tree-automatic-scattered-linear-orderings-is-decidable-1201.5070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-automaticity-of-tree-automatic-scattered-linear-orderings-is-decidable-1201.5070"/></url>
<url><loc>https://scifaro.com/en/abs/a-dependent-nominal-type-theory-1201.5240</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dependent-nominal-type-theory-1201.5240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dependent-nominal-type-theory-1201.5240"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-all-coalitional-operators-for-common-and-distributed-knowledge-1201.5346</loc><lastmod>2016-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-all-coalitional-operators-for-common-and-distributed-knowledge-1201.5346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-the-multi-agent-epistemic-logic-with-all-coalitional-operators-for-common-and-distributed-knowledge-1201.5346"/></url>
<url><loc>https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1201.5418</loc><lastmod>2012-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1201.5418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-transformation-based-implementation-for-clp-with-qualification-and-proximity-1201.5418"/></url>
<url><loc>https://scifaro.com/en/abs/tree-automatic-well-founded-trees-1201.5495</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-automatic-well-founded-trees-1201.5495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-automatic-well-founded-trees-1201.5495"/></url>
<url><loc>https://scifaro.com/en/abs/quantifier-elimination-by-dependency-sequents-1201.5653</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifier-elimination-by-dependency-sequents-1201.5653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifier-elimination-by-dependency-sequents-1201.5653"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-entailment-of-implications-with-support-and-confidence-in-polynomial-space-1201.5719</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-entailment-of-implications-with-support-and-confidence-in-polynomial-space-1201.5719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-entailment-of-implications-with-support-and-confidence-in-polynomial-space-1201.5719"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-for-pictures-languages-extended-abstract-1201.5853</loc><lastmod>2012-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-for-pictures-languages-extended-abstract-1201.5853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-for-pictures-languages-extended-abstract-1201.5853"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-generating-ground-explanations-technical-report-1201.5954</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-generating-ground-explanations-technical-report-1201.5954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-generating-ground-explanations-technical-report-1201.5954"/></url>
<url><loc>https://scifaro.com/en/abs/turing-impossibility-properties-for-stack-machine-programming-1201.6028</loc><lastmod>2012-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turing-impossibility-properties-for-stack-machine-programming-1201.6028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turing-impossibility-properties-for-stack-machine-programming-1201.6028"/></url>
<url><loc>https://scifaro.com/en/abs/meditations-on-quantified-constraint-satisfaction-1201.6306</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meditations-on-quantified-constraint-satisfaction-1201.6306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meditations-on-quantified-constraint-satisfaction-1201.6306"/></url>
<url><loc>https://scifaro.com/en/abs/denotation-of-syntax-and-metaprogramming-in-contextual-modal-type-theory-cmtt-1202.0904</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotation-of-syntax-and-metaprogramming-in-contextual-modal-type-theory-cmtt-1202.0904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotation-of-syntax-and-metaprogramming-in-contextual-modal-type-theory-cmtt-1202.0904"/></url>
<url><loc>https://scifaro.com/en/abs/type-elimination-based-reasoning-for-the-description-logic-shiqbs-using-decision-diagrams-and-disjunctive-datalog-1202.0914</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-elimination-based-reasoning-for-the-description-logic-shiqbs-using-decision-diagrams-and-disjunctive-datalog-1202.0914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-elimination-based-reasoning-for-the-description-logic-shiqbs-using-decision-diagrams-and-disjunctive-datalog-1202.0914"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-fragment-of-strategy-logic-1202.1309</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-fragment-of-strategy-logic-1202.1309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-fragment-of-strategy-logic-1202.1309"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-invariance-of-the-unitary-cost-model-for-head-reduction-long-version-1202.1641</loc><lastmod>2012-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-invariance-of-the-unitary-cost-model-for-head-reduction-long-version-1202.1641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-invariance-of-the-unitary-cost-model-for-head-reduction-long-version-1202.1641"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-on-higher-order-nested-pushdown-trees-1202.1980</loc><lastmod>2012-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-on-higher-order-nested-pushdown-trees-1202.1980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-on-higher-order-nested-pushdown-trees-1202.1980"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-separation-of-regular-resolution-from-pool-resolution-and-clause-learning-1202.2296</loc><lastmod>2012-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-separation-of-regular-resolution-from-pool-resolution-and-clause-learning-1202.2296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-separation-of-regular-resolution-from-pool-resolution-and-clause-learning-1202.2296"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-workshop-on-mathematically-structured-functional-programming-1202.2407</loc><lastmod>2012-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-mathematically-structured-functional-programming-1202.2407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-mathematically-structured-functional-programming-1202.2407"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-workshop-on-fixed-points-in-computer-science-1202.3174</loc><lastmod>2012-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-fixed-points-in-computer-science-1202.3174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-fixed-points-in-computer-science-1202.3174"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-powerlocales-via-relation-lifting-1202.3264</loc><lastmod>2012-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-powerlocales-via-relation-lifting-1202.3264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-powerlocales-via-relation-lifting-1202.3264"/></url>
<url><loc>https://scifaro.com/en/abs/an-higher-order-characterization-of-probabilistic-polynomial-time-long-version-1202.3317</loc><lastmod>2012-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-higher-order-characterization-of-probabilistic-polynomial-time-long-version-1202.3317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-higher-order-characterization-of-probabilistic-polynomial-time-long-version-1202.3317"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-bisimulation-for-quantum-processes-1202.3484</loc><lastmod>2012-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-bisimulation-for-quantum-processes-1202.3484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-bisimulation-for-quantum-processes-1202.3484"/></url>
<url><loc>https://scifaro.com/en/abs/type-based-termination-inflationary-fixed-points-and-mixed-inductive-coinductive-types-1202.3496</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-based-termination-inflationary-fixed-points-and-mixed-inductive-coinductive-types-1202.3496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-based-termination-inflationary-fixed-points-and-mixed-inductive-coinductive-types-1202.3496"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-formulae-for-relations-with-nested-fixed-points-1202.3497</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-formulae-for-relations-with-nested-fixed-points-1202.3497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-formulae-for-relations-with-nested-fixed-points-1202.3497"/></url>
<url><loc>https://scifaro.com/en/abs/io-vs-oi-in-higher-order-recursion-schemes-1202.3498</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/io-vs-oi-in-higher-order-recursion-schemes-1202.3498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/io-vs-oi-in-higher-order-recursion-schemes-1202.3498"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-the-higher-dimensional-modal-mu-calculus-1202.3500</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-the-higher-dimensional-modal-mu-calculus-1202.3500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-the-higher-dimensional-modal-mu-calculus-1202.3500"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-the-mu-calculus-with-one-variable-1202.3501</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-the-mu-calculus-with-one-variable-1202.3501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-the-mu-calculus-with-one-variable-1202.3501"/></url>
<url><loc>https://scifaro.com/en/abs/structured-general-corecursion-and-coinductive-graphs-extended-abstract-1202.3502</loc><lastmod>2012-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-general-corecursion-and-coinductive-graphs-extended-abstract-1202.3502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-general-corecursion-and-coinductive-graphs-extended-abstract-1202.3502"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-modal-logic-1202.3538</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-modal-logic-1202.3538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-modal-logic-1202.3538"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-efficient-prover-for-the-c1-paraconsistent-logic-1202.4144</loc><lastmod>2012-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-efficient-prover-for-the-c1-paraconsistent-logic-1202.4144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-efficient-prover-for-the-c1-paraconsistent-logic-1202.4144"/></url>
<url><loc>https://scifaro.com/en/abs/average-case-analysis-of-the-classical-algorithm-for-markov-decision-processes-with-b-uchi-objectives-1202.4175</loc><lastmod>2014-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-case-analysis-of-the-classical-algorithm-for-markov-decision-processes-with-b-uchi-objectives-1202.4175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-case-analysis-of-the-classical-algorithm-for-markov-decision-processes-with-b-uchi-objectives-1202.4175"/></url>
<url><loc>https://scifaro.com/en/abs/exponential-lower-bounds-and-separation-for-query-rewriting-1202.4193</loc><lastmod>2012-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponential-lower-bounds-and-separation-for-query-rewriting-1202.4193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponential-lower-bounds-and-separation-for-query-rewriting-1202.4193"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-termination-of-monotonicity-constraint-transition-systems-1202.4281</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-termination-of-monotonicity-constraint-transition-systems-1202.4281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-termination-of-monotonicity-constraint-transition-systems-1202.4281"/></url>
<url><loc>https://scifaro.com/en/abs/rich-counter-examples-for-temporal-epistemic-logic-model-checking-1202.4509</loc><lastmod>2012-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rich-counter-examples-for-temporal-epistemic-logic-model-checking-1202.4509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rich-counter-examples-for-temporal-epistemic-logic-model-checking-1202.4509"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-model-for-the-lambda-calculus-with-constructors-1202.4678</loc><lastmod>2012-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-model-for-the-lambda-calculus-with-constructors-1202.4678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-model-for-the-lambda-calculus-with-constructors-1202.4678"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-form-of-attribute-exploration-1202.4824</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-form-of-attribute-exploration-1202.4824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-form-of-attribute-exploration-1202.4824"/></url>
<url><loc>https://scifaro.com/en/abs/an-exercise-in-invariant-based-programming-with-interactive-and-automatic-theorem-prover-support-1202.4829</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-exercise-in-invariant-based-programming-with-interactive-and-automatic-theorem-prover-support-1202.4829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-exercise-in-invariant-based-programming-with-interactive-and-automatic-theorem-prover-support-1202.4829"/></url>
<url><loc>https://scifaro.com/en/abs/automated-generation-of-user-guidance-by-combining-computation-and-deduction-1202.4832</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-generation-of-user-guidance-by-combining-computation-and-deduction-1202.4832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-generation-of-user-guidance-by-combining-computation-and-deduction-1202.4832"/></url>
<url><loc>https://scifaro.com/en/abs/computer-assisted-program-reasoning-based-on-a-relational-semantics-of-programs-1202.4834</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-assisted-program-reasoning-based-on-a-relational-semantics-of-programs-1202.4834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-assisted-program-reasoning-based-on-a-relational-semantics-of-programs-1202.4834"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-pide-as-platform-for-educational-tools-1202.4835</loc><lastmod>2012-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-pide-as-platform-for-educational-tools-1202.4835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-pide-as-platform-for-educational-tools-1202.4835"/></url>
<url><loc>https://scifaro.com/en/abs/a-bi-directional-refinement-algorithm-for-the-calculus-of-co-inductive-constructions-1202.4905</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bi-directional-refinement-algorithm-for-the-calculus-of-co-inductive-constructions-1202.4905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bi-directional-refinement-algorithm-for-the-calculus-of-co-inductive-constructions-1202.4905"/></url>
<url><loc>https://scifaro.com/en/abs/the-cost-of-parameterized-reachability-in-mobile-ad-hoc-networks-1202.5850</loc><lastmod>2012-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cost-of-parameterized-reachability-in-mobile-ad-hoc-networks-1202.5850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cost-of-parameterized-reachability-in-mobile-ad-hoc-networks-1202.5850"/></url>
<url><loc>https://scifaro.com/en/abs/instance-based-methods-a-brief-overview-1202.6148</loc><lastmod>2012-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instance-based-methods-a-brief-overview-1202.6148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instance-based-methods-a-brief-overview-1202.6148"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-proving-for-prenex-g-odel-logic-with-delta-checking-validity-and-unsatisfiability-1202.6352</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-proving-for-prenex-g-odel-logic-with-delta-checking-validity-and-unsatisfiability-1202.6352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-proving-for-prenex-g-odel-logic-with-delta-checking-validity-and-unsatisfiability-1202.6352"/></url>
<url><loc>https://scifaro.com/en/abs/first-steps-towards-the-certification-of-an-arm-simulator-using-compcert-1202.6472</loc><lastmod>2012-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-steps-towards-the-certification-of-an-arm-simulator-using-compcert-1202.6472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-steps-towards-the-certification-of-an-arm-simulator-using-compcert-1202.6472"/></url>
<url><loc>https://scifaro.com/en/abs/color-a-coq-library-on-well-founded-rewrite-relations-and-its-application-to-the-automated-verification-of-termination-certificates-1202.6473</loc><lastmod>2012-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/color-a-coq-library-on-well-founded-rewrite-relations-and-its-application-to-the-automated-verification-of-termination-certificates-1202.6473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/color-a-coq-library-on-well-founded-rewrite-relations-and-its-application-to-the-automated-verification-of-termination-certificates-1202.6473"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-system-cl12-of-computability-logic-1203.0103</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-system-cl12-of-computability-logic-1203.0103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-system-cl12-of-computability-logic-1203.0103"/></url>
<url><loc>https://scifaro.com/en/abs/derivation-lengths-classification-of-g-odel-s-t-extending-howard-s-assignment-1203.0115</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivation-lengths-classification-of-g-odel-s-t-extending-howard-s-assignment-1203.0115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivation-lengths-classification-of-g-odel-s-t-extending-howard-s-assignment-1203.0115"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-of-the-zermelo-fraenkel-set-theory-with-the-axiom-of-choice-and-its-effects-on-the-computational-complexity-1203.0494</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-of-the-zermelo-fraenkel-set-theory-with-the-axiom-of-choice-and-its-effects-on-the-computational-complexity-1203.0494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-of-the-zermelo-fraenkel-set-theory-with-the-axiom-of-choice-and-its-effects-on-the-computational-complexity-1203.0494"/></url>
<url><loc>https://scifaro.com/en/abs/expressing-preferences-using-preference-set-constraint-atoms-1203.0587</loc><lastmod>2012-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressing-preferences-using-preference-set-constraint-atoms-1203.0587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressing-preferences-using-preference-set-constraint-atoms-1203.0587"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-of-strong-normalisation-modulo-permutations-for-the-structural-lambda-calculus-1203.0670</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-of-strong-normalisation-modulo-permutations-for-the-structural-lambda-calculus-1203.0670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-of-strong-normalisation-modulo-permutations-for-the-structural-lambda-calculus-1203.0670"/></url>
<url><loc>https://scifaro.com/en/abs/fluid-model-checking-1203.0920</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fluid-model-checking-1203.0920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fluid-model-checking-1203.0920"/></url>
<url><loc>https://scifaro.com/en/abs/control-of-probabilistic-systems-under-dynamic-partially-known-environments-with-temporal-logic-specifications-1203.1177</loc><lastmod>2012-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/control-of-probabilistic-systems-under-dynamic-partially-known-environments-with-temporal-logic-specifications-1203.1177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/control-of-probabilistic-systems-under-dynamic-partially-known-environments-with-temporal-logic-specifications-1203.1177"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-of-linear-time-properties-based-on-possibility-measure-1203.2241</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-of-linear-time-properties-based-on-possibility-measure-1203.2241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-of-linear-time-properties-based-on-possibility-measure-1203.2241"/></url>
<url><loc>https://scifaro.com/en/abs/automated-synthesis-of-a-finite-complexity-ordering-for-saturation-1203.2809</loc><lastmod>2012-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-synthesis-of-a-finite-complexity-ordering-for-saturation-1203.2809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-synthesis-of-a-finite-complexity-ordering-for-saturation-1203.2809"/></url>
<url><loc>https://scifaro.com/en/abs/decorated-proofs-for-computational-effects-exceptions-1203.2900</loc><lastmod>2012-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decorated-proofs-for-computational-effects-exceptions-1203.2900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decorated-proofs-for-computational-effects-exceptions-1203.2900"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-intractability-of-monadic-second-order-logic-1203.3167</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-intractability-of-monadic-second-order-logic-1203.3167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-intractability-of-monadic-second-order-logic-1203.3167"/></url>
<url><loc>https://scifaro.com/en/abs/investigations-on-a-pedagogical-calculus-of-constructions-1203.3568</loc><lastmod>2014-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/investigations-on-a-pedagogical-calculus-of-constructions-1203.3568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/investigations-on-a-pedagogical-calculus-of-constructions-1203.3568"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-computing-minimal-unsatisfiable-ltl-formulas-1203.3706</loc><lastmod>2012-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-computing-minimal-unsatisfiable-ltl-formulas-1203.3706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-computing-minimal-unsatisfiable-ltl-formulas-1203.3706"/></url>
<url><loc>https://scifaro.com/en/abs/from-strong-amalgamability-to-modularity-of-quantifier-free-interpolation-1203.3730</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-strong-amalgamability-to-modularity-of-quantifier-free-interpolation-1203.3730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-strong-amalgamability-to-modularity-of-quantifier-free-interpolation-1203.3730"/></url>
<url><loc>https://scifaro.com/en/abs/tree-width-for-first-order-formulae-1203.3814</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-width-for-first-order-formulae-1203.3814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-width-for-first-order-formulae-1203.3814"/></url>
<url><loc>https://scifaro.com/en/abs/on-irrelevance-and-algorithmic-equality-in-predicative-type-theory-1203.4716</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-irrelevance-and-algorithmic-equality-in-predicative-type-theory-1203.4716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-irrelevance-and-algorithmic-equality-in-predicative-type-theory-1203.4716"/></url>
<url><loc>https://scifaro.com/en/abs/computational-interpretation-of-classical-logic-with-explicit-structural-rules-1203.4754</loc><lastmod>2012-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-interpretation-of-classical-logic-with-explicit-structural-rules-1203.4754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-interpretation-of-classical-logic-with-explicit-structural-rules-1203.4754"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-proof-nets-and-matrices-for-substructural-logics-1203.4912</loc><lastmod>2012-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-proof-nets-and-matrices-for-substructural-logics-1203.4912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-proof-nets-and-matrices-for-substructural-logics-1203.4912"/></url>
<url><loc>https://scifaro.com/en/abs/a-reduction-preserving-completion-for-proving-confluence-of-non-terminating-term-rewriting-systems-1203.5121</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reduction-preserving-completion-for-proving-confluence-of-non-terminating-term-rewriting-systems-1203.5121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reduction-preserving-completion-for-proving-confluence-of-non-terminating-term-rewriting-systems-1203.5121"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-proof-complexity-and-w-1-1203.5323</loc><lastmod>2012-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-proof-complexity-and-w-1-1203.5323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-proof-complexity-and-w-1-1203.5323"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-6th-workshop-on-logical-and-semantic-frameworks-with-applications-1203.5423</loc><lastmod>2012-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-6th-workshop-on-logical-and-semantic-frameworks-with-applications-1203.5423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-6th-workshop-on-logical-and-semantic-frameworks-with-applications-1203.5423"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-interpretations-for-higher-order-rewriting-1203.5754</loc><lastmod>2012-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-interpretations-for-higher-order-rewriting-1203.5754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-interpretations-for-higher-order-rewriting-1203.5754"/></url>
<url><loc>https://scifaro.com/en/abs/the-fo-2-alternation-hierarchy-is-decidable-1203.6152</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fo-2-alternation-hierarchy-is-decidable-1203.6152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fo-2-alternation-hierarchy-is-decidable-1203.6152"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-for-set-theories-1203.6157</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-for-set-theories-1203.6157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-for-set-theories-1203.6157"/></url>
<url><loc>https://scifaro.com/en/abs/mendler-style-iso-co-inductive-predicates-a-strongly-normalizing-approach-1203.6158</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mendler-style-iso-co-inductive-predicates-a-strongly-normalizing-approach-1203.6158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mendler-style-iso-co-inductive-predicates-a-strongly-normalizing-approach-1203.6158"/></url>
<url><loc>https://scifaro.com/en/abs/on-graph-refutation-for-relational-inclusions-1203.6159</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-graph-refutation-for-relational-inclusions-1203.6159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-graph-refutation-for-relational-inclusions-1203.6159"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-the-theorem-of-existence-of-first-order-most-general-unifiers-1203.6160</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-the-theorem-of-existence-of-first-order-most-general-unifiers-1203.6160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-the-theorem-of-existence-of-first-order-most-general-unifiers-1203.6160"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-time-in-ltl-1203.6278</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-time-in-ltl-1203.6278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-time-in-ltl-1203.6278"/></url>
<url><loc>https://scifaro.com/en/abs/tracing-the-man-in-the-middle-in-monoidal-categories-1203.6324</loc><lastmod>2012-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracing-the-man-in-the-middle-in-monoidal-categories-1203.6324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracing-the-man-in-the-middle-in-monoidal-categories-1203.6324"/></url>
<url><loc>https://scifaro.com/en/abs/barriers-in-concurrent-separation-logic-now-with-tool-support-1203.6412</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/barriers-in-concurrent-separation-logic-now-with-tool-support-1203.6412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/barriers-in-concurrent-separation-logic-now-with-tool-support-1203.6412"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-counter-abstraction-1204.0131</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-counter-abstraction-1204.0131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-counter-abstraction-1204.0131"/></url>
<url><loc>https://scifaro.com/en/abs/the-lambda-mu-t-calculus-1204.0347</loc><lastmod>2012-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lambda-mu-t-calculus-1204.0347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lambda-mu-t-calculus-1204.0347"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-satisfiability-for-pctl-1204.0469</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-satisfiability-for-pctl-1204.0469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-satisfiability-for-pctl-1204.0469"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-finding-narrow-proofs-1204.0775</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-narrow-proofs-1204.0775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-narrow-proofs-1204.0775"/></url>
<url><loc>https://scifaro.com/en/abs/characteristics-of-minimal-effective-programming-systems-1204.1372</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristics-of-minimal-effective-programming-systems-1204.1372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristics-of-minimal-effective-programming-systems-1204.1372"/></url>
<url><loc>https://scifaro.com/en/abs/removal-of-quantifiers-by-elimination-of-boundary-points-1204.1746</loc><lastmod>2012-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/removal-of-quantifiers-by-elimination-of-boundary-points-1204.1746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/removal-of-quantifiers-by-elimination-of-boundary-points-1204.1746"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-and-logical-characterizations-on-continuous-time-markov-decision-processes-1204.1848</loc><lastmod>2013-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-and-logical-characterizations-on-continuous-time-markov-decision-processes-1204.1848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-and-logical-characterizations-on-continuous-time-markov-decision-processes-1204.1848"/></url>
<url><loc>https://scifaro.com/en/abs/pebble-games-and-linear-equations-1204.1990</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pebble-games-and-linear-equations-1204.1990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pebble-games-and-linear-equations-1204.1990"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-an-epistemic-mu-calculus-with-synchronous-and-perfect-recall-semantics-1204.2087</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-an-epistemic-mu-calculus-with-synchronous-and-perfect-recall-semantics-1204.2087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-an-epistemic-mu-calculus-with-synchronous-and-perfect-recall-semantics-1204.2087"/></url>
<url><loc>https://scifaro.com/en/abs/quantifier-free-interpolation-of-a-theory-of-arrays-1204.2386</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifier-free-interpolation-of-a-theory-of-arrays-1204.2386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifier-free-interpolation-of-a-theory-of-arrays-1204.2386"/></url>
<url><loc>https://scifaro.com/en/abs/grammar-logics-in-nested-sequent-calculus-proof-theory-and-decision-procedures-1204.2413</loc><lastmod>2012-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grammar-logics-in-nested-sequent-calculus-proof-theory-and-decision-procedures-1204.2413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grammar-logics-in-nested-sequent-calculus-proof-theory-and-decision-procedures-1204.2413"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-for-two-variable-logic-with-two-successor-relations-on-finite-linear-orders-1204.2495</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-for-two-variable-logic-with-two-successor-relations-on-finite-linear-orders-1204.2495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-for-two-variable-logic-with-two-successor-relations-on-finite-linear-orders-1204.2495"/></url>
<url><loc>https://scifaro.com/en/abs/layered-fixed-point-logic-1204.2768</loc><lastmod>2012-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-fixed-point-logic-1204.2768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-fixed-point-logic-1204.2768"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-of-probabilistic-programs-using-patterns-1204.2932</loc><lastmod>2012-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-of-probabilistic-programs-using-patterns-1204.2932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-of-probabilistic-programs-using-patterns-1204.2932"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-resolution-with-bounded-conjunction-1204.2983</loc><lastmod>2012-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-resolution-with-bounded-conjunction-1204.2983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-resolution-with-bounded-conjunction-1204.2983"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-on-schemata-of-formulae-1204.2990</loc><lastmod>2012-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-on-schemata-of-formulae-1204.2990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-on-schemata-of-formulae-1204.2990"/></url>
<url><loc>https://scifaro.com/en/abs/definability-of-linear-equation-systems-over-groups-and-rings-1204.3022</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definability-of-linear-equation-systems-over-groups-and-rings-1204.3022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definability-of-linear-equation-systems-over-groups-and-rings-1204.3022"/></url>
<url><loc>https://scifaro.com/en/abs/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-1204.3040</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-1204.3040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-1204.3040"/></url>
<url><loc>https://scifaro.com/en/abs/the-rank-of-tree-automatic-linear-orderings-1204.3048</loc><lastmod>2012-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rank-of-tree-automatic-linear-orderings-1204.3048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rank-of-tree-automatic-linear-orderings-1204.3048"/></url>
<url><loc>https://scifaro.com/en/abs/a-recursive-normalizing-one-step-reduction-strategy-for-the-distributive-lambda-calculus-1204.3158</loc><lastmod>2014-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recursive-normalizing-one-step-reduction-strategy-for-the-distributive-lambda-calculus-1204.3158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recursive-normalizing-one-step-reduction-strategy-for-the-distributive-lambda-calculus-1204.3158"/></url>
<url><loc>https://scifaro.com/en/abs/process-algebra-with-conditionals-in-the-presence-of-epsilon-1204.3249</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-algebra-with-conditionals-in-the-presence-of-epsilon-1204.3249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-algebra-with-conditionals-in-the-presence-of-epsilon-1204.3249"/></url>
<url><loc>https://scifaro.com/en/abs/blind-graph-rewriting-systems-1204.3372</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blind-graph-rewriting-systems-1204.3372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blind-graph-rewriting-systems-1204.3372"/></url>
<url><loc>https://scifaro.com/en/abs/no-big-deal-introducing-roles-to-reduce-the-size-of-atl-models-1204.3495</loc><lastmod>2012-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-big-deal-introducing-roles-to-reduce-the-size-of-atl-models-1204.3495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-big-deal-introducing-roles-to-reduce-the-size-of-atl-models-1204.3495"/></url>
<url><loc>https://scifaro.com/en/abs/delta-complete-decision-procedures-for-satisfiability-over-the-reals-1204.3513</loc><lastmod>2012-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-complete-decision-procedures-for-satisfiability-over-the-reals-1204.3513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-complete-decision-procedures-for-satisfiability-over-the-reals-1204.3513"/></url>
<url><loc>https://scifaro.com/en/abs/a-query-language-for-formal-mathematical-libraries-1204.4685</loc><lastmod>2012-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-query-language-for-formal-mathematical-libraries-1204.4685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-query-language-for-formal-mathematical-libraries-1204.4685"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-with-probabilistic-tabled-logic-programming-1204.4736</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-with-probabilistic-tabled-logic-programming-1204.4736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-with-probabilistic-tabled-logic-programming-1204.4736"/></url>
<url><loc>https://scifaro.com/en/abs/verification-condition-generation-and-variable-conditions-in-smallfoot-1204.4804</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-condition-generation-and-variable-conditions-in-smallfoot-1204.4804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-condition-generation-and-variable-conditions-in-smallfoot-1204.4804"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-automata-for-the-f-g-fragment-of-ltl-1204.5057</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-automata-for-the-f-g-fragment-of-ltl-1204.5057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-automata-for-the-f-g-fragment-of-ltl-1204.5057"/></url>
<url><loc>https://scifaro.com/en/abs/the-distributed-ontology-language-dol-ontology-integration-and-interoperability-applied-to-mathematical-formalization-1204.5093</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distributed-ontology-language-dol-ontology-integration-and-interoperability-applied-to-mathematical-formalization-1204.5093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distributed-ontology-language-dol-ontology-integration-and-interoperability-applied-to-mathematical-formalization-1204.5093"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-with-procedure-calls-1204.5156</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-with-procedure-calls-1204.5156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-with-procedure-calls-1204.5156"/></url>
<url><loc>https://scifaro.com/en/abs/two-simulations-about-dpll-t-1204.5159</loc><lastmod>2012-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-simulations-about-dpll-t-1204.5159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-simulations-about-dpll-t-1204.5159"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-reduction-strategies-in-rewriting-and-programming-1204.5318</loc><lastmod>2012-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-reduction-strategies-in-rewriting-and-programming-1204.5318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-reduction-strategies-in-rewriting-and-programming-1204.5318"/></url>
<url><loc>https://scifaro.com/en/abs/basic-completion-strategies-as-another-application-of-the-maude-strategy-language-1204.5542</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/basic-completion-strategies-as-another-application-of-the-maude-strategy-language-1204.5542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/basic-completion-strategies-as-another-application-of-the-maude-strategy-language-1204.5542"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-ac-pattern-matching-for-rewriting-1204.5543</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-ac-pattern-matching-for-rewriting-1204.5543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-ac-pattern-matching-for-rewriting-1204.5543"/></url>
<url><loc>https://scifaro.com/en/abs/productivity-of-non-orthogonal-term-rewrite-systems-1204.5544</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/productivity-of-non-orthogonal-term-rewrite-systems-1204.5544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/productivity-of-non-orthogonal-term-rewrite-systems-1204.5544"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-independent-reduction-lengths-in-rewriting-and-binary-arithmetic-1204.5545</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-independent-reduction-lengths-in-rewriting-and-binary-arithmetic-1204.5545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-independent-reduction-lengths-in-rewriting-and-binary-arithmetic-1204.5545"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-induction-methods-for-timed-systems-1204.5639</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-induction-methods-for-timed-systems-1204.5639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-induction-methods-for-timed-systems-1204.5639"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphisms-of-scattered-automatic-linear-orders-1204.5653</loc><lastmod>2012-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphisms-of-scattered-automatic-linear-orders-1204.5653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphisms-of-scattered-automatic-linear-orders-1204.5653"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-finding-second-best-abductive-explanations-1204.5859</loc><lastmod>2021-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-second-best-abductive-explanations-1204.5859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-second-best-abductive-explanations-1204.5859"/></url>
<url><loc>https://scifaro.com/en/abs/containment-equivalence-and-coreness-from-csp-to-qcsp-and-beyond-1204.5981</loc><lastmod>2012-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/containment-equivalence-and-coreness-from-csp-to-qcsp-and-beyond-1204.5981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/containment-equivalence-and-coreness-from-csp-to-qcsp-and-beyond-1204.5981"/></url>
<url><loc>https://scifaro.com/en/abs/non-definability-of-languages-by-generalized-first-order-formulas-over-n-1204.6179</loc><lastmod>2012-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-definability-of-languages-by-generalized-first-order-formulas-over-n-1204.6179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-definability-of-languages-by-generalized-first-order-formulas-over-n-1204.6179"/></url>
<url><loc>https://scifaro.com/en/abs/combining-deduction-modulo-and-logics-of-fixed-point-definitions-1204.6236</loc><lastmod>2012-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-deduction-modulo-and-logics-of-fixed-point-definitions-1204.6236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-deduction-modulo-and-logics-of-fixed-point-definitions-1204.6236"/></url>
<url><loc>https://scifaro.com/en/abs/where-first-order-and-monadic-second-order-logic-coincide-1204.6291</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/where-first-order-and-monadic-second-order-logic-coincide-1204.6291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/where-first-order-and-monadic-second-order-logic-coincide-1204.6291"/></url>
<url><loc>https://scifaro.com/en/abs/generalising-unit-refutation-completeness-and-slur-via-nested-input-resolution-1204.6529</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalising-unit-refutation-completeness-and-slur-via-nested-input-resolution-1204.6529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalising-unit-refutation-completeness-and-slur-via-nested-input-resolution-1204.6529"/></url>
<url><loc>https://scifaro.com/en/abs/escape-to-mizar-for-atps-1204.6615</loc><lastmod>2012-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/escape-to-mizar-for-atps-1204.6615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/escape-to-mizar-for-atps-1204.6615"/></url>
<url><loc>https://scifaro.com/en/abs/delta-decidability-over-the-reals-1204.6671</loc><lastmod>2012-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-decidability-over-the-reals-1204.6671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-decidability-over-the-reals-1204.6671"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-equivalence-of-game-and-denotational-semantics-for-the-probabilistic-mu-calculus-1205.0126</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-equivalence-of-game-and-denotational-semantics-for-the-probabilistic-mu-calculus-1205.0126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-equivalence-of-game-and-denotational-semantics-for-the-probabilistic-mu-calculus-1205.0126"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-scale-a-lambda-calculus-for-spaces-with-dilations-1205.0139</loc><lastmod>2012-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-scale-a-lambda-calculus-for-spaces-with-dilations-1205.0139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-scale-a-lambda-calculus-for-spaces-with-dilations-1205.0139"/></url>
<url><loc>https://scifaro.com/en/abs/modes-of-convergence-for-term-graph-rewriting-1205.0357</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modes-of-convergence-for-term-graph-rewriting-1205.0357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modes-of-convergence-for-term-graph-rewriting-1205.0357"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-existential-pebble-games-and-k-consistency-tests-1205.0679</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-existential-pebble-games-and-k-consistency-tests-1205.0679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-existential-pebble-games-and-k-consistency-tests-1205.0679"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-complexity-of-alc-subsumption-1205.0722</loc><lastmod>2012-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-complexity-of-alc-subsumption-1205.0722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-complexity-of-alc-subsumption-1205.0722"/></url>
<url><loc>https://scifaro.com/en/abs/pebble-games-with-algebraic-rules-1205.0913</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pebble-games-with-algebraic-rules-1205.0913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pebble-games-with-algebraic-rules-1205.0913"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-ltl-satisfiability-checking-without-automata-1205.0946</loc><lastmod>2014-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-ltl-satisfiability-checking-without-automata-1205.0946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-ltl-satisfiability-checking-without-automata-1205.0946"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-under-substructures-modulo-bounded-cores-1205.1358</loc><lastmod>2012-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-under-substructures-modulo-bounded-cores-1205.1358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-under-substructures-modulo-bounded-cores-1205.1358"/></url>
<url><loc>https://scifaro.com/en/abs/unique-parallel-decomposition-in-branching-and-weak-bisimulation-semantics-1205.2117</loc><lastmod>2015-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-parallel-decomposition-in-branching-and-weak-bisimulation-semantics-1205.2117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-parallel-decomposition-in-branching-and-weak-bisimulation-semantics-1205.2117"/></url>
<url><loc>https://scifaro.com/en/abs/refining-inductive-types-1205.2492</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-inductive-types-1205.2492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-inductive-types-1205.2492"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-dependency-pairs-for-algebraic-functional-systems-1205.2519</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-dependency-pairs-for-algebraic-functional-systems-1205.2519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-dependency-pairs-for-algebraic-functional-systems-1205.2519"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-mixed-integer-linear-programming-1205.2644</loc><lastmod>2012-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-mixed-integer-linear-programming-1205.2644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-mixed-integer-linear-programming-1205.2644"/></url>
<url><loc>https://scifaro.com/en/abs/precompact-apartness-spaces-1205.2931</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/precompact-apartness-spaces-1205.2931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/precompact-apartness-spaces-1205.2931"/></url>
<url><loc>https://scifaro.com/en/abs/untyping-typed-algebras-and-colouring-cyclic-linear-logic-1205.3612</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/untyping-typed-algebras-and-colouring-cyclic-linear-logic-1205.3612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/untyping-typed-algebras-and-colouring-cyclic-linear-logic-1205.3612"/></url>
<url><loc>https://scifaro.com/en/abs/invariant-stream-generators-using-automatic-abstract-transformers-based-on-a-decidable-logic-1205.3758</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariant-stream-generators-using-automatic-abstract-transformers-based-on-a-decidable-logic-1205.3758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariant-stream-generators-using-automatic-abstract-transformers-based-on-a-decidable-logic-1205.3758"/></url>
<url><loc>https://scifaro.com/en/abs/necessity-as-justified-truth-1205.3803</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/necessity-as-justified-truth-1205.3803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/necessity-as-justified-truth-1205.3803"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-discriminating-power-of-tests-in-resource-lambda-calculus-1205.4691</loc><lastmod>2012-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-discriminating-power-of-tests-in-resource-lambda-calculus-1205.4691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-discriminating-power-of-tests-in-resource-lambda-calculus-1205.4691"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-logics-of-dynamical-systems-1205.4788</loc><lastmod>2021-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-logics-of-dynamical-systems-1205.4788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-logics-of-dynamical-systems-1205.4788"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-characterization-of-the-alternation-hierarchy-in-two-variable-logic-1205.4802</loc><lastmod>2012-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-characterization-of-the-alternation-hierarchy-in-two-variable-logic-1205.4802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-characterization-of-the-alternation-hierarchy-in-two-variable-logic-1205.4802"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-quantified-constraint-solving-over-the-reals-bibliography-1205.5571</loc><lastmod>2025-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-quantified-constraint-solving-over-the-reals-bibliography-1205.5571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-quantified-constraint-solving-over-the-reals-bibliography-1205.5571"/></url>
<url><loc>https://scifaro.com/en/abs/generic-expression-hardness-results-for-primitive-positive-formula-comparison-1205.5745</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-expression-hardness-results-for-primitive-positive-formula-comparison-1205.5745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-expression-hardness-results-for-primitive-positive-formula-comparison-1205.5745"/></url>
<url><loc>https://scifaro.com/en/abs/exptime-tableaux-for-the-description-logic-shiq-based-on-global-state-caching-and-integer-linear-feasibility-checking-1205.5838</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exptime-tableaux-for-the-description-logic-shiq-based-on-global-state-caching-and-integer-linear-feasibility-checking-1205.5838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exptime-tableaux-for-the-description-logic-shiq-based-on-global-state-caching-and-integer-linear-feasibility-checking-1205.5838"/></url>
<url><loc>https://scifaro.com/en/abs/markov-automata-deciding-weak-bisimulation-by-means-of-non-naively-vanishing-states-1205.6192</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markov-automata-deciding-weak-bisimulation-by-means-of-non-naively-vanishing-states-1205.6192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markov-automata-deciding-weak-bisimulation-by-means-of-non-naively-vanishing-states-1205.6192"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-provability-logic-1205.6402</loc><lastmod>2012-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-provability-logic-1205.6402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-provability-logic-1205.6402"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-additives-1205.6557</loc><lastmod>2015-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-additives-1205.6557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-additives-1205.6557"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-multiplicatives-1205.6558</loc><lastmod>2012-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-multiplicatives-1205.6558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-multiplicatives-1205.6558"/></url>
<url><loc>https://scifaro.com/en/abs/taming-past-ltl-and-flat-counter-systems-1205.6584</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-past-ltl-and-flat-counter-systems-1205.6584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-past-ltl-and-flat-counter-systems-1205.6584"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-branching-time-properties-of-multi-pushdown-systems-is-hard-1205.6928</loc><lastmod>2012-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-branching-time-properties-of-multi-pushdown-systems-is-hard-1205.6928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-branching-time-properties-of-multi-pushdown-systems-is-hard-1205.6928"/></url>
<url><loc>https://scifaro.com/en/abs/general-bindings-and-alpha-equivalence-in-nominal-isabelle-1206.0136</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-bindings-and-alpha-equivalence-in-nominal-isabelle-1206.0136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-bindings-and-alpha-equivalence-in-nominal-isabelle-1206.0136"/></url>
<url><loc>https://scifaro.com/en/abs/non-termination-sets-of-simple-linear-loops-1206.0232</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-termination-sets-of-simple-linear-loops-1206.0232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-termination-sets-of-simple-linear-loops-1206.0232"/></url>
<url><loc>https://scifaro.com/en/abs/non-null-infinitesimal-micro-steps-a-metric-temporal-logic-approach-1206.0911</loc><lastmod>2012-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-null-infinitesimal-micro-steps-a-metric-temporal-logic-approach-1206.0911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-null-infinitesimal-micro-steps-a-metric-temporal-logic-approach-1206.0911"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-verification-for-file-safety-of-multithreaded-programs-1206.1090</loc><lastmod>2012-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-verification-for-file-safety-of-multithreaded-programs-1206.1090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-verification-for-file-safety-of-multithreaded-programs-1206.1090"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-stochastic-branching-processes-1206.1317</loc><lastmod>2012-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-stochastic-branching-processes-1206.1317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-stochastic-branching-processes-1206.1317"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-and-termination-analysis-of-concurrent-quantum-programs-1206.1935</loc><lastmod>2012-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-and-termination-analysis-of-concurrent-quantum-programs-1206.1935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-and-termination-analysis-of-concurrent-quantum-programs-1206.1935"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-two-left-sequential-logics-1206.1936</loc><lastmod>2012-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-two-left-sequential-logics-1206.1936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-two-left-sequential-logics-1206.1936"/></url>
<url><loc>https://scifaro.com/en/abs/programming-in-logic-without-prolog-1206.2037</loc><lastmod>2014-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programming-in-logic-without-prolog-1206.2037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programming-in-logic-without-prolog-1206.2037"/></url>
<url><loc>https://scifaro.com/en/abs/the-glory-of-the-past-and-geometrical-concurrency-1206.3136</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-glory-of-the-past-and-geometrical-concurrency-1206.3136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-glory-of-the-past-and-geometrical-concurrency-1206.3136"/></url>
<url><loc>https://scifaro.com/en/abs/automated-analysis-of-scenario-based-specifications-of-distributed-access-control-policies-with-non-mechanizable-activities-extended-version-1206.3180</loc><lastmod>2012-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-analysis-of-scenario-based-specifications-of-distributed-access-control-policies-with-non-mechanizable-activities-extended-version-1206.3180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-analysis-of-scenario-based-specifications-of-distributed-access-control-policies-with-non-mechanizable-activities-extended-version-1206.3180"/></url>
<url><loc>https://scifaro.com/en/abs/software-model-checking-with-explicit-scheduler-and-symbolic-threads-1206.3182</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-model-checking-with-explicit-scheduler-and-symbolic-threads-1206.3182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-model-checking-with-explicit-scheduler-and-symbolic-threads-1206.3182"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatization-of-quantified-differential-dynamic-logic-for-distributed-hybrid-systems-1206.3357</loc><lastmod>2016-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatization-of-quantified-differential-dynamic-logic-for-distributed-hybrid-systems-1206.3357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatization-of-quantified-differential-dynamic-logic-for-distributed-hybrid-systems-1206.3357"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-finite-domain-constraints-to-sat-with-bee-1206.3883</loc><lastmod>2012-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-finite-domain-constraints-to-sat-with-bee-1206.3883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-finite-domain-constraints-to-sat-with-bee-1206.3883"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-existential-positive-queries-1206.3902</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-existential-positive-queries-1206.3902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-existential-positive-queries-1206.3902"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-craig-interpolation-for-stochastic-boolean-satisfiability-problems-with-applications-to-probabilistic-state-reachability-and-region-stability-1206.4444</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-craig-interpolation-for-stochastic-boolean-satisfiability-problems-with-applications-to-probabilistic-state-reachability-and-region-stability-1206.4444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-craig-interpolation-for-stochastic-boolean-satisfiability-problems-with-applications-to-probabilistic-state-reachability-and-region-stability-1206.4444"/></url>
<url><loc>https://scifaro.com/en/abs/terminating-calculi-for-propositional-dummett-logic-with-subformula-property-1206.4458</loc><lastmod>2012-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terminating-calculi-for-propositional-dummett-logic-with-subformula-property-1206.4458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terminating-calculi-for-propositional-dummett-logic-with-subformula-property-1206.4458"/></url>
<url><loc>https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4547</loc><lastmod>2012-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4547"/></url>
<url><loc>https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4556</loc><lastmod>2012-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initiality-for-typed-syntax-and-semantics-1206.4556"/></url>
<url><loc>https://scifaro.com/en/abs/computational-aspects-of-dependence-logic-1206.4564</loc><lastmod>2012-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-aspects-of-dependence-logic-1206.4564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-aspects-of-dependence-logic-1206.4564"/></url>
<url><loc>https://scifaro.com/en/abs/indexed-realizability-for-bounded-time-programming-with-references-and-type-fixpoints-1206.4833</loc><lastmod>2012-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indexed-realizability-for-bounded-time-programming-with-references-and-type-fixpoints-1206.4833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indexed-realizability-for-bounded-time-programming-with-references-and-type-fixpoints-1206.4833"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-multi-tape-automata-intersection-undecidability-and-approximation-1206.4860</loc><lastmod>2014-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-multi-tape-automata-intersection-undecidability-and-approximation-1206.4860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-multi-tape-automata-intersection-undecidability-and-approximation-1206.4860"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-the-coalgebraic-cover-modality-1206.4935</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-the-coalgebraic-cover-modality-1206.4935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-the-coalgebraic-cover-modality-1206.4935"/></url>
<url><loc>https://scifaro.com/en/abs/obligation-blackwell-games-and-p-automata-1206.5174</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/obligation-blackwell-games-and-p-automata-1206.5174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/obligation-blackwell-games-and-p-automata-1206.5174"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-of-unravelings-for-conditional-term-rewriting-systems-via-ultra-properties-related-to-linearity-1206.5694</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-of-unravelings-for-conditional-term-rewriting-systems-via-ultra-properties-related-to-linearity-1206.5694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-of-unravelings-for-conditional-term-rewriting-systems-via-ultra-properties-related-to-linearity-1206.5694"/></url>
<url><loc>https://scifaro.com/en/abs/pareto-curves-for-probabilistic-model-checking-1206.6295</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pareto-curves-for-probabilistic-model-checking-1206.6295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pareto-curves-for-probabilistic-model-checking-1206.6295"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-approach-to-stratification-in-linear-logic-1206.6504</loc><lastmod>2015-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-approach-to-stratification-in-linear-logic-1206.6504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-approach-to-stratification-in-linear-logic-1206.6504"/></url>
<url><loc>https://scifaro.com/en/abs/computation-environments-2-persistently-evolutionary-semantics-1207.0051</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-environments-2-persistently-evolutionary-semantics-1207.0051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-environments-2-persistently-evolutionary-semantics-1207.0051"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-equivalence-of-specifications-of-infinite-objects-1207.0158</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-equivalence-of-specifications-of-infinite-objects-1207.0158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-equivalence-of-specifications-of-infinite-objects-1207.0158"/></url>
<url><loc>https://scifaro.com/en/abs/local-and-global-moves-on-locally-planar-trivalent-graphs-lambda-calculus-and-lambda-scale-1207.0332</loc><lastmod>2012-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-and-global-moves-on-locally-planar-trivalent-graphs-lambda-calculus-and-lambda-scale-1207.0332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-and-global-moves-on-locally-planar-trivalent-graphs-lambda-calculus-and-lambda-scale-1207.0332"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-synthesis-1207.0554</loc><lastmod>2012-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-synthesis-1207.0554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-synthesis-1207.0554"/></url>
<url><loc>https://scifaro.com/en/abs/parity-and-streett-games-with-costs-1207.0663</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-and-streett-games-with-costs-1207.0663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-and-streett-games-with-costs-1207.0663"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-positional-strategies-for-safety-games-1207.0867</loc><lastmod>2012-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-positional-strategies-for-safety-games-1207.0867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-positional-strategies-for-safety-games-1207.0867"/></url>
<url><loc>https://scifaro.com/en/abs/towards-algorithmic-synthesis-of-synchronization-for-shared-memory-concurrent-programs-1207.0868</loc><lastmod>2012-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-algorithmic-synthesis-of-synchronization-for-shared-memory-concurrent-programs-1207.0868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-algorithmic-synthesis-of-synchronization-for-shared-memory-concurrent-programs-1207.0868"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-progress-of-probabilistic-ltl-model-checking-1207.0870</loc><lastmod>2012-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-progress-of-probabilistic-ltl-model-checking-1207.0870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-progress-of-probabilistic-ltl-model-checking-1207.0870"/></url>
<url><loc>https://scifaro.com/en/abs/weak-markovian-bisimulation-congruences-and-exact-ctmc-level-aggregations-for-concurrent-processes-1207.0874</loc><lastmod>2012-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-markovian-bisimulation-congruences-and-exact-ctmc-level-aggregations-for-concurrent-processes-1207.0874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-markovian-bisimulation-congruences-and-exact-ctmc-level-aggregations-for-concurrent-processes-1207.0874"/></url>
<url><loc>https://scifaro.com/en/abs/extending-clause-learning-sat-solvers-with-complete-parity-reasoning-extended-version-1207.0988</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-clause-learning-sat-solvers-with-complete-parity-reasoning-extended-version-1207.0988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-clause-learning-sat-solvers-with-complete-parity-reasoning-extended-version-1207.0988"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-toggling-branching-recurrence-of-computability-logic-1207.1188</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-toggling-branching-recurrence-of-computability-logic-1207.1188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-toggling-branching-recurrence-of-computability-logic-1207.1188"/></url>
<url><loc>https://scifaro.com/en/abs/adjunctions-for-exceptions-1207.1255</loc><lastmod>2012-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjunctions-for-exceptions-1207.1255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjunctions-for-exceptions-1207.1255"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-redundancy-in-propositional-logic-foundations-and-hitting-sets-duality-1207.1257</loc><lastmod>2012-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-redundancy-in-propositional-logic-foundations-and-hitting-sets-duality-1207.1257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-redundancy-in-propositional-logic-foundations-and-hitting-sets-duality-1207.1257"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-exact-solutions-for-quantitative-model-checking-1207.1264</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-exact-solutions-for-quantitative-model-checking-1207.1264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-exact-solutions-for-quantitative-model-checking-1207.1264"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-robust-systems-with-ratsy-1207.1268</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-robust-systems-with-ratsy-1207.1268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-robust-systems-with-ratsy-1207.1268"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-using-mcmas-1207.1271</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-using-mcmas-1207.1271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-using-mcmas-1207.1271"/></url>
<url><loc>https://scifaro.com/en/abs/uppaal-smc-statistical-model-checking-for-priced-timed-automata-1207.1272</loc><lastmod>2012-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uppaal-smc-statistical-model-checking-for-priced-timed-automata-1207.1272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uppaal-smc-statistical-model-checking-for-priced-timed-automata-1207.1272"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-with-data-centric-business-processes-1207.2461</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-with-data-centric-business-processes-1207.2461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-with-data-centric-business-processes-1207.2461"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-minimization-algorithm-for-partial-bisimulation-1207.2462</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-minimization-algorithm-for-partial-bisimulation-1207.2462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-minimization-algorithm-for-partial-bisimulation-1207.2462"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-on-basic-process-algebra-is-in-2-exptime-an-explicit-proof-1207.2479</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-on-basic-process-algebra-is-in-2-exptime-an-explicit-proof-1207.2479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-on-basic-process-algebra-is-in-2-exptime-an-explicit-proof-1207.2479"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-differential-temporal-dynamic-logic-for-verifying-properties-of-distributed-hybrid-systems-1207.2531</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-differential-temporal-dynamic-logic-for-verifying-properties-of-distributed-hybrid-systems-1207.2531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-differential-temporal-dynamic-logic-for-verifying-properties-of-distributed-hybrid-systems-1207.2531"/></url>
<url><loc>https://scifaro.com/en/abs/lpc-id-a-sequent-calculus-proof-system-for-propositional-logic-extended-with-inductive-definitions-1207.2534</loc><lastmod>2012-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lpc-id-a-sequent-calculus-proof-system-for-propositional-logic-extended-with-inductive-definitions-1207.2534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lpc-id-a-sequent-calculus-proof-system-for-propositional-logic-extended-with-inductive-definitions-1207.2534"/></url>
<url><loc>https://scifaro.com/en/abs/strongly-complete-logics-for-coalgebras-1207.2732</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strongly-complete-logics-for-coalgebras-1207.2732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strongly-complete-logics-for-coalgebras-1207.2732"/></url>
<url><loc>https://scifaro.com/en/abs/a-web-interface-for-matita-1207.2892</loc><lastmod>2012-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-web-interface-for-matita-1207.2892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-web-interface-for-matita-1207.2892"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-monad-transformers-1207.3208</loc><lastmod>2012-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-monad-transformers-1207.3208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-monad-transformers-1207.3208"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-extended-version-1207.3223</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-extended-version-1207.3223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphisms-of-types-in-the-presence-of-higher-order-references-extended-version-1207.3223"/></url>
<url><loc>https://scifaro.com/en/abs/canonized-rewriting-and-ground-ac-completion-modulo-shostak-theories-design-and-implementation-1207.3262</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonized-rewriting-and-ground-ac-completion-modulo-shostak-theories-design-and-implementation-1207.3262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonized-rewriting-and-ground-ac-completion-modulo-shostak-theories-design-and-implementation-1207.3262"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-jedit-a-prover-ide-within-the-pide-framework-1207.3441</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-jedit-a-prover-ide-within-the-pide-framework-1207.3441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-jedit-a-prover-ide-within-the-pide-framework-1207.3441"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-workshop-on-foundations-of-interface-technologies-1207.3485</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-foundations-of-interface-technologies-1207.3485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-foundations-of-interface-technologies-1207.3485"/></url>
<url><loc>https://scifaro.com/en/abs/on-distributability-of-petri-nets-1207.3597</loc><lastmod>2012-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-distributability-of-petri-nets-1207.3597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-distributability-of-petri-nets-1207.3597"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiom-system-for-propositional-interval-temporal-logic-with-infinite-time-1207.3816</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiom-system-for-propositional-interval-temporal-logic-with-infinite-time-1207.3816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiom-system-for-propositional-interval-temporal-logic-with-infinite-time-1207.3816"/></url>
<url><loc>https://scifaro.com/en/abs/a-robust-specification-theory-for-modal-event-clock-automata-1207.4268</loc><lastmod>2012-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-robust-specification-theory-for-modal-event-clock-automata-1207.4268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-robust-specification-theory-for-modal-event-clock-automata-1207.4268"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-for-transition-systems-with-responses-1207.4270</loc><lastmod>2012-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-for-transition-systems-with-responses-1207.4270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-for-transition-systems-with-responses-1207.4270"/></url>
<url><loc>https://scifaro.com/en/abs/sequentializing-parameterized-programs-1207.4271</loc><lastmod>2012-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequentializing-parameterized-programs-1207.4271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequentializing-parameterized-programs-1207.4271"/></url>
<url><loc>https://scifaro.com/en/abs/transfer-function-synthesis-without-quantifier-elimination-1207.4286</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transfer-function-synthesis-without-quantifier-elimination-1207.4286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transfer-function-synthesis-without-quantifier-elimination-1207.4286"/></url>
<url><loc>https://scifaro.com/en/abs/solving-stochastic-b-uchi-games-on-infinite-arenas-with-a-finite-attractor-1207.4577</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-stochastic-b-uchi-games-on-infinite-arenas-with-a-finite-attractor-1207.4577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-stochastic-b-uchi-games-on-infinite-arenas-with-a-finite-attractor-1207.4577"/></url>
<url><loc>https://scifaro.com/en/abs/control-and-synthesis-of-non-interferent-timed-systems-1207.4984</loc><lastmod>2012-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/control-and-synthesis-of-non-interferent-timed-systems-1207.4984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/control-and-synthesis-of-non-interferent-timed-systems-1207.4984"/></url>
<url><loc>https://scifaro.com/en/abs/checking-satisfiability-by-dependency-sequents-1207.5014</loc><lastmod>2012-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-satisfiability-by-dependency-sequents-1207.5014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-satisfiability-by-dependency-sequents-1207.5014"/></url>
<url><loc>https://scifaro.com/en/abs/assume-guarantee-abstraction-refinement-for-probabilistic-systems-1207.5086</loc><lastmod>2012-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assume-guarantee-abstraction-refinement-for-probabilistic-systems-1207.5086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assume-guarantee-abstraction-refinement-for-probabilistic-systems-1207.5086"/></url>
<url><loc>https://scifaro.com/en/abs/learning-probabilistic-systems-from-tree-samples-1207.5091</loc><lastmod>2012-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-probabilistic-systems-from-tree-samples-1207.5091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-probabilistic-systems-from-tree-samples-1207.5091"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-based-least-fixed-point-logic-1207.5384</loc><lastmod>2012-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-based-least-fixed-point-logic-1207.5384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-based-least-fixed-point-logic-1207.5384"/></url>
<url><loc>https://scifaro.com/en/abs/linear-dependent-types-in-a-call-by-value-scenario-long-version-1207.5592</loc><lastmod>2012-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-dependent-types-in-a-call-by-value-scenario-long-version-1207.5592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-dependent-types-in-a-call-by-value-scenario-long-version-1207.5592"/></url>
<url><loc>https://scifaro.com/en/abs/fmltohol-version-1-0-automating-first-order-modal-logics-with-leo-ii-and-friends-1207.6685</loc><lastmod>2012-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fmltohol-version-1-0-automating-first-order-modal-logics-with-leo-ii-and-friends-1207.6685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fmltohol-version-1-0-automating-first-order-modal-logics-with-leo-ii-and-friends-1207.6685"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-preservation-theorem-for-aleph-zero-categorical-quantified-constraint-satisfaction-1207.6696</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-preservation-theorem-for-aleph-zero-categorical-quantified-constraint-satisfaction-1207.6696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-preservation-theorem-for-aleph-zero-categorical-quantified-constraint-satisfaction-1207.6696"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-algebraic-cps-simulations-1207.7146</loc><lastmod>2012-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-algebraic-cps-simulations-1207.7146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-algebraic-cps-simulations-1207.7146"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-and-proof-of-the-extended-church-turing-thesis-extended-abstract-1207.7148</loc><lastmod>2012-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-and-proof-of-the-extended-church-turing-thesis-extended-abstract-1207.7148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-and-proof-of-the-extended-church-turing-thesis-extended-abstract-1207.7148"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-generation-for-learning-based-quantifier-free-loop-invariant-inference-1207.7167</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-generation-for-learning-based-quantifier-free-loop-invariant-inference-1207.7167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-generation-for-learning-based-quantifier-free-loop-invariant-inference-1207.7167"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-quantifier-free-formula-of-positive-semidefinite-cyclic-ternary-quartic-forms-1207.7255</loc><lastmod>2012-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-quantifier-free-formula-of-positive-semidefinite-cyclic-ternary-quartic-forms-1207.7255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-quantifier-free-formula-of-positive-semidefinite-cyclic-ternary-quartic-forms-1207.7255"/></url>
<url><loc>https://scifaro.com/en/abs/software-verification-for-weak-memory-via-program-transformation-1207.7264</loc><lastmod>2012-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-verification-for-weak-memory-via-program-transformation-1207.7264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-verification-for-weak-memory-via-program-transformation-1207.7264"/></url>
<url><loc>https://scifaro.com/en/abs/things-that-can-be-made-into-themselves-1208.0682</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/things-that-can-be-made-into-themselves-1208.0682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/things-that-can-be-made-into-themselves-1208.0682"/></url>
<url><loc>https://scifaro.com/en/abs/on-logical-hierarchies-within-fo-2-definable-languages-1208.0713</loc><lastmod>2018-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-logical-hierarchies-within-fo-2-definable-languages-1208.0713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-logical-hierarchies-within-fo-2-definable-languages-1208.0713"/></url>
<url><loc>https://scifaro.com/en/abs/a-locale-for-minimal-bad-sequences-1208.1366</loc><lastmod>2012-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-locale-for-minimal-bad-sequences-1208.1366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-locale-for-minimal-bad-sequences-1208.1366"/></url>
<url><loc>https://scifaro.com/en/abs/getting-started-with-isabelle-jedit-in-2018-1208.1368</loc><lastmod>2019-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/getting-started-with-isabelle-jedit-in-2018-1208.1368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/getting-started-with-isabelle-jedit-in-2018-1208.1368"/></url>
<url><loc>https://scifaro.com/en/abs/using-tableau-to-decide-description-logics-with-full-role-negation-and-identity-1208.1476</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-tableau-to-decide-description-logics-with-full-role-negation-and-identity-1208.1476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-tableau-to-decide-description-logics-with-full-role-negation-and-identity-1208.1476"/></url>
<url><loc>https://scifaro.com/en/abs/ceta-a-tool-for-certified-termination-analysis-1208.1591</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ceta-a-tool-for-certified-termination-analysis-1208.1591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ceta-a-tool-for-certified-termination-analysis-1208.1591"/></url>
<url><loc>https://scifaro.com/en/abs/certification-extends-termination-techniques-1208.1594</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certification-extends-termination-techniques-1208.1594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certification-extends-termination-techniques-1208.1594"/></url>
<url><loc>https://scifaro.com/en/abs/a-relative-dependency-pair-framework-1208.1595</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-relative-dependency-pair-framework-1208.1595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-relative-dependency-pair-framework-1208.1595"/></url>
<url><loc>https://scifaro.com/en/abs/recording-completion-for-finding-and-certifying-proofs-in-equational-logic-1208.1597</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recording-completion-for-finding-and-certifying-proofs-in-equational-logic-1208.1597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recording-completion-for-finding-and-certifying-proofs-in-equational-logic-1208.1597"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-certification-of-complexity-proofs-1208.1609</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-certification-of-complexity-proofs-1208.1609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-certification-of-complexity-proofs-1208.1609"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamic-phase-selection-strategy-for-satisfiability-solvers-1208.1613</loc><lastmod>2012-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamic-phase-selection-strategy-for-satisfiability-solvers-1208.1613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamic-phase-selection-strategy-for-satisfiability-solvers-1208.1613"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-non-monotonic-interactive-proofs-formal-theory-of-temporary-knowledge-transfer-1208.1842</loc><lastmod>2013-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-non-monotonic-interactive-proofs-formal-theory-of-temporary-knowledge-transfer-1208.1842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-non-monotonic-interactive-proofs-formal-theory-of-temporary-knowledge-transfer-1208.1842"/></url>
<url><loc>https://scifaro.com/en/abs/applying-cegar-to-the-petri-net-state-equation-1208.2159</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-cegar-to-the-petri-net-state-equation-1208.2159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-cegar-to-the-petri-net-state-equation-1208.2159"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-19th-international-workshop-on-expressiveness-in-concurrency-and-9th-workshop-on-structured-operational-semantics-1208.2440</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-19th-international-workshop-on-expressiveness-in-concurrency-and-9th-workshop-on-structured-operational-semantics-1208.2440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-19th-international-workshop-on-expressiveness-in-concurrency-and-9th-workshop-on-structured-operational-semantics-1208.2440"/></url>
<url><loc>https://scifaro.com/en/abs/on-generalized-fuzzy-multisets-and-their-use-in-computation-1208.2457</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-generalized-fuzzy-multisets-and-their-use-in-computation-1208.2457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-generalized-fuzzy-multisets-and-their-use-in-computation-1208.2457"/></url>
<url><loc>https://scifaro.com/en/abs/improved-separations-of-regular-resolution-from-clause-learning-proof-systems-1208.2469</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-separations-of-regular-resolution-from-clause-learning-proof-systems-1208.2469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-separations-of-regular-resolution-from-clause-learning-proof-systems-1208.2469"/></url>
<url><loc>https://scifaro.com/en/abs/the-generic-model-of-computation-1208.2585</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-generic-model-of-computation-1208.2585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-generic-model-of-computation-1208.2585"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-formulas-over-intermediate-logics-1208.2631</loc><lastmod>2012-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-formulas-over-intermediate-logics-1208.2631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-formulas-over-intermediate-logics-1208.2631"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-specification-of-operations-on-the-rational-behaviour-of-systems-1208.2746</loc><lastmod>2012-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-specification-of-operations-on-the-rational-behaviour-of-systems-1208.2746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-specification-of-operations-on-the-rational-behaviour-of-systems-1208.2746"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-and-completeness-in-abstraction-1208.2748</loc><lastmod>2012-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-and-completeness-in-abstraction-1208.2748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-and-completeness-in-abstraction-1208.2748"/></url>
<url><loc>https://scifaro.com/en/abs/musings-on-encodings-and-expressiveness-1208.2750</loc><lastmod>2012-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/musings-on-encodings-and-expressiveness-1208.2750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/musings-on-encodings-and-expressiveness-1208.2750"/></url>
<url><loc>https://scifaro.com/en/abs/an-operational-petri-net-semantics-for-the-join-calculus-1208.2753</loc><lastmod>2012-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-operational-petri-net-semantics-for-the-join-calculus-1208.2753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-operational-petri-net-semantics-for-the-join-calculus-1208.2753"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-preference-logic-1208.2921</loc><lastmod>2012-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-preference-logic-1208.2921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-preference-logic-1208.2921"/></url>
<url><loc>https://scifaro.com/en/abs/first-steps-in-synthetic-guarded-domain-theory-step-indexing-in-the-topos-of-trees-1208.3596</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-steps-in-synthetic-guarded-domain-theory-step-indexing-in-the-topos-of-trees-1208.3596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-steps-in-synthetic-guarded-domain-theory-step-indexing-in-the-topos-of-trees-1208.3596"/></url>
<url><loc>https://scifaro.com/en/abs/disease-processes-as-hybrid-dynamical-systems-1208.3858</loc><lastmod>2012-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disease-processes-as-hybrid-dynamical-systems-1208.3858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disease-processes-as-hybrid-dynamical-systems-1208.3858"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-accat-workshop-on-applied-and-computational-category-theory-1208.4301</loc><lastmod>2012-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-accat-workshop-on-applied-and-computational-category-theory-1208.4301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-accat-workshop-on-applied-and-computational-category-theory-1208.4301"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-safety-properties-for-ownership-authentication-transfer-protocol-1208.4321</loc><lastmod>2012-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-safety-properties-for-ownership-authentication-transfer-protocol-1208.4321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-safety-properties-for-ownership-authentication-transfer-protocol-1208.4321"/></url>
<url><loc>https://scifaro.com/en/abs/forward-analysis-for-wsts-part-ii-complete-wsts-1208.4549</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-ii-complete-wsts-1208.4549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-ii-complete-wsts-1208.4549"/></url>
<url><loc>https://scifaro.com/en/abs/expressive-completeness-of-metric-temporal-logic-1208.4993</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressive-completeness-of-metric-temporal-logic-1208.4993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressive-completeness-of-metric-temporal-logic-1208.4993"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-computer-i-basic-computability-by-string-diagrams-1208.5205</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-computer-i-basic-computability-by-string-diagrams-1208.5205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-computer-i-basic-computability-by-string-diagrams-1208.5205"/></url>
<url><loc>https://scifaro.com/en/abs/dependence-and-independence-1208.5268</loc><lastmod>2012-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependence-and-independence-1208.5268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependence-and-independence-1208.5268"/></url>
<url><loc>https://scifaro.com/en/abs/weak-alternating-timed-automata-1208.5909</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-alternating-timed-automata-1208.5909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-alternating-timed-automata-1208.5909"/></url>
<url><loc>https://scifaro.com/en/abs/wreath-products-of-forest-algebras-with-applications-to-tree-logics-1208.6172</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wreath-products-of-forest-algebras-with-applications-to-tree-logics-1208.6172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wreath-products-of-forest-algebras-with-applications-to-tree-logics-1208.6172"/></url>
<url><loc>https://scifaro.com/en/abs/relational-databases-and-bell-s-theorem-1208.6416</loc><lastmod>2014-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-databases-and-bell-s-theorem-1208.6416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-databases-and-bell-s-theorem-1208.6416"/></url>
<url><loc>https://scifaro.com/en/abs/parameterised-multiparty-session-types-1208.6483</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterised-multiparty-session-types-1208.6483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterised-multiparty-session-types-1208.6483"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-analysis-of-communicating-pushdown-systems-1209.0359</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-analysis-of-communicating-pushdown-systems-1209.0359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-analysis-of-communicating-pushdown-systems-1209.0359"/></url>
<url><loc>https://scifaro.com/en/abs/when-is-metric-temporal-logic-expressively-complete-1209.0516</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-is-metric-temporal-logic-expressively-complete-1209.0516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-is-metric-temporal-logic-expressively-complete-1209.0516"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressiveness-of-mtl-with-counting-1209.0518</loc><lastmod>2012-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressiveness-of-mtl-with-counting-1209.0518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressiveness-of-mtl-with-counting-1209.0518"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-of-communicating-timed-processes-1209.0571</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-of-communicating-timed-processes-1209.0571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-of-communicating-timed-processes-1209.0571"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-category-of-polynomial-diagrams-1209.0940</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-category-of-polynomial-diagrams-1209.0940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-category-of-polynomial-diagrams-1209.0940"/></url>
<url><loc>https://scifaro.com/en/abs/finite-memory-strategy-synthesis-for-robust-multidimensional-mean-payoff-objectives-1209.1007</loc><lastmod>2014-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-memory-strategy-synthesis-for-robust-multidimensional-mean-payoff-objectives-1209.1007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-memory-strategy-synthesis-for-robust-multidimensional-mean-payoff-objectives-1209.1007"/></url>
<url><loc>https://scifaro.com/en/abs/correctness-of-an-incremental-and-worst-case-optimal-decision-procedure-for-modal-logic-with-eventualities-1209.1248</loc><lastmod>2012-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctness-of-an-incremental-and-worst-case-optimal-decision-procedure-for-modal-logic-with-eventualities-1209.1248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctness-of-an-incremental-and-worst-case-optimal-decision-procedure-for-modal-logic-with-eventualities-1209.1248"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-of-labeled-state-to-function-transition-systems-of-stochastic-process-languages-1209.1432</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-of-labeled-state-to-function-transition-systems-of-stochastic-process-languages-1209.1432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-of-labeled-state-to-function-transition-systems-of-stochastic-process-languages-1209.1432"/></url>
<url><loc>https://scifaro.com/en/abs/satisfaction-restriction-and-amalgamation-of-constraints-in-the-framework-of-m-adhesive-categories-1209.1436</loc><lastmod>2012-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfaction-restriction-and-amalgamation-of-constraints-in-the-framework-of-m-adhesive-categories-1209.1436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfaction-restriction-and-amalgamation-of-constraints-in-the-framework-of-m-adhesive-categories-1209.1436"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-level-model-for-self-adaptive-systems-1209.1628</loc><lastmod>2013-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-level-model-for-self-adaptive-systems-1209.1628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-level-model-for-self-adaptive-systems-1209.1628"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-the-quantitative-mu-calculus-on-linear-hybrid-systems-1209.1738</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-the-quantitative-mu-calculus-on-linear-hybrid-systems-1209.1738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-the-quantitative-mu-calculus-on-linear-hybrid-systems-1209.1738"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-constructive-kripke-semantics-for-standard-multi-agent-belief-and-knowledge-knowledge-as-unbiased-belief-1209.1885</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-constructive-kripke-semantics-for-standard-multi-agent-belief-and-knowledge-knowledge-as-unbiased-belief-1209.1885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-constructive-kripke-semantics-for-standard-multi-agent-belief-and-knowledge-knowledge-as-unbiased-belief-1209.1885"/></url>
<url><loc>https://scifaro.com/en/abs/computing-persistent-homology-within-coq-ssreflect-1209.1905</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-persistent-homology-within-coq-ssreflect-1209.1905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-persistent-homology-within-coq-ssreflect-1209.1905"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-of-ordered-multi-pushdown-automata-1209.1916</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-of-ordered-multi-pushdown-automata-1209.1916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-of-ordered-multi-pushdown-automata-1209.1916"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-4-level-quantified-syllogistic-and-some-applications-to-modal-logic-extended-version-1209.1943</loc><lastmod>2012-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-4-level-quantified-syllogistic-and-some-applications-to-modal-logic-extended-version-1209.1943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-4-level-quantified-syllogistic-and-some-applications-to-modal-logic-extended-version-1209.1943"/></url>
<url><loc>https://scifaro.com/en/abs/contracts-for-interacting-two-party-systems-1209.2238</loc><lastmod>2012-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contracts-for-interacting-two-party-systems-1209.2238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contracts-for-interacting-two-party-systems-1209.2238"/></url>
<url><loc>https://scifaro.com/en/abs/a-history-of-blockingqueues-1209.2239</loc><lastmod>2012-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-history-of-blockingqueues-1209.2239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-history-of-blockingqueues-1209.2239"/></url>
<url><loc>https://scifaro.com/en/abs/probabilities-on-sentences-in-an-expressive-logic-1209.2620</loc><lastmod>2012-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilities-on-sentences-in-an-expressive-logic-1209.2620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilities-on-sentences-in-an-expressive-logic-1209.2620"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-the-resource-lambda-calculus-with-tests-through-taylor-expansion-1209.2890</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-the-resource-lambda-calculus-with-tests-through-taylor-expansion-1209.2890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-the-resource-lambda-calculus-with-tests-through-taylor-expansion-1209.2890"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-co-nl-by-a-group-action-1209.3422</loc><lastmod>2015-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-co-nl-by-a-group-action-1209.3422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-co-nl-by-a-group-action-1209.3422"/></url>
<url><loc>https://scifaro.com/en/abs/linear-use-cps-translations-in-the-enriched-effect-calculus-1209.4268</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-use-cps-translations-in-the-enriched-effect-calculus-1209.4268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-use-cps-translations-in-the-enriched-effect-calculus-1209.4268"/></url>
<url><loc>https://scifaro.com/en/abs/controllable-choice-message-sequence-graphs-1209.4499</loc><lastmod>2012-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controllable-choice-message-sequence-graphs-1209.4499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controllable-choice-message-sequence-graphs-1209.4499"/></url>
<url><loc>https://scifaro.com/en/abs/history-preserving-bisimilarity-for-higher-dimensional-automata-via-open-maps-1209.4927</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/history-preserving-bisimilarity-for-higher-dimensional-automata-via-open-maps-1209.4927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/history-preserving-bisimilarity-for-higher-dimensional-automata-via-open-maps-1209.4927"/></url>
<url><loc>https://scifaro.com/en/abs/proof-of-church-s-thesis-1209.5036</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-of-church-s-thesis-1209.5036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-of-church-s-thesis-1209.5036"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-correlating-temporal-properties-across-program-transformations-1209.5152</loc><lastmod>2012-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-correlating-temporal-properties-across-program-transformations-1209.5152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-correlating-temporal-properties-across-program-transformations-1209.5152"/></url>
<url><loc>https://scifaro.com/en/abs/on-some-many-valued-abstract-logics-and-their-epsilon-t-style-extensions-1209.5364</loc><lastmod>2012-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-some-many-valued-abstract-logics-and-their-epsilon-t-style-extensions-1209.5364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-some-many-valued-abstract-logics-and-their-epsilon-t-style-extensions-1209.5364"/></url>
<url><loc>https://scifaro.com/en/abs/a-cookbook-for-temporal-conceptual-data-modelling-with-description-logics-1209.5571</loc><lastmod>2014-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cookbook-for-temporal-conceptual-data-modelling-with-description-logics-1209.5571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cookbook-for-temporal-conceptual-data-modelling-with-description-logics-1209.5571"/></url>
<url><loc>https://scifaro.com/en/abs/ambiguity-of-omega-languages-of-turing-machines-1209.5669</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ambiguity-of-omega-languages-of-turing-machines-1209.5669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ambiguity-of-omega-languages-of-turing-machines-1209.5669"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-and-observation-categorical-semantics-of-reactive-systems-trough-dialgebras-1209.5903</loc><lastmod>2013-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-and-observation-categorical-semantics-of-reactive-systems-trough-dialgebras-1209.5903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-and-observation-categorical-semantics-of-reactive-systems-trough-dialgebras-1209.5903"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-correctness-of-a-branch-displacement-algorithm-1209.5920</loc><lastmod>2012-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-correctness-of-a-branch-displacement-algorithm-1209.5920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-correctness-of-a-branch-displacement-algorithm-1209.5920"/></url>
<url><loc>https://scifaro.com/en/abs/parametricity-in-an-impredicative-sort-1209.6336</loc><lastmod>2012-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametricity-in-an-impredicative-sort-1209.6336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametricity-in-an-impredicative-sort-1209.6336"/></url>
<url><loc>https://scifaro.com/en/abs/roadmap-document-on-stochastic-analysis-1209.6578</loc><lastmod>2012-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/roadmap-document-on-stochastic-analysis-1209.6578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/roadmap-document-on-stochastic-analysis-1209.6578"/></url>
<url><loc>https://scifaro.com/en/abs/gem-a-distributed-goal-evaluation-algorithm-for-trust-management-1210.0368</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gem-a-distributed-goal-evaluation-algorithm-for-trust-management-1210.0368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gem-a-distributed-goal-evaluation-algorithm-for-trust-management-1210.0368"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-parallel-path-checking-for-linear-time-temporal-logic-with-past-and-bounds-1210.0574</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-parallel-path-checking-for-linear-time-temporal-logic-with-past-and-bounds-1210.0574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-parallel-path-checking-for-linear-time-temporal-logic-with-past-and-bounds-1210.0574"/></url>
<url><loc>https://scifaro.com/en/abs/on-multiplicative-linear-logic-modality-and-quantum-circuits-1210.0613</loc><lastmod>2012-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-multiplicative-linear-logic-modality-and-quantum-circuits-1210.0613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-multiplicative-linear-logic-modality-and-quantum-circuits-1210.0613"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-a-quantum-error-correcting-code-using-quantum-process-calculus-1210.0614</loc><lastmod>2012-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-a-quantum-error-correcting-code-using-quantum-process-calculus-1210.0614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-a-quantum-error-correcting-code-using-quantum-process-calculus-1210.0614"/></url>
<url><loc>https://scifaro.com/en/abs/data-types-with-symmetries-and-polynomial-functors-over-groupoids-1210.0828</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-types-with-symmetries-and-polynomial-functors-over-groupoids-1210.0828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-types-with-symmetries-and-polynomial-functors-over-groupoids-1210.0828"/></url>
<url><loc>https://scifaro.com/en/abs/turing-machines-based-on-unsharp-quantum-logic-1210.1097</loc><lastmod>2012-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turing-machines-based-on-unsharp-quantum-logic-1210.1097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turing-machines-based-on-unsharp-quantum-logic-1210.1097"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-by-decreasing-diagrams-formalized-1210.1100</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-by-decreasing-diagrams-formalized-1210.1100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-by-decreasing-diagrams-formalized-1210.1100"/></url>
<url><loc>https://scifaro.com/en/abs/on-streams-that-are-finitely-red-1210.1200</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-streams-that-are-finitely-red-1210.1200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-streams-that-are-finitely-red-1210.1200"/></url>
<url><loc>https://scifaro.com/en/abs/relation-liftings-on-preorders-and-posets-1210.1433</loc><lastmod>2012-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-liftings-on-preorders-and-posets-1210.1433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-liftings-on-preorders-and-posets-1210.1433"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-proof-theoretic-compilation-of-logic-programs-1210.1653</loc><lastmod>2012-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-proof-theoretic-compilation-of-logic-programs-1210.1653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-proof-theoretic-compilation-of-logic-programs-1210.1653"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-international-symposium-on-games-automata-logics-and-formal-verification-1210.2028</loc><lastmod>2012-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-international-symposium-on-games-automata-logics-and-formal-verification-1210.2028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-international-symposium-on-games-automata-logics-and-formal-verification-1210.2028"/></url>
<url><loc>https://scifaro.com/en/abs/partiality-and-recursion-in-higher-order-logic-1210.2039</loc><lastmod>2013-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partiality-and-recursion-in-higher-order-logic-1210.2039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partiality-and-recursion-in-higher-order-logic-1210.2039"/></url>
<url><loc>https://scifaro.com/en/abs/asp-modulo-csp-the-clingcon-system-1210.2287</loc><lastmod>2012-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asp-modulo-csp-the-clingcon-system-1210.2287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asp-modulo-csp-the-clingcon-system-1210.2287"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-process-equivalences-1210.2451</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-process-equivalences-1210.2451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-process-equivalences-1210.2451"/></url>
<url><loc>https://scifaro.com/en/abs/the-mu-calculus-alternation-hierarchy-collapses-over-structures-with-restricted-connectivity-1210.2455</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mu-calculus-alternation-hierarchy-collapses-over-structures-with-restricted-connectivity-1210.2455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mu-calculus-alternation-hierarchy-collapses-over-structures-with-restricted-connectivity-1210.2455"/></url>
<url><loc>https://scifaro.com/en/abs/down-the-borel-hierarchy-solving-muller-games-via-safety-games-1210.2457</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/down-the-borel-hierarchy-solving-muller-games-via-safety-games-1210.2457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/down-the-borel-hierarchy-solving-muller-games-via-safety-games-1210.2457"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-quantified-fragment-of-set-theory-with-ordered-pairs-and-some-undecidable-extensions-1210.2461</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-quantified-fragment-of-set-theory-with-ordered-pairs-and-some-undecidable-extensions-1210.2461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-quantified-fragment-of-set-theory-with-ordered-pairs-and-some-undecidable-extensions-1210.2461"/></url>
<url><loc>https://scifaro.com/en/abs/interval-temporal-logics-over-strongly-discrete-linear-orders-the-complete-picture-1210.2479</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-temporal-logics-over-strongly-discrete-linear-orders-the-complete-picture-1210.2479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-temporal-logics-over-strongly-discrete-linear-orders-the-complete-picture-1210.2479"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-vs-finite-satisfiability-in-elementary-modal-logics-1210.2481</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-vs-finite-satisfiability-in-elementary-modal-logics-1210.2481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-vs-finite-satisfiability-in-elementary-modal-logics-1210.2481"/></url>
<url><loc>https://scifaro.com/en/abs/concrete-semantics-of-programs-with-non-deterministic-and-random-inputs-1210.2605</loc><lastmod>2012-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concrete-semantics-of-programs-with-non-deterministic-and-random-inputs-1210.2605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concrete-semantics-of-programs-with-non-deterministic-and-random-inputs-1210.2605"/></url>
<url><loc>https://scifaro.com/en/abs/counting-and-generating-lambda-terms-1210.2610</loc><lastmod>2013-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-and-generating-lambda-terms-1210.2610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-and-generating-lambda-terms-1210.2610"/></url>
<url><loc>https://scifaro.com/en/abs/complete-axiomatizations-of-fragments-of-monadic-second-order-logic-on-finite-trees-1210.2620</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-axiomatizations-of-fragments-of-monadic-second-order-logic-on-finite-trees-1210.2620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-axiomatizations-of-fragments-of-monadic-second-order-logic-on-finite-trees-1210.2620"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-and-bisimilarity-notions-appropriate-for-characterizing-indistinguishability-in-fragments-of-the-calculus-of-relations-1210.2688</loc><lastmod>2014-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-and-bisimilarity-notions-appropriate-for-characterizing-indistinguishability-in-fragments-of-the-calculus-of-relations-1210.2688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-and-bisimilarity-notions-appropriate-for-characterizing-indistinguishability-in-fragments-of-the-calculus-of-relations-1210.2688"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-workshop-on-classical-logic-and-computation-1210.2890</loc><lastmod>2012-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-classical-logic-and-computation-1210.2890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-classical-logic-and-computation-1210.2890"/></url>
<url><loc>https://scifaro.com/en/abs/petri-net-reachability-graphs-decidability-status-of-first-order-properties-1210.2972</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-net-reachability-graphs-decidability-status-of-first-order-properties-1210.2972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-net-reachability-graphs-decidability-status-of-first-order-properties-1210.2972"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-realizability-and-the-elimination-of-skolem-functions-in-peano-arithmetic-1210.3114</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-realizability-and-the-elimination-of-skolem-functions-in-peano-arithmetic-1210.3114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-realizability-and-the-elimination-of-skolem-functions-in-peano-arithmetic-1210.3114"/></url>
<url><loc>https://scifaro.com/en/abs/a-call-by-value-lambda-calculus-with-lists-and-control-1210.3115</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-call-by-value-lambda-calculus-with-lists-and-control-1210.3115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-call-by-value-lambda-calculus-with-lists-and-control-1210.3115"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-models-of-untyped-lambda-mu-calculus-1210.3116</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-models-of-untyped-lambda-mu-calculus-1210.3116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-models-of-untyped-lambda-mu-calculus-1210.3116"/></url>
<url><loc>https://scifaro.com/en/abs/applying-g-odel-s-dialectica-interpretation-to-obtain-a-constructive-proof-of-higman-s-lemma-1210.3117</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-g-odel-s-dialectica-interpretation-to-obtain-a-constructive-proof-of-higman-s-lemma-1210.3117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-g-odel-s-dialectica-interpretation-to-obtain-a-constructive-proof-of-higman-s-lemma-1210.3117"/></url>
<url><loc>https://scifaro.com/en/abs/multi-threaded-asp-solving-with-clasp-1210.3265</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-threaded-asp-solving-with-clasp-1210.3265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-threaded-asp-solving-with-clasp-1210.3265"/></url>
<url><loc>https://scifaro.com/en/abs/a-fragment-of-dependence-logic-capturing-polynomial-time-1210.3321</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fragment-of-dependence-logic-capturing-polynomial-time-1210.3321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fragment-of-dependence-logic-capturing-polynomial-time-1210.3321"/></url>
<url><loc>https://scifaro.com/en/abs/galois-correspondence-for-counting-quantifiers-1210.3344</loc><lastmod>2012-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/galois-correspondence-for-counting-quantifiers-1210.3344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/galois-correspondence-for-counting-quantifiers-1210.3344"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-from-ltl-specifications-with-mean-payoff-objectives-1210.3539</loc><lastmod>2013-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-from-ltl-specifications-with-mean-payoff-objectives-1210.3539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-from-ltl-specifications-with-mean-payoff-objectives-1210.3539"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-all-minimal-models-revised-version-2012-1210.3599</loc><lastmod>2012-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-all-minimal-models-revised-version-2012-1210.3599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-all-minimal-models-revised-version-2012-1210.3599"/></url>
<url><loc>https://scifaro.com/en/abs/ilp-modulo-theories-1210.3761</loc><lastmod>2013-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ilp-modulo-theories-1210.3761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ilp-modulo-theories-1210.3761"/></url>
<url><loc>https://scifaro.com/en/abs/counter-attack-on-byzantine-generals-parameterized-model-checking-of-fault-tolerant-distributed-algorithms-1210.3846</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counter-attack-on-byzantine-generals-parameterized-model-checking-of-fault-tolerant-distributed-algorithms-1210.3846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counter-attack-on-byzantine-generals-parameterized-model-checking-of-fault-tolerant-distributed-algorithms-1210.3846"/></url>
<url><loc>https://scifaro.com/en/abs/relational-theories-with-null-values-and-non-herbrand-stable-models-1210.4130</loc><lastmod>2012-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-theories-with-null-values-and-non-herbrand-stable-models-1210.4130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-theories-with-null-values-and-non-herbrand-stable-models-1210.4130"/></url>
<url><loc>https://scifaro.com/en/abs/functions-as-types-or-the-hoare-logic-of-functional-dependencies-1210.4661</loc><lastmod>2012-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functions-as-types-or-the-hoare-logic-of-functional-dependencies-1210.4661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functions-as-types-or-the-hoare-logic-of-functional-dependencies-1210.4661"/></url>
<url><loc>https://scifaro.com/en/abs/minimization-of-semilinear-automata-1210.4980</loc><lastmod>2012-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimization-of-semilinear-automata-1210.4980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimization-of-semilinear-automata-1210.4980"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-algebras-iii-some-examples-1210.5065</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-algebras-iii-some-examples-1210.5065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-algebras-iii-some-examples-1210.5065"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-modal-transition-systems-1210.5659</loc><lastmod>2012-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-modal-transition-systems-1210.5659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-modal-transition-systems-1210.5659"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-multi-modal-hybrid-logic-with-binders-transitive-relations-and-relation-hierarchies-1210.5734</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-multi-modal-hybrid-logic-with-binders-transitive-relations-and-relation-hierarchies-1210.5734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-multi-modal-hybrid-logic-with-binders-transitive-relations-and-relation-hierarchies-1210.5734"/></url>
<url><loc>https://scifaro.com/en/abs/bipolar-proof-nets-for-mall-1210.5946</loc><lastmod>2012-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bipolar-proof-nets-for-mall-1210.5946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bipolar-proof-nets-for-mall-1210.5946"/></url>
<url><loc>https://scifaro.com/en/abs/an-mml-based-tool-for-evaluating-the-complexity-of-stochastic-logic-theories-1210.5974</loc><lastmod>2013-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-mml-based-tool-for-evaluating-the-complexity-of-stochastic-logic-theories-1210.5974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-mml-based-tool-for-evaluating-the-complexity-of-stochastic-logic-theories-1210.5974"/></url>
<url><loc>https://scifaro.com/en/abs/model-validation-in-ontology-based-transformations-1210.6111</loc><lastmod>2012-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-validation-in-ontology-based-transformations-1210.6111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-validation-in-ontology-based-transformations-1210.6111"/></url>
<url><loc>https://scifaro.com/en/abs/adaptable-processes-1210.6379</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptable-processes-1210.6379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptable-processes-1210.6379"/></url>
<url><loc>https://scifaro.com/en/abs/graph-subsumption-in-abstract-state-space-exploration-1210.6413</loc><lastmod>2012-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-subsumption-in-abstract-state-space-exploration-1210.6413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-subsumption-in-abstract-state-space-exploration-1210.6413"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-instantiation-of-parameterised-boolean-equation-systems-to-parity-games-1210.6414</loc><lastmod>2012-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-instantiation-of-parameterised-boolean-equation-systems-to-parity-games-1210.6414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-instantiation-of-parameterised-boolean-equation-systems-to-parity-games-1210.6414"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-types-long-version-1210.6857</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-types-long-version-1210.6857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-types-long-version-1210.6857"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-model-checking-problem-1210.6893</loc><lastmod>2012-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-model-checking-problem-1210.6893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-model-checking-problem-1210.6893"/></url>
<url><loc>https://scifaro.com/en/abs/the-logical-content-of-triangular-bases-of-fuzzy-sets-in-l-ukasiewicz-infinite-valued-logic-1210.8302</loc><lastmod>2013-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logical-content-of-triangular-bases-of-fuzzy-sets-in-l-ukasiewicz-infinite-valued-logic-1210.8302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logical-content-of-triangular-bases-of-fuzzy-sets-in-l-ukasiewicz-infinite-valued-logic-1210.8302"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-proof-theory-of-classical-s4-1211.0242</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-proof-theory-of-classical-s4-1211.0242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-proof-theory-of-classical-s4-1211.0242"/></url>
<url><loc>https://scifaro.com/en/abs/time-bounded-reachability-for-hybrid-automata-complexity-and-fixpoints-1211.1276</loc><lastmod>2012-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-bounded-reachability-for-hybrid-automata-complexity-and-fixpoints-1211.1276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-bounded-reachability-for-hybrid-automata-complexity-and-fixpoints-1211.1276"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-modal-mu-calculus-with-independent-product-1211.1511</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-modal-mu-calculus-with-independent-product-1211.1511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-modal-mu-calculus-with-independent-product-1211.1511"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-necessity-of-complexity-1211.1878</loc><lastmod>2012-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-necessity-of-complexity-1211.1878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-necessity-of-complexity-1211.1878"/></url>
<url><loc>https://scifaro.com/en/abs/a-strongly-grounded-stable-model-semantics-for-full-propositional-language-1211.2986</loc><lastmod>2012-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strongly-grounded-stable-model-semantics-for-full-propositional-language-1211.2986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strongly-grounded-stable-model-semantics-for-full-propositional-language-1211.2986"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-linearity-1211.3480</loc><lastmod>2012-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-linearity-1211.3480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-linearity-1211.3480"/></url>
<url><loc>https://scifaro.com/en/abs/lending-petri-nets-and-contracts-1211.3624</loc><lastmod>2020-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lending-petri-nets-and-contracts-1211.3624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lending-petri-nets-and-contracts-1211.3624"/></url>
<url><loc>https://scifaro.com/en/abs/membrane-systems-and-petri-net-synthesis-1211.4090</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/membrane-systems-and-petri-net-synthesis-1211.4090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/membrane-systems-and-petri-net-synthesis-1211.4090"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-calculus-for-spatially-explicit-ecological-models-1211.4091</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-calculus-for-spatially-explicit-ecological-models-1211.4091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-calculus-for-spatially-explicit-ecological-models-1211.4091"/></url>
<url><loc>https://scifaro.com/en/abs/towards-modular-verification-of-pathways-fairness-and-assumptions-1211.4093</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-modular-verification-of-pathways-fairness-and-assumptions-1211.4093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-modular-verification-of-pathways-fairness-and-assumptions-1211.4093"/></url>
<url><loc>https://scifaro.com/en/abs/rna-interference-and-register-machines-extended-abstract-1211.4095</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rna-interference-and-register-machines-extended-abstract-1211.4095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rna-interference-and-register-machines-extended-abstract-1211.4095"/></url>
<url><loc>https://scifaro.com/en/abs/standardization-in-resource-lambda-calculus-1211.4097</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/standardization-in-resource-lambda-calculus-1211.4097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/standardization-in-resource-lambda-calculus-1211.4097"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-port-graph-rewriting-1211.4098</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-port-graph-rewriting-1211.4098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-port-graph-rewriting-1211.4098"/></url>
<url><loc>https://scifaro.com/en/abs/linearly-refined-session-types-1211.4099</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearly-refined-session-types-1211.4099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearly-refined-session-types-1211.4099"/></url>
<url><loc>https://scifaro.com/en/abs/relating-reasoning-methodologies-in-linear-logic-and-process-algebra-1211.4100</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-reasoning-methodologies-in-linear-logic-and-process-algebra-1211.4100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-reasoning-methodologies-in-linear-logic-and-process-algebra-1211.4100"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-interaction-nets-calculus-by-generic-rules-1211.4102</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-interaction-nets-calculus-by-generic-rules-1211.4102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-interaction-nets-calculus-by-generic-rules-1211.4102"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-model-counting-1211.4475</loc><lastmod>2012-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-model-counting-1211.4475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-model-counting-1211.4475"/></url>
<url><loc>https://scifaro.com/en/abs/counting-ctl-1211.4651</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-ctl-1211.4651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-ctl-1211.4651"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-bioscape-a-stochastic-and-parallel-language-for-mobile-and-spatial-interactions-1211.4779</loc><lastmod>2012-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-bioscape-a-stochastic-and-parallel-language-for-mobile-and-spatial-interactions-1211.4779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-bioscape-a-stochastic-and-parallel-language-for-mobile-and-spatial-interactions-1211.4779"/></url>
<url><loc>https://scifaro.com/en/abs/mutually-exclusive-rules-in-logicweb-1211.4935</loc><lastmod>2012-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutually-exclusive-rules-in-logicweb-1211.4935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutually-exclusive-rules-in-logicweb-1211.4935"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-markovian-logics-axiomatization-and-quantified-metatheory-1211.5190</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-markovian-logics-axiomatization-and-quantified-metatheory-1211.5190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-markovian-logics-axiomatization-and-quantified-metatheory-1211.5190"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-parse-trees-1211.5256</loc><lastmod>2013-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-parse-trees-1211.5256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-parse-trees-1211.5256"/></url>
<url><loc>https://scifaro.com/en/abs/the-parametric-ordinal-recursive-complexity-of-post-embedding-problems-1211.5259</loc><lastmod>2013-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parametric-ordinal-recursive-complexity-of-post-embedding-problems-1211.5259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parametric-ordinal-recursive-complexity-of-post-embedding-problems-1211.5259"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-nature-like-computation-a-behavioural-approach-and-a-notion-of-programmability-1211.5322</loc><lastmod>2012-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-nature-like-computation-a-behavioural-approach-and-a-notion-of-programmability-1211.5322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-nature-like-computation-a-behavioural-approach-and-a-notion-of-programmability-1211.5322"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-model-of-a-virtual-filesystem-switch-1211.6187</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-model-of-a-virtual-filesystem-switch-1211.6187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-model-of-a-virtual-filesystem-switch-1211.6187"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-function-annotations-for-hoare-logic-1211.6188</loc><lastmod>2024-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-function-annotations-for-hoare-logic-1211.6188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-function-annotations-for-hoare-logic-1211.6188"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-use-of-underspecified-data-type-semantics-for-type-safety-in-low-level-code-1211.6190</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-use-of-underspecified-data-type-semantics-for-type-safety-in-low-level-code-1211.6190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-use-of-underspecified-data-type-semantics-for-type-safety-in-low-level-code-1211.6190"/></url>
<url><loc>https://scifaro.com/en/abs/a-forward-reachability-algorithm-for-bounded-timed-arc-petri-nets-1211.6194</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-forward-reachability-algorithm-for-bounded-timed-arc-petri-nets-1211.6194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-forward-reachability-algorithm-for-bounded-timed-arc-petri-nets-1211.6194"/></url>
<url><loc>https://scifaro.com/en/abs/chiefly-symmetric-results-on-the-scalability-of-probabilistic-model-checking-for-operating-system-code-1211.6196</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chiefly-symmetric-results-on-the-scalability-of-probabilistic-model-checking-for-operating-system-code-1211.6196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chiefly-symmetric-results-on-the-scalability-of-probabilistic-model-checking-for-operating-system-code-1211.6196"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-probabilistic-correctness-in-isabelle-with-pgcl-1211.6197</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-probabilistic-correctness-in-isabelle-with-pgcl-1211.6197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-probabilistic-correctness-in-isabelle-with-pgcl-1211.6197"/></url>
<url><loc>https://scifaro.com/en/abs/the-refined-calculus-of-inductive-construction-parametricity-and-abstraction-1211.6341</loc><lastmod>2012-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-refined-calculus-of-inductive-construction-parametricity-and-abstraction-1211.6341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-refined-calculus-of-inductive-construction-parametricity-and-abstraction-1211.6341"/></url>
<url><loc>https://scifaro.com/en/abs/using-isabelle-to-verify-special-relativity-with-application-to-hypercomputation-theory-1211.6468</loc><lastmod>2018-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-isabelle-to-verify-special-relativity-with-application-to-hypercomputation-theory-1211.6468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-isabelle-to-verify-special-relativity-with-application-to-hypercomputation-theory-1211.6468"/></url>
<url><loc>https://scifaro.com/en/abs/towards-interactive-logic-programming-1211.6535</loc><lastmod>2015-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-interactive-logic-programming-1211.6535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-interactive-logic-programming-1211.6535"/></url>
<url><loc>https://scifaro.com/en/abs/choice-disjunctive-queries-in-logic-programming-1211.6940</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choice-disjunctive-queries-in-logic-programming-1211.6940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choice-disjunctive-queries-in-logic-programming-1211.6940"/></url>
<url><loc>https://scifaro.com/en/abs/a-method-for-constructing-minimally-unsatisfiable-cnfs-1211.7152</loc><lastmod>2012-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-method-for-constructing-minimally-unsatisfiable-cnfs-1211.7152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-method-for-constructing-minimally-unsatisfiable-cnfs-1211.7152"/></url>
<url><loc>https://scifaro.com/en/abs/modal-functional-dialectica-interpretation-1212.0020</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-functional-dialectica-interpretation-1212.0020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-functional-dialectica-interpretation-1212.0020"/></url>
<url><loc>https://scifaro.com/en/abs/computing-strong-and-weak-permissions-in-defeasible-logic-1212.0079</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-strong-and-weak-permissions-in-defeasible-logic-1212.0079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-strong-and-weak-permissions-in-defeasible-logic-1212.0079"/></url>
<url><loc>https://scifaro.com/en/abs/dbgen-user-manual-1212.0253</loc><lastmod>2012-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dbgen-user-manual-1212.0253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dbgen-user-manual-1212.0253"/></url>
<url><loc>https://scifaro.com/en/abs/discriminating-lambda-terms-using-clocked-boehm-trees-1212.0401</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discriminating-lambda-terms-using-clocked-boehm-trees-1212.0401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discriminating-lambda-terms-using-clocked-boehm-trees-1212.0401"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-simulation-algorithm-on-kripke-structures-1212.1089</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-on-kripke-structures-1212.1089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-simulation-algorithm-on-kripke-structures-1212.1089"/></url>
<url><loc>https://scifaro.com/en/abs/transient-reward-approximation-for-continuous-time-markov-chains-1212.1251</loc><lastmod>2015-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transient-reward-approximation-for-continuous-time-markov-chains-1212.1251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transient-reward-approximation-for-continuous-time-markov-chains-1212.1251"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-complexity-of-model-checking-bounded-multi-pushdown-systems-1212.1485</loc><lastmod>2012-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-complexity-of-model-checking-bounded-multi-pushdown-systems-1212.1485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-complexity-of-model-checking-bounded-multi-pushdown-systems-1212.1485"/></url>
<url><loc>https://scifaro.com/en/abs/partition-refinement-for-bisimilarity-in-ccp-1212.1548</loc><lastmod>2012-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partition-refinement-for-bisimilarity-in-ccp-1212.1548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partition-refinement-for-bisimilarity-in-ccp-1212.1548"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-construction-of-temporal-logics-for-dynamical-systems-via-coalgebra-1212.1734</loc><lastmod>2012-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-construction-of-temporal-logics-for-dynamical-systems-via-coalgebra-1212.1734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-construction-of-temporal-logics-for-dynamical-systems-via-coalgebra-1212.1734"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-of-linear-time-properties-in-multi-valued-systems-1212.2154</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-of-linear-time-properties-in-multi-valued-systems-1212.2154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-of-linear-time-properties-in-multi-valued-systems-1212.2154"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-calculus-with-logical-operators-1212.2257</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-calculus-with-logical-operators-1212.2257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-calculus-with-logical-operators-1212.2257"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-termination-certificates-1212.2350</loc><lastmod>2012-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-termination-certificates-1212.2350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-termination-certificates-1212.2350"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-the-quantifier-depth-in-finite-variable-logics-alternation-hierarchy-1212.2747</loc><lastmod>2013-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-the-quantifier-depth-in-finite-variable-logics-alternation-hierarchy-1212.2747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-the-quantifier-depth-in-finite-variable-logics-alternation-hierarchy-1212.2747"/></url>
<url><loc>https://scifaro.com/en/abs/formal-design-and-verification-of-n-m-switching-control-system-1212.2789</loc><lastmod>2013-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-design-and-verification-of-n-m-switching-control-system-1212.2789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-design-and-verification-of-n-m-switching-control-system-1212.2789"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-fits-the-fittest-1212.3217</loc><lastmod>2012-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-fits-the-fittest-1212.3217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-fits-the-fittest-1212.3217"/></url>
<url><loc>https://scifaro.com/en/abs/automata-for-two-variable-logic-over-trees-with-ordered-data-values-1212.3251</loc><lastmod>2013-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-for-two-variable-logic-over-trees-with-ordered-data-values-1212.3251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-for-two-variable-logic-over-trees-with-ordered-data-values-1212.3251"/></url>
<url><loc>https://scifaro.com/en/abs/taming-the-infinite-chase-query-answering-under-expressive-integrity-constraints-1212.3357</loc><lastmod>2013-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-the-infinite-chase-query-answering-under-expressive-integrity-constraints-1212.3357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-the-infinite-chase-query-answering-under-expressive-integrity-constraints-1212.3357"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-quantities-in-formal-methods-1212.3454</loc><lastmod>2012-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-quantities-in-formal-methods-1212.3454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-quantities-in-formal-methods-1212.3454"/></url>
<url><loc>https://scifaro.com/en/abs/towards-approximate-model-checking-dc-and-pdc-specifications-1212.3838</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-approximate-model-checking-dc-and-pdc-specifications-1212.3838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-approximate-model-checking-dc-and-pdc-specifications-1212.3838"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-verification-of-markov-chains-two-distributed-protocol-case-studies-1212.3870</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-verification-of-markov-chains-two-distributed-protocol-case-studies-1212.3870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-verification-of-markov-chains-two-distributed-protocol-case-studies-1212.3870"/></url>
<url><loc>https://scifaro.com/en/abs/adding-time-to-pushdown-automata-1212.3871</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-time-to-pushdown-automata-1212.3871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-time-to-pushdown-automata-1212.3871"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-metatheory-for-continuous-markovian-logic-1212.3872</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-metatheory-for-continuous-markovian-logic-1212.3872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-metatheory-for-continuous-markovian-logic-1212.3872"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-theory-of-glue-1212.3877</loc><lastmod>2012-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-theory-of-glue-1212.3877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-theory-of-glue-1212.3877"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-unsatisfiable-cores-for-ltl-via-temporal-resolution-1212.3884</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-unsatisfiable-cores-for-ltl-via-temporal-resolution-1212.3884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-unsatisfiable-cores-for-ltl-via-temporal-resolution-1212.3884"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamic-epistemic-logic-for-mobile-structured-agents-1212.4179</loc><lastmod>2012-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamic-epistemic-logic-for-mobile-structured-agents-1212.4179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamic-epistemic-logic-for-mobile-structured-agents-1212.4179"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-and-difference-for-probabilistic-automata-1212.4288</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-and-difference-for-probabilistic-automata-1212.4288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-and-difference-for-probabilistic-automata-1212.4288"/></url>
<url><loc>https://scifaro.com/en/abs/enforcing-architectural-styles-in-presence-of-unexpected-distributed-reconfigurations-1212.4444</loc><lastmod>2012-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enforcing-architectural-styles-in-presence-of-unexpected-distributed-reconfigurations-1212.4444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enforcing-architectural-styles-in-presence-of-unexpected-distributed-reconfigurations-1212.4444"/></url>
<url><loc>https://scifaro.com/en/abs/extending-a-system-in-the-calculus-of-structures-with-a-self-dual-quantifier-1212.4483</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-a-system-in-the-calculus-of-structures-with-a-self-dual-quantifier-1212.4483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-a-system-in-the-calculus-of-structures-with-a-self-dual-quantifier-1212.4483"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-properties-and-sat-based-model-checking-1212.4650</loc><lastmod>2014-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-properties-and-sat-based-model-checking-1212.4650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-properties-and-sat-based-model-checking-1212.4650"/></url>
<url><loc>https://scifaro.com/en/abs/communication-and-concurrency-with-logic-based-restriction-inside-a-calculus-of-structures-1212.4669</loc><lastmod>2012-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communication-and-concurrency-with-logic-based-restriction-inside-a-calculus-of-structures-1212.4669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communication-and-concurrency-with-logic-based-restriction-inside-a-calculus-of-structures-1212.4669"/></url>
<url><loc>https://scifaro.com/en/abs/recognition-of-logically-related-regions-based-heap-abstraction-1212.5094</loc><lastmod>2012-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognition-of-logically-related-regions-based-heap-abstraction-1212.5094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognition-of-logically-related-regions-based-heap-abstraction-1212.5094"/></url>
<url><loc>https://scifaro.com/en/abs/rewrite-closure-and-cf-hedge-automata-1212.5108</loc><lastmod>2012-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewrite-closure-and-cf-hedge-automata-1212.5108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewrite-closure-and-cf-hedge-automata-1212.5108"/></url>
<url><loc>https://scifaro.com/en/abs/proving-linearisability-via-coarse-grained-abstraction-1212.5116</loc><lastmod>2012-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-linearisability-via-coarse-grained-abstraction-1212.5116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-linearisability-via-coarse-grained-abstraction-1212.5116"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-characterization-of-alternating-approximate-bisimilarity-1212.5139</loc><lastmod>2012-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-characterization-of-alternating-approximate-bisimilarity-1212.5139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-characterization-of-alternating-approximate-bisimilarity-1212.5139"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-super-coherence-problems-in-asp-1212.5895</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-super-coherence-problems-in-asp-1212.5895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-super-coherence-problems-in-asp-1212.5895"/></url>
<url><loc>https://scifaro.com/en/abs/the-buffered-pi-calculus-a-model-for-concurrent-languages-1212.6183</loc><lastmod>2012-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-buffered-pi-calculus-a-model-for-concurrent-languages-1212.6183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-buffered-pi-calculus-a-model-for-concurrent-languages-1212.6183"/></url>
<url><loc>https://scifaro.com/en/abs/quantifier-alternation-in-two-variable-first-order-logic-with-successor-is-decidable-1212.6500</loc><lastmod>2013-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifier-alternation-in-two-variable-first-order-logic-with-successor-is-decidable-1212.6500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifier-alternation-in-two-variable-first-order-logic-with-successor-is-decidable-1212.6500"/></url>
<url><loc>https://scifaro.com/en/abs/l-recursion-and-a-new-logic-for-logarithmic-space-1212.6567</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-recursion-and-a-new-logic-for-logarithmic-space-1212.6567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-recursion-and-a-new-logic-for-logarithmic-space-1212.6567"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-formal-techniques-for-safety-critical-systems-1212.6574</loc><lastmod>2013-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-formal-techniques-for-safety-critical-systems-1212.6574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-formal-techniques-for-safety-critical-systems-1212.6574"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-for-modal-systems-s3-s5-extended-by-axioms-for-propositional-quantifiers-and-identity-1212.6576</loc><lastmod>2014-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-for-modal-systems-s3-s5-extended-by-axioms-for-propositional-quantifiers-and-identity-1212.6576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-for-modal-systems-s3-s5-extended-by-axioms-for-propositional-quantifiers-and-identity-1212.6576"/></url>
<url><loc>https://scifaro.com/en/abs/merging-process-algebra-and-action-based-computation-tree-logic-1212.6813</loc><lastmod>2013-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/merging-process-algebra-and-action-based-computation-tree-logic-1212.6813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/merging-process-algebra-and-action-based-computation-tree-logic-1212.6813"/></url>
<url><loc>https://scifaro.com/en/abs/pals-based-analysis-of-an-airplane-multirate-control-system-in-real-time-maude-1301.0038</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pals-based-analysis-of-an-airplane-multirate-control-system-in-real-time-maude-1301.0038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pals-based-analysis-of-an-airplane-multirate-control-system-in-real-time-maude-1301.0038"/></url>
<url><loc>https://scifaro.com/en/abs/generating-property-directed-potential-invariants-by-backward-analysis-1301.0039</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-property-directed-potential-invariants-by-backward-analysis-1301.0039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-property-directed-potential-invariants-by-backward-analysis-1301.0039"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-model-for-real-time-parallel-computation-1301.0040</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-model-for-real-time-parallel-computation-1301.0040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-model-for-real-time-parallel-computation-1301.0040"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-with-program-slicing-based-on-variable-dependence-graphs-1301.0041</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-with-program-slicing-based-on-variable-dependence-graphs-1301.0041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-with-program-slicing-based-on-variable-dependence-graphs-1301.0041"/></url>
<url><loc>https://scifaro.com/en/abs/a-timed-calculus-for-mobile-ad-hoc-networks-1301.0045</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-timed-calculus-for-mobile-ad-hoc-networks-1301.0045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-timed-calculus-for-mobile-ad-hoc-networks-1301.0045"/></url>
<url><loc>https://scifaro.com/en/abs/mdm-a-mode-diagram-modeling-framework-1301.0046</loc><lastmod>2013-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mdm-a-mode-diagram-modeling-framework-1301.0046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mdm-a-mode-diagram-modeling-framework-1301.0046"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-logic-i-quantifier-theories-and-completeness-theorems-1301.0667</loc><lastmod>2013-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-logic-i-quantifier-theories-and-completeness-theorems-1301.0667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-logic-i-quantifier-theories-and-completeness-theorems-1301.0667"/></url>
<url><loc>https://scifaro.com/en/abs/eliminating-unfounded-set-checking-for-hex-programs-1301.1390</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliminating-unfounded-set-checking-for-hex-programs-1301.1390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliminating-unfounded-set-checking-for-hex-programs-1301.1390"/></url>
<url><loc>https://scifaro.com/en/abs/backdoors-to-normality-for-disjunctive-logic-programs-1301.1391</loc><lastmod>2013-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/backdoors-to-normality-for-disjunctive-logic-programs-1301.1391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/backdoors-to-normality-for-disjunctive-logic-programs-1301.1391"/></url>
<url><loc>https://scifaro.com/en/abs/two-new-definitions-of-stable-models-of-logic-programs-with-generalized-quantifiers-1301.1393</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-new-definitions-of-stable-models-of-logic-programs-with-generalized-quantifiers-1301.1393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-new-definitions-of-stable-models-of-logic-programs-with-generalized-quantifiers-1301.1393"/></url>
<url><loc>https://scifaro.com/en/abs/lloyd-topor-completion-and-general-stable-models-1301.1394</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lloyd-topor-completion-and-general-stable-models-1301.1394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lloyd-topor-completion-and-general-stable-models-1301.1394"/></url>
<url><loc>https://scifaro.com/en/abs/extending-fo-id-with-knowledge-producing-definitions-preliminary-results-1301.1395</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-fo-id-with-knowledge-producing-definitions-preliminary-results-1301.1395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-fo-id-with-knowledge-producing-definitions-preliminary-results-1301.1395"/></url>
<url><loc>https://scifaro.com/en/abs/partial-orders-for-efficient-bmc-of-concurrent-software-1301.1629</loc><lastmod>2013-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-orders-for-efficient-bmc-of-concurrent-software-1301.1629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-orders-for-efficient-bmc-of-concurrent-software-1301.1629"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-nonlinear-inequalities-with-taylor-interval-approximations-1301.1702</loc><lastmod>2013-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-nonlinear-inequalities-with-taylor-interval-approximations-1301.1702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-nonlinear-inequalities-with-taylor-interval-approximations-1301.1702"/></url>
<url><loc>https://scifaro.com/en/abs/computing-quantiles-in-markov-reward-models-1301.1818</loc><lastmod>2013-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-quantiles-in-markov-reward-models-1301.1818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-quantiles-in-markov-reward-models-1301.1818"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-proof-of-p-time-completeness-of-linear-lambda-calculus-1301.2763</loc><lastmod>2013-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-proof-of-p-time-completeness-of-linear-lambda-calculus-1301.2763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-proof-of-p-time-completeness-of-linear-lambda-calculus-1301.2763"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-abstractions-for-timed-automata-1301.3127</loc><lastmod>2013-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-abstractions-for-timed-automata-1301.3127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-abstractions-for-timed-automata-1301.3127"/></url>
<url><loc>https://scifaro.com/en/abs/logarithmic-space-and-permutations-1301.3189</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logarithmic-space-and-permutations-1301.3189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logarithmic-space-and-permutations-1301.3189"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-preserving-reduction-for-symbolic-model-checking-1301.3299</loc><lastmod>2013-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-preserving-reduction-for-symbolic-model-checking-1301.3299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-preserving-reduction-for-symbolic-model-checking-1301.3299"/></url>
<url><loc>https://scifaro.com/en/abs/on-recursive-operations-over-logic-lts-1301.3350</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-recursive-operations-over-logic-lts-1301.3350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-recursive-operations-over-logic-lts-1301.3350"/></url>
<url><loc>https://scifaro.com/en/abs/bicategorical-semantics-for-nondeterministic-computation-1301.3393</loc><lastmod>2013-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicategorical-semantics-for-nondeterministic-computation-1301.3393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicategorical-semantics-for-nondeterministic-computation-1301.3393"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-theory-of-skiplists-of-unbounded-size-and-arbitrary-height-1301.4372</loc><lastmod>2013-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-theory-of-skiplists-of-unbounded-size-and-arbitrary-height-1301.4372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-theory-of-skiplists-of-unbounded-size-and-arbitrary-height-1301.4372"/></url>
<url><loc>https://scifaro.com/en/abs/the-hidden-structural-rules-of-the-discontinuous-lambek-calculus-1301.4816</loc><lastmod>2013-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hidden-structural-rules-of-the-discontinuous-lambek-calculus-1301.4816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hidden-structural-rules-of-the-discontinuous-lambek-calculus-1301.4816"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalisation-of-nash-s-theorem-with-higher-order-functionals-1301.4845</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalisation-of-nash-s-theorem-with-higher-order-functionals-1301.4845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalisation-of-nash-s-theorem-with-higher-order-functionals-1301.4845"/></url>
<url><loc>https://scifaro.com/en/abs/vector-addition-system-reversible-reachability-problem-1301.4874</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vector-addition-system-reversible-reachability-problem-1301.4874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vector-addition-system-reversible-reachability-problem-1301.4874"/></url>
<url><loc>https://scifaro.com/en/abs/computational-aspects-of-the-calculus-of-structure-1301.4910</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-aspects-of-the-calculus-of-structure-1301.4910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-aspects-of-the-calculus-of-structure-1301.4910"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theoretical-framework-for-natural-language-semantics-the-montagovian-generative-lexicon-1301.4938</loc><lastmod>2014-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theoretical-framework-for-natural-language-semantics-the-montagovian-generative-lexicon-1301.4938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theoretical-framework-for-natural-language-semantics-the-montagovian-generative-lexicon-1301.4938"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctive-interpolants-for-horn-clause-verification-extended-technical-report-1301.4973</loc><lastmod>2013-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctive-interpolants-for-horn-clause-verification-extended-technical-report-1301.4973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctive-interpolants-for-horn-clause-verification-extended-technical-report-1301.4973"/></url>
<url><loc>https://scifaro.com/en/abs/the-tree-width-of-separation-logic-with-recursive-definitions-1301.5139</loc><lastmod>2013-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tree-width-of-separation-logic-with-recursive-definitions-1301.5139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tree-width-of-separation-logic-with-recursive-definitions-1301.5139"/></url>
<url><loc>https://scifaro.com/en/abs/a-rational-and-efficient-algorithm-for-view-revision-in-databases-1301.5154</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rational-and-efficient-algorithm-for-view-revision-in-databases-1301.5154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rational-and-efficient-algorithm-for-view-revision-in-databases-1301.5154"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-priority-channel-systems-1301.5500</loc><lastmod>2016-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-priority-channel-systems-1301.5500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-priority-channel-systems-1301.5500"/></url>
<url><loc>https://scifaro.com/en/abs/omega-petri-nets-1301.6572</loc><lastmod>2013-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omega-petri-nets-1301.6572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omega-petri-nets-1301.6572"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-logic-based-unifying-framework-for-computing-1301.6905</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-logic-based-unifying-framework-for-computing-1301.6905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-logic-based-unifying-framework-for-computing-1301.6905"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-inductive-coverability-1301.7321</loc><lastmod>2013-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-inductive-coverability-1301.7321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-inductive-coverability-1301.7321"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-the-verification-of-certifying-computations-1301.7462</loc><lastmod>2013-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-the-verification-of-certifying-computations-1301.7462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-the-verification-of-certifying-computations-1301.7462"/></url>
<url><loc>https://scifaro.com/en/abs/homology-groups-of-pipeline-petri-nets-1301.7521</loc><lastmod>2013-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homology-groups-of-pipeline-petri-nets-1301.7521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homology-groups-of-pipeline-petri-nets-1301.7521"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-approach-for-checking-real-time-specification-patterns-1301.7531</loc><lastmod>2013-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-approach-for-checking-real-time-specification-patterns-1301.7531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-approach-for-checking-real-time-specification-patterns-1301.7531"/></url>
<url><loc>https://scifaro.com/en/abs/an-experiment-on-parallel-model-checking-of-a-ctl-fragment-1301.7533</loc><lastmod>2013-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-experiment-on-parallel-model-checking-of-a-ctl-fragment-1301.7533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-experiment-on-parallel-model-checking-of-a-ctl-fragment-1301.7533"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-robot-games-on-the-integer-line-1301.7700</loc><lastmod>2013-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-robot-games-on-the-integer-line-1301.7700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-robot-games-on-the-integer-line-1301.7700"/></url>
<url><loc>https://scifaro.com/en/abs/safe-schedulability-of-bounded-rate-multi-mode-systems-1302.0745</loc><lastmod>2013-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-schedulability-of-bounded-rate-multi-mode-systems-1302.0745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-schedulability-of-bounded-rate-multi-mode-systems-1302.0745"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-epistemic-logic-with-public-announcement-non-predetermined-possibilities-1302.0975</loc><lastmod>2013-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-epistemic-logic-with-public-announcement-non-predetermined-possibilities-1302.0975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-epistemic-logic-with-public-announcement-non-predetermined-possibilities-1302.0975"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-determinization-from-automata-to-coalgebras-1302.1046</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-determinization-from-automata-to-coalgebras-1302.1046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-determinization-from-automata-to-coalgebras-1302.1046"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-algebra-with-tests-and-coq-tools-for-while-programs-1302.1737</loc><lastmod>2013-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-algebra-with-tests-and-coq-tools-for-while-programs-1302.1737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-algebra-with-tests-and-coq-tools-for-while-programs-1302.1737"/></url>
<url><loc>https://scifaro.com/en/abs/belief-semantics-of-authorization-logic-1302.2123</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-semantics-of-authorization-logic-1302.2123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-semantics-of-authorization-logic-1302.2123"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-higher-order-relational-specifications-1302.2584</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-higher-order-relational-specifications-1302.2584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-higher-order-relational-specifications-1302.2584"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-conditional-termination-1302.2762</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-conditional-termination-1302.2762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-conditional-termination-1302.2762"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-verification-of-infinite-state-systems-1302.3105</loc><lastmod>2013-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-verification-of-infinite-state-systems-1302.3105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-verification-of-infinite-state-systems-1302.3105"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-based-reachability-1302.3290</loc><lastmod>2013-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-based-reachability-1302.3290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-based-reachability-1302.3290"/></url>
<url><loc>https://scifaro.com/en/abs/petri-nets-with-time-and-cost-1302.3291</loc><lastmod>2013-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-nets-with-time-and-cost-1302.3291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-nets-with-time-and-cost-1302.3291"/></url>
<url><loc>https://scifaro.com/en/abs/effective-marking-equivalence-checking-in-systems-with-dynamic-process-creation-1302.3293</loc><lastmod>2013-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-marking-equivalence-checking-in-systems-with-dynamic-process-creation-1302.3293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-marking-equivalence-checking-in-systems-with-dynamic-process-creation-1302.3293"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-for-newton-s-method-on-monotone-polynomial-systems-and-p-time-model-checking-of-probabilistic-one-counter-automata-1302.3741</loc><lastmod>2013-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-for-newton-s-method-on-monotone-polynomial-systems-and-p-time-model-checking-of-probabilistic-one-counter-automata-1302.3741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-for-newton-s-method-on-monotone-polynomial-systems-and-p-time-model-checking-of-probabilistic-one-counter-automata-1302.3741"/></url>
<url><loc>https://scifaro.com/en/abs/the-relationship-between-craig-interpolation-and-recursion-free-horn-clauses-1302.4187</loc><lastmod>2013-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relationship-between-craig-interpolation-and-recursion-free-horn-clauses-1302.4187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relationship-between-craig-interpolation-and-recursion-free-horn-clauses-1302.4187"/></url>
<url><loc>https://scifaro.com/en/abs/generalizations-of-the-los-tarski-preservation-theorem-1302.4350</loc><lastmod>2013-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizations-of-the-los-tarski-preservation-theorem-1302.4350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizations-of-the-los-tarski-preservation-theorem-1302.4350"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-starting-from-the-end-1302.4539</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-starting-from-the-end-1302.4539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-starting-from-the-end-1302.4539"/></url>
<url><loc>https://scifaro.com/en/abs/generating-non-linear-interpolants-by-semidefinite-programming-1302.4739</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-non-linear-interpolants-by-semidefinite-programming-1302.4739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-non-linear-interpolants-by-semidefinite-programming-1302.4739"/></url>
<url><loc>https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-bbi-proof-theory-and-proof-search-1302.4783</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-bbi-proof-theory-and-proof-search-1302.4783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-bbi-proof-theory-and-proof-search-1302.4783"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-approach-to-weak-and-delay-bismulation-in-coalgebra-1302.4856</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-approach-to-weak-and-delay-bismulation-in-coalgebra-1302.4856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-approach-to-weak-and-delay-bismulation-in-coalgebra-1302.4856"/></url>
<url><loc>https://scifaro.com/en/abs/assembling-the-proofs-of-ordered-model-transformations-1302.5174</loc><lastmod>2013-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assembling-the-proofs-of-ordered-model-transformations-1302.5174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assembling-the-proofs-of-ordered-model-transformations-1302.5174"/></url>
<url><loc>https://scifaro.com/en/abs/expressing-properties-in-second-and-third-order-logic-hypercube-graphs-and-satqbf-1302.5254</loc><lastmod>2013-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressing-properties-in-second-and-third-order-logic-hypercube-graphs-and-satqbf-1302.5254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressing-properties-in-second-and-third-order-logic-hypercube-graphs-and-satqbf-1302.5254"/></url>
<url><loc>https://scifaro.com/en/abs/call-by-value-and-call-by-name-dual-calculi-with-inductive-and-coinductive-types-1302.5765</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/call-by-value-and-call-by-name-dual-calculi-with-inductive-and-coinductive-types-1302.5765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/call-by-value-and-call-by-name-dual-calculi-with-inductive-and-coinductive-types-1302.5765"/></url>
<url><loc>https://scifaro.com/en/abs/an-event-based-model-for-contracts-1302.6330</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-event-based-model-for-contracts-1302.6330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-event-based-model-for-contracts-1302.6330"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-in-infinitary-term-graph-rewriting-systems-is-simple-extended-abstract-1302.6335</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-in-infinitary-term-graph-rewriting-systems-is-simple-extended-abstract-1302.6335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-in-infinitary-term-graph-rewriting-systems-is-simple-extended-abstract-1302.6335"/></url>
<url><loc>https://scifaro.com/en/abs/linear-compressed-pattern-matching-for-polynomial-rewriting-extended-abstract-1302.6336</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-compressed-pattern-matching-for-polynomial-rewriting-extended-abstract-1302.6336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-compressed-pattern-matching-for-polynomial-rewriting-extended-abstract-1302.6336"/></url>
<url><loc>https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1302.6338</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1302.6338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1302.6338"/></url>
<url><loc>https://scifaro.com/en/abs/bigraphical-nets-1302.6339</loc><lastmod>2013-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bigraphical-nets-1302.6339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bigraphical-nets-1302.6339"/></url>
<url><loc>https://scifaro.com/en/abs/ml4pg-in-computer-algebra-verification-1302.6421</loc><lastmod>2013-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ml4pg-in-computer-algebra-verification-1302.6421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ml4pg-in-computer-algebra-verification-1302.6421"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-and-p-morphism-for-branching-time-logics-with-indistinguishability-relations-1302.6514</loc><lastmod>2013-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-and-p-morphism-for-branching-time-logics-with-indistinguishability-relations-1302.6514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-and-p-morphism-for-branching-time-logics-with-indistinguishability-relations-1302.6514"/></url>
<url><loc>https://scifaro.com/en/abs/on-modal-logics-for-qualitative-possibility-in-a-fuzzy-setting-1302.6813</loc><lastmod>2013-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-modal-logics-for-qualitative-possibility-in-a-fuzzy-setting-1302.6813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-modal-logics-for-qualitative-possibility-in-a-fuzzy-setting-1302.6813"/></url>
<url><loc>https://scifaro.com/en/abs/a-graphical-language-for-proof-strategies-1302.6890</loc><lastmod>2014-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graphical-language-for-proof-strategies-1302.6890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graphical-language-for-proof-strategies-1302.6890"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-classes-of-tree-automata-mixing-local-and-global-constraints-modulo-flat-theories-1302.6960</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-classes-of-tree-automata-mixing-local-and-global-constraints-modulo-flat-theories-1302.6960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-classes-of-tree-automata-mixing-local-and-global-constraints-modulo-flat-theories-1302.6960"/></url>
<url><loc>https://scifaro.com/en/abs/syllogisms-in-rudimentary-linear-logic-diagrammatically-1302.7111</loc><lastmod>2013-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syllogisms-in-rudimentary-linear-logic-diagrammatically-1302.7111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syllogisms-in-rudimentary-linear-logic-diagrammatically-1302.7111"/></url>
<url><loc>https://scifaro.com/en/abs/order-effects-in-dynamic-semantics-1302.7168</loc><lastmod>2013-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-effects-in-dynamic-semantics-1302.7168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-effects-in-dynamic-semantics-1302.7168"/></url>
<url><loc>https://scifaro.com/en/abs/a-connection-between-concurrency-and-language-theory-1303.0044</loc><lastmod>2013-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-connection-between-concurrency-and-language-theory-1303.0044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-connection-between-concurrency-and-language-theory-1303.0044"/></url>
<url><loc>https://scifaro.com/en/abs/network-algebra-for-synchronous-dataflow-1303.0382</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/network-algebra-for-synchronous-dataflow-1303.0382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/network-algebra-for-synchronous-dataflow-1303.0382"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-undecidability-of-bisimilarity-for-second-order-pushdown-processes-1303.0780</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-undecidability-of-bisimilarity-for-second-order-pushdown-processes-1303.0780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-undecidability-of-bisimilarity-for-second-order-pushdown-processes-1303.0780"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-be-both-rich-and-happy-combining-quantitative-and-qualitative-strategic-reasoning-about-multi-player-games-extended-abstract-1303.0789</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-be-both-rich-and-happy-combining-quantitative-and-qualitative-strategic-reasoning-about-multi-player-games-extended-abstract-1303.0789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-be-both-rich-and-happy-combining-quantitative-and-qualitative-strategic-reasoning-about-multi-player-games-extended-abstract-1303.0789"/></url>
<url><loc>https://scifaro.com/en/abs/lossy-channel-games-under-incomplete-information-1303.0790</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lossy-channel-games-under-incomplete-information-1303.0790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lossy-channel-games-under-incomplete-information-1303.0790"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-game-structures-with-roles-1303.0792</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-game-structures-with-roles-1303.0792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-game-structures-with-roles-1303.0792"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-strategies-under-partial-observability-and-fairness-constraints-1303.0793</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-strategies-under-partial-observability-and-fairness-constraints-1303.0793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-strategies-under-partial-observability-and-fairness-constraints-1303.0793"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-validity-in-epistemic-atl-to-validity-in-epistemic-ctl-1303.0794</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-validity-in-epistemic-atl-to-validity-in-epistemic-ctl-1303.0794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-validity-in-epistemic-atl-to-validity-in-epistemic-ctl-1303.0794"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-updatable-strategy-logic-1303.0795</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-updatable-strategy-logic-1303.0795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-updatable-strategy-logic-1303.0795"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-point-of-view-on-strategies-1303.0796</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-point-of-view-on-strategies-1303.0796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-point-of-view-on-strategies-1303.0796"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-structured-reactive-programs-via-deterministic-tree-automata-1303.0797</loc><lastmod>2013-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-structured-reactive-programs-via-deterministic-tree-automata-1303.0797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-structured-reactive-programs-via-deterministic-tree-automata-1303.0797"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-via-compositionality-in-petri-nets-1303.1399</loc><lastmod>2014-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-via-compositionality-in-petri-nets-1303.1399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-via-compositionality-in-petri-nets-1303.1399"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-control-of-mdps-with-temporal-logic-constraints-1303.1942</loc><lastmod>2013-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-control-of-mdps-with-temporal-logic-constraints-1303.1942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-control-of-mdps-with-temporal-logic-constraints-1303.1942"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-equivalence-proofs-for-non-deterministic-coalgebras-1303.1994</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-equivalence-proofs-for-non-deterministic-coalgebras-1303.1994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-equivalence-proofs-for-non-deterministic-coalgebras-1303.1994"/></url>
<url><loc>https://scifaro.com/en/abs/structural-tractability-of-counting-of-solutions-to-conjunctive-queries-1303.2059</loc><lastmod>2013-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-tractability-of-counting-of-solutions-to-conjunctive-queries-1303.2059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-tractability-of-counting-of-solutions-to-conjunctive-queries-1303.2059"/></url>
<url><loc>https://scifaro.com/en/abs/collapsible-pushdown-graphs-of-level-2-are-tree-automatic-1303.2453</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collapsible-pushdown-graphs-of-level-2-are-tree-automatic-1303.2453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collapsible-pushdown-graphs-of-level-2-are-tree-automatic-1303.2453"/></url>
<url><loc>https://scifaro.com/en/abs/simulations-and-bisimulations-for-coalgebraic-modal-logics-1303.2467</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulations-and-bisimulations-for-coalgebraic-modal-logics-1303.2467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulations-and-bisimulations-for-coalgebraic-modal-logics-1303.2467"/></url>
<url><loc>https://scifaro.com/en/abs/separation-logic-modulo-theories-1303.2489</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-logic-modulo-theories-1303.2489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-logic-modulo-theories-1303.2489"/></url>
<url><loc>https://scifaro.com/en/abs/what-makes-a-computation-unconventional-1303.2507</loc><lastmod>2013-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-makes-a-computation-unconventional-1303.2507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-makes-a-computation-unconventional-1303.2507"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-quantum-process-calculus-to-higher-dimensional-quantum-protocols-1303.2896</loc><lastmod>2014-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-quantum-process-calculus-to-higher-dimensional-quantum-protocols-1303.2896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-quantum-process-calculus-to-higher-dimensional-quantum-protocols-1303.2896"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automated-proof-strategy-generalisation-1303.2975</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automated-proof-strategy-generalisation-1303.2975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automated-proof-strategy-generalisation-1303.2975"/></url>
<url><loc>https://scifaro.com/en/abs/type-theoretical-natural-language-semantics-on-the-system-f-for-meaning-assembly-1303.3036</loc><lastmod>2013-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theoretical-natural-language-semantics-on-the-system-f-for-meaning-assembly-1303.3036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theoretical-natural-language-semantics-on-the-system-f-for-meaning-assembly-1303.3036"/></url>
<url><loc>https://scifaro.com/en/abs/nets-relations-and-linking-diagrams-1303.3371</loc><lastmod>2013-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nets-relations-and-linking-diagrams-1303.3371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nets-relations-and-linking-diagrams-1303.3371"/></url>
<url><loc>https://scifaro.com/en/abs/classification-of-boolean-functions-where-affine-functions-are-uniformly-distributed-1303.3527</loc><lastmod>2013-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-of-boolean-functions-where-affine-functions-are-uniformly-distributed-1303.3527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-of-boolean-functions-where-affine-functions-are-uniformly-distributed-1303.3527"/></url>
<url><loc>https://scifaro.com/en/abs/from-propositional-to-first-order-monitoring-1303.3645</loc><lastmod>2013-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-propositional-to-first-order-monitoring-1303.3645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-propositional-to-first-order-monitoring-1303.3645"/></url>
<url><loc>https://scifaro.com/en/abs/update-report-leo-ii-version-1-5-1303.3761</loc><lastmod>2013-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/update-report-leo-ii-version-1-5-1303.3761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/update-report-leo-ii-version-1-5-1303.3761"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-traps-in-muller-and-parity-games-1303.3777</loc><lastmod>2013-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-traps-in-muller-and-parity-games-1303.3777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-traps-in-muller-and-parity-games-1303.3777"/></url>
<url><loc>https://scifaro.com/en/abs/cliquewidth-and-knowledge-compilation-1303.4081</loc><lastmod>2013-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cliquewidth-and-knowledge-compilation-1303.4081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cliquewidth-and-knowledge-compilation-1303.4081"/></url>
<url><loc>https://scifaro.com/en/abs/a-qualitative-comparison-of-the-suitability-of-four-theorem-provers-for-basic-auction-theory-1303.4193</loc><lastmod>2013-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-qualitative-comparison-of-the-suitability-of-four-theorem-provers-for-basic-auction-theory-1303.4193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-qualitative-comparison-of-the-suitability-of-four-theorem-provers-for-basic-auction-theory-1303.4193"/></url>
<url><loc>https://scifaro.com/en/abs/ceres-for-first-order-schemata-1303.4257</loc><lastmod>2013-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ceres-for-first-order-schemata-1303.4257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ceres-for-first-order-schemata-1303.4257"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-vs-linear-temporal-logic-in-model-checking-and-games-1303.4533</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-vs-linear-temporal-logic-in-model-checking-and-games-1303.4533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-vs-linear-temporal-logic-in-model-checking-and-games-1303.4533"/></url>
<url><loc>https://scifaro.com/en/abs/is-alpha-conversion-easy-1303.5039</loc><lastmod>2014-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-alpha-conversion-easy-1303.5039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-alpha-conversion-easy-1303.5039"/></url>
<url><loc>https://scifaro.com/en/abs/polylogarithmic-cuts-in-models-of-v-0-1303.6075</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polylogarithmic-cuts-in-models-of-v-0-1303.6075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polylogarithmic-cuts-in-models-of-v-0-1303.6075"/></url>
<url><loc>https://scifaro.com/en/abs/global-spacing-constraint-technical-report-1303.6107</loc><lastmod>2013-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-spacing-constraint-technical-report-1303.6107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-spacing-constraint-technical-report-1303.6107"/></url>
<url><loc>https://scifaro.com/en/abs/some-notes-on-the-abstraction-operation-for-multi-terminal-binary-decision-diagrams-1303.6186</loc><lastmod>2013-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-notes-on-the-abstraction-operation-for-multi-terminal-binary-decision-diagrams-1303.6186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-notes-on-the-abstraction-operation-for-multi-terminal-binary-decision-diagrams-1303.6186"/></url>
<url><loc>https://scifaro.com/en/abs/bicompletions-of-distance-matrices-1303.6428</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicompletions-of-distance-matrices-1303.6428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicompletions-of-distance-matrices-1303.6428"/></url>
<url><loc>https://scifaro.com/en/abs/feasible-combinatorial-matrix-theory-1303.6453</loc><lastmod>2013-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feasible-combinatorial-matrix-theory-1303.6453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feasible-combinatorial-matrix-theory-1303.6453"/></url>
<url><loc>https://scifaro.com/en/abs/index-sets-for-finite-normal-predicate-logic-programs-1303.6555</loc><lastmod>2013-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/index-sets-for-finite-normal-predicate-logic-programs-1303.6555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/index-sets-for-finite-normal-predicate-logic-programs-1303.6555"/></url>
<url><loc>https://scifaro.com/en/abs/primal-implication-as-encryption-1303.6862</loc><lastmod>2013-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/primal-implication-as-encryption-1303.6862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/primal-implication-as-encryption-1303.6862"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-speed-of-constraint-propagation-and-the-time-complexity-of-arc-consistency-testing-1303.7077</loc><lastmod>2013-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-speed-of-constraint-propagation-and-the-time-complexity-of-arc-consistency-testing-1303.7077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-speed-of-constraint-propagation-and-the-time-complexity-of-arc-consistency-testing-1303.7077"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-workshop-on-logical-and-semantic-frameworks-with-applications-1303.7136</loc><lastmod>2013-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-logical-and-semantic-frameworks-with-applications-1303.7136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-logical-and-semantic-frameworks-with-applications-1303.7136"/></url>
<url><loc>https://scifaro.com/en/abs/proof-nets-and-the-call-by-value-lambda-calculus-1303.7326</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-nets-and-the-call-by-value-lambda-calculus-1303.7326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-nets-and-the-call-by-value-lambda-calculus-1303.7326"/></url>
<url><loc>https://scifaro.com/en/abs/symmetries-in-modal-logics-1303.7327</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetries-in-modal-logics-1303.7327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetries-in-modal-logics-1303.7327"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-deduction-problem-for-locally-stable-theories-with-normal-forms-1303.7328</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-deduction-problem-for-locally-stable-theories-with-normal-forms-1303.7328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-deduction-problem-for-locally-stable-theories-with-normal-forms-1303.7328"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-lambda-theories-by-ultraproducts-1303.7329</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-lambda-theories-by-ultraproducts-1303.7329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-lambda-theories-by-ultraproducts-1303.7329"/></url>
<url><loc>https://scifaro.com/en/abs/the-untyped-stack-calculus-and-bohm-s-theorem-1303.7330</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-untyped-stack-calculus-and-bohm-s-theorem-1303.7330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-untyped-stack-calculus-and-bohm-s-theorem-1303.7330"/></url>
<url><loc>https://scifaro.com/en/abs/the-stack-calculus-1303.7331</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stack-calculus-1303.7331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stack-calculus-1303.7331"/></url>
<url><loc>https://scifaro.com/en/abs/a-weak-hoas-approach-to-the-poplmark-challenge-1303.7332</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weak-hoas-approach-to-the-poplmark-challenge-1303.7332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weak-hoas-approach-to-the-poplmark-challenge-1303.7332"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculi-for-the-classical-fragment-of-bochvar-and-halld-en-s-nonsense-logics-1303.7333</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculi-for-the-classical-fragment-of-bochvar-and-halld-en-s-nonsense-logics-1303.7333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculi-for-the-classical-fragment-of-bochvar-and-halld-en-s-nonsense-logics-1303.7333"/></url>
<url><loc>https://scifaro.com/en/abs/non-determinism-through-type-isomorphism-1303.7334</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-determinism-through-type-isomorphism-1303.7334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-determinism-through-type-isomorphism-1303.7334"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-confluence-of-orthogonal-rewriting-systems-1303.7335</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-confluence-of-orthogonal-rewriting-systems-1303.7335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-confluence-of-orthogonal-rewriting-systems-1303.7335"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-calculus-for-predicate-logic-1303.7336</loc><lastmod>2013-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-calculus-for-predicate-logic-1303.7336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-calculus-for-predicate-logic-1303.7336"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-interpolation-by-solving-recursion-free-horn-clauses-1303.7378</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-interpolation-by-solving-recursion-free-horn-clauses-1303.7378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-interpolation-by-solving-recursion-free-horn-clauses-1303.7378"/></url>
<url><loc>https://scifaro.com/en/abs/state-event-based-versus-purely-action-or-state-based-logics-1303.7459</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/state-event-based-versus-purely-action-or-state-based-logics-1303.7459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/state-event-based-versus-purely-action-or-state-based-logics-1303.7459"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-calculus-synopsis-1304.0558</loc><lastmod>2013-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-calculus-synopsis-1304.0558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-calculus-synopsis-1304.0558"/></url>
<url><loc>https://scifaro.com/en/abs/regular-graphs-and-the-spectra-of-two-variable-logic-with-counting-1304.0829</loc><lastmod>2014-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-graphs-and-the-spectra-of-two-variable-logic-with-counting-1304.0829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-graphs-and-the-spectra-of-two-variable-logic-with-counting-1304.0829"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-asynchronous-shared-memory-systems-1304.1185</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-asynchronous-shared-memory-systems-1304.1185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-asynchronous-shared-memory-systems-1304.1185"/></url>
<url><loc>https://scifaro.com/en/abs/total-representations-1304.1239</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-representations-1304.1239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-representations-1304.1239"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-nets-in-russian-1304.1309</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-nets-in-russian-1304.1309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-nets-in-russian-1304.1309"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-and-nearly-uniform-generator-of-sat-witnesses-1304.1584</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-and-nearly-uniform-generator-of-sat-witnesses-1304.1584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-and-nearly-uniform-generator-of-sat-witnesses-1304.1584"/></url>
<url><loc>https://scifaro.com/en/abs/some-hierarchies-of-qcb-0-spaces-1304.1647</loc><lastmod>2013-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-hierarchies-of-qcb-0-spaces-1304.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-hierarchies-of-qcb-0-spaces-1304.1647"/></url>
<url><loc>https://scifaro.com/en/abs/macro-lambda-calculus-1304.2290</loc><lastmod>2015-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/macro-lambda-calculus-1304.2290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/macro-lambda-calculus-1304.2290"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-3-level-quantified-syllogistic-1304.2412</loc><lastmod>2013-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-3-level-quantified-syllogistic-1304.2412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-a-3-level-quantified-syllogistic-1304.2412"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-fences-in-a-concurrent-program-using-sc-proof-of-correctness-1304.2936</loc><lastmod>2013-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-fences-in-a-concurrent-program-using-sc-proof-of-correctness-1304.2936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-fences-in-a-concurrent-program-using-sc-proof-of-correctness-1304.2936"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-petri-nets-1304.3121</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-petri-nets-1304.3121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-petri-nets-1304.3121"/></url>
<url><loc>https://scifaro.com/en/abs/a-polytime-complexity-analyser-for-probabilistic-polynomial-time-over-imperative-stack-programs-1304.3249</loc><lastmod>2013-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polytime-complexity-analyser-for-probabilistic-polynomial-time-over-imperative-stack-programs-1304.3249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polytime-complexity-analyser-for-probabilistic-polynomial-time-over-imperative-stack-programs-1304.3249"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-realizability-monads-and-witness-extraction-1304.4091</loc><lastmod>2013-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-realizability-monads-and-witness-extraction-1304.4091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-realizability-monads-and-witness-extraction-1304.4091"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-machines-for-game-semantics-revisited-1304.4159</loc><lastmod>2013-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-machines-for-game-semantics-revisited-1304.4159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-machines-for-game-semantics-revisited-1304.4159"/></url>
<url><loc>https://scifaro.com/en/abs/inclusion-logic-and-fixed-point-logic-1304.4267</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inclusion-logic-and-fixed-point-logic-1304.4267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inclusion-logic-and-fixed-point-logic-1304.4267"/></url>
<url><loc>https://scifaro.com/en/abs/relativisation-makes-contradictions-harder-for-resolution-1304.4287</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relativisation-makes-contradictions-harder-for-resolution-1304.4287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relativisation-makes-contradictions-harder-for-resolution-1304.4287"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-and-acceleration-in-smt-based-model-checking-for-array-programs-1304.4499</loc><lastmod>2013-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-and-acceleration-in-smt-based-model-checking-for-array-programs-1304.4499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-and-acceleration-in-smt-based-model-checking-for-array-programs-1304.4499"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-herbrand-trees-from-coq-1304.4557</loc><lastmod>2013-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-herbrand-trees-from-coq-1304.4557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-herbrand-trees-from-coq-1304.4557"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-description-logic-for-ontology-based-data-access-extended-version-1304.5185</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-description-logic-for-ontology-based-data-access-extended-version-1304.5185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-description-logic-for-ontology-based-data-access-extended-version-1304.5185"/></url>
<url><loc>https://scifaro.com/en/abs/some-approximations-in-model-checking-and-testing-1304.5199</loc><lastmod>2013-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-approximations-in-model-checking-and-testing-1304.5199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-approximations-in-model-checking-and-testing-1304.5199"/></url>
<url><loc>https://scifaro.com/en/abs/on-refinements-of-boolean-and-parametric-modal-transition-systems-1304.5278</loc><lastmod>2013-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-refinements-of-boolean-and-parametric-modal-transition-systems-1304.5278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-refinements-of-boolean-and-parametric-modal-transition-systems-1304.5278"/></url>
<url><loc>https://scifaro.com/en/abs/automata-with-generalized-rabin-pairs-for-probabilistic-model-checking-and-ltl-synthesis-1304.5281</loc><lastmod>2013-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-with-generalized-rabin-pairs-for-probabilistic-model-checking-and-ltl-synthesis-1304.5281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-with-generalized-rabin-pairs-for-probabilistic-model-checking-and-ltl-synthesis-1304.5281"/></url>
<url><loc>https://scifaro.com/en/abs/simple-strategies-for-banach-mazur-games-and-fairly-correct-systems-1304.5438</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-strategies-for-banach-mazur-games-and-fairly-correct-systems-1304.5438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-strategies-for-banach-mazur-games-and-fairly-correct-systems-1304.5438"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-based-comparisons-for-interpretations-in-description-logics-1304.5602</loc><lastmod>2013-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-based-comparisons-for-interpretations-in-description-logics-1304.5602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-based-comparisons-for-interpretations-in-description-logics-1304.5602"/></url>
<url><loc>https://scifaro.com/en/abs/fully-automated-shape-analysis-based-on-forest-automata-1304.5806</loc><lastmod>2013-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-automated-shape-analysis-based-on-forest-automata-1304.5806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-automated-shape-analysis-based-on-forest-automata-1304.5806"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-learning-programs-a-calculus-for-describing-epistemic-action-models-1304.6276</loc><lastmod>2016-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-learning-programs-a-calculus-for-describing-epistemic-action-models-1304.6276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-learning-programs-a-calculus-for-describing-epistemic-action-models-1304.6276"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculi-with-procedure-calls-1304.6279</loc><lastmod>2013-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculi-with-procedure-calls-1304.6279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculi-with-procedure-calls-1304.6279"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-verifying-regular-properties-on-flat-counter-systems-1304.6301</loc><lastmod>2013-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-verifying-regular-properties-on-flat-counter-systems-1304.6301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-verifying-regular-properties-on-flat-counter-systems-1304.6301"/></url>
<url><loc>https://scifaro.com/en/abs/improved-static-analysis-of-parameterised-boolean-equation-systems-using-control-flow-reconstruction-1304.6482</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-static-analysis-of-parameterised-boolean-equation-systems-using-control-flow-reconstruction-1304.6482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-static-analysis-of-parameterised-boolean-equation-systems-using-control-flow-reconstruction-1304.6482"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-the-linear-time-branching-time-spectrum-of-process-semantics-1304.6574</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-the-linear-time-branching-time-spectrum-of-process-semantics-1304.6574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-the-linear-time-branching-time-spectrum-of-process-semantics-1304.6574"/></url>
<url><loc>https://scifaro.com/en/abs/a-semantic-account-of-strong-normalization-in-linear-logic-1304.6762</loc><lastmod>2014-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-semantic-account-of-strong-normalization-in-linear-logic-1304.6762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-semantic-account-of-strong-normalization-in-linear-logic-1304.6762"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-matching-and-linear-programming-in-fixed-point-logic-with-counting-1304.6870</loc><lastmod>2013-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-matching-and-linear-programming-in-fixed-point-logic-with-counting-1304.6870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-matching-and-linear-programming-in-fixed-point-logic-with-counting-1304.6870"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-the-depth-size-and-number-of-subtrees-for-two-variable-logic-on-trees-1304.6925</loc><lastmod>2013-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-the-depth-size-and-number-of-subtrees-for-two-variable-logic-on-trees-1304.6925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-the-depth-size-and-number-of-subtrees-for-two-variable-logic-on-trees-1304.6925"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-semantics-for-a-modal-logic-close-to-s1-1304.6983</loc><lastmod>2014-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-semantics-for-a-modal-logic-close-to-s1-1304.6983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-semantics-for-a-modal-logic-close-to-s1-1304.6983"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1304.7123</loc><lastmod>2013-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1304.7123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1304.7123"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-the-two-variable-fragment-of-first-order-logic-over-trees-1304.7204</loc><lastmod>2014-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-the-two-variable-fragment-of-first-order-logic-over-trees-1304.7204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-the-two-variable-fragment-of-first-order-logic-over-trees-1304.7204"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-of-an-mitl-fragment-for-timed-automata-1304.7209</loc><lastmod>2013-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-of-an-mitl-fragment-for-timed-automata-1304.7209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-of-an-mitl-fragment-for-timed-automata-1304.7209"/></url>
<url><loc>https://scifaro.com/en/abs/a-static-analysis-framework-for-livelock-freedom-in-csp-1304.7394</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-static-analysis-framework-for-livelock-freedom-in-csp-1304.7394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-static-analysis-framework-for-livelock-freedom-in-csp-1304.7394"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-timed-specification-theory-ii-realisability-1304.7590</loc><lastmod>2013-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-timed-specification-theory-ii-realisability-1304.7590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-timed-specification-theory-ii-realisability-1304.7590"/></url>
<url><loc>https://scifaro.com/en/abs/a-step-indexing-approach-to-partial-functions-1304.7857</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-step-indexing-approach-to-partial-functions-1304.7857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-step-indexing-approach-to-partial-functions-1304.7857"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-stobjs-and-their-application-to-isa-modeling-1304.7858</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-stobjs-and-their-application-to-isa-modeling-1304.7858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-stobjs-and-their-application-to-isa-modeling-1304.7858"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-building-blocks-for-asynchronous-circuits-1304.7859</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-building-blocks-for-asynchronous-circuits-1304.7859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-building-blocks-for-asynchronous-circuits-1304.7859"/></url>
<url><loc>https://scifaro.com/en/abs/an-interpreter-for-quantum-circuits-1304.7860</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interpreter-for-quantum-circuits-1304.7860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interpreter-for-quantum-circuits-1304.7860"/></url>
<url><loc>https://scifaro.com/en/abs/verified-aig-algorithms-in-acl2-1304.7861</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-aig-algorithms-in-acl2-1304.7861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-aig-algorithms-in-acl2-1304.7861"/></url>
<url><loc>https://scifaro.com/en/abs/acl2-meets-the-gpu-formalizing-a-cuda-based-parallelizable-all-pairs-shortest-path-algorithm-in-acl2-1304.7863</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acl2-meets-the-gpu-formalizing-a-cuda-based-parallelizable-all-pairs-shortest-path-algorithm-in-acl2-1304.7863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acl2-meets-the-gpu-formalizing-a-cuda-based-parallelizable-all-pairs-shortest-path-algorithm-in-acl2-1304.7863"/></url>
<url><loc>https://scifaro.com/en/abs/a-macro-for-reusing-abstract-functions-and-theorems-1304.7875</loc><lastmod>2013-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-macro-for-reusing-abstract-functions-and-theorems-1304.7875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-macro-for-reusing-abstract-functions-and-theorems-1304.7875"/></url>
<url><loc>https://scifaro.com/en/abs/truth-versus-information-in-logic-programming-1305.0141</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truth-versus-information-in-logic-programming-1305.0141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truth-versus-information-in-logic-programming-1305.0141"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-semantic-finiteness-of-pushdown-processes-and-first-order-grammars-w-r-t-bisimulation-equivalence-1305.0516</loc><lastmod>2019-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-semantic-finiteness-of-pushdown-processes-and-first-order-grammars-w-r-t-bisimulation-equivalence-1305.0516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-semantic-finiteness-of-pushdown-processes-and-first-order-grammars-w-r-t-bisimulation-equivalence-1305.0516"/></url>
<url><loc>https://scifaro.com/en/abs/a-companion-of-relating-strong-behavioral-equivalences-for-processes-with-nondeterminism-and-probabilities-1305.0538</loc><lastmod>2013-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-companion-of-relating-strong-behavioral-equivalences-for-processes-with-nondeterminism-and-probabilities-1305.0538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-companion-of-relating-strong-behavioral-equivalences-for-processes-with-nondeterminism-and-probabilities-1305.0538"/></url>
<url><loc>https://scifaro.com/en/abs/well-pointed-coalgebras-1305.0576</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-pointed-coalgebras-1305.0576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-pointed-coalgebras-1305.0576"/></url>
<url><loc>https://scifaro.com/en/abs/on-guarded-transformation-in-the-modal-mu-calculus-1305.0648</loc><lastmod>2013-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-guarded-transformation-in-the-modal-mu-calculus-1305.0648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-guarded-transformation-in-the-modal-mu-calculus-1305.0648"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-cores-for-constraint-programming-1305.1690</loc><lastmod>2013-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-cores-for-constraint-programming-1305.1690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-cores-for-constraint-programming-1305.1690"/></url>
<url><loc>https://scifaro.com/en/abs/expressing-algorithms-as-concise-as-possible-via-computability-logic-1305.2004</loc><lastmod>2015-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressing-algorithms-as-concise-as-possible-via-computability-logic-1305.2004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressing-algorithms-as-concise-as-possible-via-computability-logic-1305.2004"/></url>
<url><loc>https://scifaro.com/en/abs/linear-logic-without-units-1305.2231</loc><lastmod>2013-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-logic-without-units-1305.2231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-logic-without-units-1305.2231"/></url>
<url><loc>https://scifaro.com/en/abs/an-epistemic-perspective-on-consistency-of-concurrent-computations-1305.2295</loc><lastmod>2013-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-epistemic-perspective-on-consistency-of-concurrent-computations-1305.2295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-epistemic-perspective-on-consistency-of-concurrent-computations-1305.2295"/></url>
<url><loc>https://scifaro.com/en/abs/time-estimation-model-of-concurrent-computing-systems-1305.2744</loc><lastmod>2013-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-estimation-model-of-concurrent-computing-systems-1305.2744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-estimation-model-of-concurrent-computing-systems-1305.2744"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-in-the-tableau-synthesis-framework-1305.3131</loc><lastmod>2013-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-in-the-tableau-synthesis-framework-1305.3131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-in-the-tableau-synthesis-framework-1305.3131"/></url>
<url><loc>https://scifaro.com/en/abs/the-unary-fragments-of-metric-interval-temporal-logic-bounded-versus-lower-bound-constraints-full-version-1305.3204</loc><lastmod>2013-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-unary-fragments-of-metric-interval-temporal-logic-bounded-versus-lower-bound-constraints-full-version-1305.3204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-unary-fragments-of-metric-interval-temporal-logic-bounded-versus-lower-bound-constraints-full-version-1305.3204"/></url>
<url><loc>https://scifaro.com/en/abs/admissibility-in-finitely-generated-quasivarieties-1305.3530</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/admissibility-in-finitely-generated-quasivarieties-1305.3530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/admissibility-in-finitely-generated-quasivarieties-1305.3530"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-techniques-for-verification-of-an-encryption-scheme-for-wireless-sensor-networks-1305.4247</loc><lastmod>2013-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-techniques-for-verification-of-an-encryption-scheme-for-wireless-sensor-networks-1305.4247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-techniques-for-verification-of-an-encryption-scheme-for-wireless-sensor-networks-1305.4247"/></url>
<url><loc>https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-i-1305.4912</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-i-1305.4912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-i-1305.4912"/></url>
<url><loc>https://scifaro.com/en/abs/fole-the-first-order-logical-environment-1305.5240</loc><lastmod>2013-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fole-the-first-order-logical-environment-1305.5240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fole-the-first-order-logical-environment-1305.5240"/></url>
<url><loc>https://scifaro.com/en/abs/graphic-lambda-calculus-1305.5786</loc><lastmod>2019-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphic-lambda-calculus-1305.5786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphic-lambda-calculus-1305.5786"/></url>
<url><loc>https://scifaro.com/en/abs/model-theoretic-characterisations-of-description-logics-1305.5820</loc><lastmod>2013-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-theoretic-characterisations-of-description-logics-1305.5820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-theoretic-characterisations-of-description-logics-1305.5820"/></url>
<url><loc>https://scifaro.com/en/abs/representation-and-duality-of-the-untyped-lambda-calculus-in-nominal-lattice-and-topological-semantics-with-a-proof-of-topological-completeness-1305.5968</loc><lastmod>2016-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-and-duality-of-the-untyped-lambda-calculus-in-nominal-lattice-and-topological-semantics-with-a-proof-of-topological-completeness-1305.5968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-and-duality-of-the-untyped-lambda-calculus-in-nominal-lattice-and-topological-semantics-with-a-proof-of-topological-completeness-1305.5968"/></url>
<url><loc>https://scifaro.com/en/abs/the-formalization-of-syntax-based-mathematical-algorithms-using-quotation-and-evaluation-1305.6052</loc><lastmod>2013-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-formalization-of-syntax-based-mathematical-algorithms-using-quotation-and-evaluation-1305.6052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-formalization-of-syntax-based-mathematical-algorithms-using-quotation-and-evaluation-1305.6052"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-new-notion-of-partial-refinement-1305.6110</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-new-notion-of-partial-refinement-1305.6110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-new-notion-of-partial-refinement-1305.6110"/></url>
<url><loc>https://scifaro.com/en/abs/data-refinement-for-true-concurrency-1305.6111</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-refinement-for-true-concurrency-1305.6111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-refinement-for-true-concurrency-1305.6111"/></url>
<url><loc>https://scifaro.com/en/abs/refining-scj-mission-specifications-into-parallel-handler-designs-1305.6113</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-scj-mission-specifications-into-parallel-handler-designs-1305.6113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-scj-mission-specifications-into-parallel-handler-designs-1305.6113"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-and-refinement-for-hybrid-ised-logics-1305.6115</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-and-refinement-for-hybrid-ised-logics-1305.6115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-and-refinement-for-hybrid-ised-logics-1305.6115"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-and-complexity-of-some-fragments-of-metric-temporal-logic-1305.6137</loc><lastmod>2013-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-and-complexity-of-some-fragments-of-metric-temporal-logic-1305.6137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-and-complexity-of-some-fragments-of-metric-temporal-logic-1305.6137"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-1305.6184</loc><lastmod>2013-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-1305.6184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-1305.6184"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-out-of-context-nominal-absolute-denotations-for-first-order-logic-and-computation-1305.6291</loc><lastmod>2026-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-out-of-context-nominal-absolute-denotations-for-first-order-logic-and-computation-1305.6291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-out-of-context-nominal-absolute-denotations-for-first-order-logic-and-computation-1305.6291"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-machine-code-safe-from-hardware-aliasing-risc-is-not-necessarily-risky-1305.6431</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-machine-code-safe-from-hardware-aliasing-risc-is-not-necessarily-risky-1305.6431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-machine-code-safe-from-hardware-aliasing-risc-is-not-necessarily-risky-1305.6431"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-reduction-and-analysis-of-markov-automata-extended-version-1305.7050</loc><lastmod>2013-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-reduction-and-analysis-of-markov-automata-extended-version-1305.7050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-reduction-and-analysis-of-markov-automata-extended-version-1305.7050"/></url>
<url><loc>https://scifaro.com/en/abs/computations-by-fly-automata-beyond-monadic-second-order-logic-1305.7120</loc><lastmod>2015-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computations-by-fly-automata-beyond-monadic-second-order-logic-1305.7120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computations-by-fly-automata-beyond-monadic-second-order-logic-1305.7120"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-verification-and-optimization-of-interactive-markov-chains-1305.7332</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-verification-and-optimization-of-interactive-markov-chains-1305.7332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-verification-and-optimization-of-interactive-markov-chains-1305.7332"/></url>
<url><loc>https://scifaro.com/en/abs/pervasive-parallelism-in-highly-trustable-interactive-theorem-proving-systems-1305.7360</loc><lastmod>2013-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pervasive-parallelism-in-highly-trustable-interactive-theorem-proving-systems-1305.7360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pervasive-parallelism-in-highly-trustable-interactive-theorem-proving-systems-1305.7360"/></url>
<url><loc>https://scifaro.com/en/abs/contract-agreements-via-logic-1306.0026</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contract-agreements-via-logic-1306.0026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contract-agreements-via-logic-1306.0026"/></url>
<url><loc>https://scifaro.com/en/abs/hennessy-milner-logic-with-greatest-fixed-points-as-a-complete-behavioural-specification-theory-1306.0741</loc><lastmod>2013-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hennessy-milner-logic-with-greatest-fixed-points-as-a-complete-behavioural-specification-theory-1306.0741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hennessy-milner-logic-with-greatest-fixed-points-as-a-complete-behavioural-specification-theory-1306.0741"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-of-three-circles-in-coq-1306.0783</loc><lastmod>2013-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-of-three-circles-in-coq-1306.0783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-of-three-circles-in-coq-1306.0783"/></url>
<url><loc>https://scifaro.com/en/abs/a-certified-reduction-strategy-for-homological-image-processing-1306.0806</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-certified-reduction-strategy-for-homological-image-processing-1306.0806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-certified-reduction-strategy-for-homological-image-processing-1306.0806"/></url>
<url><loc>https://scifaro.com/en/abs/rulerunner-technical-report-1306.0810</loc><lastmod>2013-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rulerunner-technical-report-1306.0810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rulerunner-technical-report-1306.0810"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-ctl-with-constraints-1306.0814</loc><lastmod>2013-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-ctl-with-constraints-1306.0814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-ctl-with-constraints-1306.0814"/></url>
<url><loc>https://scifaro.com/en/abs/certified-hlints-with-isabelle-holcf-prelude-1306.1340</loc><lastmod>2013-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-hlints-with-isabelle-holcf-prelude-1306.1340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-hlints-with-isabelle-holcf-prelude-1306.1340"/></url>
<url><loc>https://scifaro.com/en/abs/ccs-for-trees-1306.1714</loc><lastmod>2013-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ccs-for-trees-1306.1714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ccs-for-trees-1306.1714"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-abstraction-in-smt-based-unbounded-software-model-checking-1306.1945</loc><lastmod>2013-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-abstraction-in-smt-based-unbounded-software-model-checking-1306.1945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-abstraction-in-smt-based-unbounded-software-model-checking-1306.1945"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-logic-amalgam-of-classical-and-intuitionistic-propositional-logic-1306.2068</loc><lastmod>2015-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-logic-amalgam-of-classical-and-intuitionistic-propositional-logic-1306.2068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-logic-amalgam-of-classical-and-intuitionistic-propositional-logic-1306.2068"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-of-an-extension-of-combinatory-logic-by-boolean-constants-1306.2069</loc><lastmod>2017-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-of-an-extension-of-combinatory-logic-by-boolean-constants-1306.2069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-of-an-extension-of-combinatory-logic-by-boolean-constants-1306.2069"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-variability-of-metric-temporal-logic-1306.2141</loc><lastmod>2015-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-variability-of-metric-temporal-logic-1306.2141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-variability-of-metric-temporal-logic-1306.2141"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1306.2413</loc><lastmod>2013-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1306.2413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1306.2413"/></url>
<url><loc>https://scifaro.com/en/abs/enhancing-unsatisfiable-cores-for-ltl-with-information-on-temporal-relevance-1306.2694</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enhancing-unsatisfiable-cores-for-ltl-with-information-on-temporal-relevance-1306.2694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enhancing-unsatisfiable-cores-for-ltl-with-information-on-temporal-relevance-1306.2694"/></url>
<url><loc>https://scifaro.com/en/abs/modal-specifications-for-probabilistic-timed-systems-1306.2695</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-specifications-for-probabilistic-timed-systems-1306.2695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-specifications-for-probabilistic-timed-systems-1306.2695"/></url>
<url><loc>https://scifaro.com/en/abs/the-spectrum-of-strong-behavioral-equivalences-for-nondeterministic-and-probabilistic-processes-1306.2696</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-spectrum-of-strong-behavioral-equivalences-for-nondeterministic-and-probabilistic-processes-1306.2696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-spectrum-of-strong-behavioral-equivalences-for-nondeterministic-and-probabilistic-processes-1306.2696"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-concurrent-kleene-algebra-1306.2697</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-concurrent-kleene-algebra-1306.2697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-concurrent-kleene-algebra-1306.2697"/></url>
<url><loc>https://scifaro.com/en/abs/solving-parity-games-on-integer-vectors-1306.2806</loc><lastmod>2013-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-parity-games-on-integer-vectors-1306.2806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-parity-games-on-integer-vectors-1306.2806"/></url>
<url><loc>https://scifaro.com/en/abs/modal-interface-automata-1306.3050</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-interface-automata-1306.3050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-interface-automata-1306.3050"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-quantifier-free-dynamic-complexity-of-reachability-1306.3056</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-quantifier-free-dynamic-complexity-of-reachability-1306.3056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-quantifier-free-dynamic-complexity-of-reachability-1306.3056"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-with-converse-and-repeat-for-message-passing-systems-1306.3059</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-with-converse-and-repeat-for-message-passing-systems-1306.3059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-with-converse-and-repeat-for-message-passing-systems-1306.3059"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-machine-for-biform-theory-graphs-1306.3198</loc><lastmod>2013-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-machine-for-biform-theory-graphs-1306.3198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-machine-for-biform-theory-graphs-1306.3198"/></url>
<url><loc>https://scifaro.com/en/abs/the-mmt-api-a-generic-mkm-system-1306.3199</loc><lastmod>2013-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mmt-api-a-generic-mkm-system-1306.3199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mmt-api-a-generic-mkm-system-1306.3199"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-note-on-two-variable-logic-with-a-linear-order-successor-and-a-preorder-successor-1306.3418</loc><lastmod>2013-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-note-on-two-variable-logic-with-a-linear-order-successor-and-a-preorder-successor-1306.3418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-note-on-two-variable-logic-with-a-linear-order-successor-and-a-preorder-successor-1306.3418"/></url>
<url><loc>https://scifaro.com/en/abs/efsmt-a-logical-framework-for-cyber-physical-systems-1306.3456</loc><lastmod>2013-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efsmt-a-logical-framework-for-cyber-physical-systems-1306.3456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efsmt-a-logical-framework-for-cyber-physical-systems-1306.3456"/></url>
<url><loc>https://scifaro.com/en/abs/the-size-change-termination-principle-for-constructor-based-languages-1306.3833</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-size-change-termination-principle-for-constructor-based-languages-1306.3833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-size-change-termination-principle-for-constructor-based-languages-1306.3833"/></url>
<url><loc>https://scifaro.com/en/abs/certified-impossibility-results-for-byzantine-tolerant-mobile-robots-1306.4242</loc><lastmod>2013-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-impossibility-results-for-byzantine-tolerant-mobile-robots-1306.4242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-impossibility-results-for-byzantine-tolerant-mobile-robots-1306.4242"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-approach-to-modular-design-of-synthetic-biological-circuits-1306.4493</loc><lastmod>2013-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-approach-to-modular-design-of-synthetic-biological-circuits-1306.4493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-approach-to-modular-design-of-synthetic-biological-circuits-1306.4493"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-clausal-fragments-of-ltl-1306.5088</loc><lastmod>2013-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-clausal-fragments-of-ltl-1306.5088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-clausal-fragments-of-ltl-1306.5088"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-of-a-non-deterministic-type-isomorphic-lambda-calculus-1306.5089</loc><lastmod>2014-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-of-a-non-deterministic-type-isomorphic-lambda-calculus-1306.5089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-of-a-non-deterministic-type-isomorphic-lambda-calculus-1306.5089"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-program-verification-as-satisfiability-modulo-theories-with-algebraic-data-types-1306.5264</loc><lastmod>2013-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-program-verification-as-satisfiability-modulo-theories-with-algebraic-data-types-1306.5264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-program-verification-as-satisfiability-modulo-theories-with-algebraic-data-types-1306.5264"/></url>
<url><loc>https://scifaro.com/en/abs/variable-and-clause-elimination-for-ltl-satisfiability-checking-1306.5539</loc><lastmod>2013-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-and-clause-elimination-for-ltl-satisfiability-checking-1306.5539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-and-clause-elimination-for-ltl-satisfiability-checking-1306.5539"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-and-completeness-of-the-nrb-verification-logic-1306.5585</loc><lastmod>2018-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-and-completeness-of-the-nrb-verification-logic-1306.5585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-and-completeness-of-the-nrb-verification-logic-1306.5585"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-of-security-1306.5678</loc><lastmod>2013-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-of-security-1306.5678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-of-security-1306.5678"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-approximate-model-counter-1306.5726</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-approximate-model-counter-1306.5726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-approximate-model-counter-1306.5726"/></url>
<url><loc>https://scifaro.com/en/abs/un-decidability-results-for-word-equations-with-length-and-regular-expression-constraints-1306.6054</loc><lastmod>2013-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/un-decidability-results-for-word-equations-with-length-and-regular-expression-constraints-1306.6054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/un-decidability-results-for-word-equations-with-length-and-regular-expression-constraints-1306.6054"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-treatment-of-infinitary-rewriting-1306.6224</loc><lastmod>2014-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-treatment-of-infinitary-rewriting-1306.6224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-treatment-of-infinitary-rewriting-1306.6224"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-for-hyperproperties-1306.6657</loc><lastmod>2013-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-for-hyperproperties-1306.6657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-for-hyperproperties-1306.6657"/></url>
<url><loc>https://scifaro.com/en/abs/annotation-free-sequent-calculi-for-full-intuitionistic-linear-logic-extended-version-1307.0289</loc><lastmod>2013-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/annotation-free-sequent-calculi-for-full-intuitionistic-linear-logic-extended-version-1307.0289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/annotation-free-sequent-calculi-for-full-intuitionistic-linear-logic-extended-version-1307.0289"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-updates-on-algebras-1307.0417</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-updates-on-algebras-1307.0417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-updates-on-algebras-1307.0417"/></url>
<url><loc>https://scifaro.com/en/abs/scalability-using-effects-1307.0489</loc><lastmod>2013-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalability-using-effects-1307.0489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalability-using-effects-1307.0489"/></url>
<url><loc>https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-long-version-1307.0550</loc><lastmod>2013-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-long-version-1307.0550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-long-version-1307.0550"/></url>
<url><loc>https://scifaro.com/en/abs/incarnation-in-ludics-and-maximal-cliques-of-paths-1307.1028</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incarnation-in-ludics-and-maximal-cliques-of-paths-1307.1028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incarnation-in-ludics-and-maximal-cliques-of-paths-1307.1028"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-user-interfaces-for-theorem-provers-1307.1528</loc><lastmod>2013-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-user-interfaces-for-theorem-provers-1307.1528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-user-interfaces-for-theorem-provers-1307.1528"/></url>
<url><loc>https://scifaro.com/en/abs/towards-extracting-explicit-proofs-from-totality-checking-in-twelf-1307.1738</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-extracting-explicit-proofs-from-totality-checking-in-twelf-1307.1738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-extracting-explicit-proofs-from-totality-checking-in-twelf-1307.1738"/></url>
<url><loc>https://scifaro.com/en/abs/towards-synthetic-descriptive-set-theory-an-instantiation-with-represented-spaces-1307.1850</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-synthetic-descriptive-set-theory-an-instantiation-with-represented-spaces-1307.1850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-synthetic-descriptive-set-theory-an-instantiation-with-represented-spaces-1307.1850"/></url>
<url><loc>https://scifaro.com/en/abs/prooftool-a-gui-for-the-gapt-framework-1307.1942</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prooftool-a-gui-for-the-gapt-framework-1307.1942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prooftool-a-gui-for-the-gapt-framework-1307.1942"/></url>
<url><loc>https://scifaro.com/en/abs/read-eval-print-in-parallel-and-asynchronous-proof-checking-1307.1944</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/read-eval-print-in-parallel-and-asynchronous-proof-checking-1307.1944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/read-eval-print-in-parallel-and-asynchronous-proof-checking-1307.1944"/></url>
<url><loc>https://scifaro.com/en/abs/imperative-programs-as-proofs-via-game-semantics-1307.2004</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imperative-programs-as-proofs-via-game-semantics-1307.2004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imperative-programs-as-proofs-via-game-semantics-1307.2004"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-proof-transformation-for-compression-and-interpolation-1307.2028</loc><lastmod>2014-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-proof-transformation-for-compression-and-interpolation-1307.2028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-proof-transformation-for-compression-and-interpolation-1307.2028"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-the-expressive-power-of-the-synchronous-and-the-asynchronous-pi-calculi-1307.2062</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-the-expressive-power-of-the-synchronous-and-the-asynchronous-pi-calculi-1307.2062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-the-expressive-power-of-the-synchronous-and-the-asynchronous-pi-calculi-1307.2062"/></url>
<url><loc>https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-1307.2145</loc><lastmod>2013-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-1307.2145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-1307.2145"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-gsos-rules-and-a-modular-treatment-of-recursive-definitions-1307.2538</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-gsos-rules-and-a-modular-treatment-of-recursive-definitions-1307.2538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-gsos-rules-and-a-modular-treatment-of-recursive-definitions-1307.2538"/></url>
<url><loc>https://scifaro.com/en/abs/priced-timed-petri-nets-1307.2570</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priced-timed-petri-nets-1307.2570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priced-timed-petri-nets-1307.2570"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-hiproofs-in-hol-light-1307.2713</loc><lastmod>2013-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-hiproofs-in-hol-light-1307.2713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-hiproofs-in-hol-light-1307.2713"/></url>
<url><loc>https://scifaro.com/en/abs/indexed-induction-and-coinduction-fibrationally-1307.3263</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indexed-induction-and-coinduction-fibrationally-1307.3263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indexed-induction-and-coinduction-fibrationally-1307.3263"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-time-complexity-of-deterministic-turing-machines-1307.3648</loc><lastmod>2019-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-time-complexity-of-deterministic-turing-machines-1307.3648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-time-complexity-of-deterministic-turing-machines-1307.3648"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-presentation-of-the-effective-topos-1307.3832</loc><lastmod>2013-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-presentation-of-the-effective-topos-1307.3832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-presentation-of-the-effective-topos-1307.3832"/></url>
<url><loc>https://scifaro.com/en/abs/branching-time-model-checking-gap-order-constraint-systems-extended-version-1307.4207</loc><lastmod>2015-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-time-model-checking-gap-order-constraint-systems-extended-version-1307.4207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-time-model-checking-gap-order-constraint-systems-extended-version-1307.4207"/></url>
<url><loc>https://scifaro.com/en/abs/zielonka-s-recursive-algorithm-dull-weak-and-solitaire-games-and-tighter-bounds-1307.4465</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zielonka-s-recursive-algorithm-dull-weak-and-solitaire-games-and-tighter-bounds-1307.4465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zielonka-s-recursive-algorithm-dull-weak-and-solitaire-games-and-tighter-bounds-1307.4465"/></url>
<url><loc>https://scifaro.com/en/abs/a-faster-tableau-for-ctl-1307.4468</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faster-tableau-for-ctl-1307.4468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faster-tableau-for-ctl-1307.4468"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-satisfiability-of-mitl-specifications-1307.4469</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-satisfiability-of-mitl-specifications-1307.4469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-satisfiability-of-mitl-specifications-1307.4469"/></url>
<url><loc>https://scifaro.com/en/abs/improving-hyltl-model-checking-of-hybrid-systems-1307.4470</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-hyltl-model-checking-of-hybrid-systems-1307.4470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-hyltl-model-checking-of-hybrid-systems-1307.4470"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-automata-and-monadic-second-order-logic-1307.4472</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-automata-and-monadic-second-order-logic-1307.4472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-automata-and-monadic-second-order-logic-1307.4472"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-atl-with-strategy-contexts-1307.4478</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-atl-with-strategy-contexts-1307.4478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-atl-with-strategy-contexts-1307.4478"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-coalitional-games-in-shortage-resource-scenarios-1307.4479</loc><lastmod>2013-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-coalitional-games-in-shortage-resource-scenarios-1307.4479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-coalitional-games-in-shortage-resource-scenarios-1307.4479"/></url>
<url><loc>https://scifaro.com/en/abs/relation-lifting-with-an-application-to-the-many-valued-cover-modality-1307.4682</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-lifting-with-an-application-to-the-many-valued-cover-modality-1307.4682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-lifting-with-an-application-to-the-many-valued-cover-modality-1307.4682"/></url>
<url><loc>https://scifaro.com/en/abs/triggered-clause-pushing-for-ic3-1307.4966</loc><lastmod>2013-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/triggered-clause-pushing-for-ic3-1307.4966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/triggered-clause-pushing-for-ic3-1307.4966"/></url>
<url><loc>https://scifaro.com/en/abs/homology-and-bisimulation-of-asynchronous-transition-systems-and-petri-nets-1307.5377</loc><lastmod>2023-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homology-and-bisimulation-of-asynchronous-transition-systems-and-petri-nets-1307.5377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homology-and-bisimulation-of-asynchronous-transition-systems-and-petri-nets-1307.5377"/></url>
<url><loc>https://scifaro.com/en/abs/proof-search-for-propositional-abstract-separation-logics-via-labelled-sequents-1307.5592</loc><lastmod>2013-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-search-for-propositional-abstract-separation-logics-via-labelled-sequents-1307.5592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-search-for-propositional-abstract-separation-logics-via-labelled-sequents-1307.5592"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-closed-2-categories-and-permutation-equivalence-in-higher-order-rewriting-1307.6318</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-closed-2-categories-and-permutation-equivalence-in-higher-order-rewriting-1307.6318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-closed-2-categories-and-permutation-equivalence-in-higher-order-rewriting-1307.6318"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-from-knowledge-based-specifications-1307.6333</loc><lastmod>2013-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-from-knowledge-based-specifications-1307.6333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-from-knowledge-based-specifications-1307.6333"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-partitioned-global-address-spaces-1307.6590</loc><lastmod>2013-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-partitioned-global-address-spaces-1307.6590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-partitioned-global-address-spaces-1307.6590"/></url>
<url><loc>https://scifaro.com/en/abs/simplifying-proofs-of-linearisability-using-layers-of-abstraction-1307.6958</loc><lastmod>2013-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplifying-proofs-of-linearisability-using-layers-of-abstraction-1307.6958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplifying-proofs-of-linearisability-using-layers-of-abstraction-1307.6958"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-proportion-of-hard-instances-of-the-halting-problem-1307.7066</loc><lastmod>2014-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-proportion-of-hard-instances-of-the-halting-problem-1307.7066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-proportion-of-hard-instances-of-the-halting-problem-1307.7066"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-structure-of-combined-traces-1307.7296</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-structure-of-combined-traces-1307.7296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-structure-of-combined-traces-1307.7296"/></url>
<url><loc>https://scifaro.com/en/abs/towards-meta-reasoning-in-the-concurrent-logical-framework-clf-1307.7440</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-meta-reasoning-in-the-concurrent-logical-framework-clf-1307.7440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-meta-reasoning-in-the-concurrent-logical-framework-clf-1307.7440"/></url>
<url><loc>https://scifaro.com/en/abs/adding-priority-to-event-structures-1307.7441</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-priority-to-event-structures-1307.7441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-priority-to-event-structures-1307.7441"/></url>
<url><loc>https://scifaro.com/en/abs/compositionality-of-approximate-bisimulation-for-probabilistic-systems-1307.7442</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositionality-of-approximate-bisimulation-for-probabilistic-systems-1307.7442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositionality-of-approximate-bisimulation-for-probabilistic-systems-1307.7442"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-meta-theory-of-processes-with-data-1307.7444</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-meta-theory-of-processes-with-data-1307.7444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-meta-theory-of-processes-with-data-1307.7444"/></url>
<url><loc>https://scifaro.com/en/abs/the-categorical-limit-of-a-sequence-of-dynamical-systems-1307.7445</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-categorical-limit-of-a-sequence-of-dynamical-systems-1307.7445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-categorical-limit-of-a-sequence-of-dynamical-systems-1307.7445"/></url>
<url><loc>https://scifaro.com/en/abs/meta-sos-a-maude-based-sos-meta-theory-framework-1307.7446</loc><lastmod>2013-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meta-sos-a-maude-based-sos-meta-theory-framework-1307.7446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meta-sos-a-maude-based-sos-meta-theory-framework-1307.7446"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-logic-programming-via-choice-disjunctive-clauses-1307.7505</loc><lastmod>2015-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-logic-programming-via-choice-disjunctive-clauses-1307.7505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-logic-programming-via-choice-disjunctive-clauses-1307.7505"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-in-linguistic-propositional-logic-based-on-linear-symmetrical-hedge-algebra-1307.7661</loc><lastmod>2013-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-in-linguistic-propositional-logic-based-on-linear-symmetrical-hedge-algebra-1307.7661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-in-linguistic-propositional-logic-based-on-linear-symmetrical-hedge-algebra-1307.7661"/></url>
<url><loc>https://scifaro.com/en/abs/characterisation-of-strongly-normalising-lambda-mu-terms-1307.8202</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterisation-of-strongly-normalising-lambda-mu-terms-1307.8202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterisation-of-strongly-normalising-lambda-mu-terms-1307.8202"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-normalization-time-through-intersection-types-1307.8205</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-normalization-time-through-intersection-types-1307.8205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-normalization-time-through-intersection-types-1307.8205"/></url>
<url><loc>https://scifaro.com/en/abs/toward-isomorphism-of-intersection-and-union-types-1307.8206</loc><lastmod>2015-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-isomorphism-of-intersection-and-union-types-1307.8206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-isomorphism-of-intersection-and-union-types-1307.8206"/></url>
<url><loc>https://scifaro.com/en/abs/formal-probabilistic-analysis-of-a-wireless-sensor-network-for-forest-fire-detection-1307.8208</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-probabilistic-analysis-of-a-wireless-sensor-network-for-forest-fire-detection-1307.8208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-probabilistic-analysis-of-a-wireless-sensor-network-for-forest-fire-detection-1307.8208"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-a-proof-procedure-for-the-description-logic-alc-1307.8211</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-a-proof-procedure-for-the-description-logic-alc-1307.8211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-a-proof-procedure-for-the-description-logic-alc-1307.8211"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-general-framework-for-formal-reasoning-about-java-bytecode-transformation-1307.8212</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-general-framework-for-formal-reasoning-about-java-bytecode-transformation-1307.8212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-general-framework-for-formal-reasoning-about-java-bytecode-transformation-1307.8212"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-soft-errors-using-theorem-proving-1307.8213</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-soft-errors-using-theorem-proving-1307.8213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-soft-errors-using-theorem-proving-1307.8213"/></url>
<url><loc>https://scifaro.com/en/abs/performing-implicit-induction-reasoning-with-certifying-proof-environments-1307.8214</loc><lastmod>2013-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performing-implicit-induction-reasoning-with-certifying-proof-environments-1307.8214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performing-implicit-induction-reasoning-with-certifying-proof-environments-1307.8214"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-verification-of-a-wimax-design-using-symbolic-simulation-1308.0209</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-verification-of-a-wimax-design-using-symbolic-simulation-1308.0209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-verification-of-a-wimax-design-using-symbolic-simulation-1308.0209"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-automated-specification-and-verification-of-web-systems-1308.0268</loc><lastmod>2013-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-automated-specification-and-verification-of-web-systems-1308.0268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-automated-specification-and-verification-of-web-systems-1308.0268"/></url>
<url><loc>https://scifaro.com/en/abs/expansion-trees-with-cut-1308.0428</loc><lastmod>2013-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expansion-trees-with-cut-1308.0428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expansion-trees-with-cut-1308.0428"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-sequential-circuits-by-tests-as-proofs-paradigm-1308.0583</loc><lastmod>2013-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-sequential-circuits-by-tests-as-proofs-paradigm-1308.0583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-sequential-circuits-by-tests-as-proofs-paradigm-1308.0583"/></url>
<url><loc>https://scifaro.com/en/abs/measure-transformer-semantics-for-bayesian-machine-learning-1308.0689</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measure-transformer-semantics-for-bayesian-machine-learning-1308.0689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measure-transformer-semantics-for-bayesian-machine-learning-1308.0689"/></url>
<url><loc>https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1308.1034</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1308.1034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/term-graph-representations-for-cyclic-lambda-terms-1308.1034"/></url>
<url><loc>https://scifaro.com/en/abs/the-vectorial-lambda-calculus-1308.1138</loc><lastmod>2017-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vectorial-lambda-calculus-1308.1138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vectorial-lambda-calculus-1308.1138"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-characterizations-of-context-free-languages-1308.1228</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-characterizations-of-context-free-languages-1308.1228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-characterizations-of-context-free-languages-1308.1228"/></url>
<url><loc>https://scifaro.com/en/abs/category-of-asynchronous-systems-and-polygonal-morphisms-1308.1443</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/category-of-asynchronous-systems-and-polygonal-morphisms-1308.1443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/category-of-asynchronous-systems-and-polygonal-morphisms-1308.1443"/></url>
<url><loc>https://scifaro.com/en/abs/universal-codes-of-the-natural-numbers-1308.1600</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-codes-of-the-natural-numbers-1308.1600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-codes-of-the-natural-numbers-1308.1600"/></url>
<url><loc>https://scifaro.com/en/abs/proof-pattern-recognition-and-lemma-discovery-in-acl2-1308.1780</loc><lastmod>2013-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-pattern-recognition-and-lemma-discovery-in-acl2-1308.1780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-pattern-recognition-and-lemma-discovery-in-acl2-1308.1780"/></url>
<url><loc>https://scifaro.com/en/abs/some-notes-on-model-rotation-1308.2142</loc><lastmod>2014-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-notes-on-model-rotation-1308.2142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-notes-on-model-rotation-1308.2142"/></url>
<url><loc>https://scifaro.com/en/abs/frameworks-for-reasoning-about-syntax-that-utilize-quotation-and-evaluation-1308.2149</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frameworks-for-reasoning-about-syntax-that-utilize-quotation-and-evaluation-1308.2149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frameworks-for-reasoning-about-syntax-that-utilize-quotation-and-evaluation-1308.2149"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-under-contextual-locking-1308.2349</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-under-contextual-locking-1308.2349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-under-contextual-locking-1308.2349"/></url>
<url><loc>https://scifaro.com/en/abs/linearizability-with-ownership-transfer-1308.2507</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearizability-with-ownership-transfer-1308.2507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearizability-with-ownership-transfer-1308.2507"/></url>
<url><loc>https://scifaro.com/en/abs/induction-in-algebra-a-first-case-study-1308.2690</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-in-algebra-a-first-case-study-1308.2690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-in-algebra-a-first-case-study-1308.2690"/></url>
<url><loc>https://scifaro.com/en/abs/connection-matrices-and-the-definability-of-graph-parameters-1308.3654</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connection-matrices-and-the-definability-of-graph-parameters-1308.3654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connection-matrices-and-the-definability-of-graph-parameters-1308.3654"/></url>
<url><loc>https://scifaro.com/en/abs/on-obdds-for-cnfs-of-bounded-treewidth-1308.3829</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-obdds-for-cnfs-of-bounded-treewidth-1308.3829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-obdds-for-cnfs-of-bounded-treewidth-1308.3829"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-approximation-of-well-founded-justification-and-well-founded-domination-corrected-and-extended-version-1308.3923</loc><lastmod>2013-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-approximation-of-well-founded-justification-and-well-founded-domination-corrected-and-extended-version-1308.3923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-approximation-of-well-founded-justification-and-well-founded-domination-corrected-and-extended-version-1308.3923"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-problem-for-weak-multi-pushdown-automata-1308.3996</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-problem-for-weak-multi-pushdown-automata-1308.3996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-problem-for-weak-multi-pushdown-automata-1308.3996"/></url>
<url><loc>https://scifaro.com/en/abs/counter-strategy-guided-refinement-of-gr-1-temporal-logic-specifications-1308.4113</loc><lastmod>2013-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counter-strategy-guided-refinement-of-gr-1-temporal-logic-specifications-1308.4113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counter-strategy-guided-refinement-of-gr-1-temporal-logic-specifications-1308.4113"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-effective-decision-procedure-for-ltl-formulas-with-constraints-1308.4171</loc><lastmod>2013-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-effective-decision-procedure-for-ltl-formulas-with-constraints-1308.4171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-effective-decision-procedure-for-ltl-formulas-with-constraints-1308.4171"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-mechanization-and-automation-of-g-odel-s-proof-of-god-s-existence-1308.4526</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-mechanization-and-automation-of-g-odel-s-proof-of-god-s-existence-1308.4526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-mechanization-and-automation-of-g-odel-s-proof-of-god-s-existence-1308.4526"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-multiple-boolean-functions-using-interpolation-on-a-single-proof-1308.4767</loc><lastmod>2013-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-multiple-boolean-functions-using-interpolation-on-a-single-proof-1308.4767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-multiple-boolean-functions-using-interpolation-on-a-single-proof-1308.4767"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-games-for-branching-time-logics-1308.5165</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-games-for-branching-time-logics-1308.5165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-games-for-branching-time-logics-1308.5165"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-with-uncertainty-1308.5329</loc><lastmod>2013-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-with-uncertainty-1308.5329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-with-uncertainty-1308.5329"/></url>
<url><loc>https://scifaro.com/en/abs/hyltl-a-temporal-logic-for-model-checking-hybrid-systems-1308.5336</loc><lastmod>2013-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyltl-a-temporal-logic-for-model-checking-hybrid-systems-1308.5336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyltl-a-temporal-logic-for-model-checking-hybrid-systems-1308.5336"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-algebraic-theories-1308.5409</loc><lastmod>2013-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-algebraic-theories-1308.5409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-algebraic-theories-1308.5409"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-resolution-1308.5608</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-resolution-1308.5608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-resolution-1308.5608"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-workshop-on-fixed-points-in-computer-science-1308.5896</loc><lastmod>2013-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-workshop-on-fixed-points-in-computer-science-1308.5896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-workshop-on-fixed-points-in-computer-science-1308.5896"/></url>
<url><loc>https://scifaro.com/en/abs/herding-cats-modelling-simulation-testing-and-data-mining-for-weak-memory-1308.6810</loc><lastmod>2014-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/herding-cats-modelling-simulation-testing-and-data-mining-for-weak-memory-1308.6810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/herding-cats-modelling-simulation-testing-and-data-mining-for-weak-memory-1308.6810"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-interactive-rule-based-configuration-systems-additional-material-1309.0065</loc><lastmod>2014-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-interactive-rule-based-configuration-systems-additional-material-1309.0065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-interactive-rule-based-configuration-systems-additional-material-1309.0065"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-translation-of-pi-calculus-fcps-to-safe-petri-nets-1309.0717</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-translation-of-pi-calculus-fcps-to-safe-petri-nets-1309.0717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-translation-of-pi-calculus-fcps-to-safe-petri-nets-1309.0717"/></url>
<url><loc>https://scifaro.com/en/abs/bases-as-coalgebras-1309.0844</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bases-as-coalgebras-1309.0844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bases-as-coalgebras-1309.0844"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-robustness-of-temporal-properties-for-stochastic-models-1309.0866</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-robustness-of-temporal-properties-for-stochastic-models-1309.0866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-robustness-of-temporal-properties-for-stochastic-models-1309.0866"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-analysis-for-value-freezing-signal-temporal-logic-1309.0867</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-analysis-for-value-freezing-signal-temporal-logic-1309.0867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-analysis-for-value-freezing-signal-temporal-logic-1309.0867"/></url>
<url><loc>https://scifaro.com/en/abs/falsifying-oscillation-properties-of-parametric-biological-models-1309.0869</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/falsifying-oscillation-properties-of-parametric-biological-models-1309.0869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/falsifying-oscillation-properties-of-parametric-biological-models-1309.0869"/></url>
<url><loc>https://scifaro.com/en/abs/non-monotonic-pre-fixed-points-and-learning-1309.0890</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-monotonic-pre-fixed-points-and-learning-1309.0890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-monotonic-pre-fixed-points-and-learning-1309.0890"/></url>
<url><loc>https://scifaro.com/en/abs/from-branching-to-linear-time-coalgebraically-1309.0891</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-branching-to-linear-time-coalgebraically-1309.0891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-branching-to-linear-time-coalgebraically-1309.0891"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-1309.0892</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-1309.0892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-1309.0892"/></url>
<url><loc>https://scifaro.com/en/abs/the-fixed-point-theory-of-strictly-contracting-functions-on-generalized-ultrametric-semilattices-1309.0894</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fixed-point-theory-of-strictly-contracting-functions-on-generalized-ultrametric-semilattices-1309.0894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fixed-point-theory-of-strictly-contracting-functions-on-generalized-ultrametric-semilattices-1309.0894"/></url>
<url><loc>https://scifaro.com/en/abs/guard-your-daggers-and-traces-on-the-equational-properties-of-guarded-co-recursion-1309.0895</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guard-your-daggers-and-traces-on-the-equational-properties-of-guarded-co-recursion-1309.0895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guard-your-daggers-and-traces-on-the-equational-properties-of-guarded-co-recursion-1309.0895"/></url>
<url><loc>https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1309.0896</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1309.0896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1309.0896"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-control-operators-and-their-semantics-1309.0924</loc><lastmod>2013-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-control-operators-and-their-semantics-1309.0924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-control-operators-and-their-semantics-1309.0924"/></url>
<url><loc>https://scifaro.com/en/abs/strong-normalization-for-ha-em1-by-non-deterministic-choice-1309.1254</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-normalization-for-ha-em1-by-non-deterministic-choice-1309.1254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-normalization-for-ha-em1-by-non-deterministic-choice-1309.1254"/></url>
<url><loc>https://scifaro.com/en/abs/interpreting-a-classical-geometric-proof-with-interactive-realizability-1309.1255</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpreting-a-classical-geometric-proof-with-interactive-realizability-1309.1255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpreting-a-classical-geometric-proof-with-interactive-realizability-1309.1255"/></url>
<url><loc>https://scifaro.com/en/abs/hereditary-substitution-for-the-lambda-delta-calculus-1309.1256</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hereditary-substitution-for-the-lambda-delta-calculus-1309.1256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hereditary-substitution-for-the-lambda-delta-calculus-1309.1256"/></url>
<url><loc>https://scifaro.com/en/abs/continuation-calculus-1309.1257</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuation-calculus-1309.1257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuation-calculus-1309.1257"/></url>
<url><loc>https://scifaro.com/en/abs/induction-by-coinduction-and-control-operators-in-call-by-name-1309.1258</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-by-coinduction-and-control-operators-in-call-by-name-1309.1258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-by-coinduction-and-control-operators-in-call-by-name-1309.1258"/></url>
<url><loc>https://scifaro.com/en/abs/combining-and-relating-control-effects-and-their-semantics-1309.1259</loc><lastmod>2013-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-and-relating-control-effects-and-their-semantics-1309.1259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-and-relating-control-effects-and-their-semantics-1309.1259"/></url>
<url><loc>https://scifaro.com/en/abs/unary-negation-1309.2069</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unary-negation-1309.2069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unary-negation-1309.2069"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-the-boundaries-of-monad-tensorability-on-set-1309.2128</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-the-boundaries-of-monad-tensorability-on-set-1309.2128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-the-boundaries-of-monad-tensorability-on-set-1309.2128"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-path-orders-1309.2394</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-path-orders-1309.2394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-path-orders-1309.2394"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-the-adjunctive-hierarchy-of-hereditarily-finite-sets-1309.2512</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-the-adjunctive-hierarchy-of-hereditarily-finite-sets-1309.2512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-the-adjunctive-hierarchy-of-hereditarily-finite-sets-1309.2512"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-decidable-about-partially-observable-markov-decision-processes-with-omega-regular-objectives-1309.2802</loc><lastmod>2013-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-decidable-about-partially-observable-markov-decision-processes-with-omega-regular-objectives-1309.2802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-decidable-about-partially-observable-markov-decision-processes-with-omega-regular-objectives-1309.2802"/></url>
<url><loc>https://scifaro.com/en/abs/on-characterising-distributability-1309.3883</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-characterising-distributability-1309.3883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-characterising-distributability-1309.3883"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-robustness-1309.4416</loc><lastmod>2013-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-robustness-1309.4416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-robustness-1309.4416"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-probabilistic-wireless-networks-1309.4693</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-probabilistic-wireless-networks-1309.4693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-probabilistic-wireless-networks-1309.4693"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-system-with-names-for-modal-mu-calculus-1309.5129</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-system-with-names-for-modal-mu-calculus-1309.5129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-system-with-names-for-modal-mu-calculus-1309.5129"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-and-learning-for-infinite-state-compositional-verification-1309.5140</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-and-learning-for-infinite-state-compositional-verification-1309.5140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-and-learning-for-infinite-state-compositional-verification-1309.5140"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-product-operators-in-abstract-interpretation-1309.5146</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-product-operators-in-abstract-interpretation-1309.5146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-product-operators-in-abstract-interpretation-1309.5146"/></url>
<url><loc>https://scifaro.com/en/abs/iterable-forward-reachability-analysis-of-monitor-dpns-1309.5150</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterable-forward-reachability-analysis-of-monitor-dpns-1309.5150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterable-forward-reachability-analysis-of-monitor-dpns-1309.5150"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-in-bits-and-pieces-1309.5151</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-in-bits-and-pieces-1309.5151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-in-bits-and-pieces-1309.5151"/></url>
<url><loc>https://scifaro.com/en/abs/closing-a-gap-in-the-complexity-of-refinement-modal-logic-1309.5184</loc><lastmod>2013-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closing-a-gap-in-the-complexity-of-refinement-modal-logic-1309.5184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closing-a-gap-in-the-complexity-of-refinement-modal-logic-1309.5184"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-turing-machines-for-inductive-languages-1309.5544</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-turing-machines-for-inductive-languages-1309.5544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-turing-machines-for-inductive-languages-1309.5544"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semantics-of-reflect-as-a-basis-for-a-reflective-theorem-prover-1309.5742</loc><lastmod>2013-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semantics-of-reflect-as-a-basis-for-a-reflective-theorem-prover-1309.5742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semantics-of-reflect-as-a-basis-for-a-reflective-theorem-prover-1309.5742"/></url>
<url><loc>https://scifaro.com/en/abs/the-rooster-and-the-syntactic-bracket-1309.5767</loc><lastmod>2014-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rooster-and-the-syntactic-bracket-1309.5767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rooster-and-the-syntactic-bracket-1309.5767"/></url>
<url><loc>https://scifaro.com/en/abs/querying-the-guarded-fragment-1309.5822</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-the-guarded-fragment-1309.5822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-the-guarded-fragment-1309.5822"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-logic-as-a-modeling-language-modeling-and-solving-some-machine-learning-and-data-mining-problems-with-idp3-1309.6883</loc><lastmod>2015-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-logic-as-a-modeling-language-modeling-and-solving-some-machine-learning-and-data-mining-problems-with-idp3-1309.6883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-logic-as-a-modeling-language-modeling-and-solving-some-machine-learning-and-data-mining-problems-with-idp3-1309.6883"/></url>
<url><loc>https://scifaro.com/en/abs/partial-model-checking-using-networks-of-labelled-transition-systems-and-boole-an-equation-systems-1309.6947</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-model-checking-using-networks-of-labelled-transition-systems-and-boole-an-equation-systems-1309.6947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-model-checking-using-networks-of-labelled-transition-systems-and-boole-an-equation-systems-1309.6947"/></url>
<url><loc>https://scifaro.com/en/abs/type-refinement-and-monoidal-closed-bifibrations-1310.0263</loc><lastmod>2013-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-refinement-and-monoidal-closed-bifibrations-1310.0263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-refinement-and-monoidal-closed-bifibrations-1310.0263"/></url>
<url><loc>https://scifaro.com/en/abs/patterns-for-computational-effects-arising-from-a-monad-or-a-comonad-1310.0605</loc><lastmod>2013-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patterns-for-computational-effects-arising-from-a-monad-or-a-comonad-1310.0605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patterns-for-computational-effects-arising-from-a-monad-or-a-comonad-1310.0605"/></url>
<url><loc>https://scifaro.com/en/abs/upper-expectation-bisimilarity-and-real-valued-modal-logics-1310.0768</loc><lastmod>2013-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-expectation-bisimilarity-and-real-valued-modal-logics-1310.0768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-expectation-bisimilarity-and-real-valued-modal-logics-1310.0768"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-in-coq-of-program-properties-involving-the-global-state-effect-1310.0794</loc><lastmod>2013-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-in-coq-of-program-properties-involving-the-global-state-effect-1310.0794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-in-coq-of-program-properties-involving-the-global-state-effect-1310.0794"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-constraints-and-containment-problems-1310.1016</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-constraints-and-containment-problems-1310.1016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-constraints-and-containment-problems-1310.1016"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-monadic-datalog-on-unranked-trees-1310.1316</loc><lastmod>2013-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-monadic-datalog-on-unranked-trees-1310.1316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-monadic-datalog-on-unranked-trees-1310.1316"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-function-induced-orders-to-study-recursion-termination-1310.1500</loc><lastmod>2017-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-function-induced-orders-to-study-recursion-termination-1310.1500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-function-induced-orders-to-study-recursion-termination-1310.1500"/></url>
<url><loc>https://scifaro.com/en/abs/non-idempotent-intersection-types-and-strong-normalisation-1310.1622</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-idempotent-intersection-types-and-strong-normalisation-1310.1622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-idempotent-intersection-types-and-strong-normalisation-1310.1622"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-analysis-in-presence-of-control-operators-and-higher-order-functions-long-version-1310.1763</loc><lastmod>2013-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-analysis-in-presence-of-control-operators-and-higher-order-functions-long-version-1310.1763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-analysis-in-presence-of-control-operators-and-higher-order-functions-long-version-1310.1763"/></url>
<url><loc>https://scifaro.com/en/abs/step-indexed-relational-reasoning-for-countable-nondeterminism-1310.2031</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/step-indexed-relational-reasoning-for-countable-nondeterminism-1310.2031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/step-indexed-relational-reasoning-for-countable-nondeterminism-1310.2031"/></url>
<url><loc>https://scifaro.com/en/abs/computation-of-summaries-using-net-unfoldings-1310.2143</loc><lastmod>2013-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-of-summaries-using-net-unfoldings-1310.2143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-of-summaries-using-net-unfoldings-1310.2143"/></url>
<url><loc>https://scifaro.com/en/abs/an-event-structure-model-for-probabilistic-concurrent-kleene-algebra-1310.2320</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-event-structure-model-for-probabilistic-concurrent-kleene-algebra-1310.2320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-event-structure-model-for-probabilistic-concurrent-kleene-algebra-1310.2320"/></url>
<url><loc>https://scifaro.com/en/abs/certified-proofs-in-programs-involving-exceptions-1310.2338</loc><lastmod>2014-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-proofs-in-programs-involving-exceptions-1310.2338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-proofs-in-programs-involving-exceptions-1310.2338"/></url>
<url><loc>https://scifaro.com/en/abs/practical-verification-of-decision-making-in-agent-based-autonomous-systems-1310.2431</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-verification-of-decision-making-in-agent-based-autonomous-systems-1310.2431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-verification-of-decision-making-in-agent-based-autonomous-systems-1310.2431"/></url>
<url><loc>https://scifaro.com/en/abs/on-qbf-proofs-and-preprocessing-1310.2491</loc><lastmod>2013-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-qbf-proofs-and-preprocessing-1310.2491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-qbf-proofs-and-preprocessing-1310.2491"/></url>
<url><loc>https://scifaro.com/en/abs/weak-bisimulation-for-coalgebras-over-order-enriched-monads-1310.3656</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-bisimulation-for-coalgebras-over-order-enriched-monads-1310.3656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-bisimulation-for-coalgebras-over-order-enriched-monads-1310.3656"/></url>
<url><loc>https://scifaro.com/en/abs/a-monadic-framework-for-interactive-realizability-1310.3971</loc><lastmod>2013-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-monadic-framework-for-interactive-realizability-1310.3971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-monadic-framework-for-interactive-realizability-1310.3971"/></url>
<url><loc>https://scifaro.com/en/abs/weak-bisimulations-for-labelled-transition-systems-weighted-over-semirings-1310.4106</loc><lastmod>2013-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-bisimulations-for-labelled-transition-systems-weighted-over-semirings-1310.4106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-bisimulations-for-labelled-transition-systems-weighted-over-semirings-1310.4106"/></url>
<url><loc>https://scifaro.com/en/abs/fully-abstract-concurrent-games-for-pi-1310.4306</loc><lastmod>2013-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-abstract-concurrent-games-for-pi-1310.4306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-abstract-concurrent-games-for-pi-1310.4306"/></url>
<url><loc>https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-with-applications-to-molecular-biology-1310.4310</loc><lastmod>2013-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-with-applications-to-molecular-biology-1310.4310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-with-applications-to-molecular-biology-1310.4310"/></url>
<url><loc>https://scifaro.com/en/abs/context-unification-is-in-pspace-1310.4367</loc><lastmod>2013-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-unification-is-in-pspace-1310.4367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-unification-is-in-pspace-1310.4367"/></url>
<url><loc>https://scifaro.com/en/abs/extended-connectors-structuring-glue-operators-in-bip-1310.4571</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-connectors-structuring-glue-operators-in-bip-1310.4571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-connectors-structuring-glue-operators-in-bip-1310.4571"/></url>
<url><loc>https://scifaro.com/en/abs/on-context-bisimulation-for-parameterized-higher-order-processes-1310.4572</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-context-bisimulation-for-parameterized-higher-order-processes-1310.4572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-context-bisimulation-for-parameterized-higher-order-processes-1310.4572"/></url>
<url><loc>https://scifaro.com/en/abs/choreography-synthesis-as-contract-agreement-1310.4573</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choreography-synthesis-as-contract-agreement-1310.4573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choreography-synthesis-as-contract-agreement-1310.4573"/></url>
<url><loc>https://scifaro.com/en/abs/effectiveness-of-pre-and-inprocessing-for-cdcl-based-sat-solving-1310.4756</loc><lastmod>2013-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectiveness-of-pre-and-inprocessing-for-cdcl-based-sat-solving-1310.4756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectiveness-of-pre-and-inprocessing-for-cdcl-based-sat-solving-1310.4756"/></url>
<url><loc>https://scifaro.com/en/abs/products-of-effective-topological-spaces-and-a-uniformly-computable-tychonoff-theorem-1310.5572</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/products-of-effective-topological-spaces-and-a-uniformly-computable-tychonoff-theorem-1310.5572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/products-of-effective-topological-spaces-and-a-uniformly-computable-tychonoff-theorem-1310.5572"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-systems-for-functions-in-topological-and-in-metric-spaces-1310.5656</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-systems-for-functions-in-topological-and-in-metric-spaces-1310.5656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-systems-for-functions-in-topological-and-in-metric-spaces-1310.5656"/></url>
<url><loc>https://scifaro.com/en/abs/using-higher-order-contracts-to-model-session-types-1310.6176</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-higher-order-contracts-to-model-session-types-1310.6176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-higher-order-contracts-to-model-session-types-1310.6176"/></url>
<url><loc>https://scifaro.com/en/abs/utility-based-decision-making-in-distributed-systems-modelling-1310.6405</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/utility-based-decision-making-in-distributed-systems-modelling-1310.6405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/utility-based-decision-making-in-distributed-systems-modelling-1310.6405"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-dynamic-epistemic-logic-1310.6406</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-dynamic-epistemic-logic-1310.6406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-dynamic-epistemic-logic-1310.6406"/></url>
<url><loc>https://scifaro.com/en/abs/the-shape-of-reactive-coordination-tasks-1310.6407</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-shape-of-reactive-coordination-tasks-1310.6407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-shape-of-reactive-coordination-tasks-1310.6407"/></url>
<url><loc>https://scifaro.com/en/abs/defeasible-modalities-1310.6409</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defeasible-modalities-1310.6409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defeasible-modalities-1310.6409"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-awareness-and-bisimulation-1310.6410</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-awareness-and-bisimulation-1310.6410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-awareness-and-bisimulation-1310.6410"/></url>
<url><loc>https://scifaro.com/en/abs/timely-common-knowledge-1310.6414</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timely-common-knowledge-1310.6414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timely-common-knowledge-1310.6414"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-synthesis-of-knowledge-based-program-implementations-with-synchronous-semantics-1310.6423</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-synthesis-of-knowledge-based-program-implementations-with-synchronous-semantics-1310.6423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-synthesis-of-knowledge-based-program-implementations-with-synchronous-semantics-1310.6423"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-logic-for-communication-chains-1310.6424</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-logic-for-communication-chains-1310.6424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-logic-for-communication-chains-1310.6424"/></url>
<url><loc>https://scifaro.com/en/abs/r-e-axiomatization-of-conditional-independence-1310.6430</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/r-e-axiomatization-of-conditional-independence-1310.6430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/r-e-axiomatization-of-conditional-independence-1310.6430"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-under-the-principle-of-maximum-entropy-for-modal-logics-k45-kd45-and-s5-1310.6439</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-under-the-principle-of-maximum-entropy-for-modal-logics-k45-kd45-and-s5-1310.6439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-under-the-principle-of-maximum-entropy-for-modal-logics-k45-kd45-and-s5-1310.6439"/></url>
<url><loc>https://scifaro.com/en/abs/facebook-and-the-epistemic-logic-of-friendship-1310.6440</loc><lastmod>2013-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facebook-and-the-epistemic-logic-of-friendship-1310.6440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facebook-and-the-epistemic-logic-of-friendship-1310.6440"/></url>
<url><loc>https://scifaro.com/en/abs/ic3-modulo-theories-via-implicit-predicate-abstraction-1310.6847</loc><lastmod>2013-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ic3-modulo-theories-via-implicit-predicate-abstraction-1310.6847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ic3-modulo-theories-via-implicit-predicate-abstraction-1310.6847"/></url>
<url><loc>https://scifaro.com/en/abs/computing-finite-models-using-free-boolean-generators-1310.6978</loc><lastmod>2013-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-finite-models-using-free-boolean-generators-1310.6978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-finite-models-using-free-boolean-generators-1310.6978"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-continuous-probabilistic-transition-systems-1310.7417</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-continuous-probabilistic-transition-systems-1310.7417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-continuous-probabilistic-transition-systems-1310.7417"/></url>
<url><loc>https://scifaro.com/en/abs/compact-manifolds-with-computable-boundaries-1310.7911</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compact-manifolds-with-computable-boundaries-1310.7911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compact-manifolds-with-computable-boundaries-1310.7911"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-definable-graph-orderings-1310.8148</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-definable-graph-orderings-1310.8148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-definable-graph-orderings-1310.8148"/></url>
<url><loc>https://scifaro.com/en/abs/herbrand-confluence-1310.8156</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/herbrand-confluence-1310.8156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/herbrand-confluence-1310.8156"/></url>
<url><loc>https://scifaro.com/en/abs/expansions-of-mso-by-cardinality-relations-1310.8182</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expansions-of-mso-by-cardinality-relations-1310.8182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expansions-of-mso-by-cardinality-relations-1310.8182"/></url>
<url><loc>https://scifaro.com/en/abs/undecidable-first-order-theories-of-affine-geometries-1310.8200</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidable-first-order-theories-of-affine-geometries-1310.8200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidable-first-order-theories-of-affine-geometries-1310.8200"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-modulo-odes-1310.8278</loc><lastmod>2013-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-modulo-odes-1310.8278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-modulo-odes-1310.8278"/></url>
<url><loc>https://scifaro.com/en/abs/all-linear-time-congruences-for-familiar-operators-1310.8408</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-linear-time-congruences-for-familiar-operators-1310.8408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-linear-time-congruences-for-familiar-operators-1310.8408"/></url>
<url><loc>https://scifaro.com/en/abs/translating-specifications-in-a-dependently-typed-lambda-calculus-into-a-predicate-logic-form-1310.8568</loc><lastmod>2013-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-specifications-in-a-dependently-typed-lambda-calculus-into-a-predicate-logic-form-1310.8568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-specifications-in-a-dependently-typed-lambda-calculus-into-a-predicate-logic-form-1310.8568"/></url>
<url><loc>https://scifaro.com/en/abs/borel-and-hausdorff-hierarchies-in-topological-spaces-of-choquet-games-and-their-effectivization-1311.0330</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borel-and-hausdorff-hierarchies-in-topological-spaces-of-choquet-games-and-their-effectivization-1311.0330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borel-and-hausdorff-hierarchies-in-topological-spaces-of-choquet-games-and-their-effectivization-1311.0330"/></url>
<url><loc>https://scifaro.com/en/abs/wadge-hardness-in-scott-spaces-and-its-effectivization-1311.0331</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wadge-hardness-in-scott-spaces-and-its-effectivization-1311.0331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wadge-hardness-in-scott-spaces-and-its-effectivization-1311.0331"/></url>
<url><loc>https://scifaro.com/en/abs/normal-numbers-and-the-borel-hierarchy-1311.0335</loc><lastmod>2013-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-numbers-and-the-borel-hierarchy-1311.0335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-numbers-and-the-borel-hierarchy-1311.0335"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-and-verification-of-infinite-systems-with-resources-1311.1043</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-and-verification-of-infinite-systems-with-resources-1311.1043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-and-verification-of-infinite-systems-with-resources-1311.1043"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-coalgebraic-data-types-with-applications-to-lambda-calculus-1311.1395</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-coalgebraic-data-types-with-applications-to-lambda-calculus-1311.1395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-coalgebraic-data-types-with-applications-to-lambda-calculus-1311.1395"/></url>
<url><loc>https://scifaro.com/en/abs/polsat-a-portfolio-ltl-satisfiability-solver-1311.1602</loc><lastmod>2013-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polsat-a-portfolio-ltl-satisfiability-solver-1311.1602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polsat-a-portfolio-ltl-satisfiability-solver-1311.1602"/></url>
<url><loc>https://scifaro.com/en/abs/kan-injectivity-in-order-enriched-categories-1311.1721</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kan-injectivity-in-order-enriched-categories-1311.1721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kan-injectivity-in-order-enriched-categories-1311.1721"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-models-of-the-lambda-calculus-1311.1916</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-models-of-the-lambda-calculus-1311.1916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-models-of-the-lambda-calculus-1311.1916"/></url>
<url><loc>https://scifaro.com/en/abs/applying-quantitative-semantics-to-higher-order-quantum-computing-1311.2290</loc><lastmod>2013-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-quantitative-semantics-to-higher-order-quantum-computing-1311.2290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-quantitative-semantics-to-higher-order-quantum-computing-1311.2290"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-runtime-monitoring-with-metric-temporal-logic-a-case-study-in-the-android-operating-system-1311.2362</loc><lastmod>2013-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-runtime-monitoring-with-metric-temporal-logic-a-case-study-in-the-android-operating-system-1311.2362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-runtime-monitoring-with-metric-temporal-logic-a-case-study-in-the-android-operating-system-1311.2362"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-probabilistic-model-checking-without-determinisation-1311.2928</loc><lastmod>2015-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-probabilistic-model-checking-without-determinisation-1311.2928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-probabilistic-model-checking-without-determinisation-1311.2928"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-and-reasoning-about-hash-consed-data-structures-in-coq-1311.2959</loc><lastmod>2015-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-and-reasoning-about-hash-consed-data-structures-in-coq-1311.2959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-and-reasoning-about-hash-consed-data-structures-in-coq-1311.2959"/></url>
<url><loc>https://scifaro.com/en/abs/an-axiomatization-for-quantum-processes-to-unifying-quantum-and-classical-computing-1311.2960</loc><lastmod>2013-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-axiomatization-for-quantum-processes-to-unifying-quantum-and-classical-computing-1311.2960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-axiomatization-for-quantum-processes-to-unifying-quantum-and-classical-computing-1311.2960"/></url>
<url><loc>https://scifaro.com/en/abs/locality-and-applications-to-subsumption-testing-and-interpolation-in-mathcal-el-and-some-of-its-extensions-1311.2973</loc><lastmod>2013-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locality-and-applications-to-subsumption-testing-and-interpolation-in-mathcal-el-and-some-of-its-extensions-1311.2973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locality-and-applications-to-subsumption-testing-and-interpolation-in-mathcal-el-and-some-of-its-extensions-1311.2973"/></url>
<url><loc>https://scifaro.com/en/abs/when-equivalence-and-bisimulation-join-forces-in-probabilistic-automata-1311.3396</loc><lastmod>2014-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-equivalence-and-bisimulation-join-forces-in-probabilistic-automata-1311.3396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-equivalence-and-bisimulation-join-forces-in-probabilistic-automata-1311.3396"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-synthesis-methods-for-safety-specs-1311.3530</loc><lastmod>2013-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-synthesis-methods-for-safety-specs-1311.3530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-synthesis-methods-for-safety-specs-1311.3530"/></url>
<url><loc>https://scifaro.com/en/abs/calculating-risk-in-functional-programming-1311.3687</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculating-risk-in-functional-programming-1311.3687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculating-risk-in-functional-programming-1311.3687"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-first-order-properties-of-nowhere-dense-graphs-1311.3899</loc><lastmod>2014-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-first-order-properties-of-nowhere-dense-graphs-1311.3899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-first-order-properties-of-nowhere-dense-graphs-1311.3899"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-theory-of-patches-1311.3903</loc><lastmod>2013-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-theory-of-patches-1311.3903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-theory-of-patches-1311.3903"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-for-polynomial-lasso-programs-1311.4046</loc><lastmod>2013-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-for-polynomial-lasso-programs-1311.4046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-for-polynomial-lasso-programs-1311.4046"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-parity-reasoning-extended-version-1311.4289</loc><lastmod>2013-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-parity-reasoning-extended-version-1311.4289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-parity-reasoning-extended-version-1311.4289"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-visualization-a-formal-approach-using-category-theory-and-semiotics-1311.4376</loc><lastmod>2013-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-visualization-a-formal-approach-using-category-theory-and-semiotics-1311.4376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-visualization-a-formal-approach-using-category-theory-and-semiotics-1311.4376"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-model-checking-of-token-passing-systems-1311.4425</loc><lastmod>2013-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-model-checking-of-token-passing-systems-1311.4425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-model-checking-of-token-passing-systems-1311.4425"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-perspective-for-hoare-s-logic-and-peano-s-arithmetic-1311.4617</loc><lastmod>2013-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-perspective-for-hoare-s-logic-and-peano-s-arithmetic-1311.4617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-perspective-for-hoare-s-logic-and-peano-s-arithmetic-1311.4617"/></url>
<url><loc>https://scifaro.com/en/abs/indagini-in-deep-inference-1311.5006</loc><lastmod>2013-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indagini-in-deep-inference-1311.5006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indagini-in-deep-inference-1311.5006"/></url>
<url><loc>https://scifaro.com/en/abs/loosening-the-notions-of-compliance-and-sub-behaviour-in-client-server-systems-1311.5802</loc><lastmod>2014-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loosening-the-notions-of-compliance-and-sub-behaviour-in-client-server-systems-1311.5802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loosening-the-notions-of-compliance-and-sub-behaviour-in-client-server-systems-1311.5802"/></url>
<url><loc>https://scifaro.com/en/abs/games-and-full-completeness-for-multiplicative-linear-logic-1311.6057</loc><lastmod>2013-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-and-full-completeness-for-multiplicative-linear-logic-1311.6057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-and-full-completeness-for-multiplicative-linear-logic-1311.6057"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-pcf-1311.6125</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-pcf-1311.6125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-pcf-1311.6125"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-tptl-and-mtl-over-omega-data-words-1311.6250</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-tptl-and-mtl-over-omega-data-words-1311.6250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-tptl-and-mtl-over-omega-data-words-1311.6250"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-program-extraction-from-cl1-proofs-1311.6542</loc><lastmod>2013-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-program-extraction-from-cl1-proofs-1311.6542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-program-extraction-from-cl1-proofs-1311.6542"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-semantics-for-quantum-programming-languages-with-classical-control-1311.6563</loc><lastmod>2013-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-semantics-for-quantum-programming-languages-with-classical-control-1311.6563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-semantics-for-quantum-programming-languages-with-classical-control-1311.6563"/></url>
<url><loc>https://scifaro.com/en/abs/the-role-of-logical-interpretations-in-program-development-1311.7090</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-role-of-logical-interpretations-in-program-development-1311.7090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-role-of-logical-interpretations-in-program-development-1311.7090"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-programming-to-interfaces-programs-1311.7181</loc><lastmod>2013-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-programming-to-interfaces-programs-1311.7181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-programming-to-interfaces-programs-1311.7181"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-bisimulation-algorithm-1311.7635</loc><lastmod>2014-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-bisimulation-algorithm-1311.7635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-bisimulation-algorithm-1311.7635"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-interaction-1312.0121</loc><lastmod>2013-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-interaction-1312.0121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-interaction-1312.0121"/></url>
<url><loc>https://scifaro.com/en/abs/a-combined-approach-for-constraints-over-finite-domains-and-arrays-1312.0200</loc><lastmod>2013-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-combined-approach-for-constraints-over-finite-domains-and-arrays-1312.0200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-combined-approach-for-constraints-over-finite-domains-and-arrays-1312.0200"/></url>
<url><loc>https://scifaro.com/en/abs/class-diagram-restructuring-with-groove-1312.0350</loc><lastmod>2013-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/class-diagram-restructuring-with-groove-1312.0350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/class-diagram-restructuring-with-groove-1312.0350"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-algebra-for-games-1312.0686</loc><lastmod>2019-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-for-games-1312.0686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-for-games-1312.0686"/></url>
<url><loc>https://scifaro.com/en/abs/on-sufficient-conditions-for-expressibility-of-constants-in-the-4-valued-extension-of-the-propositional-provability-logic-gl-1312.0714</loc><lastmod>2013-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sufficient-conditions-for-expressibility-of-constants-in-the-4-valued-extension-of-the-propositional-provability-logic-gl-1312.0714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sufficient-conditions-for-expressibility-of-constants-in-the-4-valued-extension-of-the-propositional-provability-logic-gl-1312.0714"/></url>
<url><loc>https://scifaro.com/en/abs/checking-temporal-properties-of-presburger-counter-systems-using-reachability-analysis-1312.1070</loc><lastmod>2017-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-temporal-properties-of-presburger-counter-systems-using-reachability-analysis-1312.1070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-temporal-properties-of-presburger-counter-systems-using-reachability-analysis-1312.1070"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-exponentials-1312.1094</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-exponentials-1312.1094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-exponentials-1312.1094"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-semantics-for-generic-polymorphism-1312.1120</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-semantics-for-generic-polymorphism-1312.1120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-semantics-for-generic-polymorphism-1312.1120"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-principles-for-rely-guarantee-style-concurrency-verification-tools-1312.1225</loc><lastmod>2013-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-principles-for-rely-guarantee-style-concurrency-verification-tools-1312.1225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-principles-for-rely-guarantee-style-concurrency-verification-tools-1312.1225"/></url>
<url><loc>https://scifaro.com/en/abs/handling-algebraic-effects-1312.1399</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/handling-algebraic-effects-1312.1399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/handling-algebraic-effects-1312.1399"/></url>
<url><loc>https://scifaro.com/en/abs/don-t-sit-on-the-fence-a-static-analysis-approach-to-automatic-fence-insertion-1312.1411</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/don-t-sit-on-the-fence-a-static-analysis-approach-to-automatic-fence-insertion-1312.1411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/don-t-sit-on-the-fence-a-static-analysis-approach-to-automatic-fence-insertion-1312.1411"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-interpretation-of-temporal-concurrent-constraint-programs-1312.2552</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-interpretation-of-temporal-concurrent-constraint-programs-1312.2552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-interpretation-of-temporal-concurrent-constraint-programs-1312.2552"/></url>
<url><loc>https://scifaro.com/en/abs/session-types-in-abelian-logic-1312.2700</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-types-in-abelian-logic-1312.2700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-types-in-abelian-logic-1312.2700"/></url>
<url><loc>https://scifaro.com/en/abs/static-application-level-race-detection-in-stm-haskell-using-contracts-1312.2706</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-application-level-race-detection-in-stm-haskell-using-contracts-1312.2706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-application-level-race-detection-in-stm-haskell-using-contracts-1312.2706"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-procedure-for-hybrid-logic-with-binders-transitivity-and-relation-hierarchies-extended-version-1312.2894</loc><lastmod>2013-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-procedure-for-hybrid-logic-with-binders-transitivity-and-relation-hierarchies-extended-version-1312.2894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-procedure-for-hybrid-logic-with-binders-transitivity-and-relation-hierarchies-extended-version-1312.2894"/></url>
<url><loc>https://scifaro.com/en/abs/on-resources-and-tasks-1312.3372</loc><lastmod>2013-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-resources-and-tasks-1312.3372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-resources-and-tasks-1312.3372"/></url>
<url><loc>https://scifaro.com/en/abs/the-determinacy-of-context-free-games-1312.3412</loc><lastmod>2013-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-determinacy-of-context-free-games-1312.3412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-determinacy-of-context-free-games-1312.3412"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fly-fast-mean-field-model-checking-extended-version-1312.3416</loc><lastmod>2013-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fly-fast-mean-field-model-checking-extended-version-1312.3416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fly-fast-mean-field-model-checking-extended-version-1312.3416"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-games-specified-by-2-tape-automata-1312.3797</loc><lastmod>2013-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-games-specified-by-2-tape-automata-1312.3797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-games-specified-by-2-tape-automata-1312.3797"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-hard-1312.3910</loc><lastmod>2013-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-hard-1312.3910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-hard-1312.3910"/></url>
<url><loc>https://scifaro.com/en/abs/strong-turing-degrees-for-additive-bss-ram-s-1312.3927</loc><lastmod>2016-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-turing-degrees-for-additive-bss-ram-s-1312.3927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-turing-degrees-for-additive-bss-ram-s-1312.3927"/></url>
<url><loc>https://scifaro.com/en/abs/parametrized-invariance-for-infinite-state-processes-1312.4043</loc><lastmod>2014-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametrized-invariance-for-infinite-state-processes-1312.4043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametrized-invariance-for-infinite-state-processes-1312.4043"/></url>
<url><loc>https://scifaro.com/en/abs/aperiodic-tilings-and-entropy-1312.4126</loc><lastmod>2017-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aperiodic-tilings-and-entropy-1312.4126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aperiodic-tilings-and-entropy-1312.4126"/></url>
<url><loc>https://scifaro.com/en/abs/strategic-argumentation-is-np-complete-1312.4287</loc><lastmod>2013-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategic-argumentation-is-np-complete-1312.4287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategic-argumentation-is-np-complete-1312.4287"/></url>
<url><loc>https://scifaro.com/en/abs/call-by-value-non-determinism-in-a-linear-logic-type-discipline-1312.4507</loc><lastmod>2014-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/call-by-value-non-determinism-in-a-linear-logic-type-discipline-1312.4507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/call-by-value-non-determinism-in-a-linear-logic-type-discipline-1312.4507"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-sequent-calculus-for-nominal-logic-1312.4840</loc><lastmod>2013-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-sequent-calculus-for-nominal-logic-1312.4840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-sequent-calculus-for-nominal-logic-1312.4840"/></url>
<url><loc>https://scifaro.com/en/abs/polarizing-double-negation-translations-1312.5420</loc><lastmod>2013-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polarizing-double-negation-translations-1312.5420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polarizing-double-negation-translations-1312.5420"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-by-equivalence-checking-1312.5951</loc><lastmod>2013-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-by-equivalence-checking-1312.5951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-quantum-protocols-by-equivalence-checking-1312.5951"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-solution-of-a-class-of-quantified-constraints-with-quantifier-prefix-exists-forall-1312.6155</loc><lastmod>2014-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-solution-of-a-class-of-quantified-constraints-with-quantifier-prefix-exists-forall-1312.6155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-solution-of-a-class-of-quantified-constraints-with-quantifier-prefix-exists-forall-1312.6155"/></url>
<url><loc>https://scifaro.com/en/abs/global-semantic-typing-for-inductive-and-coinductive-computing-1312.6323</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-semantic-typing-for-inductive-and-coinductive-computing-1312.6323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-semantic-typing-for-inductive-and-coinductive-computing-1312.6323"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-term-rewriting-characterisation-of-etime-functions-1312.7284</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-term-rewriting-characterisation-of-etime-functions-1312.7284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-term-rewriting-characterisation-of-etime-functions-1312.7284"/></url>
<url><loc>https://scifaro.com/en/abs/learning-temporal-logical-properties-discriminating-ecg-models-of-cardiac-arrhytmias-1312.7523</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-temporal-logical-properties-discriminating-ecg-models-of-cardiac-arrhytmias-1312.7523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-temporal-logical-properties-discriminating-ecg-models-of-cardiac-arrhytmias-1312.7523"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-temporal-logic-path-checking-1312.7603</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-temporal-logic-path-checking-1312.7603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-temporal-logic-path-checking-1312.7603"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-satisfaction-with-counting-quantifiers-2-1312.7605</loc><lastmod>2013-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-satisfaction-with-counting-quantifiers-2-1312.7605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-satisfaction-with-counting-quantifiers-2-1312.7605"/></url>
<url><loc>https://scifaro.com/en/abs/counting-terms-in-the-binary-lambda-calculus-1401.0379</loc><lastmod>2014-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-terms-in-the-binary-lambda-calculus-1401.0379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-terms-in-the-binary-lambda-calculus-1401.0379"/></url>
<url><loc>https://scifaro.com/en/abs/unification-modulo-a-2-sorted-equational-theory-for-cipher-decipher-block-chaining-1401.0445</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-modulo-a-2-sorted-equational-theory-for-cipher-decipher-block-chaining-1401.0445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-modulo-a-2-sorted-equational-theory-for-cipher-decipher-block-chaining-1401.0445"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-spaces-and-the-completeness-of-learning-strategies-1401.0885</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-spaces-and-the-completeness-of-learning-strategies-1401.0885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-spaces-and-the-completeness-of-learning-strategies-1401.0885"/></url>
<url><loc>https://scifaro.com/en/abs/automated-reasoning-over-deontic-action-logics-with-finite-vocabularies-1401.0969</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-reasoning-over-deontic-action-logics-with-finite-vocabularies-1401.0969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-reasoning-over-deontic-action-logics-with-finite-vocabularies-1401.0969"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-a-translation-and-super-consistency-entail-classical-cut-elimination-1401.0998</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-a-translation-and-super-consistency-entail-classical-cut-elimination-1401.0998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-a-translation-and-super-consistency-entail-classical-cut-elimination-1401.0998"/></url>
<url><loc>https://scifaro.com/en/abs/terminal-semantics-for-codata-types-in-intensional-martin-l-of-type-theory-1401.1053</loc><lastmod>2014-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terminal-semantics-for-codata-types-in-intensional-martin-l-of-type-theory-1401.1053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terminal-semantics-for-codata-types-in-intensional-martin-l-of-type-theory-1401.1053"/></url>
<url><loc>https://scifaro.com/en/abs/extensionality-of-lambda-1401.1139</loc><lastmod>2014-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensionality-of-lambda-1401.1139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensionality-of-lambda-1401.1139"/></url>
<url><loc>https://scifaro.com/en/abs/internalization-of-extensional-equality-1401.1148</loc><lastmod>2015-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internalization-of-extensional-equality-1401.1148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internalization-of-extensional-equality-1401.1148"/></url>
<url><loc>https://scifaro.com/en/abs/linear-temporal-logic-for-regular-cost-functions-1401.1448</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-temporal-logic-for-regular-cost-functions-1401.1448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-temporal-logic-for-regular-cost-functions-1401.1448"/></url>
<url><loc>https://scifaro.com/en/abs/belief-revision-in-structured-probabilistic-argumentation-1401.1475</loc><lastmod>2014-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-revision-in-structured-probabilistic-argumentation-1401.1475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-revision-in-structured-probabilistic-argumentation-1401.1475"/></url>
<url><loc>https://scifaro.com/en/abs/certification-for-mu-calculus-with-winning-strategies-1401.1693</loc><lastmod>2014-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certification-for-mu-calculus-with-winning-strategies-1401.1693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certification-for-mu-calculus-with-winning-strategies-1401.1693"/></url>
<url><loc>https://scifaro.com/en/abs/the-computational-complexity-of-propositional-cirquent-calculus-1401.1849</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computational-complexity-of-propositional-cirquent-calculus-1401.1849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computational-complexity-of-propositional-cirquent-calculus-1401.1849"/></url>
<url><loc>https://scifaro.com/en/abs/an-intuitionistic-version-of-ramsey-theorem-italian-version-1401.2515</loc><lastmod>2014-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intuitionistic-version-of-ramsey-theorem-italian-version-1401.2515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intuitionistic-version-of-ramsey-theorem-italian-version-1401.2515"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-and-decidability-for-type-isomorphism-in-the-presence-of-sums-1401.2567</loc><lastmod>2014-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-and-decidability-for-type-isomorphism-in-the-presence-of-sums-1401.2567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-and-decidability-for-type-isomorphism-in-the-presence-of-sums-1401.2567"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-kamp-s-theorem-1401.2580</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-kamp-s-theorem-1401.2580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-kamp-s-theorem-1401.2580"/></url>
<url><loc>https://scifaro.com/en/abs/groupoid-semantics-for-thermal-computing-1401.3280</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/groupoid-semantics-for-thermal-computing-1401.3280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/groupoid-semantics-for-thermal-computing-1401.3280"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-partial-observation-stochastic-parity-games-with-finite-memory-strategies-1401.3289</loc><lastmod>2014-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-partial-observation-stochastic-parity-games-with-finite-memory-strategies-1401.3289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-partial-observation-stochastic-parity-games-with-finite-memory-strategies-1401.3289"/></url>
<url><loc>https://scifaro.com/en/abs/equilibria-in-multi-player-multi-outcome-infinite-sequential-games-1401.3325</loc><lastmod>2016-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilibria-in-multi-player-multi-outcome-infinite-sequential-games-1401.3325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilibria-in-multi-player-multi-outcome-infinite-sequential-games-1401.3325"/></url>
<url><loc>https://scifaro.com/en/abs/automated-reasoning-in-modal-and-description-logics-via-sat-encoding-the-case-study-of-k-m-alc-satisfiability-1401.3463</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-reasoning-in-modal-and-description-logics-via-sat-encoding-the-case-study-of-k-m-alc-satisfiability-1401.3463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-reasoning-in-modal-and-description-logics-via-sat-encoding-the-case-study-of-k-m-alc-satisfiability-1401.3463"/></url>
<url><loc>https://scifaro.com/en/abs/variable-forgetting-in-reasoning-about-knowledge-1401.3472</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-forgetting-in-reasoning-about-knowledge-1401.3472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-forgetting-in-reasoning-about-knowledge-1401.3472"/></url>
<url><loc>https://scifaro.com/en/abs/prime-implicates-and-prime-implicants-from-propositional-to-modal-logic-1401.3475</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prime-implicates-and-prime-implicants-from-propositional-to-modal-logic-1401.3475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prime-implicates-and-prime-implicants-from-propositional-to-modal-logic-1401.3475"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-circumscription-in-dls-1401.3476</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-circumscription-in-dls-1401.3476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-circumscription-in-dls-1401.3476"/></url>
<url><loc>https://scifaro.com/en/abs/modularity-aspects-of-disjunctive-stable-models-1401.3484</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modularity-aspects-of-disjunctive-stable-models-1401.3484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modularity-aspects-of-disjunctive-stable-models-1401.3484"/></url>
<url><loc>https://scifaro.com/en/abs/hypertableau-reasoning-for-description-logics-1401.3485</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypertableau-reasoning-for-description-logics-1401.3485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypertableau-reasoning-for-description-logics-1401.3485"/></url>
<url><loc>https://scifaro.com/en/abs/the-dl-lite-family-and-relations-1401.3487</loc><lastmod>2014-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dl-lite-family-and-relations-1401.3487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dl-lite-family-and-relations-1401.3487"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-synthesis-1401.3588</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-synthesis-1401.3588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-synthesis-1401.3588"/></url>
<url><loc>https://scifaro.com/en/abs/on-probabilistic-applicative-bisimulation-and-call-by-value-lambda-calculi-long-version-1401.3766</loc><lastmod>2014-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-probabilistic-applicative-bisimulation-and-call-by-value-lambda-calculi-long-version-1401.3766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-probabilistic-applicative-bisimulation-and-call-by-value-lambda-calculi-long-version-1401.3766"/></url>
<url><loc>https://scifaro.com/en/abs/grounding-fo-and-fo-id-with-bounds-1401.3840</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grounding-fo-and-fo-id-with-bounds-1401.3840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grounding-fo-and-fo-id-with-bounds-1401.3840"/></url>
<url><loc>https://scifaro.com/en/abs/nominals-inverses-counting-and-conjunctive-queries-or-why-infinity-is-your-friend-1401.3849</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominals-inverses-counting-and-conjunctive-queries-or-why-infinity-is-your-friend-1401.3849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominals-inverses-counting-and-conjunctive-queries-or-why-infinity-is-your-friend-1401.3849"/></url>
<url><loc>https://scifaro.com/en/abs/logical-foundations-of-rdf-s-with-datatypes-1401.3858</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-foundations-of-rdf-s-with-datatypes-1401.3858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-foundations-of-rdf-s-with-datatypes-1401.3858"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-study-of-partial-entailment-1401.3864</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-study-of-partial-entailment-1401.3864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-study-of-partial-entailment-1401.3864"/></url>
<url><loc>https://scifaro.com/en/abs/clause-learning-algorithms-with-many-restarts-and-bounded-width-resolution-1401.3868</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clause-learning-algorithms-with-many-restarts-and-bounded-width-resolution-1401.3868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clause-learning-algorithms-with-many-restarts-and-bounded-width-resolution-1401.3868"/></url>
<url><loc>https://scifaro.com/en/abs/computing-small-unsatisfiable-cores-in-satisfiability-modulo-theories-1401.3878</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-small-unsatisfiable-cores-in-satisfiability-modulo-theories-1401.3878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-small-unsatisfiable-cores-in-satisfiability-modulo-theories-1401.3878"/></url>
<url><loc>https://scifaro.com/en/abs/interpolable-formulas-in-equilibrium-logic-and-answer-set-programming-1401.3897</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolable-formulas-in-equilibrium-logic-and-answer-set-programming-1401.3897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolable-formulas-in-equilibrium-logic-and-answer-set-programming-1401.3897"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-stable-model-semantics-and-first-order-loop-formulas-1401.3898</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-stable-model-semantics-and-first-order-loop-formulas-1401.3898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-stable-model-semantics-and-first-order-loop-formulas-1401.3898"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-and-undecidability-results-for-propositional-schemata-1401.3900</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-and-undecidability-results-for-propositional-schemata-1401.3900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-and-undecidability-results-for-propositional-schemata-1401.3900"/></url>
<url><loc>https://scifaro.com/en/abs/defeasible-inclusions-in-low-complexity-dls-1401.3901</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defeasible-inclusions-in-low-complexity-dls-1401.3901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defeasible-inclusions-in-low-complexity-dls-1401.3901"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-probabilistic-basic-parallel-processes-1401.4130</loc><lastmod>2014-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-probabilistic-basic-parallel-processes-1401.4130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-probabilistic-basic-parallel-processes-1401.4130"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-introduction-of-quantified-cuts-1401.4330</loc><lastmod>2014-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-introduction-of-quantified-cuts-1401.4330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-introduction-of-quantified-cuts-1401.4330"/></url>
<url><loc>https://scifaro.com/en/abs/weak-mso-automata-and-expressiveness-modulo-bisimilarity-1401.4374</loc><lastmod>2014-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-mso-automata-and-expressiveness-modulo-bisimilarity-1401.4374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-mso-automata-and-expressiveness-modulo-bisimilarity-1401.4374"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-succinctness-of-query-rewriting-over-owl-2-ql-ontologies-with-shallow-chases-1401.4420</loc><lastmod>2014-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-succinctness-of-query-rewriting-over-owl-2-ql-ontologies-with-shallow-chases-1401.4420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-succinctness-of-query-rewriting-over-owl-2-ql-ontologies-with-shallow-chases-1401.4420"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logics-for-hyperproperties-1401.4492</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logics-for-hyperproperties-1401.4492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logics-for-hyperproperties-1401.4492"/></url>
<url><loc>https://scifaro.com/en/abs/dialectica-models-of-additive-free-linear-logic-1401.4538</loc><lastmod>2014-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dialectica-models-of-additive-free-linear-logic-1401.4538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dialectica-models-of-additive-free-linear-logic-1401.4538"/></url>
<url><loc>https://scifaro.com/en/abs/unfounded-sets-and-well-founded-semantics-of-answer-set-programs-with-aggregates-1401.4596</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfounded-sets-and-well-founded-semantics-of-answer-set-programs-with-aggregates-1401.4596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfounded-sets-and-well-founded-semantics-of-answer-set-programs-with-aggregates-1401.4596"/></url>
<url><loc>https://scifaro.com/en/abs/computation-tree-logic-model-checking-based-on-possibility-measures-1401.4658</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-tree-logic-model-checking-based-on-possibility-measures-1401.4658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-tree-logic-model-checking-based-on-possibility-measures-1401.4658"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-agent-knowledge-in-dynamic-access-control-policies-1401.4730</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-agent-knowledge-in-dynamic-access-control-policies-1401.4730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-agent-knowledge-in-dynamic-access-control-policies-1401.4730"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-for-definability-and-full-completeness-1401.4735</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-for-definability-and-full-completeness-1401.4735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-for-definability-and-full-completeness-1401.4735"/></url>
<url><loc>https://scifaro.com/en/abs/what-are-the-fundamental-structures-of-concurrency-we-still-don-t-know-1401.4973</loc><lastmod>2014-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-are-the-fundamental-structures-of-concurrency-we-still-don-t-know-1401.4973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-are-the-fundamental-structures-of-concurrency-we-still-don-t-know-1401.4973"/></url>
<url><loc>https://scifaro.com/en/abs/b-uchi-types-for-infinite-traces-and-liveness-1401.5107</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/b-uchi-types-for-infinite-traces-and-liveness-1401.5107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/b-uchi-types-for-infinite-traces-and-liveness-1401.5107"/></url>
<url><loc>https://scifaro.com/en/abs/retracing-some-paths-in-process-algebra-1401.5113</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retracing-some-paths-in-process-algebra-1401.5113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retracing-some-paths-in-process-algebra-1401.5113"/></url>
<url><loc>https://scifaro.com/en/abs/valuations-in-g-o-del-logic-and-the-euler-characteristic-1401.5254</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valuations-in-g-o-del-logic-and-the-euler-characteristic-1401.5254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valuations-in-g-o-del-logic-and-the-euler-characteristic-1401.5254"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-ruspini-partitions-in-g-odel-logic-1401.5261</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-ruspini-partitions-in-g-odel-logic-1401.5261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-ruspini-partitions-in-g-odel-logic-1401.5261"/></url>
<url><loc>https://scifaro.com/en/abs/subclasses-of-presburger-arithmetic-and-the-weak-exp-hierarchy-1401.5266</loc><lastmod>2014-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subclasses-of-presburger-arithmetic-and-the-weak-exp-hierarchy-1401.5266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subclasses-of-presburger-arithmetic-and-the-weak-exp-hierarchy-1401.5266"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-uniform-theory-of-effectful-state-machines-1401.5277</loc><lastmod>2020-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-uniform-theory-of-effectful-state-machines-1401.5277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-uniform-theory-of-effectful-state-machines-1401.5277"/></url>
<url><loc>https://scifaro.com/en/abs/game-semantics-for-access-control-1401.5325</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-semantics-for-access-control-1401.5325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-semantics-for-access-control-1401.5325"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1401.5338</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1401.5338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1401.5338"/></url>
<url><loc>https://scifaro.com/en/abs/linear-ranking-for-linear-lasso-programs-1401.5347</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-ranking-for-linear-lasso-programs-1401.5347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-ranking-for-linear-lasso-programs-1401.5347"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-function-synthesis-for-linear-lasso-programs-1401.5351</loc><lastmod>2014-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-function-synthesis-for-linear-lasso-programs-1401.5351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-function-synthesis-for-linear-lasso-programs-1401.5351"/></url>
<url><loc>https://scifaro.com/en/abs/fast-ltl-satisfiability-checking-by-sat-solvers-1401.5677</loc><lastmod>2014-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-ltl-satisfiability-checking-by-sat-solvers-1401.5677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-ltl-satisfiability-checking-by-sat-solvers-1401.5677"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logics-with-hard-diamond-free-fragments-1401.5846</loc><lastmod>2015-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logics-with-hard-diamond-free-fragments-1401.5846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logics-with-hard-diamond-free-fragments-1401.5846"/></url>
<url><loc>https://scifaro.com/en/abs/the-logical-difference-for-the-lightweight-description-logic-el-1401.5850</loc><lastmod>2014-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logical-difference-for-the-lightweight-description-logic-el-1401.5850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logical-difference-for-the-lightweight-description-logic-el-1401.5850"/></url>
<url><loc>https://scifaro.com/en/abs/applications-of-the-gauss-jordan-algorithm-done-right-1401.5910</loc><lastmod>2014-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applications-of-the-gauss-jordan-algorithm-done-right-1401.5910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applications-of-the-gauss-jordan-algorithm-done-right-1401.5910"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-over-classes-of-finite-structures-1401.5953</loc><lastmod>2014-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-over-classes-of-finite-structures-1401.5953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-over-classes-of-finite-structures-1401.5953"/></url>
<url><loc>https://scifaro.com/en/abs/un-decidable-problems-about-reachability-of-quantum-systems-1401.6249</loc><lastmod>2014-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/un-decidable-problems-about-reachability-of-quantum-systems-1401.6249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/un-decidable-problems-about-reachability-of-quantum-systems-1401.6249"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-logic-as-a-modelling-language-the-idp-system-1401.6312</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-logic-as-a-modelling-language-the-idp-system-1401.6312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-logic-as-a-modelling-language-the-idp-system-1401.6312"/></url>
<url><loc>https://scifaro.com/en/abs/safety-verification-of-asynchronous-pushdown-systems-with-shaped-stacks-1401.6325</loc><lastmod>2014-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-verification-of-asynchronous-pushdown-systems-with-shaped-stacks-1401.6325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-verification-of-asynchronous-pushdown-systems-with-shaped-stacks-1401.6325"/></url>
<url><loc>https://scifaro.com/en/abs/subsumption-checking-in-conjunctive-coalgebraic-fixpoint-logics-1401.6359</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subsumption-checking-in-conjunctive-coalgebraic-fixpoint-logics-1401.6359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subsumption-checking-in-conjunctive-coalgebraic-fixpoint-logics-1401.6359"/></url>
<url><loc>https://scifaro.com/en/abs/adding-modular-predicates-to-first-order-fragments-1401.6576</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-modular-predicates-to-first-order-fragments-1401.6576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-modular-predicates-to-first-order-fragments-1401.6576"/></url>
<url><loc>https://scifaro.com/en/abs/coinduction-up-to-in-a-fibrational-setting-1401.6675</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinduction-up-to-in-a-fibrational-setting-1401.6675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinduction-up-to-in-a-fibrational-setting-1401.6675"/></url>
<url><loc>https://scifaro.com/en/abs/non-elementary-complexities-for-branching-vass-mell-and-extensions-1401.6785</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-elementary-complexities-for-branching-vass-mell-and-extensions-1401.6785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-elementary-complexities-for-branching-vass-mell-and-extensions-1401.6785"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-topological-complexity-of-omega-languages-of-non-deterministic-petri-nets-1401.6835</loc><lastmod>2014-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-topological-complexity-of-omega-languages-of-non-deterministic-petri-nets-1401.6835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-topological-complexity-of-omega-languages-of-non-deterministic-petri-nets-1401.6835"/></url>
<url><loc>https://scifaro.com/en/abs/probably-safe-or-live-1401.7171</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probably-safe-or-live-1401.7171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probably-safe-or-live-1401.7171"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-for-searching-games-with-errors-1401.7234</loc><lastmod>2014-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-searching-games-with-errors-1401.7234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-searching-games-with-errors-1401.7234"/></url>
<url><loc>https://scifaro.com/en/abs/an-equivalent-presentation-of-the-bezem-coquand-huber-category-of-cubical-sets-1401.7807</loc><lastmod>2014-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-equivalent-presentation-of-the-bezem-coquand-huber-category-of-cubical-sets-1401.7807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-equivalent-presentation-of-the-bezem-coquand-huber-category-of-cubical-sets-1401.7807"/></url>
<url><loc>https://scifaro.com/en/abs/universal-first-order-logic-is-superfluous-for-nl-p-np-and-conp-1401.8046</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-first-order-logic-is-superfluous-for-nl-p-np-and-conp-1401.8046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-first-order-logic-is-superfluous-for-nl-p-np-and-conp-1401.8046"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-logics-complexity-and-the-sub-formula-property-1401.8209</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-logics-complexity-and-the-sub-formula-property-1401.8209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-logics-complexity-and-the-sub-formula-property-1401.8209"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-checking-for-prs-1402.0050</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-checking-for-prs-1402.0050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-checking-for-prs-1402.0050"/></url>
<url><loc>https://scifaro.com/en/abs/proof-pattern-search-in-coq-ssreflect-1402.0081</loc><lastmod>2014-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-pattern-search-in-coq-ssreflect-1402.0081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-pattern-search-in-coq-ssreflect-1402.0081"/></url>
<url><loc>https://scifaro.com/en/abs/an-intuitionisticaly-based-description-logic-1402.0225</loc><lastmod>2014-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intuitionisticaly-based-description-logic-1402.0225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intuitionisticaly-based-description-logic-1402.0225"/></url>
<url><loc>https://scifaro.com/en/abs/a-fixed-point-theorem-for-non-monotonic-functions-1402.0299</loc><lastmod>2015-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fixed-point-theorem-for-non-monotonic-functions-1402.0299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fixed-point-theorem-for-non-monotonic-functions-1402.0299"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-and-sub-formula-property-for-lambek-with-product-and-pcmll-partially-commutative-multiplicative-linear-logic-1402.0474</loc><lastmod>2014-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-and-sub-formula-property-for-lambek-with-product-and-pcmll-partially-commutative-multiplicative-linear-logic-1402.0474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-and-sub-formula-property-for-lambek-with-product-and-pcmll-partially-commutative-multiplicative-linear-logic-1402.0474"/></url>
<url><loc>https://scifaro.com/en/abs/implicational-relevance-logic-is-2-exptime-complete-1402.0705</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicational-relevance-logic-is-2-exptime-complete-1402.0705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicational-relevance-logic-is-2-exptime-complete-1402.0705"/></url>
<url><loc>https://scifaro.com/en/abs/modular-complexity-analysis-for-term-rewriting-1402.0746</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-complexity-analysis-for-term-rewriting-1402.0746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-complexity-analysis-for-term-rewriting-1402.0746"/></url>
<url><loc>https://scifaro.com/en/abs/higher-inductive-types-as-homotopy-initial-algebras-1402.0761</loc><lastmod>2014-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-inductive-types-as-homotopy-initial-algebras-1402.0761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-inductive-types-as-homotopy-initial-algebras-1402.0761"/></url>
<url><loc>https://scifaro.com/en/abs/automata-theory-in-nominal-sets-1402.0897</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-theory-in-nominal-sets-1402.0897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-theory-in-nominal-sets-1402.0897"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-a-monad-comonad-symmetry-between-computational-effects-1402.1051</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-a-monad-comonad-symmetry-between-computational-effects-1402.1051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-a-monad-comonad-symmetry-between-computational-effects-1402.1051"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-games-via-a-first-order-modal-model-checking-approach-1402.1377</loc><lastmod>2014-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-games-via-a-first-order-modal-model-checking-approach-1402.1377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-games-via-a-first-order-modal-model-checking-approach-1402.1377"/></url>
<url><loc>https://scifaro.com/en/abs/smoothed-model-checking-for-uncertain-continuous-time-markov-chains-1402.1450</loc><lastmod>2014-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smoothed-model-checking-for-uncertain-continuous-time-markov-chains-1402.1450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smoothed-model-checking-for-uncertain-continuous-time-markov-chains-1402.1450"/></url>
<url><loc>https://scifaro.com/en/abs/puc-logic-1402.1535</loc><lastmod>2014-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/puc-logic-1402.1535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/puc-logic-1402.1535"/></url>
<url><loc>https://scifaro.com/en/abs/amortised-resource-analysis-and-typed-polynomial-interpretations-extended-version-1402.1922</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/amortised-resource-analysis-and-typed-polynomial-interpretations-extended-version-1402.1922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/amortised-resource-analysis-and-typed-polynomial-interpretations-extended-version-1402.1922"/></url>
<url><loc>https://scifaro.com/en/abs/euler-x-a-toolkit-for-logic-based-taxonomy-integration-1402.1992</loc><lastmod>2026-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/euler-x-a-toolkit-for-logic-based-taxonomy-integration-1402.1992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/euler-x-a-toolkit-for-logic-based-taxonomy-integration-1402.1992"/></url>
<url><loc>https://scifaro.com/en/abs/attribute-dependencies-for-data-with-grades-1402.2071</loc><lastmod>2014-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attribute-dependencies-for-data-with-grades-1402.2071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attribute-dependencies-for-data-with-grades-1402.2071"/></url>
<url><loc>https://scifaro.com/en/abs/ptime-computation-of-transitive-closures-of-octagonal-relations-1402.2102</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ptime-computation-of-transitive-closures-of-octagonal-relations-1402.2102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ptime-computation-of-transitive-closures-of-octagonal-relations-1402.2102"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-entailments-in-inductive-separation-logic-with-tree-automata-1402.2127</loc><lastmod>2014-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-entailments-in-inductive-separation-logic-with-tree-automata-1402.2127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-entailments-in-inductive-separation-logic-with-tree-automata-1402.2127"/></url>
<url><loc>https://scifaro.com/en/abs/structural-refinement-for-the-modal-nu-calculus-1402.2143</loc><lastmod>2014-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-refinement-for-the-modal-nu-calculus-1402.2143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-refinement-for-the-modal-nu-calculus-1402.2143"/></url>
<url><loc>https://scifaro.com/en/abs/proof-terms-for-infinitary-rewriting-progress-report-1402.2245</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-terms-for-infinitary-rewriting-progress-report-1402.2245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-terms-for-infinitary-rewriting-progress-report-1402.2245"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-qbf-solving-1402.2410</loc><lastmod>2014-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-qbf-solving-1402.2410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-qbf-solving-1402.2410"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-quantified-cuts-in-logic-with-equality-1402.2474</loc><lastmod>2014-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-quantified-cuts-in-logic-with-equality-1402.2474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-quantified-cuts-in-logic-with-equality-1402.2474"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-synthesis-and-correction-of-concurrent-systems-via-mso-logic-1402.2698</loc><lastmod>2014-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-synthesis-and-correction-of-concurrent-systems-via-mso-logic-1402.2698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-synthesis-and-correction-of-concurrent-systems-via-mso-logic-1402.2698"/></url>
<url><loc>https://scifaro.com/en/abs/robust-synchronization-in-markov-decision-processes-1402.2840</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-synchronization-in-markov-decision-processes-1402.2840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-synchronization-in-markov-decision-processes-1402.2840"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-well-structured-systems-1402.2908</loc><lastmod>2014-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-well-structured-systems-1402.2908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-well-structured-systems-1402.2908"/></url>
<url><loc>https://scifaro.com/en/abs/mcmas-slk-a-model-checker-for-the-verification-of-strategy-logic-specifications-1402.2948</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcmas-slk-a-model-checker-for-the-verification-of-strategy-logic-specifications-1402.2948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcmas-slk-a-model-checker-for-the-verification-of-strategy-logic-specifications-1402.2948"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-markov-decision-processes-using-learning-algorithms-1402.2967</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-markov-decision-processes-using-learning-algorithms-1402.2967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-markov-decision-processes-using-learning-algorithms-1402.2967"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimal-sets-on-propositional-formulae-i-problems-reductions-1402.3011</loc><lastmod>2014-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimal-sets-on-propositional-formulae-i-problems-reductions-1402.3011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimal-sets-on-propositional-formulae-i-problems-reductions-1402.3011"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-jumps-in-multiagent-justification-logic-under-interacting-justifications-1402.3066</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-jumps-in-multiagent-justification-logic-under-interacting-justifications-1402.3066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-jumps-in-multiagent-justification-logic-under-interacting-justifications-1402.3066"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-synthesis-for-acyclic-architectures-1402.3314</loc><lastmod>2014-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-synthesis-for-acyclic-architectures-1402.3314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-synthesis-for-acyclic-architectures-1402.3314"/></url>
<url><loc>https://scifaro.com/en/abs/from-ltl-to-deterministic-automata-a-safraless-compositional-approach-1402.3388</loc><lastmod>2014-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-ltl-to-deterministic-automata-a-safraless-compositional-approach-1402.3388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-ltl-to-deterministic-automata-a-safraless-compositional-approach-1402.3388"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-kill-epsilons-with-a-dagger-a-coalgebraic-take-on-systems-with-algebraic-label-structure-1402.4062</loc><lastmod>2016-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-kill-epsilons-with-a-dagger-a-coalgebraic-take-on-systems-with-algebraic-label-structure-1402.4062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-kill-epsilons-with-a-dagger-a-coalgebraic-take-on-systems-with-algebraic-label-structure-1402.4062"/></url>
<url><loc>https://scifaro.com/en/abs/a-propositional-system-induced-by-japaridze-s-approach-to-if-logic-1402.4172</loc><lastmod>2014-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-propositional-system-induced-by-japaridze-s-approach-to-if-logic-1402.4172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-propositional-system-induced-by-japaridze-s-approach-to-if-logic-1402.4172"/></url>
<url><loc>https://scifaro.com/en/abs/unification-and-logarithmic-space-1402.4327</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-and-logarithmic-space-1402.4327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-and-logarithmic-space-1402.4327"/></url>
<url><loc>https://scifaro.com/en/abs/a-normative-account-of-defeasible-and-probabilistic-inference-1402.4741</loc><lastmod>2014-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normative-account-of-defeasible-and-probabilistic-inference-1402.4741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normative-account-of-defeasible-and-probabilistic-inference-1402.4741"/></url>
<url><loc>https://scifaro.com/en/abs/on-algorithmic-equivalence-of-instruction-sequences-for-computing-bit-string-functions-1402.4950</loc><lastmod>2015-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-algorithmic-equivalence-of-instruction-sequences-for-computing-bit-string-functions-1402.4950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-algorithmic-equivalence-of-instruction-sequences-for-computing-bit-string-functions-1402.4950"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-trace-and-testing-equivalences-for-nondeterministic-and-probabilistic-processes-1402.5365</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-trace-and-testing-equivalences-for-nondeterministic-and-probabilistic-processes-1402.5365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-trace-and-testing-equivalences-for-nondeterministic-and-probabilistic-processes-1402.5365"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-computer-ii-normal-complexity-by-string-diagrams-1402.5687</loc><lastmod>2014-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-computer-ii-normal-complexity-by-string-diagrams-1402.5687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-computer-ii-normal-complexity-by-string-diagrams-1402.5687"/></url>
<url><loc>https://scifaro.com/en/abs/regular-path-queries-on-graphs-with-data-a-rigid-approach-1402.6067</loc><lastmod>2014-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-path-queries-on-graphs-with-data-a-rigid-approach-1402.6067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-path-queries-on-graphs-with-data-a-rigid-approach-1402.6067"/></url>
<url><loc>https://scifaro.com/en/abs/on-coalgebras-with-internal-moves-1402.6281</loc><lastmod>2014-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-coalgebras-with-internal-moves-1402.6281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-coalgebras-with-internal-moves-1402.6281"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-view-on-scheduling-in-concurrency-1402.6459</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-view-on-scheduling-in-concurrency-1402.6459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-view-on-scheduling-in-concurrency-1402.6459"/></url>
<url><loc>https://scifaro.com/en/abs/extending-alcqio-with-reachability-1402.6804</loc><lastmod>2014-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-alcqio-with-reachability-1402.6804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-alcqio-with-reachability-1402.6804"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-model-expansion-interleaving-grounding-with-search-1402.6889</loc><lastmod>2015-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-model-expansion-interleaving-grounding-with-search-1402.6889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-model-expansion-interleaving-grounding-with-search-1402.6889"/></url>
<url><loc>https://scifaro.com/en/abs/nested-regular-path-queries-in-description-logics-1402.7122</loc><lastmod>2014-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-regular-path-queries-in-description-logics-1402.7122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-regular-path-queries-in-description-logics-1402.7122"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-character-string-proof-of-the-true-but-unprovable-version-of-g-odel-s-first-incompleteness-theorem-1402.7253</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-character-string-proof-of-the-true-but-unprovable-version-of-g-odel-s-first-incompleteness-theorem-1402.7253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-character-string-proof-of-the-true-but-unprovable-version-of-g-odel-s-first-incompleteness-theorem-1402.7253"/></url>
<url><loc>https://scifaro.com/en/abs/behavior-recognition-and-analysis-in-smart-environments-for-context-aware-applications-1403.0185</loc><lastmod>2016-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavior-recognition-and-analysis-in-smart-environments-for-context-aware-applications-1403.0185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavior-recognition-and-analysis-in-smart-environments-for-context-aware-applications-1403.0185"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-q-resolution-and-prenex-form-a-proof-system-for-quantified-constraint-satisfaction-1403.0222</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-q-resolution-and-prenex-form-a-proof-system-for-quantified-constraint-satisfaction-1403.0222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-q-resolution-and-prenex-form-a-proof-system-for-quantified-constraint-satisfaction-1403.0222"/></url>
<url><loc>https://scifaro.com/en/abs/ac-kbo-revisited-1403.0406</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ac-kbo-revisited-1403.0406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ac-kbo-revisited-1403.0406"/></url>
<url><loc>https://scifaro.com/en/abs/proof-identity-for-mere-mortals-1403.0641</loc><lastmod>2014-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-identity-for-mere-mortals-1403.0641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-identity-for-mere-mortals-1403.0641"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-category-of-polynomial-functors-extensional-part-1403.0833</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-category-of-polynomial-functors-extensional-part-1403.0833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-category-of-polynomial-functors-extensional-part-1403.0833"/></url>
<url><loc>https://scifaro.com/en/abs/classical-realizability-and-arithmetical-formul-ae-1403.0875</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-realizability-and-arithmetical-formul-ae-1403.0875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-realizability-and-arithmetical-formul-ae-1403.0875"/></url>
<url><loc>https://scifaro.com/en/abs/ltlf-satisfiability-checking-1403.1666</loc><lastmod>2014-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltlf-satisfiability-checking-1403.1666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltlf-satisfiability-checking-1403.1666"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-variable-hierarchy-of-first-order-spectra-1403.2225</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-variable-hierarchy-of-first-order-spectra-1403.2225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-variable-hierarchy-of-first-order-spectra-1403.2225"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-logico-numerical-strategy-iteration-extended-version-1403.2319</loc><lastmod>2014-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-logico-numerical-strategy-iteration-extended-version-1403.2319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-logico-numerical-strategy-iteration-extended-version-1403.2319"/></url>
<url><loc>https://scifaro.com/en/abs/hott-formalisation-in-coq-dependency-graphs-ml4pg-1403.2531</loc><lastmod>2014-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hott-formalisation-in-coq-dependency-graphs-ml4pg-1403.2531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hott-formalisation-in-coq-dependency-graphs-ml4pg-1403.2531"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-and-depth-against-nondeterminism-in-proof-search-1403.2628</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-and-depth-against-nondeterminism-in-proof-search-1403.2628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-and-depth-against-nondeterminism-in-proof-search-1403.2628"/></url>
<url><loc>https://scifaro.com/en/abs/transformation-von-scade-modellen-zur-smt-basierten-verifikation-1403.2752</loc><lastmod>2014-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transformation-von-scade-modellen-zur-smt-basierten-verifikation-1403.2752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transformation-von-scade-modellen-zur-smt-basierten-verifikation-1403.2752"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-optical-systems-1403.3039</loc><lastmod>2014-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-optical-systems-1403.3039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-optical-systems-1403.3039"/></url>
<url><loc>https://scifaro.com/en/abs/the-computational-compexity-of-decision-problem-in-additive-extensions-of-nonassociative-lambek-calculus-1403.3157</loc><lastmod>2014-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computational-compexity-of-decision-problem-in-additive-extensions-of-nonassociative-lambek-calculus-1403.3157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computational-compexity-of-decision-problem-in-additive-extensions-of-nonassociative-lambek-calculus-1403.3157"/></url>
<url><loc>https://scifaro.com/en/abs/automated-reasoning-in-social-choice-theory-some-remarks-1403.3391</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-reasoning-in-social-choice-theory-some-remarks-1403.3391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-reasoning-in-social-choice-theory-some-remarks-1403.3391"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-borel-complexity-of-regular-tree-languages-1403.3502</loc><lastmod>2014-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-borel-complexity-of-regular-tree-languages-1403.3502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-borel-complexity-of-regular-tree-languages-1403.3502"/></url>
<url><loc>https://scifaro.com/en/abs/study-of-behaviours-via-visitable-paths-1403.3772</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/study-of-behaviours-via-visitable-paths-1403.3772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/study-of-behaviours-via-visitable-paths-1403.3772"/></url>
<url><loc>https://scifaro.com/en/abs/hypothesis-elimination-in-kleene-semirings-1403.4074</loc><lastmod>2014-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypothesis-elimination-in-kleene-semirings-1403.4074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypothesis-elimination-in-kleene-semirings-1403.4074"/></url>
<url><loc>https://scifaro.com/en/abs/towards-3-dimensional-rewriting-theory-1403.4094</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-3-dimensional-rewriting-theory-1403.4094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-3-dimensional-rewriting-theory-1403.4094"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-information-and-artificial-intelligence-1403.4202</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-information-and-artificial-intelligence-1403.4202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-information-and-artificial-intelligence-1403.4202"/></url>
<url><loc>https://scifaro.com/en/abs/two-puzzles-about-computation-1403.4880</loc><lastmod>2014-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-puzzles-about-computation-1403.4880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-puzzles-about-computation-1403.4880"/></url>
<url><loc>https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-ii-deterministic-cyclic-negotiations-1403.4958</loc><lastmod>2016-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-ii-deterministic-cyclic-negotiations-1403.4958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-negotiation-as-concurrency-primitive-ii-deterministic-cyclic-negotiations-1403.4958"/></url>
<url><loc>https://scifaro.com/en/abs/partial-order-infinitary-term-rewriting-1403.5644</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-order-infinitary-term-rewriting-1403.5644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-order-infinitary-term-rewriting-1403.5644"/></url>
<url><loc>https://scifaro.com/en/abs/collaborative-verification-driven-engineering-of-hybrid-systems-1403.6085</loc><lastmod>2015-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collaborative-verification-driven-engineering-of-hybrid-systems-1403.6085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collaborative-verification-driven-engineering-of-hybrid-systems-1403.6085"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-term-rewriting-for-weakly-orthogonal-systems-properties-and-counterexamples-1403.6172</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-term-rewriting-for-weakly-orthogonal-systems-properties-and-counterexamples-1403.6172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-term-rewriting-for-weakly-orthogonal-systems-properties-and-counterexamples-1403.6172"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-in-linguistic-first-order-logic-based-on-linear-symmetrical-hedge-algebra-1403.6237</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-in-linguistic-first-order-logic-based-on-linear-symmetrical-hedge-algebra-1403.6237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-in-linguistic-first-order-logic-based-on-linear-symmetrical-hedge-algebra-1403.6237"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-scalability-and-uniformity-in-sat-witness-generator-1403.6246</loc><lastmod>2014-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-scalability-and-uniformity-in-sat-witness-generator-1403.6246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-scalability-and-uniformity-in-sat-witness-generator-1403.6246"/></url>
<url><loc>https://scifaro.com/en/abs/verification-for-timed-automata-extended-with-unbounded-discrete-data-structures-1403.6303</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-for-timed-automata-extended-with-unbounded-discrete-data-structures-1403.6303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-for-timed-automata-extended-with-unbounded-discrete-data-structures-1403.6303"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-hybrid-systems-with-denial-of-service-security-attack-1403.6367</loc><lastmod>2014-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-hybrid-systems-with-denial-of-service-security-attack-1403.6367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-hybrid-systems-with-denial-of-service-security-attack-1403.6367"/></url>
<url><loc>https://scifaro.com/en/abs/fully-abstract-game-semantics-for-actors-1403.6563</loc><lastmod>2019-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-abstract-game-semantics-for-actors-1403.6563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-abstract-game-semantics-for-actors-1403.6563"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-revised-datalog-on-problems-with-closure-properties-1403.6611</loc><lastmod>2023-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-revised-datalog-on-problems-with-closure-properties-1403.6611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-revised-datalog-on-problems-with-closure-properties-1403.6611"/></url>
<url><loc>https://scifaro.com/en/abs/on-equivalence-of-infinitary-formulas-under-the-stable-model-semantics-1403.6689</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-equivalence-of-infinitary-formulas-under-the-stable-model-semantics-1403.6689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-equivalence-of-infinitary-formulas-under-the-stable-model-semantics-1403.6689"/></url>
<url><loc>https://scifaro.com/en/abs/interacting-hopf-algebras-1403.7048</loc><lastmod>2016-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interacting-hopf-algebras-1403.7048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interacting-hopf-algebras-1403.7048"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-of-event-structures-under-history-preserving-bisimulation-1403.7181</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-of-event-structures-under-history-preserving-bisimulation-1403.7181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-of-event-structures-under-history-preserving-bisimulation-1403.7181"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-workshop-on-synthesis-1403.7264</loc><lastmod>2014-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-synthesis-1403.7264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-synthesis-1403.7264"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-finite-algebras-1403.7347</loc><lastmod>2014-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-finite-algebras-1403.7347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-finite-algebras-1403.7347"/></url>
<url><loc>https://scifaro.com/en/abs/exposition-synthesis-via-functional-interpretation-1403.7353</loc><lastmod>2014-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exposition-synthesis-via-functional-interpretation-1403.7353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exposition-synthesis-via-functional-interpretation-1403.7353"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-developments-in-computational-models-1403.7579</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-developments-in-computational-models-1403.7579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-developments-in-computational-models-1403.7579"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-developments-in-computational-models-1403.7685</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-developments-in-computational-models-1403.7685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-developments-in-computational-models-1403.7685"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-properties-of-stochastic-effectivity-functions-1403.7745</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-properties-of-stochastic-effectivity-functions-1403.7745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-properties-of-stochastic-effectivity-functions-1403.7745"/></url>
<url><loc>https://scifaro.com/en/abs/categories-and-all-that-a-tutorial-1403.7760</loc><lastmod>2014-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categories-and-all-that-a-tutorial-1403.7760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categories-and-all-that-a-tutorial-1403.7760"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-interpretation-of-game-logic-1403.7765</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-interpretation-of-game-logic-1403.7765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-interpretation-of-game-logic-1403.7765"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-with-graphs-1403.7828</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-with-graphs-1403.7828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-with-graphs-1403.7828"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-translation-from-nested-petri-nets-into-promela-1403.7991</loc><lastmod>2014-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-translation-from-nested-petri-nets-into-promela-1403.7991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-translation-from-nested-petri-nets-into-promela-1403.7991"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-of-concepts-from-computable-analysis-and-effective-descriptive-set-theory-1403.7997</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-of-concepts-from-computable-analysis-and-effective-descriptive-set-theory-1403.7997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-of-concepts-from-computable-analysis-and-effective-descriptive-set-theory-1403.7997"/></url>
<url><loc>https://scifaro.com/en/abs/e-generalization-using-grammars-1403.8118</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/e-generalization-using-grammars-1403.8118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/e-generalization-using-grammars-1403.8118"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-computation-and-the-jayne-rogers-theorem-1404.0079</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-computation-and-the-jayne-rogers-theorem-1404.0079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-computation-and-the-jayne-rogers-theorem-1404.0079"/></url>
<url><loc>https://scifaro.com/en/abs/algorithm-and-proof-as-omega-invariance-and-transfer-a-new-model-of-computation-in-nonstandard-analysis-1404.0080</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithm-and-proof-as-omega-invariance-and-transfer-a-new-model-of-computation-in-nonstandard-analysis-1404.0080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithm-and-proof-as-omega-invariance-and-transfer-a-new-model-of-computation-in-nonstandard-analysis-1404.0080"/></url>
<url><loc>https://scifaro.com/en/abs/the-probability-of-non-confluent-systems-1404.0081</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-probability-of-non-confluent-systems-1404.0081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-probability-of-non-confluent-systems-1404.0081"/></url>
<url><loc>https://scifaro.com/en/abs/proof-graphs-for-minimal-implicational-logic-1404.0082</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-graphs-for-minimal-implicational-logic-1404.0082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-graphs-for-minimal-implicational-logic-1404.0082"/></url>
<url><loc>https://scifaro.com/en/abs/mtl-model-checking-of-one-clock-parametric-timed-automata-is-undecidable-1404.0087</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mtl-model-checking-of-one-clock-parametric-timed-automata-is-undecidable-1404.0087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mtl-model-checking-of-one-clock-parametric-timed-automata-is-undecidable-1404.0087"/></url>
<url><loc>https://scifaro.com/en/abs/modal-independence-logic-1404.0144</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-independence-logic-1404.0144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-independence-logic-1404.0144"/></url>
<url><loc>https://scifaro.com/en/abs/hyperprojective-hierarchy-of-qcb-0-spaces-1404.0297</loc><lastmod>2014-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperprojective-hierarchy-of-qcb-0-spaces-1404.0297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperprojective-hierarchy-of-qcb-0-spaces-1404.0297"/></url>
<url><loc>https://scifaro.com/en/abs/on-affine-logic-and-l-ukasiewicz-logic-1404.0570</loc><lastmod>2014-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-affine-logic-and-l-ukasiewicz-logic-1404.0570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-affine-logic-and-l-ukasiewicz-logic-1404.0570"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-1404.0606</loc><lastmod>2014-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-1404.0606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-1404.0606"/></url>
<url><loc>https://scifaro.com/en/abs/security-analyses-of-quantum-communication-protocols-1404.0665</loc><lastmod>2021-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/security-analyses-of-quantum-communication-protocols-1404.0665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/security-analyses-of-quantum-communication-protocols-1404.0665"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-epistemic-strategy-logic-1404.0837</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-epistemic-strategy-logic-1404.0837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-epistemic-strategy-logic-1404.0837"/></url>
<url><loc>https://scifaro.com/en/abs/an-epistemic-strategy-logic-extended-abstract-1404.0838</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-epistemic-strategy-logic-extended-abstract-1404.0838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-epistemic-strategy-logic-extended-abstract-1404.0838"/></url>
<url><loc>https://scifaro.com/en/abs/refining-and-delegating-strategic-ability-in-atl-1404.0840</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-and-delegating-strategic-ability-in-atl-1404.0840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-and-delegating-strategic-ability-in-atl-1404.0840"/></url>
<url><loc>https://scifaro.com/en/abs/a-resolution-prover-for-coalition-logic-1404.0841</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-resolution-prover-for-coalition-logic-1404.0841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-resolution-prover-for-coalition-logic-1404.0841"/></url>
<url><loc>https://scifaro.com/en/abs/first-cycle-games-1404.0843</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-cycle-games-1404.0843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-cycle-games-1404.0843"/></url>
<url><loc>https://scifaro.com/en/abs/automata-techniques-for-epistemic-protocol-synthesis-1404.0844</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-techniques-for-epistemic-protocol-synthesis-1404.0844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-techniques-for-epistemic-protocol-synthesis-1404.0844"/></url>
<url><loc>https://scifaro.com/en/abs/enabling-automatic-certification-of-online-auctions-1404.0854</loc><lastmod>2014-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enabling-automatic-certification-of-online-auctions-1404.0854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enabling-automatic-certification-of-online-auctions-1404.0854"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-anti-unification-modulo-equational-theory-1404.0953</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-anti-unification-modulo-equational-theory-1404.0953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-anti-unification-modulo-equational-theory-1404.0953"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-via-intensionality-and-concurrency-1404.0956</loc><lastmod>2014-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-via-intensionality-and-concurrency-1404.0956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-via-intensionality-and-concurrency-1404.0956"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-weak-bisimulation-from-recursive-equations-over-monads-1404.1215</loc><lastmod>2014-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-weak-bisimulation-from-recursive-equations-over-monads-1404.1215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-weak-bisimulation-from-recursive-equations-over-monads-1404.1215"/></url>
<url><loc>https://scifaro.com/en/abs/layer-systems-for-proving-confluence-1404.1225</loc><lastmod>2015-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layer-systems-for-proving-confluence-1404.1225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layer-systems-for-proving-confluence-1404.1225"/></url>
<url><loc>https://scifaro.com/en/abs/formale-entwicklung-einer-steuerung-f-ur-eine-fertigungszelle-mit-sysyfos-1404.1227</loc><lastmod>2014-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formale-entwicklung-einer-steuerung-f-ur-eine-fertigungszelle-mit-sysyfos-1404.1227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formale-entwicklung-einer-steuerung-f-ur-eine-fertigungszelle-mit-sysyfos-1404.1227"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-remarkable-features-of-binding-forms-1404.1531</loc><lastmod>2014-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-remarkable-features-of-binding-forms-1404.1531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-remarkable-features-of-binding-forms-1404.1531"/></url>
<url><loc>https://scifaro.com/en/abs/eine-entscheidbare-klasse-n-stelliger-horn-pr-adikate-1404.1947</loc><lastmod>2014-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eine-entscheidbare-klasse-n-stelliger-horn-pr-adikate-1404.1947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eine-entscheidbare-klasse-n-stelliger-horn-pr-adikate-1404.1947"/></url>
<url><loc>https://scifaro.com/en/abs/acl2-ml-machine-learning-for-acl2-1404.3034</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acl2-ml-machine-learning-for-acl2-1404.3034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acl2-ml-machine-learning-for-acl2-1404.3034"/></url>
<url><loc>https://scifaro.com/en/abs/the-zx-calculus-is-incomplete-for-quantum-mechanics-1404.3633</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-zx-calculus-is-incomplete-for-quantum-mechanics-1404.3633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-zx-calculus-is-incomplete-for-quantum-mechanics-1404.3633"/></url>
<url><loc>https://scifaro.com/en/abs/mu-calculus-on-data-words-1404.4827</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mu-calculus-on-data-words-1404.4827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mu-calculus-on-data-words-1404.4827"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-games-with-interval-objectives-1404.4856</loc><lastmod>2014-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-games-with-interval-objectives-1404.4856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-games-with-interval-objectives-1404.4856"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-bisimulation-naturally-on-distributions-1404.5084</loc><lastmod>2014-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-bisimulation-naturally-on-distributions-1404.5084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-bisimulation-naturally-on-distributions-1404.5084"/></url>
<url><loc>https://scifaro.com/en/abs/trace-inclusion-for-one-counter-nets-revisited-1404.5157</loc><lastmod>2015-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-inclusion-for-one-counter-nets-revisited-1404.5157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-inclusion-for-one-counter-nets-revisited-1404.5157"/></url>
<url><loc>https://scifaro.com/en/abs/lax-functors-and-coalgebraic-weak-bisimulation-1404.5267</loc><lastmod>2015-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lax-functors-and-coalgebraic-weak-bisimulation-1404.5267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lax-functors-and-coalgebraic-weak-bisimulation-1404.5267"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-for-systems-biology-1404.5439</loc><lastmod>2014-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-for-systems-biology-1404.5439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-for-systems-biology-1404.5439"/></url>
<url><loc>https://scifaro.com/en/abs/games-with-a-weak-adversary-1404.5453</loc><lastmod>2014-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-with-a-weak-adversary-1404.5453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-with-a-weak-adversary-1404.5453"/></url>
<url><loc>https://scifaro.com/en/abs/ilp-modulo-data-1404.5665</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ilp-modulo-data-1404.5665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ilp-modulo-data-1404.5665"/></url>
<url><loc>https://scifaro.com/en/abs/structural-interactions-and-absorption-of-structural-rules-in-bi-sequent-calculus-1404.6037</loc><lastmod>2016-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-interactions-and-absorption-of-structural-rules-in-bi-sequent-calculus-1404.6037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-interactions-and-absorption-of-structural-rules-in-bi-sequent-calculus-1404.6037"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-navigation-on-multi-attributed-data-words-1404.6064</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-navigation-on-multi-attributed-data-words-1404.6064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-navigation-on-multi-attributed-data-words-1404.6064"/></url>
<url><loc>https://scifaro.com/en/abs/proofpeer-collaborative-theorem-proving-1404.6186</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofpeer-collaborative-theorem-proving-1404.6186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofpeer-collaborative-theorem-proving-1404.6186"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-of-unfolding-graph-rewriting-for-general-safe-recursion-1404.6196</loc><lastmod>2014-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-of-unfolding-graph-rewriting-for-general-safe-recursion-1404.6196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-of-unfolding-graph-rewriting-for-general-safe-recursion-1404.6196"/></url>
<url><loc>https://scifaro.com/en/abs/synthesising-succinct-strategies-in-safety-games-1404.6228</loc><lastmod>2014-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesising-succinct-strategies-in-safety-games-1404.6228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesising-succinct-strategies-in-safety-games-1404.6228"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-ordering-for-termination-proving-1404.6245</loc><lastmod>2014-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-ordering-for-termination-proving-1404.6245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-ordering-for-termination-proving-1404.6245"/></url>
<url><loc>https://scifaro.com/en/abs/piecewise-boolean-algebras-and-their-domains-1404.6277</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piecewise-boolean-algebras-and-their-domains-1404.6277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piecewise-boolean-algebras-and-their-domains-1404.6277"/></url>
<url><loc>https://scifaro.com/en/abs/inference-in-the-fo-c-modelling-language-1404.6368</loc><lastmod>2014-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inference-in-the-fo-c-modelling-language-1404.6368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inference-in-the-fo-c-modelling-language-1404.6368"/></url>
<url><loc>https://scifaro.com/en/abs/fo-c-and-related-modelling-paradigms-1404.6394</loc><lastmod>2014-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-c-and-related-modelling-paradigms-1404.6394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-c-and-related-modelling-paradigms-1404.6394"/></url>
<url><loc>https://scifaro.com/en/abs/computability-of-1-manifolds-1404.6487</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-of-1-manifolds-1404.6487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-of-1-manifolds-1404.6487"/></url>
<url><loc>https://scifaro.com/en/abs/speedy-an-eclipse-based-ide-for-invariant-inference-1404.6605</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speedy-an-eclipse-based-ide-for-invariant-inference-1404.6605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speedy-an-eclipse-based-ide-for-invariant-inference-1404.6605"/></url>
<url><loc>https://scifaro.com/en/abs/nagoya-termination-tool-1404.6626</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nagoya-termination-tool-1404.6626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nagoya-termination-tool-1404.6626"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-techniques-for-boolean-satisfiability-1404.6682</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-techniques-for-boolean-satisfiability-1404.6682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-techniques-for-boolean-satisfiability-1404.6682"/></url>
<url><loc>https://scifaro.com/en/abs/a-family-of-descriptive-approaches-to-preferred-answer-sets-1404.6781</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-family-of-descriptive-approaches-to-preferred-answer-sets-1404.6781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-family-of-descriptive-approaches-to-preferred-answer-sets-1404.6781"/></url>
<url><loc>https://scifaro.com/en/abs/partially-punctual-metric-temporal-logic-is-decidable-1404.6965</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-punctual-metric-temporal-logic-is-decidable-1404.6965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-punctual-metric-temporal-logic-is-decidable-1404.6965"/></url>
<url><loc>https://scifaro.com/en/abs/dividing-line-between-decidable-pda-s-and-undecidable-ones-1404.7015</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dividing-line-between-decidable-pda-s-and-undecidable-ones-1404.7015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dividing-line-between-decidable-pda-s-and-undecidable-ones-1404.7015"/></url>
<url><loc>https://scifaro.com/en/abs/time-petri-nets-with-dynamic-firing-dates-semantics-and-applications-1404.7067</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-petri-nets-with-dynamic-firing-dates-semantics-and-applications-1404.7067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-petri-nets-with-dynamic-firing-dates-semantics-and-applications-1404.7067"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-against-power-is-pspace-complete-1404.7092</loc><lastmod>2014-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-against-power-is-pspace-complete-1404.7092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-against-power-is-pspace-complete-1404.7092"/></url>
<url><loc>https://scifaro.com/en/abs/weak-mso-u-with-path-quantifiers-over-infinite-trees-1404.7278</loc><lastmod>2014-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-mso-u-with-path-quantifiers-over-infinite-trees-1404.7278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-mso-u-with-path-quantifiers-over-infinite-trees-1404.7278"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proofs-for-nonlinear-optimization-1404.7282</loc><lastmod>2015-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proofs-for-nonlinear-optimization-1404.7282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proofs-for-nonlinear-optimization-1404.7282"/></url>
<url><loc>https://scifaro.com/en/abs/open-induction-in-a-bounded-arithmetic-for-tc-0-1404.7435</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-induction-in-a-bounded-arithmetic-for-tc-0-1404.7435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-induction-in-a-bounded-arithmetic-for-tc-0-1404.7435"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-formative-rules-1404.7695</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-formative-rules-1404.7695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-formative-rules-1404.7695"/></url>
<url><loc>https://scifaro.com/en/abs/games-with-recurring-certainty-1404.7770</loc><lastmod>2014-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-with-recurring-certainty-1404.7770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-with-recurring-certainty-1404.7770"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-like-common-knowledge-binmore-brandenburger-operator-approach-1404.7809</loc><lastmod>2014-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-like-common-knowledge-binmore-brandenburger-operator-approach-1404.7809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-like-common-knowledge-binmore-brandenburger-operator-approach-1404.7809"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-and-semantics-of-linear-dependent-types-1405.0033</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-and-semantics-of-linear-dependent-types-1405.0033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-and-semantics-of-linear-dependent-types-1405.0033"/></url>
<url><loc>https://scifaro.com/en/abs/clausal-resolution-for-modal-logics-of-confluence-1405.0293</loc><lastmod>2014-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clausal-resolution-for-modal-logics-of-confluence-1405.0293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clausal-resolution-for-modal-logics-of-confluence-1405.0293"/></url>
<url><loc>https://scifaro.com/en/abs/fatal-attractors-in-parity-games-building-blocks-for-partial-solvers-1405.0386</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fatal-attractors-in-parity-games-building-blocks-for-partial-solvers-1405.0386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fatal-attractors-in-parity-games-building-blocks-for-partial-solvers-1405.0386"/></url>
<url><loc>https://scifaro.com/en/abs/safraless-synthesis-for-epistemic-temporal-specifications-1405.0424</loc><lastmod>2014-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safraless-synthesis-for-epistemic-temporal-specifications-1405.0424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safraless-synthesis-for-epistemic-temporal-specifications-1405.0424"/></url>
<url><loc>https://scifaro.com/en/abs/how-many-times-do-we-need-and-assumption-1405.0541</loc><lastmod>2014-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-many-times-do-we-need-and-assumption-1405.0541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-many-times-do-we-need-and-assumption-1405.0541"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-parameterised-knowledge-operations-in-temporal-logic-1405.0559</loc><lastmod>2014-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-parameterised-knowledge-operations-in-temporal-logic-1405.0559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-parameterised-knowledge-operations-in-temporal-logic-1405.0559"/></url>
<url><loc>https://scifaro.com/en/abs/cegar-for-qualitative-analysis-of-probabilistic-systems-1405.0835</loc><lastmod>2014-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cegar-for-qualitative-analysis-of-probabilistic-systems-1405.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cegar-for-qualitative-analysis-of-probabilistic-systems-1405.0835"/></url>
<url><loc>https://scifaro.com/en/abs/unguarded-recursion-on-coinductive-resumptions-1405.0854</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unguarded-recursion-on-coinductive-resumptions-1405.0854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unguarded-recursion-on-coinductive-resumptions-1405.0854"/></url>
<url><loc>https://scifaro.com/en/abs/semantically-guided-evolution-of-mathcal-shi-aboxes-1405.1192</loc><lastmod>2014-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantically-guided-evolution-of-mathcal-shi-aboxes-1405.1192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantically-guided-evolution-of-mathcal-shi-aboxes-1405.1192"/></url>
<url><loc>https://scifaro.com/en/abs/three-semantics-for-modular-systems-1405.1229</loc><lastmod>2014-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-semantics-for-modular-systems-1405.1229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-semantics-for-modular-systems-1405.1229"/></url>
<url><loc>https://scifaro.com/en/abs/global-numerical-constraints-on-trees-1405.1295</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-numerical-constraints-on-trees-1405.1295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-numerical-constraints-on-trees-1405.1295"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-dynamic-systems-using-linear-time-calculus-theories-1405.1523</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-dynamic-systems-using-linear-time-calculus-theories-1405.1523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-dynamic-systems-using-linear-time-calculus-theories-1405.1523"/></url>
<url><loc>https://scifaro.com/en/abs/a-concurrent-pattern-calculus-1405.1546</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concurrent-pattern-calculus-1405.1546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concurrent-pattern-calculus-1405.1546"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-vs-sequent-calculi-for-minimal-entailment-1405.1565</loc><lastmod>2014-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-vs-sequent-calculi-for-minimal-entailment-1405.1565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-vs-sequent-calculi-for-minimal-entailment-1405.1565"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-delegation-and-revocation-schemes-in-idp-1405.1584</loc><lastmod>2014-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-delegation-and-revocation-schemes-in-idp-1405.1584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-delegation-and-revocation-schemes-in-idp-1405.1584"/></url>
<url><loc>https://scifaro.com/en/abs/computability-and-complexity-over-the-product-topology-of-real-numbers-1405.1590</loc><lastmod>2014-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-and-complexity-over-the-product-topology-of-real-numbers-1405.1590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-and-complexity-over-the-product-topology-of-real-numbers-1405.1590"/></url>
<url><loc>https://scifaro.com/en/abs/fo-c-a-knowledge-representation-language-of-causality-1405.1833</loc><lastmod>2014-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-c-a-knowledge-representation-language-of-causality-1405.1833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-c-a-knowledge-representation-language-of-causality-1405.1833"/></url>
<url><loc>https://scifaro.com/en/abs/keeping-a-crowd-safe-on-the-complexity-of-parameterized-verification-corrected-version-1405.1841</loc><lastmod>2014-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/keeping-a-crowd-safe-on-the-complexity-of-parameterized-verification-corrected-version-1405.1841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/keeping-a-crowd-safe-on-the-complexity-of-parameterized-verification-corrected-version-1405.1841"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-study-of-soft-concurrent-constraint-programming-1405.2329</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-study-of-soft-concurrent-constraint-programming-1405.2329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-study-of-soft-concurrent-constraint-programming-1405.2329"/></url>
<url><loc>https://scifaro.com/en/abs/g4ltl-st-automatic-generation-of-plc-programs-1405.2409</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/g4ltl-st-automatic-generation-of-plc-programs-1405.2409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/g4ltl-st-automatic-generation-of-plc-programs-1405.2409"/></url>
<url><loc>https://scifaro.com/en/abs/a-measure-of-arbitrariness-in-abductive-explanations-1405.2494</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-measure-of-arbitrariness-in-abductive-explanations-1405.2494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-measure-of-arbitrariness-in-abductive-explanations-1405.2494"/></url>
<url><loc>https://scifaro.com/en/abs/an-abductive-framework-for-horn-knowledge-base-dynamics-1405.2642</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abductive-framework-for-horn-knowledge-base-dynamics-1405.2642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abductive-framework-for-horn-knowledge-base-dynamics-1405.2642"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-model-checking-for-biological-applications-1405.2705</loc><lastmod>2014-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-model-checking-for-biological-applications-1405.2705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-model-checking-for-biological-applications-1405.2705"/></url>
<url><loc>https://scifaro.com/en/abs/the-p-box-cdf-intervals-reliable-constraint-reasoning-with-quantifiable-information-1405.2801</loc><lastmod>2014-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-p-box-cdf-intervals-reliable-constraint-reasoning-with-quantifiable-information-1405.2801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-p-box-cdf-intervals-reliable-constraint-reasoning-with-quantifiable-information-1405.2801"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-total-variation-distance-of-labelled-markov-chains-1405.2852</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-total-variation-distance-of-labelled-markov-chains-1405.2852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-total-variation-distance-of-labelled-markov-chains-1405.2852"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-existential-logic-on-partially-ordered-sets-1405.2891</loc><lastmod>2014-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-existential-logic-on-partially-ordered-sets-1405.2891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-existential-logic-on-partially-ordered-sets-1405.2891"/></url>
<url><loc>https://scifaro.com/en/abs/categories-from-scratch-1405.3073</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categories-from-scratch-1405.3073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categories-from-scratch-1405.3073"/></url>
<url><loc>https://scifaro.com/en/abs/beta-reduction-is-invariant-indeed-long-version-1405.3311</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beta-reduction-is-invariant-indeed-long-version-1405.3311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beta-reduction-is-invariant-indeed-long-version-1405.3311"/></url>
<url><loc>https://scifaro.com/en/abs/a-vernacular-for-coherent-logic-1405.3391</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-vernacular-for-coherent-logic-1405.3391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-vernacular-for-coherent-logic-1405.3391"/></url>
<url><loc>https://scifaro.com/en/abs/hipster-integrating-theory-exploration-in-a-proof-assistant-1405.3426</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hipster-integrating-theory-exploration-in-a-proof-assistant-1405.3426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hipster-integrating-theory-exploration-in-a-proof-assistant-1405.3426"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-synchronization-long-version-1405.3427</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-synchronization-long-version-1405.3427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-synchronization-long-version-1405.3427"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-consistency-checking-in-goal-directed-answer-set-programming-1405.3603</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-consistency-checking-in-goal-directed-answer-set-programming-1405.3603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-consistency-checking-in-goal-directed-answer-set-programming-1405.3603"/></url>
<url><loc>https://scifaro.com/en/abs/on-cascade-products-of-answer-set-programs-1405.3608</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cascade-products-of-answer-set-programs-1405.3608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cascade-products-of-answer-set-programs-1405.3608"/></url>
<url><loc>https://scifaro.com/en/abs/mining-state-based-models-from-proof-corpora-1405.3623</loc><lastmod>2014-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mining-state-based-models-from-proof-corpora-1405.3623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mining-state-based-models-from-proof-corpora-1405.3623"/></url>
<url><loc>https://scifaro.com/en/abs/matching-concepts-across-hol-libraries-1405.3906</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-concepts-across-hol-libraries-1405.3906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-concepts-across-hol-libraries-1405.3906"/></url>
<url><loc>https://scifaro.com/en/abs/saturation-of-the-morphisms-in-the-database-category-1405.3955</loc><lastmod>2014-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/saturation-of-the-morphisms-in-the-database-category-1405.3955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/saturation-of-the-morphisms-in-the-database-category-1405.3955"/></url>
<url><loc>https://scifaro.com/en/abs/cdf-intervals-a-reliable-framework-to-reason-about-data-with-uncertainty-1405.4008</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cdf-intervals-a-reliable-framework-to-reason-about-data-with-uncertainty-1405.4008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cdf-intervals-a-reliable-framework-to-reason-about-data-with-uncertainty-1405.4008"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-bottom-up-simulation-of-sld-resolution-1405.4021</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-bottom-up-simulation-of-sld-resolution-1405.4021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-bottom-up-simulation-of-sld-resolution-1405.4021"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-model-checking-for-recursive-programs-1405.4028</loc><lastmod>2014-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-model-checking-for-recursive-programs-1405.4028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-model-checking-for-recursive-programs-1405.4028"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-complex-vectors-in-higher-order-logic-1405.4034</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-complex-vectors-in-higher-order-logic-1405.4034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-complex-vectors-in-higher-order-logic-1405.4034"/></url>
<url><loc>https://scifaro.com/en/abs/higher-dimensional-modal-logic-1405.4100</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-dimensional-modal-logic-1405.4100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-dimensional-modal-logic-1405.4100"/></url>
<url><loc>https://scifaro.com/en/abs/termination-analysis-by-learning-terminating-programs-1405.4189</loc><lastmod>2022-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-analysis-by-learning-terminating-programs-1405.4189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-analysis-by-learning-terminating-programs-1405.4189"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-unknots-via-equational-reasoning-i-exploration-1405.4211</loc><lastmod>2014-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-unknots-via-equational-reasoning-i-exploration-1405.4211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-unknots-via-equational-reasoning-i-exploration-1405.4211"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-series-as-nontermination-arguments-for-linear-lasso-programs-1405.4413</loc><lastmod>2014-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-series-as-nontermination-arguments-for-linear-lasso-programs-1405.4413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-series-as-nontermination-arguments-for-linear-lasso-programs-1405.4413"/></url>
<url><loc>https://scifaro.com/en/abs/unsolvability-cores-in-classification-problems-1405.4491</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsolvability-cores-in-classification-problems-1405.4491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsolvability-cores-in-classification-problems-1405.4491"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-markov-chains-against-unambiguous-buchi-automata-1405.4560</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-markov-chains-against-unambiguous-buchi-automata-1405.4560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-markov-chains-against-unambiguous-buchi-automata-1405.4560"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-environment-markov-decision-processes-1405.4733</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-environment-markov-decision-processes-1405.4733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-environment-markov-decision-processes-1405.4733"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-pctl-properties-of-stateless-probabilistic-pushdown-systems-1405.4806</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-pctl-properties-of-stateless-probabilistic-pushdown-systems-1405.4806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-pctl-properties-of-stateless-probabilistic-pushdown-systems-1405.4806"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-hardness-criterion-for-surjective-constraint-satisfaction-1405.4917</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-hardness-criterion-for-surjective-constraint-satisfaction-1405.4917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-hardness-criterion-for-surjective-constraint-satisfaction-1405.4917"/></url>
<url><loc>https://scifaro.com/en/abs/finding-all-solutions-of-equations-in-free-groups-and-monoids-with-involution-1405.5133</loc><lastmod>2014-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-all-solutions-of-equations-in-free-groups-and-monoids-with-involution-1405.5133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-all-solutions-of-equations-in-free-groups-and-monoids-with-involution-1405.5133"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-puc-logic-for-constructive-counterfactuals-1405.5279</loc><lastmod>2014-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-puc-logic-for-constructive-counterfactuals-1405.5279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-puc-logic-for-constructive-counterfactuals-1405.5279"/></url>
<url><loc>https://scifaro.com/en/abs/weak-topologies-for-linear-logic-1405.5393</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-topologies-for-linear-logic-1405.5393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-topologies-for-linear-logic-1405.5393"/></url>
<url><loc>https://scifaro.com/en/abs/small-stone-in-pool-1405.5626</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-stone-in-pool-1405.5626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-stone-in-pool-1405.5626"/></url>
<url><loc>https://scifaro.com/en/abs/a-variant-of-earley-deduction-with-partial-evaluation-1405.5645</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variant-of-earley-deduction-with-partial-evaluation-1405.5645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variant-of-earley-deduction-with-partial-evaluation-1405.5645"/></url>
<url><loc>https://scifaro.com/en/abs/non-termination-using-regular-languages-1405.5662</loc><lastmod>2014-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-termination-using-regular-languages-1405.5662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-termination-using-regular-languages-1405.5662"/></url>
<url><loc>https://scifaro.com/en/abs/impossibility-of-gathering-a-certification-1405.5902</loc><lastmod>2014-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/impossibility-of-gathering-a-certification-1405.5902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/impossibility-of-gathering-a-certification-1405.5902"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-monadic-second-order-properties-of-graph-programs-1405.5927</loc><lastmod>2014-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-monadic-second-order-properties-of-graph-programs-1405.5927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-monadic-second-order-properties-of-graph-programs-1405.5927"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-reasoning-for-explicit-resource-management-in-channel-based-concurrency-1405.6100</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-reasoning-for-explicit-resource-management-in-channel-based-concurrency-1405.6100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-reasoning-for-explicit-resource-management-in-channel-based-concurrency-1405.6100"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-graphings-1405.6331</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-graphings-1405.6331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-graphings-1405.6331"/></url>
<url><loc>https://scifaro.com/en/abs/nested-term-graphs-work-in-progress-1405.6380</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-term-graphs-work-in-progress-1405.6380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-term-graphs-work-in-progress-1405.6380"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-type-logical-grammars-first-order-linear-logic-and-the-descriptive-inadequacy-of-lambda-grammars-1405.6678</loc><lastmod>2014-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-type-logical-grammars-first-order-linear-logic-and-the-descriptive-inadequacy-of-lambda-grammars-1405.6678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-type-logical-grammars-first-order-linear-logic-and-the-descriptive-inadequacy-of-lambda-grammars-1405.6678"/></url>
<url><loc>https://scifaro.com/en/abs/negotiation-games-with-abstract-1405.6820</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negotiation-games-with-abstract-1405.6820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negotiation-games-with-abstract-1405.6820"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-equivalent-arrays-1405.6939</loc><lastmod>2014-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-equivalent-arrays-1405.6939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-equivalent-arrays-1405.6939"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-formal-reliability-analysis-of-oil-and-gas-pipelines-1405.6985</loc><lastmod>2015-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-formal-reliability-analysis-of-oil-and-gas-pipelines-1405.6985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-formal-reliability-analysis-of-oil-and-gas-pipelines-1405.6985"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-nondeterminism-and-effectivity-functions-1405.7141</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-nondeterminism-and-effectivity-functions-1405.7141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-nondeterminism-and-effectivity-functions-1405.7141"/></url>
<url><loc>https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-the-description-logic-shoq-1405.7221</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-the-description-logic-shoq-1405.7221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-the-description-logic-shoq-1405.7221"/></url>
<url><loc>https://scifaro.com/en/abs/conformant-planning-as-a-case-study-of-incremental-qbf-solving-1405.7253</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conformant-planning-as-a-case-study-of-incremental-qbf-solving-1405.7253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conformant-planning-as-a-case-study-of-incremental-qbf-solving-1405.7253"/></url>
<url><loc>https://scifaro.com/en/abs/puc-logic-embedding-of-lewis-deontic-logics-1405.7285</loc><lastmod>2014-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/puc-logic-embedding-of-lewis-deontic-logics-1405.7285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/puc-logic-embedding-of-lewis-deontic-logics-1405.7285"/></url>
<url><loc>https://scifaro.com/en/abs/speeding-up-smt-based-quantitative-program-analysis-1405.7320</loc><lastmod>2014-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speeding-up-smt-based-quantitative-program-analysis-1405.7320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speeding-up-smt-based-quantitative-program-analysis-1405.7320"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-the-clocked-lambda-calculus-1405.7500</loc><lastmod>2015-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-the-clocked-lambda-calculus-1405.7500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-the-clocked-lambda-calculus-1405.7500"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-horn-constraint-solving-for-program-verification-and-synthesis-1405.7739</loc><lastmod>2014-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-horn-constraint-solving-for-program-verification-and-synthesis-1405.7739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-horn-constraint-solving-for-program-verification-and-synthesis-1405.7739"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-1405.7923</loc><lastmod>2014-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-1405.7923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-1405.7923"/></url>
<url><loc>https://scifaro.com/en/abs/sat-modulo-monotonic-theories-1406.0043</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-modulo-monotonic-theories-1406.0043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-modulo-monotonic-theories-1406.0043"/></url>
<url><loc>https://scifaro.com/en/abs/a-superposition-calculus-for-abductive-reasoning-1406.0303</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-superposition-calculus-for-abductive-reasoning-1406.0303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-superposition-calculus-for-abductive-reasoning-1406.0303"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-satisfiability-in-the-algebra-of-finite-binary-relations-with-union-composition-and-difference-1406.0349</loc><lastmod>2014-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-satisfiability-in-the-algebra-of-finite-binary-relations-with-union-composition-and-difference-1406.0349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-satisfiability-in-the-algebra-of-finite-binary-relations-with-union-composition-and-difference-1406.0349"/></url>
<url><loc>https://scifaro.com/en/abs/set-theory-or-higher-order-logic-to-represent-auction-concepts-in-isabelle-1406.0774</loc><lastmod>2014-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-theory-or-higher-order-logic-to-represent-auction-concepts-in-isabelle-1406.0774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-theory-or-higher-order-logic-to-represent-auction-concepts-in-isabelle-1406.0774"/></url>
<url><loc>https://scifaro.com/en/abs/query-answering-over-contextualized-rdf-owl-knowledge-with-forall-existential-bridge-rules-attaining-decidability-using-acyclicity-full-version-1406.0893</loc><lastmod>2014-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-answering-over-contextualized-rdf-owl-knowledge-with-forall-existential-bridge-rules-attaining-decidability-using-acyclicity-full-version-1406.0893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-answering-over-contextualized-rdf-owl-knowledge-with-forall-existential-bridge-rules-attaining-decidability-using-acyclicity-full-version-1406.0893"/></url>
<url><loc>https://scifaro.com/en/abs/petri-games-synthesis-of-distributed-systems-with-causal-memory-1406.1069</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-games-synthesis-of-distributed-systems-with-causal-memory-1406.1069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-games-synthesis-of-distributed-systems-with-causal-memory-1406.1069"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1406.1238</loc><lastmod>2014-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1406.1238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1406.1238"/></url>
<url><loc>https://scifaro.com/en/abs/finite-vector-spaces-as-model-of-simply-typed-lambda-calculi-1406.1310</loc><lastmod>2014-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-vector-spaces-as-model-of-simply-typed-lambda-calculi-1406.1310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-vector-spaces-as-model-of-simply-typed-lambda-calculi-1406.1310"/></url>
<url><loc>https://scifaro.com/en/abs/polymorphic-types-in-acl2-1406.1558</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polymorphic-types-in-acl2-1406.1558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polymorphic-types-in-acl2-1406.1558"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-the-traditional-and-non-standard-definitions-of-concepts-from-real-analysis-1406.1560</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-the-traditional-and-non-standard-definitions-of-concepts-from-real-analysis-1406.1560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-the-traditional-and-non-standard-definitions-of-concepts-from-real-analysis-1406.1560"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-medina-s-sequence-of-polynomials-for-approximating-arctangent-1406.1561</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-medina-s-sequence-of-polynomials-for-approximating-arctangent-1406.1561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-medina-s-sequence-of-polynomials-for-approximating-arctangent-1406.1561"/></url>
<url><loc>https://scifaro.com/en/abs/using-acl2-to-verify-loop-pipelining-in-behavioral-synthesis-1406.1562</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-acl2-to-verify-loop-pipelining-in-behavioral-synthesis-1406.1562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-acl2-to-verify-loop-pipelining-in-behavioral-synthesis-1406.1562"/></url>
<url><loc>https://scifaro.com/en/abs/an-acl2-mechanization-of-an-axiomatic-framework-for-weak-memory-1406.1563</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-acl2-mechanization-of-an-axiomatic-framework-for-weak-memory-1406.1563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-acl2-mechanization-of-an-axiomatic-framework-for-weak-memory-1406.1563"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1406.1567</loc><lastmod>2014-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1406.1567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1406.1567"/></url>
<url><loc>https://scifaro.com/en/abs/the-dagger-lambda-calculus-1406.1633</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dagger-lambda-calculus-1406.1633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dagger-lambda-calculus-1406.1633"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-bounded-reachability-for-hybrid-systems-with-continuous-nondeterministic-and-probabilistic-parameters-1406.1920</loc><lastmod>2015-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-bounded-reachability-for-hybrid-systems-with-continuous-nondeterministic-and-probabilistic-parameters-1406.1920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-bounded-reachability-for-hybrid-systems-with-continuous-nondeterministic-and-probabilistic-parameters-1406.1920"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-characterisation-of-concurrent-composition-1406.1965</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-characterisation-of-concurrent-composition-1406.1965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-characterisation-of-concurrent-composition-1406.1965"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-by-evaluation-in-the-delay-monad-a-case-study-for-coinduction-via-copatterns-and-sized-types-1406.2059</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-by-evaluation-in-the-delay-monad-a-case-study-for-coinduction-via-copatterns-and-sized-types-1406.2059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-by-evaluation-in-the-delay-monad-a-case-study-for-coinduction-via-copatterns-and-sized-types-1406.2059"/></url>
<url><loc>https://scifaro.com/en/abs/coherence-for-skew-monoidal-categories-1406.2064</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherence-for-skew-monoidal-categories-1406.2064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherence-for-skew-monoidal-categories-1406.2064"/></url>
<url><loc>https://scifaro.com/en/abs/gsos-for-non-deterministic-processes-with-quantitative-aspects-1406.2066</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gsos-for-non-deterministic-processes-with-quantitative-aspects-1406.2066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gsos-for-non-deterministic-processes-with-quantitative-aspects-1406.2066"/></url>
<url><loc>https://scifaro.com/en/abs/megara-menu-based-game-abstraction-and-abstraction-refinement-of-markov-automata-1406.2068</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/megara-menu-based-game-abstraction-and-abstraction-refinement-of-markov-automata-1406.2068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/megara-menu-based-game-abstraction-and-abstraction-refinement-of-markov-automata-1406.2068"/></url>
<url><loc>https://scifaro.com/en/abs/program-verification-of-numerical-computation-part-2-1406.2079</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-verification-of-numerical-computation-part-2-1406.2079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-verification-of-numerical-computation-part-2-1406.2079"/></url>
<url><loc>https://scifaro.com/en/abs/a-composable-language-for-action-models-1406.2103</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-composable-language-for-action-models-1406.2103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-composable-language-for-action-models-1406.2103"/></url>
<url><loc>https://scifaro.com/en/abs/logic-programming-and-logarithmic-space-1406.2110</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-programming-and-logarithmic-space-1406.2110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-programming-and-logarithmic-space-1406.2110"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-dynamic-logic-of-propositional-assignments-1406.2161</loc><lastmod>2014-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-dynamic-logic-of-propositional-assignments-1406.2161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-dynamic-logic-of-propositional-assignments-1406.2161"/></url>
<url><loc>https://scifaro.com/en/abs/linear-non-transitive-temporal-logic-knowledge-operations-algorithms-for-admissibility-1406.2783</loc><lastmod>2014-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-non-transitive-temporal-logic-knowledge-operations-algorithms-for-admissibility-1406.2783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-non-transitive-temporal-logic-knowledge-operations-algorithms-for-admissibility-1406.2783"/></url>
<url><loc>https://scifaro.com/en/abs/labelings-for-decreasing-diagrams-1406.3139</loc><lastmod>2015-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labelings-for-decreasing-diagrams-1406.3139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labelings-for-decreasing-diagrams-1406.3139"/></url>
<url><loc>https://scifaro.com/en/abs/three-datatype-defining-rewrite-systems-for-datatypes-of-integers-each-extending-a-datatype-of-naturals-1406.3280</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-datatype-defining-rewrite-systems-for-datatypes-of-integers-each-extending-a-datatype-of-naturals-1406.3280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-datatype-defining-rewrite-systems-for-datatypes-of-integers-each-extending-a-datatype-of-naturals-1406.3280"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-recursion-theory-and-implicit-computational-complexity-long-version-1406.3378</loc><lastmod>2014-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-recursion-theory-and-implicit-computational-complexity-long-version-1406.3378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-recursion-theory-and-implicit-computational-complexity-long-version-1406.3378"/></url>
<url><loc>https://scifaro.com/en/abs/multiparty-sessions-based-on-proof-nets-1406.3478</loc><lastmod>2014-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiparty-sessions-based-on-proof-nets-1406.3478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiparty-sessions-based-on-proof-nets-1406.3478"/></url>
<url><loc>https://scifaro.com/en/abs/session-type-isomorphisms-1406.3486</loc><lastmod>2014-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-type-isomorphisms-1406.3486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-type-isomorphisms-1406.3486"/></url>
<url><loc>https://scifaro.com/en/abs/ctl-fo-verification-as-constraint-solving-1406.3988</loc><lastmod>2014-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ctl-fo-verification-as-constraint-solving-1406.3988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ctl-fo-verification-as-constraint-solving-1406.3988"/></url>
<url><loc>https://scifaro.com/en/abs/discounting-in-ltl-1406.4249</loc><lastmod>2014-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discounting-in-ltl-1406.4249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discounting-in-ltl-1406.4249"/></url>
<url><loc>https://scifaro.com/en/abs/on-mitl-and-alternating-timed-automata-over-infinite-words-1406.4395</loc><lastmod>2014-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-mitl-and-alternating-timed-automata-over-infinite-words-1406.4395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-mitl-and-alternating-timed-automata-over-infinite-words-1406.4395"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-and-propagating-parity-constraints-extended-version-1406.4698</loc><lastmod>2014-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-and-propagating-parity-constraints-extended-version-1406.4698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-and-propagating-parity-constraints-extended-version-1406.4698"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-framework-for-well-structured-graph-transformation-systems-1406.4782</loc><lastmod>2014-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-framework-for-well-structured-graph-transformation-systems-1406.4782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-framework-for-well-structured-graph-transformation-systems-1406.4782"/></url>
<url><loc>https://scifaro.com/en/abs/notions-of-computation-as-monoids-1406.4823</loc><lastmod>2014-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notions-of-computation-as-monoids-1406.4823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notions-of-computation-as-monoids-1406.4823"/></url>
<url><loc>https://scifaro.com/en/abs/on-reachability-for-unidirectional-channel-systems-extended-with-regular-tests-1406.5067</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reachability-for-unidirectional-channel-systems-extended-with-regular-tests-1406.5067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reachability-for-unidirectional-channel-systems-extended-with-regular-tests-1406.5067"/></url>
<url><loc>https://scifaro.com/en/abs/rotation-of-sequences-algorithms-and-proofs-1406.5453</loc><lastmod>2015-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rotation-of-sequences-algorithms-and-proofs-1406.5453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rotation-of-sequences-algorithms-and-proofs-1406.5453"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-representation-in-agent-s-logic-with-uncertainty-and-agent-s-interaction-1406.5495</loc><lastmod>2014-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-representation-in-agent-s-logic-with-uncertainty-and-agent-s-interaction-1406.5495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-representation-in-agent-s-logic-with-uncertainty-and-agent-s-interaction-1406.5495"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-validity-for-propositional-dependence-logics-1406.6259</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-validity-for-propositional-dependence-logics-1406.6259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-validity-for-propositional-dependence-logics-1406.6259"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-modal-dependence-logic-1406.6266</loc><lastmod>2014-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-modal-dependence-logic-1406.6266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-modal-dependence-logic-1406.6266"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-and-verifying-properties-of-space-extended-version-1406.6393</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-and-verifying-properties-of-space-extended-version-1406.6393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-and-verifying-properties-of-space-extended-version-1406.6393"/></url>
<url><loc>https://scifaro.com/en/abs/sroiqsigma-is-decidable-1406.6605</loc><lastmod>2014-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sroiqsigma-is-decidable-1406.6605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sroiqsigma-is-decidable-1406.6605"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-ltl-on-markov-chains-1406.6683</loc><lastmod>2014-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-ltl-on-markov-chains-1406.6683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-ltl-on-markov-chains-1406.6683"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-reachability-problem-for-recursive-hybrid-automata-with-one-and-two-players-1406.7289</loc><lastmod>2014-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-reachability-problem-for-recursive-hybrid-automata-with-one-and-two-players-1406.7289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-reachability-problem-for-recursive-hybrid-automata-with-one-and-two-players-1406.7289"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-results-for-the-boundedness-problem-1406.7684</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-results-for-the-boundedness-problem-1406.7684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-results-for-the-boundedness-problem-1406.7684"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-definable-string-transformations-1406.7824</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-definable-string-transformations-1406.7824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-definable-string-transformations-1406.7824"/></url>
<url><loc>https://scifaro.com/en/abs/on-minimal-corrections-in-asp-1406.7838</loc><lastmod>2014-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-minimal-corrections-in-asp-1406.7838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-minimal-corrections-in-asp-1406.7838"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-kleene-algebra-of-partial-strings-1407.0385</loc><lastmod>2014-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-kleene-algebra-of-partial-strings-1407.0385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-kleene-algebra-of-partial-strings-1407.0385"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-interpretations-over-the-natural-rational-and-real-numbers-revisited-1407.0406</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-interpretations-over-the-natural-rational-and-real-numbers-revisited-1407.0406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-interpretations-over-the-natural-rational-and-real-numbers-revisited-1407.0406"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-is-in-nexptime-1407.0645</loc><lastmod>2015-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-is-in-nexptime-1407.0645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-is-in-nexptime-1407.0645"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-and-relational-models-for-a-system-based-on-a-poset-of-two-elements-1407.1015</loc><lastmod>2014-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-and-relational-models-for-a-system-based-on-a-poset-of-two-elements-1407.1015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-and-relational-models-for-a-system-based-on-a-poset-of-two-elements-1407.1015"/></url>
<url><loc>https://scifaro.com/en/abs/improving-legibility-of-natural-deduction-proofs-is-not-trivial-1407.1140</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-legibility-of-natural-deduction-proofs-is-not-trivial-1407.1140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-legibility-of-natural-deduction-proofs-is-not-trivial-1407.1140"/></url>
<url><loc>https://scifaro.com/en/abs/undecidable-propositional-bimodal-logics-and-one-variable-first-order-linear-temporal-logics-with-counting-1407.1386</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidable-propositional-bimodal-logics-and-one-variable-first-order-linear-temporal-logics-with-counting-1407.1386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidable-propositional-bimodal-logics-and-one-variable-first-order-linear-temporal-logics-with-counting-1407.1386"/></url>
<url><loc>https://scifaro.com/en/abs/decision-versions-of-optimization-problems-cardinality-constraint-lower-bound-as-a-cnf-horn-formula-for-maximum-matching-1407.1403</loc><lastmod>2014-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-versions-of-optimization-problems-cardinality-constraint-lower-bound-as-a-cnf-horn-formula-for-maximum-matching-1407.1403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-versions-of-optimization-problems-cardinality-constraint-lower-bound-as-a-cnf-horn-formula-for-maximum-matching-1407.1403"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-synthesis-for-cardiac-cell-hybrid-models-using-delta-decisions-1407.1524</loc><lastmod>2014-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-synthesis-for-cardiac-cell-hybrid-models-using-delta-decisions-1407.1524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-synthesis-for-cardiac-cell-hybrid-models-using-delta-decisions-1407.1524"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-from-probabilistic-components-1407.1667</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-from-probabilistic-components-1407.1667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-from-probabilistic-components-1407.1667"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-2nd-french-singaporean-workshop-on-formal-methods-and-applications-1407.1952</loc><lastmod>2014-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-2nd-french-singaporean-workshop-on-formal-methods-and-applications-1407.1952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-2nd-french-singaporean-workshop-on-formal-methods-and-applications-1407.1952"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-succinct-one-counter-games-1407.1996</loc><lastmod>2014-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-succinct-one-counter-games-1407.1996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-succinct-one-counter-games-1407.1996"/></url>
<url><loc>https://scifaro.com/en/abs/checking-termination-of-bottom-up-evaluation-of-logic-programs-with-function-symbols-1407.2106</loc><lastmod>2015-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-termination-of-bottom-up-evaluation-of-logic-programs-with-function-symbols-1407.2106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-termination-of-bottom-up-evaluation-of-logic-programs-with-function-symbols-1407.2106"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-derivation-for-small-progress-measures-1407.2149</loc><lastmod>2015-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-derivation-for-small-progress-measures-1407.2149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-derivation-for-small-progress-measures-1407.2149"/></url>
<url><loc>https://scifaro.com/en/abs/proving-differential-privacy-in-hoare-logic-1407.2988</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-differential-privacy-in-hoare-logic-1407.2988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-differential-privacy-in-hoare-logic-1407.2988"/></url>
<url><loc>https://scifaro.com/en/abs/benchmarks-for-parity-games-extended-version-1407.3121</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmarks-for-parity-games-extended-version-1407.3121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmarks-for-parity-games-extended-version-1407.3121"/></url>
<url><loc>https://scifaro.com/en/abs/a-tableau-for-set-satisfiability-for-extended-fuzzy-logic-bl-1407.3128</loc><lastmod>2014-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tableau-for-set-satisfiability-for-extended-fuzzy-logic-bl-1407.3128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tableau-for-set-satisfiability-for-extended-fuzzy-logic-bl-1407.3128"/></url>
<url><loc>https://scifaro.com/en/abs/universal-covers-color-refinement-and-two-variable-counting-logic-lower-bounds-for-the-depth-1407.3175</loc><lastmod>2015-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-covers-color-refinement-and-two-variable-counting-logic-lower-bounds-for-the-depth-1407.3175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-covers-color-refinement-and-two-variable-counting-logic-lower-bounds-for-the-depth-1407.3175"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-proof-theory-of-co-intuitionistic-linear-logic-1407.3416</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-proof-theory-of-co-intuitionistic-linear-logic-1407.3416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-proof-theory-of-co-intuitionistic-linear-logic-1407.3416"/></url>
<url><loc>https://scifaro.com/en/abs/the-tractability-frontier-of-graph-like-first-order-query-sets-1407.3429</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tractability-frontier-of-graph-like-first-order-query-sets-1407.3429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tractability-frontier-of-graph-like-first-order-query-sets-1407.3429"/></url>
<url><loc>https://scifaro.com/en/abs/representations-of-measurable-sets-in-computable-measure-theory-1407.3485</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representations-of-measurable-sets-in-computable-measure-theory-1407.3485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representations-of-measurable-sets-in-computable-measure-theory-1407.3485"/></url>
<url><loc>https://scifaro.com/en/abs/showing-invariance-compositionally-for-a-process-algebra-for-network-protocols-1407.3519</loc><lastmod>2014-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/showing-invariance-compositionally-for-a-process-algebra-for-network-protocols-1407.3519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/showing-invariance-compositionally-for-a-process-algebra-for-network-protocols-1407.3519"/></url>
<url><loc>https://scifaro.com/en/abs/computable-jordan-decomposition-of-linear-continuous-functionals-on-c-0-1-1407.3679</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-jordan-decomposition-of-linear-continuous-functionals-on-c-0-1-1407.3679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-jordan-decomposition-of-linear-continuous-functionals-on-c-0-1-1407.3679"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-higher-order-and-variable-order-logic-over-finite-models-1407.4032</loc><lastmod>2014-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-higher-order-and-variable-order-logic-over-finite-models-1407.4032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-higher-order-and-variable-order-logic-over-finite-models-1407.4032"/></url>
<url><loc>https://scifaro.com/en/abs/a-typeful-characterization-of-multiparty-structured-conversations-based-on-binary-sessions-1407.4242</loc><lastmod>2014-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-typeful-characterization-of-multiparty-structured-conversations-based-on-binary-sessions-1407.4242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-typeful-characterization-of-multiparty-structured-conversations-based-on-binary-sessions-1407.4242"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-graph-transformation-systems-with-whole-neighbourhood-operations-1407.4394</loc><lastmod>2014-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-graph-transformation-systems-with-whole-neighbourhood-operations-1407.4394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-graph-transformation-systems-with-whole-neighbourhood-operations-1407.4394"/></url>
<url><loc>https://scifaro.com/en/abs/corecursive-algebras-corecursive-monads-and-bloom-monads-1407.4425</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/corecursive-algebras-corecursive-monads-and-bloom-monads-1407.4425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/corecursive-algebras-corecursive-monads-and-bloom-monads-1407.4425"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-tableaux-method-for-constructive-satisfiability-testing-and-model-synthesis-in-the-alternating-time-temporal-logic-atl-1407.4645</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-tableaux-method-for-constructive-satisfiability-testing-and-model-synthesis-in-the-alternating-time-temporal-logic-atl-1407.4645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-tableaux-method-for-constructive-satisfiability-testing-and-model-synthesis-in-the-alternating-time-temporal-logic-atl-1407.4645"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-with-transition-invariants-of-height-omega-1407.4692</loc><lastmod>2014-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-with-transition-invariants-of-height-omega-1407.4692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-with-transition-invariants-of-height-omega-1407.4692"/></url>
<url><loc>https://scifaro.com/en/abs/partial-quantifier-elimination-1407.4835</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-quantifier-elimination-1407.4835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-quantifier-elimination-1407.4835"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-3rd-workshop-on-synthesis-1407.4937</loc><lastmod>2014-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-synthesis-1407.4937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-synthesis-1407.4937"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-epistemic-mu-calculus-1407.5166</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-epistemic-mu-calculus-1407.5166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-epistemic-mu-calculus-1407.5166"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-a-simple-self-stabilizing-system-1407.5392</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-a-simple-self-stabilizing-system-1407.5392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-a-simple-self-stabilizing-system-1407.5392"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-handle-assumptions-in-synthesis-1407.5395</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-handle-assumptions-in-synthesis-1407.5395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-handle-assumptions-in-synthesis-1407.5395"/></url>
<url><loc>https://scifaro.com/en/abs/symblicit-algorithms-for-optimal-strategy-synthesis-in-monotonic-markov-decision-processes-1407.5396</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symblicit-algorithms-for-optimal-strategy-synthesis-in-monotonic-markov-decision-processes-1407.5396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symblicit-algorithms-for-optimal-strategy-synthesis-in-monotonic-markov-decision-processes-1407.5396"/></url>
<url><loc>https://scifaro.com/en/abs/are-there-good-mistakes-a-theoretical-analysis-of-cegis-1407.5397</loc><lastmod>2014-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-there-good-mistakes-a-theoretical-analysis-of-cegis-1407.5397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-there-good-mistakes-a-theoretical-analysis-of-cegis-1407.5397"/></url>
<url><loc>https://scifaro.com/en/abs/weihrauch-degrees-of-finding-equilibria-in-sequential-games-1407.5587</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weihrauch-degrees-of-finding-equilibria-in-sequential-games-1407.5587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weihrauch-degrees-of-finding-equilibria-in-sequential-games-1407.5587"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-dynamic-algebra-1407.5819</loc><lastmod>2014-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-dynamic-algebra-1407.5819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-dynamic-algebra-1407.5819"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-bounds-for-ordinal-based-termination-1407.5896</loc><lastmod>2014-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-bounds-for-ordinal-based-termination-1407.5896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-bounds-for-ordinal-based-termination-1407.5896"/></url>
<url><loc>https://scifaro.com/en/abs/abssynthe-abstract-synthesis-from-succinct-safety-specifications-1407.5961</loc><lastmod>2014-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abssynthe-abstract-synthesis-from-succinct-safety-specifications-1407.5961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abssynthe-abstract-synthesis-from-succinct-safety-specifications-1407.5961"/></url>
<url><loc>https://scifaro.com/en/abs/linear-logic-with-idempotent-exponential-modalities-a-note-1407.5988</loc><lastmod>2014-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-logic-with-idempotent-exponential-modalities-a-note-1407.5988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-logic-with-idempotent-exponential-modalities-a-note-1407.5988"/></url>
<url><loc>https://scifaro.com/en/abs/matching-in-the-pi-calculus-technical-report-1407.6406</loc><lastmod>2014-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-in-the-pi-calculus-technical-report-1407.6406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-in-the-pi-calculus-technical-report-1407.6406"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-driven-xor-clause-learning-extended-version-1407.6571</loc><lastmod>2014-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-driven-xor-clause-learning-extended-version-1407.6571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-driven-xor-clause-learning-extended-version-1407.6571"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-synthesis-case-study-amba-ahb-1407.6580</loc><lastmod>2014-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-synthesis-case-study-amba-ahb-1407.6580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-synthesis-case-study-amba-ahb-1407.6580"/></url>
<url><loc>https://scifaro.com/en/abs/bar-recursion-and-products-of-selection-functions-1407.7046</loc><lastmod>2014-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bar-recursion-and-products-of-selection-functions-1407.7046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bar-recursion-and-products-of-selection-functions-1407.7046"/></url>
<url><loc>https://scifaro.com/en/abs/linear-intransitive-temporal-logic-of-knowledge-ltk-r-decision-algorithms-inference-rules-1407.7136</loc><lastmod>2014-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-intransitive-temporal-logic-of-knowledge-ltk-r-decision-algorithms-inference-rules-1407.7136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-intransitive-temporal-logic-of-knowledge-ltk-r-decision-algorithms-inference-rules-1407.7136"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphism-within-naive-type-theory-1407.7274</loc><lastmod>2018-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphism-within-naive-type-theory-1407.7274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphism-within-naive-type-theory-1407.7274"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-model-checking-for-timed-systems-with-conjunctive-guards-extended-version-1407.7305</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-model-checking-for-timed-systems-with-conjunctive-guards-extended-version-1407.7305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-model-checking-for-timed-systems-with-conjunctive-guards-extended-version-1407.7305"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-timed-and-long-run-objectives-for-markov-automata-1407.7356</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-timed-and-long-run-objectives-for-markov-automata-1407.7356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-timed-and-long-run-objectives-for-markov-automata-1407.7356"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-3rd-workshop-on-graph-inspection-and-traversal-engineering-1407.7671</loc><lastmod>2014-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-graph-inspection-and-traversal-engineering-1407.7671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-graph-inspection-and-traversal-engineering-1407.7671"/></url>
<url><loc>https://scifaro.com/en/abs/generating-and-solving-symbolic-parity-games-1407.7928</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-and-solving-symbolic-parity-games-1407.7928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-and-solving-symbolic-parity-games-1407.7928"/></url>
<url><loc>https://scifaro.com/en/abs/strategic-port-graph-rewriting-an-interactive-modelling-and-analysis-framework-1407.7929</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategic-port-graph-rewriting-an-interactive-modelling-and-analysis-framework-1407.7929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategic-port-graph-rewriting-an-interactive-modelling-and-analysis-framework-1407.7929"/></url>
<url><loc>https://scifaro.com/en/abs/graph-versus-vector-based-analysis-of-a-consensus-protocol-1407.7931</loc><lastmod>2014-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-versus-vector-based-analysis-of-a-consensus-protocol-1407.7931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-versus-vector-based-analysis-of-a-consensus-protocol-1407.7931"/></url>
<url><loc>https://scifaro.com/en/abs/categories-of-quantum-and-classical-channels-extended-abstract-1408.0049</loc><lastmod>2014-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categories-of-quantum-and-classical-channels-extended-abstract-1408.0049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categories-of-quantum-and-classical-channels-extended-abstract-1408.0049"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-quantum-computation-1408.0050</loc><lastmod>2014-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-quantum-computation-1408.0050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-quantum-computation-1408.0050"/></url>
<url><loc>https://scifaro.com/en/abs/speakable-in-quantum-mechanics-babbling-on-1408.0052</loc><lastmod>2014-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speakable-in-quantum-mechanics-babbling-on-1408.0052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speakable-in-quantum-mechanics-babbling-on-1408.0052"/></url>
<url><loc>https://scifaro.com/en/abs/between-quantum-logic-and-concurrency-1408.0053</loc><lastmod>2014-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/between-quantum-logic-and-concurrency-1408.0053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/between-quantum-logic-and-concurrency-1408.0053"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-the-complexity-of-quantified-formulas-via-variable-elimination-1408.0700</loc><lastmod>2014-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-the-complexity-of-quantified-formulas-via-variable-elimination-1408.0700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-the-complexity-of-quantified-formulas-via-variable-elimination-1408.0700"/></url>
<url><loc>https://scifaro.com/en/abs/a-dual-engine-for-early-analysis-of-critical-systems-1408.0707</loc><lastmod>2014-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dual-engine-for-early-analysis-of-critical-systems-1408.0707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dual-engine-for-early-analysis-of-critical-systems-1408.0707"/></url>
<url><loc>https://scifaro.com/en/abs/ef-ex-forest-algebras-1408.0809</loc><lastmod>2014-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ef-ex-forest-algebras-1408.0809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ef-ex-forest-algebras-1408.0809"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-to-synergize-partial-order-reduction-with-state-interpolation-1408.0957</loc><lastmod>2014-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-to-synergize-partial-order-reduction-with-state-interpolation-1408.0957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-to-synergize-partial-order-reduction-with-state-interpolation-1408.0957"/></url>
<url><loc>https://scifaro.com/en/abs/compositionality-for-quantitative-specifications-1408.1256</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositionality-for-quantitative-specifications-1408.1256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositionality-for-quantitative-specifications-1408.1256"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-21st-international-workshop-on-expressiveness-in-concurrency-and-11th-workshop-on-structural-operational-semantics-1408.1271</loc><lastmod>2014-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-21st-international-workshop-on-expressiveness-in-concurrency-and-11th-workshop-on-structural-operational-semantics-1408.1271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-21st-international-workshop-on-expressiveness-in-concurrency-and-11th-workshop-on-structural-operational-semantics-1408.1271"/></url>
<url><loc>https://scifaro.com/en/abs/the-mathematical-abstraction-theory-the-fundamentals-for-knowledge-representation-and-self-evolving-autonomous-problem-solving-systems-1408.1377</loc><lastmod>2014-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mathematical-abstraction-theory-the-fundamentals-for-knowledge-representation-and-self-evolving-autonomous-problem-solving-systems-1408.1377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mathematical-abstraction-theory-the-fundamentals-for-knowledge-representation-and-self-evolving-autonomous-problem-solving-systems-1408.1377"/></url>
<url><loc>https://scifaro.com/en/abs/priorities-without-priorities-representing-preemption-in-psi-calculi-1408.1453</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priorities-without-priorities-representing-preemption-in-psi-calculi-1408.1453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priorities-without-priorities-representing-preemption-in-psi-calculi-1408.1453"/></url>
<url><loc>https://scifaro.com/en/abs/matching-in-the-pi-calculus-1408.1454</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-in-the-pi-calculus-1408.1454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-in-the-pi-calculus-1408.1454"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-intensional-communication-1408.1455</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-intensional-communication-1408.1455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-intensional-communication-1408.1455"/></url>
<url><loc>https://scifaro.com/en/abs/states-in-process-calculi-1408.1456</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/states-in-process-calculi-1408.1456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/states-in-process-calculi-1408.1456"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-linear-optical-quantum-computing-using-quantum-process-calculus-1408.1460</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-linear-optical-quantum-computing-using-quantum-process-calculus-1408.1460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-linear-optical-quantum-computing-using-quantum-process-calculus-1408.1460"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-formal-basis-for-digital-crowds-1408.1592</loc><lastmod>2016-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-formal-basis-for-digital-crowds-1408.1592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-formal-basis-for-digital-crowds-1408.1592"/></url>
<url><loc>https://scifaro.com/en/abs/computing-consensus-a-logic-for-reasoning-about-deliberative-processes-based-on-argumentation-1408.1647</loc><lastmod>2014-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-consensus-a-logic-for-reasoning-about-deliberative-processes-based-on-argumentation-1408.1647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-consensus-a-logic-for-reasoning-about-deliberative-processes-based-on-argumentation-1408.1647"/></url>
<url><loc>https://scifaro.com/en/abs/three-variables-suffice-for-real-time-specification-1408.1851</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-variables-suffice-for-real-time-specification-1408.1851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-variables-suffice-for-real-time-specification-1408.1851"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-classical-realizability-models-of-zf-1408.1868</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-classical-realizability-models-of-zf-1408.1868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-classical-realizability-models-of-zf-1408.1868"/></url>
<url><loc>https://scifaro.com/en/abs/differential-game-logic-1408.1980</loc><lastmod>2015-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-game-logic-1408.1980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-game-logic-1408.1980"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-methods-for-circuit-synthesis-1408.2333</loc><lastmod>2014-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-methods-for-circuit-synthesis-1408.2333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-methods-for-circuit-synthesis-1408.2333"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-inequational-logic-1408.2447</loc><lastmod>2015-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-inequational-logic-1408.2447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-inequational-logic-1408.2447"/></url>
<url><loc>https://scifaro.com/en/abs/a-hypercomputation-in-brouwer-s-constructivism-1408.2930</loc><lastmod>2015-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hypercomputation-in-brouwer-s-constructivism-1408.2930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hypercomputation-in-brouwer-s-constructivism-1408.2930"/></url>
<url><loc>https://scifaro.com/en/abs/a-hoare-like-logic-of-asserted-single-pass-instruction-sequences-1408.2955</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hoare-like-logic-of-asserted-single-pass-instruction-sequences-1408.2955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hoare-like-logic-of-asserted-single-pass-instruction-sequences-1408.2955"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-kozen-s-axiomatization-for-the-modal-mu-calculus-a-simple-proof-1408.3560</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-kozen-s-axiomatization-for-the-modal-mu-calculus-a-simple-proof-1408.3560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-kozen-s-axiomatization-for-the-modal-mu-calculus-a-simple-proof-1408.3560"/></url>
<url><loc>https://scifaro.com/en/abs/bivalent-semantics-generalized-compositionality-and-analytic-classic-like-tableaux-for-finite-valued-logics-1408.3775</loc><lastmod>2014-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bivalent-semantics-generalized-compositionality-and-analytic-classic-like-tableaux-for-finite-valued-logics-1408.3775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bivalent-semantics-generalized-compositionality-and-analytic-classic-like-tableaux-for-finite-valued-logics-1408.3775"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-conjunctive-queries-on-partially-ordered-sets-1408.4263</loc><lastmod>2014-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-conjunctive-queries-on-partially-ordered-sets-1408.4263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-conjunctive-queries-on-partially-ordered-sets-1408.4263"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-cardinality-constraints-for-maxsat-1408.4628</loc><lastmod>2014-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-cardinality-constraints-for-maxsat-1408.4628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-cardinality-constraints-for-maxsat-1408.4628"/></url>
<url><loc>https://scifaro.com/en/abs/a-correspondence-between-rooted-planar-maps-and-normal-planar-lambda-terms-1408.5028</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-correspondence-between-rooted-planar-maps-and-normal-planar-lambda-terms-1408.5028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-correspondence-between-rooted-planar-maps-and-normal-planar-lambda-terms-1408.5028"/></url>
<url><loc>https://scifaro.com/en/abs/the-descriptive-theory-of-represented-spaces-1408.5329</loc><lastmod>2014-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-descriptive-theory-of-represented-spaces-1408.5329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-descriptive-theory-of-represented-spaces-1408.5329"/></url>
<url><loc>https://scifaro.com/en/abs/random-strings-and-tt-degrees-of-turing-complete-c-e-sets-1408.5636</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-strings-and-tt-degrees-of-turing-complete-c-e-sets-1408.5636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-strings-and-tt-degrees-of-turing-complete-c-e-sets-1408.5636"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-counting-models-of-linear-time-temporal-logic-1408.5752</loc><lastmod>2014-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-counting-models-of-linear-time-temporal-logic-1408.5752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-counting-models-of-linear-time-temporal-logic-1408.5752"/></url>
<url><loc>https://scifaro.com/en/abs/the-hardness-of-finding-linear-ranking-functions-for-lasso-programs-1408.5955</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hardness-of-finding-linear-ranking-functions-for-lasso-programs-1408.5955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hardness-of-finding-linear-ranking-functions-for-lasso-programs-1408.5955"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-algebras-regular-languages-and-substructural-logics-1408.5956</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-algebras-regular-languages-and-substructural-logics-1408.5956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-algebras-regular-languages-and-substructural-logics-1408.5956"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-linear-dynamic-logic-1408.5957</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-linear-dynamic-logic-1408.5957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-linear-dynamic-logic-1408.5957"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-path-width-of-integer-linear-programming-1408.5958</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-path-width-of-integer-linear-programming-1408.5958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-path-width-of-integer-linear-programming-1408.5958"/></url>
<url><loc>https://scifaro.com/en/abs/interval-based-synthesis-1408.5960</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-based-synthesis-1408.5960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-based-synthesis-1408.5960"/></url>
<url><loc>https://scifaro.com/en/abs/the-fixpoint-iteration-algorithm-for-parity-games-1408.5961</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fixpoint-iteration-algorithm-for-parity-games-1408.5961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fixpoint-iteration-algorithm-for-parity-games-1408.5961"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-paxos-in-spin-1408.5962</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-paxos-in-spin-1408.5962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-paxos-in-spin-1408.5962"/></url>
<url><loc>https://scifaro.com/en/abs/a-formulation-of-the-potential-for-communication-condition-using-c2ka-1408.5964</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formulation-of-the-potential-for-communication-condition-using-c2ka-1408.5964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formulation-of-the-potential-for-communication-condition-using-c2ka-1408.5964"/></url>
<url><loc>https://scifaro.com/en/abs/visibly-pushdown-modular-games-1408.5969</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibly-pushdown-modular-games-1408.5969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibly-pushdown-modular-games-1408.5969"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-role-authorization-in-multiparty-conversations-1408.5977</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-role-authorization-in-multiparty-conversations-1408.5977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-role-authorization-in-multiparty-conversations-1408.5977"/></url>
<url><loc>https://scifaro.com/en/abs/self-adaptation-and-secure-information-flow-in-multiparty-structured-communications-a-unified-perspective-1408.5978</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-adaptation-and-secure-information-flow-in-multiparty-structured-communications-a-unified-perspective-1408.5978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-adaptation-and-secure-information-flow-in-multiparty-structured-communications-a-unified-perspective-1408.5978"/></url>
<url><loc>https://scifaro.com/en/abs/compliance-for-reversible-client-server-interactions-1408.5981</loc><lastmod>2014-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compliance-for-reversible-client-server-interactions-1408.5981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compliance-for-reversible-client-server-interactions-1408.5981"/></url>
<url><loc>https://scifaro.com/en/abs/developments-in-formal-proofs-1408.6474</loc><lastmod>2014-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/developments-in-formal-proofs-1408.6474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/developments-in-formal-proofs-1408.6474"/></url>
<url><loc>https://scifaro.com/en/abs/sets-the-axiom-of-choice-and-all-that-a-tutorial-1408.6475</loc><lastmod>2014-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sets-the-axiom-of-choice-and-all-that-a-tutorial-1408.6475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sets-the-axiom-of-choice-and-all-that-a-tutorial-1408.6475"/></url>
<url><loc>https://scifaro.com/en/abs/tree-games-with-regular-objectives-1408.6477</loc><lastmod>2014-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-games-with-regular-objectives-1408.6477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-games-with-regular-objectives-1408.6477"/></url>
<url><loc>https://scifaro.com/en/abs/bug-hunting-by-computing-range-reduction-1408.7039</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bug-hunting-by-computing-range-reduction-1408.7039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bug-hunting-by-computing-range-reduction-1408.7039"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-procedural-programs-via-constrained-rewriting-induction-1409.0166</loc><lastmod>2025-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-procedural-programs-via-constrained-rewriting-induction-1409.0166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-procedural-programs-via-constrained-rewriting-induction-1409.0166"/></url>
<url><loc>https://scifaro.com/en/abs/virtual-evidence-a-constructive-semantics-for-classical-logics-1409.0266</loc><lastmod>2014-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/virtual-evidence-a-constructive-semantics-for-classical-logics-1409.0266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/virtual-evidence-a-constructive-semantics-for-classical-logics-1409.0266"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-rely-guarantee-calculus-1409.0582</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-rely-guarantee-calculus-1409.0582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-rely-guarantee-calculus-1409.0582"/></url>
<url><loc>https://scifaro.com/en/abs/deontic-modality-based-on-preference-1409.0824</loc><lastmod>2014-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deontic-modality-based-on-preference-1409.0824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deontic-modality-based-on-preference-1409.0824"/></url>
<url><loc>https://scifaro.com/en/abs/observationally-induced-algebras-in-domain-theory-1409.1544</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observationally-induced-algebras-in-domain-theory-1409.1544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observationally-induced-algebras-in-domain-theory-1409.1544"/></url>
<url><loc>https://scifaro.com/en/abs/diophantine-properties-of-brownian-motion-recursive-aspects-1409.1752</loc><lastmod>2014-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diophantine-properties-of-brownian-motion-recursive-aspects-1409.1752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diophantine-properties-of-brownian-motion-recursive-aspects-1409.1752"/></url>
<url><loc>https://scifaro.com/en/abs/an-epistemic-strategy-logic-1409.2193</loc><lastmod>2018-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-epistemic-strategy-logic-1409.2193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-epistemic-strategy-logic-1409.2193"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-automated-specification-and-verification-of-web-systems-1409.2294</loc><lastmod>2014-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-automated-specification-and-verification-of-web-systems-1409.2294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-automated-specification-and-verification-of-web-systems-1409.2294"/></url>
<url><loc>https://scifaro.com/en/abs/interrupt-timed-automata-with-auxiliary-clocks-and-parameters-1409.2408</loc><lastmod>2014-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interrupt-timed-automata-with-auxiliary-clocks-and-parameters-1409.2408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interrupt-timed-automata-with-auxiliary-clocks-and-parameters-1409.2408"/></url>
<url><loc>https://scifaro.com/en/abs/a-local-logic-for-realizability-in-web-service-choreographies-1409.2591</loc><lastmod>2014-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-local-logic-for-realizability-in-web-service-choreographies-1409.2591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-local-logic-for-realizability-in-web-service-choreographies-1409.2591"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-classical-logic-and-computation-1409.2593</loc><lastmod>2014-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-classical-logic-and-computation-1409.2593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-classical-logic-and-computation-1409.2593"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-proof-of-the-completeness-of-apal-1409.2612</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-proof-of-the-completeness-of-apal-1409.2612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-proof-of-the-completeness-of-apal-1409.2612"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-hyper-and-epistemic-temporal-logic-1409.2711</loc><lastmod>2014-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-hyper-and-epistemic-temporal-logic-1409.2711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-hyper-and-epistemic-temporal-logic-1409.2711"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-reachability-problems-for-time-basic-petri-nets-1409.2778</loc><lastmod>2014-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-reachability-problems-for-time-basic-petri-nets-1409.2778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-reachability-problems-for-time-basic-petri-nets-1409.2778"/></url>
<url><loc>https://scifaro.com/en/abs/a-cirquent-calculus-system-with-clustering-and-ranking-1409.3290</loc><lastmod>2014-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cirquent-calculus-system-with-clustering-and-ranking-1409.3290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cirquent-calculus-system-with-clustering-and-ranking-1409.3290"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-continuation-calculus-1409.3313</loc><lastmod>2014-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-continuation-calculus-1409.3313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-continuation-calculus-1409.3313"/></url>
<url><loc>https://scifaro.com/en/abs/a-fully-abstract-semantics-of-lambda-mu-in-the-pi-calculus-1409.3314</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fully-abstract-semantics-of-lambda-mu-in-the-pi-calculus-1409.3314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fully-abstract-semantics-of-lambda-mu-in-the-pi-calculus-1409.3314"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-classical-logic-recursive-equations-and-interactive-semantics-1409.3315</loc><lastmod>2014-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-classical-logic-recursive-equations-and-interactive-semantics-1409.3315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-classical-logic-recursive-equations-and-interactive-semantics-1409.3315"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-for-classical-logic-through-the-distinction-between-values-and-computations-1409.3316</loc><lastmod>2014-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-for-classical-logic-through-the-distinction-between-values-and-computations-1409.3316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-for-classical-logic-through-the-distinction-between-values-and-computations-1409.3316"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-analysis-of-pomdps-with-temporal-logic-specifications-for-robotics-applications-1409.3360</loc><lastmod>2015-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-analysis-of-pomdps-with-temporal-logic-specifications-for-robotics-applications-1409.3360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-analysis-of-pomdps-with-temporal-logic-specifications-for-robotics-applications-1409.3360"/></url>
<url><loc>https://scifaro.com/en/abs/how-constructive-is-constructing-measures-1409.3428</loc><lastmod>2014-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-constructive-is-constructing-measures-1409.3428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-constructive-is-constructing-measures-1409.3428"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-control-theory-a-proposal-1409.3560</loc><lastmod>2014-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-control-theory-a-proposal-1409.3560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-control-theory-a-proposal-1409.3560"/></url>
<url><loc>https://scifaro.com/en/abs/coproducts-of-monads-on-set-1409.3804</loc><lastmod>2014-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coproducts-of-monads-on-set-1409.3804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coproducts-of-monads-on-set-1409.3804"/></url>
<url><loc>https://scifaro.com/en/abs/colimits-of-monads-1409.3805</loc><lastmod>2014-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colimits-of-monads-1409.3805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colimits-of-monads-1409.3805"/></url>
<url><loc>https://scifaro.com/en/abs/coalescing-syntactic-abstraction-for-reasoning-in-first-order-modal-logics-1409.3819</loc><lastmod>2014-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalescing-syntactic-abstraction-for-reasoning-in-first-order-modal-logics-1409.3819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalescing-syntactic-abstraction-for-reasoning-in-first-order-modal-logics-1409.3819"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-template-generation-using-sum-of-squares-programming-1409.3941</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-template-generation-using-sum-of-squares-programming-1409.3941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-template-generation-using-sum-of-squares-programming-1409.3941"/></url>
<url><loc>https://scifaro.com/en/abs/faster-existential-fo-model-checking-on-posets-1409.4433</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-existential-fo-model-checking-on-posets-1409.4433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-existential-fo-model-checking-on-posets-1409.4433"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-error-localization-for-software-using-deductive-verification-1409.4637</loc><lastmod>2014-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-error-localization-for-software-using-deductive-verification-1409.4637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-error-localization-for-software-using-deductive-verification-1409.4637"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-propositional-satisfiability-1409.4925</loc><lastmod>2015-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-propositional-satisfiability-1409.4925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-propositional-satisfiability-1409.4925"/></url>
<url><loc>https://scifaro.com/en/abs/fly-automata-model-checking-and-recognizability-1409.5368</loc><lastmod>2014-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fly-automata-model-checking-and-recognizability-1409.5368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fly-automata-model-checking-and-recognizability-1409.5368"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-quantitative-alternating-time-temporal-logic-on-one-counter-game-models-1409.5681</loc><lastmod>2014-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-quantitative-alternating-time-temporal-logic-on-one-counter-game-models-1409.5681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-quantitative-alternating-time-temporal-logic-on-one-counter-game-models-1409.5681"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-bisimilarity-for-higher-dimensional-automata-1409.5865</loc><lastmod>2014-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-bisimilarity-for-higher-dimensional-automata-1409.5865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-bisimilarity-for-higher-dimensional-automata-1409.5865"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-coverability-graphs-for-time-basic-petri-nets-1409.6253</loc><lastmod>2021-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-coverability-graphs-for-time-basic-petri-nets-1409.6253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-coverability-graphs-for-time-basic-petri-nets-1409.6253"/></url>
<url><loc>https://scifaro.com/en/abs/proof-generation-from-delta-decisions-1409.6414</loc><lastmod>2014-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-generation-from-delta-decisions-1409.6414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-generation-from-delta-decisions-1409.6414"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-computation-tree-logic-model-checking-based-on-generalized-possibility-measures-1409.6466</loc><lastmod>2014-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-computation-tree-logic-model-checking-based-on-generalized-possibility-measures-1409.6466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-computation-tree-logic-model-checking-based-on-generalized-possibility-measures-1409.6466"/></url>
<url><loc>https://scifaro.com/en/abs/reconfigurable-decorated-pt-nets-with-inhibitor-arcs-and-transition-priorities-1409.6856</loc><lastmod>2014-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfigurable-decorated-pt-nets-with-inhibitor-arcs-and-transition-priorities-1409.6856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfigurable-decorated-pt-nets-with-inhibitor-arcs-and-transition-priorities-1409.6856"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-thread-algebra-1409.6873</loc><lastmod>2016-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-thread-algebra-1409.6873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-thread-algebra-1409.6873"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-information-carried-by-programs-about-the-objects-they-compute-1409.6977</loc><lastmod>2014-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-information-carried-by-programs-about-the-objects-they-compute-1409.6977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-information-carried-by-programs-about-the-objects-they-compute-1409.6977"/></url>
<url><loc>https://scifaro.com/en/abs/a-higher-order-framework-for-decision-problems-and-games-1409.7411</loc><lastmod>2014-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-higher-order-framework-for-decision-problems-and-games-1409.7411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-higher-order-framework-for-decision-problems-and-games-1409.7411"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strictness-of-the-quantifier-structure-hierarchy-in-first-order-logic-1409.7488</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strictness-of-the-quantifier-structure-hierarchy-in-first-order-logic-1409.7488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strictness-of-the-quantifier-structure-hierarchy-in-first-order-logic-1409.7488"/></url>
<url><loc>https://scifaro.com/en/abs/thin-games-with-symmetry-and-concurrent-hyland-ong-games-1409.7542</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thin-games-with-symmetry-and-concurrent-hyland-ong-games-1409.7542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thin-games-with-symmetry-and-concurrent-hyland-ong-games-1409.7542"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-expanded-version-1409.8056</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-expanded-version-1409.8056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-fair-testing-in-ccs-expanded-version-1409.8056"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-and-verifying-concurrent-algorithms-with-histories-and-subjectivity-1410.0306</loc><lastmod>2014-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-and-verifying-concurrent-algorithms-with-histories-and-subjectivity-1410.0306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-and-verifying-concurrent-algorithms-with-histories-and-subjectivity-1410.0306"/></url>
<url><loc>https://scifaro.com/en/abs/structural-operational-semantics-for-non-deterministic-processes-with-quantitative-aspects-1410.0893</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-operational-semantics-for-non-deterministic-processes-with-quantitative-aspects-1410.0893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-operational-semantics-for-non-deterministic-processes-with-quantitative-aspects-1410.0893"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-categories-1410.1478</loc><lastmod>2014-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-categories-1410.1478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-categories-1410.1478"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-timed-automata-1410.2128</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-timed-automata-1410.2128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-timed-automata-1410.2128"/></url>
<url><loc>https://scifaro.com/en/abs/simplified-coalgebraic-trace-equivalence-1410.2463</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplified-coalgebraic-trace-equivalence-1410.2463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplified-coalgebraic-trace-equivalence-1410.2463"/></url>
<url><loc>https://scifaro.com/en/abs/on-coupled-logical-bisimulation-for-the-lambda-calculus-1410.2833</loc><lastmod>2014-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-coupled-logical-bisimulation-for-the-lambda-calculus-1410.2833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-coupled-logical-bisimulation-for-the-lambda-calculus-1410.2833"/></url>
<url><loc>https://scifaro.com/en/abs/towards-static-analysis-of-functional-programs-using-tree-automata-completion-1410.2901</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-static-analysis-of-functional-programs-using-tree-automata-completion-1410.2901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-static-analysis-of-functional-programs-using-tree-automata-completion-1410.2901"/></url>
<url><loc>https://scifaro.com/en/abs/riesz-logic-1410.2910</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/riesz-logic-1410.2910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/riesz-logic-1410.2910"/></url>
<url><loc>https://scifaro.com/en/abs/computabilities-of-validity-and-satisfiability-in-probability-logics-over-finite-and-countable-models-1410.3059</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computabilities-of-validity-and-satisfiability-in-probability-logics-over-finite-and-countable-models-1410.3059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computabilities-of-validity-and-satisfiability-in-probability-logics-over-finite-and-countable-models-1410.3059"/></url>
<url><loc>https://scifaro.com/en/abs/behavioral-metrics-via-functor-lifting-1410.3385</loc><lastmod>2014-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioral-metrics-via-functor-lifting-1410.3385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioral-metrics-via-functor-lifting-1410.3385"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-checking-for-multirate-hybrid-zia-1410.3773</loc><lastmod>2014-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-checking-for-multirate-hybrid-zia-1410.3773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-checking-for-multirate-hybrid-zia-1410.3773"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-ctl-a-generalization-of-courcelle-s-theorem-1410.4044</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-ctl-a-generalization-of-courcelle-s-theorem-1410.4044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-ctl-a-generalization-of-courcelle-s-theorem-1410.4044"/></url>
<url><loc>https://scifaro.com/en/abs/convolution-separation-and-concurrency-1410.4235</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convolution-separation-and-concurrency-1410.4235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convolution-separation-and-concurrency-1410.4235"/></url>
<url><loc>https://scifaro.com/en/abs/the-herbrand-functional-interpretation-of-the-double-negation-shift-1410.4353</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-herbrand-functional-interpretation-of-the-double-negation-shift-1410.4353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-herbrand-functional-interpretation-of-the-double-negation-shift-1410.4353"/></url>
<url><loc>https://scifaro.com/en/abs/inter-procedural-two-variable-herbrand-equalities-1410.4416</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inter-procedural-two-variable-herbrand-equalities-1410.4416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inter-procedural-two-variable-herbrand-equalities-1410.4416"/></url>
<url><loc>https://scifaro.com/en/abs/principles-for-verification-tools-separation-logic-1410.4439</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/principles-for-verification-tools-separation-logic-1410.4439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/principles-for-verification-tools-separation-logic-1410.4439"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-parity-games-on-lossy-channel-systems-1410.4448</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-parity-games-on-lossy-channel-systems-1410.4448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-parity-games-on-lossy-channel-systems-1410.4448"/></url>
<url><loc>https://scifaro.com/en/abs/proof-carrying-hardware-via-ic3-1410.4507</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-carrying-hardware-via-ic3-1410.4507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-carrying-hardware-via-ic3-1410.4507"/></url>
<url><loc>https://scifaro.com/en/abs/fast-detection-of-cycles-in-timed-automata-1410.4509</loc><lastmod>2014-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-detection-of-cycles-in-timed-automata-1410.4509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-detection-of-cycles-in-timed-automata-1410.4509"/></url>
<url><loc>https://scifaro.com/en/abs/the-pi-calculus-is-behaviourally-complete-and-orbit-finitely-executable-1410.4512</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pi-calculus-is-behaviourally-complete-and-orbit-finitely-executable-1410.4512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pi-calculus-is-behaviourally-complete-and-orbit-finitely-executable-1410.4512"/></url>
<url><loc>https://scifaro.com/en/abs/percentile-queries-in-multi-dimensional-markov-decision-processes-1410.4801</loc><lastmod>2016-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/percentile-queries-in-multi-dimensional-markov-decision-processes-1410.4801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/percentile-queries-in-multi-dimensional-markov-decision-processes-1410.4801"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-scheduling-for-ltl-with-future-discounting-1410.4950</loc><lastmod>2015-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-scheduling-for-ltl-with-future-discounting-1410.4950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-scheduling-for-ltl-with-future-discounting-1410.4950"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relation-of-interaction-semantics-to-continuations-and-defunctionalization-1410.4980</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relation-of-interaction-semantics-to-continuations-and-defunctionalization-1410.4980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relation-of-interaction-semantics-to-continuations-and-defunctionalization-1410.4980"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-linearizability-1410.5000</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-linearizability-1410.5000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-linearizability-1410.5000"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-predicate-logics-with-team-semantics-1410.5037</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-predicate-logics-with-team-semantics-1410.5037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-predicate-logics-with-team-semantics-1410.5037"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-propositional-dependence-logics-1410.5038</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-propositional-dependence-logics-1410.5038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-propositional-dependence-logics-1410.5038"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-refinement-for-trace-inclusion-of-infinite-state-systems-1410.5056</loc><lastmod>2015-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-refinement-for-trace-inclusion-of-infinite-state-systems-1410.5056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-refinement-for-trace-inclusion-of-infinite-state-systems-1410.5056"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-reasoning-about-safety-and-termination-of-heap-manipulating-programs-1410.5088</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-reasoning-about-safety-and-termination-of-heap-manipulating-programs-1410.5088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-reasoning-about-safety-and-termination-of-heap-manipulating-programs-1410.5088"/></url>
<url><loc>https://scifaro.com/en/abs/unrestricted-termination-and-non-termination-arguments-for-bit-vector-programs-1410.5089</loc><lastmod>2014-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unrestricted-termination-and-non-termination-arguments-for-bit-vector-programs-1410.5089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unrestricted-termination-and-non-termination-arguments-for-bit-vector-programs-1410.5089"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-reversible-computation-1410.5131</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-reversible-computation-1410.5131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-reversible-computation-1410.5131"/></url>
<url><loc>https://scifaro.com/en/abs/machine-learning-of-coq-proof-guidance-first-experiments-1410.5467</loc><lastmod>2014-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/machine-learning-of-coq-proof-guidance-first-experiments-1410.5467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/machine-learning-of-coq-proof-guidance-first-experiments-1410.5467"/></url>
<url><loc>https://scifaro.com/en/abs/certified-connection-tableaux-proofs-for-hol-light-and-tptp-1410.5476</loc><lastmod>2014-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-connection-tableaux-proofs-for-hol-light-and-tptp-1410.5476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-connection-tableaux-proofs-for-hol-light-and-tptp-1410.5476"/></url>
<url><loc>https://scifaro.com/en/abs/pushing-the-envelope-of-optimization-modulo-theories-with-linear-arithmetic-cost-functions-1410.5568</loc><lastmod>2015-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pushing-the-envelope-of-optimization-modulo-theories-with-linear-arithmetic-cost-functions-1410.5568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pushing-the-envelope-of-optimization-modulo-theories-with-linear-arithmetic-cost-functions-1410.5568"/></url>
<url><loc>https://scifaro.com/en/abs/robust-multidimensional-mean-payoff-games-are-undecidable-1410.5703</loc><lastmod>2014-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-multidimensional-mean-payoff-games-are-undecidable-1410.5703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-multidimensional-mean-payoff-games-are-undecidable-1410.5703"/></url>
<url><loc>https://scifaro.com/en/abs/lightweight-monte-carlo-verification-of-markov-decision-processes-with-rewards-1410.5782</loc><lastmod>2015-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lightweight-monte-carlo-verification-of-markov-decision-processes-with-rewards-1410.5782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lightweight-monte-carlo-verification-of-markov-decision-processes-with-rewards-1410.5782"/></url>
<url><loc>https://scifaro.com/en/abs/the-relative-succinctness-and-expressiveness-of-modal-logics-can-be-arbitrarily-complex-1410.5993</loc><lastmod>2014-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relative-succinctness-and-expressiveness-of-modal-logics-can-be-arbitrarily-complex-1410.5993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relative-succinctness-and-expressiveness-of-modal-logics-can-be-arbitrarily-complex-1410.5993"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-modulo-theories-with-linear-rational-costs-1410.6039</loc><lastmod>2014-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-modulo-theories-with-linear-rational-costs-1410.6039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-modulo-theories-with-linear-rational-costs-1410.6039"/></url>
<url><loc>https://scifaro.com/en/abs/abpress-flexing-partial-order-reduction-and-abstraction-1410.6044</loc><lastmod>2014-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abpress-flexing-partial-order-reduction-and-abstraction-1410.6044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abpress-flexing-partial-order-reduction-and-abstraction-1410.6044"/></url>
<url><loc>https://scifaro.com/en/abs/choicegaps-competitive-diffusion-as-a-massive-multi-player-game-in-social-networks-1410.6118</loc><lastmod>2016-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choicegaps-competitive-diffusion-as-a-massive-multi-player-game-in-social-networks-1410.6118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choicegaps-competitive-diffusion-as-a-massive-multi-player-game-in-social-networks-1410.6118"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-linearizability-a-comparative-survey-1410.6268</loc><lastmod>2015-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-linearizability-a-comparative-survey-1410.6268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-linearizability-a-comparative-survey-1410.6268"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-assignment-for-lambda-calculus-complete-both-for-fptime-and-strong-normalization-1410.6298</loc><lastmod>2014-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-assignment-for-lambda-calculus-complete-both-for-fptime-and-strong-normalization-1410.6298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-assignment-for-lambda-calculus-complete-both-for-fptime-and-strong-normalization-1410.6298"/></url>
<url><loc>https://scifaro.com/en/abs/spector-bar-recursion-over-finite-partial-functions-1410.6361</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spector-bar-recursion-over-finite-partial-functions-1410.6361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spector-bar-recursion-over-finite-partial-functions-1410.6361"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-the-clark-s-completion-semantics-for-monadic-programs-and-queries-1410.6505</loc><lastmod>2015-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-the-clark-s-completion-semantics-for-monadic-programs-and-queries-1410.6505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-the-clark-s-completion-semantics-for-monadic-programs-and-queries-1410.6505"/></url>
<url><loc>https://scifaro.com/en/abs/a-van-benthem-theorem-for-modal-team-semantics-1410.6648</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-modal-team-semantics-1410.6648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-modal-team-semantics-1410.6648"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-7th-interaction-and-concurrency-experience-1410.7013</loc><lastmod>2014-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-7th-interaction-and-concurrency-experience-1410.7013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-7th-interaction-and-concurrency-experience-1410.7013"/></url>
<url><loc>https://scifaro.com/en/abs/confusion-in-the-church-turing-thesis-1410.7103</loc><lastmod>2014-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confusion-in-the-church-turing-thesis-1410.7103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confusion-in-the-church-turing-thesis-1410.7103"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-expected-outcomes-and-almost-sure-termination-of-probabilistic-programs-is-hard-1410.7225</loc><lastmod>2014-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-expected-outcomes-and-almost-sure-termination-of-probabilistic-programs-is-hard-1410.7225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-expected-outcomes-and-almost-sure-termination-of-probabilistic-programs-is-hard-1410.7225"/></url>
<url><loc>https://scifaro.com/en/abs/concurrency-models-with-causality-and-events-as-psi-calculi-1410.7466</loc><lastmod>2014-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrency-models-with-causality-and-events-as-psi-calculi-1410.7466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrency-models-with-causality-and-events-as-psi-calculi-1410.7466"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fly-probabilistic-model-checking-1410.7469</loc><lastmod>2014-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fly-probabilistic-model-checking-1410.7469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fly-probabilistic-model-checking-1410.7469"/></url>
<url><loc>https://scifaro.com/en/abs/the-boolean-algebra-of-cubical-areas-as-a-tensor-product-in-the-category-of-semilattices-with-zero-1410.7470</loc><lastmod>2014-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-boolean-algebra-of-cubical-areas-as-a-tensor-product-in-the-category-of-semilattices-with-zero-1410.7470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-boolean-algebra-of-cubical-areas-as-a-tensor-product-in-the-category-of-semilattices-with-zero-1410.7470"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-and-model-checking-of-ctl-with-graded-path-modalities-1410.7551</loc><lastmod>2014-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-and-model-checking-of-ctl-with-graded-path-modalities-1410.7551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-and-model-checking-of-ctl-with-graded-path-modalities-1410.7551"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-eleventh-workshop-on-user-interfaces-for-theorem-provers-1410.7850</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-eleventh-workshop-on-user-interfaces-for-theorem-provers-1410.7850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-eleventh-workshop-on-user-interfaces-for-theorem-provers-1410.7850"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-equivalence-of-state-transformer-semantics-and-predicate-transformer-semantics-1410.7930</loc><lastmod>2014-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-equivalence-of-state-transformer-semantics-and-predicate-transformer-semantics-1410.7930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-equivalence-of-state-transformer-semantics-and-predicate-transformer-semantics-1410.7930"/></url>
<url><loc>https://scifaro.com/en/abs/probreach-verified-probabilistic-delta-reachability-for-stochastic-hybrid-systems-1410.8060</loc><lastmod>2015-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probreach-verified-probabilistic-delta-reachability-for-stochastic-hybrid-systems-1410.8060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probreach-verified-probabilistic-delta-reachability-for-stochastic-hybrid-systems-1410.8060"/></url>
<url><loc>https://scifaro.com/en/abs/equational-properties-of-stratified-least-fixed-points-1410.8111</loc><lastmod>2015-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-properties-of-stratified-least-fixed-points-1410.8111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-properties-of-stratified-least-fixed-points-1410.8111"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-put-usability-into-focus-using-focus-groups-to-evaluate-the-usability-of-interactive-theorem-provers-1410.8215</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-put-usability-into-focus-using-focus-groups-to-evaluate-the-usability-of-interactive-theorem-provers-1410.8215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-put-usability-into-focus-using-focus-groups-to-evaluate-the-usability-of-interactive-theorem-provers-1410.8215"/></url>
<url><loc>https://scifaro.com/en/abs/utp2-higher-order-equational-reasoning-by-pointing-1410.8216</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/utp2-higher-order-equational-reasoning-by-pointing-1410.8216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/utp2-higher-order-equational-reasoning-by-pointing-1410.8216"/></url>
<url><loc>https://scifaro.com/en/abs/tinker-tailor-solver-proof-1410.8217</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tinker-tailor-solver-proof-1410.8217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tinker-tailor-solver-proof-1410.8217"/></url>
<url><loc>https://scifaro.com/en/abs/advanced-proof-viewing-in-prooftool-1410.8218</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advanced-proof-viewing-in-prooftool-1410.8218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advanced-proof-viewing-in-prooftool-1410.8218"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-independent-ide-1410.8219</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-independent-ide-1410.8219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-independent-ide-1410.8219"/></url>
<url><loc>https://scifaro.com/en/abs/the-certification-problem-format-1410.8220</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-certification-problem-format-1410.8220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-certification-problem-format-1410.8220"/></url>
<url><loc>https://scifaro.com/en/abs/system-description-isabelle-jedit-in-2014-1410.8222</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-description-isabelle-jedit-in-2014-1410.8222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-description-isabelle-jedit-in-2014-1410.8222"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-and-the-decidability-of-reachability-in-alternating-pushdown-systems-1410.8470</loc><lastmod>2014-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-and-the-decidability-of-reachability-in-alternating-pushdown-systems-1410.8470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-and-the-decidability-of-reachability-in-alternating-pushdown-systems-1410.8470"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-paraconsistency-and-reasoning-about-fractions-1410.8692</loc><lastmod>2015-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-paraconsistency-and-reasoning-about-fractions-1410.8692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-paraconsistency-and-reasoning-about-fractions-1410.8692"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-models-of-recursive-asynchronous-concurrency-1410.8852</loc><lastmod>2015-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-models-of-recursive-asynchronous-concurrency-1410.8852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-models-of-recursive-asynchronous-concurrency-1410.8852"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-equivalences-for-coalgebras-with-unobservable-moves-1411.0090</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-equivalences-for-coalgebras-with-unobservable-moves-1411.0090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-equivalences-for-coalgebras-with-unobservable-moves-1411.0090"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-applicability-condition-in-the-formal-system-lambda-delta-1411.0154</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-applicability-condition-in-the-formal-system-lambda-delta-1411.0154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-applicability-condition-in-the-formal-system-lambda-delta-1411.0154"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-randomness-for-doob-s-martingale-convergence-theorem-in-continuous-time-1411.0186</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-randomness-for-doob-s-martingale-convergence-theorem-in-continuous-time-1411.0186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-randomness-for-doob-s-martingale-convergence-theorem-in-continuous-time-1411.0186"/></url>
<url><loc>https://scifaro.com/en/abs/parametrised-bar-recursion-a-unifying-framework-for-realizability-interpretations-of-classical-dependent-choice-1411.0457</loc><lastmod>2015-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametrised-bar-recursion-a-unifying-framework-for-realizability-interpretations-of-classical-dependent-choice-1411.0457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametrised-bar-recursion-a-unifying-framework-for-realizability-interpretations-of-classical-dependent-choice-1411.0457"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-mac-layer-communications-in-wireless-systems-1411.0490</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-mac-layer-communications-in-wireless-systems-1411.0490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-mac-layer-communications-in-wireless-systems-1411.0490"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-ehrenfeucht-fraisse-games-over-omega-terms-1411.0593</loc><lastmod>2014-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-ehrenfeucht-fraisse-games-over-omega-terms-1411.0593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-ehrenfeucht-fraisse-games-over-omega-terms-1411.0593"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-counting-in-smt-and-value-estimation-for-probabilistic-programs-1411.0659</loc><lastmod>2015-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-counting-in-smt-and-value-estimation-for-probabilistic-programs-1411.0659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-counting-in-smt-and-value-estimation-for-probabilistic-programs-1411.0659"/></url>
<url><loc>https://scifaro.com/en/abs/greatest-solutions-of-equations-in-text-cll-r-and-its-application-1411.0756</loc><lastmod>2014-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greatest-solutions-of-equations-in-text-cll-r-and-its-application-1411.0756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greatest-solutions-of-equations-in-text-cll-r-and-its-application-1411.0756"/></url>
<url><loc>https://scifaro.com/en/abs/variations-on-the-stochastic-shortest-path-problem-1411.0835</loc><lastmod>2014-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-on-the-stochastic-shortest-path-problem-1411.0835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-on-the-stochastic-shortest-path-problem-1411.0835"/></url>
<url><loc>https://scifaro.com/en/abs/permission-based-separation-logic-for-multithreaded-java-programs-1411.0851</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permission-based-separation-logic-for-multithreaded-java-programs-1411.0851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permission-based-separation-logic-for-multithreaded-java-programs-1411.0851"/></url>
<url><loc>https://scifaro.com/en/abs/accelerated-runtime-verification-of-ltl-specifications-with-counting-semantics-1411.2239</loc><lastmod>2014-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accelerated-runtime-verification-of-ltl-specifications-with-counting-semantics-1411.2239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accelerated-runtime-verification-of-ltl-specifications-with-counting-semantics-1411.2239"/></url>
<url><loc>https://scifaro.com/en/abs/the-cyclic-routing-uav-problem-is-pspace-complete-1411.2874</loc><lastmod>2015-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cyclic-routing-uav-problem-is-pspace-complete-1411.2874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cyclic-routing-uav-problem-is-pspace-complete-1411.2874"/></url>
<url><loc>https://scifaro.com/en/abs/on-completeness-of-logic-programs-1411.3015</loc><lastmod>2014-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-completeness-of-logic-programs-1411.3015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-completeness-of-logic-programs-1411.3015"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-finding-falsifying-assignments-for-herbrand-disjunctions-1411.3304</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-falsifying-assignments-for-herbrand-disjunctions-1411.3304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-finding-falsifying-assignments-for-herbrand-disjunctions-1411.3304"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-logics-and-model-checking-for-self-systems-1411.3453</loc><lastmod>2014-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-logics-and-model-checking-for-self-systems-1411.3453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-logics-and-model-checking-for-self-systems-1411.3453"/></url>
<url><loc>https://scifaro.com/en/abs/monotonic-abstraction-techniques-from-parametric-to-software-model-checking-1411.3790</loc><lastmod>2014-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonic-abstraction-techniques-from-parametric-to-software-model-checking-1411.3790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonic-abstraction-techniques-from-parametric-to-software-model-checking-1411.3790"/></url>
<url><loc>https://scifaro.com/en/abs/choreographies-and-behavioural-contracts-on-the-way-to-dynamic-updates-1411.3791</loc><lastmod>2014-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choreographies-and-behavioural-contracts-on-the-way-to-dynamic-updates-1411.3791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choreographies-and-behavioural-contracts-on-the-way-to-dynamic-updates-1411.3791"/></url>
<url><loc>https://scifaro.com/en/abs/approaches-for-synthesis-conjectures-in-an-smt-solver-1411.3970</loc><lastmod>2015-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approaches-for-synthesis-conjectures-in-an-smt-solver-1411.3970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approaches-for-synthesis-conjectures-in-an-smt-solver-1411.3970"/></url>
<url><loc>https://scifaro.com/en/abs/sub-computable-boundedness-randomness-1411.3995</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sub-computable-boundedness-randomness-1411.3995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sub-computable-boundedness-randomness-1411.3995"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-deciding-branching-bisimilarity-on-totally-normed-bpa-1411.4157</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-deciding-branching-bisimilarity-on-totally-normed-bpa-1411.4157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-deciding-branching-bisimilarity-on-totally-normed-bpa-1411.4157"/></url>
<url><loc>https://scifaro.com/en/abs/program-logics-for-homogeneous-generative-run-time-meta-programming-1411.4256</loc><lastmod>2017-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-logics-for-homogeneous-generative-run-time-meta-programming-1411.4256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-logics-for-homogeneous-generative-run-time-meta-programming-1411.4256"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-ctl-expressiveness-and-complexity-1411.4332</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-ctl-expressiveness-and-complexity-1411.4332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-ctl-expressiveness-and-complexity-1411.4332"/></url>
<url><loc>https://scifaro.com/en/abs/an-infinitary-model-of-linear-logic-1411.4380</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-infinitary-model-of-linear-logic-1411.4380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-infinitary-model-of-linear-logic-1411.4380"/></url>
<url><loc>https://scifaro.com/en/abs/agree-algebraic-graph-rewriting-with-controlled-embedding-long-version-1411.4597</loc><lastmod>2015-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/agree-algebraic-graph-rewriting-with-controlled-embedding-long-version-1411.4597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/agree-algebraic-graph-rewriting-with-controlled-embedding-long-version-1411.4597"/></url>
<url><loc>https://scifaro.com/en/abs/assume-guarantee-synthesis-for-concurrent-reactive-programs-with-partial-information-1411.4604</loc><lastmod>2014-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assume-guarantee-synthesis-for-concurrent-reactive-programs-with-partial-information-1411.4604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assume-guarantee-synthesis-for-concurrent-reactive-programs-with-partial-information-1411.4604"/></url>
<url><loc>https://scifaro.com/en/abs/another-proof-of-undecidability-for-the-correspondence-decision-problem-had-i-been-emil-post-1411.5197</loc><lastmod>2014-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/another-proof-of-undecidability-for-the-correspondence-decision-problem-had-i-been-emil-post-1411.5197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/another-proof-of-undecidability-for-the-correspondence-decision-problem-had-i-been-emil-post-1411.5197"/></url>
<url><loc>https://scifaro.com/en/abs/on-compiling-structured-cnfs-to-obdds-1411.5494</loc><lastmod>2014-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-compiling-structured-cnfs-to-obdds-1411.5494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-compiling-structured-cnfs-to-obdds-1411.5494"/></url>
<url><loc>https://scifaro.com/en/abs/quadratic-zonotopes-an-extension-of-zonotopes-to-quadratic-arithmetics-1411.5847</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadratic-zonotopes-an-extension-of-zonotopes-to-quadratic-arithmetics-1411.5847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadratic-zonotopes-an-extension-of-zonotopes-to-quadratic-arithmetics-1411.5847"/></url>
<url><loc>https://scifaro.com/en/abs/an-accl-which-is-not-a-crcl-1411.5853</loc><lastmod>2014-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-accl-which-is-not-a-crcl-1411.5853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-accl-which-is-not-a-crcl-1411.5853"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-temporal-epistemic-actions-1411.6279</loc><lastmod>2014-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-temporal-epistemic-actions-1411.6279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-temporal-epistemic-actions-1411.6279"/></url>
<url><loc>https://scifaro.com/en/abs/the-joy-of-implications-aka-pure-horn-functions-mainly-a-survey-1411.6432</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-joy-of-implications-aka-pure-horn-functions-mainly-a-survey-1411.6432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-joy-of-implications-aka-pure-horn-functions-mainly-a-survey-1411.6432"/></url>
<url><loc>https://scifaro.com/en/abs/a-robust-class-of-data-languages-and-an-application-to-learning-1411.6646</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-robust-class-of-data-languages-and-an-application-to-learning-1411.6646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-robust-class-of-data-languages-and-an-application-to-learning-1411.6646"/></url>
<url><loc>https://scifaro.com/en/abs/certification-of-programs-with-computational-effects-1411.7139</loc><lastmod>2014-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certification-of-programs-with-computational-effects-1411.7139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certification-of-programs-with-computational-effects-1411.7139"/></url>
<url><loc>https://scifaro.com/en/abs/program-certification-with-computational-effects-1411.7140</loc><lastmod>2014-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-certification-with-computational-effects-1411.7140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-certification-with-computational-effects-1411.7140"/></url>
<url><loc>https://scifaro.com/en/abs/cathoristic-logic-a-modal-logic-of-incompatible-propositions-1411.7158</loc><lastmod>2014-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cathoristic-logic-a-modal-logic-of-incompatible-propositions-1411.7158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cathoristic-logic-a-modal-logic-of-incompatible-propositions-1411.7158"/></url>
<url><loc>https://scifaro.com/en/abs/dl-pa-and-dcl-pc-model-checking-and-satisfiability-problem-are-indeed-in-pspace-1411.7825</loc><lastmod>2014-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dl-pa-and-dcl-pc-model-checking-and-satisfiability-problem-are-indeed-in-pspace-1411.7825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dl-pa-and-dcl-pc-model-checking-and-satisfiability-problem-are-indeed-in-pspace-1411.7825"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-logic-programs-are-succinctly-incomparable-with-propositional-formulas-1412.0320</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-logic-programs-are-succinctly-incomparable-with-propositional-formulas-1412.0320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-logic-programs-are-succinctly-incomparable-with-propositional-formulas-1412.0320"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-horn-clauses-for-verification-and-synthesis-1412.0825</loc><lastmod>2014-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-horn-clauses-for-verification-and-synthesis-1412.0825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-horn-clauses-for-verification-and-synthesis-1412.0825"/></url>
<url><loc>https://scifaro.com/en/abs/a-csp-implementation-of-the-bigraph-embedding-problem-1412.1042</loc><lastmod>2019-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-csp-implementation-of-the-bigraph-embedding-problem-1412.1042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-csp-implementation-of-the-bigraph-embedding-problem-1412.1042"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-programs-by-combining-iterated-specialization-with-interpolation-1412.1151</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-programs-by-combining-iterated-specialization-with-interpolation-1412.1151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-programs-by-combining-iterated-specialization-with-interpolation-1412.1151"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-modular-invariants-for-synchronous-code-1412.1152</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-modular-invariants-for-synchronous-code-1412.1152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-modular-invariants-for-synchronous-code-1412.1152"/></url>
<url><loc>https://scifaro.com/en/abs/horn-clauses-for-communicating-timed-systems-1412.1153</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-clauses-for-communicating-timed-systems-1412.1153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-clauses-for-communicating-timed-systems-1412.1153"/></url>
<url><loc>https://scifaro.com/en/abs/convex-polyhedral-abstractions-specialisation-and-property-based-predicate-splitting-in-horn-clause-verification-1412.1154</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-polyhedral-abstractions-specialisation-and-property-based-predicate-splitting-in-horn-clause-verification-1412.1154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-polyhedral-abstractions-specialisation-and-property-based-predicate-splitting-in-horn-clause-verification-1412.1154"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-verification-through-forward-chaining-1412.1156</loc><lastmod>2014-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-verification-through-forward-chaining-1412.1156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-verification-through-forward-chaining-1412.1156"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-justification-and-adequate-reasons-1412.1862</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-justification-and-adequate-reasons-1412.1862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-justification-and-adequate-reasons-1412.1862"/></url>
<url><loc>https://scifaro.com/en/abs/sequences-of-rewrites-a-categorical-interpretation-1412.2105</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequences-of-rewrites-a-categorical-interpretation-1412.2105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequences-of-rewrites-a-categorical-interpretation-1412.2105"/></url>
<url><loc>https://scifaro.com/en/abs/on-abstract-normalisation-beyond-neededness-1412.2118</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-abstract-normalisation-beyond-neededness-1412.2118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-abstract-normalisation-beyond-neededness-1412.2118"/></url>
<url><loc>https://scifaro.com/en/abs/resource-control-and-intersection-types-an-intrinsic-connection-1412.2219</loc><lastmod>2014-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-control-and-intersection-types-an-intrinsic-connection-1412.2219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-control-and-intersection-types-an-intrinsic-connection-1412.2219"/></url>
<url><loc>https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-the-extended-calculus-of-constructions-1412.2235</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-the-extended-calculus-of-constructions-1412.2235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-the-extended-calculus-of-constructions-1412.2235"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-ectl-with-tree-constraints-1412.2905</loc><lastmod>2015-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-ectl-with-tree-constraints-1412.2905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-ectl-with-tree-constraints-1412.2905"/></url>
<url><loc>https://scifaro.com/en/abs/a-second-order-formulation-of-non-termination-1412.3271</loc><lastmod>2014-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-second-order-formulation-of-non-termination-1412.3271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-second-order-formulation-of-non-termination-1412.3271"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-temporal-attribute-implications-1412.3633</loc><lastmod>2021-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-temporal-attribute-implications-1412.3633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-temporal-attribute-implications-1412.3633"/></url>
<url><loc>https://scifaro.com/en/abs/path-checking-for-mtl-and-tptl-over-data-words-1412.3644</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/path-checking-for-mtl-and-tptl-over-data-words-1412.3644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/path-checking-for-mtl-and-tptl-over-data-words-1412.3644"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-rate-multi-mode-systems-based-motion-planning-1412.3670</loc><lastmod>2014-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-rate-multi-mode-systems-based-motion-planning-1412.3670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-rate-multi-mode-systems-based-motion-planning-1412.3670"/></url>
<url><loc>https://scifaro.com/en/abs/equivariant-algorithms-for-constraint-satisfaction-problems-over-coset-templates-1412.4020</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivariant-algorithms-for-constraint-satisfaction-problems-over-coset-templates-1412.4020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivariant-algorithms-for-constraint-satisfaction-problems-over-coset-templates-1412.4020"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-vietoris-bisimulations-1412.4586</loc><lastmod>2018-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-vietoris-bisimulations-1412.4586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-vietoris-bisimulations-1412.4586"/></url>
<url><loc>https://scifaro.com/en/abs/equations-over-free-inverse-monoids-with-idempotent-variables-1412.4737</loc><lastmod>2015-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equations-over-free-inverse-monoids-with-idempotent-variables-1412.4737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equations-over-free-inverse-monoids-with-idempotent-variables-1412.4737"/></url>
<url><loc>https://scifaro.com/en/abs/belief-as-willingness-to-bet-1412.5090</loc><lastmod>2014-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-as-willingness-to-bet-1412.5090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-as-willingness-to-bet-1412.5090"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-redundant-css-rules-in-html5-applications-a-tree-rewriting-approach-1412.5143</loc><lastmod>2015-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-redundant-css-rules-in-html5-applications-a-tree-rewriting-approach-1412.5143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-redundant-css-rules-in-html5-applications-a-tree-rewriting-approach-1412.5143"/></url>
<url><loc>https://scifaro.com/en/abs/solving-3-color-parity-games-in-o-n-2-time-1412.5159</loc><lastmod>2014-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-3-color-parity-games-in-o-n-2-time-1412.5159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-3-color-parity-games-in-o-n-2-time-1412.5159"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-dl-lite-1412.5795</loc><lastmod>2015-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-dl-lite-1412.5795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-dl-lite-1412.5795"/></url>
<url><loc>https://scifaro.com/en/abs/globally-governed-session-semantics-1412.5943</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/globally-governed-session-semantics-1412.5943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/globally-governed-session-semantics-1412.5943"/></url>
<url><loc>https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-a-complete-complexity-theoretic-classification-1412.6396</loc><lastmod>2014-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-a-complete-complexity-theoretic-classification-1412.6396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-a-complete-complexity-theoretic-classification-1412.6396"/></url>
<url><loc>https://scifaro.com/en/abs/a-hoare-logic-for-the-coinductive-trace-based-big-step-semantics-of-while-1412.6579</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hoare-logic-for-the-coinductive-trace-based-big-step-semantics-of-while-1412.6579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hoare-logic-for-the-coinductive-trace-based-big-step-semantics-of-while-1412.6579"/></url>
<url><loc>https://scifaro.com/en/abs/polarities-focussing-a-journey-from-realisability-to-automated-reasoning-1412.6781</loc><lastmod>2014-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polarities-focussing-a-journey-from-realisability-to-automated-reasoning-1412.6781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polarities-focussing-a-journey-from-realisability-to-automated-reasoning-1412.6781"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatic-constraint-systems-for-proof-search-modulo-theories-1412.6790</loc><lastmod>2015-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatic-constraint-systems-for-proof-search-modulo-theories-1412.6790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatic-constraint-systems-for-proof-search-modulo-theories-1412.6790"/></url>
<url><loc>https://scifaro.com/en/abs/conversion-of-hol-light-proofs-into-metamath-1412.8091</loc><lastmod>2015-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conversion-of-hol-light-proofs-into-metamath-1412.8091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conversion-of-hol-light-proofs-into-metamath-1412.8091"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-11th-workshop-on-quantum-physics-and-logic-1412.8102</loc><lastmod>2014-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-11th-workshop-on-quantum-physics-and-logic-1412.8102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-11th-workshop-on-quantum-physics-and-logic-1412.8102"/></url>
<url><loc>https://scifaro.com/en/abs/from-logical-to-distributional-models-1412.8527</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-logical-to-distributional-models-1412.8527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-logical-to-distributional-models-1412.8527"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-characterizations-of-operator-valued-measures-1412.8528</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-characterizations-of-operator-valued-measures-1412.8528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-characterizations-of-operator-valued-measures-1412.8528"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-relational-presheaves-and-dynamic-logic-for-contextuality-1412.8542</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-relational-presheaves-and-dynamic-logic-for-contextuality-1412.8542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-relational-presheaves-and-dynamic-logic-for-contextuality-1412.8542"/></url>
<url><loc>https://scifaro.com/en/abs/qpel-quantum-program-and-effect-language-1412.8543</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qpel-quantum-program-and-effect-language-1412.8543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qpel-quantum-program-and-effect-language-1412.8543"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-a-quantum-programming-language-by-operator-algebras-1412.8545</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-a-quantum-programming-language-by-operator-algebras-1412.8545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-a-quantum-programming-language-by-operator-algebras-1412.8545"/></url>
<url><loc>https://scifaro.com/en/abs/observational-equivalence-using-schedulers-for-quantum-processes-1412.8546</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observational-equivalence-using-schedulers-for-quantum-processes-1412.8546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observational-equivalence-using-schedulers-for-quantum-processes-1412.8546"/></url>
<url><loc>https://scifaro.com/en/abs/a-2-categorical-analysis-of-complementary-families-quantum-key-distribution-and-the-mean-king-problem-1412.8548</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-2-categorical-analysis-of-complementary-families-quantum-key-distribution-and-the-mean-king-problem-1412.8548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-2-categorical-analysis-of-complementary-families-quantum-key-distribution-and-the-mean-king-problem-1412.8548"/></url>
<url><loc>https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-1412.8552</loc><lastmod>2014-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-1412.8552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-1412.8552"/></url>
<url><loc>https://scifaro.com/en/abs/correctness-and-completeness-of-logic-programs-1412.8739</loc><lastmod>2017-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctness-and-completeness-of-logic-programs-1412.8739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctness-and-completeness-of-logic-programs-1412.8739"/></url>
<url><loc>https://scifaro.com/en/abs/computability-on-the-space-of-countable-ordinals-1501.00386</loc><lastmod>2017-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-on-the-space-of-countable-ordinals-1501.00386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-on-the-space-of-countable-ordinals-1501.00386"/></url>
<url><loc>https://scifaro.com/en/abs/software-safety-demonstration-and-idemnification-1501.00820</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-safety-demonstration-and-idemnification-1501.00820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-safety-demonstration-and-idemnification-1501.00820"/></url>
<url><loc>https://scifaro.com/en/abs/recovering-intuition-from-automated-formal-proofs-using-tableaux-with-superdeduction-1501.01170</loc><lastmod>2015-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recovering-intuition-from-automated-formal-proofs-using-tableaux-with-superdeduction-1501.01170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recovering-intuition-from-automated-formal-proofs-using-tableaux-with-superdeduction-1501.01170"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-modulo-theories-using-superdeduction-1501.01301</loc><lastmod>2015-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-modulo-theories-using-superdeduction-1501.01301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-modulo-theories-using-superdeduction-1501.01301"/></url>
<url><loc>https://scifaro.com/en/abs/program-synthesis-from-axiomatic-proof-of-correctness-1501.01363</loc><lastmod>2015-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-synthesis-from-axiomatic-proof-of-correctness-1501.01363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-synthesis-from-axiomatic-proof-of-correctness-1501.01363"/></url>
<url><loc>https://scifaro.com/en/abs/specsatisfiabilitytool-a-tool-for-testing-the-satisfiability-of-specifications-on-xml-documents-1501.02032</loc><lastmod>2015-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specsatisfiabilitytool-a-tool-for-testing-the-satisfiability-of-specifications-on-xml-documents-1501.02032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specsatisfiabilitytool-a-tool-for-testing-the-satisfiability-of-specifications-on-xml-documents-1501.02032"/></url>
<url><loc>https://scifaro.com/en/abs/improving-the-deductive-system-des-with-persistence-by-using-sql-dbms-s-1501.02036</loc><lastmod>2015-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-the-deductive-system-des-with-persistence-by-using-sql-dbms-s-1501.02036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-the-deductive-system-des-with-persistence-by-using-sql-dbms-s-1501.02036"/></url>
<url><loc>https://scifaro.com/en/abs/stateless-model-checking-for-tso-and-pso-1501.02069</loc><lastmod>2015-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateless-model-checking-for-tso-and-pso-1501.02069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateless-model-checking-for-tso-and-pso-1501.02069"/></url>
<url><loc>https://scifaro.com/en/abs/equational-axioms-associated-with-finite-automata-for-fixed-point-operations-in-cartesian-categories-1501.02190</loc><lastmod>2015-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-axioms-associated-with-finite-automata-for-fixed-point-operations-in-cartesian-categories-1501.02190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-axioms-associated-with-finite-automata-for-fixed-point-operations-in-cartesian-categories-1501.02190"/></url>
<url><loc>https://scifaro.com/en/abs/term-satisfiability-in-fl-mathrm-ew-algebras-1501.02250</loc><lastmod>2016-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/term-satisfiability-in-fl-mathrm-ew-algebras-1501.02250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/term-satisfiability-in-fl-mathrm-ew-algebras-1501.02250"/></url>
<url><loc>https://scifaro.com/en/abs/shield-synthesis-runtime-enforcement-for-reactive-systems-1501.02573</loc><lastmod>2015-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shield-synthesis-runtime-enforcement-for-reactive-systems-1501.02573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shield-synthesis-runtime-enforcement-for-reactive-systems-1501.02573"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-theorems-for-pdl-and-fo-tc-1501.02607</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-theorems-for-pdl-and-fo-tc-1501.02607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-theorems-for-pdl-and-fo-tc-1501.02607"/></url>
<url><loc>https://scifaro.com/en/abs/step-indexed-logical-relations-for-probability-long-version-1501.02623</loc><lastmod>2015-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/step-indexed-logical-relations-for-probability-long-version-1501.02623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/step-indexed-logical-relations-for-probability-long-version-1501.02623"/></url>
<url><loc>https://scifaro.com/en/abs/context-dependent-functions-narrowing-the-realm-of-turing-s-halting-problem-1501.03018</loc><lastmod>2015-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-dependent-functions-narrowing-the-realm-of-turing-s-halting-problem-1501.03018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-dependent-functions-narrowing-the-realm-of-turing-s-halting-problem-1501.03018"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-in-communication-networks-1501.03028</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-in-communication-networks-1501.03028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-in-communication-networks-1501.03028"/></url>
<url><loc>https://scifaro.com/en/abs/autoproof-auto-active-functional-verification-of-object-oriented-programs-1501.03063</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autoproof-auto-active-functional-verification-of-object-oriented-programs-1501.03063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autoproof-auto-active-functional-verification-of-object-oriented-programs-1501.03063"/></url>
<url><loc>https://scifaro.com/en/abs/progress-fairness-and-justness-in-process-algebra-1501.03268</loc><lastmod>2015-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progress-fairness-and-justness-in-process-algebra-1501.03268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progress-fairness-and-justness-in-process-algebra-1501.03268"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculus-in-the-topos-of-trees-1501.03293</loc><lastmod>2015-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculus-in-the-topos-of-trees-1501.03293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculus-in-the-topos-of-trees-1501.03293"/></url>
<url><loc>https://scifaro.com/en/abs/nested-antichains-for-ws1s-1501.03849</loc><lastmod>2015-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-antichains-for-ws1s-1501.03849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-antichains-for-ws1s-1501.03849"/></url>
<url><loc>https://scifaro.com/en/abs/rdf-validation-requirements-evaluation-and-logical-underpinning-1501.03933</loc><lastmod>2015-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rdf-validation-requirements-evaluation-and-logical-underpinning-1501.03933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rdf-validation-requirements-evaluation-and-logical-underpinning-1501.03933"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-interpolants-1501.04100</loc><lastmod>2015-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-interpolants-1501.04100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-interpolants-1501.04100"/></url>
<url><loc>https://scifaro.com/en/abs/coinduction-an-elementary-approach-1501.04354</loc><lastmod>2019-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinduction-an-elementary-approach-1501.04354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinduction-an-elementary-approach-1501.04354"/></url>
<url><loc>https://scifaro.com/en/abs/k-variables-are-needed-to-define-k-clique-in-first-order-logic-1501.04572</loc><lastmod>2015-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/k-variables-are-needed-to-define-k-clique-in-first-order-logic-1501.04572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/k-variables-are-needed-to-define-k-clique-in-first-order-logic-1501.04572"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-on-normed-bpa-is-exptime-complete-1501.04748</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-on-normed-bpa-is-exptime-complete-1501.04748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-on-normed-bpa-is-exptime-complete-1501.04748"/></url>
<url><loc>https://scifaro.com/en/abs/relational-semantics-of-linear-logic-and-higher-order-model-checking-1501.04789</loc><lastmod>2016-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-semantics-of-linear-logic-and-higher-order-model-checking-1501.04789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-semantics-of-linear-logic-and-higher-order-model-checking-1501.04789"/></url>
<url><loc>https://scifaro.com/en/abs/relative-entailment-among-probabilistic-implications-1501.04826</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-entailment-among-probabilistic-implications-1501.04826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-entailment-among-probabilistic-implications-1501.04826"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-semantics-for-linear-logical-frameworks-1501.05016</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-semantics-for-linear-logical-frameworks-1501.05016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-semantics-for-linear-logical-frameworks-1501.05016"/></url>
<url><loc>https://scifaro.com/en/abs/memoization-for-unary-logic-programming-characterizing-ptime-1501.05104</loc><lastmod>2015-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memoization-for-unary-logic-programming-characterizing-ptime-1501.05104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memoization-for-unary-logic-programming-characterizing-ptime-1501.05104"/></url>
<url><loc>https://scifaro.com/en/abs/an-isbell-duality-theorem-for-type-refinement-systems-1501.05115</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-isbell-duality-theorem-for-type-refinement-systems-1501.05115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-isbell-duality-theorem-for-type-refinement-systems-1501.05115"/></url>
<url><loc>https://scifaro.com/en/abs/taming-multirelations-1501.05147</loc><lastmod>2015-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-multirelations-1501.05147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-multirelations-1501.05147"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-quantum-process-algebra-1501.05260</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-quantum-process-algebra-1501.05260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-quantum-process-algebra-1501.05260"/></url>
<url><loc>https://scifaro.com/en/abs/on-frequency-ltl-in-probabilistic-systems-1501.05561</loc><lastmod>2015-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-frequency-ltl-in-probabilistic-systems-1501.05561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-frequency-ltl-in-probabilistic-systems-1501.05561"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-trivial-overlap-are-context-free-1501.06059</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-trivial-overlap-are-context-free-1501.06059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-trivial-overlap-are-context-free-1501.06059"/></url>
<url><loc>https://scifaro.com/en/abs/proof-normalisation-in-a-logic-identifying-isomorphic-propositions-1501.06125</loc><lastmod>2019-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-normalisation-in-a-logic-identifying-isomorphic-propositions-1501.06125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-normalisation-in-a-logic-identifying-isomorphic-propositions-1501.06125"/></url>
<url><loc>https://scifaro.com/en/abs/dynamics-of-belief-abduction-horn-knowledge-base-and-database-updates-1501.06206</loc><lastmod>2015-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamics-of-belief-abduction-horn-knowledge-base-and-database-updates-1501.06206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamics-of-belief-abduction-horn-knowledge-base-and-database-updates-1501.06206"/></url>
<url><loc>https://scifaro.com/en/abs/models-and-termination-of-proof-reduction-in-the-lambda-pi-calculus-modulo-theory-1501.06522</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-and-termination-of-proof-reduction-in-the-lambda-pi-calculus-modulo-theory-1501.06522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-and-termination-of-proof-reduction-in-the-lambda-pi-calculus-modulo-theory-1501.06522"/></url>
<url><loc>https://scifaro.com/en/abs/deduction-modulo-theory-1501.06523</loc><lastmod>2015-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deduction-modulo-theory-1501.06523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deduction-modulo-theory-1501.06523"/></url>
<url><loc>https://scifaro.com/en/abs/a-diagrammatic-axiomatisation-for-qubit-entanglement-1501.07082</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-diagrammatic-axiomatisation-for-qubit-entanglement-1501.07082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-diagrammatic-axiomatisation-for-qubit-entanglement-1501.07082"/></url>
<url><loc>https://scifaro.com/en/abs/the-logic-of-counting-query-answers-1501.07195</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logic-of-counting-query-answers-1501.07195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logic-of-counting-query-answers-1501.07195"/></url>
<url><loc>https://scifaro.com/en/abs/bernays-schoenfinkel-ramsey-with-simple-bounds-is-nexptime-complete-1501.07209</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bernays-schoenfinkel-ramsey-with-simple-bounds-is-nexptime-complete-1501.07209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bernays-schoenfinkel-ramsey-with-simple-bounds-is-nexptime-complete-1501.07209"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-logic-and-bisimulation-invariance-for-coalgebras-1501.07215</loc><lastmod>2015-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-logic-and-bisimulation-invariance-for-coalgebras-1501.07215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-logic-and-bisimulation-invariance-for-coalgebras-1501.07215"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-law-for-hyper-graphs-with-prescribed-degree-sequences-1501.07429</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-law-for-hyper-graphs-with-prescribed-degree-sequences-1501.07429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-law-for-hyper-graphs-with-prescribed-degree-sequences-1501.07429"/></url>
<url><loc>https://scifaro.com/en/abs/bar-recursion-in-classical-realisability-dependent-choice-and-continuum-hypothesis-1502.00112</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bar-recursion-in-classical-realisability-dependent-choice-and-continuum-hypothesis-1502.00112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bar-recursion-in-classical-realisability-dependent-choice-and-continuum-hypothesis-1502.00112"/></url>
<url><loc>https://scifaro.com/en/abs/an-in-between-implicit-and-explicit-complexity-automata-1502.00145</loc><lastmod>2015-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-in-between-implicit-and-explicit-complexity-automata-1502.00145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-in-between-implicit-and-explicit-complexity-automata-1502.00145"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-two-views-on-multiple-mean-payoff-objectives-in-markov-decision-processes-1502.00611</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-two-views-on-multiple-mean-payoff-objectives-in-markov-decision-processes-1502.00611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-two-views-on-multiple-mean-payoff-objectives-in-markov-decision-processes-1502.00611"/></url>
<url><loc>https://scifaro.com/en/abs/grafting-hypersequents-onto-nested-sequents-1502.00814</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grafting-hypersequents-onto-nested-sequents-1502.00814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grafting-hypersequents-onto-nested-sequents-1502.00814"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-proving-depth-boundedness-in-the-pi-calculus-1502.00944</loc><lastmod>2015-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-proving-depth-boundedness-in-the-pi-calculus-1502.00944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-proving-depth-boundedness-in-the-pi-calculus-1502.00944"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-complexity-through-realisability-theory-1502.01257</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-complexity-through-realisability-theory-1502.01257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-complexity-through-realisability-theory-1502.01257"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-verification-of-rare-properties-using-importance-splitting-observers-1502.01838</loc><lastmod>2015-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-verification-of-rare-properties-using-importance-splitting-observers-1502.01838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-verification-of-rare-properties-using-importance-splitting-observers-1502.01838"/></url>
<url><loc>https://scifaro.com/en/abs/mall-proof-equivalence-is-logspace-complete-via-binary-decision-diagrams-1502.01993</loc><lastmod>2015-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mall-proof-equivalence-is-logspace-complete-via-binary-decision-diagrams-1502.01993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mall-proof-equivalence-is-logspace-complete-via-binary-decision-diagrams-1502.01993"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-verified-decision-procedures-dpll-and-resolution-1502.02131</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-verified-decision-procedures-dpll-and-resolution-1502.02131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-verified-decision-procedures-dpll-and-resolution-1502.02131"/></url>
<url><loc>https://scifaro.com/en/abs/rigorous-deductive-argumentation-for-socially-relevant-issues-1502.02272</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rigorous-deductive-argumentation-for-socially-relevant-issues-1502.02272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rigorous-deductive-argumentation-for-socially-relevant-issues-1502.02272"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-c-programs-with-loops-via-k-induction-and-invariants-1502.02327</loc><lastmod>2015-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-c-programs-with-loops-via-k-induction-and-invariants-1502.02327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-c-programs-with-loops-via-k-induction-and-invariants-1502.02327"/></url>
<url><loc>https://scifaro.com/en/abs/the-extensional-realizability-model-of-continuous-functionals-and-three-weakly-non-constructive-classical-theorems-1502.02388</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-extensional-realizability-model-of-continuous-functionals-and-three-weakly-non-constructive-classical-theorems-1502.02388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-extensional-realizability-model-of-continuous-functionals-and-three-weakly-non-constructive-classical-theorems-1502.02388"/></url>
<url><loc>https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-1502.02404</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-1502.02404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relational-model-is-injective-for-multiplicative-exponential-linear-logic-1502.02404"/></url>
<url><loc>https://scifaro.com/en/abs/dear-cav-we-need-to-talk-about-reproducibility-1502.02448</loc><lastmod>2015-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dear-cav-we-need-to-talk-about-reproducibility-1502.02448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dear-cav-we-need-to-talk-about-reproducibility-1502.02448"/></url>
<url><loc>https://scifaro.com/en/abs/incrementally-computing-minimal-unsatisfiable-cores-of-qbfs-via-a-clause-group-solver-api-1502.02484</loc><lastmod>2015-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incrementally-computing-minimal-unsatisfiable-cores-of-qbfs-via-a-clause-group-solver-api-1502.02484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incrementally-computing-minimal-unsatisfiable-cores-of-qbfs-via-a-clause-group-solver-api-1502.02484"/></url>
<url><loc>https://scifaro.com/en/abs/core-higher-order-session-processes-tractable-equivalences-and-relative-expressiveness-1502.02585</loc><lastmod>2015-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/core-higher-order-session-processes-tractable-equivalences-and-relative-expressiveness-1502.02585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/core-higher-order-session-processes-tractable-equivalences-and-relative-expressiveness-1502.02585"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-explanation-by-learning-small-strategies-in-markov-decision-processes-1502.02834</loc><lastmod>2015-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-explanation-by-learning-small-strategies-in-markov-decision-processes-1502.02834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-explanation-by-learning-small-strategies-in-markov-decision-processes-1502.02834"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-tools-for-bisimilarity-and-decorated-trace-semantics-1502.02910</loc><lastmod>2015-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-tools-for-bisimilarity-and-decorated-trace-semantics-1502.02910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-tools-for-bisimilarity-and-decorated-trace-semantics-1502.02910"/></url>
<url><loc>https://scifaro.com/en/abs/skipping-refinement-1502.02942</loc><lastmod>2015-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skipping-refinement-1502.02942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skipping-refinement-1502.02942"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-in-the-call-by-need-lambda-calculus-with-letrec-case-constructors-and-seq-1502.03216</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-in-the-call-by-need-lambda-calculus-with-letrec-case-constructors-and-seq-1502.03216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-in-the-call-by-need-lambda-calculus-with-letrec-case-constructors-and-seq-1502.03216"/></url>
<url><loc>https://scifaro.com/en/abs/solution-sets-for-equations-over-free-groups-are-edt0l-languages-icalp-2015-version-1502.03426</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solution-sets-for-equations-over-free-groups-are-edt0l-languages-icalp-2015-version-1502.03426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solution-sets-for-equations-over-free-groups-are-edt0l-languages-icalp-2015-version-1502.03426"/></url>
<url><loc>https://scifaro.com/en/abs/on-synchronous-and-asynchronous-monitor-instrumentation-for-actor-based-systems-1502.03514</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-synchronous-and-asynchronous-monitor-instrumentation-for-actor-based-systems-1502.03514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-synchronous-and-asynchronous-monitor-instrumentation-for-actor-based-systems-1502.03514"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-greatest-solution-of-equations-in-text-cll-r-1502.03629</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-greatest-solution-of-equations-in-text-cll-r-1502.03629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-greatest-solution-of-equations-in-text-cll-r-1502.03629"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-l-u-ttgen-and-vogler-s-ready-simulation-for-finite-processes-in-text-cll-r-1502.03636</loc><lastmod>2015-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-l-u-ttgen-and-vogler-s-ready-simulation-for-finite-processes-in-text-cll-r-1502.03636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-l-u-ttgen-and-vogler-s-ready-simulation-for-finite-processes-in-text-cll-r-1502.03636"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-international-workshop-on-linearity-1502.04419</loc><lastmod>2015-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-international-workshop-on-linearity-1502.04419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-international-workshop-on-linearity-1502.04419"/></url>
<url><loc>https://scifaro.com/en/abs/on-counterexample-guided-quantifier-instantiation-for-synthesis-in-cvc4-1502.04464</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-counterexample-guided-quantifier-instantiation-for-synthesis-in-cvc4-1502.04464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-counterexample-guided-quantifier-instantiation-for-synthesis-in-cvc4-1502.04464"/></url>
<url><loc>https://scifaro.com/en/abs/the-mso-u-theory-of-n-is-undecidable-1502.04578</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mso-u-theory-of-n-is-undecidable-1502.04578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mso-u-theory-of-n-is-undecidable-1502.04578"/></url>
<url><loc>https://scifaro.com/en/abs/the-exp-log-normal-form-of-types-1502.04634</loc><lastmod>2019-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-exp-log-normal-form-of-types-1502.04634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-exp-log-normal-form-of-types-1502.04634"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-multiplicative-subexponential-logic-1502.04769</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-multiplicative-subexponential-logic-1502.04769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-multiplicative-subexponential-logic-1502.04769"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-producer-consumer-model-of-classical-linear-logic-1502.04770</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-producer-consumer-model-of-classical-linear-logic-1502.04770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-producer-consumer-model-of-classical-linear-logic-1502.04770"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-in-multifocused-linear-logic-1502.04771</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-in-multifocused-linear-logic-1502.04771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-in-multifocused-linear-logic-1502.04771"/></url>
<url><loc>https://scifaro.com/en/abs/ludics-without-designs-i-triads-1502.04773</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ludics-without-designs-i-triads-1502.04773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ludics-without-designs-i-triads-1502.04773"/></url>
<url><loc>https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-1502.04774</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-1502.04774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wave-style-token-machines-and-quantum-lambda-calculi-1502.04774"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-of-resource-interaction-a-minimalist-approach-1502.04775</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-of-resource-interaction-a-minimalist-approach-1502.04775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-of-resource-interaction-a-minimalist-approach-1502.04775"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-synthesis-from-probabilistic-components-1502.04844</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-synthesis-from-probabilistic-components-1502.04844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-synthesis-from-probabilistic-components-1502.04844"/></url>
<url><loc>https://scifaro.com/en/abs/recognisable-languages-over-monads-1502.04898</loc><lastmod>2015-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recognisable-languages-over-monads-1502.04898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recognisable-languages-over-monads-1502.04898"/></url>
<url><loc>https://scifaro.com/en/abs/finitary-semantics-of-linear-logic-and-higher-order-model-checking-1502.05147</loc><lastmod>2016-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitary-semantics-of-linear-logic-and-higher-order-model-checking-1502.05147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitary-semantics-of-linear-logic-and-higher-order-model-checking-1502.05147"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-size-optimal-sorting-networks-extracting-a-certified-proof-checker-1502.05209</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-size-optimal-sorting-networks-extracting-a-certified-proof-checker-1502.05209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-size-optimal-sorting-networks-extracting-a-certified-proof-checker-1502.05209"/></url>
<url><loc>https://scifaro.com/en/abs/nrcl-a-model-building-approach-to-the-bernays-sch-onfinkel-fragment-full-paper-1502.05501</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nrcl-a-model-building-approach-to-the-bernays-sch-onfinkel-fragment-full-paper-1502.05501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nrcl-a-model-building-approach-to-the-bernays-sch-onfinkel-fragment-full-paper-1502.05501"/></url>
<url><loc>https://scifaro.com/en/abs/positive-inductive-recursive-definitions-1502.05561</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-inductive-recursive-definitions-1502.05561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-inductive-recursive-definitions-1502.05561"/></url>
<url><loc>https://scifaro.com/en/abs/a-multiple-valued-logic-approach-to-the-design-and-verification-of-hardware-circuits-1502.05748</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multiple-valued-logic-approach-to-the-design-and-verification-of-hardware-circuits-1502.05748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multiple-valued-logic-approach-to-the-design-and-verification-of-hardware-circuits-1502.05748"/></url>
<url><loc>https://scifaro.com/en/abs/bimodal-logics-with-a-weakly-connected-component-without-the-finite-model-property-1502.05834</loc><lastmod>2017-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bimodal-logics-with-a-weakly-connected-component-without-the-finite-model-property-1502.05834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bimodal-logics-with-a-weakly-connected-component-without-the-finite-model-property-1502.05834"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-proof-complexity-of-deep-inference-via-atomic-flows-1502.05860</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-proof-complexity-of-deep-inference-via-atomic-flows-1502.05860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-proof-complexity-of-deep-inference-via-atomic-flows-1502.05860"/></url>
<url><loc>https://scifaro.com/en/abs/bialgebraic-semantics-for-logic-programming-1502.06095</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bialgebraic-semantics-for-logic-programming-1502.06095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bialgebraic-semantics-for-logic-programming-1502.06095"/></url>
<url><loc>https://scifaro.com/en/abs/a-sound-and-complete-axiomatization-of-majority-n-logic-1502.06359</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sound-and-complete-axiomatization-of-majority-n-logic-1502.06359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sound-and-complete-axiomatization-of-majority-n-logic-1502.06359"/></url>
<url><loc>https://scifaro.com/en/abs/mutually-testing-processes-1502.06360</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutually-testing-processes-1502.06360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutually-testing-processes-1502.06360"/></url>
<url><loc>https://scifaro.com/en/abs/on-reducing-linearizability-to-state-reachability-1502.06882</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reducing-linearizability-to-state-reachability-1502.06882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reducing-linearizability-to-state-reachability-1502.06882"/></url>
<url><loc>https://scifaro.com/en/abs/rational-fuzzy-attribute-logic-1502.07326</loc><lastmod>2015-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-fuzzy-attribute-logic-1502.07326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-fuzzy-attribute-logic-1502.07326"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-is-in-dynfo-1502.07467</loc><lastmod>2017-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-is-in-dynfo-1502.07467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-is-in-dynfo-1502.07467"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-branching-time-properties-of-probabilistic-automata-and-probabilistic-one-counter-automata-1502.07549</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-branching-time-properties-of-probabilistic-automata-and-probabilistic-one-counter-automata-1502.07549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-branching-time-properties-of-probabilistic-automata-and-probabilistic-one-counter-automata-1502.07549"/></url>
<url><loc>https://scifaro.com/en/abs/a-finite-basis-theorem-for-the-description-logic-cal-alc-1502.07634</loc><lastmod>2017-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-basis-theorem-for-the-description-logic-cal-alc-1502.07634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-basis-theorem-for-the-description-logic-cal-alc-1502.07634"/></url>
<url><loc>https://scifaro.com/en/abs/aspect-oriented-linearizability-proofs-1502.07639</loc><lastmod>2015-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aspect-oriented-linearizability-proofs-1502.07639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aspect-oriented-linearizability-proofs-1502.07639"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-diagnosability-analysis-with-petri-nets-1502.07744</loc><lastmod>2015-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-diagnosability-analysis-with-petri-nets-1502.07744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-diagnosability-analysis-with-petri-nets-1502.07744"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-of-the-modal-mu-calculus-on-monotone-neighborhood-structures-1502.07889</loc><lastmod>2015-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-of-the-modal-mu-calculus-on-monotone-neighborhood-structures-1502.07889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-of-the-modal-mu-calculus-on-monotone-neighborhood-structures-1502.07889"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-a-certified-proof-checker-for-a-large-scale-computer-generated-proof-1502.08008</loc><lastmod>2016-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-a-certified-proof-checker-for-a-large-scale-computer-generated-proof-1502.08008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-a-certified-proof-checker-for-a-large-scale-computer-generated-proof-1502.08008"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-temporal-equilibrium-logic-1503.00043</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-temporal-equilibrium-logic-1503.00043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-temporal-equilibrium-logic-1503.00043"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1503.00193</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1503.00193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-templates-for-linear-loops-1503.00193"/></url>
<url><loc>https://scifaro.com/en/abs/clp-h-constraint-logic-programming-for-hedges-1503.00336</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clp-h-constraint-logic-programming-for-hedges-1503.00336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clp-h-constraint-logic-programming-for-hedges-1503.00336"/></url>
<url><loc>https://scifaro.com/en/abs/nexp-completeness-and-universal-hardness-results-for-justification-logic-1503.00362</loc><lastmod>2015-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nexp-completeness-and-universal-hardness-results-for-justification-logic-1503.00362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nexp-completeness-and-universal-hardness-results-for-justification-logic-1503.00362"/></url>
<url><loc>https://scifaro.com/en/abs/demystifying-reachability-in-vector-addition-systems-1503.00745</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/demystifying-reachability-in-vector-addition-systems-1503.00745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/demystifying-reachability-in-vector-addition-systems-1503.00745"/></url>
<url><loc>https://scifaro.com/en/abs/towards-reasoning-about-properties-of-imperative-programs-using-linear-logic-1503.00826</loc><lastmod>2015-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-reasoning-about-properties-of-imperative-programs-using-linear-logic-1503.00826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-reasoning-about-properties-of-imperative-programs-using-linear-logic-1503.00826"/></url>
<url><loc>https://scifaro.com/en/abs/on-geometry-of-interaction-for-polarized-linear-logic-1503.00886</loc><lastmod>2017-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-geometry-of-interaction-for-polarized-linear-logic-1503.00886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-geometry-of-interaction-for-polarized-linear-logic-1503.00886"/></url>
<url><loc>https://scifaro.com/en/abs/hilbert-post-completeness-for-the-state-and-the-exception-effects-1503.00948</loc><lastmod>2015-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hilbert-post-completeness-for-the-state-and-the-exception-effects-1503.00948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hilbert-post-completeness-for-the-state-and-the-exception-effects-1503.00948"/></url>
<url><loc>https://scifaro.com/en/abs/quantomatic-a-proof-assistant-for-diagrammatic-reasoning-1503.01034</loc><lastmod>2015-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantomatic-a-proof-assistant-for-diagrammatic-reasoning-1503.01034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantomatic-a-proof-assistant-for-diagrammatic-reasoning-1503.01034"/></url>
<url><loc>https://scifaro.com/en/abs/tractability-frontier-of-data-complexity-in-team-semantics-1503.01144</loc><lastmod>2021-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractability-frontier-of-data-complexity-in-team-semantics-1503.01144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractability-frontier-of-data-complexity-in-team-semantics-1503.01144"/></url>
<url><loc>https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-extended-version-1503.01348</loc><lastmod>2015-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-extended-version-1503.01348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tensors-graphs-and-non-commutative-quantum-structures-extended-version-1503.01348"/></url>
<url><loc>https://scifaro.com/en/abs/binary-decision-diagrams-for-set-abstraction-1503.01547</loc><lastmod>2015-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-decision-diagrams-for-set-abstraction-1503.01547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-decision-diagrams-for-set-abstraction-1503.01547"/></url>
<url><loc>https://scifaro.com/en/abs/msol-definability-equals-recognizability-for-halin-graphs-and-bounded-degree-k-outerplanar-graphs-1503.01604</loc><lastmod>2015-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/msol-definability-equals-recognizability-for-halin-graphs-and-bounded-degree-k-outerplanar-graphs-1503.01604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/msol-definability-equals-recognizability-for-halin-graphs-and-bounded-degree-k-outerplanar-graphs-1503.01604"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-the-semantic-web-using-a-type-system-1503.01723</loc><lastmod>2015-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-the-semantic-web-using-a-type-system-1503.01723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-the-semantic-web-using-a-type-system-1503.01723"/></url>
<url><loc>https://scifaro.com/en/abs/correct-by-synthesis-reinforcement-learning-with-temporal-logic-constraints-1503.01793</loc><lastmod>2015-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-by-synthesis-reinforcement-learning-with-temporal-logic-constraints-1503.01793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-by-synthesis-reinforcement-learning-with-temporal-logic-constraints-1503.01793"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-substitution-calculus-for-differential-dynamic-logic-1503.01981</loc><lastmod>2015-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-substitution-calculus-for-differential-dynamic-logic-1503.01981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-substitution-calculus-for-differential-dynamic-logic-1503.01981"/></url>
<url><loc>https://scifaro.com/en/abs/containment-for-conditional-tree-patterns-1503.02210</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/containment-for-conditional-tree-patterns-1503.02210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/containment-for-conditional-tree-patterns-1503.02210"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-interpolation-for-coalgebraic-fixpoint-logic-1503.02319</loc><lastmod>2015-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-interpolation-for-coalgebraic-fixpoint-logic-1503.02319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-interpolation-for-coalgebraic-fixpoint-logic-1503.02319"/></url>
<url><loc>https://scifaro.com/en/abs/presenting-distributive-laws-1503.02447</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presenting-distributive-laws-1503.02447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presenting-distributive-laws-1503.02447"/></url>
<url><loc>https://scifaro.com/en/abs/linear-integer-arithmetic-revisited-1503.02948</loc><lastmod>2020-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-integer-arithmetic-revisited-1503.02948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-integer-arithmetic-revisited-1503.02948"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-theorem-proving-and-model-building-via-approximation-and-instantiation-1503.02971</loc><lastmod>2015-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-theorem-proving-and-model-building-via-approximation-and-instantiation-1503.02971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-theorem-proving-and-model-building-via-approximation-and-instantiation-1503.02971"/></url>
<url><loc>https://scifaro.com/en/abs/on-definite-program-answers-and-least-herbrand-models-1503.03324</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-definite-program-answers-and-least-herbrand-models-1503.03324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-definite-program-answers-and-least-herbrand-models-1503.03324"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-linear-head-reduction-and-visible-interaction-through-skeletons-1503.04034</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-linear-head-reduction-and-visible-interaction-through-skeletons-1503.04034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-linear-head-reduction-and-visible-interaction-through-skeletons-1503.04034"/></url>
<url><loc>https://scifaro.com/en/abs/non-normal-modalities-in-variants-of-linear-logic-1503.04193</loc><lastmod>2015-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-normal-modalities-in-variants-of-linear-logic-1503.04193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-normal-modalities-in-variants-of-linear-logic-1503.04193"/></url>
<url><loc>https://scifaro.com/en/abs/using-models-to-model-check-recursive-schemes-1503.04320</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-models-to-model-check-recursive-schemes-1503.04320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-models-to-model-check-recursive-schemes-1503.04320"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-workshop-on-intersection-types-and-related-systems-1503.04377</loc><lastmod>2015-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-intersection-types-and-related-systems-1503.04377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-intersection-types-and-related-systems-1503.04377"/></url>
<url><loc>https://scifaro.com/en/abs/really-natural-linear-indexed-type-checking-1503.04522</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/really-natural-linear-indexed-type-checking-1503.04522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/really-natural-linear-indexed-type-checking-1503.04522"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-proofs-of-normalisation-and-approximation-for-intersection-types-1503.04907</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-proofs-of-normalisation-and-approximation-for-intersection-types-1503.04907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-proofs-of-normalisation-and-approximation-for-intersection-types-1503.04907"/></url>
<url><loc>https://scifaro.com/en/abs/indexed-linear-logic-and-higher-order-model-checking-1503.04909</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indexed-linear-logic-and-higher-order-model-checking-1503.04909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indexed-linear-logic-and-higher-order-model-checking-1503.04909"/></url>
<url><loc>https://scifaro.com/en/abs/on-isomorphism-of-functional-intersection-and-union-types-1503.04910</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-isomorphism-of-functional-intersection-and-union-types-1503.04910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-isomorphism-of-functional-intersection-and-union-types-1503.04910"/></url>
<url><loc>https://scifaro.com/en/abs/lucretia-intersection-type-polymorphism-for-scripting-languages-1503.04918</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lucretia-intersection-type-polymorphism-for-scripting-languages-1503.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lucretia-intersection-type-polymorphism-for-scripting-languages-1503.04918"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-automata-for-formal-modeling-and-verification-of-cyber-physical-systems-1503.04928</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-automata-for-formal-modeling-and-verification-of-cyber-physical-systems-1503.04928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-automata-for-formal-modeling-and-verification-of-cyber-physical-systems-1503.04928"/></url>
<url><loc>https://scifaro.com/en/abs/a-rice-like-theorem-for-primitive-recursive-functions-1503.05025</loc><lastmod>2015-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rice-like-theorem-for-primitive-recursive-functions-1503.05025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rice-like-theorem-for-primitive-recursive-functions-1503.05025"/></url>
<url><loc>https://scifaro.com/en/abs/a-representation-theorem-for-stratified-complete-lattices-1503.05124</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-representation-theorem-for-stratified-complete-lattices-1503.05124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-representation-theorem-for-stratified-complete-lattices-1503.05124"/></url>
<url><loc>https://scifaro.com/en/abs/rank-logic-is-dead-long-live-rank-logic-1503.05423</loc><lastmod>2015-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rank-logic-is-dead-long-live-rank-logic-1503.05423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rank-logic-is-dead-long-live-rank-logic-1503.05423"/></url>
<url><loc>https://scifaro.com/en/abs/imp-with-exceptions-over-decorated-logic-1503.05496</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imp-with-exceptions-over-decorated-logic-1503.05496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imp-with-exceptions-over-decorated-logic-1503.05496"/></url>
<url><loc>https://scifaro.com/en/abs/hypercomputation-frege-deleuze-solving-thomson-s-lamp-1503.05847</loc><lastmod>2015-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercomputation-frege-deleuze-solving-thomson-s-lamp-1503.05847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercomputation-frege-deleuze-solving-thomson-s-lamp-1503.05847"/></url>
<url><loc>https://scifaro.com/en/abs/thermodynamic-graph-rewriting-1503.06022</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thermodynamic-graph-rewriting-1503.06022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thermodynamic-graph-rewriting-1503.06022"/></url>
<url><loc>https://scifaro.com/en/abs/the-next-700-challenge-problems-for-reasoning-with-higher-order-abstract-syntax-representations-part-1-a-common-infrastructure-for-benchmarks-1503.06095</loc><lastmod>2015-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-next-700-challenge-problems-for-reasoning-with-higher-order-abstract-syntax-representations-part-1-a-common-infrastructure-for-benchmarks-1503.06095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-next-700-challenge-problems-for-reasoning-with-higher-order-abstract-syntax-representations-part-1-a-common-infrastructure-for-benchmarks-1503.06095"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-tap-withdrawal-in-c-elegans-1503.06480</loc><lastmod>2015-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-tap-withdrawal-in-c-elegans-1503.06480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-tap-withdrawal-in-c-elegans-1503.06480"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-well-extension-of-partial-well-orderings-1503.06514</loc><lastmod>2015-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-well-extension-of-partial-well-orderings-1503.06514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-well-extension-of-partial-well-orderings-1503.06514"/></url>
<url><loc>https://scifaro.com/en/abs/on-unification-modulo-one-sided-distributivity-algorithms-variants-and-asymmetry-1503.06687</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-unification-modulo-one-sided-distributivity-algorithms-variants-and-asymmetry-1503.06687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-unification-modulo-one-sided-distributivity-algorithms-variants-and-asymmetry-1503.06687"/></url>
<url><loc>https://scifaro.com/en/abs/pure-nash-equilibria-in-concurrent-deterministic-games-1503.06826</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pure-nash-equilibria-in-concurrent-deterministic-games-1503.06826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pure-nash-equilibria-in-concurrent-deterministic-games-1503.06826"/></url>
<url><loc>https://scifaro.com/en/abs/property-based-polynomial-invariant-generation-using-sums-of-squares-optimization-1503.07025</loc><lastmod>2015-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-based-polynomial-invariant-generation-using-sums-of-squares-optimization-1503.07025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-based-polynomial-invariant-generation-using-sums-of-squares-optimization-1503.07025"/></url>
<url><loc>https://scifaro.com/en/abs/asperix-a-first-order-forward-chaining-approach-for-answer-set-computing-1503.07717</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asperix-a-first-order-forward-chaining-approach-for-answer-set-computing-1503.07717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asperix-a-first-order-forward-chaining-approach-for-answer-set-computing-1503.07717"/></url>
<url><loc>https://scifaro.com/en/abs/a-sums-of-squares-extension-of-policy-iterations-1503.08090</loc><lastmod>2016-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sums-of-squares-extension-of-policy-iterations-1503.08090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sums-of-squares-extension-of-policy-iterations-1503.08090"/></url>
<url><loc>https://scifaro.com/en/abs/revisable-justified-belief-preliminary-report-1503.08141</loc><lastmod>2015-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisable-justified-belief-preliminary-report-1503.08141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisable-justified-belief-preliminary-report-1503.08141"/></url>
<url><loc>https://scifaro.com/en/abs/towards-efficient-axiom-pinpointing-of-el-ontologies-1503.08454</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-efficient-axiom-pinpointing-of-el-ontologies-1503.08454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-efficient-axiom-pinpointing-of-el-ontologies-1503.08454"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-clause-set-schema-aided-by-automated-theorem-proving-a-case-study-extended-paper-1503.08551</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-clause-set-schema-aided-by-automated-theorem-proving-a-case-study-extended-paper-1503.08551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-clause-set-schema-aided-by-automated-theorem-proving-a-case-study-extended-paper-1503.08551"/></url>
<url><loc>https://scifaro.com/en/abs/intransitive-linear-temporal-logic-knowledge-from-past-decidability-admissible-rules-1503.08761</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intransitive-linear-temporal-logic-knowledge-from-past-decidability-admissible-rules-1503.08761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intransitive-linear-temporal-logic-knowledge-from-past-decidability-admissible-rules-1503.08761"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-identified-by-logics-with-counting-1503.08792</loc><lastmod>2015-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-identified-by-logics-with-counting-1503.08792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-identified-by-logics-with-counting-1503.08792"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-of-interaction-for-mall-via-hughes-vanglabbeek-proof-nets-1503.08925</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-of-interaction-for-mall-via-hughes-vanglabbeek-proof-nets-1503.08925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-of-interaction-for-mall-via-hughes-vanglabbeek-proof-nets-1503.08925"/></url>
<url><loc>https://scifaro.com/en/abs/a-tutorial-introduction-to-the-lambda-calculus-1503.09060</loc><lastmod>2015-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tutorial-introduction-to-the-lambda-calculus-1503.09060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tutorial-introduction-to-the-lambda-calculus-1503.09060"/></url>
<url><loc>https://scifaro.com/en/abs/on-partial-order-semantics-for-sat-smt-based-symbolic-encodings-of-weak-memory-concurrency-1504.00037</loc><lastmod>2015-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-partial-order-semantics-for-sat-smt-based-symbolic-encodings-of-weak-memory-concurrency-1504.00037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-partial-order-semantics-for-sat-smt-based-symbolic-encodings-of-weak-memory-concurrency-1504.00037"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-approximation-of-the-probability-distribution-of-a-markov-process-by-formal-abstractions-1504.00039</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-approximation-of-the-probability-distribution-of-a-markov-process-by-formal-abstractions-1504.00039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-approximation-of-the-probability-distribution-of-a-markov-process-by-formal-abstractions-1504.00039"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-causality-in-event-structures-technical-report-1504.00512</loc><lastmod>2015-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-causality-in-event-structures-technical-report-1504.00512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-causality-in-event-structures-technical-report-1504.00512"/></url>
<url><loc>https://scifaro.com/en/abs/dualization-in-lattices-given-by-ordered-sets-of-irreducibles-1504.01145</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dualization-in-lattices-given-by-ordered-sets-of-irreducibles-1504.01145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dualization-in-lattices-given-by-ordered-sets-of-irreducibles-1504.01145"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-developments-in-computational-models-1504.01927</loc><lastmod>2015-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-developments-in-computational-models-1504.01927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-developments-in-computational-models-1504.01927"/></url>
<url><loc>https://scifaro.com/en/abs/ioco-theory-for-probabilistic-automata-1504.02441</loc><lastmod>2015-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ioco-theory-for-probabilistic-automata-1504.02441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ioco-theory-for-probabilistic-automata-1504.02441"/></url>
<url><loc>https://scifaro.com/en/abs/stop-it-and-be-stubborn-1504.02587</loc><lastmod>2016-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stop-it-and-be-stubborn-1504.02587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stop-it-and-be-stubborn-1504.02587"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-detection-for-transformations-of-labelled-transition-systems-1504.02610</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-detection-for-transformations-of-labelled-transition-systems-1504.02610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-detection-for-transformations-of-labelled-transition-systems-1504.02610"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-programming-on-nominal-graphs-1504.02613</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-programming-on-nominal-graphs-1504.02613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-programming-on-nominal-graphs-1504.02613"/></url>
<url><loc>https://scifaro.com/en/abs/what-are-strategies-in-delay-games-borel-determinacy-for-games-with-lookahead-1504.02627</loc><lastmod>2015-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-are-strategies-in-delay-games-borel-determinacy-for-games-with-lookahead-1504.02627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-are-strategies-in-delay-games-borel-determinacy-for-games-with-lookahead-1504.02627"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-monoids-in-a-category-1504.02694</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-monoids-in-a-category-1504.02694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-monoids-in-a-category-1504.02694"/></url>
<url><loc>https://scifaro.com/en/abs/equational-reasoning-with-context-free-families-of-string-diagrams-1504.02716</loc><lastmod>2015-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-reasoning-with-context-free-families-of-string-diagrams-1504.02716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-reasoning-with-context-free-families-of-string-diagrams-1504.02716"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-theory-of-quantum-computability-1504.02817</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-theory-of-quantum-computability-1504.02817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-theory-of-quantum-computability-1504.02817"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-model-checking-of-very-large-mdp-using-partitioning-and-secondary-storage-1504.02861</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-model-checking-of-very-large-mdp-using-partitioning-and-secondary-storage-1504.02861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-model-checking-of-very-large-mdp-using-partitioning-and-secondary-storage-1504.02861"/></url>
<url><loc>https://scifaro.com/en/abs/on-absorption-in-semigroups-and-n-ary-semigroups-1504.02899</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-absorption-in-semigroups-and-n-ary-semigroups-1504.02899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-absorption-in-semigroups-and-n-ary-semigroups-1504.02899"/></url>
<url><loc>https://scifaro.com/en/abs/looking-at-mean-payoff-through-foggy-windows-1504.02947</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/looking-at-mean-payoff-through-foggy-windows-1504.02947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/looking-at-mean-payoff-through-foggy-windows-1504.02947"/></url>
<url><loc>https://scifaro.com/en/abs/non-wellfounded-trees-in-homotopy-type-theory-1504.02949</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-wellfounded-trees-in-homotopy-type-theory-1504.02949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-wellfounded-trees-in-homotopy-type-theory-1504.02949"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-automata-are-generic-1504.03013</loc><lastmod>2015-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-automata-are-generic-1504.03013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-automata-are-generic-1504.03013"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-branching-feature-bisimulation-1504.03474</loc><lastmod>2015-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-branching-feature-bisimulation-1504.03474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-branching-feature-bisimulation-1504.03474"/></url>
<url><loc>https://scifaro.com/en/abs/a-definability-dichotomy-for-finite-valued-csps-1504.03543</loc><lastmod>2015-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-definability-dichotomy-for-finite-valued-csps-1504.03543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-definability-dichotomy-for-finite-valued-csps-1504.03543"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-redundancy-in-partial-implications-1504.03620</loc><lastmod>2015-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-redundancy-in-partial-implications-1504.03620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-redundancy-in-partial-implications-1504.03620"/></url>
<url><loc>https://scifaro.com/en/abs/some-new-directions-for-acp-research-1504.03719</loc><lastmod>2015-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-new-directions-for-acp-research-1504.03719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-new-directions-for-acp-research-1504.03719"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-linear-dynamic-logic-full-version-1504.03880</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-linear-dynamic-logic-full-version-1504.03880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-linear-dynamic-logic-full-version-1504.03880"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-characterization-of-complete-heyting-and-co-heyting-algebras-1504.03919</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-characterization-of-complete-heyting-and-co-heyting-algebras-1504.03919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-characterization-of-complete-heyting-and-co-heyting-algebras-1504.03919"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-equality-in-the-free-locally-cartesian-closed-category-extended-version-1504.03995</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-equality-in-the-free-locally-cartesian-closed-category-extended-version-1504.03995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-equality-in-the-free-locally-cartesian-closed-category-extended-version-1504.03995"/></url>
<url><loc>https://scifaro.com/en/abs/fo-model-checking-on-posets-of-bounded-width-1504.04115</loc><lastmod>2015-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-model-checking-on-posets-of-bounded-width-1504.04115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-model-checking-on-posets-of-bounded-width-1504.04115"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-full-linear-logic-1504.04152</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-full-linear-logic-1504.04152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-full-linear-logic-1504.04152"/></url>
<url><loc>https://scifaro.com/en/abs/higher-category-models-of-the-pi-calculus-1504.04311</loc><lastmod>2015-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-category-models-of-the-pi-calculus-1504.04311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-category-models-of-the-pi-calculus-1504.04311"/></url>
<url><loc>https://scifaro.com/en/abs/permissive-controller-synthesis-for-probabilistic-systems-1504.04662</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissive-controller-synthesis-for-probabilistic-systems-1504.04662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissive-controller-synthesis-for-probabilistic-systems-1504.04662"/></url>
<url><loc>https://scifaro.com/en/abs/the-model-checking-fingerprints-of-ctl-operators-1504.04708</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-model-checking-fingerprints-of-ctl-operators-1504.04708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-model-checking-fingerprints-of-ctl-operators-1504.04708"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-identity-type-as-the-type-of-computational-paths-1504.04759</loc><lastmod>2015-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-identity-type-as-the-type-of-computational-paths-1504.04759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-identity-type-as-the-type-of-computational-paths-1504.04759"/></url>
<url><loc>https://scifaro.com/en/abs/conservativity-of-embeddings-in-the-lambda-pi-calculus-modulo-rewriting-long-version-1504.05038</loc><lastmod>2015-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conservativity-of-embeddings-in-the-lambda-pi-calculus-modulo-rewriting-long-version-1504.05038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conservativity-of-embeddings-in-the-lambda-pi-calculus-modulo-rewriting-long-version-1504.05038"/></url>
<url><loc>https://scifaro.com/en/abs/faster-statistical-model-checking-for-unbounded-temporal-properties-1504.05739</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-statistical-model-checking-for-unbounded-temporal-properties-1504.05739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-statistical-model-checking-for-unbounded-temporal-properties-1504.05739"/></url>
<url><loc>https://scifaro.com/en/abs/service-oriented-logic-programming-1504.05797</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/service-oriented-logic-programming-1504.05797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/service-oriented-logic-programming-1504.05797"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-constraint-ltl-over-trees-1504.06105</loc><lastmod>2015-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-constraint-ltl-over-trees-1504.06105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-constraint-ltl-over-trees-1504.06105"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-propositional-logics-in-team-semantics-1504.06135</loc><lastmod>2017-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-propositional-logics-in-team-semantics-1504.06135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-propositional-logics-in-team-semantics-1504.06135"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-fragments-are-hard-for-standard-parameterisations-1504.06187</loc><lastmod>2015-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-fragments-are-hard-for-standard-parameterisations-1504.06187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-fragments-are-hard-for-standard-parameterisations-1504.06187"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-thesis-concerning-synchronised-parallel-computing-simplified-parallel-asm-thesis-1504.06203</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-thesis-concerning-synchronised-parallel-computing-simplified-parallel-asm-thesis-1504.06203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-thesis-concerning-synchronised-parallel-computing-simplified-parallel-asm-thesis-1504.06203"/></url>
<url><loc>https://scifaro.com/en/abs/on-freeze-ltl-with-ordered-attributes-1504.06355</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-freeze-ltl-with-ordered-attributes-1504.06355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-freeze-ltl-with-ordered-attributes-1504.06355"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-modal-inclusion-logic-lax-and-strict-semantics-1504.06409</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-modal-inclusion-logic-lax-and-strict-semantics-1504.06409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-modal-inclusion-logic-lax-and-strict-semantics-1504.06409"/></url>
<url><loc>https://scifaro.com/en/abs/an-automata-theoretic-approach-to-the-verification-of-distributed-algorithms-1504.06534</loc><lastmod>2015-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automata-theoretic-approach-to-the-verification-of-distributed-algorithms-1504.06534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automata-theoretic-approach-to-the-verification-of-distributed-algorithms-1504.06534"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-of-a-multi-lane-spatial-logic-1504.06986</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-of-a-multi-lane-spatial-logic-1504.06986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-of-a-multi-lane-spatial-logic-1504.06986"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-theoretic-perspective-on-cpm-rel-1504.07003</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-theoretic-perspective-on-cpm-rel-1504.07003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-theoretic-perspective-on-cpm-rel-1504.07003"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-probabilistic-extension-of-modal-mu-calculus-1504.07737</loc><lastmod>2015-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-probabilistic-extension-of-modal-mu-calculus-1504.07737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-probabilistic-extension-of-modal-mu-calculus-1504.07737"/></url>
<url><loc>https://scifaro.com/en/abs/refining-existential-properties-in-separation-logic-analyses-1504.08309</loc><lastmod>2015-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-existential-properties-in-separation-logic-analyses-1504.08309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-existential-properties-in-separation-logic-analyses-1504.08309"/></url>
<url><loc>https://scifaro.com/en/abs/evaluation-trees-for-proposition-algebra-1504.08321</loc><lastmod>2026-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluation-trees-for-proposition-algebra-1504.08321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluation-trees-for-proposition-algebra-1504.08321"/></url>
<url><loc>https://scifaro.com/en/abs/proving-looping-and-non-looping-non-termination-by-finite-automata-1505.00478</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-looping-and-non-looping-non-termination-by-finite-automata-1505.00478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-looping-and-non-looping-non-termination-by-finite-automata-1505.00478"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-alloy-formulas-using-an-smt-solver-a-case-study-1505.00672</loc><lastmod>2015-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-alloy-formulas-using-an-smt-solver-a-case-study-1505.00672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-alloy-formulas-using-an-smt-solver-a-case-study-1505.00672"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-framework-for-infinitary-rewriting-and-equational-reasoning-extended-version-1505.01128</loc><lastmod>2015-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-framework-for-infinitary-rewriting-and-equational-reasoning-extended-version-1505.01128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-framework-for-infinitary-rewriting-and-equational-reasoning-extended-version-1505.01128"/></url>
<url><loc>https://scifaro.com/en/abs/strong-typed-b-ohm-theorem-and-functional-completeness-on-the-linear-lambda-calculus-1505.01326</loc><lastmod>2016-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-typed-b-ohm-theorem-and-functional-completeness-on-the-linear-lambda-calculus-1505.01326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-typed-b-ohm-theorem-and-functional-completeness-on-the-linear-lambda-calculus-1505.01326"/></url>
<url><loc>https://scifaro.com/en/abs/certification-of-confluence-proofs-using-ceta-1505.01337</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certification-of-confluence-proofs-using-ceta-1505.01337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certification-of-confluence-proofs-using-ceta-1505.01337"/></url>
<url><loc>https://scifaro.com/en/abs/kbcv-2-0-automatic-completion-experiments-1505.01338</loc><lastmod>2015-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kbcv-2-0-automatic-completion-experiments-1505.01338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kbcv-2-0-automatic-completion-experiments-1505.01338"/></url>
<url><loc>https://scifaro.com/en/abs/structure-formation-in-large-theories-1505.01620</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-formation-in-large-theories-1505.01620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-formation-in-large-theories-1505.01620"/></url>
<url><loc>https://scifaro.com/en/abs/leopard-a-generic-platform-for-the-implementation-of-higher-order-reasoners-1505.01629</loc><lastmod>2015-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leopard-a-generic-platform-for-the-implementation-of-higher-order-reasoners-1505.01629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leopard-a-generic-platform-for-the-implementation-of-higher-order-reasoners-1505.01629"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-class-boolean-sort-in-first-order-theorem-proving-and-tptp-1505.01682</loc><lastmod>2015-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-class-boolean-sort-in-first-order-theorem-proving-and-tptp-1505.01682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-class-boolean-sort-in-first-order-theorem-proving-and-tptp-1505.01682"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-of-graph-transformation-systems-using-weighted-type-graphs-over-semirings-1505.01695</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-of-graph-transformation-systems-using-weighted-type-graphs-over-semirings-1505.01695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-of-graph-transformation-systems-using-weighted-type-graphs-over-semirings-1505.01695"/></url>
<url><loc>https://scifaro.com/en/abs/a-team-based-variant-of-ctl-1505.01964</loc><lastmod>2015-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-team-based-variant-of-ctl-1505.01964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-team-based-variant-of-ctl-1505.01964"/></url>
<url><loc>https://scifaro.com/en/abs/web-ontology-representation-and-reasoning-via-fragments-of-set-theory-1505.02075</loc><lastmod>2015-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/web-ontology-representation-and-reasoning-via-fragments-of-set-theory-1505.02075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/web-ontology-representation-and-reasoning-via-fragments-of-set-theory-1505.02075"/></url>
<url><loc>https://scifaro.com/en/abs/weihrauch-completeness-for-layerwise-computability-1505.02091</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weihrauch-completeness-for-layerwise-computability-1505.02091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weihrauch-completeness-for-layerwise-computability-1505.02091"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-formalization-of-fractional-calculus-in-higher-order-logic-1505.02140</loc><lastmod>2016-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-formalization-of-fractional-calculus-in-higher-order-logic-1505.02140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-formalization-of-fractional-calculus-in-higher-order-logic-1505.02140"/></url>
<url><loc>https://scifaro.com/en/abs/computing-maximal-autarkies-with-few-and-simple-oracle-queries-1505.02371</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-maximal-autarkies-with-few-and-simple-oracle-queries-1505.02371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-maximal-autarkies-with-few-and-simple-oracle-queries-1505.02371"/></url>
<url><loc>https://scifaro.com/en/abs/distms-a-non-portfolio-distributed-solver-for-maximum-satisfiability-1505.02408</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distms-a-non-portfolio-distributed-solver-for-maximum-satisfiability-1505.02408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distms-a-non-portfolio-distributed-solver-for-maximum-satisfiability-1505.02408"/></url>
<url><loc>https://scifaro.com/en/abs/eliminating-recursion-from-monadic-datalog-programs-on-trees-1505.02444</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliminating-recursion-from-monadic-datalog-programs-on-trees-1505.02444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliminating-recursion-from-monadic-datalog-programs-on-trees-1505.02444"/></url>
<url><loc>https://scifaro.com/en/abs/unbounded-thread-reachability-via-symbolic-execution-and-loop-acceleration-technical-report-1505.02637</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unbounded-thread-reachability-via-symbolic-execution-and-loop-acceleration-technical-report-1505.02637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unbounded-thread-reachability-via-symbolic-execution-and-loop-acceleration-technical-report-1505.02637"/></url>
<url><loc>https://scifaro.com/en/abs/towards-formal-fault-tree-analysis-using-theorem-proving-1505.02648</loc><lastmod>2015-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-formal-fault-tree-analysis-using-theorem-proving-1505.02648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-formal-fault-tree-analysis-using-theorem-proving-1505.02648"/></url>
<url><loc>https://scifaro.com/en/abs/additive-monotones-for-resource-theories-of-parallel-combinable-processes-with-discarding-1505.02651</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/additive-monotones-for-resource-theories-of-parallel-combinable-processes-with-discarding-1505.02651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/additive-monotones-for-resource-theories-of-parallel-combinable-processes-with-discarding-1505.02651"/></url>
<url><loc>https://scifaro.com/en/abs/long-run-average-behaviour-of-probabilistic-vector-addition-systems-1505.02655</loc><lastmod>2015-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/long-run-average-behaviour-of-probabilistic-vector-addition-systems-1505.02655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/long-run-average-behaviour-of-probabilistic-vector-addition-systems-1505.02655"/></url>
<url><loc>https://scifaro.com/en/abs/tight-cutoffs-for-guarded-protocols-with-fairness-1505.03273</loc><lastmod>2016-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-cutoffs-for-guarded-protocols-with-fairness-1505.03273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-cutoffs-for-guarded-protocols-with-fairness-1505.03273"/></url>
<url><loc>https://scifaro.com/en/abs/hordesat-a-massively-parallel-portfolio-sat-solver-1505.03340</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hordesat-a-massively-parallel-portfolio-sat-solver-1505.03340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hordesat-a-massively-parallel-portfolio-sat-solver-1505.03340"/></url>
<url><loc>https://scifaro.com/en/abs/parallelism-and-synchronization-in-an-infinitary-context-long-version-1505.03635</loc><lastmod>2015-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallelism-and-synchronization-in-an-infinitary-context-long-version-1505.03635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallelism-and-synchronization-in-an-infinitary-context-long-version-1505.03635"/></url>
<url><loc>https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-affine-case-long-version-1505.03638</loc><lastmod>2015-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-affine-case-long-version-1505.03638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-affine-case-long-version-1505.03638"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-usefulness-of-fireballs-1505.03791</loc><lastmod>2015-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-usefulness-of-fireballs-1505.03791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-usefulness-of-fireballs-1505.03791"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-strong-noncontingency-1505.03950</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-strong-noncontingency-1505.03950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-strong-noncontingency-1505.03950"/></url>
<url><loc>https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-extended-version-1505.04216</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-extended-version-1505.04216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-extended-version-1505.04216"/></url>
<url><loc>https://scifaro.com/en/abs/elaboration-in-dependent-type-theory-1505.04324</loc><lastmod>2015-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elaboration-in-dependent-type-theory-1505.04324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elaboration-in-dependent-type-theory-1505.04324"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-monadic-computing-1505.04330</loc><lastmod>2016-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-monadic-computing-1505.04330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-monadic-computing-1505.04330"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-mus-enumeration-of-horn-formulae-with-applications-to-axiom-pinpointing-1505.04365</loc><lastmod>2015-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-mus-enumeration-of-horn-formulae-with-applications-to-axiom-pinpointing-1505.04365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-mus-enumeration-of-horn-formulae-with-applications-to-axiom-pinpointing-1505.04365"/></url>
<url><loc>https://scifaro.com/en/abs/angelic-processes-1505.04726</loc><lastmod>2015-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/angelic-processes-1505.04726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/angelic-processes-1505.04726"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-definability-in-fo2-h-v-on-trees-1505.04934</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-definability-in-fo2-h-v-on-trees-1505.04934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-definability-in-fo2-h-v-on-trees-1505.04934"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-axiomatizability-of-impossible-futures-1505.04985</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-axiomatizability-of-impossible-futures-1505.04985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-axiomatizability-of-impossible-futures-1505.04985"/></url>
<url><loc>https://scifaro.com/en/abs/modular-action-language-alm-1505.05022</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-action-language-alm-1505.05022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-action-language-alm-1505.05022"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-and-transparent-transfer-of-theorems-along-isomorphisms-in-the-coq-proof-assistant-1505.05028</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-and-transparent-transfer-of-theorems-along-isomorphisms-in-the-coq-proof-assistant-1505.05028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-and-transparent-transfer-of-theorems-along-isomorphisms-in-the-coq-proof-assistant-1505.05028"/></url>
<url><loc>https://scifaro.com/en/abs/ccs-it-s-not-fair-fair-schedulers-cannot-be-implemented-in-ccs-like-languages-even-under-progress-and-certain-fairness-assumptions-1505.05964</loc><lastmod>2015-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ccs-it-s-not-fair-fair-schedulers-cannot-be-implemented-in-ccs-like-languages-even-under-progress-and-certain-fairness-assumptions-1505.05964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ccs-it-s-not-fair-fair-schedulers-cannot-be-implemented-in-ccs-like-languages-even-under-progress-and-certain-fairness-assumptions-1505.05964"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-fully-complete-models-of-multiplicative-linear-logic-1505.06056</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-fully-complete-models-of-multiplicative-linear-logic-1505.06056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-fully-complete-models-of-multiplicative-linear-logic-1505.06056"/></url>
<url><loc>https://scifaro.com/en/abs/a-syntactic-soundness-proof-for-free-variable-tableaux-with-on-the-fly-skolemization-1505.06376</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syntactic-soundness-proof-for-free-variable-tableaux-with-on-the-fly-skolemization-1505.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syntactic-soundness-proof-for-free-variable-tableaux-with-on-the-fly-skolemization-1505.06376"/></url>
<url><loc>https://scifaro.com/en/abs/category-theory-in-coq-8-5-1505.06430</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/category-theory-in-coq-8-5-1505.06430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/category-theory-in-coq-8-5-1505.06430"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-generalized-ising-polynomials-on-graphs-with-fixed-clique-width-1505.06617</loc><lastmod>2015-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-generalized-ising-polynomials-on-graphs-with-fixed-clique-width-1505.06617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-generalized-ising-polynomials-on-graphs-with-fixed-clique-width-1505.06617"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-finite-satisfiability-and-unbounded-tree-width-1505.06622</loc><lastmod>2016-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-finite-satisfiability-and-unbounded-tree-width-1505.06622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-finite-satisfiability-and-unbounded-tree-width-1505.06622"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-computing-with-terms-and-graphs-1505.06818</loc><lastmod>2015-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-computing-with-terms-and-graphs-1505.06818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-computing-with-terms-and-graphs-1505.06818"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-infinite-traces-and-kleisli-simulations-1505.06819</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-infinite-traces-and-kleisli-simulations-1505.06819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-infinite-traces-and-kleisli-simulations-1505.06819"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-unrealizability-of-distributed-fault-tolerant-systems-1505.06862</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-unrealizability-of-distributed-fault-tolerant-systems-1505.06862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-unrealizability-of-distributed-fault-tolerant-systems-1505.06862"/></url>
<url><loc>https://scifaro.com/en/abs/on-nested-sequents-for-constructive-modal-logics-1505.06896</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-nested-sequents-for-constructive-modal-logics-1505.06896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-nested-sequents-for-constructive-modal-logics-1505.06896"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-full-version-1505.06953</loc><lastmod>2016-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-full-version-1505.06953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-full-version-1505.06953"/></url>
<url><loc>https://scifaro.com/en/abs/presenting-finite-posets-1505.07161</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presenting-finite-posets-1505.07161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presenting-finite-posets-1505.07161"/></url>
<url><loc>https://scifaro.com/en/abs/an-implementation-model-for-interaction-nets-1505.07164</loc><lastmod>2015-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implementation-model-for-interaction-nets-1505.07164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implementation-model-for-interaction-nets-1505.07164"/></url>
<url><loc>https://scifaro.com/en/abs/valuations-in-nilpotent-minimum-logic-1505.07508</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valuations-in-nilpotent-minimum-logic-1505.07508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valuations-in-nilpotent-minimum-logic-1505.07508"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-type-systems-for-mobile-processes-1505.07794</loc><lastmod>2015-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-type-systems-for-mobile-processes-1505.07794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-type-systems-for-mobile-processes-1505.07794"/></url>
<url><loc>https://scifaro.com/en/abs/word-level-symbolic-trajectory-evaluation-1505.07916</loc><lastmod>2015-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-level-symbolic-trajectory-evaluation-1505.07916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-level-symbolic-trajectory-evaluation-1505.07916"/></url>
<url><loc>https://scifaro.com/en/abs/sepia-search-for-proofs-using-inferred-automata-1505.07987</loc><lastmod>2015-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sepia-search-for-proofs-using-inferred-automata-1505.07987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sepia-search-for-proofs-using-inferred-automata-1505.07987"/></url>
<url><loc>https://scifaro.com/en/abs/towards-trace-metrics-via-functor-lifting-1505.08105</loc><lastmod>2015-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-trace-metrics-via-functor-lifting-1505.08105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-trace-metrics-via-functor-lifting-1505.08105"/></url>
<url><loc>https://scifaro.com/en/abs/learning-regular-languages-over-large-ordered-alphabets-1506.00482</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-regular-languages-over-large-ordered-alphabets-1506.00482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-regular-languages-over-large-ordered-alphabets-1506.00482"/></url>
<url><loc>https://scifaro.com/en/abs/linear-types-can-change-the-blockchain-1506.01001</loc><lastmod>2015-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-types-can-change-the-blockchain-1506.01001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-types-can-change-the-blockchain-1506.01001"/></url>
<url><loc>https://scifaro.com/en/abs/circuit-complexity-meets-ontology-based-data-access-1506.01296</loc><lastmod>2015-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circuit-complexity-meets-ontology-based-data-access-1506.01296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circuit-complexity-meets-ontology-based-data-access-1506.01296"/></url>
<url><loc>https://scifaro.com/en/abs/the-decision-problem-for-a-three-sorted-fragment-of-set-theory-with-restricted-quantification-and-finite-enumerations-1506.01476</loc><lastmod>2015-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-decision-problem-for-a-three-sorted-fragment-of-set-theory-with-restricted-quantification-and-finite-enumerations-1506.01476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-decision-problem-for-a-three-sorted-fragment-of-set-theory-with-restricted-quantification-and-finite-enumerations-1506.01476"/></url>
<url><loc>https://scifaro.com/en/abs/a-concurrency-problem-with-exponential-dpll-t-proofs-1506.01602</loc><lastmod>2015-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concurrency-problem-with-exponential-dpll-t-proofs-1506.01602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concurrency-problem-with-exponential-dpll-t-proofs-1506.01602"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-bounded-ltl-properties-using-interval-analysis-1506.01762</loc><lastmod>2015-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-bounded-ltl-properties-using-interval-analysis-1506.01762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-bounded-ltl-properties-using-interval-analysis-1506.01762"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-essence-and-accident-1506.01872</loc><lastmod>2015-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-essence-and-accident-1506.01872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-essence-and-accident-1506.01872"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-almost-sure-termination-1506.01930</loc><lastmod>2015-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-almost-sure-termination-1506.01930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-almost-sure-termination-1506.01930"/></url>
<url><loc>https://scifaro.com/en/abs/a-natural-counting-of-lambda-terms-1506.02367</loc><lastmod>2016-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-natural-counting-of-lambda-terms-1506.02367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-natural-counting-of-lambda-terms-1506.02367"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-pctl-satisfiability-1506.02483</loc><lastmod>2015-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-pctl-satisfiability-1506.02483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-pctl-satisfiability-1506.02483"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-groupoid-model-of-computational-paths-1506.02721</loc><lastmod>2016-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-groupoid-model-of-computational-paths-1506.02721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-groupoid-model-of-computational-paths-1506.02721"/></url>
<url><loc>https://scifaro.com/en/abs/a-study-on-central-soft-sets-definitions-and-basic-operations-1506.02812</loc><lastmod>2015-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-study-on-central-soft-sets-definitions-and-basic-operations-1506.02812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-study-on-central-soft-sets-definitions-and-basic-operations-1506.02812"/></url>
<url><loc>https://scifaro.com/en/abs/the-attack-as-strong-negation-part-i-1506.03266</loc><lastmod>2015-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-attack-as-strong-negation-part-i-1506.03266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-attack-as-strong-negation-part-i-1506.03266"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-generation-of-minimal-cut-sets-1506.03555</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-generation-of-minimal-cut-sets-1506.03555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-generation-of-minimal-cut-sets-1506.03555"/></url>
<url><loc>https://scifaro.com/en/abs/on-equivalences-metrics-and-polynomial-time-long-version-1506.03710</loc><lastmod>2015-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-equivalences-metrics-and-polynomial-time-long-version-1506.03710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-equivalences-metrics-and-polynomial-time-long-version-1506.03710"/></url>
<url><loc>https://scifaro.com/en/abs/complete-relations-on-fuzzy-complete-lattices-1506.03930</loc><lastmod>2015-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-relations-on-fuzzy-complete-lattices-1506.03930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-relations-on-fuzzy-complete-lattices-1506.03930"/></url>
<url><loc>https://scifaro.com/en/abs/the-computability-path-ordering-1506.03943</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computability-path-ordering-1506.03943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computability-path-ordering-1506.03943"/></url>
<url><loc>https://scifaro.com/en/abs/rare-speed-up-in-automatic-theorem-proving-reveals-tradeoff-between-computational-time-and-information-value-1506.04349</loc><lastmod>2015-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rare-speed-up-in-automatic-theorem-proving-reveals-tradeoff-between-computational-time-and-information-value-1506.04349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rare-speed-up-in-automatic-theorem-proving-reveals-tradeoff-between-computational-time-and-information-value-1506.04349"/></url>
<url><loc>https://scifaro.com/en/abs/formal-design-of-asynchronous-fault-detection-and-identification-components-using-temporal-epistemic-logic-1506.04871</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-design-of-asynchronous-fault-detection-and-identification-components-using-temporal-epistemic-logic-1506.04871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-design-of-asynchronous-fault-detection-and-identification-components-using-temporal-epistemic-logic-1506.04871"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-verification-for-timed-systems-based-on-automatic-invariant-generation-1506.04879</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-verification-for-timed-systems-based-on-automatic-invariant-generation-1506.04879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-verification-for-timed-systems-based-on-automatic-invariant-generation-1506.04879"/></url>
<url><loc>https://scifaro.com/en/abs/semi-simplicial-types-in-logic-enriched-homotopy-type-theory-1506.04998</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-simplicial-types-in-logic-enriched-homotopy-type-theory-1506.04998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-simplicial-types-in-logic-enriched-homotopy-type-theory-1506.04998"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-the-complexity-of-functional-programs-higher-order-meets-first-order-long-version-1506.05043</loc><lastmod>2015-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-the-complexity-of-functional-programs-higher-order-meets-first-order-long-version-1506.05043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-the-complexity-of-functional-programs-higher-order-meets-first-order-long-version-1506.05043"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-processing-of-coq-documents-from-the-kernel-up-to-the-user-interface-1506.05605</loc><lastmod>2015-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-processing-of-coq-documents-from-the-kernel-up-to-the-user-interface-1506.05605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-processing-of-coq-documents-from-the-kernel-up-to-the-user-interface-1506.05605"/></url>
<url><loc>https://scifaro.com/en/abs/safety-verification-and-refutation-by-k-invariants-and-k-induction-extended-version-1506.05671</loc><lastmod>2015-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-verification-and-refutation-by-k-invariants-and-k-induction-extended-version-1506.05671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-verification-and-refutation-by-k-invariants-and-k-induction-extended-version-1506.05671"/></url>
<url><loc>https://scifaro.com/en/abs/a-cegar-like-approach-for-cost-ltl-bounds-1506.05728</loc><lastmod>2015-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cegar-like-approach-for-cost-ltl-bounds-1506.05728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cegar-like-approach-for-cost-ltl-bounds-1506.05728"/></url>
<url><loc>https://scifaro.com/en/abs/multi-weighted-automata-and-mso-logic-1506.06024</loc><lastmod>2015-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-weighted-automata-and-mso-logic-1506.06024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-weighted-automata-and-mso-logic-1506.06024"/></url>
<url><loc>https://scifaro.com/en/abs/multi-sorted-logic-models-and-logical-geometry-1506.06057</loc><lastmod>2015-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-sorted-logic-models-and-logical-geometry-1506.06057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-sorted-logic-models-and-logical-geometry-1506.06057"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-model-repair-1506.06165</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-model-repair-1506.06165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-model-repair-1506.06165"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theoretic-approach-to-structural-resolution-1506.06166</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-structural-resolution-1506.06166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-structural-resolution-1506.06166"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-of-resilience-properties-in-oscillatory-biological-systems-using-parametric-time-petri-nets-supplementary-information-1506.06299</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-of-resilience-properties-in-oscillatory-biological-systems-using-parametric-time-petri-nets-supplementary-information-1506.06299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-of-resilience-properties-in-oscillatory-biological-systems-using-parametric-time-petri-nets-supplementary-information-1506.06299"/></url>
<url><loc>https://scifaro.com/en/abs/verification-and-control-of-partially-observable-probabilistic-real-time-systems-1506.06419</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-and-control-of-partially-observable-probabilistic-real-time-systems-1506.06419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-and-control-of-partially-observable-probabilistic-real-time-systems-1506.06419"/></url>
<url><loc>https://scifaro.com/en/abs/applicative-bisimulation-and-quantum-lambda-calculi-long-version-1506.06661</loc><lastmod>2015-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applicative-bisimulation-and-quantum-lambda-calculi-long-version-1506.06661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applicative-bisimulation-and-quantum-lambda-calculi-long-version-1506.06661"/></url>
<url><loc>https://scifaro.com/en/abs/partial-functions-and-domination-1506.06869</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-functions-and-domination-1506.06869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-functions-and-domination-1506.06869"/></url>
<url><loc>https://scifaro.com/en/abs/justification-logic-enjoys-the-strong-finite-model-property-1506.06933</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justification-logic-enjoys-the-strong-finite-model-property-1506.06933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justification-logic-enjoys-the-strong-finite-model-property-1506.06933"/></url>
<url><loc>https://scifaro.com/en/abs/improving-search-order-for-reachability-testing-in-timed-automata-1506.07000</loc><lastmod>2015-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-search-order-for-reachability-testing-in-timed-automata-1506.07000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-search-order-for-reachability-testing-in-timed-automata-1506.07000"/></url>
<url><loc>https://scifaro.com/en/abs/scientific-modelling-with-coalgebra-algebra-homomorphisms-1506.07290</loc><lastmod>2015-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scientific-modelling-with-coalgebra-algebra-homomorphisms-1506.07290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scientific-modelling-with-coalgebra-algebra-homomorphisms-1506.07290"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-analysis-of-chemical-reaction-networks-using-linear-noise-approximation-1506.07861</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-analysis-of-chemical-reaction-networks-using-linear-noise-approximation-1506.07861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-analysis-of-chemical-reaction-networks-using-linear-noise-approximation-1506.07861"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-univariate-polynomial-problems-using-untrusted-certificates-in-isabelle-hol-1506.08238</loc><lastmod>2018-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-univariate-polynomial-problems-using-untrusted-certificates-in-isabelle-hol-1506.08238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-univariate-polynomial-problems-using-untrusted-certificates-in-isabelle-hol-1506.08238"/></url>
<url><loc>https://scifaro.com/en/abs/automated-benchmarking-of-incremental-sat-and-qbf-solvers-1506.08563</loc><lastmod>2015-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-benchmarking-of-incremental-sat-and-qbf-solvers-1506.08563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-benchmarking-of-incremental-sat-and-qbf-solvers-1506.08563"/></url>
<url><loc>https://scifaro.com/en/abs/the-first-reactive-synthesis-competition-syntcomp-2014-1506.08726</loc><lastmod>2016-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-first-reactive-synthesis-competition-syntcomp-2014-1506.08726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-first-reactive-synthesis-competition-syntcomp-2014-1506.08726"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-vsids-branching-heuristics-in-conflict-driven-clause-learning-sat-solvers-1506.08905</loc><lastmod>2015-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-vsids-branching-heuristics-in-conflict-driven-clause-learning-sat-solvers-1506.08905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-vsids-branching-heuristics-in-conflict-driven-clause-learning-sat-solvers-1506.08905"/></url>
<url><loc>https://scifaro.com/en/abs/forward-and-backward-bisimulations-for-chemical-reaction-networks-1507.00163</loc><lastmod>2015-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-and-backward-bisimulations-for-chemical-reaction-networks-1507.00163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-and-backward-bisimulations-for-chemical-reaction-networks-1507.00163"/></url>
<url><loc>https://scifaro.com/en/abs/fast-blocked-clause-decomposition-with-high-quality-1507.00459</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-blocked-clause-decomposition-with-high-quality-1507.00459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-blocked-clause-decomposition-with-high-quality-1507.00459"/></url>
<url><loc>https://scifaro.com/en/abs/assume-admissible-synthesis-1507.00623</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assume-admissible-synthesis-1507.00623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assume-admissible-synthesis-1507.00623"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-embedded-dependencies-using-inclusion-dependencies-1507.00655</loc><lastmod>2015-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-embedded-dependencies-using-inclusion-dependencies-1507.00655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-embedded-dependencies-using-inclusion-dependencies-1507.00655"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-substructural-hierarchy-1507.00700</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-substructural-hierarchy-1507.00700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-substructural-hierarchy-1507.00700"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-based-partial-order-reduction-1507.00980</loc><lastmod>2015-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-based-partial-order-reduction-1507.00980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-based-partial-order-reduction-1507.00980"/></url>
<url><loc>https://scifaro.com/en/abs/forgetting-complex-propositions-1507.01111</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forgetting-complex-propositions-1507.01111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forgetting-complex-propositions-1507.01111"/></url>
<url><loc>https://scifaro.com/en/abs/functions-out-of-higher-truncations-1507.01150</loc><lastmod>2015-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functions-out-of-higher-truncations-1507.01150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functions-out-of-higher-truncations-1507.01150"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-execution-model-for-the-logic-of-hereditary-harrop-formulas-1507.01771</loc><lastmod>2015-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-execution-model-for-the-logic-of-hereditary-harrop-formulas-1507.01771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-execution-model-for-the-logic-of-hereditary-harrop-formulas-1507.01771"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-checking-and-simulation-by-computing-range-reduction-1507.02297</loc><lastmod>2015-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-checking-and-simulation-by-computing-range-reduction-1507.02297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-checking-and-simulation-by-computing-range-reduction-1507.02297"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-explicit-ltl-reasoning-1507.02519</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-explicit-ltl-reasoning-1507.02519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-explicit-ltl-reasoning-1507.02519"/></url>
<url><loc>https://scifaro.com/en/abs/cooperative-reactive-synthesis-1507.02531</loc><lastmod>2015-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cooperative-reactive-synthesis-1507.02531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cooperative-reactive-synthesis-1507.02531"/></url>
<url><loc>https://scifaro.com/en/abs/unfolding-based-process-discovery-1507.02744</loc><lastmod>2015-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfolding-based-process-discovery-1507.02744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfolding-based-process-discovery-1507.02744"/></url>
<url><loc>https://scifaro.com/en/abs/more-than-1700-years-of-word-equations-1507.03215</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-than-1700-years-of-word-equations-1507.03215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-than-1700-years-of-word-equations-1507.03215"/></url>
<url><loc>https://scifaro.com/en/abs/continuity-as-a-computational-effect-1507.03219</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuity-as-a-computational-effect-1507.03219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuity-as-a-computational-effect-1507.03219"/></url>
<url><loc>https://scifaro.com/en/abs/mackey-complete-spaces-and-power-series-a-topological-model-of-differential-linear-logic-1507.03262</loc><lastmod>2015-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mackey-complete-spaces-and-power-series-a-topological-model-of-differential-linear-logic-1507.03262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mackey-complete-spaces-and-power-series-a-topological-model-of-differential-linear-logic-1507.03262"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-quantum-process-algebra-with-guards-1507.03344</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-quantum-process-algebra-with-guards-1507.03344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-quantum-process-algebra-with-guards-1507.03344"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-safety-verification-with-max-smt-1507.03851</loc><lastmod>2015-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-safety-verification-with-max-smt-1507.03851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-safety-verification-with-max-smt-1507.03851"/></url>
<url><loc>https://scifaro.com/en/abs/static-analysis-for-logic-based-dynamic-programs-1507.04537</loc><lastmod>2015-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-analysis-for-logic-based-dynamic-programs-1507.04537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-analysis-for-logic-based-dynamic-programs-1507.04537"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-axiomatising-hurkens-s-paradox-1507.04577</loc><lastmod>2015-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-axiomatising-hurkens-s-paradox-1507.04577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-axiomatising-hurkens-s-paradox-1507.04577"/></url>
<url><loc>https://scifaro.com/en/abs/the-tree-machine-1507.04589</loc><lastmod>2015-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tree-machine-1507.04589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tree-machine-1507.04589"/></url>
<url><loc>https://scifaro.com/en/abs/differential-hybrid-games-1507.04943</loc><lastmod>2017-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-hybrid-games-1507.04943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-hybrid-games-1507.04943"/></url>
<url><loc>https://scifaro.com/en/abs/forward-invariant-cuts-to-simplify-proofs-of-safety-1507.05133</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-invariant-cuts-to-simplify-proofs-of-safety-1507.05133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-invariant-cuts-to-simplify-proofs-of-safety-1507.05133"/></url>
<url><loc>https://scifaro.com/en/abs/finite-degree-predicates-and-two-variable-first-order-logic-1507.05175</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-degree-predicates-and-two-variable-first-order-logic-1507.05175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-degree-predicates-and-two-variable-first-order-logic-1507.05175"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-non-iterated-probabilistic-justification-logic-1507.05500</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-non-iterated-probabilistic-justification-logic-1507.05500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-non-iterated-probabilistic-justification-logic-1507.05500"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-decision-procedure-for-linear-time-mu-calculus-1507.05513</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-decision-procedure-for-linear-time-mu-calculus-1507.05513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-decision-procedure-for-linear-time-mu-calculus-1507.05513"/></url>
<url><loc>https://scifaro.com/en/abs/putting-logic-based-distributed-systems-on-stable-grounds-1507.05539</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/putting-logic-based-distributed-systems-on-stable-grounds-1507.05539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/putting-logic-based-distributed-systems-on-stable-grounds-1507.05539"/></url>
<url><loc>https://scifaro.com/en/abs/on-automated-lemma-generation-for-separation-logic-with-inductive-definitions-1507.05581</loc><lastmod>2015-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-automated-lemma-generation-for-separation-logic-with-inductive-definitions-1507.05581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-automated-lemma-generation-for-separation-logic-with-inductive-definitions-1507.05581"/></url>
<url><loc>https://scifaro.com/en/abs/marimba-a-tool-for-verifying-properties-of-hidden-markov-models-1507.05597</loc><lastmod>2015-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/marimba-a-tool-for-verifying-properties-of-hidden-markov-models-1507.05597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/marimba-a-tool-for-verifying-properties-of-hidden-markov-models-1507.05597"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-learning-frameworks-for-synthesis-1507.05612</loc><lastmod>2016-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-learning-frameworks-for-synthesis-1507.05612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-learning-frameworks-for-synthesis-1507.05612"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-information-flow-under-generic-leakage-functions-and-adaptive-adversaries-1507.05766</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-information-flow-under-generic-leakage-functions-and-adaptive-adversaries-1507.05766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-information-flow-under-generic-leakage-functions-and-adaptive-adversaries-1507.05766"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-robustness-in-priced-timed-games-1507.05787</loc><lastmod>2015-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-robustness-in-priced-timed-games-1507.05787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-robustness-in-priced-timed-games-1507.05787"/></url>
<url><loc>https://scifaro.com/en/abs/proving-correctness-of-imperative-programs-by-linearizing-constrained-horn-clauses-1507.05877</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-correctness-of-imperative-programs-by-linearizing-constrained-horn-clauses-1507.05877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-correctness-of-imperative-programs-by-linearizing-constrained-horn-clauses-1507.05877"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-totalizer-encoding-for-pseudo-boolean-constraints-1507.05920</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-totalizer-encoding-for-pseudo-boolean-constraints-1507.05920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-totalizer-encoding-for-pseudo-boolean-constraints-1507.05920"/></url>
<url><loc>https://scifaro.com/en/abs/the-budget-constrained-functional-dependency-1507.05964</loc><lastmod>2015-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-budget-constrained-functional-dependency-1507.05964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-budget-constrained-functional-dependency-1507.05964"/></url>
<url><loc>https://scifaro.com/en/abs/structural-resolution-for-logic-programming-1507.06010</loc><lastmod>2015-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-resolution-for-logic-programming-1507.06010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-resolution-for-logic-programming-1507.06010"/></url>
<url><loc>https://scifaro.com/en/abs/a-coalgebraic-semantics-for-causality-in-petri-nets-1507.06462</loc><lastmod>2015-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coalgebraic-semantics-for-causality-in-petri-nets-1507.06462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coalgebraic-semantics-for-causality-in-petri-nets-1507.06462"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-compilation-of-logic-programs-using-approximation-fixpoint-theory-1507.06554</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-compilation-of-logic-programs-using-approximation-fixpoint-theory-1507.06554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-compilation-of-logic-programs-using-approximation-fixpoint-theory-1507.06554"/></url>
<url><loc>https://scifaro.com/en/abs/exogenous-quantum-operator-logic-based-on-density-operators-1507.06722</loc><lastmod>2015-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exogenous-quantum-operator-logic-based-on-density-operators-1507.06722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exogenous-quantum-operator-logic-based-on-density-operators-1507.06722"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-templates-in-a-compositional-framework-for-building-logics-1507.06778</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-templates-in-a-compositional-framework-for-building-logics-1507.06778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-templates-in-a-compositional-framework-for-building-logics-1507.06778"/></url>
<url><loc>https://scifaro.com/en/abs/weak-upper-topologies-and-duality-for-cones-1507.06796</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-upper-topologies-and-duality-for-cones-1507.06796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-upper-topologies-and-duality-for-cones-1507.06796"/></url>
<url><loc>https://scifaro.com/en/abs/a-denotational-semantics-for-equilibrium-logic-1507.06915</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-denotational-semantics-for-equilibrium-logic-1507.06915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-denotational-semantics-for-equilibrium-logic-1507.06915"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-programming-playground-for-lambda-terms-combinators-types-and-tree-based-arithmetic-computations-1507.06944</loc><lastmod>2015-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-programming-playground-for-lambda-terms-combinators-types-and-tree-based-arithmetic-computations-1507.06944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-programming-playground-for-lambda-terms-combinators-types-and-tree-based-arithmetic-computations-1507.06944"/></url>
<url><loc>https://scifaro.com/en/abs/combining-fixed-point-definitions-and-game-semantics-in-logic-programming-1507.07228</loc><lastmod>2015-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-fixed-point-definitions-and-game-semantics-in-logic-programming-1507.07228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-fixed-point-definitions-and-game-semantics-in-logic-programming-1507.07228"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-kleene-algebra-with-domain-1507.07246</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-kleene-algebra-with-domain-1507.07246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-kleene-algebra-with-domain-1507.07246"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1507.07597</loc><lastmod>2015-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1507.07597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1507.07597"/></url>
<url><loc>https://scifaro.com/en/abs/featherweight-verifast-1507.07697</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/featherweight-verifast-1507.07697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/featherweight-verifast-1507.07697"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-first-order-logic-1507.07755</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-first-order-logic-1507.07755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-first-order-logic-1507.07755"/></url>
<url><loc>https://scifaro.com/en/abs/gluing-together-proof-environments-canonical-extensions-of-lf-type-theories-featuring-locks-1507.08051</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gluing-together-proof-environments-canonical-extensions-of-lf-type-theories-featuring-locks-1507.08051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gluing-together-proof-environments-canonical-extensions-of-lf-type-theories-featuring-locks-1507.08051"/></url>
<url><loc>https://scifaro.com/en/abs/an-open-challenge-problem-repository-for-systems-supporting-binders-1507.08052</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-open-challenge-problem-repository-for-systems-supporting-binders-1507.08052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-open-challenge-problem-repository-for-systems-supporting-binders-1507.08052"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-on-logical-relations-using-contextual-types-1507.08053</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-on-logical-relations-using-contextual-types-1507.08053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-on-logical-relations-using-contextual-types-1507.08053"/></url>
<url><loc>https://scifaro.com/en/abs/proof-relevant-pi-calculus-1507.08054</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-relevant-pi-calculus-1507.08054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-relevant-pi-calculus-1507.08054"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-modulo-beta-in-the-lambda-pi-calculus-modulo-1507.08055</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-modulo-beta-in-the-lambda-pi-calculus-modulo-1507.08055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-modulo-beta-in-the-lambda-pi-calculus-modulo-1507.08055"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculus-and-equational-programming-1507.08056</loc><lastmod>2015-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculus-and-equational-programming-1507.08056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculus-and-equational-programming-1507.08056"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-workshop-on-proof-exchange-for-theorem-proving-1507.08375</loc><lastmod>2015-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-proof-exchange-for-theorem-proving-1507.08375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-workshop-on-proof-exchange-for-theorem-proving-1507.08375"/></url>
<url><loc>https://scifaro.com/en/abs/extending-pptl-for-verifying-heap-evolution-properties-1507.08426</loc><lastmod>2015-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-pptl-for-verifying-heap-evolution-properties-1507.08426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-pptl-for-verifying-heap-evolution-properties-1507.08426"/></url>
<url><loc>https://scifaro.com/en/abs/importing-smt-and-connection-proofs-as-expansion-trees-1507.08715</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/importing-smt-and-connection-proofs-as-expansion-trees-1507.08715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/importing-smt-and-connection-proofs-as-expansion-trees-1507.08715"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-proof-certificates-in-finite-state-exploration-1507.08716</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-proof-certificates-in-finite-state-exploration-1507.08716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-proof-certificates-in-finite-state-exploration-1507.08716"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-verification-of-the-modal-logic-cube-in-isabelle-hol-1507.08717</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-verification-of-the-modal-logic-cube-in-isabelle-hol-1507.08717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-verification-of-the-modal-logic-cube-in-isabelle-hol-1507.08717"/></url>
<url><loc>https://scifaro.com/en/abs/the-common-hol-platform-1507.08718</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-common-hol-platform-1507.08718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-common-hol-platform-1507.08718"/></url>
<url><loc>https://scifaro.com/en/abs/checking-zenon-modulo-proofs-in-dedukti-1507.08719</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-zenon-modulo-proofs-in-dedukti-1507.08719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-zenon-modulo-proofs-in-dedukti-1507.08719"/></url>
<url><loc>https://scifaro.com/en/abs/translating-hol-to-dedukti-1507.08720</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-hol-to-dedukti-1507.08720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-hol-to-dedukti-1507.08720"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-hol-and-coq-in-dedukti-extended-abstract-1507.08721</loc><lastmod>2015-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-hol-and-coq-in-dedukti-extended-abstract-1507.08721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-hol-and-coq-in-dedukti-extended-abstract-1507.08721"/></url>
<url><loc>https://scifaro.com/en/abs/the-name-passing-calculus-1508.00093</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-name-passing-calculus-1508.00093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-name-passing-calculus-1508.00093"/></url>
<url><loc>https://scifaro.com/en/abs/extending-sroiq-with-constraint-networks-and-grounded-circumscription-1508.00116</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-sroiq-with-constraint-networks-and-grounded-circumscription-1508.00116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-sroiq-with-constraint-networks-and-grounded-circumscription-1508.00116"/></url>
<url><loc>https://scifaro.com/en/abs/equations-for-hereditary-substitution-in-leivant-s-predicative-system-f-a-case-study-1508.00455</loc><lastmod>2015-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equations-for-hereditary-substitution-in-leivant-s-predicative-system-f-a-case-study-1508.00455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equations-for-hereditary-substitution-in-leivant-s-predicative-system-f-a-case-study-1508.00455"/></url>
<url><loc>https://scifaro.com/en/abs/the-qbf-gallery-behind-the-scenes-1508.01045</loc><lastmod>2016-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-qbf-gallery-behind-the-scenes-1508.01045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-qbf-gallery-behind-the-scenes-1508.01045"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-csp-into-ccs-extended-version-1508.01127</loc><lastmod>2015-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-csp-into-ccs-extended-version-1508.01127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-csp-into-ccs-extended-version-1508.01127"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-verification-of-procedural-programs-using-horn-clauses-over-integers-and-arrays-1508.01288</loc><lastmod>2015-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-verification-of-procedural-programs-using-horn-clauses-over-integers-and-arrays-1508.01288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-verification-of-procedural-programs-using-horn-clauses-over-integers-and-arrays-1508.01288"/></url>
<url><loc>https://scifaro.com/en/abs/remark-on-the-hypothetical-judgment-1508.01600</loc><lastmod>2015-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remark-on-the-hypothetical-judgment-1508.01600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remark-on-the-hypothetical-judgment-1508.01600"/></url>
<url><loc>https://scifaro.com/en/abs/incorporating-inductions-and-game-semantics-into-logic-programming-1508.01927</loc><lastmod>2015-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorporating-inductions-and-game-semantics-into-logic-programming-1508.01927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorporating-inductions-and-game-semantics-into-logic-programming-1508.01927"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-resource-bounded-systems-with-shared-resources-via-alternating-b-uchi-pushdown-systems-1508.02326</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-resource-bounded-systems-with-shared-resources-via-alternating-b-uchi-pushdown-systems-1508.02326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-resource-bounded-systems-with-shared-resources-via-alternating-b-uchi-pushdown-systems-1508.02326"/></url>
<url><loc>https://scifaro.com/en/abs/answering-fuzzy-conjunctive-queries-over-finitely-valued-fuzzy-ontologies-1508.02626</loc><lastmod>2015-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answering-fuzzy-conjunctive-queries-over-finitely-valued-fuzzy-ontologies-1508.02626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answering-fuzzy-conjunctive-queries-over-finitely-valued-fuzzy-ontologies-1508.02626"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-construction-of-gr-1-contracts-for-synchronous-systems-with-full-information-1508.02705</loc><lastmod>2015-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-construction-of-gr-1-contracts-for-synchronous-systems-with-full-information-1508.02705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-construction-of-gr-1-contracts-for-synchronous-systems-with-full-information-1508.02705"/></url>
<url><loc>https://scifaro.com/en/abs/ellipses-and-lambda-definability-1508.02864</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ellipses-and-lambda-definability-1508.02864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ellipses-and-lambda-definability-1508.02864"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-automated-specification-and-verification-of-web-systems-1508.03389</loc><lastmod>2015-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-automated-specification-and-verification-of-web-systems-1508.03389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-automated-specification-and-verification-of-web-systems-1508.03389"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-a-very-simple-modal-logic-with-binding-1508.03630</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-a-very-simple-modal-logic-with-binding-1508.03630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-a-very-simple-modal-logic-with-binding-1508.03630"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-tla-set-theory-into-many-sorted-first-order-logic-1508.03838</loc><lastmod>2015-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-tla-set-theory-into-many-sorted-first-order-logic-1508.03838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-tla-set-theory-into-many-sorted-first-order-logic-1508.03838"/></url>
<url><loc>https://scifaro.com/en/abs/exact-unification-and-admissibility-1508.04360</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-unification-and-admissibility-1508.04360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-unification-and-admissibility-1508.04360"/></url>
<url><loc>https://scifaro.com/en/abs/topological-representation-of-intuitionistic-and-distributive-abstract-logics-1508.04428</loc><lastmod>2017-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-representation-of-intuitionistic-and-distributive-abstract-logics-1508.04428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-representation-of-intuitionistic-and-distributive-abstract-logics-1508.04428"/></url>
<url><loc>https://scifaro.com/en/abs/orchestrated-session-compliance-1508.04849</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orchestrated-session-compliance-1508.04849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orchestrated-session-compliance-1508.04849"/></url>
<url><loc>https://scifaro.com/en/abs/executable-behaviour-and-the-pi-calculus-extended-abstract-1508.04850</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/executable-behaviour-and-the-pi-calculus-extended-abstract-1508.04850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/executable-behaviour-and-the-pi-calculus-extended-abstract-1508.04850"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-petri-nets-and-transition-systems-1508.04851</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-petri-nets-and-transition-systems-1508.04851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-petri-nets-and-transition-systems-1508.04851"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-barbed-congruence-on-configuration-structures-1508.04852</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-barbed-congruence-on-configuration-structures-1508.04852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-barbed-congruence-on-configuration-structures-1508.04852"/></url>
<url><loc>https://scifaro.com/en/abs/the-lts-workbench-1508.04853</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lts-workbench-1508.04853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lts-workbench-1508.04853"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-joining-1508.04854</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-joining-1508.04854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-joining-1508.04854"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computation-power-of-name-parameterization-in-higher-order-processes-1508.04855</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computation-power-of-name-parameterization-in-higher-order-processes-1508.04855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computation-power-of-name-parameterization-in-higher-order-processes-1508.04855"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-completeness-via-canonicity-for-distributive-substructural-logics-1508.04940</loc><lastmod>2016-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-completeness-via-canonicity-for-distributive-substructural-logics-1508.04940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-completeness-via-canonicity-for-distributive-substructural-logics-1508.04940"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-dependent-types-1508.05023</loc><lastmod>2015-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-dependent-types-1508.05023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-dependent-types-1508.05023"/></url>
<url><loc>https://scifaro.com/en/abs/skolem-functions-for-factored-formulas-1508.05497</loc><lastmod>2015-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolem-functions-for-factored-formulas-1508.05497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolem-functions-for-factored-formulas-1508.05497"/></url>
<url><loc>https://scifaro.com/en/abs/structured-interactive-music-scores-1508.05559</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-interactive-music-scores-1508.05559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-interactive-music-scores-1508.05559"/></url>
<url><loc>https://scifaro.com/en/abs/unsatisfiable-cores-and-lower-bounding-for-constraint-programming-1508.06096</loc><lastmod>2015-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unsatisfiable-cores-and-lower-bounding-for-constraint-programming-1508.06096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unsatisfiable-cores-and-lower-bounding-for-constraint-programming-1508.06096"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-combined-22th-international-workshop-on-expressiveness-in-concurrency-and-12th-workshop-on-structural-operational-semantics-1508.06347</loc><lastmod>2015-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-combined-22th-international-workshop-on-expressiveness-in-concurrency-and-12th-workshop-on-structural-operational-semantics-1508.06347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-combined-22th-international-workshop-on-expressiveness-in-concurrency-and-12th-workshop-on-structural-operational-semantics-1508.06347"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-deadlock-free-session-typed-processes-1508.06707</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-deadlock-free-session-typed-processes-1508.06707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-deadlock-free-session-typed-processes-1508.06707"/></url>
<url><loc>https://scifaro.com/en/abs/on-compensation-primitives-as-adaptable-processes-1508.06709</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-compensation-primitives-as-adaptable-processes-1508.06709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-compensation-primitives-as-adaptable-processes-1508.06709"/></url>
<url><loc>https://scifaro.com/en/abs/sos-rule-formats-for-convex-and-abstract-probabilistic-bisimulations-1508.06710</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sos-rule-formats-for-convex-and-abstract-probabilistic-bisimulations-1508.06710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sos-rule-formats-for-convex-and-abstract-probabilistic-bisimulations-1508.06710"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-and-comparing-encodability-criteria-1508.06711</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-and-comparing-encodability-criteria-1508.06711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-and-comparing-encodability-criteria-1508.06711"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-csp-into-ccs-1508.06712</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-csp-into-ccs-1508.06712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-csp-into-ccs-1508.06712"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-the-factorisation-calculus-1508.06713</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-the-factorisation-calculus-1508.06713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-the-factorisation-calculus-1508.06713"/></url>
<url><loc>https://scifaro.com/en/abs/dependent-inductive-and-coinductive-types-are-fibrational-dialgebras-1508.06779</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependent-inductive-and-coinductive-types-are-fibrational-dialgebras-1508.06779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependent-inductive-and-coinductive-types-are-fibrational-dialgebras-1508.06779"/></url>
<url><loc>https://scifaro.com/en/abs/on-deciding-local-theory-extensions-via-e-matching-1508.06827</loc><lastmod>2015-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-deciding-local-theory-extensions-via-e-matching-1508.06827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-deciding-local-theory-extensions-via-e-matching-1508.06827"/></url>
<url><loc>https://scifaro.com/en/abs/contradiction-tolerant-process-algebra-with-propositional-signals-1508.06899</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contradiction-tolerant-process-algebra-with-propositional-signals-1508.06899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contradiction-tolerant-process-algebra-with-propositional-signals-1508.06899"/></url>
<url><loc>https://scifaro.com/en/abs/using-program-synthesis-for-program-analysis-1508.07829</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-program-synthesis-for-program-analysis-1508.07829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-program-synthesis-for-program-analysis-1508.07829"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculus-for-intuitionistic-epistemic-logic-1508.07851</loc><lastmod>2015-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculus-for-intuitionistic-epistemic-logic-1508.07851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculus-for-intuitionistic-epistemic-logic-1508.07851"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-epistemic-halpern-shoham-logic-extended-with-regular-expressions-1509.00608</loc><lastmod>2015-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-epistemic-halpern-shoham-logic-extended-with-regular-expressions-1509.00608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-epistemic-halpern-shoham-logic-extended-with-regular-expressions-1509.00608"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-rewrite-relations-on-lambda-terms-based-on-girard-s-notion-of-reducibility-1509.00649</loc><lastmod>2015-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-rewrite-relations-on-lambda-terms-based-on-girard-s-notion-of-reducibility-1509.00649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-rewrite-relations-on-lambda-terms-based-on-girard-s-notion-of-reducibility-1509.00649"/></url>
<url><loc>https://scifaro.com/en/abs/using-inclusion-diagrams-as-an-alternative-to-venn-diagrams-to-determine-the-validity-of-categorical-syllogisms-1509.00926</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-inclusion-diagrams-as-an-alternative-to-venn-diagrams-to-determine-the-validity-of-categorical-syllogisms-1509.00926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-inclusion-diagrams-as-an-alternative-to-venn-diagrams-to-determine-the-validity-of-categorical-syllogisms-1509.00926"/></url>
<url><loc>https://scifaro.com/en/abs/extending-hybrid-csp-with-probability-and-stochasticity-1509.01660</loc><lastmod>2015-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-hybrid-csp-with-probability-and-stochasticity-1509.01660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-hybrid-csp-with-probability-and-stochasticity-1509.01660"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-of-c-programs-based-on-the-qt-framework-extended-version-1509.01682</loc><lastmod>2015-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-of-c-programs-based-on-the-qt-framework-extended-version-1509.01682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-of-c-programs-based-on-the-qt-framework-extended-version-1509.01682"/></url>
<url><loc>https://scifaro.com/en/abs/inference-from-visible-information-and-background-knowledge-1509.01683</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inference-from-visible-information-and-background-knowledge-1509.01683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inference-from-visible-information-and-background-knowledge-1509.01683"/></url>
<url><loc>https://scifaro.com/en/abs/the-decision-problem-of-modal-product-logics-with-a-diagonal-and-faulty-counter-machines-1509.02060</loc><lastmod>2015-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-decision-problem-of-modal-product-logics-with-a-diagonal-and-faulty-counter-machines-1509.02060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-decision-problem-of-modal-product-logics-with-a-diagonal-and-faulty-counter-machines-1509.02060"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-embedded-c-software-using-k-induction-and-invariants-extended-version-1509.02471</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-embedded-c-software-using-k-induction-and-invariants-extended-version-1509.02471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-embedded-c-software-using-k-induction-and-invariants-extended-version-1509.02471"/></url>
<url><loc>https://scifaro.com/en/abs/hofstadter-s-problem-for-curious-readers-1509.02479</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hofstadter-s-problem-for-curious-readers-1509.02479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hofstadter-s-problem-for-curious-readers-1509.02479"/></url>
<url><loc>https://scifaro.com/en/abs/fault-localization-in-multi-threaded-c-programs-using-bounded-model-checking-extended-version-1509.02490</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-localization-in-multi-threaded-c-programs-using-bounded-model-checking-extended-version-1509.02490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-localization-in-multi-threaded-c-programs-using-bounded-model-checking-extended-version-1509.02490"/></url>
<url><loc>https://scifaro.com/en/abs/applying-multi-core-model-checking-to-hardware-software-partitioning-in-embedded-systems-extended-version-1509.02492</loc><lastmod>2015-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-multi-core-model-checking-to-hardware-software-partitioning-in-embedded-systems-extended-version-1509.02492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-multi-core-model-checking-to-hardware-software-partitioning-in-embedded-systems-extended-version-1509.02492"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-fixed-points-in-computer-science-1509.02826</loc><lastmod>2015-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-fixed-points-in-computer-science-1509.02826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-fixed-points-in-computer-science-1509.02826"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-two-fixed-point-semantics-for-definitional-higher-order-logic-programs-1509.03013</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-two-fixed-point-semantics-for-definitional-higher-order-logic-programs-1509.03013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-two-fixed-point-semantics-for-definitional-higher-order-logic-programs-1509.03013"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-termination-proofs-under-polynomial-quasi-interpretations-1509.03014</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-termination-proofs-under-polynomial-quasi-interpretations-1509.03014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-termination-proofs-under-polynomial-quasi-interpretations-1509.03014"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-kleene-omega-algebras-for-energy-problems-1509.03015</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-kleene-omega-algebras-for-energy-problems-1509.03015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-kleene-omega-algebras-for-energy-problems-1509.03015"/></url>
<url><loc>https://scifaro.com/en/abs/weak-completeness-of-coalgebraic-dynamic-logics-1509.03017</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-completeness-of-coalgebraic-dynamic-logics-1509.03017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-completeness-of-coalgebraic-dynamic-logics-1509.03017"/></url>
<url><loc>https://scifaro.com/en/abs/the-arity-hierarchy-in-the-polyadic-mu-calculus-1509.03018</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-arity-hierarchy-in-the-polyadic-mu-calculus-1509.03018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-arity-hierarchy-in-the-polyadic-mu-calculus-1509.03018"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctive-form-and-the-modal-mu-alternation-hierarchy-1509.03019</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctive-form-and-the-modal-mu-alternation-hierarchy-1509.03019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctive-form-and-the-modal-mu-alternation-hierarchy-1509.03019"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-directed-negation-elimination-1509.03020</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-directed-negation-elimination-1509.03020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-directed-negation-elimination-1509.03020"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-modular-datatypes-with-mendler-induction-1509.03021</loc><lastmod>2015-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-modular-datatypes-with-mendler-induction-1509.03021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-modular-datatypes-with-mendler-induction-1509.03021"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-c-memory-model-for-separation-logic-1509.03339</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-c-memory-model-for-separation-logic-1509.03339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-c-memory-model-for-separation-logic-1509.03339"/></url>
<url><loc>https://scifaro.com/en/abs/modal-characterisations-of-behavioural-pseudometrics-1509.03391</loc><lastmod>2015-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-characterisations-of-behavioural-pseudometrics-1509.03391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-characterisations-of-behavioural-pseudometrics-1509.03391"/></url>
<url><loc>https://scifaro.com/en/abs/program-analysis-with-local-policy-iteration-1509.03424</loc><lastmod>2016-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-analysis-with-local-policy-iteration-1509.03424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-analysis-with-local-policy-iteration-1509.03424"/></url>
<url><loc>https://scifaro.com/en/abs/relational-reasoning-via-probabilistic-coupling-1509.03476</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-reasoning-via-probabilistic-coupling-1509.03476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-reasoning-via-probabilistic-coupling-1509.03476"/></url>
<url><loc>https://scifaro.com/en/abs/on-banach-spaces-of-sequences-and-free-linear-logic-exponential-modality-1509.03853</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-banach-spaces-of-sequences-and-free-linear-logic-exponential-modality-1509.03853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-banach-spaces-of-sequences-and-free-linear-logic-exponential-modality-1509.03853"/></url>
<url><loc>https://scifaro.com/en/abs/controller-synthesis-for-mdps-and-frequency-ltl-setminus-gu-1509.04116</loc><lastmod>2015-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controller-synthesis-for-mdps-and-frequency-ltl-setminus-gu-1509.04116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controller-synthesis-for-mdps-and-frequency-ltl-setminus-gu-1509.04116"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-based-information-flow-analysis-with-declassification-in-a-program-logic-1509.04153</loc><lastmod>2015-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-based-information-flow-analysis-with-declassification-in-a-program-logic-1509.04153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-based-information-flow-analysis-with-declassification-in-a-program-logic-1509.04153"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-of-layered-rewrite-systems-1509.04699</loc><lastmod>2015-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-of-layered-rewrite-systems-1509.04699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-of-layered-rewrite-systems-1509.04699"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-prompt-ltl-synthesis-1509.05144</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-prompt-ltl-synthesis-1509.05144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-prompt-ltl-synthesis-1509.05144"/></url>
<url><loc>https://scifaro.com/en/abs/from-nominal-to-higher-order-rewriting-and-back-again-1509.05318</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-nominal-to-higher-order-rewriting-and-back-again-1509.05318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-nominal-to-higher-order-rewriting-and-back-again-1509.05318"/></url>
<url><loc>https://scifaro.com/en/abs/iteration-algebras-for-unql-graphs-and-completeness-for-bisimulation-1509.05376</loc><lastmod>2015-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iteration-algebras-for-unql-graphs-and-completeness-for-bisimulation-1509.05376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iteration-algebras-for-unql-graphs-and-completeness-for-bisimulation-1509.05376"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-thirteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1509.05526</loc><lastmod>2015-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-thirteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1509.05526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-thirteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1509.05526"/></url>
<url><loc>https://scifaro.com/en/abs/type-based-self-stabilisation-for-computational-fields-1509.05659</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-based-self-stabilisation-for-computational-fields-1509.05659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-based-self-stabilisation-for-computational-fields-1509.05659"/></url>
<url><loc>https://scifaro.com/en/abs/structure-preserving-bisimilarity-supporting-an-operational-petri-net-semantics-of-ccsp-1509.05842</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-preserving-bisimilarity-supporting-an-operational-petri-net-semantics-of-ccsp-1509.05842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-preserving-bisimilarity-supporting-an-operational-petri-net-semantics-of-ccsp-1509.05842"/></url>
<url><loc>https://scifaro.com/en/abs/fix-your-types-1509.06079</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fix-your-types-1509.06079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fix-your-types-1509.06079"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-functions-and-theorems-in-acl2-1509.06080</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-functions-and-theorems-in-acl2-1509.06080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-functions-and-theorems-in-acl2-1509.06080"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-numbers-in-acl2-1509.06081</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-numbers-in-acl2-1509.06081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-numbers-in-acl2-1509.06081"/></url>
<url><loc>https://scifaro.com/en/abs/extending-acl2-with-smt-solvers-1509.06082</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-acl2-with-smt-solvers-1509.06082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-acl2-with-smt-solvers-1509.06082"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-llvm-code-using-codewalker-1509.06083</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-llvm-code-using-codewalker-1509.06083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-llvm-code-using-codewalker-1509.06083"/></url>
<url><loc>https://scifaro.com/en/abs/stateman-using-metafunctions-to-manage-large-terms-representing-machine-states-1509.06084</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateman-using-metafunctions-to-manage-large-terms-representing-machine-states-1509.06084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateman-using-metafunctions-to-manage-large-terms-representing-machine-states-1509.06084"/></url>
<url><loc>https://scifaro.com/en/abs/proving-skipping-refinement-with-acl2s-1509.06085</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-skipping-refinement-with-acl2s-1509.06085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-skipping-refinement-with-acl2s-1509.06085"/></url>
<url><loc>https://scifaro.com/en/abs/fourier-series-formalization-in-acl2-r-1509.06087</loc><lastmod>2015-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fourier-series-formalization-in-acl2-r-1509.06087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fourier-series-formalization-in-acl2-r-1509.06087"/></url>
<url><loc>https://scifaro.com/en/abs/hoare-style-specifications-as-correctness-conditions-for-non-linearizable-concurrent-objects-1509.06220</loc><lastmod>2016-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hoare-style-specifications-as-correctness-conditions-for-non-linearizable-concurrent-objects-1509.06220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hoare-style-specifications-as-correctness-conditions-for-non-linearizable-concurrent-objects-1509.06220"/></url>
<url><loc>https://scifaro.com/en/abs/on-computational-paths-and-the-fundamental-groupoid-of-a-type-1509.06429</loc><lastmod>2015-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computational-paths-and-the-fundamental-groupoid-of-a-type-1509.06429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computational-paths-and-the-fundamental-groupoid-of-a-type-1509.06429"/></url>
<url><loc>https://scifaro.com/en/abs/automating-the-verification-of-realtime-observers-using-probes-and-the-modal-mu-calculus-1509.06507</loc><lastmod>2015-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-the-verification-of-realtime-observers-using-probes-and-the-modal-mu-calculus-1509.06507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-the-verification-of-realtime-observers-using-probes-and-the-modal-mu-calculus-1509.06507"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-a-logic-of-presuppositions-1509.06837</loc><lastmod>2023-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-a-logic-of-presuppositions-1509.06837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-a-logic-of-presuppositions-1509.06837"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-international-symposium-on-games-automata-logics-and-formal-verification-1509.06858</loc><lastmod>2015-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-international-symposium-on-games-automata-logics-and-formal-verification-1509.06858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-international-symposium-on-games-automata-logics-and-formal-verification-1509.06858"/></url>
<url><loc>https://scifaro.com/en/abs/negotiation-games-1509.07199</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negotiation-games-1509.07199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negotiation-games-1509.07199"/></url>
<url><loc>https://scifaro.com/en/abs/well-structured-transition-systems-with-history-1509.07203</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-structured-transition-systems-with-history-1509.07203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-structured-transition-systems-with-history-1509.07203"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressive-power-of-modal-logic-with-inclusion-atoms-1509.07204</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressive-power-of-modal-logic-with-inclusion-atoms-1509.07204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressive-power-of-modal-logic-with-inclusion-atoms-1509.07204"/></url>
<url><loc>https://scifaro.com/en/abs/average-energy-games-1509.07205</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-energy-games-1509.07205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-energy-games-1509.07205"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-1509.07206</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-1509.07206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-linear-temporal-logics-meet-costs-still-not-costlier-than-ltl-1509.07206"/></url>
<url><loc>https://scifaro.com/en/abs/improvement-in-small-progress-measures-1509.07207</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improvement-in-small-progress-measures-1509.07207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improvement-in-small-progress-measures-1509.07207"/></url>
<url><loc>https://scifaro.com/en/abs/atlsc-with-partial-observation-1509.07208</loc><lastmod>2015-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/atlsc-with-partial-observation-1509.07208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/atlsc-with-partial-observation-1509.07208"/></url>
<url><loc>https://scifaro.com/en/abs/counting-isomorphism-classes-of-beta-normal-linear-lambda-terms-1509.07596</loc><lastmod>2015-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-isomorphism-classes-of-beta-normal-linear-lambda-terms-1509.07596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-isomorphism-classes-of-beta-normal-linear-lambda-terms-1509.07596"/></url>
<url><loc>https://scifaro.com/en/abs/avoiding-contradictions-in-the-paradoxes-the-halting-problem-and-diagonalization-1509.08003</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoiding-contradictions-in-the-paradoxes-the-halting-problem-and-diagonalization-1509.08003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoiding-contradictions-in-the-paradoxes-the-halting-problem-and-diagonalization-1509.08003"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-thirteenth-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1509.08169</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-thirteenth-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1509.08169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-thirteenth-workshop-on-quantitative-aspects-of-programming-languages-and-systems-1509.08169"/></url>
<url><loc>https://scifaro.com/en/abs/definability-equals-recognizability-for-k-outerplanar-graphs-1509.08315</loc><lastmod>2015-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definability-equals-recognizability-for-k-outerplanar-graphs-1509.08315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definability-equals-recognizability-for-k-outerplanar-graphs-1509.08315"/></url>
<url><loc>https://scifaro.com/en/abs/expected-delay-summing-weak-bisimilarity-for-markov-automata-1509.08559</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expected-delay-summing-weak-bisimilarity-for-markov-automata-1509.08559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expected-delay-summing-weak-bisimilarity-for-markov-automata-1509.08559"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-checking-of-individual-rewards-properties-in-markov-population-models-1509.08561</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-checking-of-individual-rewards-properties-in-markov-population-models-1509.08561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-checking-of-individual-rewards-properties-in-markov-population-models-1509.08561"/></url>
<url><loc>https://scifaro.com/en/abs/a-definition-scheme-for-quantitative-bisimulation-1509.08563</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-definition-scheme-for-quantitative-bisimulation-1509.08563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-definition-scheme-for-quantitative-bisimulation-1509.08563"/></url>
<url><loc>https://scifaro.com/en/abs/rooted-branching-bisimulation-as-a-congruence-for-probabilistic-transition-systems-1509.08564</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rooted-branching-bisimulation-as-a-congruence-for-probabilistic-transition-systems-1509.08564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rooted-branching-bisimulation-as-a-congruence-for-probabilistic-transition-systems-1509.08564"/></url>
<url><loc>https://scifaro.com/en/abs/semiring-based-specification-approaches-for-quantitative-security-1509.08565</loc><lastmod>2015-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiring-based-specification-approaches-for-quantitative-security-1509.08565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiring-based-specification-approaches-for-quantitative-security-1509.08565"/></url>
<url><loc>https://scifaro.com/en/abs/the-attack-as-intuitionistic-negation-1510.00077</loc><lastmod>2015-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-attack-as-intuitionistic-negation-1510.00077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-attack-as-intuitionistic-negation-1510.00077"/></url>
<url><loc>https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1510.00797</loc><lastmod>2015-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1510.00797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-ukasiewicz-mu-calculus-1510.00797"/></url>
<url><loc>https://scifaro.com/en/abs/a-sorted-semantic-framework-for-applied-process-calculi-1510.01044</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sorted-semantic-framework-for-applied-process-calculi-1510.01044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sorted-semantic-framework-for-applied-process-calculi-1510.01044"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-representation-theory-for-heterotic-physical-computing-1510.01391</loc><lastmod>2015-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-representation-theory-for-heterotic-physical-computing-1510.01391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-representation-theory-for-heterotic-physical-computing-1510.01391"/></url>
<url><loc>https://scifaro.com/en/abs/an-instantiation-based-approach-for-solving-quantified-linear-arithmetic-1510.02642</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-instantiation-based-approach-for-solving-quantified-linear-arithmetic-1510.02642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-instantiation-based-approach-for-solving-quantified-linear-arithmetic-1510.02642"/></url>
<url><loc>https://scifaro.com/en/abs/ntccrt-a-concurrent-constraint-framework-for-real-time-interaction-extended-version-1510.02834</loc><lastmod>2015-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ntccrt-a-concurrent-constraint-framework-for-real-time-interaction-extended-version-1510.02834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ntccrt-a-concurrent-constraint-framework-for-real-time-interaction-extended-version-1510.02834"/></url>
<url><loc>https://scifaro.com/en/abs/a-model-for-interactive-scores-with-temporal-constraints-and-conditional-branching-1510.02836</loc><lastmod>2015-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-model-for-interactive-scores-with-temporal-constraints-and-conditional-branching-1510.02836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-model-for-interactive-scores-with-temporal-constraints-and-conditional-branching-1510.02836"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-constraint-machine-improvisation-models-and-implementation-1510.02840</loc><lastmod>2015-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-constraint-machine-improvisation-models-and-implementation-1510.02840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-constraint-machine-improvisation-models-and-implementation-1510.02840"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-weakening-of-compass-logic-based-on-cone-shaped-cardinal-directions-1510.03319</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-weakening-of-compass-logic-based-on-cone-shaped-cardinal-directions-1510.03319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-weakening-of-compass-logic-based-on-cone-shaped-cardinal-directions-1510.03319"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-for-verifying-secure-routing-protocols-1510.03531</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-for-verifying-secure-routing-protocols-1510.03531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-for-verifying-secure-routing-protocols-1510.03531"/></url>
<url><loc>https://scifaro.com/en/abs/the-equivalence-of-the-torus-and-the-product-of-two-circles-in-homotopy-type-theory-1510.03918</loc><lastmod>2015-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-equivalence-of-the-torus-and-the-product-of-two-circles-in-homotopy-type-theory-1510.03918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-equivalence-of-the-torus-and-the-product-of-two-circles-in-homotopy-type-theory-1510.03918"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-in-the-logic-of-subsequences-and-supersequences-1510.03994</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-in-the-logic-of-subsequences-and-supersequences-1510.03994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-in-the-logic-of-subsequences-and-supersequences-1510.03994"/></url>
<url><loc>https://scifaro.com/en/abs/the-diagonal-lemma-fails-in-aristotelian-logic-1510.04393</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-diagonal-lemma-fails-in-aristotelian-logic-1510.04393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-diagonal-lemma-fails-in-aristotelian-logic-1510.04393"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-system-rigorous-constructions-of-computer-models-1510.04469</loc><lastmod>2017-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-system-rigorous-constructions-of-computer-models-1510.04469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-system-rigorous-constructions-of-computer-models-1510.04469"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theoretic-approach-to-resolution-1510.04661</loc><lastmod>2015-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-resolution-1510.04661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-resolution-1510.04661"/></url>
<url><loc>https://scifaro.com/en/abs/the-vampire-and-the-fool-1510.04821</loc><lastmod>2015-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vampire-and-the-fool-1510.04821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vampire-and-the-fool-1510.04821"/></url>
<url><loc>https://scifaro.com/en/abs/a-semantic-theory-of-the-internet-of-things-1510.04854</loc><lastmod>2016-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-semantic-theory-of-the-internet-of-things-1510.04854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-semantic-theory-of-the-internet-of-things-1510.04854"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-short-circuit-logic-1510.05162</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-short-circuit-logic-1510.05162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-short-circuit-logic-1510.05162"/></url>
<url><loc>https://scifaro.com/en/abs/combining-intermediate-propositional-logics-with-classical-logic-1510.05326</loc><lastmod>2015-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-intermediate-propositional-logics-with-classical-logic-1510.05326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-intermediate-propositional-logics-with-classical-logic-1510.05326"/></url>
<url><loc>https://scifaro.com/en/abs/approaching-the-coverability-problem-continuously-1510.05724</loc><lastmod>2017-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approaching-the-coverability-problem-continuously-1510.05724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approaching-the-coverability-problem-continuously-1510.05724"/></url>
<url><loc>https://scifaro.com/en/abs/petri-nets-and-its-polynomials-1510.06020</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-nets-and-its-polynomials-1510.06020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-nets-and-its-polynomials-1510.06020"/></url>
<url><loc>https://scifaro.com/en/abs/proof-equivalence-in-mll-is-pspace-complete-1510.06178</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-equivalence-in-mll-is-pspace-complete-1510.06178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-equivalence-in-mll-is-pspace-complete-1510.06178"/></url>
<url><loc>https://scifaro.com/en/abs/switchability-and-collapsibility-of-gap-algebras-1510.06298</loc><lastmod>2015-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/switchability-and-collapsibility-of-gap-algebras-1510.06298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/switchability-and-collapsibility-of-gap-algebras-1510.06298"/></url>
<url><loc>https://scifaro.com/en/abs/operator-algebras-in-quantum-computation-1510.06649</loc><lastmod>2015-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operator-algebras-in-quantum-computation-1510.06649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operator-algebras-in-quantum-computation-1510.06649"/></url>
<url><loc>https://scifaro.com/en/abs/type-checking-liveness-for-collaborative-processes-with-bounded-and-unbounded-recursion-1510.06658</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-checking-liveness-for-collaborative-processes-with-bounded-and-unbounded-recursion-1510.06658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-checking-liveness-for-collaborative-processes-with-bounded-and-unbounded-recursion-1510.06658"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-formulae-for-session-types-extended-version-1510.06879</loc><lastmod>2015-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-formulae-for-session-types-extended-version-1510.06879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-formulae-for-session-types-extended-version-1510.06879"/></url>
<url><loc>https://scifaro.com/en/abs/some-notes-on-temporal-justification-logic-1510.07247</loc><lastmod>2015-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-notes-on-temporal-justification-logic-1510.07247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-notes-on-temporal-justification-logic-1510.07247"/></url>
<url><loc>https://scifaro.com/en/abs/reversing-single-sessions-1510.07253</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversing-single-sessions-1510.07253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversing-single-sessions-1510.07253"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-conditional-term-rewriting-1510.07276</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-conditional-term-rewriting-1510.07276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-conditional-term-rewriting-1510.07276"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logic-as-filtering-1510.08079</loc><lastmod>2016-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logic-as-filtering-1510.08079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logic-as-filtering-1510.08079"/></url>
<url><loc>https://scifaro.com/en/abs/structurally-cyclic-petri-nets-1510.08331</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structurally-cyclic-petri-nets-1510.08331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structurally-cyclic-petri-nets-1510.08331"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-decidable-about-syntax-guided-synthesis-1510.08393</loc><lastmod>2016-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-decidable-about-syntax-guided-synthesis-1510.08393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-decidable-about-syntax-guided-synthesis-1510.08393"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-approach-to-computing-with-compact-sets-1510.08498</loc><lastmod>2021-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-approach-to-computing-with-compact-sets-1510.08498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-approach-to-computing-with-compact-sets-1510.08498"/></url>
<url><loc>https://scifaro.com/en/abs/regular-symmetry-patterns-technical-report-1510.08506</loc><lastmod>2015-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-symmetry-patterns-technical-report-1510.08506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-symmetry-patterns-technical-report-1510.08506"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-analysis-of-qualitative-and-quantitative-termination-problems-for-affine-probabilistic-programs-1510.08517</loc><lastmod>2015-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-analysis-of-qualitative-and-quantitative-termination-problems-for-affine-probabilistic-programs-1510.08517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-analysis-of-qualitative-and-quantitative-termination-problems-for-affine-probabilistic-programs-1510.08517"/></url>
<url><loc>https://scifaro.com/en/abs/build-your-own-clarithmetic-i-setup-and-completeness-1510.08564</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/build-your-own-clarithmetic-i-setup-and-completeness-1510.08564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/build-your-own-clarithmetic-i-setup-and-completeness-1510.08564"/></url>
<url><loc>https://scifaro.com/en/abs/build-your-own-clarithmetic-ii-soundness-1510.08566</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/build-your-own-clarithmetic-ii-soundness-1510.08566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/build-your-own-clarithmetic-ii-soundness-1510.08566"/></url>
<url><loc>https://scifaro.com/en/abs/quirky-quantifiers-optimal-models-and-complexity-of-computation-tree-logic-1510.08786</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quirky-quantifiers-optimal-models-and-complexity-of-computation-tree-logic-1510.08786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quirky-quantifiers-optimal-models-and-complexity-of-computation-tree-logic-1510.08786"/></url>
<url><loc>https://scifaro.com/en/abs/robust-linear-temporal-logic-1510.08970</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-linear-temporal-logic-1510.08970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-linear-temporal-logic-1510.08970"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-and-dependence-via-multiteam-semantics-1510.09040</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-and-dependence-via-multiteam-semantics-1510.09040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-and-dependence-via-multiteam-semantics-1510.09040"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-via-canonicity-for-coalgebraic-logics-1510.09095</loc><lastmod>2015-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-via-canonicity-for-coalgebraic-logics-1510.09095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-via-canonicity-for-coalgebraic-logics-1510.09095"/></url>
<url><loc>https://scifaro.com/en/abs/trace-refinement-in-labelled-markov-decision-processes-1510.09102</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-refinement-in-labelled-markov-decision-processes-1510.09102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-refinement-in-labelled-markov-decision-processes-1510.09102"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-theoretic-progress-measures-and-coalgebraic-model-checking-with-appendices-1511.00346</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-theoretic-progress-measures-and-coalgebraic-model-checking-with-appendices-1511.00346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-theoretic-progress-measures-and-coalgebraic-model-checking-with-appendices-1511.00346"/></url>
<url><loc>https://scifaro.com/en/abs/adapting-real-quantifier-elimination-methods-for-conflict-set-computation-1511.01123</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adapting-real-quantifier-elimination-methods-for-conflict-set-computation-1511.01123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adapting-real-quantifier-elimination-methods-for-conflict-set-computation-1511.01123"/></url>
<url><loc>https://scifaro.com/en/abs/full-abstraction-for-probabilistic-pcf-1511.01272</loc><lastmod>2015-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-abstraction-for-probabilistic-pcf-1511.01272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-abstraction-for-probabilistic-pcf-1511.01272"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-checking-by-logic-relaxation-1511.01368</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-checking-by-logic-relaxation-1511.01368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-checking-by-logic-relaxation-1511.01368"/></url>
<url><loc>https://scifaro.com/en/abs/demonic-programming-a-computational-language-for-single-particle-equilibrium-thermodynamics-and-its-formal-semantics-1511.01566</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/demonic-programming-a-computational-language-for-single-particle-equilibrium-thermodynamics-and-its-formal-semantics-1511.01566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/demonic-programming-a-computational-language-for-single-particle-equilibrium-thermodynamics-and-its-formal-semantics-1511.01566"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-quantum-protocols-using-coq-1511.01568</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-quantum-protocols-using-coq-1511.01568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-quantum-protocols-using-coq-1511.01568"/></url>
<url><loc>https://scifaro.com/en/abs/total-and-partial-computation-in-categorical-quantum-foundations-1511.01569</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-and-partial-computation-in-categorical-quantum-foundations-1511.01569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-and-partial-computation-in-categorical-quantum-foundations-1511.01569"/></url>
<url><loc>https://scifaro.com/en/abs/quotient-comprehension-chains-1511.01570</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quotient-comprehension-chains-1511.01570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quotient-comprehension-chains-1511.01570"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-tensors-as-graphs-with-neighbourhood-orders-1511.01573</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-tensors-as-graphs-with-neighbourhood-orders-1511.01573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-tensors-as-graphs-with-neighbourhood-orders-1511.01573"/></url>
<url><loc>https://scifaro.com/en/abs/string-solving-with-word-equations-and-transducers-towards-a-logic-for-analysing-mutation-xss-full-version-1511.01633</loc><lastmod>2015-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-solving-with-word-equations-and-transducers-towards-a-logic-for-analysing-mutation-xss-full-version-1511.01633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-solving-with-word-equations-and-transducers-towards-a-logic-for-analysing-mutation-xss-full-version-1511.01633"/></url>
<url><loc>https://scifaro.com/en/abs/the-height-of-piecewise-testable-languages-and-the-complexity-of-the-logic-of-subwords-1511.01807</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-height-of-piecewise-testable-languages-and-the-complexity-of-the-logic-of-subwords-1511.01807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-height-of-piecewise-testable-languages-and-the-complexity-of-the-logic-of-subwords-1511.01807"/></url>
<url><loc>https://scifaro.com/en/abs/methods-of-class-field-theory-to-separate-logics-over-finite-residue-classes-and-circuit-complexity-1511.02175</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/methods-of-class-field-theory-to-separate-logics-over-finite-residue-classes-and-circuit-complexity-1511.02175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/methods-of-class-field-theory-to-separate-logics-over-finite-residue-classes-and-circuit-complexity-1511.02175"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-workshop-on-models-for-formal-analysis-of-real-systems-1511.02528</loc><lastmod>2015-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-workshop-on-models-for-formal-analysis-of-real-systems-1511.02528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-workshop-on-models-for-formal-analysis-of-real-systems-1511.02528"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-focusing-1511.02529</loc><lastmod>2015-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-focusing-1511.02529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-focusing-1511.02529"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-driven-concolic-testing-1511.02615</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-driven-concolic-testing-1511.02615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-driven-concolic-testing-1511.02615"/></url>
<url><loc>https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-1511.03003</loc><lastmod>2015-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-1511.03003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-1511.03003"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-description-logic-alcm-1511.03749</loc><lastmod>2015-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-description-logic-alcm-1511.03749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-description-logic-alcm-1511.03749"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-a-realistic-file-system-1511.04169</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-a-realistic-file-system-1511.04169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-a-realistic-file-system-1511.04169"/></url>
<url><loc>https://scifaro.com/en/abs/controlled-owicki-gries-concurrency-reasoning-about-the-preemptible-echronos-embedded-operating-system-1511.04170</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlled-owicki-gries-concurrency-reasoning-about-the-preemptible-echronos-embedded-operating-system-1511.04170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlled-owicki-gries-concurrency-reasoning-about-the-preemptible-echronos-embedded-operating-system-1511.04170"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-and-verification-of-the-bitcoin-protocol-1511.04173</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-and-verification-of-the-bitcoin-protocol-1511.04173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-and-verification-of-the-bitcoin-protocol-1511.04173"/></url>
<url><loc>https://scifaro.com/en/abs/formal-specification-and-verification-of-fully-asynchronous-implementations-of-the-data-encryption-standard-1511.04174</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-specification-and-verification-of-fully-asynchronous-implementations-of-the-data-encryption-standard-1511.04174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-specification-and-verification-of-fully-asynchronous-implementations-of-the-data-encryption-standard-1511.04174"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-automated-generation-of-focused-proof-systems-1511.04177</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-automated-generation-of-focused-proof-systems-1511.04177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-automated-generation-of-focused-proof-systems-1511.04177"/></url>
<url><loc>https://scifaro.com/en/abs/proof-outlines-as-proof-certificates-a-system-description-1511.04178</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-outlines-as-proof-certificates-a-system-description-1511.04178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-outlines-as-proof-certificates-a-system-description-1511.04178"/></url>
<url><loc>https://scifaro.com/en/abs/realisability-semantics-of-abstract-focussing-formalised-1511.04179</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realisability-semantics-of-abstract-focussing-formalised-1511.04179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realisability-semantics-of-abstract-focussing-formalised-1511.04179"/></url>
<url><loc>https://scifaro.com/en/abs/multiplicative-additive-focusing-for-parsing-as-deduction-1511.04180</loc><lastmod>2015-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiplicative-additive-focusing-for-parsing-as-deduction-1511.04180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiplicative-additive-focusing-for-parsing-as-deduction-1511.04180"/></url>
<url><loc>https://scifaro.com/en/abs/canonicity-and-relativized-canonicity-via-pseudo-correspondence-an-application-of-alba-1511.04271</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonicity-and-relativized-canonicity-via-pseudo-correspondence-an-application-of-alba-1511.04271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonicity-and-relativized-canonicity-via-pseudo-correspondence-an-application-of-alba-1511.04271"/></url>
<url><loc>https://scifaro.com/en/abs/counting-and-generating-terms-in-the-binary-lambda-calculus-extended-version-1511.05334</loc><lastmod>2016-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-and-generating-terms-in-the-binary-lambda-calculus-extended-version-1511.05334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-and-generating-terms-in-the-binary-lambda-calculus-extended-version-1511.05334"/></url>
<url><loc>https://scifaro.com/en/abs/contextual-equivalences-in-configuration-structures-and-reversibility-1511.05750</loc><lastmod>2015-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contextual-equivalences-in-configuration-structures-and-reversibility-1511.05750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contextual-equivalences-in-configuration-structures-and-reversibility-1511.05750"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-of-labelled-state-to-function-transition-systems-coalgebraically-1511.05866</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-of-labelled-state-to-function-transition-systems-coalgebraically-1511.05866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-of-labelled-state-to-function-transition-systems-coalgebraically-1511.05866"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-and-decomposition-theorems-for-bounded-degree-structures-1511.05888</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-and-decomposition-theorems-for-bounded-degree-structures-1511.05888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-and-decomposition-theorems-for-bounded-degree-structures-1511.05888"/></url>
<url><loc>https://scifaro.com/en/abs/solving-non-linear-horn-clauses-using-a-linear-solver-1511.06668</loc><lastmod>2015-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-non-linear-horn-clauses-using-a-linear-solver-1511.06668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-non-linear-horn-clauses-using-a-linear-solver-1511.06668"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-flagg-and-friedman-s-epistemic-and-intuitionistic-formal-systems-1511.07319</loc><lastmod>2015-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-flagg-and-friedman-s-epistemic-and-intuitionistic-formal-systems-1511.07319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-flagg-and-friedman-s-epistemic-and-intuitionistic-formal-systems-1511.07319"/></url>
<url><loc>https://scifaro.com/en/abs/a-symbolic-logic-with-concrete-bounds-for-cryptographic-protocols-1511.07536</loc><lastmod>2015-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symbolic-logic-with-concrete-bounds-for-cryptographic-protocols-1511.07536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symbolic-logic-with-concrete-bounds-for-cryptographic-protocols-1511.07536"/></url>
<url><loc>https://scifaro.com/en/abs/structural-resolution-a-framework-for-coinductive-proof-search-and-proof-construction-in-horn-clause-logic-1511.07865</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-resolution-a-framework-for-coinductive-proof-search-and-proof-construction-in-horn-clause-logic-1511.07865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-resolution-a-framework-for-coinductive-proof-search-and-proof-construction-in-horn-clause-logic-1511.07865"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-and-complexity-for-quiescent-consistency-and-its-variations-1511.08447</loc><lastmod>2015-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-and-complexity-for-quiescent-consistency-and-its-variations-1511.08447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-and-complexity-for-quiescent-consistency-and-its-variations-1511.08447"/></url>
<url><loc>https://scifaro.com/en/abs/fly-automata-for-checking-mso-2-graph-properties-1511.08605</loc><lastmod>2015-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fly-automata-for-checking-mso-2-graph-properties-1511.08605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fly-automata-for-checking-mso-2-graph-properties-1511.08605"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebra-of-recursive-graph-transformation-language-uncal-complete-axiomatisation-and-iteration-categorical-semantics-1511.08851</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebra-of-recursive-graph-transformation-language-uncal-complete-axiomatisation-and-iteration-categorical-semantics-1511.08851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebra-of-recursive-graph-transformation-language-uncal-complete-axiomatisation-and-iteration-categorical-semantics-1511.08851"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-first-order-satisfiability-when-universal-and-existential-variables-are-separated-1511.08999</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-first-order-satisfiability-when-universal-and-existential-variables-are-separated-1511.08999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-first-order-satisfiability-when-universal-and-existential-variables-are-separated-1511.08999"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-approach-for-approximity-1511.09186</loc><lastmod>2015-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-approach-for-approximity-1511.09186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-approach-for-approximity-1511.09186"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theory-for-probabilistic-and-bayesian-reasoning-1511.09230</loc><lastmod>2025-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theory-for-probabilistic-and-bayesian-reasoning-1511.09230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theory-for-probabilistic-and-bayesian-reasoning-1511.09230"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphisms-considered-as-equalities-projecting-functions-and-enhancing-partial-application-through-and-implementation-of-lambda-1511.09324</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphisms-considered-as-equalities-projecting-functions-and-enhancing-partial-application-through-and-implementation-of-lambda-1511.09324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphisms-considered-as-equalities-projecting-functions-and-enhancing-partial-application-through-and-implementation-of-lambda-1511.09324"/></url>
<url><loc>https://scifaro.com/en/abs/proof-relevant-corecursive-resolution-1511.09394</loc><lastmod>2015-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-relevant-corecursive-resolution-1511.09394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-relevant-corecursive-resolution-1511.09394"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-optimal-bounds-in-prompt-ltl-realizability-in-doubly-exponential-time-1511.09450</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-optimal-bounds-in-prompt-ltl-realizability-in-doubly-exponential-time-1511.09450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-optimal-bounds-in-prompt-ltl-realizability-in-doubly-exponential-time-1511.09450"/></url>
<url><loc>https://scifaro.com/en/abs/value-passing-ccs-for-trees-a-theory-for-concurrent-systems-1512.00550</loc><lastmod>2016-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/value-passing-ccs-for-trees-a-theory-for-concurrent-systems-1512.00550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/value-passing-ccs-for-trees-a-theory-for-concurrent-systems-1512.00550"/></url>
<url><loc>https://scifaro.com/en/abs/querying-with-l-ukasiewicz-logic-1512.01041</loc><lastmod>2015-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-with-l-ukasiewicz-logic-1512.01041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-with-l-ukasiewicz-logic-1512.01041"/></url>
<url><loc>https://scifaro.com/en/abs/new-lace-and-arsenic-adventures-in-weak-memory-with-a-program-logic-1512.01416</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-lace-and-arsenic-adventures-in-weak-memory-with-a-program-logic-1512.01416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-lace-and-arsenic-adventures-in-weak-memory-with-a-program-logic-1512.01416"/></url>
<url><loc>https://scifaro.com/en/abs/type-theory-and-its-meaning-explanations-1512.01837</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theory-and-its-meaning-explanations-1512.01837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theory-and-its-meaning-explanations-1512.01837"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchy-of-persistence-with-respect-to-the-length-of-action-s-disability-1512.01952</loc><lastmod>2016-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchy-of-persistence-with-respect-to-the-length-of-action-s-disability-1512.01952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchy-of-persistence-with-respect-to-the-length-of-action-s-disability-1512.01952"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-third-international-workshop-on-verification-and-program-transformation-1512.02215</loc><lastmod>2015-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-third-international-workshop-on-verification-and-program-transformation-1512.02215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-third-international-workshop-on-verification-and-program-transformation-1512.02215"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proofs-of-transcendence-for-e-and-pi-as-an-application-of-multivariate-and-symmetric-polynomials-1512.02791</loc><lastmod>2015-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proofs-of-transcendence-for-e-and-pi-as-an-application-of-multivariate-and-symmetric-polynomials-1512.02791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proofs-of-transcendence-for-e-and-pi-as-an-application-of-multivariate-and-symmetric-polynomials-1512.02791"/></url>
<url><loc>https://scifaro.com/en/abs/a-token-passing-net-implementation-of-optimal-reduction-with-embedded-read-back-1512.02995</loc><lastmod>2015-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-token-passing-net-implementation-of-optimal-reduction-with-embedded-read-back-1512.02995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-token-passing-net-implementation-of-optimal-reduction-with-embedded-read-back-1512.02995"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-representations-for-function-spaces-in-computable-analysis-1512.03024</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-representations-for-function-spaces-in-computable-analysis-1512.03024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-representations-for-function-spaces-in-computable-analysis-1512.03024"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-temporal-properties-of-reactive-systems-by-transformation-1512.03860</loc><lastmod>2015-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-temporal-properties-of-reactive-systems-by-transformation-1512.03860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-temporal-properties-of-reactive-systems-by-transformation-1512.03860"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-by-tree-dimension-in-horn-clause-verification-1512.03862</loc><lastmod>2015-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-by-tree-dimension-in-horn-clause-verification-1512.03862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-by-tree-dimension-in-horn-clause-verification-1512.03862"/></url>
<url><loc>https://scifaro.com/en/abs/mathematics-of-domains-1512.03868</loc><lastmod>2015-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematics-of-domains-1512.03868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematics-of-domains-1512.03868"/></url>
<url><loc>https://scifaro.com/en/abs/the-rationale-behind-the-concept-of-goal-1512.04021</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rationale-behind-the-concept-of-goal-1512.04021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rationale-behind-the-concept-of-goal-1512.04021"/></url>
<url><loc>https://scifaro.com/en/abs/the-fixed-initial-credit-problem-for-partial-observation-energy-games-is-ack-complete-1512.04255</loc><lastmod>2016-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fixed-initial-credit-problem-for-partial-observation-energy-games-is-ack-complete-1512.04255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fixed-initial-credit-problem-for-partial-observation-energy-games-is-ack-complete-1512.04255"/></url>
<url><loc>https://scifaro.com/en/abs/linear-models-of-computation-and-program-learning-1512.04639</loc><lastmod>2015-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-models-of-computation-and-program-learning-1512.04639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-models-of-computation-and-program-learning-1512.04639"/></url>
<url><loc>https://scifaro.com/en/abs/horn-linear-logic-and-minsky-machines-1512.04964</loc><lastmod>2015-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-linear-logic-and-minsky-machines-1512.04964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-linear-logic-and-minsky-machines-1512.04964"/></url>
<url><loc>https://scifaro.com/en/abs/visibly-linear-dynamic-logic-1512.05177</loc><lastmod>2017-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibly-linear-dynamic-logic-1512.05177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibly-linear-dynamic-logic-1512.05177"/></url>
<url><loc>https://scifaro.com/en/abs/typed-realizability-for-first-order-classical-analysis-1512.05313</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-realizability-for-first-order-classical-analysis-1512.05313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-realizability-for-first-order-classical-analysis-1512.05313"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-graph-queries-1512.05511</loc><lastmod>2015-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-graph-queries-1512.05511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-graph-queries-1512.05511"/></url>
<url><loc>https://scifaro.com/en/abs/non-zero-sum-games-for-reactive-synthesis-1512.05568</loc><lastmod>2016-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-zero-sum-games-for-reactive-synthesis-1512.05568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-zero-sum-games-for-reactive-synthesis-1512.05568"/></url>
<url><loc>https://scifaro.com/en/abs/proof-complexity-of-intuitionistic-implicational-formulas-1512.05667</loc><lastmod>2016-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-complexity-of-intuitionistic-implicational-formulas-1512.05667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-complexity-of-intuitionistic-implicational-formulas-1512.05667"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-effectus-theory-1512.05813</loc><lastmod>2015-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-effectus-theory-1512.05813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-effectus-theory-1512.05813"/></url>
<url><loc>https://scifaro.com/en/abs/tp1-valid-transformation-functions-for-operations-on-ordered-n-ary-trees-1512.05949</loc><lastmod>2015-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tp1-valid-transformation-functions-for-operations-on-ordered-n-ary-trees-1512.05949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tp1-valid-transformation-functions-for-operations-on-ordered-n-ary-trees-1512.05949"/></url>
<url><loc>https://scifaro.com/en/abs/shapely-monads-and-analytic-functors-1512.05980</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shapely-monads-and-analytic-functors-1512.05980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shapely-monads-and-analytic-functors-1512.05980"/></url>
<url><loc>https://scifaro.com/en/abs/process-realizability-1512.06233</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-realizability-1512.06233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-realizability-1512.06233"/></url>
<url><loc>https://scifaro.com/en/abs/contributions-to-the-compositional-semantics-of-first-order-predicate-logic-1512.06282</loc><lastmod>2015-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contributions-to-the-compositional-semantics-of-first-order-predicate-logic-1512.06282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contributions-to-the-compositional-semantics-of-first-order-predicate-logic-1512.06282"/></url>
<url><loc>https://scifaro.com/en/abs/eigenlogic-in-the-spirit-of-george-boole-1512.06632</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eigenlogic-in-the-spirit-of-george-boole-1512.06632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eigenlogic-in-the-spirit-of-george-boole-1512.06632"/></url>
<url><loc>https://scifaro.com/en/abs/linear-lambda-terms-as-invariants-of-rooted-trivalent-maps-1512.06751</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-lambda-terms-as-invariants-of-rooted-trivalent-maps-1512.06751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-lambda-terms-as-invariants-of-rooted-trivalent-maps-1512.06751"/></url>
<url><loc>https://scifaro.com/en/abs/proving-continuity-of-coinductive-global-bisimulation-distances-a-never-ending-story-1512.06944</loc><lastmod>2015-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-continuity-of-coinductive-global-bisimulation-distances-a-never-ending-story-1512.06944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-continuity-of-coinductive-global-bisimulation-distances-a-never-ending-story-1512.06944"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-semantics-in-markovian-process-algebra-1512.07098</loc><lastmod>2015-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-semantics-in-markovian-process-algebra-1512.07098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-semantics-in-markovian-process-algebra-1512.07098"/></url>
<url><loc>https://scifaro.com/en/abs/mechanizing-a-process-algebra-for-network-protocols-1512.07304</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanizing-a-process-algebra-for-network-protocols-1512.07304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanizing-a-process-algebra-for-network-protocols-1512.07304"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-algebra-for-wireless-mesh-networks-1512.07319</loc><lastmod>2015-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-for-wireless-mesh-networks-1512.07319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-for-wireless-mesh-networks-1512.07319"/></url>
<url><loc>https://scifaro.com/en/abs/towards-dynamic-updates-in-service-composition-1512.07680</loc><lastmod>2015-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-dynamic-updates-in-service-composition-1512.07680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-dynamic-updates-in-service-composition-1512.07680"/></url>
<url><loc>https://scifaro.com/en/abs/the-pragmatic-proof-hypermedia-api-composition-and-execution-1512.07780</loc><lastmod>2016-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pragmatic-proof-hypermedia-api-composition-and-execution-1512.07780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pragmatic-proof-hypermedia-api-composition-and-execution-1512.07780"/></url>
<url><loc>https://scifaro.com/en/abs/mining-parametric-temporal-logic-properties-in-model-based-design-for-cyber-physical-systems-1512.07956</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mining-parametric-temporal-logic-properties-in-model-based-design-for-cyber-physical-systems-1512.07956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mining-parametric-temporal-logic-properties-in-model-based-design-for-cyber-physical-systems-1512.07956"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-dependent-types-and-effects-1512.08009</loc><lastmod>2016-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-dependent-types-and-effects-1512.08009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-dependent-types-and-effects-1512.08009"/></url>
<url><loc>https://scifaro.com/en/abs/a-mathematical-theory-of-co-design-1512.08055</loc><lastmod>2016-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mathematical-theory-of-co-design-1512.08055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mathematical-theory-of-co-design-1512.08055"/></url>
<url><loc>https://scifaro.com/en/abs/average-energy-games-full-version-1512.08106</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/average-energy-games-full-version-1512.08106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/average-energy-games-full-version-1512.08106"/></url>
<url><loc>https://scifaro.com/en/abs/computing-theory-prime-implicates-in-modal-logic-1512.08366</loc><lastmod>2016-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-theory-prime-implicates-in-modal-logic-1512.08366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-theory-prime-implicates-in-modal-logic-1512.08366"/></url>
<url><loc>https://scifaro.com/en/abs/t2-temporal-property-verification-1512.08689</loc><lastmod>2016-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/t2-temporal-property-verification-1512.08689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/t2-temporal-property-verification-1512.08689"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-analysis-of-vass-induced-mdps-1512.08824</loc><lastmod>2016-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-analysis-of-vass-induced-mdps-1512.08824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-analysis-of-vass-induced-mdps-1512.08824"/></url>
<url><loc>https://scifaro.com/en/abs/metric-temporal-logic-with-counting-1512.09032</loc><lastmod>2015-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-temporal-logic-with-counting-1512.09032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-temporal-logic-with-counting-1512.09032"/></url>
<url><loc>https://scifaro.com/en/abs/collapsing-threads-safely-with-soft-invariants-1512.09186</loc><lastmod>2016-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collapsing-threads-safely-with-soft-invariants-1512.09186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collapsing-threads-safely-with-soft-invariants-1512.09186"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-of-adjoint-functors-enriched-in-a-quantaloid-1601.00239</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-of-adjoint-functors-enriched-in-a-quantaloid-1601.00239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-of-adjoint-functors-enriched-in-a-quantaloid-1601.00239"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-elimination-in-the-intuitionistic-propositional-calculus-1601.00402</loc><lastmod>2016-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-elimination-in-the-intuitionistic-propositional-calculus-1601.00402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-elimination-in-the-intuitionistic-propositional-calculus-1601.00402"/></url>
<url><loc>https://scifaro.com/en/abs/sdds-are-exponentially-more-succinct-than-obdds-1601.00501</loc><lastmod>2016-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sdds-are-exponentially-more-succinct-than-obdds-1601.00501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sdds-are-exponentially-more-succinct-than-obdds-1601.00501"/></url>
<url><loc>https://scifaro.com/en/abs/why-just-boogie-translating-between-intermediate-verification-languages-1601.00516</loc><lastmod>2016-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/why-just-boogie-translating-between-intermediate-verification-languages-1601.00516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/why-just-boogie-translating-between-intermediate-verification-languages-1601.00516"/></url>
<url><loc>https://scifaro.com/en/abs/a-single-assignment-translation-for-annotated-programs-1601.00584</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-single-assignment-translation-for-annotated-programs-1601.00584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-single-assignment-translation-for-annotated-programs-1601.00584"/></url>
<url><loc>https://scifaro.com/en/abs/weakest-precondition-reasoning-for-expected-run-times-of-probabilistic-programs-1601.01001</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakest-precondition-reasoning-for-expected-run-times-of-probabilistic-programs-1601.01001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakest-precondition-reasoning-for-expected-run-times-of-probabilistic-programs-1601.01001"/></url>
<url><loc>https://scifaro.com/en/abs/tool-support-for-reasoning-in-display-calculi-1601.01113</loc><lastmod>2016-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tool-support-for-reasoning-in-display-calculi-1601.01113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tool-support-for-reasoning-in-display-calculi-1601.01113"/></url>
<url><loc>https://scifaro.com/en/abs/an-o-m-log-n-algorithm-for-stuttering-equivalence-and-branching-bisimulation-1601.01478</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-o-m-log-n-algorithm-for-stuttering-equivalence-and-branching-bisimulation-1601.01478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-o-m-log-n-algorithm-for-stuttering-equivalence-and-branching-bisimulation-1601.01478"/></url>
<url><loc>https://scifaro.com/en/abs/rules-and-derivations-in-an-elementary-logic-course-1601.01483</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rules-and-derivations-in-an-elementary-logic-course-1601.01483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rules-and-derivations-in-an-elementary-logic-course-1601.01483"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-introduction-rules-and-automata-1601.01484</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-introduction-rules-and-automata-1601.01484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-introduction-rules-and-automata-1601.01484"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-executability-of-interactive-computation-1601.01546</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-executability-of-interactive-computation-1601.01546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-executability-of-interactive-computation-1601.01546"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-dependent-type-theory-with-coinductive-types-1601.01586</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-dependent-type-theory-with-coinductive-types-1601.01586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-dependent-type-theory-with-coinductive-types-1601.01586"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-verification-of-safety-properties-of-spatial-families-of-linear-hybrid-automata-1601.01648</loc><lastmod>2016-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-verification-of-safety-properties-of-spatial-families-of-linear-hybrid-automata-1601.01648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-verification-of-safety-properties-of-spatial-families-of-linear-hybrid-automata-1601.01648"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-definition-of-the-classical-connectives-and-quantifiers-1601.01782</loc><lastmod>2016-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-definition-of-the-classical-connectives-and-quantifiers-1601.01782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-definition-of-the-classical-connectives-and-quantifiers-1601.01782"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-rules-for-colored-workflow-nets-1601.01928</loc><lastmod>2016-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-rules-for-colored-workflow-nets-1601.01928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-rules-for-colored-workflow-nets-1601.01928"/></url>
<url><loc>https://scifaro.com/en/abs/possible-values-exploring-a-concept-for-concurrency-1601.02132</loc><lastmod>2016-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/possible-values-exploring-a-concept-for-concurrency-1601.02132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/possible-values-exploring-a-concept-for-concurrency-1601.02132"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-polynomial-ramsey-quantifiers-1601.02258</loc><lastmod>2020-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-polynomial-ramsey-quantifiers-1601.02258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-polynomial-ramsey-quantifiers-1601.02258"/></url>
<url><loc>https://scifaro.com/en/abs/property-checking-by-logic-relaxation-1601.02742</loc><lastmod>2016-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-checking-by-logic-relaxation-1601.02742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-checking-by-logic-relaxation-1601.02742"/></url>
<url><loc>https://scifaro.com/en/abs/checking-interval-properties-of-computations-1601.03195</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-interval-properties-of-computations-1601.03195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-interval-properties-of-computations-1601.03195"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-itl-model-checking-some-well-behaved-fragments-of-the-interval-logic-hs-1601.03202</loc><lastmod>2016-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-itl-model-checking-some-well-behaved-fragments-of-the-interval-logic-hs-1601.03202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-itl-model-checking-some-well-behaved-fragments-of-the-interval-logic-hs-1601.03202"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-lctrss-1601.03206</loc><lastmod>2016-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-lctrss-1601.03206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-lctrss-1601.03206"/></url>
<url><loc>https://scifaro.com/en/abs/type-soundness-for-path-polymorphism-1601.03271</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-soundness-for-path-polymorphism-1601.03271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-soundness-for-path-polymorphism-1601.03271"/></url>
<url><loc>https://scifaro.com/en/abs/a-constraint-satisfaction-method-for-configuring-non-local-service-interfaces-1601.03370</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constraint-satisfaction-method-for-configuring-non-local-service-interfaces-1601.03370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constraint-satisfaction-method-for-configuring-non-local-service-interfaces-1601.03370"/></url>
<url><loc>https://scifaro.com/en/abs/a-theorem-prover-for-quantum-hoare-logic-and-its-applications-1601.03835</loc><lastmod>2016-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theorem-prover-for-quantum-hoare-logic-and-its-applications-1601.03835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theorem-prover-for-quantum-hoare-logic-and-its-applications-1601.03835"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-game-semantics-1601.04147</loc><lastmod>2021-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-game-semantics-1601.04147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-game-semantics-1601.04147"/></url>
<url><loc>https://scifaro.com/en/abs/two-linearities-for-quantum-computing-in-the-lambda-calculus-1601.04294</loc><lastmod>2019-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-linearities-for-quantum-computing-in-the-lambda-calculus-1601.04294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-linearities-for-quantum-computing-in-the-lambda-calculus-1601.04294"/></url>
<url><loc>https://scifaro.com/en/abs/heterogeneous-substitution-systems-revisited-1601.04299</loc><lastmod>2023-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heterogeneous-substitution-systems-revisited-1601.04299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heterogeneous-substitution-systems-revisited-1601.04299"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-synthesis-for-quadratic-polynomial-inequalities-and-combination-with-euf-1601.04802</loc><lastmod>2016-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-synthesis-for-quadratic-polynomial-inequalities-and-combination-with-euf-1601.04802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-synthesis-for-quadratic-polynomial-inequalities-and-combination-with-euf-1601.04802"/></url>
<url><loc>https://scifaro.com/en/abs/interacting-frobenius-algebras-are-hopf-1601.04964</loc><lastmod>2016-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interacting-frobenius-algebras-are-hopf-1601.04964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interacting-frobenius-algebras-are-hopf-1601.04964"/></url>
<url><loc>https://scifaro.com/en/abs/proving-differential-privacy-via-probabilistic-couplings-1601.05047</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-differential-privacy-via-probabilistic-couplings-1601.05047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-differential-privacy-via-probabilistic-couplings-1601.05047"/></url>
<url><loc>https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-0-1601.05228</loc><lastmod>2016-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-0-1601.05228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-0-1601.05228"/></url>
<url><loc>https://scifaro.com/en/abs/game-theoretic-interpretation-of-intuitionistic-type-theory-1601.05336</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-theoretic-interpretation-of-intuitionistic-type-theory-1601.05336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-theoretic-interpretation-of-intuitionistic-type-theory-1601.05336"/></url>
<url><loc>https://scifaro.com/en/abs/coherence-for-frobenius-pseudomonoids-and-the-geometry-of-linear-proofs-1601.05372</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherence-for-frobenius-pseudomonoids-and-the-geometry-of-linear-proofs-1601.05372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherence-for-frobenius-pseudomonoids-and-the-geometry-of-linear-proofs-1601.05372"/></url>
<url><loc>https://scifaro.com/en/abs/proving-craig-and-lyndon-interpolation-using-labelled-sequent-calculi-1601.05656</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-craig-and-lyndon-interpolation-using-labelled-sequent-calculi-1601.05656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-craig-and-lyndon-interpolation-using-labelled-sequent-calculi-1601.05656"/></url>
<url><loc>https://scifaro.com/en/abs/a-bifibrational-reconstruction-of-lawvere-s-presheaf-hyperdoctrine-1601.06098</loc><lastmod>2016-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bifibrational-reconstruction-of-lawvere-s-presheaf-hyperdoctrine-1601.06098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bifibrational-reconstruction-of-lawvere-s-presheaf-hyperdoctrine-1601.06098"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-uniform-substitution-calculus-for-differential-dynamic-logic-1601.06183</loc><lastmod>2017-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-uniform-substitution-calculus-for-differential-dynamic-logic-1601.06183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-uniform-substitution-calculus-for-differential-dynamic-logic-1601.06183"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctive-probabilistic-modal-logic-is-enough-for-bisimilarity-on-reactive-probabilistic-systems-1601.06198</loc><lastmod>2016-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctive-probabilistic-modal-logic-is-enough-for-bisimilarity-on-reactive-probabilistic-systems-1601.06198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctive-probabilistic-modal-logic-is-enough-for-bisimilarity-on-reactive-probabilistic-systems-1601.06198"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-and-semantics-of-abstract-binding-trees-1601.06298</loc><lastmod>2016-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-and-semantics-of-abstract-binding-trees-1601.06298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-and-semantics-of-abstract-binding-trees-1601.06298"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-model-checking-of-linear-time-properties-based-on-generalized-possibility-measures-1601.06504</loc><lastmod>2016-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-model-checking-of-linear-time-properties-based-on-generalized-possibility-measures-1601.06504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-model-checking-of-linear-time-properties-based-on-generalized-possibility-measures-1601.06504"/></url>
<url><loc>https://scifaro.com/en/abs/interpolant-tree-automata-and-their-application-in-horn-clause-verification-1601.06521</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolant-tree-automata-and-their-application-in-horn-clause-verification-1601.06521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolant-tree-automata-and-their-application-in-horn-clause-verification-1601.06521"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-finite-algebras-edges-and-connectivity-1601.07403</loc><lastmod>2016-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-finite-algebras-edges-and-connectivity-1601.07403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-finite-algebras-edges-and-connectivity-1601.07403"/></url>
<url><loc>https://scifaro.com/en/abs/formalized-linear-algebra-over-elementary-divisor-rings-in-coq-1601.07472</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalized-linear-algebra-over-elementary-divisor-rings-in-coq-1601.07472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalized-linear-algebra-over-elementary-divisor-rings-in-coq-1601.07472"/></url>
<url><loc>https://scifaro.com/en/abs/certified-context-free-parsing-a-formalisation-of-valiant-s-algorithm-in-agda-1601.07724</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-context-free-parsing-a-formalisation-of-valiant-s-algorithm-in-agda-1601.07724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-context-free-parsing-a-formalisation-of-valiant-s-algorithm-in-agda-1601.07724"/></url>
<url><loc>https://scifaro.com/en/abs/counting-constraints-in-flat-array-fragments-1602.00458</loc><lastmod>2016-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-constraints-in-flat-array-fragments-1602.00458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-constraints-in-flat-array-fragments-1602.00458"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-problems-over-one-counter-nets-1602.00476</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-problems-over-one-counter-nets-1602.00476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-problems-over-one-counter-nets-1602.00476"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-two-dimensional-unary-vector-addition-systems-with-states-is-nl-complete-1602.00477</loc><lastmod>2016-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-two-dimensional-unary-vector-addition-systems-with-states-is-nl-complete-1602.00477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-two-dimensional-unary-vector-addition-systems-with-states-is-nl-complete-1602.00477"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-optimal-reachability-in-weighted-timed-automata-1602.00481</loc><lastmod>2016-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-optimal-reachability-in-weighted-timed-automata-1602.00481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-optimal-reachability-in-weighted-timed-automata-1602.00481"/></url>
<url><loc>https://scifaro.com/en/abs/from-mu-calculus-to-alternating-tree-automata-using-parity-games-1602.00912</loc><lastmod>2016-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-mu-calculus-to-alternating-tree-automata-using-parity-games-1602.00912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-mu-calculus-to-alternating-tree-automata-using-parity-games-1602.00912"/></url>
<url><loc>https://scifaro.com/en/abs/the-second-reactive-synthesis-competition-syntcomp-2015-1602.01171</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-second-reactive-synthesis-competition-syntcomp-2015-1602.01171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-second-reactive-synthesis-competition-syntcomp-2015-1602.01171"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-paradigm-language-for-reactive-synthesis-1602.01173</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-paradigm-language-for-reactive-synthesis-1602.01173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-paradigm-language-for-reactive-synthesis-1602.01173"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-algorithms-for-succinct-safety-games-1602.01174</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-algorithms-for-succinct-safety-games-1602.01174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-algorithms-for-succinct-safety-games-1602.01174"/></url>
<url><loc>https://scifaro.com/en/abs/specification-format-for-reactive-synthesis-problems-1602.01175</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-format-for-reactive-synthesis-problems-1602.01175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-format-for-reactive-synthesis-problems-1602.01175"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-approximations-for-epistemic-synthesis-extended-abstract-1602.01176</loc><lastmod>2016-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-approximations-for-epistemic-synthesis-extended-abstract-1602.01176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-approximations-for-epistemic-synthesis-extended-abstract-1602.01176"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semantics-of-intensionality-1602.01365</loc><lastmod>2017-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semantics-of-intensionality-1602.01365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semantics-of-intensionality-1602.01365"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-maximum-satisfiability-1602.02211</loc><lastmod>2018-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-maximum-satisfiability-1602.02211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-maximum-satisfiability-1602.02211"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-temporal-properties-using-interval-analysis-1602.02387</loc><lastmod>2016-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-temporal-properties-using-interval-analysis-1602.02387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-temporal-properties-using-interval-analysis-1602.02387"/></url>
<url><loc>https://scifaro.com/en/abs/the-imp-game-learnability-approximability-and-adversarial-learning-beyond-sigma-0-1-1602.02743</loc><lastmod>2016-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-imp-game-learnability-approximability-and-adversarial-learning-beyond-sigma-0-1-1602.02743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-imp-game-learnability-approximability-and-adversarial-learning-beyond-sigma-0-1-1602.02743"/></url>
<url><loc>https://scifaro.com/en/abs/broadcast-and-aggregation-in-bbc-1602.03592</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/broadcast-and-aggregation-in-bbc-1602.03592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/broadcast-and-aggregation-in-bbc-1602.03592"/></url>
<url><loc>https://scifaro.com/en/abs/precise-subtyping-for-synchronous-multiparty-sessions-1602.03593</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/precise-subtyping-for-synchronous-multiparty-sessions-1602.03593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/precise-subtyping-for-synchronous-multiparty-sessions-1602.03593"/></url>
<url><loc>https://scifaro.com/en/abs/retractable-contracts-1602.03595</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retractable-contracts-1602.03595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retractable-contracts-1602.03595"/></url>
<url><loc>https://scifaro.com/en/abs/a-typed-model-for-dynamic-authorizations-1602.03596</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-typed-model-for-dynamic-authorizations-1602.03596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-typed-model-for-dynamic-authorizations-1602.03596"/></url>
<url><loc>https://scifaro.com/en/abs/communicating-machines-as-a-dynamic-binding-mechanism-of-services-1602.03597</loc><lastmod>2016-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communicating-machines-as-a-dynamic-binding-mechanism-of-services-1602.03597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communicating-machines-as-a-dynamic-binding-mechanism-of-services-1602.03597"/></url>
<url><loc>https://scifaro.com/en/abs/game-theoretic-interpretation-of-type-theory-part-ii-uniqueness-of-identity-proofs-and-univalence-1602.04123</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-theoretic-interpretation-of-type-theory-part-ii-uniqueness-of-identity-proofs-and-univalence-1602.04123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-theoretic-interpretation-of-type-theory-part-ii-uniqueness-of-identity-proofs-and-univalence-1602.04123"/></url>
<url><loc>https://scifaro.com/en/abs/the-era-of-fole-superstructure-1602.04268</loc><lastmod>2023-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-era-of-fole-superstructure-1602.04268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-era-of-fole-superstructure-1602.04268"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebraic-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1602.04353</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebraic-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1602.04353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebraic-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1602.04353"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-through-typed-lambda-calculi-1602.04382</loc><lastmod>2021-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-through-typed-lambda-calculi-1602.04382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proof-search-through-typed-lambda-calculi-1602.04382"/></url>
<url><loc>https://scifaro.com/en/abs/the-independence-of-markov-s-principle-in-type-theory-1602.04530</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-independence-of-markov-s-principle-in-type-theory-1602.04530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-independence-of-markov-s-principle-in-type-theory-1602.04530"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-resolution-a-first-order-resolution-calculus-with-decision-literals-and-conflict-driven-clause-learning-1602.04568</loc><lastmod>2016-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-resolution-a-first-order-resolution-calculus-with-decision-literals-and-conflict-driven-clause-learning-1602.04568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-resolution-a-first-order-resolution-calculus-with-decision-literals-and-conflict-driven-clause-learning-1602.04568"/></url>
<url><loc>https://scifaro.com/en/abs/dual-context-calculi-for-modal-logic-1602.04860</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-context-calculi-for-modal-logic-1602.04860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-context-calculi-for-modal-logic-1602.04860"/></url>
<url><loc>https://scifaro.com/en/abs/strong-backdoors-for-linear-temporal-logic-1602.04934</loc><lastmod>2016-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-backdoors-for-linear-temporal-logic-1602.04934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-backdoors-for-linear-temporal-logic-1602.04934"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-recursion-abstraction-how-to-make-ackermann-knuth-and-conway-look-like-a-bunch-of-primitives-figuratively-speaking-1602.05010</loc><lastmod>2016-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-recursion-abstraction-how-to-make-ackermann-knuth-and-conway-look-like-a-bunch-of-primitives-figuratively-speaking-1602.05010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-recursion-abstraction-how-to-make-ackermann-knuth-and-conway-look-like-a-bunch-of-primitives-figuratively-speaking-1602.05010"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizations-of-team-logics-1602.05040</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizations-of-team-logics-1602.05040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizations-of-team-logics-1602.05040"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-faster-than-ever-1602.05113</loc><lastmod>2016-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-faster-than-ever-1602.05113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-faster-than-ever-1602.05113"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-as-a-rational-monoid-1602.05151</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-as-a-rational-monoid-1602.05151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-of-normed-bpa-processes-as-a-rational-monoid-1602.05151"/></url>
<url><loc>https://scifaro.com/en/abs/category-theoretic-semantics-for-theorem-proving-in-logic-programming-embracing-the-laxness-1602.05400</loc><lastmod>2016-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/category-theoretic-semantics-for-theorem-proving-in-logic-programming-embracing-the-laxness-1602.05400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/category-theoretic-semantics-for-theorem-proving-in-logic-programming-embracing-the-laxness-1602.05400"/></url>
<url><loc>https://scifaro.com/en/abs/lasserre-lower-bounds-and-definability-of-semidefinite-programming-1602.05409</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lasserre-lower-bounds-and-definability-of-semidefinite-programming-1602.05409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lasserre-lower-bounds-and-definability-of-semidefinite-programming-1602.05409"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-power-of-attribute-based-communication-1602.05635</loc><lastmod>2016-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-power-of-attribute-based-communication-1602.05635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-power-of-attribute-based-communication-1602.05635"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-for-union-bounds-1602.05681</loc><lastmod>2019-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-for-union-bounds-1602.05681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-for-union-bounds-1602.05681"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-satisfaction-problems-for-reducts-of-homogeneous-graphs-1602.05819</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-for-reducts-of-homogeneous-graphs-1602.05819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-for-reducts-of-homogeneous-graphs-1602.05819"/></url>
<url><loc>https://scifaro.com/en/abs/property-checking-without-inductive-invariants-1602.05829</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-checking-without-inductive-invariants-1602.05829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-checking-without-inductive-invariants-1602.05829"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-networks-of-register-protocols-under-stochastic-schedulers-1602.05928</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-networks-of-register-protocols-under-stochastic-schedulers-1602.05928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-networks-of-register-protocols-under-stochastic-schedulers-1602.05928"/></url>
<url><loc>https://scifaro.com/en/abs/de-morgan-dual-nominal-quantifiers-modelling-private-names-in-non-commutative-logic-1602.06043</loc><lastmod>2020-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/de-morgan-dual-nominal-quantifiers-modelling-private-names-in-non-commutative-logic-1602.06043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/de-morgan-dual-nominal-quantifiers-modelling-private-names-in-non-commutative-logic-1602.06043"/></url>
<url><loc>https://scifaro.com/en/abs/strong-backdoors-for-default-logic-1602.06052</loc><lastmod>2016-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-backdoors-for-default-logic-1602.06052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-backdoors-for-default-logic-1602.06052"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-s-two-kinds-of-recursion-1602.06220</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-s-two-kinds-of-recursion-1602.06220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-s-two-kinds-of-recursion-1602.06220"/></url>
<url><loc>https://scifaro.com/en/abs/endofunctors-modelling-higher-order-behaviours-1602.06221</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/endofunctors-modelling-higher-order-behaviours-1602.06221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/endofunctors-modelling-higher-order-behaviours-1602.06221"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-dependent-type-system-based-on-non-deterministic-beta-reduction-1602.06420</loc><lastmod>2016-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-dependent-type-system-based-on-non-deterministic-beta-reduction-1602.06420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-dependent-type-system-based-on-non-deterministic-beta-reduction-1602.06420"/></url>
<url><loc>https://scifaro.com/en/abs/enablers-and-inhibitors-in-causal-justifications-of-logic-programs-1602.06897</loc><lastmod>2016-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enablers-and-inhibitors-in-causal-justifications-of-logic-programs-1602.06897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enablers-and-inhibitors-in-causal-justifications-of-logic-programs-1602.06897"/></url>
<url><loc>https://scifaro.com/en/abs/level-confluence-of-3-ctrss-in-isabelle-hol-1602.07115</loc><lastmod>2016-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/level-confluence-of-3-ctrss-in-isabelle-hol-1602.07115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/level-confluence-of-3-ctrss-in-isabelle-hol-1602.07115"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-logic-for-database-abstract-state-machines-1602.07486</loc><lastmod>2017-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-logic-for-database-abstract-state-machines-1602.07486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-logic-for-database-abstract-state-machines-1602.07486"/></url>
<url><loc>https://scifaro.com/en/abs/a-topological-view-on-algebraic-computation-models-1602.08004</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-topological-view-on-algebraic-computation-models-1602.08004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-topological-view-on-algebraic-computation-models-1602.08004"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-observation-mode-scheduling-for-systems-under-temporal-constraints-1602.08260</loc><lastmod>2016-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-observation-mode-scheduling-for-systems-under-temporal-constraints-1602.08260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-observation-mode-scheduling-for-systems-under-temporal-constraints-1602.08260"/></url>
<url><loc>https://scifaro.com/en/abs/relational-lattices-via-duality-1602.08349</loc><lastmod>2016-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-lattices-via-duality-1602.08349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-lattices-via-duality-1602.08349"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-sat-with-community-structure-1602.08620</loc><lastmod>2016-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-sat-with-community-structure-1602.08620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-sat-with-community-structure-1602.08620"/></url>
<url><loc>https://scifaro.com/en/abs/proving-completeness-of-logic-programs-with-the-cut-1602.08778</loc><lastmod>2020-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-completeness-of-logic-programs-with-the-cut-1602.08778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-completeness-of-logic-programs-with-the-cut-1602.08778"/></url>
<url><loc>https://scifaro.com/en/abs/range-based-argumentation-semantics-as-2-valued-models-1602.08903</loc><lastmod>2016-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-based-argumentation-semantics-as-2-valued-models-1602.08903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-based-argumentation-semantics-as-2-valued-models-1602.08903"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-set-quantifiers-in-modal-logic-1602.08971</loc><lastmod>2016-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-set-quantifiers-in-modal-logic-1602.08971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-set-quantifiers-in-modal-logic-1602.08971"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-of-pointer-programs-revisited-1602.09061</loc><lastmod>2016-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-of-pointer-programs-revisited-1602.09061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-of-pointer-programs-revisited-1602.09061"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-eleventh-international-workshop-on-developments-in-computational-models-1603.00536</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-eleventh-international-workshop-on-developments-in-computational-models-1603.00536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-eleventh-international-workshop-on-developments-in-computational-models-1603.00536"/></url>
<url><loc>https://scifaro.com/en/abs/nesting-depth-of-operators-in-graph-database-queries-expressiveness-vs-evaluation-complexity-1603.00658</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nesting-depth-of-operators-in-graph-database-queries-expressiveness-vs-evaluation-complexity-1603.00658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nesting-depth-of-operators-in-graph-database-queries-expressiveness-vs-evaluation-complexity-1603.00658"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-conway-and-iteration-theories-1603.00838</loc><lastmod>2016-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-conway-and-iteration-theories-1603.00838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-conway-and-iteration-theories-1603.00838"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-confluence-in-pvs-1603.00975</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-confluence-in-pvs-1603.00975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-confluence-in-pvs-1603.00975"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-model-checking-of-concurrent-systems-with-petri-nets-1603.00976</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-model-checking-of-concurrent-systems-with-petri-nets-1603.00976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-model-checking-of-concurrent-systems-with-petri-nets-1603.00976"/></url>
<url><loc>https://scifaro.com/en/abs/finiteness-and-computation-in-toposes-1603.00978</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finiteness-and-computation-in-toposes-1603.00978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finiteness-and-computation-in-toposes-1603.00978"/></url>
<url><loc>https://scifaro.com/en/abs/mean-field-semantics-for-a-process-calculus-for-spatially-explicit-ecological-models-1603.00979</loc><lastmod>2016-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mean-field-semantics-for-a-process-calculus-for-spatially-explicit-ecological-models-1603.00979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mean-field-semantics-for-a-process-calculus-for-spatially-explicit-ecological-models-1603.00979"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-relational-hoare-logic-for-continuous-random-samplings-1603.01445</loc><lastmod>2016-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-relational-hoare-logic-for-continuous-random-samplings-1603.01445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-relational-hoare-logic-for-continuous-random-samplings-1603.01445"/></url>
<url><loc>https://scifaro.com/en/abs/normal-order-reduction-grammars-1603.01758</loc><lastmod>2016-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-order-reduction-grammars-1603.01758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-order-reduction-grammars-1603.01758"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-rely-guarantee-concurrency-an-algebraic-foundation-1603.01776</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-rely-guarantee-concurrency-an-algebraic-foundation-1603.01776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-rely-guarantee-concurrency-an-algebraic-foundation-1603.01776"/></url>
<url><loc>https://scifaro.com/en/abs/von-neumann-algebras-form-a-model-for-the-quantum-lambda-calculus-1603.02133</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/von-neumann-algebras-form-a-model-for-the-quantum-lambda-calculus-1603.02133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/von-neumann-algebras-form-a-model-for-the-quantum-lambda-calculus-1603.02133"/></url>
<url><loc>https://scifaro.com/en/abs/complete-elgot-monads-and-coalgebraic-resumptions-1603.02148</loc><lastmod>2016-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-elgot-monads-and-coalgebraic-resumptions-1603.02148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-elgot-monads-and-coalgebraic-resumptions-1603.02148"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-mechanized-reasoning-1603.02478</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-mechanized-reasoning-1603.02478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-mechanized-reasoning-1603.02478"/></url>
<url><loc>https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-1603.02641</loc><lastmod>2016-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-1603.02641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hybrid-linear-logic-for-constrained-transition-systems-1603.02641"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-recursive-probabilistic-programs-1603.02922</loc><lastmod>2016-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-recursive-probabilistic-programs-1603.02922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-recursive-probabilistic-programs-1603.02922"/></url>
<url><loc>https://scifaro.com/en/abs/extension-of-prism-by-synthesis-of-optimal-timeouts-in-fixed-delay-ctmc-1603.03252</loc><lastmod>2016-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-of-prism-by-synthesis-of-optimal-timeouts-in-fixed-delay-ctmc-1603.03252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-of-prism-by-synthesis-of-optimal-timeouts-in-fixed-delay-ctmc-1603.03252"/></url>
<url><loc>https://scifaro.com/en/abs/information-flow-in-logical-environments-1603.03475</loc><lastmod>2016-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-flow-in-logical-environments-1603.03475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-flow-in-logical-environments-1603.03475"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariant-types-and-their-applications-1603.04309</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariant-types-and-their-applications-1603.04309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariant-types-and-their-applications-1603.04309"/></url>
<url><loc>https://scifaro.com/en/abs/guard-your-daggers-and-traces-properties-of-guarded-co-recursion-1603.05214</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guard-your-daggers-and-traces-properties-of-guarded-co-recursion-1603.05214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guard-your-daggers-and-traces-properties-of-guarded-co-recursion-1603.05214"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-logic-with-a-between-predicate-1603.05625</loc><lastmod>2016-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-logic-with-a-between-predicate-1603.05625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-logic-with-a-between-predicate-1603.05625"/></url>
<url><loc>https://scifaro.com/en/abs/stuttering-equivalence-is-too-slow-1603.05789</loc><lastmod>2016-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stuttering-equivalence-is-too-slow-1603.05789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stuttering-equivalence-is-too-slow-1603.05789"/></url>
<url><loc>https://scifaro.com/en/abs/parity-game-reductions-1603.06422</loc><lastmod>2016-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-game-reductions-1603.06422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-game-reductions-1603.06422"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-separation-logic-in-smt-1603.06844</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-separation-logic-in-smt-1603.06844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-separation-logic-in-smt-1603.06844"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-of-graph-spectra-1603.07030</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-of-graph-spectra-1603.07030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-of-graph-spectra-1603.07030"/></url>
<url><loc>https://scifaro.com/en/abs/strong-normalizability-as-a-finiteness-structure-via-the-taylor-expansion-of-lambda-terms-1603.07218</loc><lastmod>2016-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-normalizability-as-a-finiteness-structure-via-the-taylor-expansion-of-lambda-terms-1603.07218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-normalizability-as-a-finiteness-structure-via-the-taylor-expansion-of-lambda-terms-1603.07218"/></url>
<url><loc>https://scifaro.com/en/abs/summaries-for-context-free-games-1603.07256</loc><lastmod>2016-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/summaries-for-context-free-games-1603.07256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/summaries-for-context-free-games-1603.07256"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-semantical-aspect-1603.07259</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-semantical-aspect-1603.07259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-semantical-aspect-1603.07259"/></url>
<url><loc>https://scifaro.com/en/abs/an-expressive-probabilistic-temporal-logic-1603.07453</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expressive-probabilistic-temporal-logic-1603.07453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expressive-probabilistic-temporal-logic-1603.07453"/></url>
<url><loc>https://scifaro.com/en/abs/the-method-model-elimination-of-d-w-loveland-explained-1603.07458</loc><lastmod>2016-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-method-model-elimination-of-d-w-loveland-explained-1603.07458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-method-model-elimination-of-d-w-loveland-explained-1603.07458"/></url>
<url><loc>https://scifaro.com/en/abs/a-classical-realizability-model-for-a-semantical-value-restriction-1603.07484</loc><lastmod>2016-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-classical-realizability-model-for-a-semantical-value-restriction-1603.07484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-classical-realizability-model-for-a-semantical-value-restriction-1603.07484"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-algebraic-logic-view-on-judgment-aggregation-1603.08206</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-algebraic-logic-view-on-judgment-aggregation-1603.08206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-algebraic-logic-view-on-judgment-aggregation-1603.08206"/></url>
<url><loc>https://scifaro.com/en/abs/generating-reversible-circuits-from-higher-order-functional-programs-1603.08213</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-reversible-circuits-from-higher-order-functional-programs-1603.08213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-reversible-circuits-from-higher-order-functional-programs-1603.08213"/></url>
<url><loc>https://scifaro.com/en/abs/the-sch-utzenberger-product-for-syntactic-spaces-1603.08264</loc><lastmod>2016-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sch-utzenberger-product-for-syntactic-spaces-1603.08264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sch-utzenberger-product-for-syntactic-spaces-1603.08264"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-algebraic-data-types-with-abstractions-1603.08769</loc><lastmod>2016-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-algebraic-data-types-with-abstractions-1603.08769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-algebraic-data-types-with-abstractions-1603.08769"/></url>
<url><loc>https://scifaro.com/en/abs/succinctness-of-order-invariant-logics-on-depth-bounded-structures-1603.09055</loc><lastmod>2016-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinctness-of-order-invariant-logics-on-depth-bounded-structures-1603.09055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinctness-of-order-invariant-logics-on-depth-bounded-structures-1603.09055"/></url>
<url><loc>https://scifaro.com/en/abs/studies-on-brutal-contraction-and-severe-withdrawal-preliminary-report-1603.09286</loc><lastmod>2016-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/studies-on-brutal-contraction-and-severe-withdrawal-preliminary-report-1603.09286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/studies-on-brutal-contraction-and-severe-withdrawal-preliminary-report-1603.09286"/></url>
<url><loc>https://scifaro.com/en/abs/building-the-signature-of-set-theory-using-the-mathsem-program-1603.09488</loc><lastmod>2016-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-the-signature-of-set-theory-using-the-mathsem-program-1603.09488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-the-signature-of-set-theory-using-the-mathsem-program-1603.09488"/></url>
<url><loc>https://scifaro.com/en/abs/computable-dyadic-subbases-and-mathbf-t-omega-representations-of-compact-sets-1604.00258</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-dyadic-subbases-and-mathbf-t-omega-representations-of-compact-sets-1604.00258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-dyadic-subbases-and-mathbf-t-omega-representations-of-compact-sets-1604.00258"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-feature-mu-calculus-targeting-spl-verification-1604.00350</loc><lastmod>2016-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-feature-mu-calculus-targeting-spl-verification-1604.00350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-feature-mu-calculus-targeting-spl-verification-1604.00350"/></url>
<url><loc>https://scifaro.com/en/abs/improving-sat-solvers-via-blocked-clause-decomposition-1604.00536</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-sat-solvers-via-blocked-clause-decomposition-1604.00536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-sat-solvers-via-blocked-clause-decomposition-1604.00536"/></url>
<url><loc>https://scifaro.com/en/abs/structural-multi-type-sequent-calculus-for-inquisitive-logic-1604.00936</loc><lastmod>2016-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-multi-type-sequent-calculus-for-inquisitive-logic-1604.00936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-multi-type-sequent-calculus-for-inquisitive-logic-1604.00936"/></url>
<url><loc>https://scifaro.com/en/abs/variations-on-noetherianness-1604.01186</loc><lastmod>2016-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-on-noetherianness-1604.01186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-on-noetherianness-1604.01186"/></url>
<url><loc>https://scifaro.com/en/abs/directed-containers-as-categories-1604.01187</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-containers-as-categories-1604.01187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-containers-as-categories-1604.01187"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-uniform-one-dimensional-fragment-1604.01673</loc><lastmod>2023-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-uniform-one-dimensional-fragment-1604.01673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-uniform-one-dimensional-fragment-1604.01673"/></url>
<url><loc>https://scifaro.com/en/abs/practical-subtyping-for-system-f-with-sized-co-induction-1604.01990</loc><lastmod>2017-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-subtyping-for-system-f-with-sized-co-induction-1604.01990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-subtyping-for-system-f-with-sized-co-induction-1604.01990"/></url>
<url><loc>https://scifaro.com/en/abs/inhabitation-in-simply-typed-lambda-calculus-through-a-lambda-calculus-for-proof-search-1604.02086</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inhabitation-in-simply-typed-lambda-calculus-through-a-lambda-calculus-for-proof-search-1604.02086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inhabitation-in-simply-typed-lambda-calculus-through-a-lambda-calculus-for-proof-search-1604.02086"/></url>
<url><loc>https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-1-1604.02284</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-1-1604.02284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-high-level-ltl-synthesis-format-tlsf-v1-1-1604.02284"/></url>
<url><loc>https://scifaro.com/en/abs/an-extensible-formal-semantics-for-uml-activity-diagrams-1604.02386</loc><lastmod>2016-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extensible-formal-semantics-for-uml-activity-diagrams-1604.02386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extensible-formal-semantics-for-uml-activity-diagrams-1604.02386"/></url>
<url><loc>https://scifaro.com/en/abs/information-processes-and-games-1604.02603</loc><lastmod>2016-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-processes-and-games-1604.02603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-processes-and-games-1604.02603"/></url>
<url><loc>https://scifaro.com/en/abs/multi-diagrams-of-relations-between-fuzzy-sets-weighted-limits-colimits-and-commutativity-1604.02784</loc><lastmod>2016-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-diagrams-of-relations-between-fuzzy-sets-weighted-limits-colimits-and-commutativity-1604.02784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-diagrams-of-relations-between-fuzzy-sets-weighted-limits-colimits-and-commutativity-1604.02784"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-semiotics-1604.02790</loc><lastmod>2016-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-semiotics-1604.02790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-semiotics-1604.02790"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-data-repetitions-with-counter-systems-1604.02887</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-data-repetitions-with-counter-systems-1604.02887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-data-repetitions-with-counter-systems-1604.02887"/></url>
<url><loc>https://scifaro.com/en/abs/patterns-on-data-described-by-vague-limits-vague-colimits-and-vague-commutativity-1604.03098</loc><lastmod>2016-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patterns-on-data-described-by-vague-limits-vague-colimits-and-vague-commutativity-1604.03098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patterns-on-data-described-by-vague-limits-vague-colimits-and-vague-commutativity-1604.03098"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-assumptions-for-synthesis-1604.03471</loc><lastmod>2016-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-assumptions-for-synthesis-1604.03471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-assumptions-for-synthesis-1604.03471"/></url>
<url><loc>https://scifaro.com/en/abs/horn-fragments-of-the-halpern-shoham-interval-temporal-logic-technical-report-1604.03515</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-fragments-of-the-halpern-shoham-interval-temporal-logic-technical-report-1604.03515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-fragments-of-the-halpern-shoham-interval-temporal-logic-technical-report-1604.03515"/></url>
<url><loc>https://scifaro.com/en/abs/hordeqbf-a-modular-and-massively-parallel-qbf-solver-1604.03793</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hordeqbf-a-modular-and-massively-parallel-qbf-solver-1604.03793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hordeqbf-a-modular-and-massively-parallel-qbf-solver-1604.03793"/></url>
<url><loc>https://scifaro.com/en/abs/extending-homotopy-type-theory-with-strict-equality-1604.03799</loc><lastmod>2016-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-homotopy-type-theory-with-strict-equality-1604.03799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-homotopy-type-theory-with-strict-equality-1604.03799"/></url>
<url><loc>https://scifaro.com/en/abs/a-traditional-tree-style-tableau-for-ltl-1604.03962</loc><lastmod>2016-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-traditional-tree-style-tableau-for-ltl-1604.03962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-traditional-tree-style-tableau-for-ltl-1604.03962"/></url>
<url><loc>https://scifaro.com/en/abs/operational-semantics-of-resolution-and-productivity-in-horn-clause-logic-1604.04114</loc><lastmod>2016-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operational-semantics-of-resolution-and-productivity-in-horn-clause-logic-1604.04114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operational-semantics-of-resolution-and-productivity-in-horn-clause-logic-1604.04114"/></url>
<url><loc>https://scifaro.com/en/abs/query-based-entailment-and-inseparability-for-alc-ontologies-full-version-1604.04164</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-based-entailment-and-inseparability-for-alc-ontologies-full-version-1604.04164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-based-entailment-and-inseparability-for-alc-ontologies-full-version-1604.04164"/></url>
<url><loc>https://scifaro.com/en/abs/topological-self-stabilization-with-name-passing-process-calculi-1604.04197</loc><lastmod>2016-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-self-stabilization-with-name-passing-process-calculi-1604.04197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-self-stabilization-with-name-passing-process-calculi-1604.04197"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-method-of-verification-of-functional-programs-1604.04240</loc><lastmod>2016-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-method-of-verification-of-functional-programs-1604.04240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-method-of-verification-of-functional-programs-1604.04240"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-analog-algorithms-1604.04295</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-analog-algorithms-1604.04295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-analog-algorithms-1604.04295"/></url>
<url><loc>https://scifaro.com/en/abs/some-closed-classes-of-three-valued-logic-generated-by-periodic-symmetric-functions-1604.04344</loc><lastmod>2016-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-closed-classes-of-three-valued-logic-generated-by-periodic-symmetric-functions-1604.04344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-closed-classes-of-three-valued-logic-generated-by-periodic-symmetric-functions-1604.04344"/></url>
<url><loc>https://scifaro.com/en/abs/expected-reachability-time-games-1604.04435</loc><lastmod>2016-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expected-reachability-time-games-1604.04435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expected-reachability-time-games-1604.04435"/></url>
<url><loc>https://scifaro.com/en/abs/proof-relevant-pi-calculus-a-constructive-account-of-concurrency-and-causality-1604.04575</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-relevant-pi-calculus-a-constructive-account-of-concurrency-and-causality-1604.04575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-relevant-pi-calculus-a-constructive-account-of-concurrency-and-causality-1604.04575"/></url>
<url><loc>https://scifaro.com/en/abs/from-dynamic-to-static-semantics-quantitatively-1604.05047</loc><lastmod>2016-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-dynamic-to-static-semantics-quantitatively-1604.05047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-dynamic-to-static-semantics-quantitatively-1604.05047"/></url>
<url><loc>https://scifaro.com/en/abs/theoretically-optimal-datalog-rewritings-for-owl-2-ql-ontology-mediated-queries-1604.05258</loc><lastmod>2016-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theoretically-optimal-datalog-rewritings-for-owl-2-ql-ontology-mediated-queries-1604.05258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theoretically-optimal-datalog-rewritings-for-owl-2-ql-ontology-mediated-queries-1604.05258"/></url>
<url><loc>https://scifaro.com/en/abs/easy-to-win-hard-to-master-optimal-strategies-in-parity-games-with-costs-1604.05543</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/easy-to-win-hard-to-master-optimal-strategies-in-parity-games-with-costs-1604.05543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/easy-to-win-hard-to-master-optimal-strategies-in-parity-games-with-costs-1604.05543"/></url>
<url><loc>https://scifaro.com/en/abs/a-safety-and-liveness-theory-for-total-reversibility-extended-abstract-1604.05555</loc><lastmod>2016-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-safety-and-liveness-theory-for-total-reversibility-extended-abstract-1604.05555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-safety-and-liveness-theory-for-total-reversibility-extended-abstract-1604.05555"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-decidable-1604.05843</loc><lastmod>2016-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-decidable-1604.05843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-decidable-1604.05843"/></url>
<url><loc>https://scifaro.com/en/abs/q-resolution-with-generalized-axioms-1604.05994</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/q-resolution-with-generalized-axioms-1604.05994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/q-resolution-with-generalized-axioms-1604.05994"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-logic-with-counting-and-a-linear-order-1604.06038</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-logic-with-counting-and-a-linear-order-1604.06038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-logic-with-counting-and-a-linear-order-1604.06038"/></url>
<url><loc>https://scifaro.com/en/abs/xpl-an-extended-probabilistic-logic-for-probabilistic-transition-systems-1604.06118</loc><lastmod>2017-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/xpl-an-extended-probabilistic-logic-for-probabilistic-transition-systems-1604.06118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/xpl-an-extended-probabilistic-logic-for-probabilistic-transition-systems-1604.06118"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-lynch-morawska-systems-1604.06139</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-lynch-morawska-systems-1604.06139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-lynch-morawska-systems-1604.06139"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-based-methods-for-reactive-synthesis-from-safety-specifications-1604.06204</loc><lastmod>2016-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-based-methods-for-reactive-synthesis-from-safety-specifications-1604.06204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-based-methods-for-reactive-synthesis-from-safety-specifications-1604.06204"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-information-stochastic-games-with-generalized-mean-payoff-objectives-1604.06376</loc><lastmod>2016-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-information-stochastic-games-with-generalized-mean-payoff-objectives-1604.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-information-stochastic-games-with-generalized-mean-payoff-objectives-1604.06376"/></url>
<url><loc>https://scifaro.com/en/abs/computation-tree-logic-for-synchronization-properties-1604.06384</loc><lastmod>2016-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-tree-logic-for-synchronization-properties-1604.06384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-tree-logic-for-synchronization-properties-1604.06384"/></url>
<url><loc>https://scifaro.com/en/abs/stability-in-graphs-and-games-1604.06386</loc><lastmod>2016-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-in-graphs-and-games-1604.06386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-in-graphs-and-games-1604.06386"/></url>
<url><loc>https://scifaro.com/en/abs/on-stronger-calculi-for-qbfs-1604.06483</loc><lastmod>2016-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-stronger-calculi-for-qbfs-1604.06483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-stronger-calculi-for-qbfs-1604.06483"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-branching-time-spectrum-for-behavioral-specification-theories-1604.06503</loc><lastmod>2019-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-branching-time-spectrum-for-behavioral-specification-theories-1604.06503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-branching-time-spectrum-for-behavioral-specification-theories-1604.06503"/></url>
<url><loc>https://scifaro.com/en/abs/lynch-morawska-systems-on-strings-1604.06509</loc><lastmod>2016-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lynch-morawska-systems-on-strings-1604.06509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lynch-morawska-systems-on-strings-1604.06509"/></url>
<url><loc>https://scifaro.com/en/abs/generating-concurrency-checks-automatically-1604.06747</loc><lastmod>2016-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-concurrency-checks-automatically-1604.06747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-concurrency-checks-automatically-1604.06747"/></url>
<url><loc>https://scifaro.com/en/abs/solving-qbf-by-abstraction-1604.06752</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-qbf-by-abstraction-1604.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-qbf-by-abstraction-1604.06752"/></url>
<url><loc>https://scifaro.com/en/abs/linear-depth-increase-of-lambda-terms-along-leftmost-outermost-beta-reduction-1604.07030</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-depth-increase-of-lambda-terms-along-leftmost-outermost-beta-reduction-1604.07030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-depth-increase-of-lambda-terms-along-leftmost-outermost-beta-reduction-1604.07030"/></url>
<url><loc>https://scifaro.com/en/abs/divide-and-congruence-ii-from-decomposition-of-modal-formulas-to-preservation-of-delay-and-weak-bisimilarity-1604.07530</loc><lastmod>2017-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/divide-and-congruence-ii-from-decomposition-of-modal-formulas-to-preservation-of-delay-and-weak-bisimilarity-1604.07530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/divide-and-congruence-ii-from-decomposition-of-modal-formulas-to-preservation-of-delay-and-weak-bisimilarity-1604.07530"/></url>
<url><loc>https://scifaro.com/en/abs/finding-finite-models-in-multi-sorted-first-order-logic-1604.08040</loc><lastmod>2016-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-finite-models-in-multi-sorted-first-order-logic-1604.08040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-finite-models-in-multi-sorted-first-order-logic-1604.08040"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-qbf-resolution-calculi-to-dqbf-1604.08058</loc><lastmod>2016-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-qbf-resolution-calculi-to-dqbf-1604.08058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-qbf-resolution-calculi-to-dqbf-1604.08058"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-data-structures-linked-in-time-1604.08080</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-data-structures-linked-in-time-1604.08080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-data-structures-linked-in-time-1604.08080"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-lambda-calculi-from-a-linear-perspective-long-version-1604.08248</loc><lastmod>2016-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-lambda-calculi-from-a-linear-perspective-long-version-1604.08248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-lambda-calculi-from-a-linear-perspective-long-version-1604.08248"/></url>
<url><loc>https://scifaro.com/en/abs/advances-in-property-based-testing-for-alpha-prolog-1604.08345</loc><lastmod>2016-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advances-in-property-based-testing-for-alpha-prolog-1604.08345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advances-in-property-based-testing-for-alpha-prolog-1604.08345"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-algebraic-structure-of-weihrauch-degrees-1604.08348</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-algebraic-structure-of-weihrauch-degrees-1604.08348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-algebraic-structure-of-weihrauch-degrees-1604.08348"/></url>
<url><loc>https://scifaro.com/en/abs/no-solvable-lambda-value-term-left-behind-1604.08383</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-solvable-lambda-value-term-left-behind-1604.08383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-solvable-lambda-value-term-left-behind-1604.08383"/></url>
<url><loc>https://scifaro.com/en/abs/computational-higher-type-theory-i-abstract-cubical-realizability-1604.08873</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-higher-type-theory-i-abstract-cubical-realizability-1604.08873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-higher-type-theory-i-abstract-cubical-realizability-1604.08873"/></url>
<url><loc>https://scifaro.com/en/abs/healthiness-from-duality-1605.00381</loc><lastmod>2016-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/healthiness-from-duality-1605.00381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/healthiness-from-duality-1605.00381"/></url>
<url><loc>https://scifaro.com/en/abs/markov-chains-and-unambiguous-automata-1605.00950</loc><lastmod>2023-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markov-chains-and-unambiguous-automata-1605.00950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markov-chains-and-unambiguous-automata-1605.00950"/></url>
<url><loc>https://scifaro.com/en/abs/the-completeness-problem-for-modal-logic-1605.01004</loc><lastmod>2017-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-completeness-problem-for-modal-logic-1605.01004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-completeness-problem-for-modal-logic-1605.01004"/></url>
<url><loc>https://scifaro.com/en/abs/dualized-simple-type-theory-1605.01083</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dualized-simple-type-theory-1605.01083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dualized-simple-type-theory-1605.01083"/></url>
<url><loc>https://scifaro.com/en/abs/structural-synthesis-for-gxw-specifications-1605.01153</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-synthesis-for-gxw-specifications-1605.01153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-synthesis-for-gxw-specifications-1605.01153"/></url>
<url><loc>https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-graphs-with-excluded-topological-subgraphs-1605.01198</loc><lastmod>2016-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-graphs-with-excluded-topological-subgraphs-1605.01198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-graphs-with-excluded-topological-subgraphs-1605.01198"/></url>
<url><loc>https://scifaro.com/en/abs/non-homogenizable-classes-of-finite-structures-1605.01199</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-homogenizable-classes-of-finite-structures-1605.01199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-homogenizable-classes-of-finite-structures-1605.01199"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-cycle-synthesis-1605.01511</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-cycle-synthesis-1605.01511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-cycle-synthesis-1605.01511"/></url>
<url><loc>https://scifaro.com/en/abs/improving-abcdsat-by-at-least-one-recently-used-clause-management-strategy-1605.01622</loc><lastmod>2016-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-abcdsat-by-at-least-one-recently-used-clause-management-strategy-1605.01622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-abcdsat-by-at-least-one-recently-used-clause-management-strategy-1605.01622"/></url>
<url><loc>https://scifaro.com/en/abs/from-sazonov-s-non-dcpo-natural-domains-to-closed-directed-lub-partial-orders-1605.01886</loc><lastmod>2016-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-sazonov-s-non-dcpo-natural-domains-to-closed-directed-lub-partial-orders-1605.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-sazonov-s-non-dcpo-natural-domains-to-closed-directed-lub-partial-orders-1605.01886"/></url>
<url><loc>https://scifaro.com/en/abs/stateless-model-checking-for-power-1605.02185</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateless-model-checking-for-power-1605.02185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateless-model-checking-for-power-1605.02185"/></url>
<url><loc>https://scifaro.com/en/abs/type-theory-based-on-dependent-inductive-and-coinductive-types-1605.02206</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theory-based-on-dependent-inductive-and-coinductive-types-1605.02206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theory-based-on-dependent-inductive-and-coinductive-types-1605.02206"/></url>
<url><loc>https://scifaro.com/en/abs/proving-liveness-of-parameterized-programs-1605.02350</loc><lastmod>2016-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-liveness-of-parameterized-programs-1605.02350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-liveness-of-parameterized-programs-1605.02350"/></url>
<url><loc>https://scifaro.com/en/abs/definability-equals-recognizability-for-graphs-of-bounded-treewidth-1605.03045</loc><lastmod>2016-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definability-equals-recognizability-for-graphs-of-bounded-treewidth-1605.03045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definability-equals-recognizability-for-graphs-of-bounded-treewidth-1605.03045"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanization-of-the-blakers-massey-connectivity-theorem-in-homotopy-type-theory-1605.03227</loc><lastmod>2016-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanization-of-the-blakers-massey-connectivity-theorem-in-homotopy-type-theory-1605.03227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanization-of-the-blakers-massey-connectivity-theorem-in-homotopy-type-theory-1605.03227"/></url>
<url><loc>https://scifaro.com/en/abs/upper-bounds-on-the-quantifier-depth-for-graph-differentiation-in-first-order-logic-1605.03480</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-bounds-on-the-quantifier-depth-for-graph-differentiation-in-first-order-logic-1605.03480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-bounds-on-the-quantifier-depth-for-graph-differentiation-in-first-order-logic-1605.03480"/></url>
<url><loc>https://scifaro.com/en/abs/the-largest-respectful-function-1605.04136</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-largest-respectful-function-1605.04136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-largest-respectful-function-1605.04136"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizations-for-downward-xpath-on-data-trees-1605.04271</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizations-for-downward-xpath-on-data-trees-1605.04271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizations-for-downward-xpath-on-data-trees-1605.04271"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-synthesis-algorithm-for-parametric-markov-chains-against-linear-time-properties-1605.04400</loc><lastmod>2016-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-synthesis-algorithm-for-parametric-markov-chains-against-linear-time-properties-1605.04400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-synthesis-algorithm-for-parametric-markov-chains-against-linear-time-properties-1605.04400"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modelling-testing-and-verification-of-hsa-memory-models-using-event-b-1605.04744</loc><lastmod>2016-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modelling-testing-and-verification-of-hsa-memory-models-using-event-b-1605.04744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modelling-testing-and-verification-of-hsa-memory-models-using-event-b-1605.04744"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-higher-order-quantum-computation-via-geometry-of-interaction-1605.05079</loc><lastmod>2016-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-higher-order-quantum-computation-via-geometry-of-interaction-1605.05079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-higher-order-quantum-computation-via-geometry-of-interaction-1605.05079"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-program-slicing-an-abstract-interpretation-based-approach-to-program-slicing-1605.05104</loc><lastmod>2016-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-program-slicing-an-abstract-interpretation-based-approach-to-program-slicing-1605.05104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-program-slicing-an-abstract-interpretation-based-approach-to-program-slicing-1605.05104"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-time-and-cost-bounded-probabilistic-model-checking-1605.05551</loc><lastmod>2016-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-time-and-cost-bounded-probabilistic-model-checking-1605.05551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-time-and-cost-bounded-probabilistic-model-checking-1605.05551"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-models-of-integer-manipulating-programs-with-recursive-parallelism-technical-report-1605.06868</loc><lastmod>2016-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-models-of-integer-manipulating-programs-with-recursive-parallelism-technical-report-1605.06868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-models-of-integer-manipulating-programs-with-recursive-parallelism-technical-report-1605.06868"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-higher-order-goals-from-the-mizar-mathematical-library-1605.06996</loc><lastmod>2016-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-higher-order-goals-from-the-mizar-mathematical-library-1605.06996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-higher-order-goals-from-the-mizar-mathematical-library-1605.06996"/></url>
<url><loc>https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-syntax-and-semantics-1605.07068</loc><lastmod>2016-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-syntax-and-semantics-1605.07068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-syntax-and-semantics-1605.07068"/></url>
<url><loc>https://scifaro.com/en/abs/auto2-a-saturation-based-heuristic-prover-for-higher-order-logic-1605.07577</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/auto2-a-saturation-based-heuristic-prover-for-higher-order-logic-1605.07577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/auto2-a-saturation-based-heuristic-prover-for-higher-order-logic-1605.07577"/></url>
<url><loc>https://scifaro.com/en/abs/projections-for-infinitary-rewriting-1605.07808</loc><lastmod>2016-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/projections-for-infinitary-rewriting-1605.07808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/projections-for-infinitary-rewriting-1605.07808"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-pre-and-post-deployment-verification-techniques-1605.08096</loc><lastmod>2016-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-pre-and-post-deployment-verification-techniques-1605.08096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-pre-and-post-deployment-verification-techniques-1605.08096"/></url>
<url><loc>https://scifaro.com/en/abs/the-many-worlds-of-modal-lambda-calculi-i-curry-howard-for-necessity-possibility-and-time-1605.08106</loc><lastmod>2016-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-many-worlds-of-modal-lambda-calculi-i-curry-howard-for-necessity-possibility-and-time-1605.08106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-many-worlds-of-modal-lambda-calculi-i-curry-howard-for-necessity-possibility-and-time-1605.08106"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-local-inference-for-contextuality-in-quantum-physics-and-beyond-1605.08949</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-local-inference-for-contextuality-in-quantum-physics-and-beyond-1605.08949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-local-inference-for-contextuality-in-quantum-physics-and-beyond-1605.08949"/></url>
<url><loc>https://scifaro.com/en/abs/internal-guidance-for-satallax-1605.09293</loc><lastmod>2016-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-guidance-for-satallax-1605.09293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-guidance-for-satallax-1605.09293"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-a-theory-of-strings-linear-arithmetic-over-length-and-string-number-conversion-1605.09442</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-a-theory-of-strings-linear-arithmetic-over-length-and-string-number-conversion-1605.09442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-a-theory-of-strings-linear-arithmetic-over-length-and-string-number-conversion-1605.09442"/></url>
<url><loc>https://scifaro.com/en/abs/a-solver-for-a-theory-of-strings-and-bit-vectors-1605.09446</loc><lastmod>2016-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-solver-for-a-theory-of-strings-and-bit-vectors-1605.09446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-solver-for-a-theory-of-strings-and-bit-vectors-1605.09446"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-analysis-algorithms-for-free-choice-probabilistic-workflow-nets-1606.00175</loc><lastmod>2016-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-analysis-algorithms-for-free-choice-probabilistic-workflow-nets-1606.00175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-analysis-algorithms-for-free-choice-probabilistic-workflow-nets-1606.00175"/></url>
<url><loc>https://scifaro.com/en/abs/relational-type-checking-for-mell-proof-structures-part-1-multiplicatives-1606.00280</loc><lastmod>2016-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-type-checking-for-mell-proof-structures-part-1-multiplicatives-1606.00280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-type-checking-for-mell-proof-structures-part-1-multiplicatives-1606.00280"/></url>
<url><loc>https://scifaro.com/en/abs/preliminary-results-towards-contract-monitorability-1606.00506</loc><lastmod>2016-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preliminary-results-towards-contract-monitorability-1606.00506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preliminary-results-towards-contract-monitorability-1606.00506"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-a-co-algebraic-approach-1606.01014</loc><lastmod>2016-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-a-co-algebraic-approach-1606.01014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-a-co-algebraic-approach-1606.01014"/></url>
<url><loc>https://scifaro.com/en/abs/tripartite-unions-1606.01148</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tripartite-unions-1606.01148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tripartite-unions-1606.01148"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-refinement-1606.01344</loc><lastmod>2016-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-refinement-1606.01344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-refinement-1606.01344"/></url>
<url><loc>https://scifaro.com/en/abs/liveness-of-randomised-parameterised-systems-under-arbitrary-schedulers-technical-report-1606.01451</loc><lastmod>2016-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/liveness-of-randomised-parameterised-systems-under-arbitrary-schedulers-technical-report-1606.01451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/liveness-of-randomised-parameterised-systems-under-arbitrary-schedulers-technical-report-1606.01451"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-differential-linear-logic-proof-nets-models-and-antiderivatives-1606.01642</loc><lastmod>2016-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-differential-linear-logic-proof-nets-models-and-antiderivatives-1606.01642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-differential-linear-logic-proof-nets-models-and-antiderivatives-1606.01642"/></url>
<url><loc>https://scifaro.com/en/abs/proof-nets-for-the-displacement-calculus-1606.01720</loc><lastmod>2016-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-nets-for-the-displacement-calculus-1606.01720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-nets-for-the-displacement-calculus-1606.01720"/></url>
<url><loc>https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-1606.01831</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-1606.01831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-1606.01831"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-theories-of-mobile-channels-1606.02018</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-theories-of-mobile-channels-1606.02018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-theories-of-mobile-channels-1606.02018"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-n-dimensional-hierarchical-refinement-1606.02019</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-n-dimensional-hierarchical-refinement-1606.02019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-n-dimensional-hierarchical-refinement-1606.02019"/></url>
<url><loc>https://scifaro.com/en/abs/program-derivation-by-correctness-enhacements-1606.02020</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-derivation-by-correctness-enhacements-1606.02020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-derivation-by-correctness-enhacements-1606.02020"/></url>
<url><loc>https://scifaro.com/en/abs/scj-circus-a-refinement-oriented-formal-notation-for-safety-critical-java-1606.02021</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scj-circus-a-refinement-oriented-formal-notation-for-safety-critical-java-1606.02021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scj-circus-a-refinement-oriented-formal-notation-for-safety-critical-java-1606.02021"/></url>
<url><loc>https://scifaro.com/en/abs/towards-linking-correctness-conditions-for-concurrent-objects-and-contextual-trace-refinement-1606.02023</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-linking-correctness-conditions-for-concurrent-objects-and-contextual-trace-refinement-1606.02023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-linking-correctness-conditions-for-concurrent-objects-and-contextual-trace-refinement-1606.02023"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-service-dependency-1606.02024</loc><lastmod>2016-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-service-dependency-1606.02024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-service-dependency-1606.02024"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-flat-freeze-ltl-on-one-counter-automata-1606.02643</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-flat-freeze-ltl-on-one-counter-automata-1606.02643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-flat-freeze-ltl-on-one-counter-automata-1606.02643"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-strategy-language-and-proof-script-generation-for-isabelle-hol-1606.02941</loc><lastmod>2017-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-strategy-language-and-proof-script-generation-for-isabelle-hol-1606.02941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-strategy-language-and-proof-script-generation-for-isabelle-hol-1606.02941"/></url>
<url><loc>https://scifaro.com/en/abs/calculi-for-intuitionistic-normal-modal-logic-1606.03180</loc><lastmod>2016-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculi-for-intuitionistic-normal-modal-logic-1606.03180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculi-for-intuitionistic-normal-modal-logic-1606.03180"/></url>
<url><loc>https://scifaro.com/en/abs/a-timed-process-algebra-for-wireless-networks-1606.03663</loc><lastmod>2016-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-timed-process-algebra-for-wireless-networks-1606.03663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-timed-process-algebra-for-wireless-networks-1606.03663"/></url>
<url><loc>https://scifaro.com/en/abs/extending-e-prover-with-similarity-based-clause-selection-strategies-1606.03888</loc><lastmod>2016-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-e-prover-with-similarity-based-clause-selection-strategies-1606.03888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-e-prover-with-similarity-based-clause-selection-strategies-1606.03888"/></url>
<url><loc>https://scifaro.com/en/abs/it-ain-t-necessarily-so-basic-sequent-systems-for-negative-modalities-1606.04006</loc><lastmod>2016-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-ain-t-necessarily-so-basic-sequent-systems-for-negative-modalities-1606.04006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-ain-t-necessarily-so-basic-sequent-systems-for-negative-modalities-1606.04006"/></url>
<url><loc>https://scifaro.com/en/abs/dividing-by-zero-how-bad-is-it-really-1606.04126</loc><lastmod>2016-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dividing-by-zero-how-bad-is-it-really-1606.04126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dividing-by-zero-how-bad-is-it-really-1606.04126"/></url>
<url><loc>https://scifaro.com/en/abs/fair-simulation-for-nondeterministic-and-probabilistic-buechi-automata-a-coalgebraic-perspective-1606.04680</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-simulation-for-nondeterministic-and-probabilistic-buechi-automata-a-coalgebraic-perspective-1606.04680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-simulation-for-nondeterministic-and-probabilistic-buechi-automata-a-coalgebraic-perspective-1606.04680"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-satisfiability-modulo-theory-1606.04786</loc><lastmod>2016-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-satisfiability-modulo-theory-1606.04786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-satisfiability-modulo-theory-1606.04786"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-cubical-type-theory-path-equality-for-guarded-recursion-1606.05223</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-cubical-type-theory-path-equality-for-guarded-recursion-1606.05223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-cubical-type-theory-path-equality-for-guarded-recursion-1606.05223"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-international-workshop-on-hammers-for-type-theories-1606.05427</loc><lastmod>2016-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-hammers-for-type-theories-1606.05427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-international-workshop-on-hammers-for-type-theories-1606.05427"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-verification-of-concurrent-programs-over-tso-memory-model-1606.05435</loc><lastmod>2016-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-verification-of-concurrent-programs-over-tso-memory-model-1606.05435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-verification-of-concurrent-programs-over-tso-memory-model-1606.05435"/></url>
<url><loc>https://scifaro.com/en/abs/homogeneous-equations-of-algebraic-petri-nets-1606.05490</loc><lastmod>2016-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homogeneous-equations-of-algebraic-petri-nets-1606.05490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homogeneous-equations-of-algebraic-petri-nets-1606.05490"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-classical-logic-and-computation-1606.05820</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-classical-logic-and-computation-1606.05820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-classical-logic-and-computation-1606.05820"/></url>
<url><loc>https://scifaro.com/en/abs/secure-multiparty-sessions-with-topics-1606.05936</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/secure-multiparty-sessions-with-topics-1606.05936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/secure-multiparty-sessions-with-topics-1606.05936"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-monitors-for-self-adaptive-sessions-1606.05938</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-monitors-for-self-adaptive-sessions-1606.05938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-monitors-for-self-adaptive-sessions-1606.05938"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-sessions-using-monitors-1606.05941</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-sessions-using-monitors-1606.05941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-sessions-using-monitors-1606.05941"/></url>
<url><loc>https://scifaro.com/en/abs/future-based-static-analysis-of-message-passing-programs-1606.05942</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/future-based-static-analysis-of-message-passing-programs-1606.05942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/future-based-static-analysis-of-message-passing-programs-1606.05942"/></url>
<url><loc>https://scifaro.com/en/abs/extending-nunchaku-to-dependent-type-theory-1606.05945</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-nunchaku-to-dependent-type-theory-1606.05945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-nunchaku-to-dependent-type-theory-1606.05945"/></url>
<url><loc>https://scifaro.com/en/abs/goal-translation-for-a-hammer-for-coq-extended-abstract-1606.05946</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goal-translation-for-a-hammer-for-coq-extended-abstract-1606.05946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goal-translation-for-a-hammer-for-coq-extended-abstract-1606.05946"/></url>
<url><loc>https://scifaro.com/en/abs/extending-smtcoq-a-certified-checker-for-smt-extended-abstract-1606.05947</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-smtcoq-a-certified-checker-for-smt-extended-abstract-1606.05947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-smtcoq-a-certified-checker-for-smt-extended-abstract-1606.05947"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-integration-of-an-intuitionistic-first-order-prover-into-coq-1606.05948</loc><lastmod>2016-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-integration-of-an-intuitionistic-first-order-prover-into-coq-1606.05948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-integration-of-an-intuitionistic-first-order-prover-into-coq-1606.05948"/></url>
<url><loc>https://scifaro.com/en/abs/founded-semantics-and-constraint-semantics-of-logic-rules-1606.06269</loc><lastmod>2021-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/founded-semantics-and-constraint-semantics-of-logic-rules-1606.06269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/founded-semantics-and-constraint-semantics-of-logic-rules-1606.06269"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-abstract-machine-for-functional-coroutines-1606.06376</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-abstract-machine-for-functional-coroutines-1606.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-abstract-machine-for-functional-coroutines-1606.06376"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-herbrand-content-of-lk-1606.06384</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-herbrand-content-of-lk-1606.06384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-herbrand-content-of-lk-1606.06384"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-of-the-simplified-lambda-mu-calculus-and-a-new-deduction-system-of-classical-type-theory-1606.06385</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-of-the-simplified-lambda-mu-calculus-and-a-new-deduction-system-of-classical-type-theory-1606.06385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-of-the-simplified-lambda-mu-calculus-and-a-new-deduction-system-of-classical-type-theory-1606.06385"/></url>
<url><loc>https://scifaro.com/en/abs/the-computational-content-of-nonstandard-analysis-1606.06386</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computational-content-of-nonstandard-analysis-1606.06386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computational-content-of-nonstandard-analysis-1606.06386"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-strong-normalization-in-classical-natural-deduction-1606.06387</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-strong-normalization-in-classical-natural-deduction-1606.06387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-strong-normalization-in-classical-natural-deduction-1606.06387"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-true-concurrency-and-its-logic-1606.06422</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-true-concurrency-and-its-logic-1606.06422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-true-concurrency-and-its-logic-1606.06422"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariance-on-decomposable-structures-1606.06557</loc><lastmod>2016-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariance-on-decomposable-structures-1606.06557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariance-on-decomposable-structures-1606.06557"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-calculus-representations-for-quantum-circuits-1606.06799</loc><lastmod>2016-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-calculus-representations-for-quantum-circuits-1606.06799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-calculus-representations-for-quantum-circuits-1606.06799"/></url>
<url><loc>https://scifaro.com/en/abs/scaling-bounded-model-checking-by-transforming-programs-with-arrays-1606.06974</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaling-bounded-model-checking-by-transforming-programs-with-arrays-1606.06974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaling-bounded-model-checking-by-transforming-programs-with-arrays-1606.06974"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-hyperproperties-1606.07047</loc><lastmod>2016-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-hyperproperties-1606.07047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-hyperproperties-1606.07047"/></url>
<url><loc>https://scifaro.com/en/abs/real-time-synthesis-is-hard-1606.07124</loc><lastmod>2016-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-time-synthesis-is-hard-1606.07124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-time-synthesis-is-hard-1606.07124"/></url>
<url><loc>https://scifaro.com/en/abs/advanced-probabilistic-couplings-for-differential-privacy-1606.07143</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advanced-probabilistic-couplings-for-differential-privacy-1606.07143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advanced-probabilistic-couplings-for-differential-privacy-1606.07143"/></url>
<url><loc>https://scifaro.com/en/abs/conjunctive-query-answering-via-a-fragment-of-set-theory-extended-version-1606.07337</loc><lastmod>2016-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjunctive-query-answering-via-a-fragment-of-set-theory-extended-version-1606.07337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjunctive-query-answering-via-a-fragment-of-set-theory-extended-version-1606.07337"/></url>
<url><loc>https://scifaro.com/en/abs/the-problem-of-analogical-inference-in-inductive-logic-1606.07513</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-problem-of-analogical-inference-in-inductive-logic-1606.07513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-problem-of-analogical-inference-in-inductive-logic-1606.07513"/></url>
<url><loc>https://scifaro.com/en/abs/resolving-distributed-knowledge-1606.07515</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolving-distributed-knowledge-1606.07515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolving-distributed-knowledge-1606.07515"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-solvability-of-inductive-problems-a-study-in-epistemic-topology-1606.07518</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-solvability-of-inductive-problems-a-study-in-epistemic-topology-1606.07518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-solvability-of-inductive-problems-a-study-in-epistemic-topology-1606.07518"/></url>
<url><loc>https://scifaro.com/en/abs/ceteris-paribus-logic-in-counterfactual-reasoning-1606.07522</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ceteris-paribus-logic-in-counterfactual-reasoning-1606.07522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ceteris-paribus-logic-in-counterfactual-reasoning-1606.07522"/></url>
<url><loc>https://scifaro.com/en/abs/preference-at-first-sight-1606.07524</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preference-at-first-sight-1606.07524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preference-at-first-sight-1606.07524"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-results-for-a-model-of-theory-of-mind-based-on-dynamic-epistemic-logic-1606.07526</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-results-for-a-model-of-theory-of-mind-based-on-dynamic-epistemic-logic-1606.07526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-results-for-a-model-of-theory-of-mind-based-on-dynamic-epistemic-logic-1606.07526"/></url>
<url><loc>https://scifaro.com/en/abs/announcement-as-effort-on-topological-spaces-1606.07527</loc><lastmod>2016-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/announcement-as-effort-on-topological-spaces-1606.07527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/announcement-as-effort-on-topological-spaces-1606.07527"/></url>
<url><loc>https://scifaro.com/en/abs/timed-multiset-rewriting-and-the-verification-of-time-sensitive-distributed-systems-1606.07886</loc><lastmod>2024-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-multiset-rewriting-and-the-verification-of-time-sensitive-distributed-systems-1606.07886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-multiset-rewriting-and-the-verification-of-time-sensitive-distributed-systems-1606.07886"/></url>
<url><loc>https://scifaro.com/en/abs/verify-ltl-with-fairness-assumptions-efficiently-1606.08116</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verify-ltl-with-fairness-assumptions-efficiently-1606.08116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verify-ltl-with-fairness-assumptions-efficiently-1606.08116"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-covariances-for-probabilistic-programs-1606.08280</loc><lastmod>2016-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-covariances-for-probabilistic-programs-1606.08280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-covariances-for-probabilistic-programs-1606.08280"/></url>
<url><loc>https://scifaro.com/en/abs/sctl-towards-combining-model-checking-and-proof-checking-1606.08668</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sctl-towards-combining-model-checking-and-proof-checking-1606.08668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sctl-towards-combining-model-checking-and-proof-checking-1606.08668"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-compute-halting-1606.08699</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-compute-halting-1606.08699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-compute-halting-1606.08699"/></url>
<url><loc>https://scifaro.com/en/abs/observations-on-the-halting-problem-1606.08703</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observations-on-the-halting-problem-1606.08703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observations-on-the-halting-problem-1606.08703"/></url>
<url><loc>https://scifaro.com/en/abs/epimenides-g-odel-turing-an-eternal-g-olden-tangle-1606.08722</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epimenides-g-odel-turing-an-eternal-g-olden-tangle-1606.08722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epimenides-g-odel-turing-an-eternal-g-olden-tangle-1606.08722"/></url>
<url><loc>https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-extended-abstract-1606.08815</loc><lastmod>2016-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-extended-abstract-1606.08815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidable-cases-of-model-checking-probabilistic-temporal-epistemic-logic-extended-abstract-1606.08815"/></url>
<url><loc>https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-1606.09016</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-1606.09016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-1606.09016"/></url>
<url><loc>https://scifaro.com/en/abs/compositionality-decompositionality-and-refinement-in-input-output-conformance-testing-technical-report-1606.09035</loc><lastmod>2019-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositionality-decompositionality-and-refinement-in-input-output-conformance-testing-technical-report-1606.09035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositionality-decompositionality-and-refinement-in-input-output-conformance-testing-technical-report-1606.09035"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-strategies-using-the-hoare-logic-of-angelic-and-demonic-nondeterminism-1606.09110</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-strategies-using-the-hoare-logic-of-angelic-and-demonic-nondeterminism-1606.09110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-strategies-using-the-hoare-logic-of-angelic-and-demonic-nondeterminism-1606.09110"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-buechi-and-parity-automata-1606.09399</loc><lastmod>2016-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-buechi-and-parity-automata-1606.09399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-for-buechi-and-parity-automata-1606.09399"/></url>
<url><loc>https://scifaro.com/en/abs/the-guarded-lambda-calculus-programming-and-reasoning-with-guarded-recursion-for-coinductive-types-1606.09455</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-guarded-lambda-calculus-programming-and-reasoning-with-guarded-recursion-for-coinductive-types-1606.09455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-guarded-lambda-calculus-programming-and-reasoning-with-guarded-recursion-for-coinductive-types-1606.09455"/></url>
<url><loc>https://scifaro.com/en/abs/computational-higher-type-theory-ii-dependent-cubical-realizability-1606.09638</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-higher-type-theory-ii-dependent-cubical-realizability-1606.09638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-higher-type-theory-ii-dependent-cubical-realizability-1606.09638"/></url>
<url><loc>https://scifaro.com/en/abs/a-fully-abstract-semantics-for-value-passing-ccs-for-trees-1607.00141</loc><lastmod>2016-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fully-abstract-semantics-for-value-passing-ccs-for-trees-1607.00141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fully-abstract-semantics-for-value-passing-ccs-for-trees-1607.00141"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-of-normal-forms-for-shallow-term-rewrite-systems-1607.00431</loc><lastmod>2016-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-of-normal-forms-for-shallow-term-rewrite-systems-1607.00431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-of-normal-forms-for-shallow-term-rewrite-systems-1607.00431"/></url>
<url><loc>https://scifaro.com/en/abs/priority-cut-if-then-else-and-exception-handling-in-logic-programming-1607.00633</loc><lastmod>2019-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priority-cut-if-then-else-and-exception-handling-in-logic-programming-1607.00633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priority-cut-if-then-else-and-exception-handling-in-logic-programming-1607.00633"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-the-expected-mean-payoff-in-energy-markov-decision-processes-1607.00678</loc><lastmod>2016-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-the-expected-mean-payoff-in-energy-markov-decision-processes-1607.00678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-the-expected-mean-payoff-in-energy-markov-decision-processes-1607.00678"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-new-convergence-class-in-k-bounded-sober-spaces-1607.01146</loc><lastmod>2016-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-new-convergence-class-in-k-bounded-sober-spaces-1607.01146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-new-convergence-class-in-k-bounded-sober-spaces-1607.01146"/></url>
<url><loc>https://scifaro.com/en/abs/domains-via-approximation-operators-1607.01164</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-via-approximation-operators-1607.01164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-via-approximation-operators-1607.01164"/></url>
<url><loc>https://scifaro.com/en/abs/synthesising-strategy-improvement-and-recursive-algorithms-for-solving-2-5-player-parity-games-1607.01474</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesising-strategy-improvement-and-recursive-algorithms-for-solving-2-5-player-parity-games-1607.01474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesising-strategy-improvement-and-recursive-algorithms-for-solving-2-5-player-parity-games-1607.01474"/></url>
<url><loc>https://scifaro.com/en/abs/translating-scala-programs-to-isabelle-hol-1607.01539</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-scala-programs-to-isabelle-hol-1607.01539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-scala-programs-to-isabelle-hol-1607.01539"/></url>
<url><loc>https://scifaro.com/en/abs/primitive-recursive-functions-versus-partial-recursive-functions-comparing-the-degree-of-undecidability-1607.01686</loc><lastmod>2016-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/primitive-recursive-functions-versus-partial-recursive-functions-comparing-the-degree-of-undecidability-1607.01686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/primitive-recursive-functions-versus-partial-recursive-functions-comparing-the-degree-of-undecidability-1607.01686"/></url>
<url><loc>https://scifaro.com/en/abs/join-continuity-hypercontinuity-prime-continuity-1607.01886</loc><lastmod>2016-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/join-continuity-hypercontinuity-prime-continuity-1607.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/join-continuity-hypercontinuity-prime-continuity-1607.01886"/></url>
<url><loc>https://scifaro.com/en/abs/biabduction-and-related-problems-in-array-separation-logic-1607.01993</loc><lastmod>2016-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biabduction-and-related-problems-in-array-separation-logic-1607.01993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biabduction-and-related-problems-in-array-separation-logic-1607.01993"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-workshop-on-formal-methods-for-the-quantitative-evaluation-of-collective-adaptive-systems-1607.02001</loc><lastmod>2016-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-workshop-on-formal-methods-for-the-quantitative-evaluation-of-collective-adaptive-systems-1607.02001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-workshop-on-formal-methods-for-the-quantitative-evaluation-of-collective-adaptive-systems-1607.02001"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-the-chisholm-set-1607.02189</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-the-chisholm-set-1607.02189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-the-chisholm-set-1607.02189"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-framework-for-modeling-trust-and-reputation-in-collective-adaptive-systems-1607.02232</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-framework-for-modeling-trust-and-reputation-in-collective-adaptive-systems-1607.02232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-framework-for-modeling-trust-and-reputation-in-collective-adaptive-systems-1607.02232"/></url>
<url><loc>https://scifaro.com/en/abs/on-formal-methods-for-collective-adaptive-system-engineering-scalable-approximated-spatial-analysis-techniques-extended-abstract-1607.02233</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-formal-methods-for-collective-adaptive-system-engineering-scalable-approximated-spatial-analysis-techniques-extended-abstract-1607.02233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-formal-methods-for-collective-adaptive-system-engineering-scalable-approximated-spatial-analysis-techniques-extended-abstract-1607.02233"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-and-spatial-equivalences-for-paloma-1607.02234</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-and-spatial-equivalences-for-paloma-1607.02234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-and-spatial-equivalences-for-paloma-1607.02234"/></url>
<url><loc>https://scifaro.com/en/abs/from-collective-adaptive-systems-to-human-centric-computation-and-back-spatial-model-checking-for-medical-imaging-1607.02235</loc><lastmod>2016-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-collective-adaptive-systems-to-human-centric-computation-and-back-spatial-model-checking-for-medical-imaging-1607.02235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-collective-adaptive-systems-to-human-centric-computation-and-back-spatial-model-checking-for-medical-imaging-1607.02235"/></url>
<url><loc>https://scifaro.com/en/abs/solving-finite-domain-linear-constraints-in-presence-of-the-texttt-alldifferent-1607.02466</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-finite-domain-linear-constraints-in-presence-of-the-texttt-alldifferent-1607.02466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-finite-domain-linear-constraints-in-presence-of-the-texttt-alldifferent-1607.02466"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-4th-international-workshop-on-strategic-reasoning-1607.02694</loc><lastmod>2016-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-4th-international-workshop-on-strategic-reasoning-1607.02694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-4th-international-workshop-on-strategic-reasoning-1607.02694"/></url>
<url><loc>https://scifaro.com/en/abs/hyper-normalisation-and-conditioning-for-discrete-probability-distributions-1607.02790</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyper-normalisation-and-conditioning-for-discrete-probability-distributions-1607.02790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyper-normalisation-and-conditioning-for-discrete-probability-distributions-1607.02790"/></url>
<url><loc>https://scifaro.com/en/abs/the-sequential-functionals-of-type-iota-rightarrow-iota-n-rightarrow-iota-form-a-dcpo-for-all-n-in-bbb-n-1607.02970</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sequential-functionals-of-type-iota-rightarrow-iota-n-rightarrow-iota-form-a-dcpo-for-all-n-in-bbb-n-1607.02970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sequential-functionals-of-type-iota-rightarrow-iota-n-rightarrow-iota-form-a-dcpo-for-all-n-in-bbb-n-1607.02970"/></url>
<url><loc>https://scifaro.com/en/abs/the-quasiequational-theory-of-relational-lattices-in-the-pure-lattice-signature-embeddability-into-relational-lattices-is-undecidable-1607.02988</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quasiequational-theory-of-relational-lattices-in-the-pure-lattice-signature-embeddability-into-relational-lattices-is-undecidable-1607.02988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quasiequational-theory-of-relational-lattices-in-the-pure-lattice-signature-embeddability-into-relational-lattices-is-undecidable-1607.02988"/></url>
<url><loc>https://scifaro.com/en/abs/the-ho-zhao-problem-1607.03286</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ho-zhao-problem-1607.03286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ho-zhao-problem-1607.03286"/></url>
<url><loc>https://scifaro.com/en/abs/representing-strategies-1607.03355</loc><lastmod>2016-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-strategies-1607.03355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-strategies-1607.03355"/></url>
<url><loc>https://scifaro.com/en/abs/the-lax-milgram-theorem-a-detailed-proof-to-be-formalized-in-coq-1607.03618</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lax-milgram-theorem-a-detailed-proof-to-be-formalized-in-coq-1607.03618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lax-milgram-theorem-a-detailed-proof-to-be-formalized-in-coq-1607.03618"/></url>
<url><loc>https://scifaro.com/en/abs/strategies-with-parallel-causes-1607.03747</loc><lastmod>2016-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategies-with-parallel-causes-1607.03747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategies-with-parallel-causes-1607.03747"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-games-and-strategies-1607.03760</loc><lastmod>2016-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-games-and-strategies-1607.03760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-games-and-strategies-1607.03760"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-chen-conjecture-regarding-the-complexity-of-qcsps-1607.03819</loc><lastmod>2016-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-chen-conjecture-regarding-the-complexity-of-qcsps-1607.03819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-chen-conjecture-regarding-the-complexity-of-qcsps-1607.03819"/></url>
<url><loc>https://scifaro.com/en/abs/compactification-of-autonomous-categories-1607.03877</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compactification-of-autonomous-categories-1607.03877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compactification-of-autonomous-categories-1607.03877"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-3rd-workshop-on-horn-clauses-for-verification-and-synthesis-1607.04033</loc><lastmod>2016-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-horn-clauses-for-verification-and-synthesis-1607.04033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-horn-clauses-for-verification-and-synthesis-1607.04033"/></url>
<url><loc>https://scifaro.com/en/abs/two-counterexamples-concerning-the-scott-topology-on-a-partial-order-1607.04128</loc><lastmod>2016-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-counterexamples-concerning-the-scott-topology-on-a-partial-order-1607.04128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-counterexamples-concerning-the-scott-topology-on-a-partial-order-1607.04128"/></url>
<url><loc>https://scifaro.com/en/abs/canonicity-for-cubical-type-theory-1607.04156</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonicity-for-cubical-type-theory-1607.04156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonicity-for-cubical-type-theory-1607.04156"/></url>
<url><loc>https://scifaro.com/en/abs/strong-completions-of-spaces-1607.04162</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-completions-of-spaces-1607.04162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-completions-of-spaces-1607.04162"/></url>
<url><loc>https://scifaro.com/en/abs/convexity-and-order-in-probabilistic-call-by-name-fpc-1607.04332</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexity-and-order-in-probabilistic-call-by-name-fpc-1607.04332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexity-and-order-in-probabilistic-call-by-name-fpc-1607.04332"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-ctl-verification-via-horn-constraints-solving-1607.04456</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-ctl-verification-via-horn-constraints-solving-1607.04456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-ctl-verification-via-horn-constraints-solving-1607.04456"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchical-state-machines-as-modular-horn-clauses-1607.04457</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchical-state-machines-as-modular-horn-clauses-1607.04457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchical-state-machines-as-modular-horn-clauses-1607.04457"/></url>
<url><loc>https://scifaro.com/en/abs/challenges-in-decomposing-encodings-of-verification-problems-1607.04458</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/challenges-in-decomposing-encodings-of-verification-problems-1607.04458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/challenges-in-decomposing-encodings-of-verification-problems-1607.04458"/></url>
<url><loc>https://scifaro.com/en/abs/removing-unnecessary-variables-from-horn-clause-verification-conditions-1607.04460</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/removing-unnecessary-variables-from-horn-clause-verification-conditions-1607.04460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/removing-unnecessary-variables-from-horn-clause-verification-conditions-1607.04460"/></url>
<url><loc>https://scifaro.com/en/abs/number-representations-and-term-rewriting-1607.04500</loc><lastmod>2016-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/number-representations-and-term-rewriting-1607.04500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/number-representations-and-term-rewriting-1607.04500"/></url>
<url><loc>https://scifaro.com/en/abs/the-recursion-hierarchy-for-pcf-is-strict-1607.04611</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-recursion-hierarchy-for-pcf-is-strict-1607.04611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-recursion-hierarchy-for-pcf-is-strict-1607.04611"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-call-by-push-value-1607.04690</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-call-by-push-value-1607.04690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-call-by-push-value-1607.04690"/></url>
<url><loc>https://scifaro.com/en/abs/core-spaces-sector-spaces-and-fan-spaces-a-topological-approach-to-domain-theory-1607.04721</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/core-spaces-sector-spaces-and-fan-spaces-a-topological-approach-to-domain-theory-1607.04721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/core-spaces-sector-spaces-and-fan-spaces-a-topological-approach-to-domain-theory-1607.04721"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-likelihood-of-normalisation-in-combinatory-logic-1607.04908</loc><lastmod>2016-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-likelihood-of-normalisation-in-combinatory-logic-1607.04908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-likelihood-of-normalisation-in-combinatory-logic-1607.04908"/></url>
<url><loc>https://scifaro.com/en/abs/g-odel-logic-from-natural-deduction-to-parallel-computation-1607.05120</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/g-odel-logic-from-natural-deduction-to-parallel-computation-1607.05120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/g-odel-logic-from-natural-deduction-to-parallel-computation-1607.05120"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-timed-games-revisited-1607.05671</loc><lastmod>2016-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-timed-games-revisited-1607.05671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-timed-games-revisited-1607.05671"/></url>
<url><loc>https://scifaro.com/en/abs/occam-s-razor-applied-to-the-petri-net-coverability-problem-1607.05956</loc><lastmod>2016-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/occam-s-razor-applied-to-the-petri-net-coverability-problem-1607.05956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/occam-s-razor-applied-to-the-petri-net-coverability-problem-1607.05956"/></url>
<url><loc>https://scifaro.com/en/abs/session-types-for-link-failures-technical-report-1607.07286</loc><lastmod>2017-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-types-for-link-failures-technical-report-1607.07286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-types-for-link-failures-technical-report-1607.07286"/></url>
<url><loc>https://scifaro.com/en/abs/domains-and-random-variables-1607.07698</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-and-random-variables-1607.07698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-and-random-variables-1607.07698"/></url>
<url><loc>https://scifaro.com/en/abs/regular-behaviours-with-names-1607.07828</loc><lastmod>2016-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-behaviours-with-names-1607.07828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-behaviours-with-names-1607.07828"/></url>
<url><loc>https://scifaro.com/en/abs/automata-for-specifying-and-orchestrating-service-contracts-1607.08363</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-for-specifying-and-orchestrating-service-contracts-1607.08363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-for-specifying-and-orchestrating-service-contracts-1607.08363"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-reasoning-for-interval-markov-decision-processes-1607.08484</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-reasoning-for-interval-markov-decision-processes-1607.08484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-reasoning-for-interval-markov-decision-processes-1607.08484"/></url>
<url><loc>https://scifaro.com/en/abs/decision-and-optimization-problems-in-the-unreliable-circuit-logic-1608.00533</loc><lastmod>2016-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-and-optimization-problems-in-the-unreliable-circuit-logic-1608.00533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-and-optimization-problems-in-the-unreliable-circuit-logic-1608.00533"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-branching-simulation-distance-for-parametric-weighted-kripke-structures-1608.00657</loc><lastmod>2016-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-branching-simulation-distance-for-parametric-weighted-kripke-structures-1608.00657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-branching-simulation-distance-for-parametric-weighted-kripke-structures-1608.00657"/></url>
<url><loc>https://scifaro.com/en/abs/anytime-answer-set-optimization-via-unsatisfiable-core-shrinking-1608.00731</loc><lastmod>2016-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anytime-answer-set-optimization-via-unsatisfiable-core-shrinking-1608.00731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anytime-answer-set-optimization-via-unsatisfiable-core-shrinking-1608.00731"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-conclusions-from-non-monotonic-cause-effect-relations-1608.00867</loc><lastmod>2016-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-conclusions-from-non-monotonic-cause-effect-relations-1608.00867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-conclusions-from-non-monotonic-cause-effect-relations-1608.00867"/></url>
<url><loc>https://scifaro.com/en/abs/justifications-for-programs-with-disjunctive-and-causal-choice-rules-1608.00870</loc><lastmod>2016-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justifications-for-programs-with-disjunctive-and-causal-choice-rules-1608.00870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justifications-for-programs-with-disjunctive-and-causal-choice-rules-1608.00870"/></url>
<url><loc>https://scifaro.com/en/abs/assertion-based-analysis-via-slicing-with-abets-system-description-1608.01433</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assertion-based-analysis-via-slicing-with-abets-system-description-1608.01433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assertion-based-analysis-via-slicing-with-abets-system-description-1608.01433"/></url>
<url><loc>https://scifaro.com/en/abs/on-partial-traces-and-compactification-of-autonomous-mix-categories-1608.01560</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-partial-traces-and-compactification-of-autonomous-mix-categories-1608.01560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-partial-traces-and-compactification-of-autonomous-mix-categories-1608.01560"/></url>
<url><loc>https://scifaro.com/en/abs/stable-models-for-infinitary-formulas-with-extensional-atoms-1608.01603</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-models-for-infinitary-formulas-with-extensional-atoms-1608.01603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-models-for-infinitary-formulas-with-extensional-atoms-1608.01603"/></url>
<url><loc>https://scifaro.com/en/abs/proving-infinitary-formulas-1608.01626</loc><lastmod>2016-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-infinitary-formulas-1608.01626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-infinitary-formulas-1608.01626"/></url>
<url><loc>https://scifaro.com/en/abs/formal-availability-analysis-using-theorem-proving-1608.01755</loc><lastmod>2016-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-availability-analysis-using-theorem-proving-1608.01755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-availability-analysis-using-theorem-proving-1608.01755"/></url>
<url><loc>https://scifaro.com/en/abs/molecular-model-checking-a-temporal-logic-1608.01785</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/molecular-model-checking-a-temporal-logic-1608.01785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/molecular-model-checking-a-temporal-logic-1608.01785"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-structural-liveness-of-petri-nets-1608.02327</loc><lastmod>2016-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-structural-liveness-of-petri-nets-1608.02327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-structural-liveness-of-petri-nets-1608.02327"/></url>
<url><loc>https://scifaro.com/en/abs/well-behaved-transition-systems-1608.02636</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-behaved-transition-systems-1608.02636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-behaved-transition-systems-1608.02636"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-modular-logic-programs-and-their-conservative-extensions-1608.02681</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-modular-logic-programs-and-their-conservative-extensions-1608.02681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-modular-logic-programs-and-their-conservative-extensions-1608.02681"/></url>
<url><loc>https://scifaro.com/en/abs/on-local-domain-symmetry-for-model-expansion-1608.02688</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-local-domain-symmetry-for-model-expansion-1608.02688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-local-domain-symmetry-for-model-expansion-1608.02688"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-23rd-international-workshop-on-expressiveness-in-concurrency-and-13th-workshop-on-structural-operational-semantics-1608.02692</loc><lastmod>2016-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-23rd-international-workshop-on-expressiveness-in-concurrency-and-13th-workshop-on-structural-operational-semantics-1608.02692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-23rd-international-workshop-on-expressiveness-in-concurrency-and-13th-workshop-on-structural-operational-semantics-1608.02692"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-time-aware-business-processes-using-constrained-horn-clauses-1608.02807</loc><lastmod>2016-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-time-aware-business-processes-using-constrained-horn-clauses-1608.02807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-time-aware-business-processes-using-constrained-horn-clauses-1608.02807"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-completeness-of-selective-unification-in-concolic-testing-of-logic-programs-1608.03054</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-completeness-of-selective-unification-in-concolic-testing-of-logic-programs-1608.03054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-completeness-of-selective-unification-in-concolic-testing-of-logic-programs-1608.03054"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-processes-with-parameterization-over-names-and-processes-1608.03126</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-processes-with-parameterization-over-names-and-processes-1608.03126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-processes-with-parameterization-over-names-and-processes-1608.03126"/></url>
<url><loc>https://scifaro.com/en/abs/unique-parallel-decomposition-for-the-pi-calculus-1608.03128</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-parallel-decomposition-for-the-pi-calculus-1608.03128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-parallel-decomposition-for-the-pi-calculus-1608.03128"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-multiparty-sessions-with-checkpoints-1608.03129</loc><lastmod>2016-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-multiparty-sessions-with-checkpoints-1608.03129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-multiparty-sessions-with-checkpoints-1608.03129"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-semantics-of-the-global-view-of-choreographies-1608.03323</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-semantics-of-the-global-view-of-choreographies-1608.03323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-semantics-of-the-global-view-of-choreographies-1608.03323"/></url>
<url><loc>https://scifaro.com/en/abs/a-modular-formalization-of-reversibility-for-concurrent-models-and-languages-1608.03325</loc><lastmod>2016-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modular-formalization-of-reversibility-for-concurrent-models-and-languages-1608.03325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modular-formalization-of-reversibility-for-concurrent-models-and-languages-1608.03325"/></url>
<url><loc>https://scifaro.com/en/abs/validity-and-entailment-in-modal-and-propositional-dependence-logics-1608.04301</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/validity-and-entailment-in-modal-and-propositional-dependence-logics-1608.04301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/validity-and-entailment-in-modal-and-propositional-dependence-logics-1608.04301"/></url>
<url><loc>https://scifaro.com/en/abs/slicing-concurrent-constraint-programs-1608.05252</loc><lastmod>2017-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slicing-concurrent-constraint-programs-1608.05252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slicing-concurrent-constraint-programs-1608.05252"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-counterexample-property-for-safety-and-liveness-verification-of-fault-tolerant-distributed-algorithms-1608.05327</loc><lastmod>2016-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-counterexample-property-for-safety-and-liveness-verification-of-fault-tolerant-distributed-algorithms-1608.05327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-counterexample-property-for-safety-and-liveness-verification-of-fault-tolerant-distributed-algorithms-1608.05327"/></url>
<url><loc>https://scifaro.com/en/abs/goal-oriented-reduction-of-automata-networks-1608.05548</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goal-oriented-reduction-of-automata-networks-1608.05548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goal-oriented-reduction-of-automata-networks-1608.05548"/></url>
<url><loc>https://scifaro.com/en/abs/lpopt-a-rule-optimization-tool-for-answer-set-programming-1608.05675</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lpopt-a-rule-optimization-tool-for-answer-set-programming-1608.05675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lpopt-a-rule-optimization-tool-for-answer-set-programming-1608.05675"/></url>
<url><loc>https://scifaro.com/en/abs/automata-theory-approach-to-predicate-intuitionistic-logic-1608.05698</loc><lastmod>2016-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-theory-approach-to-predicate-intuitionistic-logic-1608.05698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-theory-approach-to-predicate-intuitionistic-logic-1608.05698"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-with-belnapian-truth-values-1608.06084</loc><lastmod>2016-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-with-belnapian-truth-values-1608.06084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-with-belnapian-truth-values-1608.06084"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-using-the-descendant-axis-1608.06130</loc><lastmod>2016-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-using-the-descendant-axis-1608.06130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-datalog-containment-on-trees-using-the-descendant-axis-1608.06130"/></url>
<url><loc>https://scifaro.com/en/abs/datatype-defining-rewrite-systems-for-naturals-and-integers-1608.06212</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/datatype-defining-rewrite-systems-for-naturals-and-integers-1608.06212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/datatype-defining-rewrite-systems-for-naturals-and-integers-1608.06212"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-fault-trees-in-higher-order-logic-a-deep-embedding-approach-1608.06392</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-fault-trees-in-higher-order-logic-a-deep-embedding-approach-1608.06392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-fault-trees-in-higher-order-logic-a-deep-embedding-approach-1608.06392"/></url>
<url><loc>https://scifaro.com/en/abs/high-quality-synthesis-against-stochastic-environments-1608.06567</loc><lastmod>2016-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-quality-synthesis-against-stochastic-environments-1608.06567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-quality-synthesis-against-stochastic-environments-1608.06567"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-a-first-order-abstract-separation-logic-1608.06729</loc><lastmod>2016-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-a-first-order-abstract-separation-logic-1608.06729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-a-first-order-abstract-separation-logic-1608.06729"/></url>
<url><loc>https://scifaro.com/en/abs/total-recursion-over-lexicographical-orderings-elementary-recursive-operators-beyond-pr-1608.07163</loc><lastmod>2018-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-recursion-over-lexicographical-orderings-elementary-recursive-operators-beyond-pr-1608.07163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-recursion-over-lexicographical-orderings-elementary-recursive-operators-beyond-pr-1608.07163"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-first-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1608.07398</loc><lastmod>2016-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1608.07398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-first-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1608.07398"/></url>
<url><loc>https://scifaro.com/en/abs/the-logical-strength-of-b-uchi-s-decidability-theorem-1608.07514</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logical-strength-of-b-uchi-s-decidability-theorem-1608.07514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logical-strength-of-b-uchi-s-decidability-theorem-1608.07514"/></url>
<url><loc>https://scifaro.com/en/abs/logic-programming-laxness-and-saturation-1608.07708</loc><lastmod>2016-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-programming-laxness-and-saturation-1608.07708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-programming-laxness-and-saturation-1608.07708"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-resolution-proof-schema-and-the-pigeonhole-principle-1608.07792</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-resolution-proof-schema-and-the-pigeonhole-principle-1608.07792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-resolution-proof-schema-and-the-pigeonhole-principle-1608.07792"/></url>
<url><loc>https://scifaro.com/en/abs/de-composing-causality-in-labeled-transition-systems-1608.07880</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/de-composing-causality-in-labeled-transition-systems-1608.07880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/de-composing-causality-in-labeled-transition-systems-1608.07880"/></url>
<url><loc>https://scifaro.com/en/abs/fault-localization-in-web-applications-via-model-finding-1608.07883</loc><lastmod>2016-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-localization-in-web-applications-via-model-finding-1608.07883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-localization-in-web-applications-via-model-finding-1608.07883"/></url>
<url><loc>https://scifaro.com/en/abs/near-optimal-lower-bounds-on-quantifier-depth-and-weisfeiler-leman-refinement-steps-1608.08704</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/near-optimal-lower-bounds-on-quantifier-depth-and-weisfeiler-leman-refinement-steps-1608.08704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/near-optimal-lower-bounds-on-quantifier-depth-and-weisfeiler-leman-refinement-steps-1608.08704"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-and-subexponential-linear-logics-technical-report-1608.08779</loc><lastmod>2016-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-and-subexponential-linear-logics-technical-report-1608.08779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-and-subexponential-linear-logics-technical-report-1608.08779"/></url>
<url><loc>https://scifaro.com/en/abs/subcomputable-schnorr-randomness-1608.08918</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subcomputable-schnorr-randomness-1608.08918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subcomputable-schnorr-randomness-1608.08918"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-representation-analysis-of-graph-mining-1608.08956</loc><lastmod>2016-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-representation-analysis-of-graph-mining-1608.08956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-representation-analysis-of-graph-mining-1608.08956"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-bisimulation-and-discretization-of-hybrid-csp-1609.00091</loc><lastmod>2016-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-bisimulation-and-discretization-of-hybrid-csp-1609.00091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-bisimulation-and-discretization-of-hybrid-csp-1609.00091"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-synchronous-atomic-steps-1609.00118</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-synchronous-atomic-steps-1609.00118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-synchronous-atomic-steps-1609.00118"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-possibly-non-halting-programs-and-tests-1609.00132</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-possibly-non-halting-programs-and-tests-1609.00132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-possibly-non-halting-programs-and-tests-1609.00132"/></url>
<url><loc>https://scifaro.com/en/abs/designing-a-semantic-model-for-a-wide-spectrum-language-with-concurrency-1609.00195</loc><lastmod>2016-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/designing-a-semantic-model-for-a-wide-spectrum-language-with-concurrency-1609.00195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/designing-a-semantic-model-for-a-wide-spectrum-language-with-concurrency-1609.00195"/></url>
<url><loc>https://scifaro.com/en/abs/open-call-by-value-extended-version-1609.00322</loc><lastmod>2016-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-call-by-value-extended-version-1609.00322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-call-by-value-extended-version-1609.00322"/></url>
<url><loc>https://scifaro.com/en/abs/the-3rd-reactive-synthesis-competition-syntcomp-2016-benchmarks-participants-results-1609.00507</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-3rd-reactive-synthesis-competition-syntcomp-2016-benchmarks-participants-results-1609.00507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-3rd-reactive-synthesis-competition-syntcomp-2016-benchmarks-participants-results-1609.00507"/></url>
<url><loc>https://scifaro.com/en/abs/automated-mutual-explicit-induction-proof-in-separation-logic-1609.00919</loc><lastmod>2017-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-mutual-explicit-induction-proof-in-separation-logic-1609.00919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-mutual-explicit-induction-proof-in-separation-logic-1609.00919"/></url>
<url><loc>https://scifaro.com/en/abs/an-implementation-of-deflate-in-coq-1609.01220</loc><lastmod>2016-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implementation-of-deflate-in-coq-1609.01220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implementation-of-deflate-in-coq-1609.01220"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-category-theory-in-free-logic-1609.01493</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-category-theory-in-free-logic-1609.01493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-category-theory-in-free-logic-1609.01493"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-degree-and-planar-spectra-1609.01789</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-degree-and-planar-spectra-1609.01789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-degree-and-planar-spectra-1609.01789"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-agent-based-automated-theorem-proving-in-order-sorted-first-order-logic-1609.02320</loc><lastmod>2016-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-agent-based-automated-theorem-proving-in-order-sorted-first-order-logic-1609.02320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-agent-based-automated-theorem-proving-in-order-sorted-first-order-logic-1609.02320"/></url>
<url><loc>https://scifaro.com/en/abs/typing-weak-msol-properties-1609.02753</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typing-weak-msol-properties-1609.02753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typing-weak-msol-properties-1609.02753"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-computing-with-terms-and-graphs-1609.03014</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-computing-with-terms-and-graphs-1609.03014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-9th-international-workshop-on-computing-with-terms-and-graphs-1609.03014"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-mechanized-proof-of-the-church-rosser-theorem-by-the-z-property-for-the-lambda-beta-calculus-in-nominal-isabelle-1609.03139</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-mechanized-proof-of-the-church-rosser-theorem-by-the-z-property-for-the-lambda-beta-calculus-in-nominal-isabelle-1609.03139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-mechanized-proof-of-the-church-rosser-theorem-by-the-z-property-for-the-lambda-beta-calculus-in-nominal-isabelle-1609.03139"/></url>
<url><loc>https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-i-curry-howard-correspondence-for-dummett-s-logic-lc-1609.03190</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-i-curry-howard-correspondence-for-dummett-s-logic-lc-1609.03190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-i-curry-howard-correspondence-for-dummett-s-logic-lc-1609.03190"/></url>
<url><loc>https://scifaro.com/en/abs/knowing-values-and-public-inspection-1609.03338</loc><lastmod>2017-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowing-values-and-public-inspection-1609.03338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowing-values-and-public-inspection-1609.03338"/></url>
<url><loc>https://scifaro.com/en/abs/formalized-confluence-of-quasi-decreasing-strongly-deterministic-conditional-trss-1609.03341</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalized-confluence-of-quasi-decreasing-strongly-deterministic-conditional-trss-1609.03341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalized-confluence-of-quasi-decreasing-strongly-deterministic-conditional-trss-1609.03341"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-quasi-decreasingness-1609.03345</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-quasi-decreasingness-1609.03345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-quasi-decreasingness-1609.03345"/></url>
<url><loc>https://scifaro.com/en/abs/the-generalized-subterm-criterion-in-ttt2-1609.03432</loc><lastmod>2016-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-generalized-subterm-criterion-in-ttt2-1609.03432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-generalized-subterm-criterion-in-ttt2-1609.03432"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-multi-context-systems-heterogeneous-reasoning-in-dynamic-environments-1609.03438</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-multi-context-systems-heterogeneous-reasoning-in-dynamic-environments-1609.03438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-multi-context-systems-heterogeneous-reasoning-in-dynamic-environments-1609.03438"/></url>
<url><loc>https://scifaro.com/en/abs/kruskal-s-tree-theorem-for-acyclic-term-graphs-1609.03642</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kruskal-s-tree-theorem-for-acyclic-term-graphs-1609.03642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kruskal-s-tree-theorem-for-acyclic-term-graphs-1609.03642"/></url>
<url><loc>https://scifaro.com/en/abs/token-passing-optimal-reduction-with-embedded-read-back-1609.03644</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-passing-optimal-reduction-with-embedded-read-back-1609.03644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-passing-optimal-reduction-with-embedded-read-back-1609.03644"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-seventh-international-symposium-on-games-automata-logics-and-formal-verification-1609.03648</loc><lastmod>2016-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-seventh-international-symposium-on-games-automata-logics-and-formal-verification-1609.03648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-seventh-international-symposium-on-games-automata-logics-and-formal-verification-1609.03648"/></url>
<url><loc>https://scifaro.com/en/abs/partial-solvers-for-parity-games-effective-polynomial-time-composition-1609.04085</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-solvers-for-parity-games-effective-polynomial-time-composition-1609.04085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-solvers-for-parity-games-effective-polynomial-time-composition-1609.04085"/></url>
<url><loc>https://scifaro.com/en/abs/relation-changing-logics-as-fragments-of-hybrid-logics-1609.04086</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-changing-logics-as-fragments-of-hybrid-logics-1609.04086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-changing-logics-as-fragments-of-hybrid-logics-1609.04086"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-topological-fixpoint-logic-1609.04088</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-topological-fixpoint-logic-1609.04088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-topological-fixpoint-logic-1609.04088"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-the-logic-of-allen-s-relations-meets-and-started-by-is-p-np-complete-1609.04090</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-the-logic-of-allen-s-relations-meets-and-started-by-is-p-np-complete-1609.04090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-the-logic-of-allen-s-relations-meets-and-started-by-is-p-np-complete-1609.04090"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-sub-propositional-fragments-of-modal-logic-1609.04091</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-sub-propositional-fragments-of-modal-logic-1609.04091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-sub-propositional-fragments-of-modal-logic-1609.04091"/></url>
<url><loc>https://scifaro.com/en/abs/alternation-is-strict-for-higher-order-modal-fixpoint-logic-1609.04092</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternation-is-strict-for-higher-order-modal-fixpoint-logic-1609.04092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternation-is-strict-for-higher-order-modal-fixpoint-logic-1609.04092"/></url>
<url><loc>https://scifaro.com/en/abs/a-canonical-model-construction-for-iteration-free-pdl-with-intersection-1609.04093</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-canonical-model-construction-for-iteration-free-pdl-with-intersection-1609.04093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-canonical-model-construction-for-iteration-free-pdl-with-intersection-1609.04093"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-linear-dynamic-logic-1609.04094</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-linear-dynamic-logic-1609.04094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-linear-dynamic-logic-1609.04094"/></url>
<url><loc>https://scifaro.com/en/abs/cycle-detection-in-computation-tree-logic-1609.04095</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cycle-detection-in-computation-tree-logic-1609.04095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cycle-detection-in-computation-tree-logic-1609.04095"/></url>
<url><loc>https://scifaro.com/en/abs/on-quantified-propositional-logics-and-the-exponential-time-hierarchy-1609.04097</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-quantified-propositional-logics-and-the-exponential-time-hierarchy-1609.04097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-quantified-propositional-logics-and-the-exponential-time-hierarchy-1609.04097"/></url>
<url><loc>https://scifaro.com/en/abs/certification-of-prefixed-tableau-proofs-for-modal-logic-1609.04100</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certification-of-prefixed-tableau-proofs-for-modal-logic-1609.04100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certification-of-prefixed-tableau-proofs-for-modal-logic-1609.04100"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-rule-for-ltl-tableaux-1609.04102</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-rule-for-ltl-tableaux-1609.04102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-rule-for-ltl-tableaux-1609.04102"/></url>
<url><loc>https://scifaro.com/en/abs/liveness-of-parameterized-timed-networks-1609.04176</loc><lastmod>2016-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/liveness-of-parameterized-timed-networks-1609.04176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/liveness-of-parameterized-timed-networks-1609.04176"/></url>
<url><loc>https://scifaro.com/en/abs/finite-ltl-synthesis-is-exptime-complete-1609.04371</loc><lastmod>2016-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-ltl-synthesis-is-exptime-complete-1609.04371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-ltl-synthesis-is-exptime-complete-1609.04371"/></url>
<url><loc>https://scifaro.com/en/abs/mall-proof-nets-identify-proofs-modulo-rule-commutation-1609.04693</loc><lastmod>2016-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mall-proof-nets-identify-proofs-modulo-rule-commutation-1609.04693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mall-proof-nets-identify-proofs-modulo-rule-commutation-1609.04693"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-computational-paths-1609.05079</loc><lastmod>2018-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-computational-paths-1609.05079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-computational-paths-1609.05079"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-nontermination-arguments-1609.05207</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-nontermination-arguments-1609.05207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-nontermination-arguments-1609.05207"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-for-dynamic-parametric-processes-1609.05385</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-for-dynamic-parametric-processes-1609.05385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-for-dynamic-parametric-processes-1609.05385"/></url>
<url><loc>https://scifaro.com/en/abs/extending-unification-in-mathcal-el-to-disunification-the-case-of-dismatching-and-local-disunification-1609.05621</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-unification-in-mathcal-el-to-disunification-the-case-of-dismatching-and-local-disunification-1609.05621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-unification-in-mathcal-el-to-disunification-the-case-of-dismatching-and-local-disunification-1609.05621"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-arbitrary-arrow-update-logic-1609.05686</loc><lastmod>2016-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-arbitrary-arrow-update-logic-1609.05686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-arbitrary-arrow-update-logic-1609.05686"/></url>
<url><loc>https://scifaro.com/en/abs/a-syntactic-proof-of-decidability-for-the-logic-of-bunched-implication-bi-1609.05847</loc><lastmod>2026-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syntactic-proof-of-decidability-for-the-logic-of-bunched-implication-bi-1609.05847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syntactic-proof-of-decidability-for-the-logic-of-bunched-implication-bi-1609.05847"/></url>
<url><loc>https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-full-version-1609.05952</loc><lastmod>2016-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-full-version-1609.05952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/window-parity-games-an-alternative-approach-toward-parity-games-with-time-bounds-full-version-1609.05952"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-1609.06297</loc><lastmod>2016-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-1609.06297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-1609.06297"/></url>
<url><loc>https://scifaro.com/en/abs/global-caching-for-the-alternation-free-mu-calculus-1609.06379</loc><lastmod>2016-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-caching-for-the-alternation-free-mu-calculus-1609.06379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-caching-for-the-alternation-free-mu-calculus-1609.06379"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-spatial-logics-for-closure-spaces-1609.06513</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-spatial-logics-for-closure-spaces-1609.06513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-spatial-logics-for-closure-spaces-1609.06513"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-and-validity-in-propositional-and-modal-inclusion-logics-1609.06951</loc><lastmod>2017-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-and-validity-in-propositional-and-modal-inclusion-logics-1609.06951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-and-validity-in-propositional-and-modal-inclusion-logics-1609.06951"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-cycle-rewriting-by-transformation-and-matrix-interpretation-1609.07065</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-cycle-rewriting-by-transformation-and-matrix-interpretation-1609.07065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-cycle-rewriting-by-transformation-and-matrix-interpretation-1609.07065"/></url>
<url><loc>https://scifaro.com/en/abs/taking-a-detour-to-zero-an-alternative-formalization-of-functions-beyond-pr-1609.07254</loc><lastmod>2018-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taking-a-detour-to-zero-an-alternative-formalization-of-functions-beyond-pr-1609.07254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taking-a-detour-to-zero-an-alternative-formalization-of-functions-beyond-pr-1609.07254"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-of-lambda-terms-a-natural-approach-1609.07593</loc><lastmod>2016-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-of-lambda-terms-a-natural-approach-1609.07593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-of-lambda-terms-a-natural-approach-1609.07593"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-and-complexity-of-modal-logic-with-knowing-what-operator-on-model-class-k-1609.07684</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-and-complexity-of-modal-logic-with-knowing-what-operator-on-model-class-k-1609.07684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-and-complexity-of-modal-logic-with-knowing-what-operator-on-model-class-k-1609.07684"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-graphs-nondeterministic-automata-1609.07895</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-graphs-nondeterministic-automata-1609.07895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-graphs-nondeterministic-automata-1609.07895"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-algebraic-characterizations-in-recursive-analysis-1609.07972</loc><lastmod>2016-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-algebraic-characterizations-in-recursive-analysis-1609.07972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-algebraic-characterizations-in-recursive-analysis-1609.07972"/></url>
<url><loc>https://scifaro.com/en/abs/stream-differential-equations-specification-formats-and-solution-methods-1609.08367</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stream-differential-equations-specification-formats-and-solution-methods-1609.08367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stream-differential-equations-specification-formats-and-solution-methods-1609.08367"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-monomorphic-and-polymorphic-types-1609.08916</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-monomorphic-and-polymorphic-types-1609.08916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-monomorphic-and-polymorphic-types-1609.08916"/></url>
<url><loc>https://scifaro.com/en/abs/formula-slicing-inductive-invariants-from-preconditions-1609.09288</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formula-slicing-inductive-invariants-from-preconditions-1609.09288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formula-slicing-inductive-invariants-from-preconditions-1609.09288"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-and-logical-descriptions-of-generalized-trees-1609.09675</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-and-logical-descriptions-of-generalized-trees-1609.09675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-and-logical-descriptions-of-generalized-trees-1609.09675"/></url>
<url><loc>https://scifaro.com/en/abs/five-basic-concepts-of-axiomatic-rewriting-theory-1609.09783</loc><lastmod>2016-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/five-basic-concepts-of-axiomatic-rewriting-theory-1609.09783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/five-basic-concepts-of-axiomatic-rewriting-theory-1609.09783"/></url>
<url><loc>https://scifaro.com/en/abs/a-normalizing-computation-rule-for-propositional-extensionality-in-higher-order-minimal-logic-1610.00026</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normalizing-computation-rule-for-propositional-extensionality-in-higher-order-minimal-logic-1610.00026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normalizing-computation-rule-for-propositional-extensionality-in-higher-order-minimal-logic-1610.00026"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-distributed-execution-of-fixpoint-based-computational-fields-1610.00253</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-distributed-execution-of-fixpoint-based-computational-fields-1610.00253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-distributed-execution-of-fixpoint-based-computational-fields-1610.00253"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-preciseness-of-subtyping-in-session-types-1610.00328</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-preciseness-of-subtyping-in-session-types-1610.00328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-preciseness-of-subtyping-in-session-types-1610.00328"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-synchronization-trees-and-processes-1610.00450</loc><lastmod>2016-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-synchronization-trees-and-processes-1610.00450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-synchronization-trees-and-processes-1610.00450"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-opacity-to-linearizability-a-sound-and-complete-method-1610.01004</loc><lastmod>2016-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-opacity-to-linearizability-a-sound-and-complete-method-1610.01004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-opacity-to-linearizability-a-sound-and-complete-method-1610.01004"/></url>
<url><loc>https://scifaro.com/en/abs/recursion-theoretic-ranking-and-compression-1610.01185</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursion-theoretic-ranking-and-compression-1610.01185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursion-theoretic-ranking-and-compression-1610.01185"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-string-logic-with-equations-regular-membership-and-length-constraints-1610.01331</loc><lastmod>2016-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-string-logic-with-equations-regular-membership-and-length-constraints-1610.01331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-string-logic-with-equations-regular-membership-and-length-constraints-1610.01331"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-introduction-to-process-theory-1610.01412</loc><lastmod>2016-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-introduction-to-process-theory-1610.01412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-introduction-to-process-theory-1610.01412"/></url>
<url><loc>https://scifaro.com/en/abs/linear-combinations-of-unordered-data-vectors-1610.01470</loc><lastmod>2016-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-combinations-of-unordered-data-vectors-1610.01470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-combinations-of-unordered-data-vectors-1610.01470"/></url>
<url><loc>https://scifaro.com/en/abs/game-semantics-for-martin-l-of-type-theory-1610.01669</loc><lastmod>2021-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-semantics-for-martin-l-of-type-theory-1610.01669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-semantics-for-martin-l-of-type-theory-1610.01669"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-automated-verification-of-web-applications-with-embedded-sql-1610.02101</loc><lastmod>2016-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-automated-verification-of-web-applications-with-embedded-sql-1610.02101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-automated-verification-of-web-applications-with-embedded-sql-1610.02101"/></url>
<url><loc>https://scifaro.com/en/abs/logic-as-a-distributive-law-1610.02247</loc><lastmod>2016-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-as-a-distributive-law-1610.02247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-as-a-distributive-law-1610.02247"/></url>
<url><loc>https://scifaro.com/en/abs/generalised-information-systems-capture-l-domains-1610.02260</loc><lastmod>2021-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalised-information-systems-capture-l-domains-1610.02260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalised-information-systems-capture-l-domains-1610.02260"/></url>
<url><loc>https://scifaro.com/en/abs/a-coordination-language-for-databases-1610.02364</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coordination-language-for-databases-1610.02364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coordination-language-for-databases-1610.02364"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-process-algebra-to-unifying-quantum-and-classical-computing-in-closed-systems-1610.02500</loc><lastmod>2016-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-process-algebra-to-unifying-quantum-and-classical-computing-in-closed-systems-1610.02500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-process-algebra-to-unifying-quantum-and-classical-computing-in-closed-systems-1610.02500"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mints-hierarchy-in-first-order-intuitionistic-logic-1610.02675</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mints-hierarchy-in-first-order-intuitionistic-logic-1610.02675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mints-hierarchy-in-first-order-intuitionistic-logic-1610.02675"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-the-tree-based-hierarchical-read-copy-update-in-the-linux-kernel-1610.03052</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-the-tree-based-hierarchical-read-copy-update-in-the-linux-kernel-1610.03052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-the-tree-based-hierarchical-read-copy-update-in-the-linux-kernel-1610.03052"/></url>
<url><loc>https://scifaro.com/en/abs/notions-of-anonymous-existence-in-martin-l-of-type-theory-1610.03346</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notions-of-anonymous-existence-in-martin-l-of-type-theory-1610.03346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notions-of-anonymous-existence-in-martin-l-of-type-theory-1610.03346"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-1610.03935</loc><lastmod>2016-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-1610.03935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-1610.03935"/></url>
<url><loc>https://scifaro.com/en/abs/the-first-order-logic-of-hyperproperties-1610.04388</loc><lastmod>2017-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-first-order-logic-of-hyperproperties-1610.04388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-first-order-logic-of-hyperproperties-1610.04388"/></url>
<url><loc>https://scifaro.com/en/abs/the-hott-library-a-formalization-of-homotopy-type-theory-in-coq-1610.04591</loc><lastmod>2017-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hott-library-a-formalization-of-homotopy-type-theory-in-coq-1610.04591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hott-library-a-formalization-of-homotopy-type-theory-in-coq-1610.04591"/></url>
<url><loc>https://scifaro.com/en/abs/the-recursion-theorem-from-a-different-angle-1610.04592</loc><lastmod>2018-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-recursion-theorem-from-a-different-angle-1610.04592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-recursion-theorem-from-a-different-angle-1610.04592"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-in-the-bernays-schoenfinkel-ramsey-fragment-of-separation-logic-1610.04707</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-in-the-bernays-schoenfinkel-ramsey-fragment-of-separation-logic-1610.04707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-in-the-bernays-schoenfinkel-ramsey-fragment-of-separation-logic-1610.04707"/></url>
<url><loc>https://scifaro.com/en/abs/achieving-while-maintaining-a-logic-of-knowing-how-with-intermediate-constraints-1610.05064</loc><lastmod>2016-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/achieving-while-maintaining-a-logic-of-knowing-how-with-intermediate-constraints-1610.05064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/achieving-while-maintaining-a-logic-of-knowing-how-with-intermediate-constraints-1610.05064"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-real-numbers-in-homotopy-type-theory-1610.05072</loc><lastmod>2016-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-real-numbers-in-homotopy-type-theory-1610.05072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-real-numbers-in-homotopy-type-theory-1610.05072"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-analysis-of-innermost-rewriting-1610.05156</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-analysis-of-innermost-rewriting-1610.05156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-analysis-of-innermost-rewriting-1610.05156"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-sets-and-the-topological-topos-1610.05270</loc><lastmod>2016-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-sets-and-the-topological-topos-1610.05270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-sets-and-the-topological-topos-1610.05270"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-and-maintaining-tactics-graphically-or-how-we-are-learning-that-a-diagram-can-be-worth-more-than-10k-loc-1610.05593</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-and-maintaining-tactics-graphically-or-how-we-are-learning-that-a-diagram-can-be-worth-more-than-10k-loc-1610.05593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-and-maintaining-tactics-graphically-or-how-we-are-learning-that-a-diagram-can-be-worth-more-than-10k-loc-1610.05593"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-bisimulation-metric-reasoning-with-probabilistic-process-calculi-1610.06162</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-bisimulation-metric-reasoning-with-probabilistic-process-calculi-1610.06162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-bisimulation-metric-reasoning-with-probabilistic-process-calculi-1610.06162"/></url>
<url><loc>https://scifaro.com/en/abs/the-drat-format-and-drat-trim-checker-1610.06229</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-drat-format-and-drat-trim-checker-1610.06229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-drat-format-and-drat-trim-checker-1610.06229"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-partial-order-reduction-1610.06317</loc><lastmod>2018-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-partial-order-reduction-1610.06317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-partial-order-reduction-1610.06317"/></url>
<url><loc>https://scifaro.com/en/abs/on-sessions-and-infinite-data-1610.06362</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sessions-and-infinite-data-1610.06362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sessions-and-infinite-data-1610.06362"/></url>
<url><loc>https://scifaro.com/en/abs/mu-bicomplete-categories-and-parity-games-1610.06393</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mu-bicomplete-categories-and-parity-games-1610.06393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mu-bicomplete-categories-and-parity-games-1610.06393"/></url>
<url><loc>https://scifaro.com/en/abs/representing-permutations-without-permutations-or-the-expressive-power-of-sequence-types-1610.06399</loc><lastmod>2018-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-permutations-without-permutations-or-the-expressive-power-of-sequence-types-1610.06399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-permutations-without-permutations-or-the-expressive-power-of-sequence-types-1610.06399"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-intersection-types-as-sequences-a-new-answer-to-klop-s-question-1610.06409</loc><lastmod>2016-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-intersection-types-as-sequences-a-new-answer-to-klop-s-question-1610.06409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-intersection-types-as-sequences-a-new-answer-to-klop-s-question-1610.06409"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-turing-machines-with-infinite-alphabets-1610.06552</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-turing-machines-with-infinite-alphabets-1610.06552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-turing-machines-with-infinite-alphabets-1610.06552"/></url>
<url><loc>https://scifaro.com/en/abs/a-hybrid-hoare-logic-for-gene-network-models-1610.06715</loc><lastmod>2016-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hybrid-hoare-logic-for-gene-network-models-1610.06715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hybrid-hoare-logic-for-gene-network-models-1610.06715"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-certified-resolution-proof-checking-1610.06984</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-certified-resolution-proof-checking-1610.06984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-certified-resolution-proof-checking-1610.06984"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-verification-of-imperative-programs-using-auto2-1610.06996</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-verification-of-imperative-programs-using-auto2-1610.06996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-verification-of-imperative-programs-using-auto2-1610.06996"/></url>
<url><loc>https://scifaro.com/en/abs/unified-reasoning-about-robustness-properties-of-symbolic-heap-separation-logic-1610.07041</loc><lastmod>2016-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unified-reasoning-about-robustness-properties-of-symbolic-heap-separation-logic-1610.07041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unified-reasoning-about-robustness-properties-of-symbolic-heap-separation-logic-1610.07041"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-decision-problems-dependent-types-and-generic-solutions-1610.07145</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-decision-problems-dependent-types-and-generic-solutions-1610.07145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-decision-problems-dependent-types-and-generic-solutions-1610.07145"/></url>
<url><loc>https://scifaro.com/en/abs/bounding-average-energy-games-1610.07858</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounding-average-energy-games-1610.07858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounding-average-energy-games-1610.07858"/></url>
<url><loc>https://scifaro.com/en/abs/a-higher-order-calculus-of-computational-fields-1610.08116</loc><lastmod>2019-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-higher-order-calculus-of-computational-fields-1610.08116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-higher-order-calculus-of-computational-fields-1610.08116"/></url>
<url><loc>https://scifaro.com/en/abs/sound-probabilistic-sat-with-projection-1610.08167</loc><lastmod>2016-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-probabilistic-sat-with-projection-1610.08167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-probabilistic-sat-with-projection-1610.08167"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterization-of-bisimulation-metrics-1610.08169</loc><lastmod>2016-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterization-of-bisimulation-metrics-1610.08169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterization-of-bisimulation-metrics-1610.08169"/></url>
<url><loc>https://scifaro.com/en/abs/mela-modelling-in-ecology-with-location-attributes-1610.08171</loc><lastmod>2016-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mela-modelling-in-ecology-with-location-attributes-1610.08171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mela-modelling-in-ecology-with-location-attributes-1610.08171"/></url>
<url><loc>https://scifaro.com/en/abs/on-linear-rewriting-systems-for-boolean-logic-and-some-applications-to-proof-theory-1610.08772</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-linear-rewriting-systems-for-boolean-logic-and-some-applications-to-proof-theory-1610.08772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-linear-rewriting-systems-for-boolean-logic-and-some-applications-to-proof-theory-1610.08772"/></url>
<url><loc>https://scifaro.com/en/abs/a-sound-complete-and-effective-second-order-game-semantics-1610.08845</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sound-complete-and-effective-second-order-game-semantics-1610.08845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sound-complete-and-effective-second-order-game-semantics-1610.08845"/></url>
<url><loc>https://scifaro.com/en/abs/perfect-memory-context-trees-in-time-series-modeling-1610.08910</loc><lastmod>2016-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perfect-memory-context-trees-in-time-series-modeling-1610.08910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perfect-memory-context-trees-in-time-series-modeling-1610.08910"/></url>
<url><loc>https://scifaro.com/en/abs/the-dynamic-descriptive-complexity-of-k-clique-1610.09089</loc><lastmod>2016-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dynamic-descriptive-complexity-of-k-clique-1610.09089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dynamic-descriptive-complexity-of-k-clique-1610.09089"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-user-defined-effects-effect-handlers-monadic-reflection-delimited-control-1610.09161</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-user-defined-effects-effect-handlers-monadic-reflection-delimited-control-1610.09161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-user-defined-effects-effect-handlers-monadic-reflection-delimited-control-1610.09161"/></url>
<url><loc>https://scifaro.com/en/abs/computability-in-basic-quantum-mechanics-1610.09209</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-in-basic-quantum-mechanics-1610.09209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-in-basic-quantum-mechanics-1610.09209"/></url>
<url><loc>https://scifaro.com/en/abs/a-tale-of-two-turing-machines-1610.09235</loc><lastmod>2016-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tale-of-two-turing-machines-1610.09235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tale-of-two-turing-machines-1610.09235"/></url>
<url><loc>https://scifaro.com/en/abs/partiality-revisited-the-partiality-monad-as-a-quotient-inductive-inductive-type-1610.09254</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partiality-revisited-the-partiality-monad-as-a-quotient-inductive-inductive-type-1610.09254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partiality-revisited-the-partiality-monad-as-a-quotient-inductive-inductive-type-1610.09254"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-monotone-programs-1610.09607</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-monotone-programs-1610.09607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-monotone-programs-1610.09607"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-parallelism-classical-probabilistic-and-quantum-effects-1610.09629</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-parallelism-classical-probabilistic-and-quantum-effects-1610.09629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-parallelism-classical-probabilistic-and-quantum-effects-1610.09629"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-bisimulations-and-abstraction-1611.00401</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-bisimulations-and-abstraction-1611.00401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-bisimulations-and-abstraction-1611.00401"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-compositionality-of-quantitative-information-flow-1611.00455</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-compositionality-of-quantitative-information-flow-1611.00455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-compositionality-of-quantitative-information-flow-1611.00455"/></url>
<url><loc>https://scifaro.com/en/abs/on-verifying-causal-consistency-1611.00580</loc><lastmod>2016-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-verifying-causal-consistency-1611.00580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-verifying-causal-consistency-1611.00580"/></url>
<url><loc>https://scifaro.com/en/abs/goal-driven-unfolding-of-petri-nets-1611.01296</loc><lastmod>2016-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goal-driven-unfolding-of-petri-nets-1611.01296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goal-driven-unfolding-of-petri-nets-1611.01296"/></url>
<url><loc>https://scifaro.com/en/abs/mechanically-proving-determinacy-of-hierarchical-block-diagram-translations-1611.01337</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanically-proving-determinacy-of-hierarchical-block-diagram-translations-1611.01337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanically-proving-determinacy-of-hierarchical-block-diagram-translations-1611.01337"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-extensions-of-combined-classical-and-intuitionistic-propositional-logic-1611.01429</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-extensions-of-combined-classical-and-intuitionistic-propositional-logic-1611.01429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-extensions-of-combined-classical-and-intuitionistic-propositional-logic-1611.01429"/></url>
<url><loc>https://scifaro.com/en/abs/qbf-solving-by-counterexample-guided-expansion-1611.01553</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qbf-solving-by-counterexample-guided-expansion-1611.01553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qbf-solving-by-counterexample-guided-expansion-1611.01553"/></url>
<url><loc>https://scifaro.com/en/abs/closure-and-nonclosure-properties-of-the-compressible-and-rankable-sets-1611.01696</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-and-nonclosure-properties-of-the-compressible-and-rankable-sets-1611.01696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-and-nonclosure-properties-of-the-compressible-and-rankable-sets-1611.01696"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-type-theory-a-constructive-interpretation-of-the-univalence-axiom-1611.02108</loc><lastmod>2016-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-type-theory-a-constructive-interpretation-of-the-univalence-axiom-1611.02108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-type-theory-a-constructive-interpretation-of-the-univalence-axiom-1611.02108"/></url>
<url><loc>https://scifaro.com/en/abs/extending-two-variable-logic-on-trees-1611.02112</loc><lastmod>2016-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-two-variable-logic-on-trees-1611.02112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-two-variable-logic-on-trees-1611.02112"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-model-checking-for-dynamic-pushdown-networks-communicating-via-locks-1611.02528</loc><lastmod>2016-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-model-checking-for-dynamic-pushdown-networks-communicating-via-locks-1611.02528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-model-checking-for-dynamic-pushdown-networks-communicating-via-locks-1611.02528"/></url>
<url><loc>https://scifaro.com/en/abs/universal-algebraic-methods-for-constraint-satisfaction-problems-1611.02867</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-algebraic-methods-for-constraint-satisfaction-problems-1611.02867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-algebraic-methods-for-constraint-satisfaction-problems-1611.02867"/></url>
<url><loc>https://scifaro.com/en/abs/coming-to-terms-with-quantified-reasoning-1611.02908</loc><lastmod>2016-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coming-to-terms-with-quantified-reasoning-1611.02908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coming-to-terms-with-quantified-reasoning-1611.02908"/></url>
<url><loc>https://scifaro.com/en/abs/finite-satisfiability-of-the-two-variable-guarded-fragment-with-transitive-guards-and-related-variants-1611.03267</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-satisfiability-of-the-two-variable-guarded-fragment-with-transitive-guards-and-related-variants-1611.03267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-satisfiability-of-the-two-variable-guarded-fragment-with-transitive-guards-and-related-variants-1611.03267"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-ctl-with-imperfect-information-1611.03524</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-ctl-with-imperfect-information-1611.03524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-ctl-with-imperfect-information-1611.03524"/></url>
<url><loc>https://scifaro.com/en/abs/on-proving-confluence-modulo-equivalence-for-constraint-handling-rules-1611.03628</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-proving-confluence-modulo-equivalence-for-constraint-handling-rules-1611.03628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-proving-confluence-modulo-equivalence-for-constraint-handling-rules-1611.03628"/></url>
<url><loc>https://scifaro.com/en/abs/compatibility-properties-of-synchronously-and-asynchronously-communicating-components-1611.03656</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compatibility-properties-of-synchronously-and-asynchronously-communicating-components-1611.03656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compatibility-properties-of-synchronously-and-asynchronously-communicating-components-1611.03656"/></url>
<url><loc>https://scifaro.com/en/abs/computational-interpretations-of-markov-s-principle-1611.03714</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-interpretations-of-markov-s-principle-1611.03714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-interpretations-of-markov-s-principle-1611.03714"/></url>
<url><loc>https://scifaro.com/en/abs/possibilistic-semantics-for-a-modal-kd45-extension-of-g-odel-fuzzy-logic-1611.04444</loc><lastmod>2016-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/possibilistic-semantics-for-a-modal-kd45-extension-of-g-odel-fuzzy-logic-1611.04444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/possibilistic-semantics-for-a-modal-kd45-extension-of-g-odel-fuzzy-logic-1611.04444"/></url>
<url><loc>https://scifaro.com/en/abs/safety-model-checking-with-complementary-approximations-1611.04946</loc><lastmod>2017-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-model-checking-with-complementary-approximations-1611.04946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-model-checking-with-complementary-approximations-1611.04946"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-trace-semantics-via-forgetful-logics-1611.05183</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-via-forgetful-logics-1611.05183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-trace-semantics-via-forgetful-logics-1611.05183"/></url>
<url><loc>https://scifaro.com/en/abs/stream-packing-for-asynchronous-multi-context-systems-using-asp-1611.05640</loc><lastmod>2016-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stream-packing-for-asynchronous-multi-context-systems-using-asp-1611.05640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stream-packing-for-asynchronous-multi-context-systems-using-asp-1611.05640"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebraic-intersection-type-unification-problem-1611.05672</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebraic-intersection-type-unification-problem-1611.05672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebraic-intersection-type-unification-problem-1611.05672"/></url>
<url><loc>https://scifaro.com/en/abs/monte-carlo-tableau-proof-search-1611.05990</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monte-carlo-tableau-proof-search-1611.05990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monte-carlo-tableau-proof-search-1611.05990"/></url>
<url><loc>https://scifaro.com/en/abs/the-explicit-definition-of-quantifiers-via-hilbert-s-epsilon-is-confluent-and-terminating-1611.06389</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-explicit-definition-of-quantifiers-via-hilbert-s-epsilon-is-confluent-and-terminating-1611.06389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-explicit-definition-of-quantifiers-via-hilbert-s-epsilon-is-confluent-and-terminating-1611.06389"/></url>
<url><loc>https://scifaro.com/en/abs/on-selecting-a-conjunction-operation-in-probabilistic-soft-logic-1611.06631</loc><lastmod>2016-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-selecting-a-conjunction-operation-in-probabilistic-soft-logic-1611.06631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-selecting-a-conjunction-operation-in-probabilistic-soft-logic-1611.06631"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-workshop-on-synthesis-1611.07178</loc><lastmod>2016-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-synthesis-1611.07178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-synthesis-1611.07178"/></url>
<url><loc>https://scifaro.com/en/abs/standardization-and-conservativity-of-a-refined-call-by-value-lambda-calculus-1611.07255</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/standardization-and-conservativity-of-a-refined-call-by-value-lambda-calculus-1611.07255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/standardization-and-conservativity-of-a-refined-call-by-value-lambda-calculus-1611.07255"/></url>
<url><loc>https://scifaro.com/en/abs/mending-fences-with-self-invalidation-and-self-downgrade-1611.07372</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mending-fences-with-self-invalidation-and-self-downgrade-1611.07372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mending-fences-with-self-invalidation-and-self-downgrade-1611.07372"/></url>
<url><loc>https://scifaro.com/en/abs/what-you-really-need-to-know-about-your-neighbor-1611.07621</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-you-really-need-to-know-about-your-neighbor-1611.07621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-you-really-need-to-know-about-your-neighbor-1611.07621"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-bdd-and-add-algorithms-for-energy-games-1611.07622</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-bdd-and-add-algorithms-for-energy-games-1611.07622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-bdd-and-add-algorithms-for-energy-games-1611.07622"/></url>
<url><loc>https://scifaro.com/en/abs/an-update-on-deductive-synthesis-and-repair-in-the-leon-tool-1611.07625</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-update-on-deductive-synthesis-and-repair-in-the-leon-tool-1611.07625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-update-on-deductive-synthesis-and-repair-in-the-leon-tool-1611.07625"/></url>
<url><loc>https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2016-and-beyond-1611.07626</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2016-and-beyond-1611.07626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2016-and-beyond-1611.07626"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-locality-of-arb-invariant-first-order-formulas-with-modulo-counting-quantifiers-1611.07716</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-locality-of-arb-invariant-first-order-formulas-with-modulo-counting-quantifiers-1611.07716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-locality-of-arb-invariant-first-order-formulas-with-modulo-counting-quantifiers-1611.07716"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-invariants-by-linear-algebra-1611.07726</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-invariants-by-linear-algebra-1611.07726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-invariants-by-linear-algebra-1611.07726"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-invariants-by-solving-solvable-loops-1611.07753</loc><lastmod>2016-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-invariants-by-solving-solvable-loops-1611.07753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-invariants-by-solving-solvable-loops-1611.07753"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-based-gr-1-assumptions-refinement-1611.07803</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-based-gr-1-assumptions-refinement-1611.07803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-based-gr-1-assumptions-refinement-1611.07803"/></url>
<url><loc>https://scifaro.com/en/abs/the-problem-of-pi-2-cut-introduction-1611.08208</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-problem-of-pi-2-cut-introduction-1611.08208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-problem-of-pi-2-cut-introduction-1611.08208"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-strategies-on-the-satisfiability-problem-1611.08541</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-the-satisfiability-problem-1611.08541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-the-satisfiability-problem-1611.08541"/></url>
<url><loc>https://scifaro.com/en/abs/admissibility-in-quantitative-graph-games-1611.08677</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/admissibility-in-quantitative-graph-games-1611.08677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/admissibility-in-quantitative-graph-games-1611.08677"/></url>
<url><loc>https://scifaro.com/en/abs/blistrtune-hierarchical-invention-of-theorem-proving-strategies-1611.08733</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blistrtune-hierarchical-invention-of-theorem-proving-strategies-1611.08733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blistrtune-hierarchical-invention-of-theorem-proving-strategies-1611.08733"/></url>
<url><loc>https://scifaro.com/en/abs/adding-path-functional-dependencies-to-the-guarded-two-variable-fragment-with-counting-1611.08738</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-path-functional-dependencies-to-the-guarded-two-variable-fragment-with-counting-1611.08738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-path-functional-dependencies-to-the-guarded-two-variable-fragment-with-counting-1611.08738"/></url>
<url><loc>https://scifaro.com/en/abs/on-sub-propositional-fragments-of-modal-logic-1611.08800</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sub-propositional-fragments-of-modal-logic-1611.08800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sub-propositional-fragments-of-modal-logic-1611.08800"/></url>
<url><loc>https://scifaro.com/en/abs/relational-logic-with-framing-and-hypotheses-technical-report-1611.08992</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-logic-with-framing-and-hypotheses-technical-report-1611.08992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-logic-with-framing-and-hypotheses-technical-report-1611.08992"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-laws-for-true-concurrency-1611.09035</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-laws-for-true-concurrency-1611.09035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-laws-for-true-concurrency-1611.09035"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-cubical-type-theory-1611.09263</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-cubical-type-theory-1611.09263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-cubical-type-theory-1611.09263"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-reductions-for-model-checking-concurrent-software-1611.09318</loc><lastmod>2016-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-reductions-for-model-checking-concurrent-software-1611.09318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-reductions-for-model-checking-concurrent-software-1611.09318"/></url>
<url><loc>https://scifaro.com/en/abs/formal-languages-formally-and-coinductively-1611.09633</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-languages-formally-and-coinductively-1611.09633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-languages-formally-and-coinductively-1611.09633"/></url>
<url><loc>https://scifaro.com/en/abs/matching-multiplications-in-bit-vector-formulas-1611.10146</loc><lastmod>2016-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-multiplications-in-bit-vector-formulas-1611.10146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-multiplications-in-bit-vector-formulas-1611.10146"/></url>
<url><loc>https://scifaro.com/en/abs/determinizing-monitors-for-hml-with-recursion-1611.10212</loc><lastmod>2016-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determinizing-monitors-for-hml-with-recursion-1611.10212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determinizing-monitors-for-hml-with-recursion-1611.10212"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-of-cyber-physical-systems-1612.00484</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-of-cyber-physical-systems-1612.00484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-of-cyber-physical-systems-1612.00484"/></url>
<url><loc>https://scifaro.com/en/abs/from-signatures-to-monads-in-unimath-1612.00693</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-signatures-to-monads-in-unimath-1612.00693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-signatures-to-monads-in-unimath-1612.00693"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-powerdomains-for-probability-and-nondeterminism-1612.01005</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-powerdomains-for-probability-and-nondeterminism-1612.01005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-powerdomains-for-probability-and-nondeterminism-1612.01005"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-rule-for-almost-certain-termination-of-probabilistic-and-demonic-programs-1612.01091</loc><lastmod>2017-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-rule-for-almost-certain-termination-of-probabilistic-and-demonic-programs-1612.01091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-rule-for-almost-certain-termination-of-probabilistic-and-demonic-programs-1612.01091"/></url>
<url><loc>https://scifaro.com/en/abs/globular-an-online-proof-assistant-for-higher-dimensional-rewriting-1612.01093</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/globular-an-online-proof-assistant-for-higher-dimensional-rewriting-1612.01093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/globular-an-online-proof-assistant-for-higher-dimensional-rewriting-1612.01093"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-quantified-bit-vector-arithmetic-with-binary-encoding-1612.01263</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-quantified-bit-vector-arithmetic-with-binary-encoding-1612.01263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-quantified-bit-vector-arithmetic-with-binary-encoding-1612.01263"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-equations-for-temporal-style-assertions-1612.01630</loc><lastmod>2026-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-equations-for-temporal-style-assertions-1612.01630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-equations-for-temporal-style-assertions-1612.01630"/></url>
<url><loc>https://scifaro.com/en/abs/boring-formal-methods-or-sherlock-holmes-deduction-methods-1612.01682</loc><lastmod>2016-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boring-formal-methods-or-sherlock-holmes-deduction-methods-1612.01682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boring-formal-methods-or-sherlock-holmes-deduction-methods-1612.01682"/></url>
<url><loc>https://scifaro.com/en/abs/focusing-in-orthologic-1612.01728</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focusing-in-orthologic-1612.01728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focusing-in-orthologic-1612.01728"/></url>
<url><loc>https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-1612.02055</loc><lastmod>2020-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-1612.02055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-1612.02055"/></url>
<url><loc>https://scifaro.com/en/abs/on-free-omega-continuous-and-regular-ordered-algebras-1612.02106</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-free-omega-continuous-and-regular-ordered-algebras-1612.02106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-free-omega-continuous-and-regular-ordered-algebras-1612.02106"/></url>
<url><loc>https://scifaro.com/en/abs/quotient-inductive-inductive-types-1612.02346</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quotient-inductive-inductive-types-1612.02346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quotient-inductive-inductive-types-1612.02346"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-certified-rat-verification-1612.02353</loc><lastmod>2017-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-certified-rat-verification-1612.02353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-certified-rat-verification-1612.02353"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-by-evaluation-for-type-theory-in-type-theory-1612.02462</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-by-evaluation-for-type-theory-in-type-theory-1612.02462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-by-evaluation-for-type-theory-in-type-theory-1612.02462"/></url>
<url><loc>https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-1612.02785</loc><lastmod>2018-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-1612.02785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorporating-quotation-and-evaluation-into-church-s-type-theory-1612.02785"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-curry-howard-correspondence-1612.02816</loc><lastmod>2016-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-curry-howard-correspondence-1612.02816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-curry-howard-correspondence-1612.02816"/></url>
<url><loc>https://scifaro.com/en/abs/coalp-ty-16-1612.03032</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalp-ty-16-1612.03032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalp-ty-16-1612.03032"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-algorithm-for-monitoring-practical-tptl-specifications-1612.03140</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-monitoring-practical-tptl-specifications-1612.03140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-algorithm-for-monitoring-practical-tptl-specifications-1612.03140"/></url>
<url><loc>https://scifaro.com/en/abs/on-higher-order-query-languages-which-on-relational-databases-collapse-to-second-order-logic-1612.03155</loc><lastmod>2016-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-higher-order-query-languages-which-on-relational-databases-collapse-to-second-order-logic-1612.03155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-higher-order-query-languages-which-on-relational-databases-collapse-to-second-order-logic-1612.03155"/></url>
<url><loc>https://scifaro.com/en/abs/multiparty-testing-preorders-1612.03191</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiparty-testing-preorders-1612.03191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiparty-testing-preorders-1612.03191"/></url>
<url><loc>https://scifaro.com/en/abs/limits-in-categories-of-vietoris-coalgebras-1612.03318</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limits-in-categories-of-vietoris-coalgebras-1612.03318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limits-in-categories-of-vietoris-coalgebras-1612.03318"/></url>
<url><loc>https://scifaro.com/en/abs/double-successive-rough-set-approximations-1612.03814</loc><lastmod>2016-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/double-successive-rough-set-approximations-1612.03814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/double-successive-rough-set-approximations-1612.03814"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-doctoral-workshop-on-mathematical-and-engineering-methods-in-computer-science-1612.04037</loc><lastmod>2016-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-doctoral-workshop-on-mathematical-and-engineering-methods-in-computer-science-1612.04037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-doctoral-workshop-on-mathematical-and-engineering-methods-in-computer-science-1612.04037"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-computability-logic-1612.04513</loc><lastmod>2016-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-computability-logic-1612.04513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-computability-logic-1612.04513"/></url>
<url><loc>https://scifaro.com/en/abs/a-compositional-framework-for-preference-aware-agents-1612.04973</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-compositional-framework-for-preference-aware-agents-1612.04973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-compositional-framework-for-preference-aware-agents-1612.04973"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-approximate-conformance-relation-for-hybrid-i-o-automata-1612.04975</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-approximate-conformance-relation-for-hybrid-i-o-automata-1612.04975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-approximate-conformance-relation-for-hybrid-i-o-automata-1612.04975"/></url>
<url><loc>https://scifaro.com/en/abs/a-light-weight-approach-for-verifying-multi-threaded-programs-with-cpachecker-1612.04983</loc><lastmod>2016-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-light-weight-approach-for-verifying-multi-threaded-programs-with-cpachecker-1612.04983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-light-weight-approach-for-verifying-multi-threaded-programs-with-cpachecker-1612.04983"/></url>
<url><loc>https://scifaro.com/en/abs/a-coalgebraic-treatment-of-conditional-transition-systems-with-upgrades-1612.05002</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coalgebraic-treatment-of-conditional-transition-systems-with-upgrades-1612.05002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coalgebraic-treatment-of-conditional-transition-systems-with-upgrades-1612.05002"/></url>
<url><loc>https://scifaro.com/en/abs/an-early-sign-of-satisfiability-1612.05019</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-early-sign-of-satisfiability-1612.05019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-early-sign-of-satisfiability-1612.05019"/></url>
<url><loc>https://scifaro.com/en/abs/relativizing-an-incompressible-number-and-an-incompressible-function-through-subrecursive-extensions-of-turing-machines-1612.05221</loc><lastmod>2016-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relativizing-an-incompressible-number-and-an-incompressible-function-through-subrecursive-extensions-of-turing-machines-1612.05221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relativizing-an-incompressible-number-and-an-incompressible-function-through-subrecursive-extensions-of-turing-machines-1612.05221"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-data-aware-business-processes-in-the-presence-of-ontologies-1612.05456</loc><lastmod>2016-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-data-aware-business-processes-in-the-presence-of-ontologies-1612.05456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-data-aware-business-processes-in-the-presence-of-ontologies-1612.05456"/></url>
<url><loc>https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-ii-curry-howard-correspondence-for-markov-s-principle-in-first-order-logic-and-arithmetic-1612.05457</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-ii-curry-howard-correspondence-for-markov-s-principle-in-first-order-logic-and-arithmetic-1612.05457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-natural-deduction-for-herbrand-constructive-logics-ii-curry-howard-correspondence-for-markov-s-principle-in-first-order-logic-and-arithmetic-1612.05457"/></url>
<url><loc>https://scifaro.com/en/abs/varieties-of-metric-and-quantitative-algebras-1612.06054</loc><lastmod>2016-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/varieties-of-metric-and-quantitative-algebras-1612.06054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/varieties-of-metric-and-quantitative-algebras-1612.06054"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-confluence-proofs-via-relative-termination-and-rule-labeling-1612.07195</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-confluence-proofs-via-relative-termination-and-rule-labeling-1612.07195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-confluence-proofs-via-relative-termination-and-rule-labeling-1612.07195"/></url>
<url><loc>https://scifaro.com/en/abs/natural-transformations-as-rewrite-rules-and-monad-composition-1612.07273</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-transformations-as-rewrite-rules-and-monad-composition-1612.07273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-transformations-as-rewrite-rules-and-monad-composition-1612.07273"/></url>
<url><loc>https://scifaro.com/en/abs/extension-by-conservation-sikorski-s-theorem-1612.07345</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-by-conservation-sikorski-s-theorem-1612.07345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-by-conservation-sikorski-s-theorem-1612.07345"/></url>
<url><loc>https://scifaro.com/en/abs/the-paradox-of-computability-and-a-recursive-relative-version-of-the-busy-beaver-function-1612.07400</loc><lastmod>2016-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-paradox-of-computability-and-a-recursive-relative-version-of-the-busy-beaver-function-1612.07400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-paradox-of-computability-and-a-recursive-relative-version-of-the-busy-beaver-function-1612.07400"/></url>
<url><loc>https://scifaro.com/en/abs/equations-in-oligomorphic-clones-and-the-constraint-satisfaction-problem-for-omega-categorical-structures-1612.07551</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equations-in-oligomorphic-clones-and-the-constraint-satisfaction-problem-for-omega-categorical-structures-1612.07551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equations-in-oligomorphic-clones-and-the-constraint-satisfaction-problem-for-omega-categorical-structures-1612.07551"/></url>
<url><loc>https://scifaro.com/en/abs/counting-answer-sets-via-dynamic-programming-1612.07601</loc><lastmod>2016-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-answer-sets-via-dynamic-programming-1612.07601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-answer-sets-via-dynamic-programming-1612.07601"/></url>
<url><loc>https://scifaro.com/en/abs/random-generation-of-closed-simply-typed-lambda-terms-a-synergy-between-logic-programming-and-boltzmann-samplers-1612.07682</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-generation-of-closed-simply-typed-lambda-terms-a-synergy-between-logic-programming-and-boltzmann-samplers-1612.07682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-generation-of-closed-simply-typed-lambda-terms-a-synergy-between-logic-programming-and-boltzmann-samplers-1612.07682"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-regular-expressions-for-arrhythmia-detection-algorithms-1612.07770</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-regular-expressions-for-arrhythmia-detection-algorithms-1612.07770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-regular-expressions-for-arrhythmia-detection-algorithms-1612.07770"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-logics-a-coalgebraic-perspective-1612.07844</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-logics-a-coalgebraic-perspective-1612.07844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-logics-a-coalgebraic-perspective-1612.07844"/></url>
<url><loc>https://scifaro.com/en/abs/negotiation-as-concurrency-primitive-1612.07912</loc><lastmod>2016-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negotiation-as-concurrency-primitive-1612.07912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negotiation-as-concurrency-primitive-1612.07912"/></url>
<url><loc>https://scifaro.com/en/abs/dimensional-confluence-algebra-of-information-space-modulo-quotient-abstraction-relations-in-automated-problem-solving-paradigm-1612.07983</loc><lastmod>2016-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dimensional-confluence-algebra-of-information-space-modulo-quotient-abstraction-relations-in-automated-problem-solving-paradigm-1612.07983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dimensional-confluence-algebra-of-information-space-modulo-quotient-abstraction-relations-in-automated-problem-solving-paradigm-1612.07983"/></url>
<url><loc>https://scifaro.com/en/abs/the-formal-logical-characterisation-of-lies-deception-and-associated-notions-1612.08845</loc><lastmod>2016-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-formal-logical-characterisation-of-lies-deception-and-associated-notions-1612.08845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-formal-logical-characterisation-of-lies-deception-and-associated-notions-1612.08845"/></url>
<url><loc>https://scifaro.com/en/abs/lifted-relational-algebra-with-recursion-and-connections-to-modal-logic-1612.09251</loc><lastmod>2016-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifted-relational-algebra-with-recursion-and-connections-to-modal-logic-1612.09251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifted-relational-algebra-with-recursion-and-connections-to-modal-logic-1612.09251"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-topologicity-of-quantale-valued-topological-spaces-1612.09504</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-topologicity-of-quantale-valued-topological-spaces-1612.09504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-topologicity-of-quantale-valued-topological-spaces-1612.09504"/></url>
<url><loc>https://scifaro.com/en/abs/a-ghost-at-omega-1-1612.09514</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-ghost-at-omega-1-1612.09514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-ghost-at-omega-1-1612.09514"/></url>
<url><loc>https://scifaro.com/en/abs/using-coalgebras-and-the-giry-monad-for-interpreting-game-logics-a-tutorial-1701.00280</loc><lastmod>2017-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-coalgebras-and-the-giry-monad-for-interpreting-game-logics-a-tutorial-1701.00280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-coalgebras-and-the-giry-monad-for-interpreting-game-logics-a-tutorial-1701.00280"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-view-on-renaming-1701.00624</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-view-on-renaming-1701.00624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-view-on-renaming-1701.00624"/></url>
<url><loc>https://scifaro.com/en/abs/on-upper-bounds-on-the-church-rosser-theorem-1701.00637</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-upper-bounds-on-the-church-rosser-theorem-1701.00637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-upper-bounds-on-the-church-rosser-theorem-1701.00637"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-of-conditional-term-rewrite-systems-via-transformations-1701.00638</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-of-conditional-term-rewrite-systems-via-transformations-1701.00638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-of-conditional-term-rewrite-systems-via-transformations-1701.00638"/></url>
<url><loc>https://scifaro.com/en/abs/an-extension-of-proof-graphs-for-disjunctive-parameterised-boolean-equation-systems-1701.00639</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-proof-graphs-for-disjunctive-parameterised-boolean-equation-systems-1701.00639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-proof-graphs-for-disjunctive-parameterised-boolean-equation-systems-1701.00639"/></url>
<url><loc>https://scifaro.com/en/abs/ambiguity-and-incomplete-information-in-categorical-models-of-language-1701.00660</loc><lastmod>2017-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ambiguity-and-incomplete-information-in-categorical-models-of-language-1701.00660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ambiguity-and-incomplete-information-in-categorical-models-of-language-1701.00660"/></url>
<url><loc>https://scifaro.com/en/abs/metric-temporal-logic-for-ontology-based-data-access-over-log-data-1701.00976</loc><lastmod>2017-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-temporal-logic-for-ontology-based-data-access-over-log-data-1701.00976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-temporal-logic-for-ontology-based-data-access-over-log-data-1701.00976"/></url>
<url><loc>https://scifaro.com/en/abs/cofree-coalgebras-and-differential-linear-logic-1701.01285</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cofree-coalgebras-and-differential-linear-logic-1701.01285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cofree-coalgebras-and-differential-linear-logic-1701.01285"/></url>
<url><loc>https://scifaro.com/en/abs/paths-based-criteria-and-application-to-linear-logic-subsystems-characterizing-polynomial-time-1701.01413</loc><lastmod>2017-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paths-based-criteria-and-application-to-linear-logic-subsystems-characterizing-polynomial-time-1701.01413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paths-based-criteria-and-application-to-linear-logic-subsystems-characterizing-polynomial-time-1701.01413"/></url>
<url><loc>https://scifaro.com/en/abs/type-homogeneity-is-not-a-restriction-for-safe-recursion-schemes-1701.02118</loc><lastmod>2017-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-homogeneity-is-not-a-restriction-for-safe-recursion-schemes-1701.02118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-homogeneity-is-not-a-restriction-for-safe-recursion-schemes-1701.02118"/></url>
<url><loc>https://scifaro.com/en/abs/finding-and-or-hierarchies-in-workflow-nets-1701.02199</loc><lastmod>2017-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-and-or-hierarchies-in-workflow-nets-1701.02199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-and-or-hierarchies-in-workflow-nets-1701.02199"/></url>
<url><loc>https://scifaro.com/en/abs/rewritability-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-1701.02231</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewritability-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-1701.02231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewritability-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-1701.02231"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-time-computation-on-metric-spaces-and-banach-spaces-1701.02274</loc><lastmod>2017-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-time-computation-on-metric-spaces-and-banach-spaces-1701.02274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-time-computation-on-metric-spaces-and-banach-spaces-1701.02274"/></url>
<url><loc>https://scifaro.com/en/abs/resolution-simulates-ordered-binary-decision-diagrams-for-formulas-in-conjunctive-normal-form-1701.02275</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resolution-simulates-ordered-binary-decision-diagrams-for-formulas-in-conjunctive-normal-form-1701.02275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resolution-simulates-ordered-binary-decision-diagrams-for-formulas-in-conjunctive-normal-form-1701.02275"/></url>
<url><loc>https://scifaro.com/en/abs/domains-and-event-structures-for-fusions-1701.02394</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-and-event-structures-for-fusions-1701.02394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-and-event-structures-for-fusions-1701.02394"/></url>
<url><loc>https://scifaro.com/en/abs/closure-structures-parameterized-by-systems-of-isotone-galois-connections-1701.02445</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-structures-parameterized-by-systems-of-isotone-galois-connections-1701.02445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-structures-parameterized-by-systems-of-isotone-galois-connections-1701.02445"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-under-definable-changes-1701.02494</loc><lastmod>2017-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-under-definable-changes-1701.02494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-under-definable-changes-1701.02494"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-and-reasoning-about-wireless-networks-a-graph-based-calculus-approach-1701.02526</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-and-reasoning-about-wireless-networks-a-graph-based-calculus-approach-1701.02526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-and-reasoning-about-wireless-networks-a-graph-based-calculus-approach-1701.02526"/></url>
<url><loc>https://scifaro.com/en/abs/mdps-with-energy-parity-objectives-1701.02546</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mdps-with-energy-parity-objectives-1701.02546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mdps-with-energy-parity-objectives-1701.02546"/></url>
<url><loc>https://scifaro.com/en/abs/stack-semantics-of-type-theory-1701.02571</loc><lastmod>2017-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stack-semantics-of-type-theory-1701.02571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stack-semantics-of-type-theory-1701.02571"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-satisfaction-problems-over-semilattice-block-mal-tsev-algebras-1701.02623</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-over-semilattice-block-mal-tsev-algebras-1701.02623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-over-semilattice-block-mal-tsev-algebras-1701.02623"/></url>
<url><loc>https://scifaro.com/en/abs/a-crevice-on-the-crane-beach-finite-degree-predicates-1701.02673</loc><lastmod>2017-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-crevice-on-the-crane-beach-finite-degree-predicates-1701.02673"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-crevice-on-the-crane-beach-finite-degree-predicates-1701.02673"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-for-the-tamari-order-1701.02917</loc><lastmod>2017-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-for-the-tamari-order-1701.02917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-for-the-tamari-order-1701.02917"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-verification-and-interactive-theorem-proving-1701.03602</loc><lastmod>2017-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-verification-and-interactive-theorem-proving-1701.03602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-verification-and-interactive-theorem-proving-1701.03602"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-decidable-logicweb-via-length-bounded-derivations-1701.03615</loc><lastmod>2017-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-decidable-logicweb-via-length-bounded-derivations-1701.03615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-decidable-logicweb-via-length-bounded-derivations-1701.03615"/></url>
<url><loc>https://scifaro.com/en/abs/model-theory-and-proof-theory-of-coalgebraic-predicate-logic-1701.03773</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-theory-and-proof-theory-of-coalgebraic-predicate-logic-1701.03773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-theory-and-proof-theory-of-coalgebraic-predicate-logic-1701.03773"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-quantified-constraints-using-the-algebraic-formulation-1701.04086</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-quantified-constraints-using-the-algebraic-formulation-1701.04086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-quantified-constraints-using-the-algebraic-formulation-1701.04086"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-efficient-reduction-of-lambda-terms-1701.04240</loc><lastmod>2017-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-efficient-reduction-of-lambda-terms-1701.04240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-efficient-reduction-of-lambda-terms-1701.04240"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-closure-in-intensional-type-theory-1701.04391</loc><lastmod>2017-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-closure-in-intensional-type-theory-1701.04391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-closure-in-intensional-type-theory-1701.04391"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-linearity-1701.04522</loc><lastmod>2017-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-linearity-1701.04522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-linearity-1701.04522"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relationship-between-bisimulation-and-trace-equivalence-in-an-approximate-probabilistic-context-extended-version-1701.04547</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relationship-between-bisimulation-and-trace-equivalence-in-an-approximate-probabilistic-context-extended-version-1701.04547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relationship-between-bisimulation-and-trace-equivalence-in-an-approximate-probabilistic-context-extended-version-1701.04547"/></url>
<url><loc>https://scifaro.com/en/abs/circuit-treewidth-sentential-decision-and-query-compilation-1701.04626</loc><lastmod>2017-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circuit-treewidth-sentential-decision-and-query-compilation-1701.04626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circuit-treewidth-sentential-decision-and-query-compilation-1701.04626"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-reduction-without-oracle-1701.04691</loc><lastmod>2017-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-reduction-without-oracle-1701.04691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-reduction-without-oracle-1701.04691"/></url>
<url><loc>https://scifaro.com/en/abs/on-higher-order-probabilistic-subrecursion-1701.04786</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-higher-order-probabilistic-subrecursion-1701.04786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-higher-order-probabilistic-subrecursion-1701.04786"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theory-for-model-checking-an-extended-abstract-1701.04915</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theory-for-model-checking-an-extended-abstract-1701.04915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theory-for-model-checking-an-extended-abstract-1701.04915"/></url>
<url><loc>https://scifaro.com/en/abs/krivine-machine-and-taylor-expansion-in-a-non-uniform-setting-1701.04916</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/krivine-machine-and-taylor-expansion-in-a-non-uniform-setting-1701.04916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/krivine-machine-and-taylor-expansion-in-a-non-uniform-setting-1701.04916"/></url>
<url><loc>https://scifaro.com/en/abs/surface-proofs-for-nonsymmetric-linear-logic-extended-abstract-1701.04917</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/surface-proofs-for-nonsymmetric-linear-logic-extended-abstract-1701.04917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/surface-proofs-for-nonsymmetric-linear-logic-extended-abstract-1701.04917"/></url>
<url><loc>https://scifaro.com/en/abs/linear-beta-reduction-1701.04918</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-beta-reduction-1701.04918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-beta-reduction-1701.04918"/></url>
<url><loc>https://scifaro.com/en/abs/linear-exponential-comonads-without-symmetry-1701.04919</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-exponential-comonads-without-symmetry-1701.04919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-exponential-comonads-without-symmetry-1701.04919"/></url>
<url><loc>https://scifaro.com/en/abs/non-blocking-concurrent-imperative-programming-with-session-types-1701.04920</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-blocking-concurrent-imperative-programming-with-session-types-1701.04920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-blocking-concurrent-imperative-programming-with-session-types-1701.04920"/></url>
<url><loc>https://scifaro.com/en/abs/mathematical-logic-for-systems-biology-invited-paper-1701.05063</loc><lastmod>2017-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematical-logic-for-systems-biology-invited-paper-1701.05063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematical-logic-for-systems-biology-invited-paper-1701.05063"/></url>
<url><loc>https://scifaro.com/en/abs/ceres-in-propositional-proof-schemata-1701.05251</loc><lastmod>2017-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ceres-in-propositional-proof-schemata-1701.05251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ceres-in-propositional-proof-schemata-1701.05251"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-and-counting-1701.05303</loc><lastmod>2017-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-and-counting-1701.05303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-and-counting-1701.05303"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterisation-of-open-bisimilarity-using-an-intuitionistic-modal-logic-1701.05324</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterisation-of-open-bisimilarity-using-an-intuitionistic-modal-logic-1701.05324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterisation-of-open-bisimilarity-using-an-intuitionistic-modal-logic-1701.05324"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-the-conditional-expected-reward-for-reaching-the-goal-1701.05389</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-the-conditional-expected-reward-for-reaching-the-goal-1701.05389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-the-conditional-expected-reward-for-reaching-the-goal-1701.05389"/></url>
<url><loc>https://scifaro.com/en/abs/ologisms-1701.05408</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ologisms-1701.05408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ologisms-1701.05408"/></url>
<url><loc>https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-general-case-long-version-1701.05521</loc><lastmod>2017-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-general-case-long-version-1701.05521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-reasoning-about-lambda-terms-the-general-case-long-version-1701.05521"/></url>
<url><loc>https://scifaro.com/en/abs/parametricity-automorphisms-of-the-universe-and-excluded-middle-1701.05617</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametricity-automorphisms-of-the-universe-and-excluded-middle-1701.05617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametricity-automorphisms-of-the-universe-and-excluded-middle-1701.05617"/></url>
<url><loc>https://scifaro.com/en/abs/index-appearance-record-for-transforming-rabin-automata-into-parity-automata-1701.05738</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/index-appearance-record-for-transforming-rabin-automata-into-parity-automata-1701.05738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/index-appearance-record-for-transforming-rabin-automata-into-parity-automata-1701.05738"/></url>
<url><loc>https://scifaro.com/en/abs/from-ltl-and-limit-deterministic-b-uchi-automata-to-deterministic-parity-automata-1701.06103</loc><lastmod>2018-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-ltl-and-limit-deterministic-b-uchi-automata-to-deterministic-parity-automata-1701.06103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-ltl-and-limit-deterministic-b-uchi-automata-to-deterministic-parity-automata-1701.06103"/></url>
<url><loc>https://scifaro.com/en/abs/retractability-games-and-orchestrators-for-session-contracts-1701.06142</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retractability-games-and-orchestrators-for-session-contracts-1701.06142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retractability-games-and-orchestrators-for-session-contracts-1701.06142"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-pomdps-1701.06209</loc><lastmod>2017-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-pomdps-1701.06209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-pomdps-1701.06209"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-categories-for-higher-dimensional-parametricity-1701.06244</loc><lastmod>2017-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-categories-for-higher-dimensional-parametricity-1701.06244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-categories-for-higher-dimensional-parametricity-1701.06244"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-automata-techniques-for-ws1s-1701.06282</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-automata-techniques-for-ws1s-1701.06282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-automata-techniques-for-ws1s-1701.06282"/></url>
<url><loc>https://scifaro.com/en/abs/enigma-efficient-learning-based-inference-guiding-machine-1701.06532</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enigma-efficient-learning-based-inference-guiding-machine-1701.06532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enigma-efficient-learning-based-inference-guiding-machine-1701.06532"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-qbf-solvers-quantifier-alternations-matter-1701.06612</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-qbf-solvers-quantifier-alternations-matter-1701.06612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-qbf-solvers-quantifier-alternations-matter-1701.06612"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-algorithms-for-computing-distances-of-fuzzy-transition-systems-1701.06644</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-computing-distances-of-fuzzy-transition-systems-1701.06644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-algorithms-for-computing-distances-of-fuzzy-transition-systems-1701.06644"/></url>
<url><loc>https://scifaro.com/en/abs/ordering-information-on-distributions-1701.06924</loc><lastmod>2017-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordering-information-on-distributions-1701.06924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordering-information-on-distributions-1701.06924"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-tree-decompositions-in-mso-1701.06937</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-tree-decompositions-in-mso-1701.06937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-tree-decompositions-in-mso-1701.06937"/></url>
<url><loc>https://scifaro.com/en/abs/tactical-diagrammatic-reasoning-1701.07126</loc><lastmod>2017-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tactical-diagrammatic-reasoning-1701.07126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tactical-diagrammatic-reasoning-1701.07126"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-proof-presentations-with-cobra-1701.07127</loc><lastmod>2017-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-proof-presentations-with-cobra-1701.07127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-proof-presentations-with-cobra-1701.07127"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-complexity-and-expressiveness-of-first-order-logic-over-the-subword-ordering-1701.07470</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-complexity-and-expressiveness-of-first-order-logic-over-the-subword-ordering-1701.07470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-complexity-and-expressiveness-of-first-order-logic-over-the-subword-ordering-1701.07470"/></url>
<url><loc>https://scifaro.com/en/abs/quotients-in-monadic-programming-projective-algebras-are-equivalent-to-coalgebras-1701.07601</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quotients-in-monadic-programming-projective-algebras-are-equivalent-to-coalgebras-1701.07601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quotients-in-monadic-programming-projective-algebras-are-equivalent-to-coalgebras-1701.07601"/></url>
<url><loc>https://scifaro.com/en/abs/droidstar-callback-typestates-for-android-classes-1701.07842</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/droidstar-callback-typestates-for-android-classes-1701.07842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/droidstar-callback-typestates-for-android-classes-1701.07842"/></url>
<url><loc>https://scifaro.com/en/abs/homotopies-for-free-1701.07937</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopies-for-free-1701.07937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopies-for-free-1701.07937"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-open-call-by-value-extended-version-1701.08186</loc><lastmod>2017-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-open-call-by-value-extended-version-1701.08186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-open-call-by-value-extended-version-1701.08186"/></url>
<url><loc>https://scifaro.com/en/abs/sos-based-modal-decomposition-on-nondeterministic-probabilistic-processes-1701.08330</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sos-based-modal-decomposition-on-nondeterministic-probabilistic-processes-1701.08330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sos-based-modal-decomposition-on-nondeterministic-probabilistic-processes-1701.08330"/></url>
<url><loc>https://scifaro.com/en/abs/a-homotopy-theoretic-model-of-function-extensionality-in-the-effective-topos-1701.08369</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-homotopy-theoretic-model-of-function-extensionality-in-the-effective-topos-1701.08369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-homotopy-theoretic-model-of-function-extensionality-in-the-effective-topos-1701.08369"/></url>
<url><loc>https://scifaro.com/en/abs/computable-operations-on-compact-subsets-of-metric-spaces-with-applications-to-fr-echet-distance-and-shape-optimization-1701.08402</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-operations-on-compact-subsets-of-metric-spaces-with-applications-to-fr-echet-distance-and-shape-optimization-1701.08402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-operations-on-compact-subsets-of-metric-spaces-with-applications-to-fr-echet-distance-and-shape-optimization-1701.08402"/></url>
<url><loc>https://scifaro.com/en/abs/the-keymaera-x-proof-ide-concepts-on-usability-in-hybrid-systems-theorem-proving-1701.08469</loc><lastmod>2017-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-keymaera-x-proof-ide-concepts-on-usability-in-hybrid-systems-theorem-proving-1701.08469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-keymaera-x-proof-ide-concepts-on-usability-in-hybrid-systems-theorem-proving-1701.08469"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-for-successor-invariant-first-order-formulas-on-graph-classes-of-bounded-expansion-1701.08516</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-for-successor-invariant-first-order-formulas-on-graph-classes-of-bounded-expansion-1701.08516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-for-successor-invariant-first-order-formulas-on-graph-classes-of-bounded-expansion-1701.08516"/></url>
<url><loc>https://scifaro.com/en/abs/an-omega-algebra-for-real-time-energy-problems-1701.08524</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-omega-algebra-for-real-time-energy-problems-1701.08524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-omega-algebra-for-real-time-energy-problems-1701.08524"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-semantics-for-higher-order-logic-programs-with-negation-1701.08622</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-semantics-for-higher-order-logic-programs-with-negation-1701.08622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-semantics-for-higher-order-logic-programs-with-negation-1701.08622"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-convex-programming-for-the-efficient-verification-of-parametric-mdps-1702.00063</loc><lastmod>2017-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-convex-programming-for-the-efficient-verification-of-parametric-mdps-1702.00063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-convex-programming-for-the-efficient-verification-of-parametric-mdps-1702.00063"/></url>
<url><loc>https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-syntax-and-semantics-1702.00268</loc><lastmod>2018-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-syntax-and-semantics-1702.00268"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-diagrams-for-multiplicative-linear-logic-syntax-and-semantics-1702.00268"/></url>
<url><loc>https://scifaro.com/en/abs/blocked-clauses-in-first-order-logic-1702.00847</loc><lastmod>2017-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blocked-clauses-in-first-order-logic-1702.00847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blocked-clauses-in-first-order-logic-1702.00847"/></url>
<url><loc>https://scifaro.com/en/abs/an-operational-semantics-for-the-cognitive-architecture-act-r-and-its-translation-to-constraint-handling-rules-1702.01606</loc><lastmod>2017-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-operational-semantics-for-the-cognitive-architecture-act-r-and-its-translation-to-constraint-handling-rules-1702.01606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-operational-semantics-for-the-cognitive-architecture-act-r-and-its-translation-to-constraint-handling-rules-1702.01606"/></url>
<url><loc>https://scifaro.com/en/abs/petri-automata-1702.01804</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-automata-1702.01804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-automata-1702.01804"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-eighth-workshop-on-intersection-types-and-related-systems-1702.01874</loc><lastmod>2017-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-eighth-workshop-on-intersection-types-and-related-systems-1702.01874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-eighth-workshop-on-intersection-types-and-related-systems-1702.01874"/></url>
<url><loc>https://scifaro.com/en/abs/characterisation-of-approximation-and-head-normalisation-for-lambda-mu-using-strict-intersection-types-1702.02273</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterisation-of-approximation-and-head-normalisation-for-lambda-mu-using-strict-intersection-types-1702.02273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterisation-of-approximation-and-head-normalisation-for-lambda-mu-using-strict-intersection-types-1702.02273"/></url>
<url><loc>https://scifaro.com/en/abs/retractions-in-intersection-types-1702.02274</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retractions-in-intersection-types-1702.02274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retractions-in-intersection-types-1702.02274"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-and-counting-1702.02278</loc><lastmod>2017-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-and-counting-1702.02278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-and-counting-1702.02278"/></url>
<url><loc>https://scifaro.com/en/abs/refining-trace-abstraction-using-abstract-interpretation-1702.02369</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-trace-abstraction-using-abstract-interpretation-1702.02369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-trace-abstraction-using-abstract-interpretation-1702.02369"/></url>
<url><loc>https://scifaro.com/en/abs/on-optimization-modulo-theories-maxsmt-and-sorting-networks-1702.02385</loc><lastmod>2017-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-optimization-modulo-theories-maxsmt-and-sorting-networks-1702.02385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-optimization-modulo-theories-maxsmt-and-sorting-networks-1702.02385"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-reductivity-of-logically-constrained-term-rewriting-systems-1702.02397</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-reductivity-of-logically-constrained-term-rewriting-systems-1702.02397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-reductivity-of-logically-constrained-term-rewriting-systems-1702.02397"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-quantitative-deduction-system-for-the-bisimilarity-distance-on-markov-chains-1702.02528</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-quantitative-deduction-system-for-the-bisimilarity-distance-on-markov-chains-1702.02528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-quantitative-deduction-system-for-the-bisimilarity-distance-on-markov-chains-1702.02528"/></url>
<url><loc>https://scifaro.com/en/abs/answer-set-solving-with-bounded-treewidth-revisited-1702.02890</loc><lastmod>2017-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answer-set-solving-with-bounded-treewidth-revisited-1702.02890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answer-set-solving-with-bounded-treewidth-revisited-1702.02890"/></url>
<url><loc>https://scifaro.com/en/abs/a-set-theoretical-approach-for-abox-reasoning-services-extended-version-1702.03096</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-set-theoretical-approach-for-abox-reasoning-services-extended-version-1702.03096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-set-theoretical-approach-for-abox-reasoning-services-extended-version-1702.03096"/></url>
<url><loc>https://scifaro.com/en/abs/local-lexing-1702.03277</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-lexing-1702.03277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-lexing-1702.03277"/></url>
<url><loc>https://scifaro.com/en/abs/a-more-sensitive-context-1702.03288</loc><lastmod>2017-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-more-sensitive-context-1702.03288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-more-sensitive-context-1702.03288"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strongest-three-valued-paraconsistent-logic-contained-in-classical-logic-and-its-dual-1702.03414</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strongest-three-valued-paraconsistent-logic-contained-in-classical-logic-and-its-dual-1702.03414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strongest-three-valued-paraconsistent-logic-contained-in-classical-logic-and-its-dual-1702.03414"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-reachability-in-timed-automata-1702.03450</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-reachability-in-timed-automata-1702.03450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-reachability-in-timed-automata-1702.03450"/></url>
<url><loc>https://scifaro.com/en/abs/time-computational-complexity-and-probability-in-the-analysis-of-distance-bounding-protocols-1702.03504</loc><lastmod>2017-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-computational-complexity-and-probability-in-the-analysis-of-distance-bounding-protocols-1702.03504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-computational-complexity-and-probability-in-the-analysis-of-distance-bounding-protocols-1702.03504"/></url>
<url><loc>https://scifaro.com/en/abs/a-better-model-of-computation-for-digital-physics-1702.03523</loc><lastmod>2017-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-better-model-of-computation-for-digital-physics-1702.03523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-better-model-of-computation-for-digital-physics-1702.03523"/></url>
<url><loc>https://scifaro.com/en/abs/size-relationships-in-abstract-cyclic-entailment-systems-1702.03981</loc><lastmod>2017-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-relationships-in-abstract-cyclic-entailment-systems-1702.03981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-relationships-in-abstract-cyclic-entailment-systems-1702.03981"/></url>
<url><loc>https://scifaro.com/en/abs/vmdv-a-3d-visualization-tool-for-modeling-demonstration-and-verification-1702.04478</loc><lastmod>2017-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vmdv-a-3d-visualization-tool-for-modeling-demonstration-and-verification-1702.04478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vmdv-a-3d-visualization-tool-for-modeling-demonstration-and-verification-1702.04478"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-study-of-some-common-principles-of-inductive-definition-and-its-implications-for-knowledge-representation-1702.04551</loc><lastmod>2017-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-study-of-some-common-principles-of-inductive-definition-and-its-implications-for-knowledge-representation-1702.04551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-study-of-some-common-principles-of-inductive-definition-and-its-implications-for-knowledge-representation-1702.04551"/></url>
<url><loc>https://scifaro.com/en/abs/convolution-algebras-relational-convolution-generalised-modalities-and-incidence-algebras-1702.04603</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convolution-algebras-relational-convolution-generalised-modalities-and-incidence-algebras-1702.04603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convolution-algebras-relational-convolution-generalised-modalities-and-incidence-algebras-1702.04603"/></url>
<url><loc>https://scifaro.com/en/abs/towards-m-adhesive-categories-based-on-coalgebras-and-comma-categories-1702.04650</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-m-adhesive-categories-based-on-coalgebras-and-comma-categories-1702.04650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-m-adhesive-categories-based-on-coalgebras-and-comma-categories-1702.04650"/></url>
<url><loc>https://scifaro.com/en/abs/is-your-software-on-dope-formal-analysis-of-surreptitiously-enhanced-programs-1702.04693</loc><lastmod>2017-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-your-software-on-dope-formal-analysis-of-surreptitiously-enhanced-programs-1702.04693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-your-software-on-dope-formal-analysis-of-surreptitiously-enhanced-programs-1702.04693"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-logic-with-measure-and-category-quantifiers-1702.04769</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-measure-and-category-quantifiers-1702.04769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-measure-and-category-quantifiers-1702.04769"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-type-theory-with-strict-equality-1702.04912</loc><lastmod>2017-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-type-theory-with-strict-equality-1702.04912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-type-theory-with-strict-equality-1702.04912"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-semantic-model-of-computation-1702.05073</loc><lastmod>2018-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-semantic-model-of-computation-1702.05073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-semantic-model-of-computation-1702.05073"/></url>
<url><loc>https://scifaro.com/en/abs/information-systems-with-witnesses-the-function-space-construction-1702.05079</loc><lastmod>2021-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-systems-with-witnesses-the-function-space-construction-1702.05079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-systems-with-witnesses-the-function-space-construction-1702.05079"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-approach-to-mso-definability-on-countable-linear-orderings-1702.05342</loc><lastmod>2018-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-approach-to-mso-definability-on-countable-linear-orderings-1702.05342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-approach-to-mso-definability-on-countable-linear-orderings-1702.05342"/></url>
<url><loc>https://scifaro.com/en/abs/threshold-constraints-with-guarantees-for-parity-objectives-in-markov-decision-processes-1702.05472</loc><lastmod>2017-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/threshold-constraints-with-guarantees-for-parity-objectives-in-markov-decision-processes-1702.05472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/threshold-constraints-with-guarantees-for-parity-objectives-in-markov-decision-processes-1702.05472"/></url>
<url><loc>https://scifaro.com/en/abs/local-redundancy-in-sat-generalizations-of-blocked-clauses-1702.05527</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-redundancy-in-sat-generalizations-of-blocked-clauses-1702.05527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-redundancy-in-sat-generalizations-of-blocked-clauses-1702.05527"/></url>
<url><loc>https://scifaro.com/en/abs/two-lower-bounds-for-bpa-1702.05578</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-lower-bounds-for-bpa-1702.05578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-lower-bounds-for-bpa-1702.05578"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-monoids-of-possibly-non-halting-programs-and-tests-1702.05752</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-monoids-of-possibly-non-halting-programs-and-tests-1702.05752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-if-then-else-over-monoids-of-possibly-non-halting-programs-and-tests-1702.05752"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-layered-graph-logic-semantics-and-proof-theory-1702.05795</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-layered-graph-logic-semantics-and-proof-theory-1702.05795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-layered-graph-logic-semantics-and-proof-theory-1702.05795"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-laws-for-weak-consistency-extended-version-1702.06028</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-laws-for-weak-consistency-extended-version-1702.06028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-laws-for-weak-consistency-extended-version-1702.06028"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-needed-reduction-for-pure-interaction-nets-1702.06092</loc><lastmod>2017-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-needed-reduction-for-pure-interaction-nets-1702.06092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-needed-reduction-for-pure-interaction-nets-1702.06092"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-with-finite-sets-and-cardinality-constraints-in-smt-1702.06259</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-with-finite-sets-and-cardinality-constraints-in-smt-1702.06259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-with-finite-sets-and-cardinality-constraints-in-smt-1702.06259"/></url>
<url><loc>https://scifaro.com/en/abs/on-interpolation-and-symbol-elimination-in-theory-extensions-1702.06620</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-interpolation-and-symbol-elimination-in-theory-extensions-1702.06620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-interpolation-and-symbol-elimination-in-theory-extensions-1702.06620"/></url>
<url><loc>https://scifaro.com/en/abs/mathsf-llf-cal-p-a-logical-framework-for-modeling-external-evidence-side-conditions-and-proof-irrelevance-using-monads-1702.07214</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathsf-llf-cal-p-a-logical-framework-for-modeling-external-evidence-side-conditions-and-proof-irrelevance-using-monads-1702.07214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathsf-llf-cal-p-a-logical-framework-for-modeling-external-evidence-side-conditions-and-proof-irrelevance-using-monads-1702.07214"/></url>
<url><loc>https://scifaro.com/en/abs/on-relation-between-constraint-answer-set-programming-and-satisfiability-modulo-theories-1702.07461</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-relation-between-constraint-answer-set-programming-and-satisfiability-modulo-theories-1702.07461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-relation-between-constraint-answer-set-programming-and-satisfiability-modulo-theories-1702.07461"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-equivalence-for-performance-analysis-of-concurrent-systems-in-dtsipbc-1702.07478</loc><lastmod>2017-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-equivalence-for-performance-analysis-of-concurrent-systems-in-dtsipbc-1702.07478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-equivalence-for-performance-analysis-of-concurrent-systems-in-dtsipbc-1702.07478"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-treatment-of-recursion-1702.07838</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-treatment-of-recursion-1702.07838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-treatment-of-recursion-1702.07838"/></url>
<url><loc>https://scifaro.com/en/abs/a-branching-time-model-of-csp-1702.07844</loc><lastmod>2017-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-branching-time-model-of-csp-1702.07844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-branching-time-model-of-csp-1702.07844"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-and-synthesis-of-embedded-systems-using-machine-learning-1702.07847</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-and-synthesis-of-embedded-systems-using-machine-learning-1702.07847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-and-synthesis-of-embedded-systems-using-machine-learning-1702.07847"/></url>
<url><loc>https://scifaro.com/en/abs/contractibility-for-open-global-constraints-1702.07889</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contractibility-for-open-global-constraints-1702.07889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contractibility-for-open-global-constraints-1702.07889"/></url>
<url><loc>https://scifaro.com/en/abs/modularisation-of-sequent-calculi-for-normal-and-non-normal-modalities-1702.08193</loc><lastmod>2017-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modularisation-of-sequent-calculi-for-normal-and-non-normal-modalities-1702.08193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modularisation-of-sequent-calculi-for-normal-and-non-normal-modalities-1702.08193"/></url>
<url><loc>https://scifaro.com/en/abs/depqbf-6-0-a-search-based-qbf-solver-beyond-traditional-qcdcl-1702.08256</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/depqbf-6-0-a-search-based-qbf-solver-beyond-traditional-qcdcl-1702.08256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/depqbf-6-0-a-search-based-qbf-solver-beyond-traditional-qcdcl-1702.08256"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fly-computation-of-bisimilarity-distances-1702.08306</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fly-computation-of-bisimilarity-distances-1702.08306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fly-computation-of-bisimilarity-distances-1702.08306"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-time-algorithm-for-solving-2sat-on-cactus-formulas-1702.08581</loc><lastmod>2017-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-solving-2sat-on-cactus-formulas-1702.08581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-time-algorithm-for-solving-2sat-on-cactus-formulas-1702.08581"/></url>
<url><loc>https://scifaro.com/en/abs/quantifiers-on-languages-and-codensity-monads-1702.08841</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifiers-on-languages-and-codensity-monads-1702.08841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifiers-on-languages-and-codensity-monads-1702.08841"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-true-concurrency-1703.00159</loc><lastmod>2020-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-true-concurrency-1703.00159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-true-concurrency-1703.00159"/></url>
<url><loc>https://scifaro.com/en/abs/on-completeness-results-of-hoare-logic-relative-to-the-standard-model-1703.00237</loc><lastmod>2017-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-completeness-results-of-hoare-logic-relative-to-the-standard-model-1703.00237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-completeness-results-of-hoare-logic-relative-to-the-standard-model-1703.00237"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-hoare-logic-over-nonstandard-models-1703.00240</loc><lastmod>2017-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-hoare-logic-over-nonstandard-models-1703.00240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-hoare-logic-over-nonstandard-models-1703.00240"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-with-counting-at-least-weak-hanf-normal-forms-always-exist-and-can-be-computed-1703.01122</loc><lastmod>2017-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-with-counting-at-least-weak-hanf-normal-forms-always-exist-and-can-be-computed-1703.01122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-with-counting-at-least-weak-hanf-normal-forms-always-exist-and-can-be-computed-1703.01122"/></url>
<url><loc>https://scifaro.com/en/abs/custom-hypergraph-categories-via-generalized-relations-1703.01204</loc><lastmod>2018-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/custom-hypergraph-categories-via-generalized-relations-1703.01204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/custom-hypergraph-categories-via-generalized-relations-1703.01204"/></url>
<url><loc>https://scifaro.com/en/abs/the-universal-fragment-of-presburger-arithmetic-with-unary-uninterpreted-predicates-is-undecidable-1703.01212</loc><lastmod>2017-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-universal-fragment-of-presburger-arithmetic-with-unary-uninterpreted-predicates-is-undecidable-1703.01212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-universal-fragment-of-presburger-arithmetic-with-unary-uninterpreted-predicates-is-undecidable-1703.01212"/></url>
<url><loc>https://scifaro.com/en/abs/an-ordered-approach-to-solving-parity-games-in-quasi-polynomial-time-and-quasi-linear-space-1703.01296</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-ordered-approach-to-solving-parity-games-in-quasi-polynomial-time-and-quasi-linear-space-1703.01296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-ordered-approach-to-solving-parity-games-in-quasi-polynomial-time-and-quasi-linear-space-1703.01296"/></url>
<url><loc>https://scifaro.com/en/abs/inducing-syntactic-cut-elimination-for-indexed-nested-sequents-1703.01356</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inducing-syntactic-cut-elimination-for-indexed-nested-sequents-1703.01356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inducing-syntactic-cut-elimination-for-indexed-nested-sequents-1703.01356"/></url>
<url><loc>https://scifaro.com/en/abs/towards-parallel-boolean-functional-synthesis-1703.01440</loc><lastmod>2017-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-parallel-boolean-functional-synthesis-1703.01440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-parallel-boolean-functional-synthesis-1703.01440"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-ninth-workshop-on-methods-for-modalities-1703.01736</loc><lastmod>2017-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-ninth-workshop-on-methods-for-modalities-1703.01736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-ninth-workshop-on-methods-for-modalities-1703.01736"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-space-complexity-of-model-checking-bounded-variable-first-order-logic-1703.01860</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-space-complexity-of-model-checking-bounded-variable-first-order-logic-1703.01860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-space-complexity-of-model-checking-bounded-variable-first-order-logic-1703.01860"/></url>
<url><loc>https://scifaro.com/en/abs/game-theoretic-investigation-of-intensional-equalities-1703.02015</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-theoretic-investigation-of-intensional-equalities-1703.02015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-theoretic-investigation-of-intensional-equalities-1703.02015"/></url>
<url><loc>https://scifaro.com/en/abs/theory-morphisms-in-church-s-type-theory-with-quotation-and-evaluation-1703.02117</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-morphisms-in-church-s-type-theory-with-quotation-and-evaluation-1703.02117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-morphisms-in-church-s-type-theory-with-quotation-and-evaluation-1703.02117"/></url>
<url><loc>https://scifaro.com/en/abs/deterministic-temporal-logics-and-interval-constraints-1703.02193</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deterministic-temporal-logics-and-interval-constraints-1703.02193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deterministic-temporal-logics-and-interval-constraints-1703.02193"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-reasoning-in-expressive-fragments-of-first-order-logic-1703.02194</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-reasoning-in-expressive-fragments-of-first-order-logic-1703.02194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-reasoning-in-expressive-fragments-of-first-order-logic-1703.02194"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-justification-logic-1703.02195</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-justification-logic-1703.02195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-justification-logic-1703.02195"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-sequent-calculi-for-modal-logics-1703.02197</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-sequent-calculi-for-modal-logics-1703.02197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-sequent-calculi-for-modal-logics-1703.02197"/></url>
<url><loc>https://scifaro.com/en/abs/strong-completeness-and-the-finite-model-property-for-bi-intuitionistic-stable-tense-logics-1703.02198</loc><lastmod>2017-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-completeness-and-the-finite-model-property-for-bi-intuitionistic-stable-tense-logics-1703.02198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-completeness-and-the-finite-model-property-for-bi-intuitionistic-stable-tense-logics-1703.02198"/></url>
<url><loc>https://scifaro.com/en/abs/subsumption-algorithms-for-three-valued-geometric-resolution-1703.02830</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subsumption-algorithms-for-three-valued-geometric-resolution-1703.02830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subsumption-algorithms-for-three-valued-geometric-resolution-1703.02830"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-the-monadic-shallow-linear-first-order-fragment-with-straight-dismatching-constraints-1703.02837</loc><lastmod>2017-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-the-monadic-shallow-linear-first-order-fragment-with-straight-dismatching-constraints-1703.02837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-the-monadic-shallow-linear-first-order-fragment-with-straight-dismatching-constraints-1703.02837"/></url>
<url><loc>https://scifaro.com/en/abs/sigma-mu-2-is-decidable-for-pi-mu-2-1703.03239</loc><lastmod>2017-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sigma-mu-2-is-decidable-for-pi-mu-2-1703.03239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sigma-mu-2-is-decidable-for-pi-mu-2-1703.03239"/></url>
<url><loc>https://scifaro.com/en/abs/distinguishing-between-communicating-transactions-1703.03256</loc><lastmod>2018-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distinguishing-between-communicating-transactions-1703.03256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distinguishing-between-communicating-transactions-1703.03256"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-bounds-in-weighted-transition-systems-1703.03346</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-bounds-in-weighted-transition-systems-1703.03346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-bounds-in-weighted-transition-systems-1703.03346"/></url>
<url><loc>https://scifaro.com/en/abs/computable-structures-on-topological-manifolds-1703.04075</loc><lastmod>2017-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-structures-on-topological-manifolds-1703.04075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-structures-on-topological-manifolds-1703.04075"/></url>
<url><loc>https://scifaro.com/en/abs/towards-efficient-verification-of-population-protocols-1703.04367</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-efficient-verification-of-population-protocols-1703.04367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-efficient-verification-of-population-protocols-1703.04367"/></url>
<url><loc>https://scifaro.com/en/abs/c-shore-higher-order-verification-via-collapsible-pushdown-system-saturation-1703.04429</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/c-shore-higher-order-verification-via-collapsible-pushdown-system-saturation-1703.04429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/c-shore-higher-order-verification-via-collapsible-pushdown-system-saturation-1703.04429"/></url>
<url><loc>https://scifaro.com/en/abs/when-are-stochastic-transition-systems-tameable-1703.04806</loc><lastmod>2018-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-are-stochastic-transition-systems-tameable-1703.04806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-are-stochastic-transition-systems-tameable-1703.04806"/></url>
<url><loc>https://scifaro.com/en/abs/it-is-undecidable-if-two-regular-tree-languages-can-be-separated-by-a-deterministic-tree-walking-automaton-1703.04997</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-is-undecidable-if-two-regular-tree-languages-can-be-separated-by-a-deterministic-tree-walking-automaton-1703.04997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-is-undecidable-if-two-regular-tree-languages-can-be-separated-by-a-deterministic-tree-walking-automaton-1703.04997"/></url>
<url><loc>https://scifaro.com/en/abs/auxiliary-variables-in-tla-1703.05121</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/auxiliary-variables-in-tla-1703.05121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/auxiliary-variables-in-tla-1703.05121"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-foundations-of-proof-refinement-1703.05215</loc><lastmod>2017-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-foundations-of-proof-refinement-1703.05215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-foundations-of-proof-refinement-1703.05215"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-runtime-validation-framework-based-on-the-theory-of-refinement-1703.05317</loc><lastmod>2017-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-runtime-validation-framework-based-on-the-theory-of-refinement-1703.05317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-runtime-validation-framework-based-on-the-theory-of-refinement-1703.05317"/></url>
<url><loc>https://scifaro.com/en/abs/bootstrapping-lcf-declarative-proofs-1703.05351</loc><lastmod>2017-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bootstrapping-lcf-declarative-proofs-1703.05351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bootstrapping-lcf-declarative-proofs-1703.05351"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-2nd-workshop-on-models-for-formal-analysis-of-real-systems-1703.05812</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-2nd-workshop-on-models-for-formal-analysis-of-real-systems-1703.05812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-2nd-workshop-on-models-for-formal-analysis-of-real-systems-1703.05812"/></url>
<url><loc>https://scifaro.com/en/abs/causal-consistency-for-reversible-multiparty-protocols-1703.06021</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-consistency-for-reversible-multiparty-protocols-1703.06021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-consistency-for-reversible-multiparty-protocols-1703.06021"/></url>
<url><loc>https://scifaro.com/en/abs/fully-mechanized-proofs-of-dilworths-theorem-and-mirskys-theorem-1703.06133</loc><lastmod>2017-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-mechanized-proofs-of-dilworths-theorem-and-mirskys-theorem-1703.06133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-mechanized-proofs-of-dilworths-theorem-and-mirskys-theorem-1703.06133"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-the-stream-control-transmission-protocol-using-uppaal-1703.06568</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-the-stream-control-transmission-protocol-using-uppaal-1703.06568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-the-stream-control-transmission-protocol-using-uppaal-1703.06568"/></url>
<url><loc>https://scifaro.com/en/abs/split-send-reassemble-a-formal-specification-of-a-can-bus-protocol-stack-1703.06569</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/split-send-reassemble-a-formal-specification-of-a-can-bus-protocol-stack-1703.06569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/split-send-reassemble-a-formal-specification-of-a-can-bus-protocol-stack-1703.06569"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-verification-and-comparative-performance-analysis-of-the-b-a-t-m-a-n-protocol-1703.06570</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-verification-and-comparative-performance-analysis-of-the-b-a-t-m-a-n-protocol-1703.06570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-verification-and-comparative-performance-analysis-of-the-b-a-t-m-a-n-protocol-1703.06570"/></url>
<url><loc>https://scifaro.com/en/abs/towards-probabilistic-formal-modeling-of-robotic-cell-injection-systems-1703.06578</loc><lastmod>2017-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-probabilistic-formal-modeling-of-robotic-cell-injection-systems-1703.06578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-probabilistic-formal-modeling-of-robotic-cell-injection-systems-1703.06578"/></url>
<url><loc>https://scifaro.com/en/abs/process-algebra-with-strategic-interleaving-1703.06822</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-algebra-with-strategic-interleaving-1703.06822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-algebra-with-strategic-interleaving-1703.06822"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-modeling-with-justifications-1703.07028</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-modeling-with-justifications-1703.07028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-modeling-with-justifications-1703.07028"/></url>
<url><loc>https://scifaro.com/en/abs/name-free-combinators-for-concurrency-1703.07054</loc><lastmod>2019-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/name-free-combinators-for-concurrency-1703.07054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/name-free-combinators-for-concurrency-1703.07054"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-hierarchy-in-the-abstraction-based-verification-of-statecharts-using-smt-solvers-1703.07350</loc><lastmod>2017-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-hierarchy-in-the-abstraction-based-verification-of-statecharts-using-smt-solvers-1703.07350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-hierarchy-in-the-abstraction-based-verification-of-statecharts-using-smt-solvers-1703.07350"/></url>
<url><loc>https://scifaro.com/en/abs/permissive-supervisor-synthesis-for-markov-decision-processes-through-learning-1703.07351</loc><lastmod>2017-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissive-supervisor-synthesis-for-markov-decision-processes-through-learning-1703.07351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissive-supervisor-synthesis-for-markov-decision-processes-through-learning-1703.07351"/></url>
<url><loc>https://scifaro.com/en/abs/on-corecursive-algebras-for-functors-preserving-coproducts-1703.07574</loc><lastmod>2017-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-corecursive-algebras-for-functors-preserving-coproducts-1703.07574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-corecursive-algebras-for-functors-preserving-coproducts-1703.07574"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakest-pre-expectation-semantics-for-mixed-sign-expectations-1703.07682</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakest-pre-expectation-semantics-for-mixed-sign-expectations-1703.07682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakest-pre-expectation-semantics-for-mixed-sign-expectations-1703.07682"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-turing-machines-computations-and-measurements-1703.07748</loc><lastmod>2020-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-turing-machines-computations-and-measurements-1703.07748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-turing-machines-computations-and-measurements-1703.07748"/></url>
<url><loc>https://scifaro.com/en/abs/a-universal-construction-for-co-relations-1703.08247</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-universal-construction-for-co-relations-1703.08247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-universal-construction-for-co-relations-1703.08247"/></url>
<url><loc>https://scifaro.com/en/abs/interacting-conceptual-spaces-i-grammatical-composition-of-concepts-1703.08314</loc><lastmod>2017-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interacting-conceptual-spaces-i-grammatical-composition-of-concepts-1703.08314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interacting-conceptual-spaces-i-grammatical-composition-of-concepts-1703.08314"/></url>
<url><loc>https://scifaro.com/en/abs/structural-resolution-with-co-inductive-loop-detection-1703.08336</loc><lastmod>2017-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-resolution-with-co-inductive-loop-detection-1703.08336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-resolution-with-co-inductive-loop-detection-1703.08336"/></url>
<url><loc>https://scifaro.com/en/abs/proof-verification-can-be-hard-1703.08746</loc><lastmod>2017-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-verification-can-be-hard-1703.08746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-verification-can-be-hard-1703.08746"/></url>
<url><loc>https://scifaro.com/en/abs/timed-automata-with-polynomial-delay-and-their-expressiveness-1703.08936</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-automata-with-polynomial-delay-and-their-expressiveness-1703.08936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-automata-with-polynomial-delay-and-their-expressiveness-1703.08936"/></url>
<url><loc>https://scifaro.com/en/abs/trace-expressiveness-of-timed-and-probabilistic-automata-1703.08956</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-expressiveness-of-timed-and-probabilistic-automata-1703.08956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-expressiveness-of-timed-and-probabilistic-automata-1703.08956"/></url>
<url><loc>https://scifaro.com/en/abs/querying-log-data-with-metric-temporal-logic-technical-report-1703.08982</loc><lastmod>2018-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-log-data-with-metric-temporal-logic-technical-report-1703.08982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-log-data-with-metric-temporal-logic-technical-report-1703.08982"/></url>
<url><loc>https://scifaro.com/en/abs/a-recipe-for-state-and-effect-triangles-1703.09034</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recipe-for-state-and-effect-triangles-1703.09034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recipe-for-state-and-effect-triangles-1703.09034"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-typing-system-for-self-referential-programs-and-specifications-1703.09907</loc><lastmod>2017-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-typing-system-for-self-referential-programs-and-specifications-1703.09907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-typing-system-for-self-referential-programs-and-specifications-1703.09907"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimal-representation-for-continuous-functions-1703.10044</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimal-representation-for-continuous-functions-1703.10044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimal-representation-for-continuous-functions-1703.10044"/></url>
<url><loc>https://scifaro.com/en/abs/on-noncommutative-extensions-of-linear-logic-1703.10092</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-noncommutative-extensions-of-linear-logic-1703.10092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-noncommutative-extensions-of-linear-logic-1703.10092"/></url>
<url><loc>https://scifaro.com/en/abs/uber-die-pr-azision-interprozeduraler-analysen-1703.10179</loc><lastmod>2017-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uber-die-pr-azision-interprozeduraler-analysen-1703.10179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uber-die-pr-azision-interprozeduraler-analysen-1703.10179"/></url>
<url><loc>https://scifaro.com/en/abs/subatomic-proof-systems-splittable-systems-1703.10258</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subatomic-proof-systems-splittable-systems-1703.10258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subatomic-proof-systems-splittable-systems-1703.10258"/></url>
<url><loc>https://scifaro.com/en/abs/relational-graph-models-at-work-1703.10382</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-graph-models-at-work-1703.10382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-graph-models-at-work-1703.10382"/></url>
<url><loc>https://scifaro.com/en/abs/on-repetitive-right-application-of-b-terms-1703.10938</loc><lastmod>2019-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-repetitive-right-application-of-b-terms-1703.10938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-repetitive-right-application-of-b-terms-1703.10938"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-some-central-theorems-in-combinatorics-of-finite-sets-1703.10977</loc><lastmod>2019-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-some-central-theorems-in-combinatorics-of-finite-sets-1703.10977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-some-central-theorems-in-combinatorics-of-finite-sets-1703.10977"/></url>
<url><loc>https://scifaro.com/en/abs/an-outline-of-separation-logic-1703.10994</loc><lastmod>2017-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-outline-of-separation-logic-1703.10994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-outline-of-separation-logic-1703.10994"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-for-the-lambda-mu-calculus-1704.00272</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-for-the-lambda-mu-calculus-1704.00272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-for-the-lambda-mu-calculus-1704.00272"/></url>
<url><loc>https://scifaro.com/en/abs/an-achilles-heel-of-term-resolution-1704.01071</loc><lastmod>2017-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-achilles-heel-of-term-resolution-1704.01071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-achilles-heel-of-term-resolution-1704.01071"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-conjunctive-queries-1704.01286</loc><lastmod>2017-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-conjunctive-queries-1704.01286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-conjunctive-queries-1704.01286"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-satisfiability-problems-via-operator-assignments-1704.01736</loc><lastmod>2017-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-satisfiability-problems-via-operator-assignments-1704.01736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-satisfiability-problems-via-operator-assignments-1704.01736"/></url>
<url><loc>https://scifaro.com/en/abs/some-observations-on-the-logical-foundations-of-inductive-theorem-proving-1704.01930</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-observations-on-the-logical-foundations-of-inductive-theorem-proving-1704.01930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-observations-on-the-logical-foundations-of-inductive-theorem-proving-1704.01930"/></url>
<url><loc>https://scifaro.com/en/abs/a-fine-grained-hierarchy-of-hard-problems-in-the-separated-fragment-1704.02145</loc><lastmod>2017-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fine-grained-hierarchy-of-hard-problems-in-the-separated-fragment-1704.02145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fine-grained-hierarchy-of-hard-problems-in-the-separated-fragment-1704.02145"/></url>
<url><loc>https://scifaro.com/en/abs/polyteam-semantics-1704.02158</loc><lastmod>2020-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyteam-semantics-1704.02158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyteam-semantics-1704.02158"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-mathematical-knowledge-as-a-biform-theory-graph-a-case-study-1704.02253</loc><lastmod>2017-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-mathematical-knowledge-as-a-biform-theory-graph-a-case-study-1704.02253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-mathematical-knowledge-as-a-biform-theory-graph-a-case-study-1704.02253"/></url>
<url><loc>https://scifaro.com/en/abs/a-mall-geometry-of-interaction-based-on-indexed-linear-logic-1704.02711</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mall-geometry-of-interaction-based-on-indexed-linear-logic-1704.02711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mall-geometry-of-interaction-based-on-indexed-linear-logic-1704.02711"/></url>
<url><loc>https://scifaro.com/en/abs/representing-operational-semantics-with-enriched-lawvere-theories-1704.03080</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-operational-semantics-with-enriched-lawvere-theories-1704.03080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-operational-semantics-with-enriched-lawvere-theories-1704.03080"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-categorical-representation-of-reversible-event-structures-1704.03099</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-categorical-representation-of-reversible-event-structures-1704.03099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-categorical-representation-of-reversible-event-structures-1704.03099"/></url>
<url><loc>https://scifaro.com/en/abs/best-by-simulations-a-framework-for-comparing-efficiency-of-reconfigurable-multicore-architectures-on-workloads-with-deadlines-1704.03100</loc><lastmod>2017-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/best-by-simulations-a-framework-for-comparing-efficiency-of-reconfigurable-multicore-architectures-on-workloads-with-deadlines-1704.03100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/best-by-simulations-a-framework-for-comparing-efficiency-of-reconfigurable-multicore-architectures-on-workloads-with-deadlines-1704.03100"/></url>
<url><loc>https://scifaro.com/en/abs/lean-and-full-congruence-formats-for-recursion-1704.03160</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lean-and-full-congruence-formats-for-recursion-1704.03160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lean-and-full-congruence-formats-for-recursion-1704.03160"/></url>
<url><loc>https://scifaro.com/en/abs/slicewise-definability-in-first-order-logic-with-bounded-quantifier-rank-1704.03167</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slicewise-definability-in-first-order-logic-with-bounded-quantifier-rank-1704.03167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slicewise-definability-in-first-order-logic-with-bounded-quantifier-rank-1704.03167"/></url>
<url><loc>https://scifaro.com/en/abs/scavenger-0-1-a-theorem-prover-based-on-conflict-resolution-1704.03275</loc><lastmod>2017-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scavenger-0-1-a-theorem-prover-based-on-conflict-resolution-1704.03275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scavenger-0-1-a-theorem-prover-based-on-conflict-resolution-1704.03275"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-complexity-of-poor-man-s-propositional-dependence-logic-1704.03292</loc><lastmod>2018-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-complexity-of-poor-man-s-propositional-dependence-logic-1704.03292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-complexity-of-poor-man-s-propositional-dependence-logic-1704.03292"/></url>
<url><loc>https://scifaro.com/en/abs/testing-a-saturation-based-theorem-prover-experiences-and-challenges-extended-version-1704.03391</loc><lastmod>2017-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-a-saturation-based-theorem-prover-experiences-and-challenges-extended-version-1704.03391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-a-saturation-based-theorem-prover-experiences-and-challenges-extended-version-1704.03391"/></url>
<url><loc>https://scifaro.com/en/abs/aleph-1-and-the-modal-mu-calculus-1704.03772</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aleph-1-and-the-modal-mu-calculus-1704.03772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aleph-1-and-the-modal-mu-calculus-1704.03772"/></url>
<url><loc>https://scifaro.com/en/abs/free-constructions-and-coproducts-of-d-frames-1704.04029</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-constructions-and-coproducts-of-d-frames-1704.04029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-constructions-and-coproducts-of-d-frames-1704.04029"/></url>
<url><loc>https://scifaro.com/en/abs/static-analysis-of-deterministic-negotiations-1704.04190</loc><lastmod>2017-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-analysis-of-deterministic-negotiations-1704.04190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-analysis-of-deterministic-negotiations-1704.04190"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-local-lexing-1704.04215</loc><lastmod>2017-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-local-lexing-1704.04215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-local-lexing-1704.04215"/></url>
<url><loc>https://scifaro.com/en/abs/parity-objectives-in-countable-mdps-1704.04490</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-objectives-in-countable-mdps-1704.04490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-objectives-in-countable-mdps-1704.04490"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-concurrent-interaction-handling-multiple-ports-by-way-of-multiple-tokens-long-version-1704.04620</loc><lastmod>2017-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-concurrent-interaction-handling-multiple-ports-by-way-of-multiple-tokens-long-version-1704.04620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-concurrent-interaction-handling-multiple-ports-by-way-of-multiple-tokens-long-version-1704.04620"/></url>
<url><loc>https://scifaro.com/en/abs/effectful-applicative-bisimilarity-monads-relators-and-howe-s-method-long-version-1704.04647</loc><lastmod>2017-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectful-applicative-bisimilarity-monads-relators-and-howe-s-method-long-version-1704.04647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectful-applicative-bisimilarity-monads-relators-and-howe-s-method-long-version-1704.04647"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-liveness-checking-by-corecursive-algebras-1704.04872</loc><lastmod>2017-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-liveness-checking-by-corecursive-algebras-1704.04872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-liveness-checking-by-corecursive-algebras-1704.04872"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-computer-iii-a-coalgebraic-view-of-computability-and-complexity-1704.04882</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-computer-iii-a-coalgebraic-view-of-computability-and-complexity-1704.04882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-computer-iii-a-coalgebraic-view-of-computability-and-complexity-1704.04882"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-propositional-configuration-logics-a-specification-language-for-architectures-with-quantitative-features-1704.04969</loc><lastmod>2020-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-propositional-configuration-logics-a-specification-language-for-architectures-with-quantitative-features-1704.04969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-propositional-configuration-logics-a-specification-language-for-architectures-with-quantitative-features-1704.04969"/></url>
<url><loc>https://scifaro.com/en/abs/the-pebbling-comonad-in-finite-model-theory-1704.05124</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pebbling-comonad-in-finite-model-theory-1704.05124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pebbling-comonad-in-finite-model-theory-1704.05124"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-workshop-on-developments-in-implicit-computational-complexity-and-5th-workshop-on-foundational-and-practical-aspects-of-resource-analysis-1704.05169</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-developments-in-implicit-computational-complexity-and-5th-workshop-on-foundational-and-practical-aspects-of-resource-analysis-1704.05169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-developments-in-implicit-computational-complexity-and-5th-workshop-on-foundational-and-practical-aspects-of-resource-analysis-1704.05169"/></url>
<url><loc>https://scifaro.com/en/abs/eptl-a-temporal-logic-for-weakly-consistent-systems-1704.05320</loc><lastmod>2017-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eptl-a-temporal-logic-for-weakly-consistent-systems-1704.05320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eptl-a-temporal-logic-for-weakly-consistent-systems-1704.05320"/></url>
<url><loc>https://scifaro.com/en/abs/automated-sized-type-inference-and-complexity-analysis-1704.05585</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-sized-type-inference-and-complexity-analysis-1704.05585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-sized-type-inference-and-complexity-analysis-1704.05585"/></url>
<url><loc>https://scifaro.com/en/abs/gubs-upper-bound-solver-extended-abstract-1704.05586</loc><lastmod>2017-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gubs-upper-bound-solver-extended-abstract-1704.05586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gubs-upper-bound-solver-extended-abstract-1704.05586"/></url>
<url><loc>https://scifaro.com/en/abs/markov-automata-with-multiple-objectives-1704.06648</loc><lastmod>2017-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markov-automata-with-multiple-objectives-1704.06648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markov-automata-with-multiple-objectives-1704.06648"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-type-theory-in-lean-1704.06781</loc><lastmod>2017-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-type-theory-in-lean-1704.06781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-type-theory-in-lean-1704.06781"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-epistemic-logic-of-friendship-via-tree-sequent-calculus-1704.07149</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-epistemic-logic-of-friendship-via-tree-sequent-calculus-1704.07149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-epistemic-logic-of-friendship-via-tree-sequent-calculus-1704.07149"/></url>
<url><loc>https://scifaro.com/en/abs/reductions-for-transition-systems-at-work-deriving-a-logical-characterization-of-quantitative-bisimulation-1704.07181</loc><lastmod>2017-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reductions-for-transition-systems-at-work-deriving-a-logical-characterization-of-quantitative-bisimulation-1704.07181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reductions-for-transition-systems-at-work-deriving-a-logical-characterization-of-quantitative-bisimulation-1704.07181"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-of-truly-concurrent-mobile-processes-1704.07774</loc><lastmod>2017-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-of-truly-concurrent-mobile-processes-1704.07774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-of-truly-concurrent-mobile-processes-1704.07774"/></url>
<url><loc>https://scifaro.com/en/abs/z3str3-a-string-solver-with-theory-aware-branching-1704.07935</loc><lastmod>2017-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/z3str3-a-string-solver-with-theory-aware-branching-1704.07935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/z3str3-a-string-solver-with-theory-aware-branching-1704.07935"/></url>
<url><loc>https://scifaro.com/en/abs/a-strategy-for-dynamic-programs-start-over-and-muddle-through-1704.07998</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strategy-for-dynamic-programs-start-over-and-muddle-through-1704.07998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strategy-for-dynamic-programs-start-over-and-muddle-through-1704.07998"/></url>
<url><loc>https://scifaro.com/en/abs/a-reduced-semantics-for-deciding-trace-equivalence-1704.08540</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reduced-semantics-for-deciding-trace-equivalence-1704.08540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reduced-semantics-for-deciding-trace-equivalence-1704.08540"/></url>
<url><loc>https://scifaro.com/en/abs/an-expressive-completeness-theorem-for-coalgebraic-modal-mu-calculi-1704.08637</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expressive-completeness-theorem-for-coalgebraic-modal-mu-calculi-1704.08637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expressive-completeness-theorem-for-coalgebraic-modal-mu-calculi-1704.08637"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-type-checking-for-path-polymorphism-1704.09026</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-type-checking-for-path-polymorphism-1704.09026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-type-checking-for-path-polymorphism-1704.09026"/></url>
<url><loc>https://scifaro.com/en/abs/a-lambda-calculus-for-density-matrices-with-classical-and-probabilistic-controls-1705.00097</loc><lastmod>2017-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lambda-calculus-for-density-matrices-with-classical-and-probabilistic-controls-1705.00097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lambda-calculus-for-density-matrices-with-classical-and-probabilistic-controls-1705.00097"/></url>
<url><loc>https://scifaro.com/en/abs/relational-star-liftings-for-differential-privacy-1705.00133</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-star-liftings-for-differential-privacy-1705.00133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-star-liftings-for-differential-privacy-1705.00133"/></url>
<url><loc>https://scifaro.com/en/abs/modulo-quantifiers-over-functional-vocabularies-extending-addition-1705.00290</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modulo-quantifiers-over-functional-vocabularies-extending-addition-1705.00290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modulo-quantifiers-over-functional-vocabularies-extending-addition-1705.00290"/></url>
<url><loc>https://scifaro.com/en/abs/domains-for-higher-order-games-1705.00355</loc><lastmod>2017-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-for-higher-order-games-1705.00355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-for-higher-order-games-1705.00355"/></url>
<url><loc>https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-lambek-calculus-with-brackets-of-bounded-order-1705.00694</loc><lastmod>2017-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-lambek-calculus-with-brackets-of-bounded-order-1705.00694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-lambek-calculus-with-brackets-of-bounded-order-1705.00694"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1705.00766</loc><lastmod>2017-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1705.00766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-1705.00766"/></url>
<url><loc>https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-hybrid-pdl-1705.00848</loc><lastmod>2017-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-hybrid-pdl-1705.00848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exptime-tableaux-with-global-caching-for-hybrid-pdl-1705.00848"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-intelligent-additive-manufacturing-1705.00960</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-intelligent-additive-manufacturing-1705.00960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-intelligent-additive-manufacturing-1705.00960"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-parametricity-inductives-and-uniformity-of-propositions-1705.01163</loc><lastmod>2017-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-parametricity-inductives-and-uniformity-of-propositions-1705.01163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-parametricity-inductives-and-uniformity-of-propositions-1705.01163"/></url>
<url><loc>https://scifaro.com/en/abs/meta-extract-using-existing-facts-in-meta-reasoning-1705.01227</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meta-extract-using-existing-facts-in-meta-reasoning-1705.01227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meta-extract-using-existing-facts-in-meta-reasoning-1705.01227"/></url>
<url><loc>https://scifaro.com/en/abs/proof-reduction-of-fair-stuttering-refinement-of-asynchronous-systems-and-applications-1705.01230</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-reduction-of-fair-stuttering-refinement-of-asynchronous-systems-and-applications-1705.01230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-reduction-of-fair-stuttering-refinement-of-asynchronous-systems-and-applications-1705.01230"/></url>
<url><loc>https://scifaro.com/en/abs/term-level-reasoning-in-support-of-bit-blasting-1705.01231</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/term-level-reasoning-in-support-of-bit-blasting-1705.01231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/term-level-reasoning-in-support-of-bit-blasting-1705.01231"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-piece-wise-linear-feed-forward-neural-networks-1705.01320</loc><lastmod>2017-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-piece-wise-linear-feed-forward-neural-networks-1705.01320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-piece-wise-linear-feed-forward-neural-networks-1705.01320"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-duration-bidding-games-1705.01433</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-duration-bidding-games-1705.01433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-duration-bidding-games-1705.01433"/></url>
<url><loc>https://scifaro.com/en/abs/on-tackling-the-limits-of-resolution-in-sat-solving-1705.01477</loc><lastmod>2017-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-tackling-the-limits-of-resolution-in-sat-solving-1705.01477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-tackling-the-limits-of-resolution-in-sat-solving-1705.01477"/></url>
<url><loc>https://scifaro.com/en/abs/making-metric-temporal-logic-rational-1705.01501</loc><lastmod>2017-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-metric-temporal-logic-rational-1705.01501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-metric-temporal-logic-rational-1705.01501"/></url>
<url><loc>https://scifaro.com/en/abs/definability-and-interpolation-within-decidable-fixpoint-logics-1705.01823</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definability-and-interpolation-within-decidable-fixpoint-logics-1705.01823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definability-and-interpolation-within-decidable-fixpoint-logics-1705.01823"/></url>
<url><loc>https://scifaro.com/en/abs/an-active-learning-approach-to-the-falsification-of-black-box-cyber-physical-systems-1705.01879</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-active-learning-approach-to-the-falsification-of-black-box-cyber-physical-systems-1705.01879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-active-learning-approach-to-the-falsification-of-black-box-cyber-physical-systems-1705.01879"/></url>
<url><loc>https://scifaro.com/en/abs/a-unification-algorithm-for-gp-2-long-version-1705.02171</loc><lastmod>2017-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unification-algorithm-for-gp-2-long-version-1705.02171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unification-algorithm-for-gp-2-long-version-1705.02171"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-actors-based-on-true-concurrency-1705.02427</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-actors-based-on-true-concurrency-1705.02427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-actors-based-on-true-concurrency-1705.02427"/></url>
<url><loc>https://scifaro.com/en/abs/reliable-restricted-process-theory-1705.02600</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reliable-restricted-process-theory-1705.02600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reliable-restricted-process-theory-1705.02600"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-constraint-conditional-branching-timed-interactive-scores-1705.02861</loc><lastmod>2017-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-constraint-conditional-branching-timed-interactive-scores-1705.02861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-constraint-conditional-branching-timed-interactive-scores-1705.02861"/></url>
<url><loc>https://scifaro.com/en/abs/solving-constrained-horn-clauses-using-dependence-disjoint-expansions-1705.03167</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-constrained-horn-clauses-using-dependence-disjoint-expansions-1705.03167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-constrained-horn-clauses-using-dependence-disjoint-expansions-1705.03167"/></url>
<url><loc>https://scifaro.com/en/abs/m-im-a-d-m-s-a-deontic-logic-proof-theory-and-applications-1705.03211</loc><lastmod>2017-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/m-im-a-d-m-s-a-deontic-logic-proof-theory-and-applications-1705.03211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/m-im-a-d-m-s-a-deontic-logic-proof-theory-and-applications-1705.03211"/></url>
<url><loc>https://scifaro.com/en/abs/two-level-type-theory-and-applications-1705.03307</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-level-type-theory-and-applications-1705.03307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-level-type-theory-and-applications-1705.03307"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-presentations-of-monoidal-categories-1705.03553</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-presentations-of-monoidal-categories-1705.03553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-presentations-of-monoidal-categories-1705.03553"/></url>
<url><loc>https://scifaro.com/en/abs/logical-and-algebraic-characterizations-of-rational-transductions-1705.03726</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-and-algebraic-characterizations-of-rational-transductions-1705.03726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-and-algebraic-characterizations-of-rational-transductions-1705.03726"/></url>
<url><loc>https://scifaro.com/en/abs/towards-verifying-nonlinear-integer-arithmetic-1705.04302</loc><lastmod>2018-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-verifying-nonlinear-integer-arithmetic-1705.04302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-verifying-nonlinear-integer-arithmetic-1705.04302"/></url>
<url><loc>https://scifaro.com/en/abs/a-finitary-analogue-of-the-downward-l-owenheim-skolem-property-1705.04493</loc><lastmod>2017-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finitary-analogue-of-the-downward-l-owenheim-skolem-property-1705.04493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finitary-analogue-of-the-downward-l-owenheim-skolem-property-1705.04493"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-timing-diagram-requirements-in-discrete-duration-calulus-1705.04510</loc><lastmod>2017-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-timing-diagram-requirements-in-discrete-duration-calulus-1705.04510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-timing-diagram-requirements-in-discrete-duration-calulus-1705.04510"/></url>
<url><loc>https://scifaro.com/en/abs/intensionality-definability-and-computation-1705.04744</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intensionality-definability-and-computation-1705.04744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intensionality-definability-and-computation-1705.04744"/></url>
<url><loc>https://scifaro.com/en/abs/enriched-closure-spaces-as-a-novel-framework-for-domain-theory-1705.04945</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enriched-closure-spaces-as-a-novel-framework-for-domain-theory-1705.04945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enriched-closure-spaces-as-a-novel-framework-for-domain-theory-1705.04945"/></url>
<url><loc>https://scifaro.com/en/abs/proof-tree-preserving-interpolation-1705.05309</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-tree-preserving-interpolation-1705.05309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-tree-preserving-interpolation-1705.05309"/></url>
<url><loc>https://scifaro.com/en/abs/horn-maximum-satisfiability-reductions-algorithms-applications-1705.05335</loc><lastmod>2017-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-maximum-satisfiability-reductions-algorithms-applications-1705.05335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-maximum-satisfiability-reductions-algorithms-applications-1705.05335"/></url>
<url><loc>https://scifaro.com/en/abs/first-and-second-order-models-of-recursive-arithmetics-1705.05459</loc><lastmod>2017-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-and-second-order-models-of-recursive-arithmetics-1705.05459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-and-second-order-models-of-recursive-arithmetics-1705.05459"/></url>
<url><loc>https://scifaro.com/en/abs/kleisli-parikh-and-peleg-compositions-and-liftings-for-multirelations-1705.05650</loc><lastmod>2017-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleisli-parikh-and-peleg-compositions-and-liftings-for-multirelations-1705.05650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleisli-parikh-and-peleg-compositions-and-liftings-for-multirelations-1705.05650"/></url>
<url><loc>https://scifaro.com/en/abs/rank-3-inhabitation-of-intersection-types-revisited-extended-version-1705.06070</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rank-3-inhabitation-of-intersection-types-revisited-extended-version-1705.06070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rank-3-inhabitation-of-intersection-types-revisited-extended-version-1705.06070"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-theorem-for-a-modal-description-logic-1705.06214</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-theorem-for-a-modal-description-logic-1705.06214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-theorem-for-a-modal-description-logic-1705.06214"/></url>
<url><loc>https://scifaro.com/en/abs/matching-logic-1705.06312</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-logic-1705.06312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-logic-1705.06312"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-datatypes-modulo-bisimulation-based-on-second-order-algebraic-theories-1705.06430</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-datatypes-modulo-bisimulation-based-on-second-order-algebraic-theories-1705.06430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-datatypes-modulo-bisimulation-based-on-second-order-algebraic-theories-1705.06430"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-trade-off-between-labels-and-weights-in-quantitative-bisimulation-1705.06439</loc><lastmod>2017-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-trade-off-between-labels-and-weights-in-quantitative-bisimulation-1705.06439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-trade-off-between-labels-and-weights-in-quantitative-bisimulation-1705.06439"/></url>
<url><loc>https://scifaro.com/en/abs/the-cayley-dickson-construction-in-acl2-1705.06822</loc><lastmod>2017-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cayley-dickson-construction-in-acl2-1705.06822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cayley-dickson-construction-in-acl2-1705.06822"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-algorithm-enumerating-event-structures-1705.07228</loc><lastmod>2017-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-algorithm-enumerating-event-structures-1705.07228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-algorithm-enumerating-event-structures-1705.07228"/></url>
<url><loc>https://scifaro.com/en/abs/the-quantum-monad-on-relational-structures-1705.07310</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quantum-monad-on-relational-structures-1705.07310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quantum-monad-on-relational-structures-1705.07310"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-the-process-algebra-ccs-in-hol4-1705.07313</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-the-process-algebra-ccs-in-hol4-1705.07313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-the-process-algebra-ccs-in-hol4-1705.07313"/></url>
<url><loc>https://scifaro.com/en/abs/the-language-of-stratified-sets-is-confluent-and-strongly-normalising-1705.07767</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-language-of-stratified-sets-is-confluent-and-strongly-normalising-1705.07767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-language-of-stratified-sets-is-confluent-and-strongly-normalising-1705.07767"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-synthesis-for-parameterized-temporal-logics-1705.08112</loc><lastmod>2018-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-synthesis-for-parameterized-temporal-logics-1705.08112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-synthesis-for-parameterized-temporal-logics-1705.08112"/></url>
<url><loc>https://scifaro.com/en/abs/loose-graph-simulations-1705.08241</loc><lastmod>2017-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/loose-graph-simulations-1705.08241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/loose-graph-simulations-1705.08241"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-a-lazy-cache-coherence-protocol-against-a-weak-memory-model-1705.08262</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-a-lazy-cache-coherence-protocol-against-a-weak-memory-model-1705.08262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-a-lazy-cache-coherence-protocol-against-a-weak-memory-model-1705.08262"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-confluence-test-for-cognitive-models-in-act-r-1705.08392</loc><lastmod>2017-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-confluence-test-for-cognitive-models-in-act-r-1705.08392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-confluence-test-for-cognitive-models-in-act-r-1705.08392"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-ltlf-synthesis-1705.08426</loc><lastmod>2017-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-ltlf-synthesis-1705.08426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-ltlf-synthesis-1705.08426"/></url>
<url><loc>https://scifaro.com/en/abs/on-path-based-coalgebras-and-weak-notions-of-bisimulation-1705.08715</loc><lastmod>2017-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-path-based-coalgebras-and-weak-notions-of-bisimulation-1705.08715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-path-based-coalgebras-and-weak-notions-of-bisimulation-1705.08715"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-combination-of-the-bernays-sch-onfinkel-ramsey-fragment-with-simple-linear-integer-arithmetic-1705.08792</loc><lastmod>2017-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-combination-of-the-bernays-sch-onfinkel-ramsey-fragment-with-simple-linear-integer-arithmetic-1705.08792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-combination-of-the-bernays-sch-onfinkel-ramsey-fragment-with-simple-linear-integer-arithmetic-1705.08792"/></url>
<url><loc>https://scifaro.com/en/abs/automating-the-proofs-of-strengthening-lemmas-in-the-abella-proof-assistant-1705.09025</loc><lastmod>2017-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-the-proofs-of-strengthening-lemmas-in-the-abella-proof-assistant-1705.09025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-the-proofs-of-strengthening-lemmas-in-the-abella-proof-assistant-1705.09025"/></url>
<url><loc>https://scifaro.com/en/abs/proper-functors-and-fixed-points-for-finite-behaviour-1705.09198</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-functors-and-fixed-points-for-finite-behaviour-1705.09198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-functors-and-fixed-points-for-finite-behaviour-1705.09198"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-selection-of-colimits-1705.09363</loc><lastmod>2017-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-selection-of-colimits-1705.09363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-selection-of-colimits-1705.09363"/></url>
<url><loc>https://scifaro.com/en/abs/choreographies-for-automatic-recovery-1705.09525</loc><lastmod>2017-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choreographies-for-automatic-recovery-1705.09525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choreographies-for-automatic-recovery-1705.09525"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-minimal-semantics-preserving-slices-of-predicate-linear-free-liberal-program-schemas-1705.09615</loc><lastmod>2017-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-minimal-semantics-preserving-slices-of-predicate-linear-free-liberal-program-schemas-1705.09615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-minimal-semantics-preserving-slices-of-predicate-linear-free-liberal-program-schemas-1705.09615"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-transform-methods-using-hol-light-1705.10050</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-transform-methods-using-hol-light-1705.10050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-transform-methods-using-hol-light-1705.10050"/></url>
<url><loc>https://scifaro.com/en/abs/conservative-extensions-in-guarded-and-two-variable-fragments-1705.10115</loc><lastmod>2017-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conservative-extensions-in-guarded-and-two-variable-fragments-1705.10115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conservative-extensions-in-guarded-and-two-variable-fragments-1705.10115"/></url>
<url><loc>https://scifaro.com/en/abs/metric-bisimulation-games-and-real-valued-modal-logics-for-coalgebras-1705.10165</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-bisimulation-games-and-real-valued-modal-logics-for-coalgebras-1705.10165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-bisimulation-games-and-real-valued-modal-logics-for-coalgebras-1705.10165"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-asm-thesis-for-reflective-sequential-algorithms-1705.10708</loc><lastmod>2017-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-asm-thesis-for-reflective-sequential-algorithms-1705.10708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-asm-thesis-for-reflective-sequential-algorithms-1705.10708"/></url>
<url><loc>https://scifaro.com/en/abs/attainable-knowledge-and-omniscience-1705.10760</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attainable-knowledge-and-omniscience-1705.10760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attainable-knowledge-and-omniscience-1705.10760"/></url>
<url><loc>https://scifaro.com/en/abs/generating-witness-of-non-bisimilarity-for-the-pi-calculus-1705.10908</loc><lastmod>2017-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-witness-of-non-bisimilarity-for-the-pi-calculus-1705.10908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-witness-of-non-bisimilarity-for-the-pi-calculus-1705.10908"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-non-deterministic-parallel-abstract-state-machines-1705.11097</loc><lastmod>2017-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-non-deterministic-parallel-abstract-state-machines-1705.11097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-non-deterministic-parallel-abstract-state-machines-1705.11097"/></url>
<url><loc>https://scifaro.com/en/abs/sequoidal-categories-and-transfinite-games-a-coalgebraic-approach-to-stateful-objects-in-game-semantics-1706.00035</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequoidal-categories-and-transfinite-games-a-coalgebraic-approach-to-stateful-objects-in-game-semantics-1706.00035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequoidal-categories-and-transfinite-games-a-coalgebraic-approach-to-stateful-objects-in-game-semantics-1706.00035"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-solving-for-finite-model-finding-in-smt-solvers-1706.00096</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-solving-for-finite-model-finding-in-smt-solvers-1706.00096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-solving-for-finite-model-finding-in-smt-solvers-1706.00096"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-model-of-message-passing-processes-1706.00266</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-model-of-message-passing-processes-1706.00266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-model-of-message-passing-processes-1706.00266"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-method-of-verification-of-security-protocols-1706.00269</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-method-of-verification-of-security-protocols-1706.00269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-method-of-verification-of-security-protocols-1706.00269"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-parametric-interval-markov-chains-using-constraints-1706.00270</loc><lastmod>2017-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-parametric-interval-markov-chains-using-constraints-1706.00270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-parametric-interval-markov-chains-using-constraints-1706.00270"/></url>
<url><loc>https://scifaro.com/en/abs/coherence-spaces-and-uniform-continuity-1706.00562</loc><lastmod>2017-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherence-spaces-and-uniform-continuity-1706.00562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherence-spaces-and-uniform-continuity-1706.00562"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-foundations-of-infinitary-rewriting-and-infinitary-equational-logic-1706.00677</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-foundations-of-infinitary-rewriting-and-infinitary-equational-logic-1706.00677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-foundations-of-infinitary-rewriting-and-infinitary-equational-logic-1706.00677"/></url>
<url><loc>https://scifaro.com/en/abs/representing-nonterminating-rewriting-with-mathbf-f-2-mu-1706.00746</loc><lastmod>2017-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-nonterminating-rewriting-with-mathbf-f-2-mu-1706.00746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-nonterminating-rewriting-with-mathbf-f-2-mu-1706.00746"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-equivalences-for-fluid-stochastic-petri-nets-1706.02641</loc><lastmod>2017-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-equivalences-for-fluid-stochastic-petri-nets-1706.02641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-equivalences-for-fluid-stochastic-petri-nets-1706.02641"/></url>
<url><loc>https://scifaro.com/en/abs/from-model-checking-to-a-temporal-proof-for-partial-models-preliminary-example-1706.02701</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-model-checking-to-a-temporal-proof-for-partial-models-preliminary-example-1706.02701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-model-checking-to-a-temporal-proof-for-partial-models-preliminary-example-1706.02701"/></url>
<url><loc>https://scifaro.com/en/abs/a-real-valued-modal-logic-1706.02854</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-real-valued-modal-logic-1706.02854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-real-valued-modal-logic-1706.02854"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theoretical-definition-of-weak-omega-categories-1706.02866</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theoretical-definition-of-weak-omega-categories-1706.02866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theoretical-definition-of-weak-omega-categories-1706.02866"/></url>
<url><loc>https://scifaro.com/en/abs/computational-coverage-of-tlg-nonlinearity-1706.03033</loc><lastmod>2017-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-coverage-of-tlg-nonlinearity-1706.03033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-coverage-of-tlg-nonlinearity-1706.03033"/></url>
<url><loc>https://scifaro.com/en/abs/models-for-the-displacement-calculus-1706.03244</loc><lastmod>2017-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-for-the-displacement-calculus-1706.03244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-for-the-displacement-calculus-1706.03244"/></url>
<url><loc>https://scifaro.com/en/abs/getting-around-the-halting-problem-1706.03392</loc><lastmod>2022-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/getting-around-the-halting-problem-1706.03392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/getting-around-the-halting-problem-1706.03392"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-study-of-abstract-termination-principles-1706.03577</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-study-of-abstract-termination-principles-1706.03577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-study-of-abstract-termination-principles-1706.03577"/></url>
<url><loc>https://scifaro.com/en/abs/strongly-normalizing-audited-computation-1706.03711</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strongly-normalizing-audited-computation-1706.03711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strongly-normalizing-audited-computation-1706.03711"/></url>
<url><loc>https://scifaro.com/en/abs/on-generalizing-decidable-standard-prefix-classes-of-first-order-logic-1706.03949</loc><lastmod>2017-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-generalizing-decidable-standard-prefix-classes-of-first-order-logic-1706.03949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-generalizing-decidable-standard-prefix-classes-of-first-order-logic-1706.03949"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexity-of-propositional-linear-time-temporal-logic-with-finitely-many-variables-1706.04108</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-of-propositional-linear-time-temporal-logic-with-finitely-many-variables-1706.04108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-of-propositional-linear-time-temporal-logic-with-finitely-many-variables-1706.04108"/></url>
<url><loc>https://scifaro.com/en/abs/a-model-of-parametric-dependent-type-theory-in-bridge-path-cubical-sets-1706.04383</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-model-of-parametric-dependent-type-theory-in-bridge-path-cubical-sets-1706.04383"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-model-of-parametric-dependent-type-theory-in-bridge-path-cubical-sets-1706.04383"/></url>
<url><loc>https://scifaro.com/en/abs/normalizing-the-taylor-expansion-of-non-deterministic-lambda-terms-via-parallel-reduction-of-resource-vectors-1706.04700</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalizing-the-taylor-expansion-of-non-deterministic-lambda-terms-via-parallel-reduction-of-resource-vectors-1706.04700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalizing-the-taylor-expansion-of-non-deterministic-lambda-terms-via-parallel-reduction-of-resource-vectors-1706.04700"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-first-order-modal-and-intuitionistic-logics-with-two-variables-and-one-monadic-predicate-letter-1706.05060</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-first-order-modal-and-intuitionistic-logics-with-two-variables-and-one-monadic-predicate-letter-1706.05060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-first-order-modal-and-intuitionistic-logics-with-two-variables-and-one-monadic-predicate-letter-1706.05060"/></url>
<url><loc>https://scifaro.com/en/abs/asymmetric-unification-and-disunification-1706.05066</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymmetric-unification-and-disunification-1706.05066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymmetric-unification-and-disunification-1706.05066"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-checking-of-incomplete-models-1706.05082</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-checking-of-incomplete-models-1706.05082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-checking-of-incomplete-models-1706.05082"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-magnitude-and-phase-responses-in-fixed-point-digital-filters-1706.05088</loc><lastmod>2017-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-magnitude-and-phase-responses-in-fixed-point-digital-filters-1706.05088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-magnitude-and-phase-responses-in-fixed-point-digital-filters-1706.05088"/></url>
<url><loc>https://scifaro.com/en/abs/on-problems-dual-to-unification-1706.05607</loc><lastmod>2017-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-problems-dual-to-unification-1706.05607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-problems-dual-to-unification-1706.05607"/></url>
<url><loc>https://scifaro.com/en/abs/evidence-logics-with-relational-evidence-1706.05905</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evidence-logics-with-relational-evidence-1706.05905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evidence-logics-with-relational-evidence-1706.05905"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-systems-for-negative-modalities-1706.05945</loc><lastmod>2017-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-systems-for-negative-modalities-1706.05945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-systems-for-negative-modalities-1706.05945"/></url>
<url><loc>https://scifaro.com/en/abs/the-hott-reals-coincide-with-the-escard-o-simpson-reals-1706.05956</loc><lastmod>2017-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hott-reals-coincide-with-the-escard-o-simpson-reals-1706.05956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hott-reals-coincide-with-the-escard-o-simpson-reals-1706.05956"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-hoare-style-reasoning-about-hybrid-csp-in-the-duration-calculus-1706.06246</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-hoare-style-reasoning-about-hybrid-csp-in-the-duration-calculus-1706.06246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-hoare-style-reasoning-about-hybrid-csp-in-the-duration-calculus-1706.06246"/></url>
<url><loc>https://scifaro.com/en/abs/grilliot-s-trick-in-nonstandard-analysis-1706.06663</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grilliot-s-trick-in-nonstandard-analysis-1706.06663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grilliot-s-trick-in-nonstandard-analysis-1706.06663"/></url>
<url><loc>https://scifaro.com/en/abs/accurate-and-efficient-profile-matching-in-knowledge-bases-1706.06944</loc><lastmod>2024-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accurate-and-efficient-profile-matching-in-knowledge-bases-1706.06944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accurate-and-efficient-profile-matching-in-knowledge-bases-1706.06944"/></url>
<url><loc>https://scifaro.com/en/abs/in-search-of-effectful-dependent-types-1706.07997</loc><lastmod>2017-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/in-search-of-effectful-dependent-types-1706.07997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/in-search-of-effectful-dependent-types-1706.07997"/></url>
<url><loc>https://scifaro.com/en/abs/an-adaptive-prefix-assignment-technique-for-symmetry-reduction-1706.08325</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-adaptive-prefix-assignment-technique-for-symmetry-reduction-1706.08325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-adaptive-prefix-assignment-technique-for-symmetry-reduction-1706.08325"/></url>
<url><loc>https://scifaro.com/en/abs/the-boolean-solution-problem-from-the-perspective-of-predicate-logic-extended-version-1706.08329</loc><lastmod>2025-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-boolean-solution-problem-from-the-perspective-of-predicate-logic-extended-version-1706.08329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-boolean-solution-problem-from-the-perspective-of-predicate-logic-extended-version-1706.08329"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-1706.08401</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-1706.08401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-1706.08401"/></url>
<url><loc>https://scifaro.com/en/abs/the-bernays-sch-onfinkel-ramsey-fragment-with-bounded-difference-constraints-over-the-reals-is-decidable-1706.08504</loc><lastmod>2017-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bernays-sch-onfinkel-ramsey-fragment-with-bounded-difference-constraints-over-the-reals-is-decidable-1706.08504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bernays-sch-onfinkel-ramsey-fragment-with-bounded-difference-constraints-over-the-reals-is-decidable-1706.08504"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-counting-temporal-logics-on-flat-structures-1706.08608</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-counting-temporal-logics-on-flat-structures-1706.08608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-counting-temporal-logics-on-flat-structures-1706.08608"/></url>
<url><loc>https://scifaro.com/en/abs/merging-fragments-of-classical-logic-1706.08689</loc><lastmod>2017-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/merging-fragments-of-classical-logic-1706.08689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/merging-fragments-of-classical-logic-1706.08689"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-first-order-spectra-with-binary-relations-1706.08691</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-first-order-spectra-with-binary-relations-1706.08691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-first-order-spectra-with-binary-relations-1706.08691"/></url>
<url><loc>https://scifaro.com/en/abs/automating-sized-type-inference-for-complexity-analysis-technical-report-1706.09169</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-sized-type-inference-for-complexity-analysis-technical-report-1706.09169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-sized-type-inference-for-complexity-analysis-technical-report-1706.09169"/></url>
<url><loc>https://scifaro.com/en/abs/cdcl-inspired-word-level-learning-for-bit-vector-constraint-solving-1706.09229</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cdcl-inspired-word-level-learning-for-bit-vector-constraint-solving-1706.09229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cdcl-inspired-word-level-learning-for-bit-vector-constraint-solving-1706.09229"/></url>
<url><loc>https://scifaro.com/en/abs/subtropical-satisfiability-1706.09236</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subtropical-satisfiability-1706.09236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subtropical-satisfiability-1706.09236"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-and-quantitative-monitoring-of-spatio-temporal-properties-with-sstl-1706.09334</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-and-quantitative-monitoring-of-spatio-temporal-properties-with-sstl-1706.09334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-and-quantitative-monitoring-of-spatio-temporal-properties-with-sstl-1706.09334"/></url>
<url><loc>https://scifaro.com/en/abs/dynasp2-5-dynamic-programming-on-tree-decompositions-in-action-1706.09370</loc><lastmod>2017-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynasp2-5-dynamic-programming-on-tree-decompositions-in-action-1706.09370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynasp2-5-dynamic-programming-on-tree-decompositions-in-action-1706.09370"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-control-for-multi-mode-systems-with-discrete-costs-1706.09886</loc><lastmod>2017-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-control-for-multi-mode-systems-with-discrete-costs-1706.09886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-control-for-multi-mode-systems-with-discrete-costs-1706.09886"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-based-bisimulation-for-labelled-markov-processes-1706.10049</loc><lastmod>2017-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-based-bisimulation-for-labelled-markov-processes-1706.10049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-based-bisimulation-for-labelled-markov-processes-1706.10049"/></url>
<url><loc>https://scifaro.com/en/abs/novel-logical-method-for-security-analysis-of-electronic-payment-protocols-1706.10078</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/novel-logical-method-for-security-analysis-of-electronic-payment-protocols-1706.10078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/novel-logical-method-for-security-analysis-of-electronic-payment-protocols-1706.10078"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-policy-synthesis-for-mdps-with-pctl-constraints-1706.10102</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-policy-synthesis-for-mdps-with-pctl-constraints-1706.10102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-policy-synthesis-for-mdps-with-pctl-constraints-1706.10102"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-convex-polyhedra-based-on-the-simplex-method-1706.10269</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-convex-polyhedra-based-on-the-simplex-method-1706.10269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-convex-polyhedra-based-on-the-simplex-method-1706.10269"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalized-general-theory-of-syntax-with-bindings-1707.00024</loc><lastmod>2017-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalized-general-theory-of-syntax-with-bindings-1707.00024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalized-general-theory-of-syntax-with-bindings-1707.00024"/></url>
<url><loc>https://scifaro.com/en/abs/a-channel-based-perspective-on-conjugate-priors-1707.00269</loc><lastmod>2018-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-channel-based-perspective-on-conjugate-priors-1707.00269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-channel-based-perspective-on-conjugate-priors-1707.00269"/></url>
<url><loc>https://scifaro.com/en/abs/shrub-depth-capturing-height-of-dense-graphs-1707.00359</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shrub-depth-capturing-height-of-dense-graphs-1707.00359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shrub-depth-capturing-height-of-dense-graphs-1707.00359"/></url>
<url><loc>https://scifaro.com/en/abs/multiplicative-additive-proof-equivalence-is-logspace-complete-via-binary-decision-trees-1707.00991</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiplicative-additive-proof-equivalence-is-logspace-complete-via-binary-decision-trees-1707.00991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiplicative-additive-proof-equivalence-is-logspace-complete-via-binary-decision-trees-1707.00991"/></url>
<url><loc>https://scifaro.com/en/abs/logically-automorphically-equivalent-knowledge-bases-1707.01027</loc><lastmod>2017-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logically-automorphically-equivalent-knowledge-bases-1707.01027"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logically-automorphically-equivalent-knowledge-bases-1707.01027"/></url>
<url><loc>https://scifaro.com/en/abs/on-petri-nets-with-hierarchical-special-arcs-1707.01157</loc><lastmod>2017-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-petri-nets-with-hierarchical-special-arcs-1707.01157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-petri-nets-with-hierarchical-special-arcs-1707.01157"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-guarded-protocols-better-cutoffs-more-systems-more-expressivity-1707.01369</loc><lastmod>2017-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-guarded-protocols-better-cutoffs-more-systems-more-expressivity-1707.01369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-guarded-protocols-better-cutoffs-more-systems-more-expressivity-1707.01369"/></url>
<url><loc>https://scifaro.com/en/abs/productive-corecursion-in-logic-programming-1707.01541</loc><lastmod>2017-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/productive-corecursion-in-logic-programming-1707.01541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/productive-corecursion-in-logic-programming-1707.01541"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-blockchain-updates-1707.01766</loc><lastmod>2017-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-blockchain-updates-1707.01766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-blockchain-updates-1707.01766"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-reasoning-over-existential-rules-1707.01870</loc><lastmod>2017-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-reasoning-over-existential-rules-1707.01870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-reasoning-over-existential-rules-1707.01870"/></url>
<url><loc>https://scifaro.com/en/abs/model-based-diagnosis-of-multiple-observations-with-implicit-hitting-sets-1707.01972</loc><lastmod>2017-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-based-diagnosis-of-multiple-observations-with-implicit-hitting-sets-1707.01972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-based-diagnosis-of-multiple-observations-with-implicit-hitting-sets-1707.01972"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-cdcl-to-template-based-abstract-domains-for-program-verification-1707.02011</loc><lastmod>2017-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-cdcl-to-template-based-abstract-domains-for-program-verification-1707.02011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-cdcl-to-template-based-abstract-domains-for-program-verification-1707.02011"/></url>
<url><loc>https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-ii-strong-termination-1707.02034</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-ii-strong-termination-1707.02034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-ii-strong-termination-1707.02034"/></url>
<url><loc>https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-i-1707.02056</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-i-1707.02056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-call-by-value-calculi-of-control-operators-i-1707.02056"/></url>
<url><loc>https://scifaro.com/en/abs/logical-properties-of-random-graphs-from-small-addable-classes-1707.02081</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-properties-of-random-graphs-from-small-addable-classes-1707.02081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-properties-of-random-graphs-from-small-addable-classes-1707.02081"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-markovian-bisimulation-for-chemical-reaction-networks-1707.02132</loc><lastmod>2017-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-markovian-bisimulation-for-chemical-reaction-networks-1707.02132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-markovian-bisimulation-for-chemical-reaction-networks-1707.02132"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-calculus-of-cyber-physical-systems-1707.02279</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-calculus-of-cyber-physical-systems-1707.02279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-calculus-of-cyber-physical-systems-1707.02279"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-bisimilarity-via-the-power-of-convex-algebras-1707.02344</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-bisimilarity-via-the-power-of-convex-algebras-1707.02344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-bisimilarity-via-the-power-of-convex-algebras-1707.02344"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-cnot-1707.02348</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-cnot-1707.02348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-cnot-1707.02348"/></url>
<url><loc>https://scifaro.com/en/abs/complete-cyclic-proof-systems-for-inductive-entailments-1707.02415</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-cyclic-proof-systems-for-inductive-entailments-1707.02415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-cyclic-proof-systems-for-inductive-entailments-1707.02415"/></url>
<url><loc>https://scifaro.com/en/abs/finding-polynomial-loop-invariants-for-probabilistic-programs-1707.02690</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-polynomial-loop-invariants-for-probabilistic-programs-1707.02690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-polynomial-loop-invariants-for-probabilistic-programs-1707.02690"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-algorithm-to-automate-inductive-learning-of-default-theories-1707.02693</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-algorithm-to-automate-inductive-learning-of-default-theories-1707.02693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-algorithm-to-automate-inductive-learning-of-default-theories-1707.02693"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-handling-rules-with-binders-patterns-and-generic-quantification-1707.02754</loc><lastmod>2017-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-handling-rules-with-binders-patterns-and-generic-quantification-1707.02754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-handling-rules-with-binders-patterns-and-generic-quantification-1707.02754"/></url>
<url><loc>https://scifaro.com/en/abs/equational-reasonings-in-wireless-network-gossip-protocols-1707.03215</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-reasonings-in-wireless-network-gossip-protocols-1707.03215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-reasonings-in-wireless-network-gossip-protocols-1707.03215"/></url>
<url><loc>https://scifaro.com/en/abs/separating-regular-languages-with-two-quantifier-alternations-1707.03295</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-regular-languages-with-two-quantifier-alternations-1707.03295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-regular-languages-with-two-quantifier-alternations-1707.03295"/></url>
<url><loc>https://scifaro.com/en/abs/the-covering-problem-1707.03370</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-covering-problem-1707.03370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-covering-problem-1707.03370"/></url>
<url><loc>https://scifaro.com/en/abs/sea-param-exploring-schedulers-in-parametric-mdps-1707.04122</loc><lastmod>2017-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sea-param-exploring-schedulers-in-parametric-mdps-1707.04122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sea-param-exploring-schedulers-in-parametric-mdps-1707.04122"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterization-of-trace-metrics-1707.04124</loc><lastmod>2017-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterization-of-trace-metrics-1707.04124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterization-of-trace-metrics-1707.04124"/></url>
<url><loc>https://scifaro.com/en/abs/design-and-optimisation-of-the-flyfast-front-end-for-attribute-based-coordination-1707.04126</loc><lastmod>2017-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-and-optimisation-of-the-flyfast-front-end-for-attribute-based-coordination-1707.04126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-and-optimisation-of-the-flyfast-front-end-for-attribute-based-coordination-1707.04126"/></url>
<url><loc>https://scifaro.com/en/abs/the-reach-avoid-problem-for-constant-rate-multi-mode-systems-1707.04151</loc><lastmod>2017-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-reach-avoid-problem-for-constant-rate-multi-mode-systems-1707.04151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-reach-avoid-problem-for-constant-rate-multi-mode-systems-1707.04151"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-timed-automata-with-clock-dependent-probabilities-1707.04507</loc><lastmod>2017-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-timed-automata-with-clock-dependent-probabilities-1707.04507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-timed-automata-with-clock-dependent-probabilities-1707.04507"/></url>
<url><loc>https://scifaro.com/en/abs/memoisation-purely-left-recursively-and-with-continuation-passing-style-1707.04724</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memoisation-purely-left-recursively-and-with-continuation-passing-style-1707.04724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memoisation-purely-left-recursively-and-with-continuation-passing-style-1707.04724"/></url>
<url><loc>https://scifaro.com/en/abs/annotated-defeasible-logic-1707.04734</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/annotated-defeasible-logic-1707.04734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/annotated-defeasible-logic-1707.04734"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-the-fundamental-group-in-untyped-set-theory-using-auto2-1707.04757</loc><lastmod>2017-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-the-fundamental-group-in-untyped-set-theory-using-auto2-1707.04757"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-the-fundamental-group-in-untyped-set-theory-using-auto2-1707.04757"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-base-cirquent-calculus-i-parallel-and-choice-connectives-1707.04823</loc><lastmod>2017-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-base-cirquent-calculus-i-parallel-and-choice-connectives-1707.04823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-base-cirquent-calculus-i-parallel-and-choice-connectives-1707.04823"/></url>
<url><loc>https://scifaro.com/en/abs/further-formalization-of-the-process-algebra-ccs-in-hol4-1707.04894</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/further-formalization-of-the-process-algebra-ccs-in-hol4-1707.04894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/further-formalization-of-the-process-algebra-ccs-in-hol4-1707.04894"/></url>
<url><loc>https://scifaro.com/en/abs/ticker-a-system-for-incremental-asp-based-stream-reasoning-1707.05304</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ticker-a-system-for-incremental-asp-based-stream-reasoning-1707.05304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ticker-a-system-for-incremental-asp-based-stream-reasoning-1707.05304"/></url>
<url><loc>https://scifaro.com/en/abs/some-improvements-in-fuzzy-turing-machines-1707.05311</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-improvements-in-fuzzy-turing-machines-1707.05311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-improvements-in-fuzzy-turing-machines-1707.05311"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-verification-of-temporal-properties-over-out-of-order-data-streams-1707.05555</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-verification-of-temporal-properties-over-out-of-order-data-streams-1707.05555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-verification-of-temporal-properties-over-out-of-order-data-streams-1707.05555"/></url>
<url><loc>https://scifaro.com/en/abs/the-finite-satisfiability-problem-for-two-variable-first-order-logic-with-one-transitive-relation-is-decidable-1707.05558</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-finite-satisfiability-problem-for-two-variable-first-order-logic-with-one-transitive-relation-is-decidable-1707.05558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-finite-satisfiability-problem-for-two-variable-first-order-logic-with-one-transitive-relation-is-decidable-1707.05558"/></url>
<url><loc>https://scifaro.com/en/abs/inspecting-maude-variants-with-glints-1707.05599</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inspecting-maude-variants-with-glints-1707.05599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inspecting-maude-variants-with-glints-1707.05599"/></url>
<url><loc>https://scifaro.com/en/abs/going-higher-in-first-order-quantifier-alternation-hierarchies-on-words-1707.05696</loc><lastmod>2017-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/going-higher-in-first-order-quantifier-alternation-hierarchies-on-words-1707.05696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/going-higher-in-first-order-quantifier-alternation-hierarchies-on-words-1707.05696"/></url>
<url><loc>https://scifaro.com/en/abs/an-independent-axiomatisation-for-free-short-circuit-logic-1707.05718</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-independent-axiomatisation-for-free-short-circuit-logic-1707.05718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-independent-axiomatisation-for-free-short-circuit-logic-1707.05718"/></url>
<url><loc>https://scifaro.com/en/abs/program-completionin-the-input-language-of-gringo-1707.05848</loc><lastmod>2017-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-completionin-the-input-language-of-gringo-1707.05848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-completionin-the-input-language-of-gringo-1707.05848"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-query-evaluation-with-cardinality-conditions-1707.05945</loc><lastmod>2017-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-query-evaluation-with-cardinality-conditions-1707.05945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-query-evaluation-with-cardinality-conditions-1707.05945"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computation-of-paracoherent-answer-sets-1707.06813</loc><lastmod>2017-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computation-of-paracoherent-answer-sets-1707.06813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computation-of-paracoherent-answer-sets-1707.06813"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-concurrent-rational-synthesis-1707.06936</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-concurrent-rational-synthesis-1707.06936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-concurrent-rational-synthesis-1707.06936"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-linear-control-systems-using-theorem-proving-1707.06967</loc><lastmod>2017-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-linear-control-systems-using-theorem-proving-1707.06967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-linear-control-systems-using-theorem-proving-1707.06967"/></url>
<url><loc>https://scifaro.com/en/abs/a-c-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1707.07545</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-c-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1707.07545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-c-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1707.07545"/></url>
<url><loc>https://scifaro.com/en/abs/e-qed-electrical-bug-localization-during-post-silicon-validation-enabled-by-quick-error-detection-and-formal-methods-1707.07671</loc><lastmod>2017-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/e-qed-electrical-bug-localization-during-post-silicon-validation-enabled-by-quick-error-detection-and-formal-methods-1707.07671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/e-qed-electrical-bug-localization-during-post-silicon-validation-enabled-by-quick-error-detection-and-formal-methods-1707.07671"/></url>
<url><loc>https://scifaro.com/en/abs/n-dimensional-fuzzy-negations-1707.08617</loc><lastmod>2019-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/n-dimensional-fuzzy-negations-1707.08617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/n-dimensional-fuzzy-negations-1707.08617"/></url>
<url><loc>https://scifaro.com/en/abs/common-knowledge-in-a-logic-of-gossips-1707.08734</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-knowledge-in-a-logic-of-gossips-1707.08734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-knowledge-in-a-logic-of-gossips-1707.08734"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-global-and-local-announcements-1707.08735</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-global-and-local-announcements-1707.08735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-global-and-local-announcements-1707.08735"/></url>
<url><loc>https://scifaro.com/en/abs/from-type-spaces-to-probability-frames-and-back-via-language-1707.08738</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-type-spaces-to-probability-frames-and-back-via-language-1707.08738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-type-spaces-to-probability-frames-and-back-via-language-1707.08738"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-in-inquisitive-modal-logic-1707.08742</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-in-inquisitive-modal-logic-1707.08742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-in-inquisitive-modal-logic-1707.08742"/></url>
<url><loc>https://scifaro.com/en/abs/toward-an-epistemic-logical-theory-of-categorization-1707.08743</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-an-epistemic-logical-theory-of-categorization-1707.08743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-an-epistemic-logical-theory-of-categorization-1707.08743"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-belief-knowledge-and-probability-1707.08744</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-belief-knowledge-and-probability-1707.08744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-belief-knowledge-and-probability-1707.08744"/></url>
<url><loc>https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1707.08746</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1707.08746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1707.08746"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-approach-to-the-problem-of-logical-non-omniscience-1707.08747</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-approach-to-the-problem-of-logical-non-omniscience-1707.08747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-approach-to-the-problem-of-logical-non-omniscience-1707.08747"/></url>
<url><loc>https://scifaro.com/en/abs/indicative-conditionals-and-dynamic-epistemic-logic-1707.08752</loc><lastmod>2017-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indicative-conditionals-and-dynamic-epistemic-logic-1707.08752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indicative-conditionals-and-dynamic-epistemic-logic-1707.08752"/></url>
<url><loc>https://scifaro.com/en/abs/categories-for-dynamic-epistemic-logic-1707.08753</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categories-for-dynamic-epistemic-logic-1707.08753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categories-for-dynamic-epistemic-logic-1707.08753"/></url>
<url><loc>https://scifaro.com/en/abs/arbitrary-arrow-update-logic-with-common-knowledge-is-neither-re-nor-co-re-1707.08754</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arbitrary-arrow-update-logic-with-common-knowledge-is-neither-re-nor-co-re-1707.08754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arbitrary-arrow-update-logic-with-common-knowledge-is-neither-re-nor-co-re-1707.08754"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-extended-abstract-1707.08756</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-extended-abstract-1707.08756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-epistemic-model-checking-using-conditional-independence-extended-abstract-1707.08756"/></url>
<url><loc>https://scifaro.com/en/abs/endogenizing-epistemic-actions-1707.08758</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/endogenizing-epistemic-actions-1707.08758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/endogenizing-epistemic-actions-1707.08758"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-galois-connections-on-fuzzy-sets-1707.08849</loc><lastmod>2024-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-galois-connections-on-fuzzy-sets-1707.08849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-galois-connections-on-fuzzy-sets-1707.08849"/></url>
<url><loc>https://scifaro.com/en/abs/expressive-stream-reasoning-with-laser-1707.08876</loc><lastmod>2017-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressive-stream-reasoning-with-laser-1707.08876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressive-stream-reasoning-with-laser-1707.08876"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-and-functional-types-in-ludics-1707.08925</loc><lastmod>2017-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-and-functional-types-in-ludics-1707.08925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-and-functional-types-in-ludics-1707.08925"/></url>
<url><loc>https://scifaro.com/en/abs/a-syntactic-tool-for-proving-hardness-in-the-second-level-of-the-polynomial-time-hierarchy-1707.09327</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syntactic-tool-for-proving-hardness-in-the-second-level-of-the-polynomial-time-hierarchy-1707.09327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syntactic-tool-for-proving-hardness-in-the-second-level-of-the-polynomial-time-hierarchy-1707.09327"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-counting-with-short-xors-1707.09467</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-counting-with-short-xors-1707.09467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-counting-with-short-xors-1707.09467"/></url>
<url><loc>https://scifaro.com/en/abs/correct-composition-of-dephased-behavioural-models-1707.09646</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-composition-of-dephased-behavioural-models-1707.09646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-composition-of-dephased-behavioural-models-1707.09646"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-continuous-time-systems-using-fourier-transform-1707.09941</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-continuous-time-systems-using-fourier-transform-1707.09941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-continuous-time-systems-using-fourier-transform-1707.09941"/></url>
<url><loc>https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-extended-abstract-1707.09978</loc><lastmod>2017-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-extended-abstract-1707.09978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-and-topology-for-knowledge-knowability-and-belief-extended-abstract-1707.09978"/></url>
<url><loc>https://scifaro.com/en/abs/a-component-oriented-framework-for-autonomous-agents-1708.00072</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-component-oriented-framework-for-autonomous-agents-1708.00072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-component-oriented-framework-for-autonomous-agents-1708.00072"/></url>
<url><loc>https://scifaro.com/en/abs/the-topology-free-construction-of-the-universal-type-structure-for-conditional-probability-systems-1708.00378</loc><lastmod>2017-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topology-free-construction-of-the-universal-type-structure-for-conditional-probability-systems-1708.00378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topology-free-construction-of-the-universal-type-structure-for-conditional-probability-systems-1708.00378"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-online-enumeration-of-all-minimal-unsatisfiable-subsets-1708.00400</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-online-enumeration-of-all-minimal-unsatisfiable-subsets-1708.00400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-online-enumeration-of-all-minimal-unsatisfiable-subsets-1708.00400"/></url>
<url><loc>https://scifaro.com/en/abs/vldl-satisfiability-and-model-checking-via-tree-automata-1708.00699</loc><lastmod>2017-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vldl-satisfiability-and-model-checking-via-tree-automata-1708.00699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vldl-satisfiability-and-model-checking-via-tree-automata-1708.00699"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-pairing-for-program-verification-1708.01473</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-pairing-for-program-verification-1708.01473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-pairing-for-program-verification-1708.01473"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-hidden-markov-models-a-monadic-account-of-quantitative-information-flow-1708.01688</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-hidden-markov-models-a-monadic-account-of-quantitative-information-flow-1708.01688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-hidden-markov-models-a-monadic-account-of-quantitative-information-flow-1708.01688"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-quest-for-an-acyclic-graph-1708.01745</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-quest-for-an-acyclic-graph-1708.01745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-quest-for-an-acyclic-graph-1708.01745"/></url>
<url><loc>https://scifaro.com/en/abs/lewis-meets-brouwer-constructive-strict-implication-1708.02143</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lewis-meets-brouwer-constructive-strict-implication-1708.02143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lewis-meets-brouwer-constructive-strict-implication-1708.02143"/></url>
<url><loc>https://scifaro.com/en/abs/kripke-completeness-of-strictly-positive-modal-logics-over-meet-semilattices-with-operators-1708.03403</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kripke-completeness-of-strictly-positive-modal-logics-over-meet-semilattices-with-operators-1708.03403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kripke-completeness-of-strictly-positive-modal-logics-over-meet-semilattices-with-operators-1708.03403"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-in-probabilistic-rewriting-1708.03536</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-in-probabilistic-rewriting-1708.03536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-in-probabilistic-rewriting-1708.03536"/></url>
<url><loc>https://scifaro.com/en/abs/star-height-via-games-1708.03603</loc><lastmod>2017-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-height-via-games-1708.03603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-height-via-games-1708.03603"/></url>
<url><loc>https://scifaro.com/en/abs/timed-epistemic-knowledge-bases-for-social-networks-extended-version-1708.04070</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-epistemic-knowledge-bases-for-social-networks-extended-version-1708.04070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-epistemic-knowledge-bases-for-social-networks-extended-version-1708.04070"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-probabilistic-justification-logic-1708.04100</loc><lastmod>2017-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-probabilistic-justification-logic-1708.04100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-probabilistic-justification-logic-1708.04100"/></url>
<url><loc>https://scifaro.com/en/abs/the-descriptive-complexity-of-modal-mu-model-checking-games-1708.04845</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-descriptive-complexity-of-modal-mu-model-checking-games-1708.04845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-descriptive-complexity-of-modal-mu-model-checking-games-1708.04845"/></url>
<url><loc>https://scifaro.com/en/abs/a-fix-point-characterization-of-herbrand-equivalence-of-expressions-in-data-flow-frameworks-1708.04976</loc><lastmod>2017-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fix-point-characterization-of-herbrand-equivalence-of-expressions-in-data-flow-frameworks-1708.04976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fix-point-characterization-of-herbrand-equivalence-of-expressions-in-data-flow-frameworks-1708.04976"/></url>
<url><loc>https://scifaro.com/en/abs/proof-relevant-logical-relations-for-name-generation-1708.05193</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-relevant-logical-relations-for-name-generation-1708.05193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-relevant-logical-relations-for-name-generation-1708.05193"/></url>
<url><loc>https://scifaro.com/en/abs/on-answer-substitutions-in-logic-programming-1708.05240</loc><lastmod>2018-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-answer-substitutions-in-logic-programming-1708.05240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-answer-substitutions-in-logic-programming-1708.05240"/></url>
<url><loc>https://scifaro.com/en/abs/complete-algorithms-for-algebraic-strongest-postconditions-and-weakest-preconditions-in-polynomial-odes-1708.05377</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-algorithms-for-algebraic-strongest-postconditions-and-weakest-preconditions-in-polynomial-odes-1708.05377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-algorithms-for-algebraic-strongest-postconditions-and-weakest-preconditions-in-polynomial-odes-1708.05377"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-modalities-with-provability-smack-1708.05607</loc><lastmod>2017-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-modalities-with-provability-smack-1708.05607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-modalities-with-provability-smack-1708.05607"/></url>
<url><loc>https://scifaro.com/en/abs/a-similarity-criterion-for-sequential-programs-using-truth-preserving-partial-functions-1708.05640</loc><lastmod>2017-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-similarity-criterion-for-sequential-programs-using-truth-preserving-partial-functions-1708.05640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-similarity-criterion-for-sequential-programs-using-truth-preserving-partial-functions-1708.05640"/></url>
<url><loc>https://scifaro.com/en/abs/dependences-in-strategy-logic-1708.05849</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependences-in-strategy-logic-1708.05849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependences-in-strategy-logic-1708.05849"/></url>
<url><loc>https://scifaro.com/en/abs/a-cointuitionistic-adjoint-logic-1708.05896</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cointuitionistic-adjoint-logic-1708.05896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cointuitionistic-adjoint-logic-1708.05896"/></url>
<url><loc>https://scifaro.com/en/abs/the-universal-process-1708.06010</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-universal-process-1708.06010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-universal-process-1708.06010"/></url>
<url><loc>https://scifaro.com/en/abs/extending-rational-choice-behavior-the-decision-problem-for-boolean-set-theory-with-a-choice-correspondence-1708.06121</loc><lastmod>2022-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-rational-choice-behavior-the-decision-problem-for-boolean-set-theory-with-a-choice-correspondence-1708.06121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-rational-choice-behavior-the-decision-problem-for-boolean-set-theory-with-a-choice-correspondence-1708.06121"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-quantum-programs-from-quipper-to-qpmc-1708.06312</loc><lastmod>2017-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-quantum-programs-from-quipper-to-qpmc-1708.06312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-quantum-programs-from-quipper-to-qpmc-1708.06312"/></url>
<url><loc>https://scifaro.com/en/abs/decision-procedure-for-entailment-of-symbolic-heaps-with-arrays-1708.06696</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-procedure-for-entailment-of-symbolic-heaps-with-arrays-1708.06696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-procedure-for-entailment-of-symbolic-heaps-with-arrays-1708.06696"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-verification-and-program-transformation-1708.06887</loc><lastmod>2017-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-verification-and-program-transformation-1708.06887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-international-workshop-on-verification-and-program-transformation-1708.06887"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-international-workshop-on-pre-and-post-deployment-verification-techniques-1708.06889</loc><lastmod>2017-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-international-workshop-on-pre-and-post-deployment-verification-techniques-1708.06889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-international-workshop-on-pre-and-post-deployment-verification-techniques-1708.06889"/></url>
<url><loc>https://scifaro.com/en/abs/generating-loop-invariants-for-program-verification-by-transformation-1708.07223</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-loop-invariants-for-program-verification-by-transformation-1708.07223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-loop-invariants-for-program-verification-by-transformation-1708.07223"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-runtime-monitoring-instrumentation-techniques-1708.07229</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-runtime-monitoring-instrumentation-techniques-1708.07229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-runtime-monitoring-instrumentation-techniques-1708.07229"/></url>
<url><loc>https://scifaro.com/en/abs/control-flow-residual-analysis-for-symbolic-automata-1708.07230</loc><lastmod>2017-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/control-flow-residual-analysis-for-symbolic-automata-1708.07230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/control-flow-residual-analysis-for-symbolic-automata-1708.07230"/></url>
<url><loc>https://scifaro.com/en/abs/cocoweb-a-convenient-web-interface-for-confluence-tools-1708.07876</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cocoweb-a-convenient-web-interface-for-confluence-tools-1708.07876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cocoweb-a-convenient-web-interface-for-confluence-tools-1708.07876"/></url>
<url><loc>https://scifaro.com/en/abs/critical-peaks-redefined-phi-sqcup-psi-top-1708.07877</loc><lastmod>2017-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/critical-peaks-redefined-phi-sqcup-psi-top-1708.07877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/critical-peaks-redefined-phi-sqcup-psi-top-1708.07877"/></url>
<url><loc>https://scifaro.com/en/abs/safe-reinforcement-learning-via-shielding-1708.08611</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-reinforcement-learning-via-shielding-1708.08611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-reinforcement-learning-via-shielding-1708.08611"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-security-policies-in-multi-agent-workflows-with-loops-1708.09013</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-security-policies-in-multi-agent-workflows-with-loops-1708.09013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-security-policies-in-multi-agent-workflows-with-loops-1708.09013"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-regular-language-constraints-1708.09073</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-regular-language-constraints-1708.09073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-regular-language-constraints-1708.09073"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-checking-fast-termination-in-vass-1708.09253</loc><lastmod>2017-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-checking-fast-termination-in-vass-1708.09253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-checking-fast-termination-in-vass-1708.09253"/></url>
<url><loc>https://scifaro.com/en/abs/boundedness-in-languages-of-infinite-words-1708.09765</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boundedness-in-languages-of-infinite-words-1708.09765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boundedness-in-languages-of-infinite-words-1708.09765"/></url>
<url><loc>https://scifaro.com/en/abs/the-rice-shapiro-theorem-in-computable-topology-1708.09820</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-rice-shapiro-theorem-in-computable-topology-1708.09820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-rice-shapiro-theorem-in-computable-topology-1708.09820"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-24th-international-workshop-on-expressiveness-in-concurrency-and-14th-workshop-on-structural-operational-semantics-1709.00049</loc><lastmod>2017-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-24th-international-workshop-on-expressiveness-in-concurrency-and-14th-workshop-on-structural-operational-semantics-1709.00049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-24th-international-workshop-on-expressiveness-in-concurrency-and-14th-workshop-on-structural-operational-semantics-1709.00049"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-herbrand-formulae-without-skolemization-1709.00191</loc><lastmod>2017-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-herbrand-formulae-without-skolemization-1709.00191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-herbrand-formulae-without-skolemization-1709.00191"/></url>
<url><loc>https://scifaro.com/en/abs/sharper-and-simpler-nonlinear-interpolants-for-program-verification-1709.00314</loc><lastmod>2017-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharper-and-simpler-nonlinear-interpolants-for-program-verification-1709.00314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharper-and-simpler-nonlinear-interpolants-for-program-verification-1709.00314"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-continuity-and-recurrence-in-dynamic-epistemic-logic-1709.00359</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-continuity-and-recurrence-in-dynamic-epistemic-logic-1709.00359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-continuity-and-recurrence-in-dynamic-epistemic-logic-1709.00359"/></url>
<url><loc>https://scifaro.com/en/abs/computing-stable-models-of-normal-logic-programs-without-grounding-1709.00501</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-stable-models-of-normal-logic-programs-without-grounding-1709.00501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-stable-models-of-normal-logic-programs-without-grounding-1709.00501"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-type-logical-grammars-in-agda-1709.00728</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-type-logical-grammars-in-agda-1709.00728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-type-logical-grammars-in-agda-1709.00728"/></url>
<url><loc>https://scifaro.com/en/abs/an-improved-algorithm-for-e-generalization-1709.00744</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-improved-algorithm-for-e-generalization-1709.00744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-improved-algorithm-for-e-generalization-1709.00744"/></url>
<url><loc>https://scifaro.com/en/abs/parity-games-and-automata-for-game-logic-extended-version-1709.00777</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-games-and-automata-for-game-logic-extended-version-1709.00777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-games-and-automata-for-game-logic-extended-version-1709.00777"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-mutual-exclusion-using-process-algebra-with-signals-1709.00826</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-mutual-exclusion-using-process-algebra-with-signals-1709.00826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-mutual-exclusion-using-process-algebra-with-signals-1709.00826"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-and-hennessy-milner-logic-for-generalized-synchronization-trees-1709.00827</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-and-hennessy-milner-logic-for-generalized-synchronization-trees-1709.00827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-and-hennessy-milner-logic-for-generalized-synchronization-trees-1709.00827"/></url>
<url><loc>https://scifaro.com/en/abs/using-session-types-for-reasoning-about-boundedness-in-the-pi-calculus-1709.00829</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-session-types-for-reasoning-about-boundedness-in-the-pi-calculus-1709.00829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-session-types-for-reasoning-about-boundedness-in-the-pi-calculus-1709.00829"/></url>
<url><loc>https://scifaro.com/en/abs/distributive-laws-for-monotone-specifications-1709.00830</loc><lastmod>2017-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributive-laws-for-monotone-specifications-1709.00830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributive-laws-for-monotone-specifications-1709.00830"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-timing-1709.01217</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-timing-1709.01217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-timing-1709.01217"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-sharpness-and-the-injective-property-of-basic-justification-models-1709.01316</loc><lastmod>2017-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-sharpness-and-the-injective-property-of-basic-justification-models-1709.01316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-sharpness-and-the-injective-property-of-basic-justification-models-1709.01316"/></url>
<url><loc>https://scifaro.com/en/abs/distant-decimals-of-pi-1709.01743</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distant-decimals-of-pi-1709.01743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distant-decimals-of-pi-1709.01743"/></url>
<url><loc>https://scifaro.com/en/abs/on-dependent-types-and-intuitionism-in-programming-mathematics-1709.01810</loc><lastmod>2017-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dependent-types-and-intuitionism-in-programming-mathematics-1709.01810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dependent-types-and-intuitionism-in-programming-mathematics-1709.01810"/></url>
<url><loc>https://scifaro.com/en/abs/foundation-for-a-series-of-efficient-simulation-algorithms-1709.01826</loc><lastmod>2017-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundation-for-a-series-of-efficient-simulation-algorithms-1709.01826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundation-for-a-series-of-efficient-simulation-algorithms-1709.01826"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-for-fragments-of-halpern-and-shoham-s-interval-temporal-logic-based-on-track-representatives-1709.01849</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-for-fragments-of-halpern-and-shoham-s-interval-temporal-logic-based-on-track-representatives-1709.01849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-for-fragments-of-halpern-and-shoham-s-interval-temporal-logic-based-on-track-representatives-1709.01849"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-normative-multi-agent-systems-from-a-kelsenian-perspective-1709.02018</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-normative-multi-agent-systems-from-a-kelsenian-perspective-1709.02018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-normative-multi-agent-systems-from-a-kelsenian-perspective-1709.02018"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-markov-chains-pctl-complexity-and-fraction-free-gaussian-elimination-1709.02093</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-markov-chains-pctl-complexity-and-fraction-free-gaussian-elimination-1709.02093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-markov-chains-pctl-complexity-and-fraction-free-gaussian-elimination-1709.02093"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-model-checking-for-syntactically-maximal-fragments-of-the-interval-temporal-logic-hs-with-regular-expressions-1709.02094</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-model-checking-for-syntactically-maximal-fragments-of-the-interval-temporal-logic-hs-with-regular-expressions-1709.02094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-model-checking-for-syntactically-maximal-fragments-of-the-interval-temporal-logic-hs-with-regular-expressions-1709.02094"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-problem-for-boolean-set-theory-with-a-choice-correspondence-1709.02097</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-boolean-set-theory-with-a-choice-correspondence-1709.02097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-boolean-set-theory-with-a-choice-correspondence-1709.02097"/></url>
<url><loc>https://scifaro.com/en/abs/robust-exponential-worst-cases-for-divide-et-impera-algorithms-for-parity-games-1709.02099</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-exponential-worst-cases-for-divide-et-impera-algorithms-for-parity-games-1709.02099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-exponential-worst-cases-for-divide-et-impera-algorithms-for-parity-games-1709.02099"/></url>
<url><loc>https://scifaro.com/en/abs/a-parallel-linear-temporal-logic-tableau-1709.02101</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parallel-linear-temporal-logic-tableau-1709.02101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parallel-linear-temporal-logic-tableau-1709.02101"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-temporal-logic-with-event-freezing-functions-1709.02103</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-temporal-logic-with-event-freezing-functions-1709.02103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-temporal-logic-with-event-freezing-functions-1709.02103"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-omega-bs-regular-languages-omega-t-regular-expressions-and-counter-check-automata-1709.02104</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-omega-bs-regular-languages-omega-t-regular-expressions-and-counter-check-automata-1709.02104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-omega-bs-regular-languages-omega-t-regular-expressions-and-counter-check-automata-1709.02104"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-social-network-models-1709.02105</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-social-network-models-1709.02105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-social-network-models-1709.02105"/></url>
<url><loc>https://scifaro.com/en/abs/a-backward-traversal-based-approach-for-symbolic-model-checking-of-uniform-strategies-for-constrained-reachability-1709.02106</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-backward-traversal-based-approach-for-symbolic-model-checking-of-uniform-strategies-for-constrained-reachability-1709.02106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-backward-traversal-based-approach-for-symbolic-model-checking-of-uniform-strategies-for-constrained-reachability-1709.02106"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-atl-and-atl-module-checking-1709.02107</loc><lastmod>2017-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-atl-and-atl-module-checking-1709.02107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-atl-and-atl-module-checking-1709.02107"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-extended-abstract-1709.02440</loc><lastmod>2017-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-extended-abstract-1709.02440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-composition-in-the-presence-of-intermediate-termination-extended-abstract-1709.02440"/></url>
<url><loc>https://scifaro.com/en/abs/a-rational-agent-controlling-an-autonomous-vehicle-implementation-and-formal-verification-1709.02557</loc><lastmod>2017-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rational-agent-controlling-an-autonomous-vehicle-implementation-and-formal-verification-1709.02557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rational-agent-controlling-an-autonomous-vehicle-implementation-and-formal-verification-1709.02557"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-of-traffic-manoeuvres-with-imprecise-information-1709.02558</loc><lastmod>2017-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-of-traffic-manoeuvres-with-imprecise-information-1709.02558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-of-traffic-manoeuvres-with-imprecise-information-1709.02558"/></url>
<url><loc>https://scifaro.com/en/abs/imperfect-knowledge-in-autonomous-urban-traffic-manoeuvres-1709.02559</loc><lastmod>2017-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imperfect-knowledge-in-autonomous-urban-traffic-manoeuvres-1709.02559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imperfect-knowledge-in-autonomous-urban-traffic-manoeuvres-1709.02559"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-linear-logic-in-1-only-linear-logic-1709.02935</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-linear-logic-in-1-only-linear-logic-1709.02935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-linear-logic-in-1-only-linear-logic-1709.02935"/></url>
<url><loc>https://scifaro.com/en/abs/defining-recursive-predicates-in-graph-orders-1709.03060</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defining-recursive-predicates-in-graph-orders-1709.03060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defining-recursive-predicates-in-graph-orders-1709.03060"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-logic-with-arbitrary-monadic-predicates-1709.03117</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-arbitrary-monadic-predicates-1709.03117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-arbitrary-monadic-predicates-1709.03117"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-new-convergence-class-in-sup-sober-spaces-1709.03269</loc><lastmod>2017-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-new-convergence-class-in-sup-sober-spaces-1709.03269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-new-convergence-class-in-sup-sober-spaces-1709.03269"/></url>
<url><loc>https://scifaro.com/en/abs/fo-model-checking-of-geometric-graphs-1709.03701</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-model-checking-of-geometric-graphs-1709.03701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-model-checking-of-geometric-graphs-1709.03701"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-first-workshop-on-coalgebra-horn-clause-logic-programming-and-types-1709.04199</loc><lastmod>2017-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-first-workshop-on-coalgebra-horn-clause-logic-programming-and-types-1709.04199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-first-workshop-on-coalgebra-horn-clause-logic-programming-and-types-1709.04199"/></url>
<url><loc>https://scifaro.com/en/abs/levelable-sets-and-the-algebraic-structure-of-parameterizations-1709.04699</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/levelable-sets-and-the-algebraic-structure-of-parameterizations-1709.04699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/levelable-sets-and-the-algebraic-structure-of-parameterizations-1709.04699"/></url>
<url><loc>https://scifaro.com/en/abs/enhancing-predicate-pairing-with-abstraction-for-relational-verification-1709.04809</loc><lastmod>2017-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enhancing-predicate-pairing-with-abstraction-for-relational-verification-1709.04809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enhancing-predicate-pairing-with-abstraction-for-relational-verification-1709.04809"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-context-of-statements-within-description-logics-1709.04970</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-context-of-statements-within-description-logics-1709.04970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-context-of-statements-within-description-logics-1709.04970"/></url>
<url><loc>https://scifaro.com/en/abs/certified-non-confluence-with-concon-1-5-1709.05162</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-non-confluence-with-concon-1-5-1709.05162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-non-confluence-with-concon-1-5-1709.05162"/></url>
<url><loc>https://scifaro.com/en/abs/vst-flow-fine-grained-low-level-reasoning-about-real-world-c-code-1709.05243</loc><lastmod>2017-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vst-flow-fine-grained-low-level-reasoning-about-real-world-c-code-1709.05243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vst-flow-fine-grained-low-level-reasoning-about-real-world-c-code-1709.05243"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-models-and-the-complexity-of-modal-team-logic-1709.05253</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-models-and-the-complexity-of-modal-team-logic-1709.05253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-models-and-the-complexity-of-modal-team-logic-1709.05253"/></url>
<url><loc>https://scifaro.com/en/abs/safe-robust-reachability-analysis-of-hybrid-systems-1709.05658</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-robust-reachability-analysis-of-hybrid-systems-1709.05658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-robust-reachability-analysis-of-hybrid-systems-1709.05658"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-proof-and-knowledge-1709.06672</loc><lastmod>2019-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-proof-and-knowledge-1709.06672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-proof-and-knowledge-1709.06672"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-glimpse-at-bunched-implications-and-separation-logic-1709.07063</loc><lastmod>2018-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-glimpse-at-bunched-implications-and-separation-logic-1709.07063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-glimpse-at-bunched-implications-and-separation-logic-1709.07063"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-gr-1-games-with-singleton-liveness-guarantees-for-efficient-synthesis-1709.07094</loc><lastmod>2017-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-gr-1-games-with-singleton-liveness-guarantees-for-efficient-synthesis-1709.07094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-gr-1-games-with-singleton-liveness-guarantees-for-efficient-synthesis-1709.07094"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-prove-safety-over-parameterised-concurrent-systems-full-version-1709.07139</loc><lastmod>2017-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-prove-safety-over-parameterised-concurrent-systems-full-version-1709.07139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-prove-safety-over-parameterised-concurrent-systems-full-version-1709.07139"/></url>
<url><loc>https://scifaro.com/en/abs/a-symbolic-approach-to-safety-ltl-synthesis-1709.07495</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symbolic-approach-to-safety-ltl-synthesis-1709.07495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symbolic-approach-to-safety-ltl-synthesis-1709.07495"/></url>
<url><loc>https://scifaro.com/en/abs/correctness-of-the-chord-protocol-1709.07938</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctness-of-the-chord-protocol-1709.07938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctness-of-the-chord-protocol-1709.07938"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-algorithm-for-constraint-satisfaction-problems-with-maltsev-templates-1709.08311</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-algorithm-for-constraint-satisfaction-problems-with-maltsev-templates-1709.08311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-algorithm-for-constraint-satisfaction-problems-with-maltsev-templates-1709.08311"/></url>
<url><loc>https://scifaro.com/en/abs/team-semantics-for-the-specification-and-verification-of-hyperproperties-1709.08510</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/team-semantics-for-the-specification-and-verification-of-hyperproperties-1709.08510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/team-semantics-for-the-specification-and-verification-of-hyperproperties-1709.08510"/></url>
<url><loc>https://scifaro.com/en/abs/intensional-constructed-numbers-towards-formalizing-the-notion-of-algorithm-1709.08533</loc><lastmod>2017-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intensional-constructed-numbers-towards-formalizing-the-notion-of-algorithm-1709.08533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intensional-constructed-numbers-towards-formalizing-the-notion-of-algorithm-1709.08533"/></url>
<url><loc>https://scifaro.com/en/abs/caret-analysis-of-multithreaded-programs-1709.09006</loc><lastmod>2017-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/caret-analysis-of-multithreaded-programs-1709.09006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/caret-analysis-of-multithreaded-programs-1709.09006"/></url>
<url><loc>https://scifaro.com/en/abs/programming-from-metaphorisms-1709.09013</loc><lastmod>2017-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programming-from-metaphorisms-1709.09013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programming-from-metaphorisms-1709.09013"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-systemc-code-from-delay-hybrid-csp-1709.09019</loc><lastmod>2017-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-systemc-code-from-delay-hybrid-csp-1709.09019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-systemc-code-from-delay-hybrid-csp-1709.09019"/></url>
<url><loc>https://scifaro.com/en/abs/communicating-finite-state-machines-and-two-variable-logic-1709.09991</loc><lastmod>2017-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communicating-finite-state-machines-and-two-variable-logic-1709.09991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communicating-finite-state-machines-and-two-variable-logic-1709.09991"/></url>
<url><loc>https://scifaro.com/en/abs/proof-checking-euclid-1710.00787</loc><lastmod>2018-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-checking-euclid-1710.00787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-checking-euclid-1710.00787"/></url>
<url><loc>https://scifaro.com/en/abs/qfun-towards-machine-learning-in-qbf-1710.02198</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qfun-towards-machine-learning-in-qbf-1710.02198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qfun-towards-machine-learning-in-qbf-1710.02198"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-semantics-of-concurrent-separation-logic-1710.02332</loc><lastmod>2017-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-semantics-of-concurrent-separation-logic-1710.02332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-semantics-of-concurrent-separation-logic-1710.02332"/></url>
<url><loc>https://scifaro.com/en/abs/fibred-computational-effects-1710.02594</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fibred-computational-effects-1710.02594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fibred-computational-effects-1710.02594"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1710.02770</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1710.02770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-2nd-international-workshop-on-causal-reasoning-for-embedded-and-safety-critical-systems-technologies-1710.02770"/></url>
<url><loc>https://scifaro.com/en/abs/stone-type-dualities-for-separation-logics-1710.03021</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stone-type-dualities-for-separation-logics-1710.03021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stone-type-dualities-for-separation-logics-1710.03021"/></url>
<url><loc>https://scifaro.com/en/abs/theoretical-computer-science-for-the-working-category-theorist-1710.03090</loc><lastmod>2017-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theoretical-computer-science-for-the-working-category-theorist-1710.03090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theoretical-computer-science-for-the-working-category-theorist-1710.03090"/></url>
<url><loc>https://scifaro.com/en/abs/topological-scott-convergence-theorem-1710.03115</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-scott-convergence-theorem-1710.03115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-scott-convergence-theorem-1710.03115"/></url>
<url><loc>https://scifaro.com/en/abs/a-synchronous-program-algebra-a-basis-for-reasoning-about-shared-memory-and-event-based-concurrency-1710.03352</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-synchronous-program-algebra-a-basis-for-reasoning-about-shared-memory-and-event-based-concurrency-1710.03352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-synchronous-program-algebra-a-basis-for-reasoning-about-shared-memory-and-event-based-concurrency-1710.03352"/></url>
<url><loc>https://scifaro.com/en/abs/causality-based-model-checking-1710.03391</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-based-model-checking-1710.03391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-based-model-checking-1710.03391"/></url>
<url><loc>https://scifaro.com/en/abs/counterfactual-causality-from-first-principles-1710.03393</loc><lastmod>2017-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterfactual-causality-from-first-principles-1710.03393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterfactual-causality-from-first-principles-1710.03393"/></url>
<url><loc>https://scifaro.com/en/abs/universal-constructions-for-co-relations-categories-monoidal-categories-and-props-1710.03894</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-constructions-for-co-relations-categories-monoidal-categories-and-props-1710.03894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-constructions-for-co-relations-categories-monoidal-categories-and-props-1710.03894"/></url>
<url><loc>https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-1710.03979</loc><lastmod>2018-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-1710.03979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-1710.03979"/></url>
<url><loc>https://scifaro.com/en/abs/concurrency-and-probability-removing-confusion-compositionally-1710.04570</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrency-and-probability-removing-confusion-compositionally-1710.04570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrency-and-probability-removing-confusion-compositionally-1710.04570"/></url>
<url><loc>https://scifaro.com/en/abs/flat-modal-fixpoint-logics-with-the-converse-modality-1710.04628</loc><lastmod>2017-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-modal-fixpoint-logics-with-the-converse-modality-1710.04628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-modal-fixpoint-logics-with-the-converse-modality-1710.04628"/></url>
<url><loc>https://scifaro.com/en/abs/on-hashing-based-approaches-to-approximate-dnf-counting-1710.05247</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-hashing-based-approaches-to-approximate-dnf-counting-1710.05247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-hashing-based-approaches-to-approximate-dnf-counting-1710.05247"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-in-distributed-environments-1710.05368</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-in-distributed-environments-1710.05368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-in-distributed-environments-1710.05368"/></url>
<url><loc>https://scifaro.com/en/abs/timed-session-types-1710.05388</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-session-types-1710.05388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-session-types-1710.05388"/></url>
<url><loc>https://scifaro.com/en/abs/modulo-counting-on-words-and-trees-1710.05582</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modulo-counting-on-words-and-trees-1710.05582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modulo-counting-on-words-and-trees-1710.05582"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-synthesis-1710.05633</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-synthesis-1710.05633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-synthesis-1710.05633"/></url>
<url><loc>https://scifaro.com/en/abs/dual-logic-concepts-based-on-mathematical-morphology-in-stratified-institutions-applications-to-spatial-reasoning-1710.05661</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dual-logic-concepts-based-on-mathematical-morphology-in-stratified-institutions-applications-to-spatial-reasoning-1710.05661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dual-logic-concepts-based-on-mathematical-morphology-in-stratified-institutions-applications-to-spatial-reasoning-1710.05661"/></url>
<url><loc>https://scifaro.com/en/abs/a-hierarchy-of-scheduler-classes-for-stochastic-automata-1710.05763</loc><lastmod>2017-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hierarchy-of-scheduler-classes-for-stochastic-automata-1710.05763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hierarchy-of-scheduler-classes-for-stochastic-automata-1710.05763"/></url>
<url><loc>https://scifaro.com/en/abs/privacy-by-typing-in-the-pi-calculus-1710.06494</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/privacy-by-typing-in-the-pi-calculus-1710.06494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/privacy-by-typing-in-the-pi-calculus-1710.06494"/></url>
<url><loc>https://scifaro.com/en/abs/an-intensionally-fully-abstract-sheaf-model-for-pi-expanded-version-1710.06744</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intensionally-fully-abstract-sheaf-model-for-pi-expanded-version-1710.06744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intensionally-fully-abstract-sheaf-model-for-pi-expanded-version-1710.06744"/></url>
<url><loc>https://scifaro.com/en/abs/forward-analysis-for-wsts-part-iii-karp-miller-trees-1710.07258</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-iii-karp-miller-trees-1710.07258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-analysis-for-wsts-part-iii-karp-miller-trees-1710.07258"/></url>
<url><loc>https://scifaro.com/en/abs/an-impure-solution-to-the-problem-of-matching-fans-1710.07516</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-impure-solution-to-the-problem-of-matching-fans-1710.07516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-impure-solution-to-the-problem-of-matching-fans-1710.07516"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-equivalence-of-database-driven-applications-1710.07660</loc><lastmod>2017-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-equivalence-of-database-driven-applications-1710.07660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-equivalence-of-database-driven-applications-1710.07660"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-graph-based-reductions-for-reachability-in-markov-decision-processes-1710.07903</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-graph-based-reductions-for-reachability-in-markov-decision-processes-1710.07903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-graph-based-reductions-for-reachability-in-markov-decision-processes-1710.07903"/></url>
<url><loc>https://scifaro.com/en/abs/timed-concurrent-state-machines-1710.07997</loc><lastmod>2017-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-concurrent-state-machines-1710.07997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-concurrent-state-machines-1710.07997"/></url>
<url><loc>https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-toolset-1710.08195</loc><lastmod>2018-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-toolset-1710.08195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-refinement-calculus-of-reactive-systems-toolset-1710.08195"/></url>
<url><loc>https://scifaro.com/en/abs/fitch-style-modal-lambda-calculi-1710.08326</loc><lastmod>2018-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fitch-style-modal-lambda-calculi-1710.08326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fitch-style-modal-lambda-calculi-1710.08326"/></url>
<url><loc>https://scifaro.com/en/abs/algebra-coalgebra-and-minimization-in-polynomial-differential-equations-1710.08350</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebra-coalgebra-and-minimization-in-polynomial-differential-equations-1710.08350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebra-coalgebra-and-minimization-in-polynomial-differential-equations-1710.08350"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-quantifier-instantiation-for-checking-inductive-invariants-1710.08668</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-quantifier-instantiation-for-checking-inductive-invariants-1710.08668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-quantifier-instantiation-for-checking-inductive-invariants-1710.08668"/></url>
<url><loc>https://scifaro.com/en/abs/permutation-games-for-the-weakly-aconjunctive-mu-calculus-1710.08996</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permutation-games-for-the-weakly-aconjunctive-mu-calculus-1710.08996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permutation-games-for-the-weakly-aconjunctive-mu-calculus-1710.08996"/></url>
<url><loc>https://scifaro.com/en/abs/automated-lemma-synthesis-in-symbolic-heap-separation-logic-1710.09635</loc><lastmod>2017-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-lemma-synthesis-in-symbolic-heap-separation-logic-1710.09635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-lemma-synthesis-in-symbolic-heap-separation-logic-1710.09635"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-couplings-for-probabilistic-reasoning-1710.09951</loc><lastmod>2017-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-couplings-for-probabilistic-reasoning-1710.09951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-couplings-for-probabilistic-reasoning-1710.09951"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-and-intensional-semantics-of-bounded-and-unbounded-nondeterminism-1710.10203</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-and-intensional-semantics-of-bounded-and-unbounded-nondeterminism-1710.10203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-and-intensional-semantics-of-bounded-and-unbounded-nondeterminism-1710.10203"/></url>
<url><loc>https://scifaro.com/en/abs/ranking-functions-for-vector-addition-systems-1710.10292</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ranking-functions-for-vector-addition-systems-1710.10292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ranking-functions-for-vector-addition-systems-1710.10292"/></url>
<url><loc>https://scifaro.com/en/abs/permissive-finite-state-controllers-of-pomdps-using-parameter-synthesis-1710.10294</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissive-finite-state-controllers-of-pomdps-using-parameter-synthesis-1710.10294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissive-finite-state-controllers-of-pomdps-using-parameter-synthesis-1710.10294"/></url>
<url><loc>https://scifaro.com/en/abs/the-james-construction-and-pi-4-mathbb-s-3-in-homotopy-type-theory-1710.10307</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-james-construction-and-pi-4-mathbb-s-3-in-homotopy-type-theory-1710.10307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-james-construction-and-pi-4-mathbb-s-3-in-homotopy-type-theory-1710.10307"/></url>
<url><loc>https://scifaro.com/en/abs/termination-in-convex-sets-of-distributions-1710.10402</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-in-convex-sets-of-distributions-1710.10402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-in-convex-sets-of-distributions-1710.10402"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctive-bases-normal-forms-and-model-theory-for-modal-logics-1710.10706</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctive-bases-normal-forms-and-model-theory-for-modal-logics-1710.10706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctive-bases-normal-forms-and-model-theory-for-modal-logics-1710.10706"/></url>
<url><loc>https://scifaro.com/en/abs/fair-termination-for-parameterized-probabilistic-concurrent-systems-technical-report-1710.10756</loc><lastmod>2017-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-termination-for-parameterized-probabilistic-concurrent-systems-technical-report-1710.10756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-termination-for-parameterized-probabilistic-concurrent-systems-technical-report-1710.10756"/></url>
<url><loc>https://scifaro.com/en/abs/modular-labelled-sequent-calculi-for-abstract-separation-logics-1710.10805</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-labelled-sequent-calculi-for-abstract-separation-logics-1710.10805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-labelled-sequent-calculi-for-abstract-separation-logics-1710.10805"/></url>
<url><loc>https://scifaro.com/en/abs/the-equational-theory-of-the-natural-join-and-inner-union-is-decidable-1710.11500</loc><lastmod>2017-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-equational-theory-of-the-natural-join-and-inner-union-is-decidable-1710.11500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-equational-theory-of-the-natural-join-and-inner-union-is-decidable-1710.11500"/></url>
<url><loc>https://scifaro.com/en/abs/proving-soundness-of-extensional-normal-form-bisimilarities-1711.00113</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-soundness-of-extensional-normal-form-bisimilarities-1711.00113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-soundness-of-extensional-normal-form-bisimilarities-1711.00113"/></url>
<url><loc>https://scifaro.com/en/abs/the-hardness-of-synthesizing-elementary-net-systems-from-highly-restricted-inputs-1711.00220</loc><lastmod>2017-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hardness-of-synthesizing-elementary-net-systems-from-highly-restricted-inputs-1711.00220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hardness-of-synthesizing-elementary-net-systems-from-highly-restricted-inputs-1711.00220"/></url>
<url><loc>https://scifaro.com/en/abs/formal-feature-interpretation-of-hybrid-systems-1711.00669</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-feature-interpretation-of-hybrid-systems-1711.00669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-feature-interpretation-of-hybrid-systems-1711.00669"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-programming-made-easy-1711.00774</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-programming-made-easy-1711.00774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-programming-made-easy-1711.00774"/></url>
<url><loc>https://scifaro.com/en/abs/on-polymorphic-sessions-and-functions-a-tale-of-two-fully-abstract-encodings-1711.00878</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-polymorphic-sessions-and-functions-a-tale-of-two-fully-abstract-encodings-1711.00878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-polymorphic-sessions-and-functions-a-tale-of-two-fully-abstract-encodings-1711.00878"/></url>
<url><loc>https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-for-robust-controller-and-shield-synthesis-1711.01823</loc><lastmod>2017-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-for-robust-controller-and-shield-synthesis-1711.01823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-for-robust-controller-and-shield-synthesis-1711.01823"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-checking-for-continuous-time-markov-chains-via-sequential-bayesian-inference-1711.01863</loc><lastmod>2018-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-checking-for-continuous-time-markov-chains-via-sequential-bayesian-inference-1711.01863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-checking-for-continuous-time-markov-chains-via-sequential-bayesian-inference-1711.01863"/></url>
<url><loc>https://scifaro.com/en/abs/self-referential-basis-of-undecidable-dynamics-from-the-liar-paradox-and-the-halting-problem-to-the-edge-of-chaos-1711.02456</loc><lastmod>2019-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-referential-basis-of-undecidable-dynamics-from-the-liar-paradox-and-the-halting-problem-to-the-edge-of-chaos-1711.02456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-referential-basis-of-undecidable-dynamics-from-the-liar-paradox-and-the-halting-problem-to-the-edge-of-chaos-1711.02456"/></url>
<url><loc>https://scifaro.com/en/abs/splitting-proofs-for-interpolation-1711.02503</loc><lastmod>2017-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/splitting-proofs-for-interpolation-1711.02503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/splitting-proofs-for-interpolation-1711.02503"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-temporal-conditionals-and-a-solution-to-the-sea-battle-puzzle-1711.02843</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-temporal-conditionals-and-a-solution-to-the-sea-battle-puzzle-1711.02843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-temporal-conditionals-and-a-solution-to-the-sea-battle-puzzle-1711.02843"/></url>
<url><loc>https://scifaro.com/en/abs/fo-and-mso-approach-to-some-graph-problems-approximation-and-poly-time-results-1711.02889</loc><lastmod>2017-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-and-mso-approach-to-some-graph-problems-approximation-and-poly-time-results-1711.02889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-and-mso-approach-to-some-graph-problems-approximation-and-poly-time-results-1711.02889"/></url>
<url><loc>https://scifaro.com/en/abs/a-canonical-based-npn-boolean-matching-algorithm-utilizing-boolean-difference-and-cofactor-signature-1711.03269</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-canonical-based-npn-boolean-matching-algorithm-utilizing-boolean-difference-and-cofactor-signature-1711.03269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-canonical-based-npn-boolean-matching-algorithm-utilizing-boolean-difference-and-cofactor-signature-1711.03269"/></url>
<url><loc>https://scifaro.com/en/abs/go-with-the-flow-compositional-abstractions-for-concurrent-data-structures-extended-version-1711.03272</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/go-with-the-flow-compositional-abstractions-for-concurrent-data-structures-extended-version-1711.03272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/go-with-the-flow-compositional-abstractions-for-concurrent-data-structures-extended-version-1711.03272"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-decidable-about-string-constraints-with-the-replaceall-function-1711.03363</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-decidable-about-string-constraints-with-the-replaceall-function-1711.03363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-decidable-about-string-constraints-with-the-replaceall-function-1711.03363"/></url>
<url><loc>https://scifaro.com/en/abs/on-first-order-cons-free-term-rewriting-and-ptime-1711.03399</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-first-order-cons-free-term-rewriting-and-ptime-1711.03399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-first-order-cons-free-term-rewriting-and-ptime-1711.03399"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-cons-free-interpreters-1711.03407</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-cons-free-interpreters-1711.03407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-cons-free-interpreters-1711.03407"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-characterisations-1711.03415</loc><lastmod>2017-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-characterisations-1711.03415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-characterisations-1711.03415"/></url>
<url><loc>https://scifaro.com/en/abs/cons-free-programming-with-immutable-functions-1711.03424</loc><lastmod>2017-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cons-free-programming-with-immutable-functions-1711.03424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cons-free-programming-with-immutable-functions-1711.03424"/></url>
<url><loc>https://scifaro.com/en/abs/judgment-aggregation-in-non-classical-logics-1711.03742</loc><lastmod>2017-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/judgment-aggregation-in-non-classical-logics-1711.03742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/judgment-aggregation-in-non-classical-logics-1711.03742"/></url>
<url><loc>https://scifaro.com/en/abs/logics-for-modelling-collective-attitudes-1711.03745</loc><lastmod>2017-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-for-modelling-collective-attitudes-1711.03745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-for-modelling-collective-attitudes-1711.03745"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-markov-population-models-by-stochastic-approximations-1711.03826</loc><lastmod>2017-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-markov-population-models-by-stochastic-approximations-1711.03826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-markov-population-models-by-stochastic-approximations-1711.03826"/></url>
<url><loc>https://scifaro.com/en/abs/real-time-stream-based-monitoring-1711.03829</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-time-stream-based-monitoring-1711.03829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-time-stream-based-monitoring-1711.03829"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-stavi-s-theorem-1711.03876</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-stavi-s-theorem-1711.03876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-stavi-s-theorem-1711.03876"/></url>
<url><loc>https://scifaro.com/en/abs/real-number-computability-from-the-perspective-of-computer-assisted-proofs-in-analysis-1711.04184</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-number-computability-from-the-perspective-of-computer-assisted-proofs-in-analysis-1711.04184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-number-computability-from-the-perspective-of-computer-assisted-proofs-in-analysis-1711.04184"/></url>
<url><loc>https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-a-research-agenda-1711.04240</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-a-research-agenda-1711.04240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-a-research-agenda-1711.04240"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-checking-algorithm-for-higher-rank-impredicative-and-second-order-types-1711.04718</loc><lastmod>2017-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-checking-algorithm-for-higher-rank-impredicative-and-second-order-types-1711.04718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-checking-algorithm-for-higher-rank-impredicative-and-second-order-types-1711.04718"/></url>
<url><loc>https://scifaro.com/en/abs/classical-control-quantum-circuits-and-linear-logic-in-enriched-category-theory-1711.05159</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-control-quantum-circuits-and-linear-logic-in-enriched-category-theory-1711.05159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-control-quantum-circuits-and-linear-logic-in-enriched-category-theory-1711.05159"/></url>
<url><loc>https://scifaro.com/en/abs/statman-s-hierarchy-theorem-1711.05497</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statman-s-hierarchy-theorem-1711.05497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statman-s-hierarchy-theorem-1711.05497"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-verification-of-multi-property-designs-the-benefit-of-wrong-assumptions-extended-version-1711.05698</loc><lastmod>2018-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-verification-of-multi-property-designs-the-benefit-of-wrong-assumptions-extended-version-1711.05698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-verification-of-multi-property-designs-the-benefit-of-wrong-assumptions-extended-version-1711.05698"/></url>
<url><loc>https://scifaro.com/en/abs/game-characterization-of-probabilistic-bisimilarity-and-applications-to-pushdown-automata-1711.06120</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-characterization-of-probabilistic-bisimilarity-and-applications-to-pushdown-automata-1711.06120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-characterization-of-probabilistic-bisimilarity-and-applications-to-pushdown-automata-1711.06120"/></url>
<url><loc>https://scifaro.com/en/abs/eliminating-the-unit-constant-in-the-lambek-calculus-with-brackets-1711.06361</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eliminating-the-unit-constant-in-the-lambek-calculus-with-brackets-1711.06361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eliminating-the-unit-constant-in-the-lambek-calculus-with-brackets-1711.06361"/></url>
<url><loc>https://scifaro.com/en/abs/logic-bug-detection-and-localization-using-symbolic-quick-error-detection-1711.06541</loc><lastmod>2017-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-bug-detection-and-localization-using-symbolic-quick-error-detection-1711.06541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-bug-detection-and-localization-using-symbolic-quick-error-detection-1711.06541"/></url>
<url><loc>https://scifaro.com/en/abs/mechanizing-principia-logico-metaphysica-in-functional-type-theory-1711.06542</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanizing-principia-logico-metaphysica-in-functional-type-theory-1711.06542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanizing-principia-logico-metaphysica-in-functional-type-theory-1711.06542"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-pcp-related-computational-reductions-in-coq-1711.07023</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-pcp-related-computational-reductions-in-coq-1711.07023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-pcp-related-computational-reductions-in-coq-1711.07023"/></url>
<url><loc>https://scifaro.com/en/abs/lattices-and-their-consistent-quantification-1711.07358</loc><lastmod>2018-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattices-and-their-consistent-quantification-1711.07358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattices-and-their-consistent-quantification-1711.07358"/></url>
<url><loc>https://scifaro.com/en/abs/do-hard-sat-related-reasoning-tasks-become-easier-in-the-krom-fragment-1711.07786</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/do-hard-sat-related-reasoning-tasks-become-easier-in-the-krom-fragment-1711.07786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/do-hard-sat-related-reasoning-tasks-become-easier-in-the-krom-fragment-1711.07786"/></url>
<url><loc>https://scifaro.com/en/abs/schur-number-five-1711.08076</loc><lastmod>2017-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/schur-number-five-1711.08076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/schur-number-five-1711.08076"/></url>
<url><loc>https://scifaro.com/en/abs/interval-vs-point-temporal-logic-model-checking-an-expressiveness-comparison-1711.08191</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-vs-point-temporal-logic-model-checking-an-expressiveness-comparison-1711.08191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-vs-point-temporal-logic-model-checking-an-expressiveness-comparison-1711.08191"/></url>
<url><loc>https://scifaro.com/en/abs/functorial-semantics-for-relational-theories-1711.08699</loc><lastmod>2017-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functorial-semantics-for-relational-theories-1711.08699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functorial-semantics-for-relational-theories-1711.08699"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-approximations-for-floating-point-arithmetic-using-uppsat-1711.08859</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-approximations-for-floating-point-arithmetic-using-uppsat-1711.08859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-approximations-for-floating-point-arithmetic-using-uppsat-1711.08859"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-specification-framework-for-smart-grid-components-1711.09184</loc><lastmod>2017-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-specification-framework-for-smart-grid-components-1711.09184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-specification-framework-for-smart-grid-components-1711.09184"/></url>
<url><loc>https://scifaro.com/en/abs/measurable-cones-and-stable-measurable-functions-1711.09640</loc><lastmod>2017-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measurable-cones-and-stable-measurable-functions-1711.09640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measurable-cones-and-stable-measurable-functions-1711.09640"/></url>
<url><loc>https://scifaro.com/en/abs/distances-between-states-and-between-predicates-1711.09740</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distances-between-states-and-between-predicates-1711.09740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distances-between-states-and-between-predicates-1711.09740"/></url>
<url><loc>https://scifaro.com/en/abs/a-behavioural-theory-for-interactions-in-collective-adaptive-systems-1711.09762</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-behavioural-theory-for-interactions-in-collective-adaptive-systems-1711.09762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-behavioural-theory-for-interactions-in-collective-adaptive-systems-1711.09762"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-turing-machines-into-the-deterministic-lambda-calculus-1711.10078</loc><lastmod>2017-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-turing-machines-into-the-deterministic-lambda-calculus-1711.10078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-turing-machines-into-the-deterministic-lambda-calculus-1711.10078"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-workshop-on-synthesis-1711.10224</loc><lastmod>2017-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-synthesis-1711.10224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-synthesis-1711.10224"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-equivalences-for-timed-systems-1711.10233</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-equivalences-for-timed-systems-1711.10233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-equivalences-for-timed-systems-1711.10233"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-vs-bounded-synthesis-for-petri-games-1711.10637</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-vs-bounded-synthesis-for-petri-games-1711.10637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-vs-bounded-synthesis-for-petri-games-1711.10637"/></url>
<url><loc>https://scifaro.com/en/abs/sygus-techniques-in-the-core-of-an-smt-solver-1711.10641</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sygus-techniques-in-the-core-of-an-smt-solver-1711.10641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sygus-techniques-in-the-core-of-an-smt-solver-1711.10641"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-interaction-and-concurrency-experience-1711.10708</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-interaction-and-concurrency-experience-1711.10708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-interaction-and-concurrency-experience-1711.10708"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-in-a-game-a-theory-of-game-models-1711.10860</loc><lastmod>2017-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-in-a-game-a-theory-of-game-models-1711.10860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-in-a-game-a-theory-of-game-models-1711.10860"/></url>
<url><loc>https://scifaro.com/en/abs/keep-it-fair-equivalences-1711.11208</loc><lastmod>2017-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/keep-it-fair-equivalences-1711.11208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/keep-it-fair-equivalences-1711.11208"/></url>
<url><loc>https://scifaro.com/en/abs/session-types-for-orchestrated-interactions-1711.11209</loc><lastmod>2017-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-types-for-orchestrated-interactions-1711.11209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-types-for-orchestrated-interactions-1711.11209"/></url>
<url><loc>https://scifaro.com/en/abs/tool-supported-analysis-of-iot-1711.11210</loc><lastmod>2017-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tool-supported-analysis-of-iot-1711.11210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tool-supported-analysis-of-iot-1711.11210"/></url>
<url><loc>https://scifaro.com/en/abs/the-4th-reactive-synthesis-competition-syntcomp-2017-benchmarks-participants-results-1711.11439</loc><lastmod>2017-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-4th-reactive-synthesis-competition-syntcomp-2017-benchmarks-participants-results-1711.11439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-4th-reactive-synthesis-competition-syntcomp-2017-benchmarks-participants-results-1711.11439"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-stream-logic-synthesis-beyond-the-bools-1712.00246</loc><lastmod>2019-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-stream-logic-synthesis-beyond-the-bools-1712.00246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-stream-logic-synthesis-beyond-the-bools-1712.00246"/></url>
<url><loc>https://scifaro.com/en/abs/hysia-tool-for-simulating-and-monitoring-hybrid-automata-based-on-interval-analysis-1712.00570</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hysia-tool-for-simulating-and-monitoring-hybrid-automata-based-on-interval-analysis-1712.00570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hysia-tool-for-simulating-and-monitoring-hybrid-automata-based-on-interval-analysis-1712.00570"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-satisfiability-in-non-iterated-and-iterated-probabilistic-logics-1712.00810</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-in-non-iterated-and-iterated-probabilistic-logics-1712.00810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-in-non-iterated-and-iterated-probabilistic-logics-1712.00810"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-fifth-workshop-on-proof-exchange-for-theorem-proving-1712.00898</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-fifth-workshop-on-proof-exchange-for-theorem-proving-1712.00898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-fifth-workshop-on-proof-exchange-for-theorem-proving-1712.00898"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-inference-systems-by-coaxioms-1712.01014</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-inference-systems-by-coaxioms-1712.01014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-inference-systems-by-coaxioms-1712.01014"/></url>
<url><loc>https://scifaro.com/en/abs/performance-heuristics-for-gr-1-synthesis-and-related-algorithms-1712.01103</loc><lastmod>2017-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/performance-heuristics-for-gr-1-synthesis-and-related-algorithms-1712.01103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/performance-heuristics-for-gr-1-synthesis-and-related-algorithms-1712.01103"/></url>
<url><loc>https://scifaro.com/en/abs/layer-by-layer-combining-monads-1712.01113</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layer-by-layer-combining-monads-1712.01113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layer-by-layer-combining-monads-1712.01113"/></url>
<url><loc>https://scifaro.com/en/abs/the-jkind-model-checker-1712.01222</loc><lastmod>2018-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-jkind-model-checker-1712.01222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-jkind-model-checker-1712.01222"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-individual-proofs-as-the-basis-of-interoperability-between-proof-systems-1712.01485</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-individual-proofs-as-the-basis-of-interoperability-between-proof-systems-1712.01485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-individual-proofs-as-the-basis-of-interoperability-between-proof-systems-1712.01485"/></url>
<url><loc>https://scifaro.com/en/abs/language-and-proofs-for-higher-order-smt-work-in-progress-1712.01486</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/language-and-proofs-for-higher-order-smt-work-in-progress-1712.01486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/language-and-proofs-for-higher-order-smt-work-in-progress-1712.01486"/></url>
<url><loc>https://scifaro.com/en/abs/counter-simulations-via-higher-order-quantifier-elimination-a-preliminary-report-1712.01487</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counter-simulations-via-higher-order-quantifier-elimination-a-preliminary-report-1712.01487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counter-simulations-via-higher-order-quantifier-elimination-a-preliminary-report-1712.01487"/></url>
<url><loc>https://scifaro.com/en/abs/determinism-in-the-certification-of-unsat-proofs-1712.01488</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determinism-in-the-certification-of-unsat-proofs-1712.01488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determinism-in-the-certification-of-unsat-proofs-1712.01488"/></url>
<url><loc>https://scifaro.com/en/abs/alignment-based-translations-across-formal-systems-using-interface-theories-1712.01489</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alignment-based-translations-across-formal-systems-using-interface-theories-1712.01489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alignment-based-translations-across-formal-systems-using-interface-theories-1712.01489"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-concurrent-separation-logic-1712.01631</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-concurrent-separation-logic-1712.01631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-concurrent-separation-logic-1712.01631"/></url>
<url><loc>https://scifaro.com/en/abs/partial-predicate-abstraction-and-counter-example-guided-refinement-1712.01734</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-predicate-abstraction-and-counter-example-guided-refinement-1712.01734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-predicate-abstraction-and-counter-example-guided-refinement-1712.01734"/></url>
<url><loc>https://scifaro.com/en/abs/computational-higher-type-theory-iii-univalent-universes-and-exact-equality-1712.01800</loc><lastmod>2017-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-higher-type-theory-iii-univalent-universes-and-exact-equality-1712.01800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-higher-type-theory-iii-univalent-universes-and-exact-equality-1712.01800"/></url>
<url><loc>https://scifaro.com/en/abs/semiring-provenance-for-first-order-model-checking-1712.01980</loc><lastmod>2017-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiring-provenance-for-first-order-model-checking-1712.01980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiring-provenance-for-first-order-model-checking-1712.01980"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-fault-trees-analysis-using-an-integration-of-theorem-proving-and-model-checking-1712.02872</loc><lastmod>2017-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-fault-trees-analysis-using-an-integration-of-theorem-proving-and-model-checking-1712.02872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-fault-trees-analysis-using-an-integration-of-theorem-proving-and-model-checking-1712.02872"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-intuitionistic-inductive-definitions-and-intuitionistic-cyclic-proofs-under-arithmetic-1712.03502</loc><lastmod>2017-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-intuitionistic-inductive-definitions-and-intuitionistic-cyclic-proofs-under-arithmetic-1712.03502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-intuitionistic-inductive-definitions-and-intuitionistic-cyclic-proofs-under-arithmetic-1712.03502"/></url>
<url><loc>https://scifaro.com/en/abs/size-cost-and-capacity-a-semantic-technique-for-hard-random-qbfs-1712.03626</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-cost-and-capacity-a-semantic-technique-for-hard-random-qbfs-1712.03626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-cost-and-capacity-a-semantic-technique-for-hard-random-qbfs-1712.03626"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-and-bi-infinite-words-with-decidable-monadic-theories-1712.03759</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-and-bi-infinite-words-with-decidable-monadic-theories-1712.03759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-and-bi-infinite-words-with-decidable-monadic-theories-1712.03759"/></url>
<url><loc>https://scifaro.com/en/abs/inhabitation-for-non-idempotent-intersection-types-1712.03829</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inhabitation-for-non-idempotent-intersection-types-1712.03829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inhabitation-for-non-idempotent-intersection-types-1712.03829"/></url>
<url><loc>https://scifaro.com/en/abs/consistency-of-property-specification-patterns-with-boolean-and-constrained-numerical-signals-1712.04162</loc><lastmod>2017-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistency-of-property-specification-patterns-with-boolean-and-constrained-numerical-signals-1712.04162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistency-of-property-specification-patterns-with-boolean-and-constrained-numerical-signals-1712.04162"/></url>
<url><loc>https://scifaro.com/en/abs/computational-logic-its-origins-and-applications-1712.04375</loc><lastmod>2018-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-logic-its-origins-and-applications-1712.04375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-logic-its-origins-and-applications-1712.04375"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-for-modelling-cubical-type-theory-in-a-topos-1712.04864</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-for-modelling-cubical-type-theory-in-a-topos-1712.04864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-for-modelling-cubical-type-theory-in-a-topos-1712.04864"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-the-univalence-axiom-1712.04890</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-the-univalence-axiom-1712.04890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-the-univalence-axiom-1712.04890"/></url>
<url><loc>https://scifaro.com/en/abs/interpreted-formalisms-for-configurations-1712.04982</loc><lastmod>2017-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpreted-formalisms-for-configurations-1712.04982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpreted-formalisms-for-configurations-1712.04982"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-over-boolean-announcements-1712.05310</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-over-boolean-announcements-1712.05310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-over-boolean-announcements-1712.05310"/></url>
<url><loc>https://scifaro.com/en/abs/taylor-expansion-in-linear-logic-is-invertible-1712.05505</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taylor-expansion-in-linear-logic-is-invertible-1712.05505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taylor-expansion-in-linear-logic-is-invertible-1712.05505"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-fragment-of-second-order-logic-with-applications-to-synthesis-1712.05513</loc><lastmod>2018-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-fragment-of-second-order-logic-with-applications-to-synthesis-1712.05513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-fragment-of-second-order-logic-with-applications-to-synthesis-1712.05513"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-first-order-logic-1712.05665</loc><lastmod>2019-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-first-order-logic-1712.05665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-first-order-logic-1712.05665"/></url>
<url><loc>https://scifaro.com/en/abs/heinrich-behmann-s-contributions-to-second-order-quantifier-elimination-from-the-view-of-computational-logic-1712.06868</loc><lastmod>2017-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heinrich-behmann-s-contributions-to-second-order-quantifier-elimination-from-the-view-of-computational-logic-1712.06868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heinrich-behmann-s-contributions-to-second-order-quantifier-elimination-from-the-view-of-computational-logic-1712.06868"/></url>
<url><loc>https://scifaro.com/en/abs/mixin-composition-synthesis-based-on-intersection-types-1712.06906</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixin-composition-synthesis-based-on-intersection-types-1712.06906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixin-composition-synthesis-based-on-intersection-types-1712.06906"/></url>
<url><loc>https://scifaro.com/en/abs/automata-minimization-a-functorial-approach-1712.07121</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-minimization-a-functorial-approach-1712.07121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-minimization-a-functorial-approach-1712.07121"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-linear-logic-based-on-the-schwartz-varepsilon-product-1712.07344</loc><lastmod>2017-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-linear-logic-based-on-the-schwartz-varepsilon-product-1712.07344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-linear-logic-based-on-the-schwartz-varepsilon-product-1712.07344"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-behavioral-metrics-1712.07511</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-behavioral-metrics-1712.07511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-behavioral-metrics-1712.07511"/></url>
<url><loc>https://scifaro.com/en/abs/wadge-degrees-of-omega-languages-of-petri-nets-1712.07945</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wadge-degrees-of-omega-languages-of-petri-nets-1712.07945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wadge-degrees-of-omega-languages-of-petri-nets-1712.07945"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-workshop-on-graphs-as-models-1712.08345</loc><lastmod>2017-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-graphs-as-models-1712.08345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-graphs-as-models-1712.08345"/></url>
<url><loc>https://scifaro.com/en/abs/companions-causality-and-codensity-1712.08526</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/companions-causality-and-codensity-1712.08526"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/companions-causality-and-codensity-1712.08526"/></url>
<url><loc>https://scifaro.com/en/abs/an-extensible-ad-hoc-interface-between-lean-and-mathematica-1712.09288</loc><lastmod>2017-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extensible-ad-hoc-interface-between-lean-and-mathematica-1712.09288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extensible-ad-hoc-interface-between-lean-and-mathematica-1712.09288"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semantics-of-intensionality-and-intensional-recursion-1712.09302</loc><lastmod>2017-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semantics-of-intensionality-and-intensional-recursion-1712.09302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semantics-of-intensionality-and-intensional-recursion-1712.09302"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-unique-solutions-of-equations-in-process-algebra-1712.09402</loc><lastmod>2017-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-unique-solutions-of-equations-in-process-algebra-1712.09402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-unique-solutions-of-equations-in-process-algebra-1712.09402"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebraic-view-of-computation-1712.09404</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebraic-view-of-computation-1712.09404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebraic-view-of-computation-1712.09404"/></url>
<url><loc>https://scifaro.com/en/abs/horn-ice-learning-for-synthesizing-invariants-and-contracts-1712.09418</loc><lastmod>2018-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-ice-learning-for-synthesizing-invariants-and-contracts-1712.09418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-ice-learning-for-synthesizing-invariants-and-contracts-1712.09418"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-in-free-hypergraph-categories-1712.09495</loc><lastmod>2018-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-in-free-hypergraph-categories-1712.09495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-in-free-hypergraph-categories-1712.09495"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-and-unguarded-iteration-for-generalized-processes-1712.09574</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-and-unguarded-iteration-for-generalized-processes-1712.09574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-and-unguarded-iteration-for-generalized-processes-1712.09574"/></url>
<url><loc>https://scifaro.com/en/abs/classical-system-of-martin-lof-s-inductive-definitions-is-not-equivalent-to-cyclic-proofs-1712.09603</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-system-of-martin-lof-s-inductive-definitions-is-not-equivalent-to-cyclic-proofs-1712.09603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-system-of-martin-lof-s-inductive-definitions-is-not-equivalent-to-cyclic-proofs-1712.09603"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-theories-of-time-with-generalised-reactive-processes-1712.10213</loc><lastmod>2018-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-theories-of-time-with-generalised-reactive-processes-1712.10213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-theories-of-time-with-generalised-reactive-processes-1712.10213"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-theories-of-reactive-design-contracts-1712.10233</loc><lastmod>2020-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-theories-of-reactive-design-contracts-1712.10233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-theories-of-reactive-design-contracts-1712.10233"/></url>
<url><loc>https://scifaro.com/en/abs/a-light-modality-for-recursion-1801.00285</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-light-modality-for-recursion-1801.00285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-light-modality-for-recursion-1801.00285"/></url>
<url><loc>https://scifaro.com/en/abs/towards-platform-independent-verification-of-the-standard-mathematical-functions-the-square-root-function-1801.00969</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-platform-independent-verification-of-the-standard-mathematical-functions-the-square-root-function-1801.00969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-platform-independent-verification-of-the-standard-mathematical-functions-the-square-root-function-1801.00969"/></url>
<url><loc>https://scifaro.com/en/abs/expspace-hardness-of-behavioural-equivalences-of-succinct-one-counter-nets-1801.01073</loc><lastmod>2018-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expspace-hardness-of-behavioural-equivalences-of-succinct-one-counter-nets-1801.01073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expspace-hardness-of-behavioural-equivalences-of-succinct-one-counter-nets-1801.01073"/></url>
<url><loc>https://scifaro.com/en/abs/rooted-divergence-preserving-branching-bisimilarity-is-a-congruence-1801.01180</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rooted-divergence-preserving-branching-bisimilarity-is-a-congruence-1801.01180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rooted-divergence-preserving-branching-bisimilarity-is-a-congruence-1801.01180"/></url>
<url><loc>https://scifaro.com/en/abs/a-diagrammatic-calculus-of-fermionic-quantum-circuits-1801.01231</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-diagrammatic-calculus-of-fermionic-quantum-circuits-1801.01231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-diagrammatic-calculus-of-fermionic-quantum-circuits-1801.01231"/></url>
<url><loc>https://scifaro.com/en/abs/computational-higher-type-theory-iv-inductive-types-1801.01568</loc><lastmod>2018-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-higher-type-theory-iv-inductive-types-1801.01568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-higher-type-theory-iv-inductive-types-1801.01568"/></url>
<url><loc>https://scifaro.com/en/abs/qbm-mapping-user-specified-functions-to-programmable-logic-through-a-qbf-satisfiability-problem-1801.02075</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qbm-mapping-user-specified-functions-to-programmable-logic-through-a-qbf-satisfiability-problem-1801.02075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qbm-mapping-user-specified-functions-to-programmable-logic-through-a-qbf-satisfiability-problem-1801.02075"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-and-interpolating-algebraic-data-types-by-reduction-technical-report-1801.02367</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-and-interpolating-algebraic-data-types-by-reduction-technical-report-1801.02367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-and-interpolating-algebraic-data-types-by-reduction-technical-report-1801.02367"/></url>
<url><loc>https://scifaro.com/en/abs/applicable-mathematics-in-a-minimal-computational-theory-of-sets-1801.02387</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applicable-mathematics-in-a-minimal-computational-theory-of-sets-1801.02387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applicable-mathematics-in-a-minimal-computational-theory-of-sets-1801.02387"/></url>
<url><loc>https://scifaro.com/en/abs/heuristics-for-selecting-predicates-for-partial-predicate-abstraction-1801.02457</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristics-for-selecting-predicates-for-partial-predicate-abstraction-1801.02457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristics-for-selecting-predicates-for-partial-predicate-abstraction-1801.02457"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-data-minimisation-1801.02484</loc><lastmod>2018-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-data-minimisation-1801.02484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-data-minimisation-1801.02484"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-causality-in-event-structures-1801.02857</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-causality-in-event-structures-1801.02857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-causality-in-event-structures-1801.02857"/></url>
<url><loc>https://scifaro.com/en/abs/experiments-in-verification-of-linear-model-predictive-control-automatic-generation-and-formal-verification-of-an-interior-point-method-algorithm-1801.03833</loc><lastmod>2019-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experiments-in-verification-of-linear-model-predictive-control-automatic-generation-and-formal-verification-of-an-interior-point-method-algorithm-1801.03833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experiments-in-verification-of-linear-model-predictive-control-automatic-generation-and-formal-verification-of-an-interior-point-method-algorithm-1801.03833"/></url>
<url><loc>https://scifaro.com/en/abs/oink-an-implementation-and-evaluation-of-modern-parity-game-solvers-1801.03859</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oink-an-implementation-and-evaluation-of-modern-parity-game-solvers-1801.03859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oink-an-implementation-and-evaluation-of-modern-parity-game-solvers-1801.03859"/></url>
<url><loc>https://scifaro.com/en/abs/almost-every-simply-typed-lambda-term-has-a-long-beta-reduction-sequence-1801.03886</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-every-simply-typed-lambda-term-has-a-long-beta-reduction-sequence-1801.03886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-every-simply-typed-lambda-term-has-a-long-beta-reduction-sequence-1801.03886"/></url>
<url><loc>https://scifaro.com/en/abs/relational-characterisations-of-paths-1801.04026</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-characterisations-of-paths-1801.04026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-characterisations-of-paths-1801.04026"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-timed-observational-equivalence-1801.04066</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-timed-observational-equivalence-1801.04066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-timed-observational-equivalence-1801.04066"/></url>
<url><loc>https://scifaro.com/en/abs/a-tableaux-calculus-for-reducing-proof-size-1801.04163</loc><lastmod>2018-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tableaux-calculus-for-reducing-proof-size-1801.04163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tableaux-calculus-for-reducing-proof-size-1801.04163"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-probabilistic-model-checking-of-smart-building-maintenance-using-fault-maintenance-trees-1801.04263</loc><lastmod>2018-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-probabilistic-model-checking-of-smart-building-maintenance-using-fault-maintenance-trees-1801.04263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-probabilistic-model-checking-of-smart-building-maintenance-using-fault-maintenance-trees-1801.04263"/></url>
<url><loc>https://scifaro.com/en/abs/markings-in-perpetual-free-choice-nets-are-fully-characterized-by-their-enabled-transitions-1801.04315</loc><lastmod>2020-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/markings-in-perpetual-free-choice-nets-are-fully-characterized-by-their-enabled-transitions-1801.04315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/markings-in-perpetual-free-choice-nets-are-fully-characterized-by-their-enabled-transitions-1801.04315"/></url>
<url><loc>https://scifaro.com/en/abs/forest-categories-1801.04337</loc><lastmod>2018-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forest-categories-1801.04337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forest-categories-1801.04337"/></url>
<url><loc>https://scifaro.com/en/abs/the-problem-of-correlation-and-substitution-in-sparql-extended-version-1801.04387</loc><lastmod>2018-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-problem-of-correlation-and-substitution-in-sparql-extended-version-1801.04387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-problem-of-correlation-and-substitution-in-sparql-extended-version-1801.04387"/></url>
<url><loc>https://scifaro.com/en/abs/formal-specification-of-the-flexray-protocol-using-focusst-1801.04979</loc><lastmod>2018-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-specification-of-the-flexray-protocol-using-focusst-1801.04979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-specification-of-the-flexray-protocol-using-focusst-1801.04979"/></url>
<url><loc>https://scifaro.com/en/abs/java-lambda-a-featherweight-story-1801.05052</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/java-lambda-a-featherweight-story-1801.05052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/java-lambda-a-featherweight-story-1801.05052"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-operational-aspect-1801.05150</loc><lastmod>2018-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-operational-aspect-1801.05150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-characterization-of-models-of-h-the-operational-aspect-1801.05150"/></url>
<url><loc>https://scifaro.com/en/abs/refining-properties-of-filter-models-sensibility-approximability-and-reducibility-1801.05153</loc><lastmod>2018-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-properties-of-filter-models-sensibility-approximability-and-reducibility-1801.05153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-properties-of-filter-models-sensibility-approximability-and-reducibility-1801.05153"/></url>
<url><loc>https://scifaro.com/en/abs/some-model-theory-for-the-modal-mu-calculus-syntactic-characterisations-of-semantic-properties-1801.05994</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-model-theory-for-the-modal-mu-calculus-syntactic-characterisations-of-semantic-properties-1801.05994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-model-theory-for-the-modal-mu-calculus-syntactic-characterisations-of-semantic-properties-1801.05994"/></url>
<url><loc>https://scifaro.com/en/abs/dialectica-categories-for-the-lambek-calculus-1801.06883</loc><lastmod>2018-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dialectica-categories-for-the-lambek-calculus-1801.06883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dialectica-categories-for-the-lambek-calculus-1801.06883"/></url>
<url><loc>https://scifaro.com/en/abs/an-intuitionistic-linear-logical-semantics-of-sand-attack-trees-1801.06886</loc><lastmod>2018-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intuitionistic-linear-logical-semantics-of-sand-attack-trees-1801.06886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intuitionistic-linear-logical-semantics-of-sand-attack-trees-1801.06886"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-equational-pattern-anti-unification-preprint-1801.07438</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-equational-pattern-anti-unification-preprint-1801.07438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-equational-pattern-anti-unification-preprint-1801.07438"/></url>
<url><loc>https://scifaro.com/en/abs/computer-assisted-proving-of-combinatorial-conjectures-over-finite-domains-a-case-study-of-a-chess-conjecture-1801.07528</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-assisted-proving-of-combinatorial-conjectures-over-finite-domains-a-case-study-of-a-chess-conjecture-1801.07528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-assisted-proving-of-combinatorial-conjectures-over-finite-domains-a-case-study-of-a-chess-conjecture-1801.07528"/></url>
<url><loc>https://scifaro.com/en/abs/internal-universes-in-models-of-homotopy-type-theory-1801.07664</loc><lastmod>2019-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-universes-in-models-of-homotopy-type-theory-1801.07664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-universes-in-models-of-homotopy-type-theory-1801.07664"/></url>
<url><loc>https://scifaro.com/en/abs/multi-optional-many-sorted-past-present-future-structures-and-its-description-1801.08212</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-optional-many-sorted-past-present-future-structures-and-its-description-1801.08212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-optional-many-sorted-past-present-future-structures-and-its-description-1801.08212"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-higher-order-interpretations-and-application-to-basic-feasible-functions-1801.08350</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-higher-order-interpretations-and-application-to-basic-feasible-functions-1801.08350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-higher-order-interpretations-and-application-to-basic-feasible-functions-1801.08350"/></url>
<url><loc>https://scifaro.com/en/abs/finitary-based-domain-theory-in-coq-an-early-report-1801.08441</loc><lastmod>2018-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitary-based-domain-theory-in-coq-an-early-report-1801.08441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitary-based-domain-theory-in-coq-an-early-report-1801.08441"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-approach-for-hardware-semiformal-verification-1801.08446</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-approach-for-hardware-semiformal-verification-1801.08446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-approach-for-hardware-semiformal-verification-1801.08446"/></url>
<url><loc>https://scifaro.com/en/abs/higher-dimensional-automata-modeling-shared-variable-systems-1801.08451</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-dimensional-automata-modeling-shared-variable-systems-1801.08451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-dimensional-automata-modeling-shared-variable-systems-1801.08451"/></url>
<url><loc>https://scifaro.com/en/abs/on-p-q-recognisable-sets-1801.08707</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-p-q-recognisable-sets-1801.08707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-p-q-recognisable-sets-1801.08707"/></url>
<url><loc>https://scifaro.com/en/abs/invariant-checking-of-nra-transition-systems-via-incremental-reduction-to-lra-with-euf-1801.08718</loc><lastmod>2018-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariant-checking-of-nra-transition-systems-via-incremental-reduction-to-lra-with-euf-1801.08718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariant-checking-of-nra-transition-systems-via-incremental-reduction-to-lra-with-euf-1801.08718"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-modulo-transcendental-functions-via-incremental-linearization-1801.08723</loc><lastmod>2018-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-modulo-transcendental-functions-via-incremental-linearization-1801.08723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-modulo-transcendental-functions-via-incremental-linearization-1801.08723"/></url>
<url><loc>https://scifaro.com/en/abs/relational-equivalence-proofs-between-imperative-and-mapreduce-algorithms-1801.08766</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-equivalence-proofs-between-imperative-and-mapreduce-algorithms-1801.08766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-equivalence-proofs-between-imperative-and-mapreduce-algorithms-1801.08766"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-behavioural-reasoning-for-higher-order-effectful-programs-applicative-distances-extended-version-1801.09072</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-behavioural-reasoning-for-higher-order-effectful-programs-applicative-distances-extended-version-1801.09072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-behavioural-reasoning-for-higher-order-effectful-programs-applicative-distances-extended-version-1801.09072"/></url>
<url><loc>https://scifaro.com/en/abs/contextual-modal-type-theory-with-polymorphic-contexts-1801.09225</loc><lastmod>2023-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contextual-modal-type-theory-with-polymorphic-contexts-1801.09225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contextual-modal-type-theory-with-polymorphic-contexts-1801.09225"/></url>
<url><loc>https://scifaro.com/en/abs/equivariant-zfa-and-the-foundations-of-nominal-techniques-1801.09443</loc><lastmod>2020-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivariant-zfa-and-the-foundations-of-nominal-techniques-1801.09443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivariant-zfa-and-the-foundations-of-nominal-techniques-1801.09443"/></url>
<url><loc>https://scifaro.com/en/abs/emme-a-formal-tool-for-ecmascript-memory-model-evaluation-1801.10140</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/emme-a-formal-tool-for-ecmascript-memory-model-evaluation-1801.10140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/emme-a-formal-tool-for-ecmascript-memory-model-evaluation-1801.10140"/></url>
<url><loc>https://scifaro.com/en/abs/dugundji-systems-and-a-retract-characterization-of-effective-zero-dimensionality-1801.10280</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dugundji-systems-and-a-retract-characterization-of-effective-zero-dimensionality-1801.10280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dugundji-systems-and-a-retract-characterization-of-effective-zero-dimensionality-1801.10280"/></url>
<url><loc>https://scifaro.com/en/abs/the-elfe-system-verifying-mathematical-proofs-of-undergraduate-students-1801.10513</loc><lastmod>2018-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-elfe-system-verifying-mathematical-proofs-of-undergraduate-students-1801.10513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-elfe-system-verifying-mathematical-proofs-of-undergraduate-students-1801.10513"/></url>
<url><loc>https://scifaro.com/en/abs/call-by-need-neededness-and-all-that-1801.10519</loc><lastmod>2020-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/call-by-need-neededness-and-all-that-1801.10519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/call-by-need-neededness-and-all-that-1801.10519"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-completeness-of-bernays-sch-onfinkel-ramsey-separation-logic-1802.00195</loc><lastmod>2018-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-completeness-of-bernays-sch-onfinkel-ramsey-separation-logic-1802.00195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-completeness-of-bernays-sch-onfinkel-ramsey-separation-logic-1802.00195"/></url>
<url><loc>https://scifaro.com/en/abs/hol-light-qe-1802.00405</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hol-light-qe-1802.00405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hol-light-qe-1802.00405"/></url>
<url><loc>https://scifaro.com/en/abs/a-van-benthem-theorem-for-fuzzy-modal-logic-1802.00478</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-fuzzy-modal-logic-1802.00478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-fuzzy-modal-logic-1802.00478"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-of-extended-word-equations-the-boundary-between-decidability-and-undecidability-1802.00523</loc><lastmod>2018-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-of-extended-word-equations-the-boundary-between-decidability-and-undecidability-1802.00523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-of-extended-word-equations-the-boundary-between-decidability-and-undecidability-1802.00523"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-enumeration-of-closures-and-environments-with-an-application-to-random-generation-1802.00640</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-enumeration-of-closures-and-environments-with-an-application-to-random-generation-1802.00640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-enumeration-of-closures-and-environments-with-an-application-to-random-generation-1802.00640"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-and-cyclic-proof-systems-for-transitive-closure-logic-1802.00756</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-and-cyclic-proof-systems-for-transitive-closure-logic-1802.00756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-and-cyclic-proof-systems-for-transitive-closure-logic-1802.00756"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-representation-by-decision-trees-in-reactive-synthesis-1802.00758</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-representation-by-decision-trees-in-reactive-synthesis-1802.00758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-representation-by-decision-trees-in-reactive-synthesis-1802.00758"/></url>
<url><loc>https://scifaro.com/en/abs/arrow-update-synthesis-1802.00914</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arrow-update-synthesis-1802.00914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arrow-update-synthesis-1802.00914"/></url>
<url><loc>https://scifaro.com/en/abs/on-higher-inductive-types-in-cubical-type-theory-1802.01170</loc><lastmod>2018-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-higher-inductive-types-in-cubical-type-theory-1802.01170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-higher-inductive-types-in-cubical-type-theory-1802.01170"/></url>
<url><loc>https://scifaro.com/en/abs/a-scheme-driven-approach-to-learning-programs-from-input-output-equations-1802.01177</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scheme-driven-approach-to-learning-programs-from-input-output-equations-1802.01177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scheme-driven-approach-to-learning-programs-from-input-output-equations-1802.01177"/></url>
<url><loc>https://scifaro.com/en/abs/differential-equation-axiomatization-the-impressive-power-of-differential-ghosts-1802.01226</loc><lastmod>2019-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-equation-axiomatization-the-impressive-power-of-differential-ghosts-1802.01226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-equation-axiomatization-the-impressive-power-of-differential-ghosts-1802.01226"/></url>
<url><loc>https://scifaro.com/en/abs/unary-negation-fragment-with-equivalence-relations-has-the-finite-model-property-1802.01318</loc><lastmod>2018-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unary-negation-fragment-with-equivalence-relations-has-the-finite-model-property-1802.01318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unary-negation-fragment-with-equivalence-relations-has-the-finite-model-property-1802.01318"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-asymptotic-time-complexity-of-imperative-programs-in-isabelle-1802.01336</loc><lastmod>2018-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-asymptotic-time-complexity-of-imperative-programs-in-isabelle-1802.01336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-asymptotic-time-complexity-of-imperative-programs-in-isabelle-1802.01336"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-sensor-topologies-for-target-counting-1802.01791</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-sensor-topologies-for-target-counting-1802.01791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-sensor-topologies-for-target-counting-1802.01791"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-invariants-for-affine-programs-1802.01810</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-invariants-for-affine-programs-1802.01810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-invariants-for-affine-programs-1802.01810"/></url>
<url><loc>https://scifaro.com/en/abs/causal-linearizability-compositionality-for-partially-ordered-executions-1802.01866</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-linearizability-compositionality-for-partially-ordered-executions-1802.01866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-linearizability-compositionality-for-partially-ordered-executions-1802.01866"/></url>
<url><loc>https://scifaro.com/en/abs/programming-infinite-machines-1802.01910</loc><lastmod>2018-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programming-infinite-machines-1802.01910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programming-infinite-machines-1802.01910"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-detectability-for-labeled-petri-nets-1802.02087</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-detectability-for-labeled-petri-nets-1802.02087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-detectability-for-labeled-petri-nets-1802.02087"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-cohomology-in-homotopy-type-theory-1802.02191</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-cohomology-in-homotopy-type-theory-1802.02191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-cohomology-in-homotopy-type-theory-1802.02191"/></url>
<url><loc>https://scifaro.com/en/abs/definable-ellipsoid-method-sums-of-squares-proofs-and-the-graph-isomorphism-problem-1802.02388</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definable-ellipsoid-method-sums-of-squares-proofs-and-the-graph-isomorphism-problem-1802.02388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definable-ellipsoid-method-sums-of-squares-proofs-and-the-graph-isomorphism-problem-1802.02388"/></url>
<url><loc>https://scifaro.com/en/abs/b-uchi-kamp-theorems-for-1-clock-ata-1802.02514</loc><lastmod>2018-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/b-uchi-kamp-theorems-for-1-clock-ata-1802.02514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/b-uchi-kamp-theorems-for-1-clock-ata-1802.02514"/></url>
<url><loc>https://scifaro.com/en/abs/stubborn-transaction-reduction-with-proofs-1802.02685</loc><lastmod>2018-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stubborn-transaction-reduction-with-proofs-1802.02685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stubborn-transaction-reduction-with-proofs-1802.02685"/></url>
<url><loc>https://scifaro.com/en/abs/impredicative-encodings-of-higher-inductive-types-1802.02820</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/impredicative-encodings-of-higher-inductive-types-1802.02820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/impredicative-encodings-of-higher-inductive-types-1802.02820"/></url>
<url><loc>https://scifaro.com/en/abs/classical-higher-order-processes-1802.02917</loc><lastmod>2018-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-higher-order-processes-1802.02917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-higher-order-processes-1802.02917"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-composition-and-contracts-a-sheaf-theoretic-approach-1802.03080</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-composition-and-contracts-a-sheaf-theoretic-approach-1802.03080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-composition-and-contracts-a-sheaf-theoretic-approach-1802.03080"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-complexity-via-structure-transformation-1802.03115</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-complexity-via-structure-transformation-1802.03115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-complexity-via-structure-transformation-1802.03115"/></url>
<url><loc>https://scifaro.com/en/abs/mathematical-logic-in-computer-science-1802.03292</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematical-logic-in-computer-science-1802.03292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematical-logic-in-computer-science-1802.03292"/></url>
<url><loc>https://scifaro.com/en/abs/opacity-of-nondeterministic-transition-systems-a-bi-simulation-relation-approach-1802.03321</loc><lastmod>2018-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/opacity-of-nondeterministic-transition-systems-a-bi-simulation-relation-approach-1802.03321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/opacity-of-nondeterministic-transition-systems-a-bi-simulation-relation-approach-1802.03321"/></url>
<url><loc>https://scifaro.com/en/abs/the-monadic-second-order-theory-of-grid-free-1-safe-petri-nets-is-decidable-1802.03336</loc><lastmod>2022-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-monadic-second-order-theory-of-grid-free-1-safe-petri-nets-is-decidable-1802.03336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-monadic-second-order-theory-of-grid-free-1-safe-petri-nets-is-decidable-1802.03336"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-modulo-equivalence-with-invariants-in-constraint-handling-rules-1802.03381</loc><lastmod>2018-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-modulo-equivalence-with-invariants-in-constraint-handling-rules-1802.03381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-modulo-equivalence-with-invariants-in-constraint-handling-rules-1802.03381"/></url>
<url><loc>https://scifaro.com/en/abs/event-structures-for-petri-nets-with-persistence-1802.03726</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/event-structures-for-petri-nets-with-persistence-1802.03726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/event-structures-for-petri-nets-with-persistence-1802.03726"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-for-guarded-dependent-type-theory-1802.03744</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-for-guarded-dependent-type-theory-1802.03744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-for-guarded-dependent-type-theory-1802.03744"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-framework-for-runtime-verification-1802.03775</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-framework-for-runtime-verification-1802.03775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-framework-for-runtime-verification-1802.03775"/></url>
<url><loc>https://scifaro.com/en/abs/new-models-for-generating-hard-random-boolean-formulas-and-disjunctive-logic-programs-1802.03828</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-models-for-generating-hard-random-boolean-formulas-and-disjunctive-logic-programs-1802.03828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-models-for-generating-hard-random-boolean-formulas-and-disjunctive-logic-programs-1802.03828"/></url>
<url><loc>https://scifaro.com/en/abs/symmetries-of-quantified-boolean-formulas-1802.03993</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetries-of-quantified-boolean-formulas-1802.03993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetries-of-quantified-boolean-formulas-1802.03993"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-nonzero-automata-1802.04067</loc><lastmod>2018-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-nonzero-automata-1802.04067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-nonzero-automata-1802.04067"/></url>
<url><loc>https://scifaro.com/en/abs/higher-groups-in-homotopy-type-theory-1802.04315</loc><lastmod>2018-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-groups-in-homotopy-type-theory-1802.04315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-groups-in-homotopy-type-theory-1802.04315"/></url>
<url><loc>https://scifaro.com/en/abs/the-principle-of-pointfree-continuity-1802.04512</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-principle-of-pointfree-continuity-1802.04512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-principle-of-pointfree-continuity-1802.04512"/></url>
<url><loc>https://scifaro.com/en/abs/a-concurrent-constraint-programming-interpretation-of-access-permissions-1802.04695</loc><lastmod>2018-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concurrent-constraint-programming-interpretation-of-access-permissions-1802.04695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concurrent-constraint-programming-interpretation-of-access-permissions-1802.04695"/></url>
<url><loc>https://scifaro.com/en/abs/proof-systems-from-nestings-to-sequents-and-back-1802.04704</loc><lastmod>2018-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-systems-from-nestings-to-sequents-and-back-1802.04704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-systems-from-nestings-to-sequents-and-back-1802.04704"/></url>
<url><loc>https://scifaro.com/en/abs/query-learning-of-derived-omega-tree-languages-in-polynomial-time-1802.04739</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-learning-of-derived-omega-tree-languages-in-polynomial-time-1802.04739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-learning-of-derived-omega-tree-languages-in-polynomial-time-1802.04739"/></url>
<url><loc>https://scifaro.com/en/abs/a-sound-and-complete-definition-of-linearizability-on-weak-memory-models-1802.04954</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sound-and-complete-definition-of-linearizability-on-weak-memory-models-1802.04954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sound-and-complete-definition-of-linearizability-on-weak-memory-models-1802.04954"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-family-based-model-checking-using-modal-featured-transition-systems-preservation-of-ctl-extended-version-1802.04970</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-family-based-model-checking-using-modal-featured-transition-systems-preservation-of-ctl-extended-version-1802.04970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-family-based-model-checking-using-modal-featured-transition-systems-preservation-of-ctl-extended-version-1802.04970"/></url>
<url><loc>https://scifaro.com/en/abs/craig-interpolation-and-access-interpolation-with-clausal-first-order-tableaux-1802.04982</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/craig-interpolation-and-access-interpolation-with-clausal-first-order-tableaux-1802.04982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/craig-interpolation-and-access-interpolation-with-clausal-first-order-tableaux-1802.04982"/></url>
<url><loc>https://scifaro.com/en/abs/on-completeness-and-parametricity-in-the-realizability-semantics-of-system-f-1802.05143</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-completeness-and-parametricity-in-the-realizability-semantics-of-system-f-1802.05143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-completeness-and-parametricity-in-the-realizability-semantics-of-system-f-1802.05143"/></url>
<url><loc>https://scifaro.com/en/abs/sat-solving-techniques-a-bibliography-1802.05159</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-solving-techniques-a-bibliography-1802.05159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-solving-techniques-a-bibliography-1802.05159"/></url>
<url><loc>https://scifaro.com/en/abs/circular-yet-sound-proofs-1802.05266</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-yet-sound-proofs-1802.05266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-yet-sound-proofs-1802.05266"/></url>
<url><loc>https://scifaro.com/en/abs/non-idempotent-types-for-classical-calculi-in-natural-deduction-style-1802.05494</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-idempotent-types-for-classical-calculi-in-natural-deduction-style-1802.05494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-idempotent-types-for-classical-calculi-in-natural-deduction-style-1802.05494"/></url>
<url><loc>https://scifaro.com/en/abs/fine-grained-complexity-of-safety-verification-1802.05559</loc><lastmod>2020-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fine-grained-complexity-of-safety-verification-1802.05559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fine-grained-complexity-of-safety-verification-1802.05559"/></url>
<url><loc>https://scifaro.com/en/abs/model-generation-for-quantified-formulas-a-taint-based-approach-1802.05616</loc><lastmod>2018-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-generation-for-quantified-formulas-a-taint-based-approach-1802.05616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-generation-for-quantified-formulas-a-taint-based-approach-1802.05616"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-type-theory-based-on-moore-paths-1802.05629</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-type-theory-based-on-moore-paths-1802.05629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-type-theory-based-on-moore-paths-1802.05629"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-rewriting-techniques-for-program-transformations-and-evaluation-1802.05862</loc><lastmod>2018-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-rewriting-techniques-for-program-transformations-and-evaluation-1802.05862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-rewriting-techniques-for-program-transformations-and-evaluation-1802.05862"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-for-entailments-of-symbolic-heaps-with-arrays-1802.05935</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-for-entailments-of-symbolic-heaps-with-arrays-1802.05935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-for-entailments-of-symbolic-heaps-with-arrays-1802.05935"/></url>
<url><loc>https://scifaro.com/en/abs/design-and-implementation-of-the-andromeda-proof-assistant-1802.06217</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/design-and-implementation-of-the-andromeda-proof-assistant-1802.06217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/design-and-implementation-of-the-andromeda-proof-assistant-1802.06217"/></url>
<url><loc>https://scifaro.com/en/abs/heuristic-based-induction-of-answer-set-programs-from-default-theories-to-combinatorial-problems-1802.06462</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/heuristic-based-induction-of-answer-set-programs-from-default-theories-to-combinatorial-problems-1802.06462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/heuristic-based-induction-of-answer-set-programs-from-default-theories-to-combinatorial-problems-1802.06462"/></url>
<url><loc>https://scifaro.com/en/abs/attributed-hierarchical-port-graphs-and-applications-1802.06492</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attributed-hierarchical-port-graphs-and-applications-1802.06492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attributed-hierarchical-port-graphs-and-applications-1802.06492"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-proof-tableaux-of-hoare-logic-into-inference-sequences-of-rewriting-induction-1802.06494</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-proof-tableaux-of-hoare-logic-into-inference-sequences-of-rewriting-induction-1802.06494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-proof-tableaux-of-hoare-logic-into-inference-sequences-of-rewriting-induction-1802.06494"/></url>
<url><loc>https://scifaro.com/en/abs/reduced-dependency-spaces-for-existential-parameterised-boolean-equation-systems-1802.06496</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduced-dependency-spaces-for-existential-parameterised-boolean-equation-systems-1802.06496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduced-dependency-spaces-for-existential-parameterised-boolean-equation-systems-1802.06496"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-dependency-chains-of-constrained-trss-into-bounded-monotone-sequences-of-integers-1802.06497</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-dependency-chains-of-constrained-trss-into-bounded-monotone-sequences-of-integers-1802.06497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-dependency-chains-of-constrained-trss-into-bounded-monotone-sequences-of-integers-1802.06497"/></url>
<url><loc>https://scifaro.com/en/abs/size-based-termination-of-higher-order-rewriting-1802.06603</loc><lastmod>2018-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-based-termination-of-higher-order-rewriting-1802.06603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-based-termination-of-higher-order-rewriting-1802.06603"/></url>
<url><loc>https://scifaro.com/en/abs/linear-equations-with-ordered-data-1802.06660</loc><lastmod>2018-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-equations-with-ordered-data-1802.06660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-equations-with-ordered-data-1802.06660"/></url>
<url><loc>https://scifaro.com/en/abs/higher-dimensional-timed-automata-1802.07038</loc><lastmod>2018-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-dimensional-timed-automata-1802.07038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-dimensional-timed-automata-1802.07038"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-the-loop-recursive-proofs-for-coinductive-predicates-in-fibrations-1802.07143</loc><lastmod>2018-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-the-loop-recursive-proofs-for-coinductive-predicates-in-fibrations-1802.07143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-the-loop-recursive-proofs-for-coinductive-predicates-in-fibrations-1802.07143"/></url>
<url><loc>https://scifaro.com/en/abs/degrees-of-extensionality-in-the-theory-of-b-ohm-trees-and-sall-e-s-conjecture-1802.07320</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degrees-of-extensionality-in-the-theory-of-b-ohm-trees-and-sall-e-s-conjecture-1802.07320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degrees-of-extensionality-in-the-theory-of-b-ohm-trees-and-sall-e-s-conjecture-1802.07320"/></url>
<url><loc>https://scifaro.com/en/abs/free-complete-wasserstein-algebras-1802.07366</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-complete-wasserstein-algebras-1802.07366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-complete-wasserstein-algebras-1802.07366"/></url>
<url><loc>https://scifaro.com/en/abs/playing-with-repetitions-in-data-words-using-energy-games-1802.07435</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/playing-with-repetitions-in-data-words-using-energy-games-1802.07435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/playing-with-repetitions-in-data-words-using-energy-games-1802.07435"/></url>
<url><loc>https://scifaro.com/en/abs/a-dual-tableau-based-decision-procedure-for-a-relational-logic-with-the-universal-relation-extended-version-1802.07508</loc><lastmod>2018-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dual-tableau-based-decision-procedure-for-a-relational-logic-with-the-universal-relation-extended-version-1802.07508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dual-tableau-based-decision-procedure-for-a-relational-logic-with-the-universal-relation-extended-version-1802.07508"/></url>
<url><loc>https://scifaro.com/en/abs/wqo-dichotomy-for-3-graphs-1802.07612</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wqo-dichotomy-for-3-graphs-1802.07612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wqo-dichotomy-for-3-graphs-1802.07612"/></url>
<url><loc>https://scifaro.com/en/abs/proper-semirings-and-proper-convex-functors-1802.07830</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proper-semirings-and-proper-convex-functors-1802.07830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proper-semirings-and-proper-convex-functors-1802.07830"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-concurrency-threshold-of-sound-free-choice-workflow-nets-1802.08064</loc><lastmod>2018-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-concurrency-threshold-of-sound-free-choice-workflow-nets-1802.08064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-concurrency-threshold-of-sound-free-choice-workflow-nets-1802.08064"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-foundation-for-finitary-corecursion-and-iterative-algebras-1802.08070</loc><lastmod>2019-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-foundation-for-finitary-corecursion-and-iterative-algebras-1802.08070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-foundation-for-finitary-corecursion-and-iterative-algebras-1802.08070"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-completion-formalized-1802.08437</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-completion-formalized-1802.08437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-completion-formalized-1802.08437"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-synchronization-in-constrained-reconfigurable-broadcast-networks-1802.08469</loc><lastmod>2018-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-synchronization-in-constrained-reconfigurable-broadcast-networks-1802.08469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-synchronization-in-constrained-reconfigurable-broadcast-networks-1802.08469"/></url>
<url><loc>https://scifaro.com/en/abs/definable-isomorphism-problem-1802.08500</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definable-isomorphism-problem-1802.08500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definable-isomorphism-problem-1802.08500"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-definability-of-truth-constants-in-l-ukasiewicz-logic-1802.08588</loc><lastmod>2018-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-definability-of-truth-constants-in-l-ukasiewicz-logic-1802.08588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-definability-of-truth-constants-in-l-ukasiewicz-logic-1802.08588"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-traced-categories-1802.08756</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-traced-categories-1802.08756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-traced-categories-1802.08756"/></url>
<url><loc>https://scifaro.com/en/abs/trace-semantics-via-determinization-for-probabilistic-transition-systems-1802.09084</loc><lastmod>2018-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-semantics-via-determinization-for-probabilistic-transition-systems-1802.09084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-semantics-via-determinization-for-probabilistic-transition-systems-1802.09084"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-validity-of-encodings-of-the-synchronous-in-the-asynchronous-pi-calculus-1802.09182</loc><lastmod>2018-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-validity-of-encodings-of-the-synchronous-in-the-asynchronous-pi-calculus-1802.09182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-validity-of-encodings-of-the-synchronous-in-the-asynchronous-pi-calculus-1802.09182"/></url>
<url><loc>https://scifaro.com/en/abs/the-finite-model-property-of-quasi-transitive-modal-logic-1802.09240</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-finite-model-property-of-quasi-transitive-modal-logic-1802.09240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-finite-model-property-of-quasi-transitive-modal-logic-1802.09240"/></url>
<url><loc>https://scifaro.com/en/abs/a-finite-model-theoretic-view-on-propositional-proof-complexity-1802.09377</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-model-theoretic-view-on-propositional-proof-complexity-1802.09377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-model-theoretic-view-on-propositional-proof-complexity-1802.09377"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-14th-international-conference-on-quantum-physics-and-logic-1802.09737</loc><lastmod>2018-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-14th-international-conference-on-quantum-physics-and-logic-1802.09737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-14th-international-conference-on-quantum-physics-and-logic-1802.09737"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-logarithmic-space-and-polynomial-time-on-chordal-claw-free-graphs-1802.10331</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-logarithmic-space-and-polynomial-time-on-chordal-claw-free-graphs-1802.10331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-logarithmic-space-and-polynomial-time-on-chordal-claw-free-graphs-1802.10331"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-separation-logic-a-logic-for-reasoning-about-probabilistic-programs-1802.10467</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-separation-logic-a-logic-for-reasoning-about-probabilistic-programs-1802.10467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-separation-logic-a-logic-for-reasoning-about-probabilistic-programs-1802.10467"/></url>
<url><loc>https://scifaro.com/en/abs/the-dynamic-geometry-of-interaction-machine-a-token-guided-graph-rewriter-1803.00427</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-dynamic-geometry-of-interaction-machine-a-token-guided-graph-rewriter-1803.00427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-dynamic-geometry-of-interaction-machine-a-token-guided-graph-rewriter-1803.00427"/></url>
<url><loc>https://scifaro.com/en/abs/sequentialization-for-full-n-graphs-via-sub-n-graphs-1803.00555</loc><lastmod>2018-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequentialization-for-full-n-graphs-via-sub-n-graphs-1803.00555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequentialization-for-full-n-graphs-via-sub-n-graphs-1803.00555"/></url>
<url><loc>https://scifaro.com/en/abs/qwire-practice-formal-verification-of-quantum-circuits-in-coq-1803.00699</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qwire-practice-formal-verification-of-quantum-circuits-in-coq-1803.00699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qwire-practice-formal-verification-of-quantum-circuits-in-coq-1803.00699"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-abstract-h-algebras-1803.00705</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-abstract-h-algebras-1803.00705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-abstract-h-algebras-1803.00705"/></url>
<url><loc>https://scifaro.com/en/abs/spectral-presheaves-kochen-specker-contextuality-and-quantale-valued-relations-1803.00709</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spectral-presheaves-kochen-specker-contextuality-and-quantale-valued-relations-1803.00709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spectral-presheaves-kochen-specker-contextuality-and-quantale-valued-relations-1803.00709"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-interpretation-and-normalization-of-typed-call-by-need-lambda-calculus-with-control-1803.00914</loc><lastmod>2018-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-interpretation-and-normalization-of-typed-call-by-need-lambda-calculus-with-control-1803.00914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-interpretation-and-normalization-of-typed-call-by-need-lambda-calculus-with-control-1803.00914"/></url>
<url><loc>https://scifaro.com/en/abs/classical-transitions-1803.01049</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-transitions-1803.01049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-transitions-1803.01049"/></url>
<url><loc>https://scifaro.com/en/abs/process-ordering-in-a-process-calculus-for-spatially-explicit-ecological-models-1803.01366</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-ordering-in-a-process-calculus-for-spatially-explicit-ecological-models-1803.01366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-ordering-in-a-process-calculus-for-spatially-explicit-ecological-models-1803.01366"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-un-decidability-of-fragments-of-langle-omega-omega-lambda-times-rangle-1803.01418</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-un-decidability-of-fragments-of-langle-omega-omega-lambda-times-rangle-1803.01418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-un-decidability-of-fragments-of-langle-omega-omega-lambda-times-rangle-1803.01418"/></url>
<url><loc>https://scifaro.com/en/abs/tree-dimension-in-verification-of-constrained-horn-clauses-1803.01448</loc><lastmod>2018-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-dimension-in-verification-of-constrained-horn-clauses-1803.01448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-dimension-in-verification-of-constrained-horn-clauses-1803.01448"/></url>
<url><loc>https://scifaro.com/en/abs/learning-how-to-prove-from-the-coq-proof-assistant-to-textbook-style-1803.01466</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-how-to-prove-from-the-coq-proof-assistant-to-textbook-style-1803.01466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-how-to-prove-from-the-coq-proof-assistant-to-textbook-style-1803.01466"/></url>
<url><loc>https://scifaro.com/en/abs/the-sequent-calculus-trainer-with-automated-reasoning-helping-students-to-find-proofs-1803.01467</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sequent-calculus-trainer-with-automated-reasoning-helping-students-to-find-proofs-1803.01467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sequent-calculus-trainer-with-automated-reasoning-helping-students-to-find-proofs-1803.01467"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-the-formalization-of-mathematical-theories-and-algorithms-via-the-automatic-checking-of-finite-models-1803.01472</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-the-formalization-of-mathematical-theories-and-algorithms-via-the-automatic-checking-of-finite-models-1803.01472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-the-formalization-of-mathematical-theories-and-algorithms-via-the-automatic-checking-of-finite-models-1803.01472"/></url>
<url><loc>https://scifaro.com/en/abs/natural-deduction-and-the-isabelle-proof-assistant-1803.01473</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-deduction-and-the-isabelle-proof-assistant-1803.01473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-deduction-and-the-isabelle-proof-assistant-1803.01473"/></url>
<url><loc>https://scifaro.com/en/abs/positive-announcements-1803.01696</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-announcements-1803.01696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-announcements-1803.01696"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-use-of-computational-paths-in-path-spaces-of-homotopy-type-theory-1803.01709</loc><lastmod>2018-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-use-of-computational-paths-in-path-spaces-of-homotopy-type-theory-1803.01709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-use-of-computational-paths-in-path-spaces-of-homotopy-type-theory-1803.01709"/></url>
<url><loc>https://scifaro.com/en/abs/costs-and-rewards-in-priced-timed-automata-1803.01914</loc><lastmod>2018-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/costs-and-rewards-in-priced-timed-automata-1803.01914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/costs-and-rewards-in-priced-timed-automata-1803.01914"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-decentralized-ltl-monitoring-framework-using-tableau-technique-1803.02051</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-decentralized-ltl-monitoring-framework-using-tableau-technique-1803.02051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-decentralized-ltl-monitoring-framework-using-tableau-technique-1803.02051"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-team-semantics-1803.02180</loc><lastmod>2018-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-team-semantics-1803.02180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-team-semantics-1803.02180"/></url>
<url><loc>https://scifaro.com/en/abs/correct-by-construction-resource-based-process-composition-1803.02613</loc><lastmod>2018-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-by-construction-resource-based-process-composition-1803.02613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-by-construction-resource-based-process-composition-1803.02613"/></url>
<url><loc>https://scifaro.com/en/abs/borel-kernels-and-their-approximation-categorically-1803.02651</loc><lastmod>2018-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borel-kernels-and-their-approximation-categorically-1803.02651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borel-kernels-and-their-approximation-categorically-1803.02651"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-and-monitoring-of-metric-temporal-logic-1803.02653</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-and-monitoring-of-metric-temporal-logic-1803.02653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-and-monitoring-of-metric-temporal-logic-1803.02653"/></url>
<url><loc>https://scifaro.com/en/abs/communicating-concurrent-processes-1803.02659</loc><lastmod>2018-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communicating-concurrent-processes-1803.02659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communicating-concurrent-processes-1803.02659"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-verification-of-logically-decorated-graph-transformations-1803.02776</loc><lastmod>2018-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-verification-of-logically-decorated-graph-transformations-1803.02776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-verification-of-logically-decorated-graph-transformations-1803.02776"/></url>
<url><loc>https://scifaro.com/en/abs/alleviating-state-space-explosion-in-component-based-systems-with-distributed-parallel-reachability-analysis-algorithm-1803.03127</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alleviating-state-space-explosion-in-component-based-systems-with-distributed-parallel-reachability-analysis-algorithm-1803.03127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alleviating-state-space-explosion-in-component-based-systems-with-distributed-parallel-reachability-analysis-algorithm-1803.03127"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-pointer-arithmetic-in-separation-logic-an-extended-version-1803.03164</loc><lastmod>2018-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-pointer-arithmetic-in-separation-logic-an-extended-version-1803.03164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-pointer-arithmetic-in-separation-logic-an-extended-version-1803.03164"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-modular-specification-and-validation-of-cyber-physical-systems-1803.03173</loc><lastmod>2018-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-modular-specification-and-validation-of-cyber-physical-systems-1803.03173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-modular-specification-and-validation-of-cyber-physical-systems-1803.03173"/></url>
<url><loc>https://scifaro.com/en/abs/clocked-definitions-in-hol-1803.03417</loc><lastmod>2018-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clocked-definitions-in-hol-1803.03417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clocked-definitions-in-hol-1803.03417"/></url>
<url><loc>https://scifaro.com/en/abs/semi-bci-algebras-1803.04808</loc><lastmod>2018-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-bci-algebras-1803.04808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-bci-algebras-1803.04808"/></url>
<url><loc>https://scifaro.com/en/abs/an-assertion-based-program-logic-for-probabilistic-programs-1803.05535</loc><lastmod>2018-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-assertion-based-program-logic-for-probabilistic-programs-1803.05535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-assertion-based-program-logic-for-probabilistic-programs-1803.05535"/></url>
<url><loc>https://scifaro.com/en/abs/definable-decompositions-for-graphs-of-bounded-linear-cliquewidth-1803.05937</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definable-decompositions-for-graphs-of-bounded-linear-cliquewidth-1803.05937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definable-decompositions-for-graphs-of-bounded-linear-cliquewidth-1803.05937"/></url>
<url><loc>https://scifaro.com/en/abs/linear-logic-in-normed-cones-probabilistic-coherence-spaces-and-beyond-1803.06005</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-logic-in-normed-cones-probabilistic-coherence-spaces-and-beyond-1803.06005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-logic-in-normed-cones-probabilistic-coherence-spaces-and-beyond-1803.06005"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-extended-version-1803.06488</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-extended-version-1803.06488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-extended-version-1803.06488"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-assemblies-a-univalent-and-impredicative-universe-and-a-failure-of-propositional-resizing-1803.06649</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-assemblies-a-univalent-and-impredicative-universe-and-a-failure-of-propositional-resizing-1803.06649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-assemblies-a-univalent-and-impredicative-universe-and-a-failure-of-propositional-resizing-1803.06649"/></url>
<url><loc>https://scifaro.com/en/abs/scalar-and-vectorial-mu-calculus-with-atoms-1803.06752</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalar-and-vectorial-mu-calculus-with-atoms-1803.06752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalar-and-vectorial-mu-calculus-with-atoms-1803.06752"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-buechi-and-parity-conditions-via-alternating-fixed-points-of-functors-1803.06811</loc><lastmod>2018-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-buechi-and-parity-conditions-via-alternating-fixed-points-of-functors-1803.06811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-buechi-and-parity-conditions-via-alternating-fixed-points-of-functors-1803.06811"/></url>
<url><loc>https://scifaro.com/en/abs/containment-of-shape-expression-schemas-for-rdf-1803.07303</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/containment-of-shape-expression-schemas-for-rdf-1803.07303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/containment-of-shape-expression-schemas-for-rdf-1803.07303"/></url>
<url><loc>https://scifaro.com/en/abs/on-how-kelsenian-jurisprudence-and-intuitionistic-logic-help-to-avoid-contrary-to-duty-paradoxes-in-legal-ontologies-1803.07543</loc><lastmod>2018-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-how-kelsenian-jurisprudence-and-intuitionistic-logic-help-to-avoid-contrary-to-duty-paradoxes-in-legal-ontologies-1803.07543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-how-kelsenian-jurisprudence-and-intuitionistic-logic-help-to-avoid-contrary-to-duty-paradoxes-in-legal-ontologies-1803.07543"/></url>
<url><loc>https://scifaro.com/en/abs/the-subpower-membership-problem-for-finite-algebras-with-cube-terms-1803.08019</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-subpower-membership-problem-for-finite-algebras-with-cube-terms-1803.08019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-subpower-membership-problem-for-finite-algebras-with-cube-terms-1803.08019"/></url>
<url><loc>https://scifaro.com/en/abs/the-epistemology-of-nondeterminism-1803.08193</loc><lastmod>2018-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-epistemology-of-nondeterminism-1803.08193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-epistemology-of-nondeterminism-1803.08193"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-workshop-on-models-for-formal-analysis-of-real-systems-and-sixth-international-workshop-on-verification-and-program-transformation-1803.08668</loc><lastmod>2018-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-models-for-formal-analysis-of-real-systems-and-sixth-international-workshop-on-verification-and-program-transformation-1803.08668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-models-for-formal-analysis-of-real-systems-and-sixth-international-workshop-on-verification-and-program-transformation-1803.08668"/></url>
<url><loc>https://scifaro.com/en/abs/equivariant-zfa-with-choice-a-position-paper-1803.08727</loc><lastmod>2018-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivariant-zfa-with-choice-a-position-paper-1803.08727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivariant-zfa-with-choice-a-position-paper-1803.08727"/></url>
<url><loc>https://scifaro.com/en/abs/a-curry-howard-approach-to-church-s-synthesis-1803.08958</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-curry-howard-approach-to-church-s-synthesis-1803.08958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-curry-howard-approach-to-church-s-synthesis-1803.08958"/></url>
<url><loc>https://scifaro.com/en/abs/proof-nets-and-the-instantiation-overflow-property-1803.09297</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-nets-and-the-instantiation-overflow-property-1803.09297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-nets-and-the-instantiation-overflow-property-1803.09297"/></url>
<url><loc>https://scifaro.com/en/abs/left-eigenvectors-are-certificates-of-the-orbit-problem-1803.09511</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/left-eigenvectors-are-certificates-of-the-orbit-problem-1803.09511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/left-eigenvectors-are-certificates-of-the-orbit-problem-1803.09511"/></url>
<url><loc>https://scifaro.com/en/abs/on-expansion-and-resolution-in-cegar-based-qbf-solving-1803.09559</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-expansion-and-resolution-in-cegar-based-qbf-solving-1803.09559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-expansion-and-resolution-in-cegar-based-qbf-solving-1803.09559"/></url>
<url><loc>https://scifaro.com/en/abs/bosy-an-experimentation-framework-for-bounded-synthesis-1803.09566</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bosy-an-experimentation-framework-for-bounded-synthesis-1803.09566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bosy-an-experimentation-framework-for-bounded-synthesis-1803.09566"/></url>
<url><loc>https://scifaro.com/en/abs/encodings-of-bounded-synthesis-1803.09570</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encodings-of-bounded-synthesis-1803.09570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encodings-of-bounded-synthesis-1803.09570"/></url>
<url><loc>https://scifaro.com/en/abs/the-delta-calculus-syntax-and-types-1803.09660</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-delta-calculus-syntax-and-types-1803.09660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-delta-calculus-syntax-and-types-1803.09660"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-context-switching-for-valence-systems-1803.09703</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-context-switching-for-valence-systems-1803.09703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-context-switching-for-valence-systems-1803.09703"/></url>
<url><loc>https://scifaro.com/en/abs/a-many-sorted-polyadic-modal-logic-1803.09709</loc><lastmod>2018-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-many-sorted-polyadic-modal-logic-1803.09709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-many-sorted-polyadic-modal-logic-1803.09709"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-synthesis-towards-output-sensitive-algorithms-1803.10104</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-synthesis-towards-output-sensitive-algorithms-1803.10104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-synthesis-towards-output-sensitive-algorithms-1803.10104"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-1803.10143</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-1803.10143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-type-system-with-lambda-typed-lambda-expressions-1803.10143"/></url>
<url><loc>https://scifaro.com/en/abs/facets-of-software-doping-1803.10154</loc><lastmod>2018-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facets-of-software-doping-1803.10154"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facets-of-software-doping-1803.10154"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-a-cache-coherence-protocol-with-the-guarded-action-language-1803.10323</loc><lastmod>2018-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-a-cache-coherence-protocol-with-the-guarded-action-language-1803.10323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-a-cache-coherence-protocol-with-the-guarded-action-language-1803.10323"/></url>
<url><loc>https://scifaro.com/en/abs/bundled-fragments-of-first-order-modal-logic-un-decidability-1803.10508</loc><lastmod>2018-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bundled-fragments-of-first-order-modal-logic-un-decidability-1803.10508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bundled-fragments-of-first-order-modal-logic-un-decidability-1803.10508"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-aggregative-modal-logic-characterization-and-interpolation-new-version-1803.10953</loc><lastmod>2019-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-aggregative-modal-logic-characterization-and-interpolation-new-version-1803.10953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-aggregative-modal-logic-characterization-and-interpolation-new-version-1803.10953"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-complete-test-sets-1804.00073</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-complete-test-sets-1804.00073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-complete-test-sets-1804.00073"/></url>
<url><loc>https://scifaro.com/en/abs/maximum-realizability-for-linear-temporal-logic-specifications-1804.00415</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximum-realizability-for-linear-temporal-logic-specifications-1804.00415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximum-realizability-for-linear-temporal-logic-specifications-1804.00415"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-structure-of-c-algebras-through-atomicity-and-if-then-else-1804.00568</loc><lastmod>2018-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-structure-of-c-algebras-through-atomicity-and-if-then-else-1804.00568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-structure-of-c-algebras-through-atomicity-and-if-then-else-1804.00568"/></url>
<url><loc>https://scifaro.com/en/abs/an-interpretation-of-system-f-through-bar-recursion-1804.00731</loc><lastmod>2018-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interpretation-of-system-f-through-bar-recursion-1804.00731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interpretation-of-system-f-through-bar-recursion-1804.00731"/></url>
<url><loc>https://scifaro.com/en/abs/from-symmetric-pattern-matching-to-quantum-control-extended-version-1804.00952</loc><lastmod>2018-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-symmetric-pattern-matching-to-quantum-control-extended-version-1804.00952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-symmetric-pattern-matching-to-quantum-control-extended-version-1804.00952"/></url>
<url><loc>https://scifaro.com/en/abs/attracting-tangles-to-solve-parity-games-1804.01023</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attracting-tangles-to-solve-parity-games-1804.01023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attracting-tangles-to-solve-parity-games-1804.01023"/></url>
<url><loc>https://scifaro.com/en/abs/applying-computer-algebra-systems-with-sat-solvers-to-the-williamson-conjecture-1804.01172</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-computer-algebra-systems-with-sat-solvers-to-the-williamson-conjecture-1804.01172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-computer-algebra-systems-with-sat-solvers-to-the-williamson-conjecture-1804.01172"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-calculation-of-fundamental-groups-in-homotopy-type-theory-by-means-of-computational-paths-1804.01413</loc><lastmod>2018-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-calculation-of-fundamental-groups-in-homotopy-type-theory-by-means-of-computational-paths-1804.01413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-calculation-of-fundamental-groups-in-homotopy-type-theory-by-means-of-computational-paths-1804.01413"/></url>
<url><loc>https://scifaro.com/en/abs/short-proofs-for-some-symmetric-quantified-boolean-formulas-1804.01437</loc><lastmod>2018-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-proofs-for-some-symmetric-quantified-boolean-formulas-1804.01437"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-proofs-for-some-symmetric-quantified-boolean-formulas-1804.01437"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-of-the-compositions-of-time-interval-relations-1804.01637</loc><lastmod>2018-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-of-the-compositions-of-time-interval-relations-1804.01637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-of-the-compositions-of-time-interval-relations-1804.01637"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-axiomatizability-of-quantitative-algebras-1804.01682</loc><lastmod>2018-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-axiomatizability-of-quantitative-algebras-1804.01682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-axiomatizability-of-quantitative-algebras-1804.01682"/></url>
<url><loc>https://scifaro.com/en/abs/hyperpctl-a-temporal-logic-for-probabilistic-hyperproperties-1804.01853</loc><lastmod>2018-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperpctl-a-temporal-logic-for-probabilistic-hyperproperties-1804.01853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperpctl-a-temporal-logic-for-probabilistic-hyperproperties-1804.01853"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-verification-of-parametric-and-reconfigurable-markov-chains-1804.01872</loc><lastmod>2018-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-verification-of-parametric-and-reconfigurable-markov-chains-1804.01872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-verification-of-parametric-and-reconfigurable-markov-chains-1804.01872"/></url>
<url><loc>https://scifaro.com/en/abs/a-holistic-approach-for-soundness-verification-of-decision-aware-process-models-extended-version-1804.02316</loc><lastmod>2018-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-holistic-approach-for-soundness-verification-of-decision-aware-process-models-extended-version-1804.02316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-holistic-approach-for-soundness-verification-of-decision-aware-process-models-extended-version-1804.02316"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-determinization-of-alternating-automata-1804.02546</loc><lastmod>2018-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-determinization-of-alternating-automata-1804.02546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-determinization-of-alternating-automata-1804.02546"/></url>
<url><loc>https://scifaro.com/en/abs/modality-via-iterated-enrichment-1804.02809</loc><lastmod>2018-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modality-via-iterated-enrichment-1804.02809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modality-via-iterated-enrichment-1804.02809"/></url>
<url><loc>https://scifaro.com/en/abs/information-and-set-algebras-interpretation-and-uniqueness-of-conditional-independence-1804.02840</loc><lastmod>2018-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-and-set-algebras-interpretation-and-uniqueness-of-conditional-independence-1804.02840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-and-set-algebras-interpretation-and-uniqueness-of-conditional-independence-1804.02840"/></url>
<url><loc>https://scifaro.com/en/abs/qrat-generalizing-qrat-by-a-more-powerful-qbf-redundancy-property-1804.02908</loc><lastmod>2018-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qrat-generalizing-qrat-by-a-more-powerful-qbf-redundancy-property-1804.02908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qrat-generalizing-qrat-by-a-more-powerful-qbf-redundancy-property-1804.02908"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-approach-to-syntactic-monoids-1804.03011</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-approach-to-syntactic-monoids-1804.03011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-approach-to-syntactic-monoids-1804.03011"/></url>
<url><loc>https://scifaro.com/en/abs/full-version-an-evaluation-of-estimation-techniques-for-probabilistic-reachability-1804.03121</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-version-an-evaluation-of-estimation-techniques-for-probabilistic-reachability-1804.03121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-version-an-evaluation-of-estimation-techniques-for-probabilistic-reachability-1804.03121"/></url>
<url><loc>https://scifaro.com/en/abs/a-counting-semantics-for-monitoring-ltl-specifications-over-finite-traces-1804.03237</loc><lastmod>2018-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-counting-semantics-for-monitoring-ltl-specifications-over-finite-traces-1804.03237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-counting-semantics-for-monitoring-ltl-specifications-over-finite-traces-1804.03237"/></url>
<url><loc>https://scifaro.com/en/abs/combinations-of-qualitative-winning-for-stochastic-parity-games-1804.03453</loc><lastmod>2018-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinations-of-qualitative-winning-for-stochastic-parity-games-1804.03453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinations-of-qualitative-winning-for-stochastic-parity-games-1804.03453"/></url>
<url><loc>https://scifaro.com/en/abs/coverability-realizability-lower-bounds-1804.03454</loc><lastmod>2018-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coverability-realizability-lower-bounds-1804.03454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coverability-realizability-lower-bounds-1804.03454"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-prenex-separation-logic-with-one-selector-1804.03556</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-prenex-separation-logic-with-one-selector-1804.03556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-prenex-separation-logic-with-one-selector-1804.03556"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorics-of-explicit-substitutions-1804.03862</loc><lastmod>2018-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorics-of-explicit-substitutions-1804.03862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorics-of-explicit-substitutions-1804.03862"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-winding-numbers-and-counting-complex-roots-through-cauchy-indices-in-isabelle-hol-1804.03922</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-winding-numbers-and-counting-complex-roots-through-cauchy-indices-in-isabelle-hol-1804.03922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-winding-numbers-and-counting-complex-roots-through-cauchy-indices-in-isabelle-hol-1804.03922"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-cyclic-proofs-for-symbolic-heaps-1804.03938</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-cyclic-proofs-for-symbolic-heaps-1804.03938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-cyclic-proofs-for-symbolic-heaps-1804.03938"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-semantics-for-new-paradigms-probabilistic-hybrid-and-beyond-1804.04145</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-semantics-for-new-paradigms-probabilistic-hybrid-and-beyond-1804.04145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-semantics-for-new-paradigms-probabilistic-hybrid-and-beyond-1804.04145"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-liveness-into-multi-lane-spatial-logic-lane-change-controllers-using-uppaal-1804.04346</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-liveness-into-multi-lane-spatial-logic-lane-change-controllers-using-uppaal-1804.04346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-liveness-into-multi-lane-spatial-logic-lane-change-controllers-using-uppaal-1804.04346"/></url>
<url><loc>https://scifaro.com/en/abs/debugging-program-verification-proof-scripts-tool-paper-1804.04402</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/debugging-program-verification-proof-scripts-tool-paper-1804.04402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/debugging-program-verification-proof-scripts-tool-paper-1804.04402"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-computation-in-petri-nets-1804.04607</loc><lastmod>2018-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-computation-in-petri-nets-1804.04607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-computation-in-petri-nets-1804.04607"/></url>
<url><loc>https://scifaro.com/en/abs/value-iteration-for-simple-stochastic-games-stopping-criterion-and-learning-algorithm-1804.04901</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/value-iteration-for-simple-stochastic-games-stopping-criterion-and-learning-algorithm-1804.04901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/value-iteration-for-simple-stochastic-games-stopping-criterion-and-learning-algorithm-1804.04901"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-analysis-of-s1s-and-b-uchi-automata-1804.04967</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-analysis-of-s1s-and-b-uchi-automata-1804.04967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-analysis-of-s1s-and-b-uchi-automata-1804.04967"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-team-logic-and-its-two-variable-fragment-1804.04968</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-team-logic-and-its-two-variable-fragment-1804.04968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-team-logic-and-its-two-variable-fragment-1804.04968"/></url>
<url><loc>https://scifaro.com/en/abs/sound-value-iteration-1804.05001</loc><lastmod>2018-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-value-iteration-1804.05001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-value-iteration-1804.05001"/></url>
<url><loc>https://scifaro.com/en/abs/on-solving-quantified-bit-vectors-using-invertibility-conditions-1804.05025</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-solving-quantified-bit-vectors-using-invertibility-conditions-1804.05025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-solving-quantified-bit-vectors-using-invertibility-conditions-1804.05025"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-control-improvisation-1804.05037</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-control-improvisation-1804.05037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-control-improvisation-1804.05037"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-tso-programs-using-reduction-and-abstraction-1804.05196</loc><lastmod>2018-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-tso-programs-using-reduction-and-abstraction-1804.05196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-tso-programs-using-reduction-and-abstraction-1804.05196"/></url>
<url><loc>https://scifaro.com/en/abs/modal-dependent-type-theory-and-dependent-right-adjoints-1804.05236</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-dependent-type-theory-and-dependent-right-adjoints-1804.05236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-dependent-type-theory-and-dependent-right-adjoints-1804.05236"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-hard-about-boolean-functional-synthesis-1804.05507</loc><lastmod>2018-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-hard-about-boolean-functional-synthesis-1804.05507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-hard-about-boolean-functional-synthesis-1804.05507"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-rewriting-and-asymptotic-behaviour-on-termination-and-unique-normal-forms-1804.05578</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-rewriting-and-asymptotic-behaviour-on-termination-and-unique-normal-forms-1804.05578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-rewriting-and-asymptotic-behaviour-on-termination-and-unique-normal-forms-1804.05578"/></url>
<url><loc>https://scifaro.com/en/abs/trees-from-functions-as-processes-1804.05797</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-from-functions-as-processes-1804.05797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-from-functions-as-processes-1804.05797"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-substitution-for-differential-game-logic-1804.05880</loc><lastmod>2018-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-substitution-for-differential-game-logic-1804.05880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-substitution-for-differential-game-logic-1804.05880"/></url>
<url><loc>https://scifaro.com/en/abs/expressivity-within-second-order-transitive-closure-logic-1804.05926</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressivity-within-second-order-transitive-closure-logic-1804.05926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressivity-within-second-order-transitive-closure-logic-1804.05926"/></url>
<url><loc>https://scifaro.com/en/abs/an-iterative-approach-to-precondition-inference-using-constrained-horn-clauses-1804.05989</loc><lastmod>2018-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-iterative-approach-to-precondition-inference-using-constrained-horn-clauses-1804.05989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-iterative-approach-to-precondition-inference-using-constrained-horn-clauses-1804.05989"/></url>
<url><loc>https://scifaro.com/en/abs/partial-regularization-of-first-order-resolution-proofs-1804.06531</loc><lastmod>2018-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-regularization-of-first-order-resolution-proofs-1804.06531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-regularization-of-first-order-resolution-proofs-1804.06531"/></url>
<url><loc>https://scifaro.com/en/abs/the-clocks-they-are-adjunctions-denotational-semantics-for-clocked-type-theory-1804.06687</loc><lastmod>2018-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-clocks-they-are-adjunctions-denotational-semantics-for-clocked-type-theory-1804.06687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-clocks-they-are-adjunctions-denotational-semantics-for-clocked-type-theory-1804.06687"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-interpolation-for-the-theory-of-arrays-1804.07173</loc><lastmod>2018-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-interpolation-for-the-theory-of-arrays-1804.07173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-interpolation-for-the-theory-of-arrays-1804.07173"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-acyclicity-notion-for-query-answering-over-horn-sriq-ontologies-1804.07274</loc><lastmod>2018-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-acyclicity-notion-for-query-answering-over-horn-sriq-ontologies-1804.07274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-acyclicity-notion-for-query-answering-over-horn-sriq-ontologies-1804.07274"/></url>
<url><loc>https://scifaro.com/en/abs/bar-recursion-is-not-computable-via-iteration-1804.07277</loc><lastmod>2018-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bar-recursion-is-not-computable-via-iteration-1804.07277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bar-recursion-is-not-computable-via-iteration-1804.07277"/></url>
<url><loc>https://scifaro.com/en/abs/the-bond-calculus-a-process-algebra-for-complex-biological-interaction-dynamics-1804.07603</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bond-calculus-a-process-algebra-for-complex-biological-interaction-dynamics-1804.07603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bond-calculus-a-process-algebra-for-complex-biological-interaction-dynamics-1804.07603"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-conjunctive-queries-1804.07626</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-conjunctive-queries-1804.07626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-conjunctive-queries-1804.07626"/></url>
<url><loc>https://scifaro.com/en/abs/a-reduction-from-unbounded-linear-mixed-arithmetic-problems-into-bounded-problems-1804.07703</loc><lastmod>2018-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reduction-from-unbounded-linear-mixed-arithmetic-problems-into-bounded-problems-1804.07703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reduction-from-unbounded-linear-mixed-arithmetic-problems-into-bounded-problems-1804.07703"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-in-incremental-fpt-time-1804.07799</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-in-incremental-fpt-time-1804.07799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-in-incremental-fpt-time-1804.07799"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-for-planar-string-diagrams-and-a-quadratic-equivalence-algorithm-1804.07832</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-for-planar-string-diagrams-and-a-quadratic-equivalence-algorithm-1804.07832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-for-planar-string-diagrams-and-a-quadratic-equivalence-algorithm-1804.07832"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-mathematics-in-simple-type-theory-1804.07860</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-mathematics-in-simple-type-theory-1804.07860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-mathematics-in-simple-type-theory-1804.07860"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-platoon-control-strategies-1804.07951</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-platoon-control-strategies-1804.07951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-platoon-control-strategies-1804.07951"/></url>
<url><loc>https://scifaro.com/en/abs/subatomic-systems-need-not-be-subatomic-1804.08105</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subatomic-systems-need-not-be-subatomic-1804.08105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subatomic-systems-need-not-be-subatomic-1804.08105"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-approach-to-proving-reachability-properties-in-logically-constrained-term-rewriting-systems-1804.08308</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proving-reachability-properties-in-logically-constrained-term-rewriting-systems-1804.08308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-approach-to-proving-reachability-properties-in-logically-constrained-term-rewriting-systems-1804.08308"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-for-delimited-control-operators-1804.08373</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-for-delimited-control-operators-1804.08373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-for-delimited-control-operators-1804.08373"/></url>
<url><loc>https://scifaro.com/en/abs/top-down-and-bottom-up-evaluation-procedurally-integrated-1804.08443</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/top-down-and-bottom-up-evaluation-procedurally-integrated-1804.08443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/top-down-and-bottom-up-evaluation-procedurally-integrated-1804.08443"/></url>
<url><loc>https://scifaro.com/en/abs/cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-1804.08480</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-1804.08480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cautious-reasoning-in-asp-via-minimal-models-and-unsatisfiable-cores-1804.08480"/></url>
<url><loc>https://scifaro.com/en/abs/shared-aggregate-sets-in-answer-set-programming-1804.08488</loc><lastmod>2018-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shared-aggregate-sets-in-answer-set-programming-1804.08488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shared-aggregate-sets-in-answer-set-programming-1804.08488"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-and-distances-under-multiple-changes-1804.08555</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-and-distances-under-multiple-changes-1804.08555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-and-distances-under-multiple-changes-1804.08555"/></url>
<url><loc>https://scifaro.com/en/abs/equipping-sequent-based-argumentation-with-defeasible-assumptions-1804.08674</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equipping-sequent-based-argumentation-with-defeasible-assumptions-1804.08674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equipping-sequent-based-argumentation-with-defeasible-assumptions-1804.08674"/></url>
<url><loc>https://scifaro.com/en/abs/central-limit-model-checking-1804.08744</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/central-limit-model-checking-1804.08744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/central-limit-model-checking-1804.08744"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-dependency-pairs-1804.08855</loc><lastmod>2018-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-dependency-pairs-1804.08855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-dependency-pairs-1804.08855"/></url>
<url><loc>https://scifaro.com/en/abs/covering-and-separation-for-logical-fragments-with-modular-predicates-1804.08883</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covering-and-separation-for-logical-fragments-with-modular-predicates-1804.08883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covering-and-separation-for-logical-fragments-with-modular-predicates-1804.08883"/></url>
<url><loc>https://scifaro.com/en/abs/developing-theoretical-foundations-for-runtime-enforcement-1804.08917</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/developing-theoretical-foundations-for-runtime-enforcement-1804.08917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/developing-theoretical-foundations-for-runtime-enforcement-1804.08917"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-b-uchi-automata-1804.08982</loc><lastmod>2024-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-b-uchi-automata-1804.08982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-b-uchi-automata-1804.08982"/></url>
<url><loc>https://scifaro.com/en/abs/solving-horn-clauses-on-inductive-data-types-without-induction-1804.09007</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-horn-clauses-on-inductive-data-types-without-induction-1804.09007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-horn-clauses-on-inductive-data-types-without-induction-1804.09007"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-computational-type-theory-1804.09098</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-computational-type-theory-1804.09098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-computational-type-theory-1804.09098"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-based-objectives-for-markov-decision-processes-1804.09341</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-based-objectives-for-markov-decision-processes-1804.09341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-based-objectives-for-markov-decision-processes-1804.09341"/></url>
<url><loc>https://scifaro.com/en/abs/two-monads-for-graphs-1804.09408</loc><lastmod>2018-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-monads-for-graphs-1804.09408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-monads-for-graphs-1804.09408"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-satisfiability-problem-for-fragments-of-the-two-variable-logic-with-one-transitive-relation-1804.09447</loc><lastmod>2019-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-fragments-of-the-two-variable-logic-with-one-transitive-relation-1804.09447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-satisfiability-problem-for-fragments-of-the-two-variable-logic-with-one-transitive-relation-1804.09447"/></url>
<url><loc>https://scifaro.com/en/abs/cheap-non-standard-analysis-and-computability-1804.09746</loc><lastmod>2019-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cheap-non-standard-analysis-and-computability-1804.09746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cheap-non-standard-analysis-and-computability-1804.09746"/></url>
<url><loc>https://scifaro.com/en/abs/enriching-a-linear-non-linear-lambda-calculus-a-programming-language-for-string-diagrams-1804.09822</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enriching-a-linear-non-linear-lambda-calculus-a-programming-language-for-string-diagrams-1804.09822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enriching-a-linear-non-linear-lambda-calculus-a-programming-language-for-string-diagrams-1804.09822"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-answer-set-programming-as-constructive-proof-search-1804.10004</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-answer-set-programming-as-constructive-proof-search-1804.10004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-answer-set-programming-as-constructive-proof-search-1804.10004"/></url>
<url><loc>https://scifaro.com/en/abs/it-is-easy-to-be-wise-after-the-event-communicating-finite-state-machines-capture-first-order-logic-with-happened-before-1804.10076</loc><lastmod>2018-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-is-easy-to-be-wise-after-the-event-communicating-finite-state-machines-capture-first-order-logic-with-happened-before-1804.10076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-is-easy-to-be-wise-after-the-event-communicating-finite-state-machines-capture-first-order-logic-with-happened-before-1804.10076"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-model-counting-beyond-two-variable-logic-1804.10185</loc><lastmod>2018-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-model-counting-beyond-two-variable-logic-1804.10185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-model-counting-beyond-two-variable-logic-1804.10185"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-based-inference-in-probabilistic-logic-programs-1804.10237</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-based-inference-in-probabilistic-logic-programs-1804.10237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-based-inference-in-probabilistic-logic-programs-1804.10237"/></url>
<url><loc>https://scifaro.com/en/abs/history-preserving-bisimulations-on-reversible-calculus-of-communicating-systems-1804.10355</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/history-preserving-bisimulations-on-reversible-calculus-of-communicating-systems-1804.10355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/history-preserving-bisimulations-on-reversible-calculus-of-communicating-systems-1804.10355"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-tof-1804.10360</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-tof-1804.10360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-tof-1804.10360"/></url>
<url><loc>https://scifaro.com/en/abs/consistency-checking-of-functional-requirements-1804.10486</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistency-checking-of-functional-requirements-1804.10486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistency-checking-of-functional-requirements-1804.10486"/></url>
<url><loc>https://scifaro.com/en/abs/sound-up-to-techniques-and-complete-abstract-domains-1804.10507</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-up-to-techniques-and-complete-abstract-domains-1804.10507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-up-to-techniques-and-complete-abstract-domains-1804.10507"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-linear-typings-as-flows-on-3-valent-graphs-1804.10540</loc><lastmod>2018-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-linear-typings-as-flows-on-3-valent-graphs-1804.10540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-linear-typings-as-flows-on-3-valent-graphs-1804.10540"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-of-diagrams-1804.10886</loc><lastmod>2020-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-of-diagrams-1804.10886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-of-diagrams-1804.10886"/></url>
<url><loc>https://scifaro.com/en/abs/trees-in-partial-higher-dimensional-automata-1804.10894</loc><lastmod>2018-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-in-partial-higher-dimensional-automata-1804.10894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-in-partial-higher-dimensional-automata-1804.10894"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-games-and-semi-random-determinacy-1804.10896</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-games-and-semi-random-determinacy-1804.10896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-games-and-semi-random-determinacy-1804.10896"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-algorithms-for-asymptotic-bounds-on-termination-time-in-vass-1804.10985</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-algorithms-for-asymptotic-bounds-on-termination-time-in-vass-1804.10985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-algorithms-for-asymptotic-bounds-on-termination-time-in-vass-1804.10985"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-1804.10998</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-1804.10998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-scheduling-for-exposed-datapath-architectures-with-buffered-processing-units-by-asp-1804.10998"/></url>
<url><loc>https://scifaro.com/en/abs/macneille-completion-and-buchholz-omega-rule-for-parameter-free-second-order-logics-1804.11066</loc><lastmod>2019-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/macneille-completion-and-buchholz-omega-rule-for-parameter-free-second-order-logics-1804.11066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/macneille-completion-and-buchholz-omega-rule-for-parameter-free-second-order-logics-1804.11066"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-coalgebra-modalities-and-mathsf-mell-model-structure-to-eilenberg-moore-categories-1804.11116</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-coalgebra-modalities-and-mathsf-mell-model-structure-to-eilenberg-moore-categories-1804.11116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-coalgebra-modalities-and-mathsf-mell-model-structure-to-eilenberg-moore-categories-1804.11116"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimized-ke-tableau-based-system-for-reasoning-in-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1804.11222</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimized-ke-tableau-based-system-for-reasoning-in-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1804.11222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimized-ke-tableau-based-system-for-reasoning-in-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1804.11222"/></url>
<url><loc>https://scifaro.com/en/abs/proof-relevant-horn-clauses-for-dependent-type-inference-and-term-synthesis-1804.11250</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-relevant-horn-clauses-for-dependent-type-inference-and-term-synthesis-1804.11250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-relevant-horn-clauses-for-dependent-type-inference-and-term-synthesis-1804.11250"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-shortest-paths-and-weight-bounded-properties-in-markov-decision-processes-1804.11301</loc><lastmod>2018-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-shortest-paths-and-weight-bounded-properties-in-markov-decision-processes-1804.11301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-shortest-paths-and-weight-bounded-properties-in-markov-decision-processes-1804.11301"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-framework-for-relational-parametricity-1805.00067</loc><lastmod>2018-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-framework-for-relational-parametricity-1805.00067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-framework-for-relational-parametricity-1805.00067"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-answer-set-programming-with-external-sources-for-meta-interpretive-learning-1805.00068</loc><lastmod>2018-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-answer-set-programming-with-external-sources-for-meta-interpretive-learning-1805.00068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-answer-set-programming-with-external-sources-for-meta-interpretive-learning-1805.00068"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-of-recursive-types-in-synthetic-guarded-domain-theory-1805.00289</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-of-recursive-types-in-synthetic-guarded-domain-theory-1805.00289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-of-recursive-types-in-synthetic-guarded-domain-theory-1805.00289"/></url>
<url><loc>https://scifaro.com/en/abs/gr-obner-bases-of-modules-and-faug-ere-s-f-4-algorithm-in-isabelle-hol-1805.00304</loc><lastmod>2018-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gr-obner-bases-of-modules-and-faug-ere-s-f-4-algorithm-in-isabelle-hol-1805.00304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gr-obner-bases-of-modules-and-faug-ere-s-f-4-algorithm-in-isabelle-hol-1805.00304"/></url>
<url><loc>https://scifaro.com/en/abs/computable-decision-making-on-the-reals-and-other-spaces-via-partiality-and-nondeterminism-1805.00468</loc><lastmod>2018-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-decision-making-on-the-reals-and-other-spaces-via-partiality-and-nondeterminism-1805.00468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-decision-making-on-the-reals-and-other-spaces-via-partiality-and-nondeterminism-1805.00468"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-stable-functions-on-discrete-cones-are-power-series-long-version-1805.00512</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-stable-functions-on-discrete-cones-are-power-series-long-version-1805.00512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-stable-functions-on-discrete-cones-are-power-series-long-version-1805.00512"/></url>
<url><loc>https://scifaro.com/en/abs/one-theorem-to-rule-them-all-a-unified-translation-of-ltl-into-omega-automata-1805.00748</loc><lastmod>2018-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-theorem-to-rule-them-all-a-unified-translation-of-ltl-into-omega-automata-1805.00748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-theorem-to-rule-them-all-a-unified-translation-of-ltl-into-omega-automata-1805.00748"/></url>
<url><loc>https://scifaro.com/en/abs/choice-revision-on-belief-bases-1805.01325</loc><lastmod>2018-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choice-revision-on-belief-bases-1805.01325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choice-revision-on-belief-bases-1805.01325"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-fairness-in-a-synchronous-concurrent-program-algebra-extended-version-with-proofs-1805.01681</loc><lastmod>2018-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-fairness-in-a-synchronous-concurrent-program-algebra-extended-version-with-proofs-1805.01681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-fairness-in-a-synchronous-concurrent-program-algebra-extended-version-with-proofs-1805.01681"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-perspective-on-fo-model-checking-of-dense-graph-classes-1805.01823</loc><lastmod>2018-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-perspective-on-fo-model-checking-of-dense-graph-classes-1805.01823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-perspective-on-fo-model-checking-of-dense-graph-classes-1805.01823"/></url>
<url><loc>https://scifaro.com/en/abs/confluent-terminating-extensional-lambda-calculi-with-surjective-pairing-and-terminal-type-1805.02004</loc><lastmod>2018-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluent-terminating-extensional-lambda-calculi-with-surjective-pairing-and-terminal-type-1805.02004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluent-terminating-extensional-lambda-calculi-with-surjective-pairing-and-terminal-type-1805.02004"/></url>
<url><loc>https://scifaro.com/en/abs/classification-transfer-for-qualitative-reasoning-problems-1805.02038</loc><lastmod>2018-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classification-transfer-for-qualitative-reasoning-problems-1805.02038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classification-transfer-for-qualitative-reasoning-problems-1805.02038"/></url>
<url><loc>https://scifaro.com/en/abs/free-higher-groups-in-homotopy-type-theory-1805.02069</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-higher-groups-in-homotopy-type-theory-1805.02069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-higher-groups-in-homotopy-type-theory-1805.02069"/></url>
<url><loc>https://scifaro.com/en/abs/biform-theories-project-description-1805.02709</loc><lastmod>2018-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biform-theories-project-description-1805.02709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biform-theories-project-description-1805.02709"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-for-counting-complexity-classes-1805.02724</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-for-counting-complexity-classes-1805.02724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-for-counting-complexity-classes-1805.02724"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-robotic-cell-injection-systems-using-theorem-proving-1805.02858</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-robotic-cell-injection-systems-using-theorem-proving-1805.02858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-robotic-cell-injection-systems-using-theorem-proving-1805.02858"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-conditional-logic-of-simulation-models-1805.02859</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-conditional-logic-of-simulation-models-1805.02859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-conditional-logic-of-simulation-models-1805.02859"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-value-at-risk-for-reachability-and-mean-payoff-in-markov-decision-processes-1805.02946</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-value-at-risk-for-reachability-and-mean-payoff-in-markov-decision-processes-1805.02946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-value-at-risk-for-reachability-and-mean-payoff-in-markov-decision-processes-1805.02946"/></url>
<url><loc>https://scifaro.com/en/abs/parity-to-safety-in-polynomial-time-for-pushdown-and-collapsible-pushdown-systems-1805.02963</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-to-safety-in-polynomial-time-for-pushdown-and-collapsible-pushdown-systems-1805.02963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-to-safety-in-polynomial-time-for-pushdown-and-collapsible-pushdown-systems-1805.02963"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-the-existential-fragment-of-some-infinitely-generated-trace-monoids-an-application-to-ordinals-1805.03028</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-the-existential-fragment-of-some-infinitely-generated-trace-monoids-an-application-to-ordinals-1805.03028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-the-existential-fragment-of-some-infinitely-generated-trace-monoids-an-application-to-ordinals-1805.03028"/></url>
<url><loc>https://scifaro.com/en/abs/machine-learning-guidance-and-proof-certification-for-connection-tableaux-1805.03107</loc><lastmod>2018-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/machine-learning-guidance-and-proof-certification-for-connection-tableaux-1805.03107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/machine-learning-guidance-and-proof-certification-for-connection-tableaux-1805.03107"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakness-measure-for-gr-1-formulae-1805.03151</loc><lastmod>2018-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakness-measure-for-gr-1-formulae-1805.03151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakness-measure-for-gr-1-formulae-1805.03151"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-decision-diagrams-for-sat-1805.03496</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-decision-diagrams-for-sat-1805.03496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-decision-diagrams-for-sat-1805.03496"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-truly-concurrent-process-algebra-1805.03575</loc><lastmod>2018-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-truly-concurrent-process-algebra-1805.03575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-truly-concurrent-process-algebra-1805.03575"/></url>
<url><loc>https://scifaro.com/en/abs/presentable-signatures-and-initial-semantics-1805.03740</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presentable-signatures-and-initial-semantics-1805.03740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presentable-signatures-and-initial-semantics-1805.03740"/></url>
<url><loc>https://scifaro.com/en/abs/on-randomised-strategies-in-the-lambda-calculus-long-version-1805.03934</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-randomised-strategies-in-the-lambda-calculus-long-version-1805.03934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-randomised-strategies-in-the-lambda-calculus-long-version-1805.03934"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-joint-workshop-on-handling-implicit-and-explicit-knowledge-in-formal-system-development-impex-and-formal-and-model-driven-techniques-for-developing-trustworthy-systems-fm-mdd-1805.04636</loc><lastmod>2018-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-joint-workshop-on-handling-implicit-and-explicit-knowledge-in-formal-system-development-impex-and-formal-and-model-driven-techniques-for-developing-trustworthy-systems-fm-mdd-1805.04636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-joint-workshop-on-handling-implicit-and-explicit-knowledge-in-formal-system-development-impex-and-formal-and-model-driven-techniques-for-developing-trustworthy-systems-fm-mdd-1805.04636"/></url>
<url><loc>https://scifaro.com/en/abs/the-epfl-logic-synthesis-libraries-1805.05121</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-epfl-logic-synthesis-libraries-1805.05121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-epfl-logic-synthesis-libraries-1805.05121"/></url>
<url><loc>https://scifaro.com/en/abs/enumeration-of-complex-golay-pairs-via-programmatic-sat-1805.05488</loc><lastmod>2018-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumeration-of-complex-golay-pairs-via-programmatic-sat-1805.05488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumeration-of-complex-golay-pairs-via-programmatic-sat-1805.05488"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-model-checking-modulo-explicit-weak-memory-models-1805.05515</loc><lastmod>2018-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-model-checking-modulo-explicit-weak-memory-models-1805.05515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-model-checking-modulo-explicit-weak-memory-models-1805.05515"/></url>
<url><loc>https://scifaro.com/en/abs/accelerated-model-checking-of-parametric-markov-chains-1805.05672</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accelerated-model-checking-of-parametric-markov-chains-1805.05672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accelerated-model-checking-of-parametric-markov-chains-1805.05672"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-the-correctness-problem-for-non-zeroness-test-instruction-sequences-1805.05845</loc><lastmod>2019-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-the-correctness-problem-for-non-zeroness-test-instruction-sequences-1805.05845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-the-correctness-problem-for-non-zeroness-test-instruction-sequences-1805.05845"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semantics-of-snapshot-isolation-1805.06196</loc><lastmod>2018-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semantics-of-snapshot-isolation-1805.06196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semantics-of-snapshot-isolation-1805.06196"/></url>
<url><loc>https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-1805.06701</loc><lastmod>2018-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-1805.06701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-1805.06701"/></url>
<url><loc>https://scifaro.com/en/abs/strict-ideal-completions-of-the-lambda-calculus-1805.06736</loc><lastmod>2018-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-ideal-completions-of-the-lambda-calculus-1805.06736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-ideal-completions-of-the-lambda-calculus-1805.06736"/></url>
<url><loc>https://scifaro.com/en/abs/changing-observations-in-epistemic-temporal-logic-1805.06881</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/changing-observations-in-epistemic-temporal-logic-1805.06881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/changing-observations-in-epistemic-temporal-logic-1805.06881"/></url>
<url><loc>https://scifaro.com/en/abs/the-remote-build-tool-1805.07195</loc><lastmod>2018-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-remote-build-tool-1805.07195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-remote-build-tool-1805.07195"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-liftings-and-functor-presentations-in-coalgebraic-expression-languages-1805.07211</loc><lastmod>2018-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-liftings-and-functor-presentations-in-coalgebraic-expression-languages-1805.07211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-liftings-and-functor-presentations-in-coalgebraic-expression-languages-1805.07211"/></url>
<url><loc>https://scifaro.com/en/abs/translation-of-algorithmic-descriptions-of-discrete-functions-to-sat-with-applications-to-cryptanalysis-problems-1805.07239</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translation-of-algorithmic-descriptions-of-discrete-functions-to-sat-with-applications-to-cryptanalysis-problems-1805.07239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translation-of-algorithmic-descriptions-of-discrete-functions-to-sat-with-applications-to-cryptanalysis-problems-1805.07239"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-analysis-for-spatial-concurrent-constraint-systems-with-extrusion-1805.07434</loc><lastmod>2018-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-analysis-for-spatial-concurrent-constraint-systems-with-extrusion-1805.07434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-analysis-for-spatial-concurrent-constraint-systems-with-extrusion-1805.07434"/></url>
<url><loc>https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-i-1805.08425</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-i-1805.08425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-i-1805.08425"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-effects-as-inverse-arrows-1805.08605</loc><lastmod>2018-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-effects-as-inverse-arrows-1805.08605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-effects-as-inverse-arrows-1805.08605"/></url>
<url><loc>https://scifaro.com/en/abs/a-set-based-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1805.08606</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-set-based-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1805.08606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-set-based-reasoner-for-the-description-logic-mathcal-dl-mathbf-d-4-times-extended-version-1805.08606"/></url>
<url><loc>https://scifaro.com/en/abs/presheaf-models-of-relational-modalities-in-dependent-type-theory-1805.08684</loc><lastmod>2018-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presheaf-models-of-relational-modalities-in-dependent-type-theory-1805.08684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presheaf-models-of-relational-modalities-in-dependent-type-theory-1805.08684"/></url>
<url><loc>https://scifaro.com/en/abs/a-syllogistic-system-for-propositions-with-intermediate-quantifiers-1805.08707</loc><lastmod>2018-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syllogistic-system-for-propositions-with-intermediate-quantifiers-1805.08707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syllogistic-system-for-propositions-with-intermediate-quantifiers-1805.08707"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-logics-combining-word-equations-regular-expressions-and-length-constraints-1805.09123</loc><lastmod>2018-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-logics-combining-word-equations-regular-expressions-and-length-constraints-1805.09123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-logics-combining-word-equations-regular-expressions-and-length-constraints-1805.09123"/></url>
<url><loc>https://scifaro.com/en/abs/the-unified-higher-order-dependency-pair-framework-1805.09390</loc><lastmod>2018-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-unified-higher-order-dependency-pair-framework-1805.09390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-unified-higher-order-dependency-pair-framework-1805.09390"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-with-dependent-types-for-classical-arithmetic-1805.09542</loc><lastmod>2019-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-with-dependent-types-for-classical-arithmetic-1805.09542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-with-dependent-types-for-classical-arithmetic-1805.09542"/></url>
<url><loc>https://scifaro.com/en/abs/checking-deadlock-freedom-of-parametric-component-based-systems-1805.10073</loc><lastmod>2019-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-deadlock-freedom-of-parametric-component-based-systems-1805.10073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-deadlock-freedom-of-parametric-component-based-systems-1805.10073"/></url>
<url><loc>https://scifaro.com/en/abs/certified-ordered-completion-1805.10090</loc><lastmod>2018-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-ordered-completion-1805.10090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-ordered-completion-1805.10090"/></url>
<url><loc>https://scifaro.com/en/abs/consequence-based-axiom-pinpointing-1805.10250</loc><lastmod>2018-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consequence-based-axiom-pinpointing-1805.10250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consequence-based-axiom-pinpointing-1805.10250"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-encodings-and-expressiveness-1805.10415</loc><lastmod>2018-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-encodings-and-expressiveness-1805.10415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-encodings-and-expressiveness-1805.10415"/></url>
<url><loc>https://scifaro.com/en/abs/classical-realizability-as-a-classifier-for-nondeterminism-1805.11392</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-realizability-as-a-classifier-for-nondeterminism-1805.11392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-realizability-as-a-classifier-for-nondeterminism-1805.11392"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-ltl-model-checking-1805.11765</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-ltl-model-checking-1805.11765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-ltl-model-checking-1805.11765"/></url>
<url><loc>https://scifaro.com/en/abs/unification-and-logarithmic-space-1805.11988</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-and-logarithmic-space-1805.11988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-and-logarithmic-space-1805.11988"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-results-for-atl-with-imperfect-information-and-perfect-recall-1805.12582</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-results-for-atl-with-imperfect-information-and-perfect-recall-1805.12582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-results-for-atl-with-imperfect-information-and-perfect-recall-1805.12582"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-1805.12592</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-1805.12592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-1805.12592"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-under-hierarchical-information-1806.00028</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-under-hierarchical-information-1806.00028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-knowledge-and-strategies-under-hierarchical-information-1806.00028"/></url>
<url><loc>https://scifaro.com/en/abs/signal-convolution-logic-1806.00238</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signal-convolution-logic-1806.00238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signal-convolution-logic-1806.00238"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-bisimulation-and-simulation-on-finite-systems-1806.00256</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-bisimulation-and-simulation-on-finite-systems-1806.00256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-bisimulation-and-simulation-on-finite-systems-1806.00256"/></url>
<url><loc>https://scifaro.com/en/abs/the-encodability-hierarchy-for-pcf-types-1806.00344</loc><lastmod>2018-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-encodability-hierarchy-for-pcf-types-1806.00344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-encodability-hierarchy-for-pcf-types-1806.00344"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-style-of-proof-for-mathematics-organized-as-a-network-of-axiomatic-theories-1806.00810</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-style-of-proof-for-mathematics-organized-as-a-network-of-axiomatic-theories-1806.00810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-style-of-proof-for-mathematics-organized-as-a-network-of-axiomatic-theories-1806.00810"/></url>
<url><loc>https://scifaro.com/en/abs/calculational-verification-of-reactive-programs-with-reactive-relations-and-kleene-algebra-1806.02101</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculational-verification-of-reactive-programs-with-reactive-relations-and-kleene-algebra-1806.02101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculational-verification-of-reactive-programs-with-reactive-relations-and-kleene-algebra-1806.02101"/></url>
<url><loc>https://scifaro.com/en/abs/constrained-counting-and-sampling-bridging-the-gap-between-theory-and-practice-1806.02239</loc><lastmod>2018-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constrained-counting-and-sampling-bridging-the-gap-between-theory-and-practice-1806.02239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constrained-counting-and-sampling-bridging-the-gap-between-theory-and-practice-1806.02239"/></url>
<url><loc>https://scifaro.com/en/abs/specification-of-state-and-time-constraints-for-runtime-verification-of-functions-1806.02621</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-of-state-and-time-constraints-for-runtime-verification-of-functions-1806.02621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-of-state-and-time-constraints-for-runtime-verification-of-functions-1806.02621"/></url>
<url><loc>https://scifaro.com/en/abs/maximizing-the-number-of-satisfied-l-clauses-1806.02930</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maximizing-the-number-of-satisfied-l-clauses-1806.02930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maximizing-the-number-of-satisfied-l-clauses-1806.02930"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-lerch-s-theorem-using-hol-light-1806.03049</loc><lastmod>2018-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-lerch-s-theorem-using-hol-light-1806.03049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-lerch-s-theorem-using-hol-light-1806.03049"/></url>
<url><loc>https://scifaro.com/en/abs/formal-small-step-verification-of-a-call-by-value-lambda-calculus-machine-1806.03205</loc><lastmod>2019-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-small-step-verification-of-a-call-by-value-lambda-calculus-machine-1806.03205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-small-step-verification-of-a-call-by-value-lambda-calculus-machine-1806.03205"/></url>
<url><loc>https://scifaro.com/en/abs/learning-linear-temporal-properties-1806.03953</loc><lastmod>2018-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-linear-temporal-properties-1806.03953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-linear-temporal-properties-1806.03953"/></url>
<url><loc>https://scifaro.com/en/abs/goal-oriented-conjecturing-for-isabelle-hol-1806.04774</loc><lastmod>2018-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goal-oriented-conjecturing-for-isabelle-hol-1806.04774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goal-oriented-conjecturing-for-isabelle-hol-1806.04774"/></url>
<url><loc>https://scifaro.com/en/abs/subspace-invariant-ac-0-formulas-1806.04831</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subspace-invariant-ac-0-formulas-1806.04831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subspace-invariant-ac-0-formulas-1806.04831"/></url>
<url><loc>https://scifaro.com/en/abs/ttt2-with-termination-templates-for-teaching-1806.05040</loc><lastmod>2018-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ttt2-with-termination-templates-for-teaching-1806.05040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ttt2-with-termination-templates-for-teaching-1806.05040"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-independent-strategies-for-pmdps-via-pomdps-1806.05126</loc><lastmod>2018-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-independent-strategies-for-pmdps-via-pomdps-1806.05126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-independent-strategies-for-pmdps-via-pomdps-1806.05126"/></url>
<url><loc>https://scifaro.com/en/abs/dependently-typed-folds-for-nested-data-types-1806.05230</loc><lastmod>2018-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependently-typed-folds-for-nested-data-types-1806.05230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependently-typed-folds-for-nested-data-types-1806.05230"/></url>
<url><loc>https://scifaro.com/en/abs/flow-logic-1806.05956</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flow-logic-1806.05956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flow-logic-1806.05956"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-category-theory-and-presheaf-models-of-type-theory-in-nuprl-1806.06114</loc><lastmod>2018-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-category-theory-and-presheaf-models-of-type-theory-in-nuprl-1806.06114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-category-theory-and-presheaf-models-of-type-theory-in-nuprl-1806.06114"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-like-algebras-of-finite-dimension-1806.06537</loc><lastmod>2022-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-like-algebras-of-finite-dimension-1806.06537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-like-algebras-of-finite-dimension-1806.06537"/></url>
<url><loc>https://scifaro.com/en/abs/new-approaches-for-almost-sure-termination-of-probabilistic-programs-1806.06683</loc><lastmod>2018-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-approaches-for-almost-sure-termination-of-probabilistic-programs-1806.06683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-approaches-for-almost-sure-termination-of-probabilistic-programs-1806.06683"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-calculus-and-reversible-automatic-combinators-1806.06759</loc><lastmod>2018-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-calculus-and-reversible-automatic-combinators-1806.06759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-calculus-and-reversible-automatic-combinators-1806.06759"/></url>
<url><loc>https://scifaro.com/en/abs/the-polylog-time-hierarchy-captured-by-restricted-second-order-logic-1806.07127</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-polylog-time-hierarchy-captured-by-restricted-second-order-logic-1806.07127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-polylog-time-hierarchy-captured-by-restricted-second-order-logic-1806.07127"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-strategies-for-incomplete-maxsat-1806.07164</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-strategies-for-incomplete-maxsat-1806.07164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-strategies-for-incomplete-maxsat-1806.07164"/></url>
<url><loc>https://scifaro.com/en/abs/computer-aided-proofs-for-multiparty-computation-with-active-security-1806.07197</loc><lastmod>2019-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-aided-proofs-for-multiparty-computation-with-active-security-1806.07197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-aided-proofs-for-multiparty-computation-with-active-security-1806.07197"/></url>
<url><loc>https://scifaro.com/en/abs/pamper-proof-method-recommendation-system-for-isabelle-hol-1806.07239</loc><lastmod>2018-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pamper-proof-method-recommendation-system-for-isabelle-hol-1806.07239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pamper-proof-method-recommendation-system-for-isabelle-hol-1806.07239"/></url>
<url><loc>https://scifaro.com/en/abs/upward-confluence-in-the-interaction-calculus-1806.07275</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upward-confluence-in-the-interaction-calculus-1806.07275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upward-confluence-in-the-interaction-calculus-1806.07275"/></url>
<url><loc>https://scifaro.com/en/abs/schematic-polymorphism-in-the-abella-proof-assistant-1806.07523</loc><lastmod>2018-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/schematic-polymorphism-in-the-abella-proof-assistant-1806.07523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/schematic-polymorphism-in-the-abella-proof-assistant-1806.07523"/></url>
<url><loc>https://scifaro.com/en/abs/universal-safety-for-timed-petri-nets-is-pspace-complete-1806.08170</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-safety-for-timed-petri-nets-is-pspace-complete-1806.08170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-safety-for-timed-petri-nets-is-pspace-complete-1806.08170"/></url>
<url><loc>https://scifaro.com/en/abs/a-credal-extension-of-independent-choice-logic-1806.08298</loc><lastmod>2018-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-credal-extension-of-independent-choice-logic-1806.08298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-credal-extension-of-independent-choice-logic-1806.08298"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-informal-type-theory-the-higher-groupoid-structure-1806.08490</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-informal-type-theory-the-higher-groupoid-structure-1806.08490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-informal-type-theory-the-higher-groupoid-structure-1806.08490"/></url>
<url><loc>https://scifaro.com/en/abs/polarized-rewriting-and-tableaux-in-b-set-theory-1806.08536</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polarized-rewriting-and-tableaux-in-b-set-theory-1806.08536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polarized-rewriting-and-tableaux-in-b-set-theory-1806.08536"/></url>
<url><loc>https://scifaro.com/en/abs/assumption-commitment-types-for-resource-management-in-virtually-timed-ambients-1806.08653</loc><lastmod>2019-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assumption-commitment-types-for-resource-management-in-virtually-timed-ambients-1806.08653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assumption-commitment-types-for-resource-management-in-virtually-timed-ambients-1806.08653"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-mitl-formulae-on-timed-automata-considering-a-continuous-time-semantics-1806.08684</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-mitl-formulae-on-timed-automata-considering-a-continuous-time-semantics-1806.08684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-mitl-formulae-on-timed-automata-considering-a-continuous-time-semantics-1806.08684"/></url>
<url><loc>https://scifaro.com/en/abs/what-does-this-notation-mean-anyway-1806.08771</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-does-this-notation-mean-anyway-1806.08771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-does-this-notation-mean-anyway-1806.08771"/></url>
<url><loc>https://scifaro.com/en/abs/cvc4-at-the-smt-competition-2018-1806.08775</loc><lastmod>2018-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cvc4-at-the-smt-competition-2018-1806.08775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cvc4-at-the-smt-competition-2018-1806.08775"/></url>
<url><loc>https://scifaro.com/en/abs/self-driving-vehicle-verification-towards-a-benchmark-1806.08810</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/self-driving-vehicle-verification-towards-a-benchmark-1806.08810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/self-driving-vehicle-verification-towards-a-benchmark-1806.08810"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-digitization-of-real-time-models-and-logics-1806.08920</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-digitization-of-real-time-models-and-logics-1806.08920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-digitization-of-real-time-models-and-logics-1806.08920"/></url>
<url><loc>https://scifaro.com/en/abs/relating-structure-and-power-comonadic-semantics-for-computational-resources-1806.09031</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-structure-and-power-comonadic-semantics-for-computational-resources-1806.09031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-structure-and-power-comonadic-semantics-for-computational-resources-1806.09031"/></url>
<url><loc>https://scifaro.com/en/abs/a-concrete-model-for-a-typed-linear-algebraic-lambda-calculus-1806.09236</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concrete-model-for-a-typed-linear-algebraic-lambda-calculus-1806.09236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concrete-model-for-a-typed-linear-algebraic-lambda-calculus-1806.09236"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-sets-as-real-numbers-extended-version-1806.09329</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-sets-as-real-numbers-extended-version-1806.09329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-sets-as-real-numbers-extended-version-1806.09329"/></url>
<url><loc>https://scifaro.com/en/abs/finding-models-through-graph-saturation-1806.09392</loc><lastmod>2018-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-models-through-graph-saturation-1806.09392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-models-through-graph-saturation-1806.09392"/></url>
<url><loc>https://scifaro.com/en/abs/quantifier-elimination-for-database-driven-verification-1806.09686</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifier-elimination-for-database-driven-verification-1806.09686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifier-elimination-for-database-driven-verification-1806.09686"/></url>
<url><loc>https://scifaro.com/en/abs/linear-tree-constraints-1806.09818</loc><lastmod>2018-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-tree-constraints-1806.09818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-tree-constraints-1806.09818"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-usage-control-models-a-case-study-of-usecon-using-tla-1806.09848</loc><lastmod>2018-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-usage-control-models-a-case-study-of-usecon-using-tla-1806.09848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-usage-control-models-a-case-study-of-usecon-using-tla-1806.09848"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-logic-for-reasoning-about-lf-specifications-1806.10199</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-logic-for-reasoning-about-lf-specifications-1806.10199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-logic-for-reasoning-about-lf-specifications-1806.10199"/></url>
<url><loc>https://scifaro.com/en/abs/bdds-naturally-represent-boolean-functions-and-zdds-naturally-represent-sets-of-sets-1806.10261</loc><lastmod>2018-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bdds-naturally-represent-boolean-functions-and-zdds-naturally-represent-sets-of-sets-1806.10261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bdds-naturally-represent-boolean-functions-and-zdds-naturally-represent-sets-of-sets-1806.10261"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-semantic-model-of-computation-revisited-an-automata-theoretic-perspective-1806.10435</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-semantic-model-of-computation-revisited-an-automata-theoretic-perspective-1806.10435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-semantic-model-of-computation-revisited-an-automata-theoretic-perspective-1806.10435"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-formal-notion-of-impact-metric-for-cyber-physical-attacks-full-version-1806.10463</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-formal-notion-of-impact-metric-for-cyber-physical-attacks-full-version-1806.10463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-formal-notion-of-impact-metric-for-cyber-physical-attacks-full-version-1806.10463"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-timed-automata-with-diagonal-constraints-1806.11007</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-timed-automata-with-diagonal-constraints-1806.11007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-timed-automata-with-diagonal-constraints-1806.11007"/></url>
<url><loc>https://scifaro.com/en/abs/up-to-techniques-for-behavioural-metrics-via-fibrations-1806.11064</loc><lastmod>2018-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/up-to-techniques-for-behavioural-metrics-via-fibrations-1806.11064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/up-to-techniques-for-behavioural-metrics-via-fibrations-1806.11064"/></url>
<url><loc>https://scifaro.com/en/abs/definable-inapproximability-new-challenges-for-duplicator-1806.11307</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definable-inapproximability-new-challenges-for-duplicator-1806.11307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definable-inapproximability-new-challenges-for-duplicator-1806.11307"/></url>
<url><loc>https://scifaro.com/en/abs/divergence-and-unique-solution-of-equations-1806.11354</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/divergence-and-unique-solution-of-equations-1806.11354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/divergence-and-unique-solution-of-equations-1806.11354"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-problem-for-unbounded-fragments-of-probabilistic-ctl-1806.11418</loc><lastmod>2018-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-unbounded-fragments-of-probabilistic-ctl-1806.11418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-unbounded-fragments-of-probabilistic-ctl-1806.11418"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-data-aware-processes-via-array-based-systems-extended-version-1806.11459</loc><lastmod>2019-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-data-aware-processes-via-array-based-systems-extended-version-1806.11459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-data-aware-processes-via-array-based-systems-extended-version-1806.11459"/></url>
<url><loc>https://scifaro.com/en/abs/resource-logics-with-a-diminishing-resource-1806.11559</loc><lastmod>2018-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-logics-with-a-diminishing-resource-1806.11559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-logics-with-a-diminishing-resource-1806.11559"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-analysis-of-expected-termination-time-for-population-protocols-1807.00331</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-analysis-of-expected-termination-time-for-population-protocols-1807.00331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-analysis-of-expected-termination-time-for-population-protocols-1807.00331"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-hyperproperties-1807.00758</loc><lastmod>2018-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-hyperproperties-1807.00758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-hyperproperties-1807.00758"/></url>
<url><loc>https://scifaro.com/en/abs/rule-algebras-for-adhesive-categories-1807.00785</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rule-algebras-for-adhesive-categories-1807.00785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rule-algebras-for-adhesive-categories-1807.00785"/></url>
<url><loc>https://scifaro.com/en/abs/automated-proofs-of-unique-normal-forms-w-r-t-conversion-for-term-rewriting-systems-1807.00940</loc><lastmod>2018-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-proofs-of-unique-normal-forms-w-r-t-conversion-for-term-rewriting-systems-1807.00940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-proofs-of-unique-normal-forms-w-r-t-conversion-for-term-rewriting-systems-1807.00940"/></url>
<url><loc>https://scifaro.com/en/abs/on-runtime-enforcement-via-suppressions-1807.01004</loc><lastmod>2018-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-runtime-enforcement-via-suppressions-1807.01004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-runtime-enforcement-via-suppressions-1807.01004"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-13th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1807.01352</loc><lastmod>2018-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-13th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1807.01352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-13th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1807.01352"/></url>
<url><loc>https://scifaro.com/en/abs/logical-rules-as-fractions-and-logics-as-sketches-1807.01620</loc><lastmod>2018-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-rules-as-fractions-and-logics-as-sketches-1807.01620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-rules-as-fractions-and-logics-as-sketches-1807.01620"/></url>
<url><loc>https://scifaro.com/en/abs/the-redprl-proof-assistant-invited-paper-1807.01869</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-redprl-proof-assistant-invited-paper-1807.01869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-redprl-proof-assistant-invited-paper-1807.01869"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-in-constructive-type-theory-of-the-standardization-theorem-for-the-lambda-calculus-using-multiple-substitution-1807.01871</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-in-constructive-type-theory-of-the-standardization-theorem-for-the-lambda-calculus-using-multiple-substitution-1807.01871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-in-constructive-type-theory-of-the-standardization-theorem-for-the-lambda-calculus-using-multiple-substitution-1807.01871"/></url>
<url><loc>https://scifaro.com/en/abs/sharing-a-library-between-proof-assistants-reaching-out-to-the-hol-family-1807.01873</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharing-a-library-between-proof-assistants-reaching-out-to-the-hol-family-1807.01873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharing-a-library-between-proof-assistants-reaching-out-to-the-hol-family-1807.01873"/></url>
<url><loc>https://scifaro.com/en/abs/the-em-convex-rewrite-system-1807.02058</loc><lastmod>2018-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-em-convex-rewrite-system-1807.02058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-em-convex-rewrite-system-1807.02058"/></url>
<url><loc>https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-1807.02081</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-1807.02081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-1807.02081"/></url>
<url><loc>https://scifaro.com/en/abs/updating-probabilistic-knowledge-on-condition-event-nets-using-bayesian-networks-1807.02566</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/updating-probabilistic-knowledge-on-condition-event-nets-using-bayesian-networks-1807.02566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/updating-probabilistic-knowledge-on-condition-event-nets-using-bayesian-networks-1807.02566"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-tools-for-randomness-conserving-protocols-1807.02735</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-tools-for-randomness-conserving-protocols-1807.02735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-tools-for-randomness-conserving-protocols-1807.02735"/></url>
<url><loc>https://scifaro.com/en/abs/petri-net-reductions-for-counting-markings-1807.02973</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-net-reductions-for-counting-markings-1807.02973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-net-reductions-for-counting-markings-1807.02973"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-store-repository-of-ltl-formulae-from-literature-and-case-studies-1807.03296</loc><lastmod>2018-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-store-repository-of-ltl-formulae-from-literature-and-case-studies-1807.03296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-store-repository-of-ltl-formulae-from-literature-and-case-studies-1807.03296"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-constructive-quantifier-elimination-in-agda-1807.04083</loc><lastmod>2018-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-constructive-quantifier-elimination-in-agda-1807.04083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-constructive-quantifier-elimination-in-agda-1807.04083"/></url>
<url><loc>https://scifaro.com/en/abs/everybody-s-got-to-be-somewhere-1807.04085</loc><lastmod>2018-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/everybody-s-got-to-be-somewhere-1807.04085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/everybody-s-got-to-be-somewhere-1807.04085"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-framework-for-implicate-generation-modulo-theories-1807.04557</loc><lastmod>2018-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-framework-for-implicate-generation-modulo-theories-1807.04557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-framework-for-implicate-generation-modulo-theories-1807.04557"/></url>
<url><loc>https://scifaro.com/en/abs/first-steps-towards-a-formalization-of-forcing-1807.05174</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-steps-towards-a-formalization-of-forcing-1807.05174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-steps-towards-a-formalization-of-forcing-1807.05174"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-algebraic-about-algebraic-effects-and-handlers-1807.05923</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-algebraic-about-algebraic-effects-and-handlers-1807.05923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-algebraic-about-algebraic-effects-and-handlers-1807.05923"/></url>
<url><loc>https://scifaro.com/en/abs/in-praise-of-impredicativity-a-contribution-to-the-formalisation-of-meta-programming-1807.06051</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/in-praise-of-impredicativity-a-contribution-to-the-formalisation-of-meta-programming-1807.06051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/in-praise-of-impredicativity-a-contribution-to-the-formalisation-of-meta-programming-1807.06051"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-immediate-observation-population-protocols-1807.06071</loc><lastmod>2018-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-immediate-observation-population-protocols-1807.06071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-immediate-observation-population-protocols-1807.06071"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-higher-order-probabilistic-programs-1807.06091</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-higher-order-probabilistic-programs-1807.06091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-higher-order-probabilistic-programs-1807.06091"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-inference-for-bayesian-and-petri-nets-1807.06305</loc><lastmod>2018-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-inference-for-bayesian-and-petri-nets-1807.06305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-inference-for-bayesian-and-petri-nets-1807.06305"/></url>
<url><loc>https://scifaro.com/en/abs/planning-and-synthesis-under-assumptions-1807.06777</loc><lastmod>2019-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/planning-and-synthesis-under-assumptions-1807.06777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/planning-and-synthesis-under-assumptions-1807.06777"/></url>
<url><loc>https://scifaro.com/en/abs/language-preservation-problems-in-parametric-timed-automata-1807.07091</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/language-preservation-problems-in-parametric-timed-automata-1807.07091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/language-preservation-problems-in-parametric-timed-automata-1807.07091"/></url>
<url><loc>https://scifaro.com/en/abs/circuits-via-topoi-1807.07159</loc><lastmod>2018-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circuits-via-topoi-1807.07159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circuits-via-topoi-1807.07159"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modeling-of-robotic-cell-injection-systems-in-higher-order-logic-1807.07378</loc><lastmod>2018-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modeling-of-robotic-cell-injection-systems-in-higher-order-logic-1807.07378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modeling-of-robotic-cell-injection-systems-in-higher-order-logic-1807.07378"/></url>
<url><loc>https://scifaro.com/en/abs/towards-functorial-language-games-1807.07828</loc><lastmod>2018-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-functorial-language-games-1807.07828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-functorial-language-games-1807.07828"/></url>
<url><loc>https://scifaro.com/en/abs/learning-heuristics-for-quantified-boolean-formulas-through-deep-reinforcement-learning-1807.08058</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-heuristics-for-quantified-boolean-formulas-through-deep-reinforcement-learning-1807.08058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-heuristics-for-quantified-boolean-formulas-through-deep-reinforcement-learning-1807.08058"/></url>
<url><loc>https://scifaro.com/en/abs/delta-decision-procedures-for-exists-forall-problems-over-the-reals-1807.08137</loc><lastmod>2018-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-decision-procedures-for-exists-forall-problems-over-the-reals-1807.08137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-decision-procedures-for-exists-forall-problems-over-the-reals-1807.08137"/></url>
<url><loc>https://scifaro.com/en/abs/generating-an-atl-model-checker-using-an-attribute-grammar-1807.08267</loc><lastmod>2019-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-an-atl-model-checker-using-an-attribute-grammar-1807.08267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-an-atl-model-checker-using-an-attribute-grammar-1807.08267"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-algorithms-for-symbolic-automata-technical-report-1807.08487</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-algorithms-for-symbolic-automata-technical-report-1807.08487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-algorithms-for-symbolic-automata-technical-report-1807.08487"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-a-weak-version-of-mso-u-1807.08506</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-a-weak-version-of-mso-u-1807.08506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-a-weak-version-of-mso-u-1807.08506"/></url>
<url><loc>https://scifaro.com/en/abs/automating-verification-of-state-machines-with-reactive-designs-and-isabelle-utp-1807.08588</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-verification-of-state-machines-with-reactive-designs-and-isabelle-utp-1807.08588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-verification-of-state-machines-with-reactive-designs-and-isabelle-utp-1807.08588"/></url>
<url><loc>https://scifaro.com/en/abs/expansion-based-qbf-solving-without-recursion-1807.08964</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expansion-based-qbf-solving-without-recursion-1807.08964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expansion-based-qbf-solving-without-recursion-1807.08964"/></url>
<url><loc>https://scifaro.com/en/abs/supercompiling-string-programs-using-word-equations-as-constraints-1807.09175</loc><lastmod>2018-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supercompiling-string-programs-using-word-equations-as-constraints-1807.09175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supercompiling-string-programs-using-word-equations-as-constraints-1807.09175"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-cox-ross-rubinstein-pricing-of-european-derivatives-in-isabelle-hol-1807.09873</loc><lastmod>2018-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-cox-ross-rubinstein-pricing-of-european-derivatives-in-isabelle-hol-1807.09873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-cox-ross-rubinstein-pricing-of-european-derivatives-in-isabelle-hol-1807.09873"/></url>
<url><loc>https://scifaro.com/en/abs/a-parity-game-tale-of-two-counters-1807.10210</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parity-game-tale-of-two-counters-1807.10210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parity-game-tale-of-two-counters-1807.10210"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-logical-complexity-of-cyclic-arithmetic-1807.10248</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-logical-complexity-of-cyclic-arithmetic-1807.10248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-logical-complexity-of-cyclic-arithmetic-1807.10248"/></url>
<url><loc>https://scifaro.com/en/abs/limits-with-signed-digit-streams-1807.10492</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limits-with-signed-digit-streams-1807.10492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limits-with-signed-digit-streams-1807.10492"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-directed-homotopy-type-theory-1807.10566</loc><lastmod>2018-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-directed-homotopy-type-theory-1807.10566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-directed-homotopy-type-theory-1807.10566"/></url>
<url><loc>https://scifaro.com/en/abs/exact-synthesis-of-esop-forms-1807.11103</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-synthesis-of-esop-forms-1807.11103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-synthesis-of-esop-forms-1807.11103"/></url>
<url><loc>https://scifaro.com/en/abs/an-atemporal-model-of-physical-complexity-1807.11137</loc><lastmod>2018-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-atemporal-model-of-physical-complexity-1807.11137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-atemporal-model-of-physical-complexity-1807.11137"/></url>
<url><loc>https://scifaro.com/en/abs/a-metalanguage-for-guarded-iteration-1807.11256</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-metalanguage-for-guarded-iteration-1807.11256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-metalanguage-for-guarded-iteration-1807.11256"/></url>
<url><loc>https://scifaro.com/en/abs/who-needs-category-theory-1807.11399</loc><lastmod>2019-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/who-needs-category-theory-1807.11399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/who-needs-category-theory-1807.11399"/></url>
<url><loc>https://scifaro.com/en/abs/a-compositional-approach-for-schedulability-analysis-of-distributed-avionics-systems-1807.11570</loc><lastmod>2018-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-compositional-approach-for-schedulability-analysis-of-distributed-avionics-systems-1807.11570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-compositional-approach-for-schedulability-analysis-of-distributed-avionics-systems-1807.11570"/></url>
<url><loc>https://scifaro.com/en/abs/formal-probabilistic-analysis-of-dynamic-fault-trees-in-hol4-1807.11576</loc><lastmod>2018-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-probabilistic-analysis-of-dynamic-fault-trees-in-hol4-1807.11576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-probabilistic-analysis-of-dynamic-fault-trees-in-hol4-1807.11576"/></url>
<url><loc>https://scifaro.com/en/abs/a-parametric-framework-for-reversible-pi-calculi-1807.11800</loc><lastmod>2018-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parametric-framework-for-reversible-pi-calculi-1807.11800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parametric-framework-for-reversible-pi-calculi-1807.11800"/></url>
<url><loc>https://scifaro.com/en/abs/repairing-description-logic-ontologies-by-weakening-axioms-1808.00248</loc><lastmod>2018-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/repairing-description-logic-ontologies-by-weakening-axioms-1808.00248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/repairing-description-logic-ontologies-by-weakening-axioms-1808.00248"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-auditing-1808.00486</loc><lastmod>2018-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-auditing-1808.00486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-auditing-1808.00486"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-traces-for-systems-with-nondeterminism-probability-and-termination-1808.00923</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-traces-for-systems-with-nondeterminism-probability-and-termination-1808.00923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-traces-for-systems-with-nondeterminism-probability-and-termination-1808.00923"/></url>
<url><loc>https://scifaro.com/en/abs/remarks-on-an-article-by-rabern-et-al-1808.01239</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/remarks-on-an-article-by-rabern-et-al-1808.01239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/remarks-on-an-article-by-rabern-et-al-1808.01239"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-technical-report-1808.01599</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-technical-report-1808.01599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-technical-report-1808.01599"/></url>
<url><loc>https://scifaro.com/en/abs/query-answering-for-rough-el-ontologies-extended-technical-report-1808.01877</loc><lastmod>2018-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-answering-for-rough-el-ontologies-extended-technical-report-1808.01877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-answering-for-rough-el-ontologies-extended-technical-report-1808.01877"/></url>
<url><loc>https://scifaro.com/en/abs/metric-temporal-extensions-of-dl-lite-and-interval-rigid-names-1808.02055</loc><lastmod>2018-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metric-temporal-extensions-of-dl-lite-and-interval-rigid-names-1808.02055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metric-temporal-extensions-of-dl-lite-and-interval-rigid-names-1808.02055"/></url>
<url><loc>https://scifaro.com/en/abs/input-output-stochastic-automata-with-urgency-confluence-and-weak-determinism-1808.02777</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/input-output-stochastic-automata-with-urgency-confluence-and-weak-determinism-1808.02777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/input-output-stochastic-automata-with-urgency-confluence-and-weak-determinism-1808.02777"/></url>
<url><loc>https://scifaro.com/en/abs/relaxing-and-restraining-queries-for-obda-1808.02850</loc><lastmod>2018-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relaxing-and-restraining-queries-for-obda-1808.02850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relaxing-and-restraining-queries-for-obda-1808.02850"/></url>
<url><loc>https://scifaro.com/en/abs/coaxioms-flexible-coinductive-definitions-by-inference-systems-1808.02943</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coaxioms-flexible-coinductive-definitions-by-inference-systems-1808.02943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coaxioms-flexible-coinductive-definitions-by-inference-systems-1808.02943"/></url>
<url><loc>https://scifaro.com/en/abs/a-set-theoretic-framework-for-parallel-graph-rewriting-1808.03161</loc><lastmod>2018-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-set-theoretic-framework-for-parallel-graph-rewriting-1808.03161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-set-theoretic-framework-for-parallel-graph-rewriting-1808.03161"/></url>
<url><loc>https://scifaro.com/en/abs/metrics-for-signal-temporal-logic-formulae-1808.03315</loc><lastmod>2018-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metrics-for-signal-temporal-logic-formulae-1808.03315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metrics-for-signal-temporal-logic-formulae-1808.03315"/></url>
<url><loc>https://scifaro.com/en/abs/pre-proceedings-of-the-28th-international-symposium-on-logic-based-program-synthesis-and-transformation-lopstr-2018-1808.03326</loc><lastmod>2018-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pre-proceedings-of-the-28th-international-symposium-on-logic-based-program-synthesis-and-transformation-lopstr-2018-1808.03326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pre-proceedings-of-the-28th-international-symposium-on-logic-based-program-synthesis-and-transformation-lopstr-2018-1808.03326"/></url>
<url><loc>https://scifaro.com/en/abs/proof-nets-and-the-linear-substitution-calculus-1808.03395</loc><lastmod>2018-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-nets-and-the-linear-substitution-calculus-1808.03395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-nets-and-the-linear-substitution-calculus-1808.03395"/></url>
<url><loc>https://scifaro.com/en/abs/the-boyer-moore-waterfall-model-revisited-1808.03810</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-boyer-moore-waterfall-model-revisited-1808.03810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-boyer-moore-waterfall-model-revisited-1808.03810"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterized-complexity-view-on-description-logic-reasoning-1808.03852</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterized-complexity-view-on-description-logic-reasoning-1808.03852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterized-complexity-view-on-description-logic-reasoning-1808.03852"/></url>
<url><loc>https://scifaro.com/en/abs/proving-program-properties-as-first-order-satisfiability-1808.04111</loc><lastmod>2018-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-program-properties-as-first-order-satisfiability-1808.04111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-program-properties-as-first-order-satisfiability-1808.04111"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-metabolic-network-completion-1808.04149</loc><lastmod>2018-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-metabolic-network-completion-1808.04149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-metabolic-network-completion-1808.04149"/></url>
<url><loc>https://scifaro.com/en/abs/the-delta-framework-1808.04193</loc><lastmod>2018-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-delta-framework-1808.04193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-delta-framework-1808.04193"/></url>
<url><loc>https://scifaro.com/en/abs/proof-simplification-and-automated-theorem-proving-1808.04251</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-simplification-and-automated-theorem-proving-1808.04251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-simplification-and-automated-theorem-proving-1808.04251"/></url>
<url><loc>https://scifaro.com/en/abs/timed-context-free-temporal-logics-extended-version-1808.04271</loc><lastmod>2018-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-context-free-temporal-logics-extended-version-1808.04271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-context-free-temporal-logics-extended-version-1808.04271"/></url>
<url><loc>https://scifaro.com/en/abs/stream-reasoning-on-expressive-logics-1808.04738</loc><lastmod>2018-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stream-reasoning-on-expressive-logics-1808.04738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stream-reasoning-on-expressive-logics-1808.04738"/></url>
<url><loc>https://scifaro.com/en/abs/an-assertion-language-for-slicing-constraint-logic-languages-1808.04867</loc><lastmod>2018-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-assertion-language-for-slicing-constraint-logic-languages-1808.04867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-assertion-language-for-slicing-constraint-logic-languages-1808.04867"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-finite-structures-1808.04949</loc><lastmod>2018-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-finite-structures-1808.04949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-finite-structures-1808.04949"/></url>
<url><loc>https://scifaro.com/en/abs/frame-validity-games-and-lower-bounds-on-the-complexity-of-modal-axioms-1808.05051</loc><lastmod>2018-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frame-validity-games-and-lower-bounds-on-the-complexity-of-modal-axioms-1808.05051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frame-validity-games-and-lower-bounds-on-the-complexity-of-modal-axioms-1808.05051"/></url>
<url><loc>https://scifaro.com/en/abs/an-operational-interpretation-of-coinductive-types-1808.05059</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-operational-interpretation-of-coinductive-types-1808.05059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-operational-interpretation-of-coinductive-types-1808.05059"/></url>
<url><loc>https://scifaro.com/en/abs/formalisation-of-a-frame-stack-semantics-for-a-java-like-language-1808.05342</loc><lastmod>2018-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalisation-of-a-frame-stack-semantics-for-a-java-like-language-1808.05342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalisation-of-a-frame-stack-semantics-for-a-java-like-language-1808.05342"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-coinductive-confluence-proof-for-infinitary-lambda-calculus-1808.05481</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-coinductive-confluence-proof-for-infinitary-lambda-calculus-1808.05481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-coinductive-confluence-proof-for-infinitary-lambda-calculus-1808.05481"/></url>
<url><loc>https://scifaro.com/en/abs/complete-test-sets-and-their-approximations-1808.05750</loc><lastmod>2018-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-test-sets-and-their-approximations-1808.05750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-test-sets-and-their-approximations-1808.05750"/></url>
<url><loc>https://scifaro.com/en/abs/evolving-algebras-1993-lipari-guide-1808.06255</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evolving-algebras-1993-lipari-guide-1808.06255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evolving-algebras-1993-lipari-guide-1808.06255"/></url>
<url><loc>https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-craig-interpolation-1808.06256</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-craig-interpolation-1808.06256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-craig-interpolation-1808.06256"/></url>
<url><loc>https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-uniform-interpolation-1808.06258</loc><lastmod>2025-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-uniform-interpolation-1808.06258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-proof-theory-semi-analytic-rules-and-uniform-interpolation-1808.06258"/></url>
<url><loc>https://scifaro.com/en/abs/a-continuum-of-incomplete-intermediate-logics-1808.06284</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-continuum-of-incomplete-intermediate-logics-1808.06284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-continuum-of-incomplete-intermediate-logics-1808.06284"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-calculus-with-explicit-read-back-1808.06351</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-calculus-with-explicit-read-back-1808.06351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-calculus-with-explicit-read-back-1808.06351"/></url>
<url><loc>https://scifaro.com/en/abs/some-notes-on-the-superintuitionistic-logic-of-chequered-subsets-of-mathbb-r-infty-1808.06393</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-notes-on-the-superintuitionistic-logic-of-chequered-subsets-of-mathbb-r-infty-1808.06393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-notes-on-the-superintuitionistic-logic-of-chequered-subsets-of-mathbb-r-infty-1808.06393"/></url>
<url><loc>https://scifaro.com/en/abs/concrete-semantics-with-coq-and-coqhammer-1808.06413</loc><lastmod>2018-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concrete-semantics-with-coq-and-coqhammer-1808.06413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concrete-semantics-with-coq-and-coqhammer-1808.06413"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-25th-international-workshop-on-expressiveness-in-concurrency-and-15th-workshop-on-structural-operational-semantics-1808.08071</loc><lastmod>2018-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-25th-international-workshop-on-expressiveness-in-concurrency-and-15th-workshop-on-structural-operational-semantics-1808.08071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-25th-international-workshop-on-expressiveness-in-concurrency-and-15th-workshop-on-structural-operational-semantics-1808.08071"/></url>
<url><loc>https://scifaro.com/en/abs/functional-synthesis-via-input-output-separation-1808.08190</loc><lastmod>2018-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-synthesis-via-input-output-separation-1808.08190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-synthesis-via-input-output-separation-1808.08190"/></url>
<url><loc>https://scifaro.com/en/abs/context-free-session-types-for-applied-pi-calculus-1808.08648</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-free-session-types-for-applied-pi-calculus-1808.08648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-free-session-types-for-applied-pi-calculus-1808.08648"/></url>
<url><loc>https://scifaro.com/en/abs/trace-and-testing-metrics-on-nondeterministic-probabilistic-processes-1808.08649</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-and-testing-metrics-on-nondeterministic-probabilistic-processes-1808.08649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-and-testing-metrics-on-nondeterministic-probabilistic-processes-1808.08649"/></url>
<url><loc>https://scifaro.com/en/abs/unique-solutions-of-contractions-ccs-and-their-hol-formalisation-1808.08652</loc><lastmod>2018-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-solutions-of-contractions-ccs-and-their-hol-formalisation-1808.08652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-solutions-of-contractions-ccs-and-their-hol-formalisation-1808.08652"/></url>
<url><loc>https://scifaro.com/en/abs/clausal-abstraction-for-dqbf-full-version-1808.08759</loc><lastmod>2019-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clausal-abstraction-for-dqbf-full-version-1808.08759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clausal-abstraction-for-dqbf-full-version-1808.08759"/></url>
<url><loc>https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-full-version-1808.09028</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-full-version-1808.09028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-full-version-1808.09028"/></url>
<url><loc>https://scifaro.com/en/abs/nash-equilibrium-and-bisimulation-invariance-1808.09213</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nash-equilibrium-and-bisimulation-invariance-1808.09213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nash-equilibrium-and-bisimulation-invariance-1808.09213"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-1808.09361</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-1808.09361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-distributability-of-mobile-ambients-1808.09361"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-synthesis-branching-logics-and-parameterized-systems-1808.09430</loc><lastmod>2018-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-synthesis-branching-logics-and-parameterized-systems-1808.09430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-synthesis-branching-logics-and-parameterized-systems-1808.09430"/></url>
<url><loc>https://scifaro.com/en/abs/comparison-of-two-theorem-provers-isabelle-hol-and-coq-1808.09701</loc><lastmod>2018-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparison-of-two-theorem-provers-isabelle-hol-and-coq-1808.09701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparison-of-two-theorem-provers-isabelle-hol-and-coq-1808.09701"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-justification-logic-with-constant-domain-semantics-1808.09875</loc><lastmod>2018-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-justification-logic-with-constant-domain-semantics-1808.09875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-justification-logic-with-constant-domain-semantics-1808.09875"/></url>
<url><loc>https://scifaro.com/en/abs/types-of-fireballs-extended-version-1808.10389</loc><lastmod>2018-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/types-of-fireballs-extended-version-1808.10389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/types-of-fireballs-extended-version-1808.10389"/></url>
<url><loc>https://scifaro.com/en/abs/finite-ltl-synthesis-with-environment-assumptions-and-quality-measures-1808.10831</loc><lastmod>2018-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-ltl-synthesis-with-environment-assumptions-and-quality-measures-1808.10831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-ltl-synthesis-with-environment-assumptions-and-quality-measures-1808.10831"/></url>
<url><loc>https://scifaro.com/en/abs/the-data-complexity-of-ontology-mediated-queries-with-closed-predicates-1809.00134</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-data-complexity-of-ontology-mediated-queries-with-closed-predicates-1809.00134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-data-complexity-of-ontology-mediated-queries-with-closed-predicates-1809.00134"/></url>
<url><loc>https://scifaro.com/en/abs/linear-temporal-justification-logics-with-past-operators-1809.00167</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-temporal-justification-logics-with-past-operators-1809.00167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-temporal-justification-logics-with-past-operators-1809.00167"/></url>
<url><loc>https://scifaro.com/en/abs/improving-convergence-rate-of-ic3-1809.00503</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-convergence-rate-of-ic3-1809.00503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-convergence-rate-of-ic3-1809.00503"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-algebraic-tool-for-reasoning-with-knowledge-based-systems-1809.00508</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-algebraic-tool-for-reasoning-with-knowledge-based-systems-1809.00508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-algebraic-tool-for-reasoning-with-knowledge-based-systems-1809.00508"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-a-geometry-algorithm-a-quest-for-abstract-views-and-symmetry-in-coq-proofs-1809.00559</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-a-geometry-algorithm-a-quest-for-abstract-views-and-symmetry-in-coq-proofs-1809.00559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-a-geometry-algorithm-a-quest-for-abstract-views-and-symmetry-in-coq-proofs-1809.00559"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-the-consistent-hoare-powerdomains-over-dcpos-1809.00772</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-the-consistent-hoare-powerdomains-over-dcpos-1809.00772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-the-consistent-hoare-powerdomains-over-dcpos-1809.00772"/></url>
<url><loc>https://scifaro.com/en/abs/an-automatic-tool-for-checking-multi-party-contracts-1809.01103</loc><lastmod>2018-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automatic-tool-for-checking-multi-party-contracts-1809.01103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automatic-tool-for-checking-multi-party-contracts-1809.01103"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-ninth-international-symposium-on-games-automata-logics-and-formal-verification-1809.02416</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-ninth-international-symposium-on-games-automata-logics-and-formal-verification-1809.02416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-ninth-international-symposium-on-games-automata-logics-and-formal-verification-1809.02416"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-call-by-value-b-ohm-trees-in-light-of-their-taylor-expansion-1809.02659</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-call-by-value-b-ohm-trees-in-light-of-their-taylor-expansion-1809.02659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-call-by-value-b-ohm-trees-in-light-of-their-taylor-expansion-1809.02659"/></url>
<url><loc>https://scifaro.com/en/abs/affine-sessions-1809.02781</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/affine-sessions-1809.02781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/affine-sessions-1809.02781"/></url>
<url><loc>https://scifaro.com/en/abs/well-quasiorders-and-hierarchy-theory-1809.02941</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/well-quasiorders-and-hierarchy-theory-1809.02941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/well-quasiorders-and-hierarchy-theory-1809.02941"/></url>
<url><loc>https://scifaro.com/en/abs/classical-proofs-as-parallel-programs-1809.03094</loc><lastmod>2018-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-proofs-as-parallel-programs-1809.03094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-proofs-as-parallel-programs-1809.03094"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplicial-complex-model-for-dynamic-epistemic-logic-to-study-distributed-task-computability-1809.03095</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplicial-complex-model-for-dynamic-epistemic-logic-to-study-distributed-task-computability-1809.03095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplicial-complex-model-for-dynamic-epistemic-logic-to-study-distributed-task-computability-1809.03095"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-of-bdd-based-parity-game-solvers-1809.03097</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-of-bdd-based-parity-game-solvers-1809.03097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-of-bdd-based-parity-game-solvers-1809.03097"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-well-structured-broadcast-networks-1809.03099</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-well-structured-broadcast-networks-1809.03099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-well-structured-broadcast-networks-1809.03099"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logic-and-model-checking-for-operator-precedence-languages-1809.03100</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logic-and-model-checking-for-operator-precedence-languages-1809.03100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logic-and-model-checking-for-operator-precedence-languages-1809.03100"/></url>
<url><loc>https://scifaro.com/en/abs/one-pass-and-tree-shaped-tableau-systems-for-tptl-and-tptlb-past-1809.03101</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-pass-and-tree-shaped-tableau-systems-for-tptl-and-tptlb-past-1809.03101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-pass-and-tree-shaped-tableau-systems-for-tptl-and-tptlb-past-1809.03101"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-timeline-based-planning-over-dense-temporal-domains-exploring-the-middle-ground-1809.03103</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-timeline-based-planning-over-dense-temporal-domains-exploring-the-middle-ground-1809.03103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-timeline-based-planning-over-dense-temporal-domains-exploring-the-middle-ground-1809.03103"/></url>
<url><loc>https://scifaro.com/en/abs/on-computing-the-measures-of-first-order-definable-sets-of-trees-1809.03104</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computing-the-measures-of-first-order-definable-sets-of-trees-1809.03104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computing-the-measures-of-first-order-definable-sets-of-trees-1809.03104"/></url>
<url><loc>https://scifaro.com/en/abs/on-finding-a-first-order-sentence-consistent-with-a-sample-of-strings-1809.03106</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finding-a-first-order-sentence-consistent-with-a-sample-of-strings-1809.03106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finding-a-first-order-sentence-consistent-with-a-sample-of-strings-1809.03106"/></url>
<url><loc>https://scifaro.com/en/abs/multi-weighted-markov-decision-processes-with-reachability-objectives-1809.03107</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-weighted-markov-decision-processes-with-reachability-objectives-1809.03107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-weighted-markov-decision-processes-with-reachability-objectives-1809.03107"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-in-formal-verification-of-a-java-program-1809.03162</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-in-formal-verification-of-a-java-program-1809.03162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-in-formal-verification-of-a-java-program-1809.03162"/></url>
<url><loc>https://scifaro.com/en/abs/finite-satisfiability-of-unary-negation-fragment-with-transitivity-1809.03245</loc><lastmod>2019-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-satisfiability-of-unary-negation-fragment-with-transitivity-1809.03245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-satisfiability-of-unary-negation-fragment-with-transitivity-1809.03245"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-multimodal-logics-1809.03254</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-multimodal-logics-1809.03254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-multimodal-logics-1809.03254"/></url>
<url><loc>https://scifaro.com/en/abs/model-theory-of-monadic-predicate-logic-with-the-infinity-quantifier-1809.03262</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-theory-of-monadic-predicate-logic-with-the-infinity-quantifier-1809.03262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-theory-of-monadic-predicate-logic-with-the-infinity-quantifier-1809.03262"/></url>
<url><loc>https://scifaro.com/en/abs/monte-carlo-tree-search-for-verifying-reachability-in-markov-decision-processes-1809.03299</loc><lastmod>2018-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monte-carlo-tree-search-for-verifying-reachability-in-markov-decision-processes-1809.03299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monte-carlo-tree-search-for-verifying-reachability-in-markov-decision-processes-1809.03299"/></url>
<url><loc>https://scifaro.com/en/abs/benchmarking-of-java-verification-tools-at-the-software-verification-competition-sv-comp-1809.03739</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmarking-of-java-verification-tools-at-the-software-verification-competition-sv-comp-1809.03739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmarking-of-java-verification-tools-at-the-software-verification-competition-sv-comp-1809.03739"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-the-weak-1809.03896</loc><lastmod>2018-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-the-weak-1809.03896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-the-weak-1809.03896"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-logic-assigned-to-automata-1809.04456</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-logic-assigned-to-automata-1809.04456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-logic-assigned-to-automata-1809.04456"/></url>
<url><loc>https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-ii-1809.04468</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-ii-1809.04468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-integrated-first-order-theory-of-points-and-intervals-over-linear-orders-part-ii-1809.04468"/></url>
<url><loc>https://scifaro.com/en/abs/a-curry-howard-correspondence-for-the-minimal-fragment-of-l-ukasiewicz-logic-1809.04492</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-curry-howard-correspondence-for-the-minimal-fragment-of-l-ukasiewicz-logic-1809.04492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-curry-howard-correspondence-for-the-minimal-fragment-of-l-ukasiewicz-logic-1809.04492"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-5th-workshop-on-horn-clauses-for-verification-and-synthesis-1809.04554</loc><lastmod>2018-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-5th-workshop-on-horn-clauses-for-verification-and-synthesis-1809.04554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-5th-workshop-on-horn-clauses-for-verification-and-synthesis-1809.04554"/></url>
<url><loc>https://scifaro.com/en/abs/towards-coinductive-theory-exploration-in-horn-clause-logic-position-paper-1809.04771</loc><lastmod>2018-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-coinductive-theory-exploration-in-horn-clause-logic-position-paper-1809.04771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-coinductive-theory-exploration-in-horn-clause-logic-position-paper-1809.04771"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-functional-presentation-and-an-inductive-correctness-proof-of-the-horn-algorithm-1809.04772</loc><lastmod>2018-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-functional-presentation-and-an-inductive-correctness-proof-of-the-horn-algorithm-1809.04772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-functional-presentation-and-an-inductive-correctness-proof-of-the-horn-algorithm-1809.04772"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-representations-of-continuous-domains-and-continuous-l-domains-based-on-closure-spaces-1809.05049</loc><lastmod>2022-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-representations-of-continuous-domains-and-continuous-l-domains-based-on-closure-spaces-1809.05049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-representations-of-continuous-domains-and-continuous-l-domains-based-on-closure-spaces-1809.05049"/></url>
<url><loc>https://scifaro.com/en/abs/qpcf-higher-order-languages-and-quantum-circuits-1809.05723</loc><lastmod>2018-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qpcf-higher-order-languages-and-quantum-circuits-1809.05723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qpcf-higher-order-languages-and-quantum-circuits-1809.05723"/></url>
<url><loc>https://scifaro.com/en/abs/towards-abstraction-in-asp-with-an-application-on-reasoning-about-agent-policies-1809.06638</loc><lastmod>2018-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-abstraction-in-asp-with-an-application-on-reasoning-about-agent-policies-1809.06638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-abstraction-in-asp-with-an-application-on-reasoning-about-agent-policies-1809.06638"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-convex-logic-fragment-for-learning-and-reasoning-1809.06778</loc><lastmod>2018-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-convex-logic-fragment-for-learning-and-reasoning-1809.06778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-convex-logic-fragment-for-learning-and-reasoning-1809.06778"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-reachability-for-open-interval-markov-chains-1809.06954</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-reachability-for-open-interval-markov-chains-1809.06954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-reachability-for-open-interval-markov-chains-1809.06954"/></url>
<url><loc>https://scifaro.com/en/abs/complete-additivity-and-modal-incompleteness-1809.07542</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-additivity-and-modal-incompleteness-1809.07542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-additivity-and-modal-incompleteness-1809.07542"/></url>
<url><loc>https://scifaro.com/en/abs/on-sets-of-terms-having-a-given-intersection-type-1809.08169</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sets-of-terms-having-a-given-intersection-type-1809.08169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sets-of-terms-having-a-given-intersection-type-1809.08169"/></url>
<url><loc>https://scifaro.com/en/abs/kishon-s-poker-game-1809.08576</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kishon-s-poker-game-1809.08576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kishon-s-poker-game-1809.08576"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-by-gluing-for-free-lambda-theories-1809.08646</loc><lastmod>2018-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-by-gluing-for-free-lambda-theories-1809.08646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-by-gluing-for-free-lambda-theories-1809.08646"/></url>
<url><loc>https://scifaro.com/en/abs/representation-theory-of-compact-metric-spaces-and-computational-complexity-of-continuous-data-1809.08695</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-theory-of-compact-metric-spaces-and-computational-complexity-of-continuous-data-1809.08695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-theory-of-compact-metric-spaces-and-computational-complexity-of-continuous-data-1809.08695"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-bisimulations-using-coreflections-and-open-morphisms-1809.09278</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-bisimulations-using-coreflections-and-open-morphisms-1809.09278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-bisimulations-using-coreflections-and-open-morphisms-1809.09278"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-conditions-for-antichain-property-in-consistency-restoring-prolog-1809.09319</loc><lastmod>2018-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-conditions-for-antichain-property-in-consistency-restoring-prolog-1809.09319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-conditions-for-antichain-property-in-consistency-restoring-prolog-1809.09319"/></url>
<url><loc>https://scifaro.com/en/abs/logic-program-proportions-1809.09938</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-program-proportions-1809.09938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-program-proportions-1809.09938"/></url>
<url><loc>https://scifaro.com/en/abs/operations-on-partial-orders-1809.10620</loc><lastmod>2018-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operations-on-partial-orders-1809.10620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operations-on-partial-orders-1809.10620"/></url>
<url><loc>https://scifaro.com/en/abs/multi-scale-verification-of-distributed-synchronisation-1809.10655</loc><lastmod>2018-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-scale-verification-of-distributed-synchronisation-1809.10655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-scale-verification-of-distributed-synchronisation-1809.10655"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-coupling-the-i-dlv-grounder-with-asp-solvers-1810.00041</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-coupling-the-i-dlv-grounder-with-asp-solvers-1810.00041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-coupling-the-i-dlv-grounder-with-asp-solvers-1810.00041"/></url>
<url><loc>https://scifaro.com/en/abs/quantifier-elimination-with-structural-learning-1810.00160</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifier-elimination-with-structural-learning-1810.00160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifier-elimination-with-structural-learning-1810.00160"/></url>
<url><loc>https://scifaro.com/en/abs/anthem-transforming-gringo-programs-into-first-order-theories-preliminary-report-1810.00453</loc><lastmod>2018-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anthem-transforming-gringo-programs-into-first-order-theories-preliminary-report-1810.00453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anthem-transforming-gringo-programs-into-first-order-theories-preliminary-report-1810.00453"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-type-systems-for-deadlock-freedom-1810.00635</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-type-systems-for-deadlock-freedom-1810.00635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-type-systems-for-deadlock-freedom-1810.00635"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-process-algebra-is-reversible-1810.00868</loc><lastmod>2018-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-is-reversible-1810.00868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-is-reversible-1810.00868"/></url>
<url><loc>https://scifaro.com/en/abs/omega-regular-objectives-in-model-free-reinforcement-learning-1810.00950</loc><lastmod>2018-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omega-regular-objectives-in-model-free-reinforcement-learning-1810.00950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omega-regular-objectives-in-model-free-reinforcement-learning-1810.00950"/></url>
<url><loc>https://scifaro.com/en/abs/proof-nets-coends-and-the-yoneda-isomorphism-1810.01252</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-nets-coends-and-the-yoneda-isomorphism-1810.01252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-nets-coends-and-the-yoneda-isomorphism-1810.01252"/></url>
<url><loc>https://scifaro.com/en/abs/cutting-diamonds-temporal-dls-with-probabilistic-distributions-over-data-1810.01516</loc><lastmod>2018-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cutting-diamonds-temporal-dls-with-probabilistic-distributions-over-data-1810.01516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cutting-diamonds-temporal-dls-with-probabilistic-distributions-over-data-1810.01516"/></url>
<url><loc>https://scifaro.com/en/abs/classical-linear-logic-cobordisms-and-categorical-semantics-of-categorial-grammars-1810.02047</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-linear-logic-cobordisms-and-categorical-semantics-of-categorial-grammars-1810.02047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-linear-logic-cobordisms-and-categorical-semantics-of-categorial-grammars-1810.02047"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-interaction-and-concurrency-experience-1810.02053</loc><lastmod>2018-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-interaction-and-concurrency-experience-1810.02053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-interaction-and-concurrency-experience-1810.02053"/></url>
<url><loc>https://scifaro.com/en/abs/a-single-approach-to-decide-chase-termination-on-linear-existential-rules-1810.02132</loc><lastmod>2018-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-single-approach-to-decide-chase-termination-on-linear-existential-rules-1810.02132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-single-approach-to-decide-chase-termination-on-linear-existential-rules-1810.02132"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-logic-with-short-circuit-evaluation-a-non-commutative-and-a-commutative-variant-1810.02142</loc><lastmod>2026-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-logic-with-short-circuit-evaluation-a-non-commutative-and-a-commutative-variant-1810.02142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-logic-with-short-circuit-evaluation-a-non-commutative-and-a-commutative-variant-1810.02142"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-combinators-as-fixed-points-of-higher-order-fixed-point-generators-1810.02239</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-combinators-as-fixed-points-of-higher-order-fixed-point-generators-1810.02239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-combinators-as-fixed-points-of-higher-order-fixed-point-generators-1810.02239"/></url>
<url><loc>https://scifaro.com/en/abs/recursion-schemes-discrete-differential-equations-and-characterization-of-polynomial-time-computation-1810.02241</loc><lastmod>2018-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursion-schemes-discrete-differential-equations-and-characterization-of-polynomial-time-computation-1810.02241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursion-schemes-discrete-differential-equations-and-characterization-of-polynomial-time-computation-1810.02241"/></url>
<url><loc>https://scifaro.com/en/abs/lower-and-upper-conditioning-in-quantum-bayesian-theory-1810.02438</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-and-upper-conditioning-in-quantum-bayesian-theory-1810.02438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-and-upper-conditioning-in-quantum-bayesian-theory-1810.02438"/></url>
<url><loc>https://scifaro.com/en/abs/global-types-for-open-systems-1810.02468</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-types-for-open-systems-1810.02468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-types-for-open-systems-1810.02468"/></url>
<url><loc>https://scifaro.com/en/abs/realisability-of-pomsets-via-communicating-automata-1810.02469</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realisability-of-pomsets-via-communicating-automata-1810.02469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realisability-of-pomsets-via-communicating-automata-1810.02469"/></url>
<url><loc>https://scifaro.com/en/abs/on-urgency-in-asynchronous-timed-session-types-1810.02472</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-urgency-in-asynchronous-timed-session-types-1810.02472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-urgency-in-asynchronous-timed-session-types-1810.02472"/></url>
<url><loc>https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1810.02769</loc><lastmod>2018-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1810.02769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalition-and-group-announcement-logic-1810.02769"/></url>
<url><loc>https://scifaro.com/en/abs/system-consequence-1810.02929</loc><lastmod>2018-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-consequence-1810.02929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-consequence-1810.02929"/></url>
<url><loc>https://scifaro.com/en/abs/1-safe-petri-nets-and-special-cube-complexes-equivalence-and-applications-1810.03395</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/1-safe-petri-nets-and-special-cube-complexes-equivalence-and-applications-1810.03395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/1-safe-petri-nets-and-special-cube-complexes-equivalence-and-applications-1810.03395"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-filesystems-in-the-acl2-theorem-prover-an-application-to-fat32-1810.04309</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-filesystems-in-the-acl2-theorem-prover-an-application-to-fat32-1810.04309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-filesystems-in-the-acl2-theorem-prover-an-application-to-fat32-1810.04309"/></url>
<url><loc>https://scifaro.com/en/abs/trapezoidal-generalization-over-linear-constraints-1810.04310</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trapezoidal-generalization-over-linear-constraints-1810.04310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trapezoidal-generalization-over-linear-constraints-1810.04310"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-sat-library-integration-using-abstract-stobjs-1810.04311</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-sat-library-integration-using-abstract-stobjs-1810.04311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-sat-library-integration-using-abstract-stobjs-1810.04311"/></url>
<url><loc>https://scifaro.com/en/abs/using-acl2-in-the-design-of-efficient-verifiable-data-structures-for-high-assurance-systems-1810.04312</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-acl2-in-the-design-of-efficient-verifiable-data-structures-for-high-assurance-systems-1810.04312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-acl2-in-the-design-of-efficient-verifiable-data-structures-for-high-assurance-systems-1810.04312"/></url>
<url><loc>https://scifaro.com/en/abs/adding-32-bit-mode-to-the-acl2-model-of-the-x86-isa-1810.04313</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-32-bit-mode-to-the-acl2-model-of-the-x86-isa-1810.04313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-32-bit-mode-to-the-acl2-model-of-the-x86-isa-1810.04313"/></url>
<url><loc>https://scifaro.com/en/abs/the-fundamental-theorem-of-algebra-in-acl2-1810.04314</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fundamental-theorem-of-algebra-in-acl2-1810.04314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fundamental-theorem-of-algebra-in-acl2-1810.04314"/></url>
<url><loc>https://scifaro.com/en/abs/real-vector-spaces-and-the-cauchy-schwarz-inequality-in-acl2-r-1810.04315</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-vector-spaces-and-the-cauchy-schwarz-inequality-in-acl2-r-1810.04315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-vector-spaces-and-the-cauchy-schwarz-inequality-in-acl2-r-1810.04315"/></url>
<url><loc>https://scifaro.com/en/abs/convex-functions-in-acl2-r-1810.04316</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convex-functions-in-acl2-r-1810.04316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convex-functions-in-acl2-r-1810.04316"/></url>
<url><loc>https://scifaro.com/en/abs/smtlink-2-0-1810.04317</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smtlink-2-0-1810.04317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smtlink-2-0-1810.04317"/></url>
<url><loc>https://scifaro.com/en/abs/hint-orchestration-using-acl2-s-simplifier-1810.04318</loc><lastmod>2018-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hint-orchestration-using-acl2-s-simplifier-1810.04318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hint-orchestration-using-acl2-s-simplifier-1810.04318"/></url>
<url><loc>https://scifaro.com/en/abs/defind-a-protege-plugin-for-computing-concept-definitions-in-el-ontologies-1810.04363</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defind-a-protege-plugin-for-computing-concept-definitions-in-el-ontologies-1810.04363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defind-a-protege-plugin-for-computing-concept-definitions-in-el-ontologies-1810.04363"/></url>
<url><loc>https://scifaro.com/en/abs/a-van-benthem-theorem-for-quantitative-probabilistic-modal-logic-1810.04722</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-quantitative-probabilistic-modal-logic-1810.04722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-quantitative-probabilistic-modal-logic-1810.04722"/></url>
<url><loc>https://scifaro.com/en/abs/recursion-schemes-the-mso-logic-and-the-u-quantifier-1810.04763</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursion-schemes-the-mso-logic-and-the-u-quantifier-1810.04763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursion-schemes-the-mso-logic-and-the-u-quantifier-1810.04763"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-conceptual-structures-1810.04774</loc><lastmod>2018-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-conceptual-structures-1810.04774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-conceptual-structures-1810.04774"/></url>
<url><loc>https://scifaro.com/en/abs/model-based-safety-and-security-engineering-1810.04866</loc><lastmod>2019-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-based-safety-and-security-engineering-1810.04866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-based-safety-and-security-engineering-1810.04866"/></url>
<url><loc>https://scifaro.com/en/abs/dialectical-logic-the-process-calculus-1810.05010</loc><lastmod>2018-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dialectical-logic-the-process-calculus-1810.05010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dialectical-logic-the-process-calculus-1810.05010"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-international-workshop-on-classical-logic-and-computation-1810.05392</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-international-workshop-on-classical-logic-and-computation-1810.05392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-international-workshop-on-classical-logic-and-computation-1810.05392"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-interpolation-for-propositional-and-modal-team-logics-1810.05395</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-interpolation-for-propositional-and-modal-team-logics-1810.05395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-interpolation-for-propositional-and-modal-team-logics-1810.05395"/></url>
<url><loc>https://scifaro.com/en/abs/the-effects-of-adding-reachability-predicates-in-quantifier-free-separation-logic-1810.05410</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-effects-of-adding-reachability-predicates-in-quantifier-free-separation-logic-1810.05410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-effects-of-adding-reachability-predicates-in-quantifier-free-separation-logic-1810.05410"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-correct-and-efficient-implementation-of-simulation-and-verification-tools-for-probabilistic-ntcc-1810.05495</loc><lastmod>2018-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-correct-and-efficient-implementation-of-simulation-and-verification-tools-for-probabilistic-ntcc-1810.05495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-correct-and-efficient-implementation-of-simulation-and-verification-tools-for-probabilistic-ntcc-1810.05495"/></url>
<url><loc>https://scifaro.com/en/abs/defunt-a-tool-for-automating-termination-proofs-by-using-the-community-books-extended-abstract-1810.05666</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defunt-a-tool-for-automating-termination-proofs-by-using-the-community-books-extended-abstract-1810.05666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defunt-a-tool-for-automating-termination-proofs-by-using-the-community-books-extended-abstract-1810.05666"/></url>
<url><loc>https://scifaro.com/en/abs/formal-concept-analysis-with-many-sorted-attributes-1810.05703</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-concept-analysis-with-many-sorted-attributes-1810.05703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-concept-analysis-with-many-sorted-attributes-1810.05703"/></url>
<url><loc>https://scifaro.com/en/abs/combining-fragments-of-classical-logic-when-are-interaction-principles-needed-1810.05879</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-fragments-of-classical-logic-when-are-interaction-principles-needed-1810.05879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-fragments-of-classical-logic-when-are-interaction-principles-needed-1810.05879"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-dialectical-nets-1810.05961</loc><lastmod>2018-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-dialectical-nets-1810.05961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-dialectical-nets-1810.05961"/></url>
<url><loc>https://scifaro.com/en/abs/cyber-physical-systems-a-new-formal-paradigm-to-model-redundancy-and-resiliency-1810.06911</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyber-physical-systems-a-new-formal-paradigm-to-model-redundancy-and-resiliency-1810.06911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyber-physical-systems-a-new-formal-paradigm-to-model-redundancy-and-resiliency-1810.06911"/></url>
<url><loc>https://scifaro.com/en/abs/simple-game-semantics-and-day-convolution-1810.06991</loc><lastmod>2018-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-game-semantics-and-day-convolution-1810.06991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-game-semantics-and-day-convolution-1810.06991"/></url>
<url><loc>https://scifaro.com/en/abs/admissible-tools-in-the-kitchen-of-intuitionistic-logic-1810.07372</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/admissible-tools-in-the-kitchen-of-intuitionistic-logic-1810.07372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/admissible-tools-in-the-kitchen-of-intuitionistic-logic-1810.07372"/></url>
<url><loc>https://scifaro.com/en/abs/fast-cut-elimination-using-proof-terms-an-empirical-study-1810.07373</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-cut-elimination-using-proof-terms-an-empirical-study-1810.07373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-cut-elimination-using-proof-terms-an-empirical-study-1810.07373"/></url>
<url><loc>https://scifaro.com/en/abs/validating-back-links-of-folid-cyclic-pre-proofs-1810.07374</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/validating-back-links-of-folid-cyclic-pre-proofs-1810.07374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/validating-back-links-of-folid-cyclic-pre-proofs-1810.07374"/></url>
<url><loc>https://scifaro.com/en/abs/progress-justness-and-fairness-1810.07414</loc><lastmod>2019-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progress-justness-and-fairness-1810.07414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progress-justness-and-fairness-1810.07414"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatising-infinitary-probabilistic-weak-bisimilarity-of-finite-state-behaviours-1810.07488</loc><lastmod>2018-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatising-infinitary-probabilistic-weak-bisimilarity-of-finite-state-behaviours-1810.07488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatising-infinitary-probabilistic-weak-bisimilarity-of-finite-state-behaviours-1810.07488"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-many-valued-logic-in-lambda-calculus-1810.07667</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-many-valued-logic-in-lambda-calculus-1810.07667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-many-valued-logic-in-lambda-calculus-1810.07667"/></url>
<url><loc>https://scifaro.com/en/abs/when-can-we-answer-queries-using-result-bounded-data-interfaces-1810.07822</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-can-we-answer-queries-using-result-bounded-data-interfaces-1810.07822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-can-we-answer-queries-using-result-bounded-data-interfaces-1810.07822"/></url>
<url><loc>https://scifaro.com/en/abs/codensity-lifting-of-monads-and-its-dual-1810.07972</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/codensity-lifting-of-monads-and-its-dual-1810.07972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/codensity-lifting-of-monads-and-its-dual-1810.07972"/></url>
<url><loc>https://scifaro.com/en/abs/toward-a-uniform-approach-to-the-unfolding-of-nets-1810.08038</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-a-uniform-approach-to-the-unfolding-of-nets-1810.08038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-a-uniform-approach-to-the-unfolding-of-nets-1810.08038"/></url>
<url><loc>https://scifaro.com/en/abs/description-of-sup-and-inf-preserving-aggregation-functions-via-families-of-clusters-in-data-tables-1810.08040</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/description-of-sup-and-inf-preserving-aggregation-functions-via-families-of-clusters-in-data-tables-1810.08040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/description-of-sup-and-inf-preserving-aggregation-functions-via-families-of-clusters-in-data-tables-1810.08040"/></url>
<url><loc>https://scifaro.com/en/abs/the-institutional-approach-1810.08074</loc><lastmod>2018-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-institutional-approach-1810.08074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-institutional-approach-1810.08074"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-theory-for-data-linkage-1810.08096</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-theory-for-data-linkage-1810.08096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-theory-for-data-linkage-1810.08096"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-integration-in-the-information-flow-framework-1810.08236</loc><lastmod>2018-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-integration-in-the-information-flow-framework-1810.08236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-integration-in-the-information-flow-framework-1810.08236"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-computability-theory-via-partial-recursive-functions-1810.08380</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-computability-theory-via-partial-recursive-functions-1810.08380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-computability-theory-via-partial-recursive-functions-1810.08380"/></url>
<url><loc>https://scifaro.com/en/abs/direct-and-binary-direct-bases-for-one-set-updates-of-a-closure-system-1810.08684</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/direct-and-binary-direct-bases-for-one-set-updates-of-a-closure-system-1810.08684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/direct-and-binary-direct-bases-for-one-set-updates-of-a-closure-system-1810.08684"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-18th-refinement-workshop-1810.08739</loc><lastmod>2018-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-18th-refinement-workshop-1810.08739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-18th-refinement-workshop-1810.08739"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-expressivity-of-branching-and-alternating-time-temporal-logics-with-finitely-many-variables-1810.09142</loc><lastmod>2019-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-expressivity-of-branching-and-alternating-time-temporal-logics-with-finitely-many-variables-1810.09142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-expressivity-of-branching-and-alternating-time-temporal-logics-with-finitely-many-variables-1810.09142"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-simulations-by-matrices-1810.09146</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-simulations-by-matrices-1810.09146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-simulations-by-matrices-1810.09146"/></url>
<url><loc>https://scifaro.com/en/abs/ordering-strict-partial-orders-to-model-behavioral-refinement-1810.09615</loc><lastmod>2018-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordering-strict-partial-orders-to-model-behavioral-refinement-1810.09615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordering-strict-partial-orders-to-model-behavioral-refinement-1810.09615"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-proof-certification-framework-for-modal-logic-1810.10257</loc><lastmod>2019-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-proof-certification-framework-for-modal-logic-1810.10257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-proof-certification-framework-for-modal-logic-1810.10257"/></url>
<url><loc>https://scifaro.com/en/abs/one-variable-logic-meets-presburger-arithmetic-1810.10899</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-variable-logic-meets-presburger-arithmetic-1810.10899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-variable-logic-meets-presburger-arithmetic-1810.10899"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-parallel-quantum-programs-1810.11334</loc><lastmod>2019-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-parallel-quantum-programs-1810.11334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-parallel-quantum-programs-1810.11334"/></url>
<url><loc>https://scifaro.com/en/abs/fixpoint-games-on-continuous-lattices-1810.11404</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixpoint-games-on-continuous-lattices-1810.11404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixpoint-games-on-continuous-lattices-1810.11404"/></url>
<url><loc>https://scifaro.com/en/abs/formal-proofs-of-tarjan-s-algorithm-in-why3-coq-and-isabelle-1810.11979</loc><lastmod>2018-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-proofs-of-tarjan-s-algorithm-in-why3-coq-and-isabelle-1810.11979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-proofs-of-tarjan-s-algorithm-in-why3-coq-and-isabelle-1810.11979"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-refutation-of-spurious-bug-reports-in-the-clang-static-analyzer-1810.12041</loc><lastmod>2018-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-refutation-of-spurious-bug-reports-in-the-clang-static-analyzer-1810.12041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-refutation-of-spurious-bug-reports-in-the-clang-static-analyzer-1810.12041"/></url>
<url><loc>https://scifaro.com/en/abs/an-optimal-construction-for-the-barthelmann-schwentick-normal-form-on-classes-of-structures-of-bounded-degree-1810.12077</loc><lastmod>2018-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-optimal-construction-for-the-barthelmann-schwentick-normal-form-on-classes-of-structures-of-bounded-degree-1810.12077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-optimal-construction-for-the-barthelmann-schwentick-normal-form-on-classes-of-structures-of-bounded-degree-1810.12077"/></url>
<url><loc>https://scifaro.com/en/abs/the-fole-table-1810.12100</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fole-table-1810.12100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fole-table-1810.12100"/></url>
<url><loc>https://scifaro.com/en/abs/a-comparison-of-encodings-for-cardinality-constraints-in-a-sat-solver-1810.12975</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comparison-of-encodings-for-cardinality-constraints-in-a-sat-solver-1810.12975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comparison-of-encodings-for-cardinality-constraints-in-a-sat-solver-1810.12975"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-ltl-decentralized-monitoring-framework-using-formula-simplification-table-1810.13129</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-ltl-decentralized-monitoring-framework-using-formula-simplification-table-1810.13129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-ltl-decentralized-monitoring-framework-using-formula-simplification-table-1810.13129"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-as-path-type-for-guarded-recursive-types-1810.13261</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-as-path-type-for-guarded-recursive-types-1810.13261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-as-path-type-for-guarded-recursive-types-1810.13261"/></url>
<url><loc>https://scifaro.com/en/abs/finite-relation-algebras-with-normal-representations-1810.13335</loc><lastmod>2018-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-relation-algebras-with-normal-representations-1810.13335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-relation-algebras-with-normal-representations-1810.13335"/></url>
<url><loc>https://scifaro.com/en/abs/structured-parallel-programming-1810.13446</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-parallel-programming-1810.13446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-parallel-programming-1810.13446"/></url>
<url><loc>https://scifaro.com/en/abs/separation-logic-with-linearly-compositional-inductive-predicates-and-set-data-constraints-1811.00699</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-logic-with-linearly-compositional-inductive-predicates-and-set-data-constraints-1811.00699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-logic-with-linearly-compositional-inductive-predicates-and-set-data-constraints-1811.00699"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-lazy-set-object-1811.00756</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-lazy-set-object-1811.00756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-lazy-set-object-1811.00756"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-dissertation-summary-1811.01014</loc><lastmod>2018-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-dissertation-summary-1811.01014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-the-l-o-s-tarski-preservation-theorem-dissertation-summary-1811.01014"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-process-algebra-to-unifying-quantum-and-classical-computing-1811.01070</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-to-unifying-quantum-and-classical-computing-1811.01070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-to-unifying-quantum-and-classical-computing-1811.01070"/></url>
<url><loc>https://scifaro.com/en/abs/the-iff-approach-to-the-lattice-of-theories-1811.01144</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-iff-approach-to-the-lattice-of-theories-1811.01144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-iff-approach-to-the-lattice-of-theories-1811.01144"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-and-typing-for-cedille-core-1811.01318</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-and-typing-for-cedille-core-1811.01318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-and-typing-for-cedille-core-1811.01318"/></url>
<url><loc>https://scifaro.com/en/abs/putting-the-agents-back-in-the-domain-a-two-sorted-term-modal-logic-1811.01590</loc><lastmod>2018-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/putting-the-agents-back-in-the-domain-a-two-sorted-term-modal-logic-1811.01590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/putting-the-agents-back-in-the-domain-a-two-sorted-term-modal-logic-1811.01590"/></url>
<url><loc>https://scifaro.com/en/abs/the-external-interface-for-extending-wasp-1811.01692</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-external-interface-for-extending-wasp-1811.01692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-external-interface-for-extending-wasp-1811.01692"/></url>
<url><loc>https://scifaro.com/en/abs/domain-and-range-for-angelic-and-demonic-compositions-1811.01712</loc><lastmod>2022-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-and-range-for-angelic-and-demonic-compositions-1811.01712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-and-range-for-angelic-and-demonic-compositions-1811.01712"/></url>
<url><loc>https://scifaro.com/en/abs/operation-control-protocols-in-power-distribution-grids-1811.01942</loc><lastmod>2018-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operation-control-protocols-in-power-distribution-grids-1811.01942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operation-control-protocols-in-power-distribution-grids-1811.01942"/></url>
<url><loc>https://scifaro.com/en/abs/conceptua-institutions-in-a-topos-1811.02041</loc><lastmod>2018-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conceptua-institutions-in-a-topos-1811.02041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conceptua-institutions-in-a-topos-1811.02041"/></url>
<url><loc>https://scifaro.com/en/abs/better-late-than-never-a-fully-abstract-semantics-for-classical-processes-1811.02209</loc><lastmod>2018-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-late-than-never-a-fully-abstract-semantics-for-classical-processes-1811.02209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-late-than-never-a-fully-abstract-semantics-for-classical-processes-1811.02209"/></url>
<url><loc>https://scifaro.com/en/abs/unification-in-matching-logic-extended-version-1811.02835</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-in-matching-logic-extended-version-1811.02835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-in-matching-logic-extended-version-1811.02835"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-explicit-ltlf-satisfiability-checking-1811.03176</loc><lastmod>2018-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-explicit-ltlf-satisfiability-checking-1811.03176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-explicit-ltlf-satisfiability-checking-1811.03176"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-of-open-terms-in-stream-gsos-1811.03606</loc><lastmod>2019-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-of-open-terms-in-stream-gsos-1811.03606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-of-open-terms-in-stream-gsos-1811.03606"/></url>
<url><loc>https://scifaro.com/en/abs/a-domain-theory-for-statistical-probabilistic-programming-1811.04196</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-domain-theory-for-statistical-probabilistic-programming-1811.04196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-domain-theory-for-statistical-probabilistic-programming-1811.04196"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-computing-prime-implicates-in-modal-logic-using-resolution-1811.04566</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-computing-prime-implicates-in-modal-logic-using-resolution-1811.04566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-computing-prime-implicates-in-modal-logic-using-resolution-1811.04566"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-for-epistemic-logic-programs-made-easy-extended-version-1811.04800</loc><lastmod>2018-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-for-epistemic-logic-programs-made-easy-extended-version-1811.04800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-for-epistemic-logic-programs-made-easy-extended-version-1811.04800"/></url>
<url><loc>https://scifaro.com/en/abs/finite-degree-clones-are-undecidable-1811.05056</loc><lastmod>2019-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-degree-clones-are-undecidable-1811.05056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-degree-clones-are-undecidable-1811.05056"/></url>
<url><loc>https://scifaro.com/en/abs/losing-connection-the-modal-logic-of-definable-link-deletion-1811.05074</loc><lastmod>2019-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/losing-connection-the-modal-logic-of-definable-link-deletion-1811.05074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/losing-connection-the-modal-logic-of-definable-link-deletion-1811.05074"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-cas-approach-to-finding-good-matrices-new-examples-and-counterexamples-1811.05094</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-cas-approach-to-finding-good-matrices-new-examples-and-counterexamples-1811.05094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-cas-approach-to-finding-good-matrices-new-examples-and-counterexamples-1811.05094"/></url>
<url><loc>https://scifaro.com/en/abs/programs-as-the-language-of-science-1811.05116</loc><lastmod>2020-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programs-as-the-language-of-science-1811.05116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programs-as-the-language-of-science-1811.05116"/></url>
<url><loc>https://scifaro.com/en/abs/relation-of-web-service-orchestration-abstract-process-web-service-and-choreography-1811.05305</loc><lastmod>2018-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-of-web-service-orchestration-abstract-process-web-service-and-choreography-1811.05305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-of-web-service-orchestration-abstract-process-web-service-and-choreography-1811.05305"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-masking-fault-tolerance-1811.05548</loc><lastmod>2018-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-masking-fault-tolerance-1811.05548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-masking-fault-tolerance-1811.05548"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-ach-unification-1811.05602</loc><lastmod>2020-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-ach-unification-1811.05602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-ach-unification-1811.05602"/></url>
<url><loc>https://scifaro.com/en/abs/voxlogica-a-spatial-model-checker-for-declarative-image-analysis-extended-version-1811.05677</loc><lastmod>2018-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voxlogica-a-spatial-model-checker-for-declarative-image-analysis-extended-version-1811.05677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voxlogica-a-spatial-model-checker-for-declarative-image-analysis-extended-version-1811.05677"/></url>
<url><loc>https://scifaro.com/en/abs/partial-awareness-1811.05751</loc><lastmod>2018-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-awareness-1811.05751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-awareness-1811.05751"/></url>
<url><loc>https://scifaro.com/en/abs/a-knowledge-representation-perspective-on-activity-theory-1811.05815</loc><lastmod>2018-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-knowledge-representation-perspective-on-activity-theory-1811.05815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-knowledge-representation-perspective-on-activity-theory-1811.05815"/></url>
<url><loc>https://scifaro.com/en/abs/spatial-logics-and-model-checking-for-medical-imaging-extended-version-1811.06065</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spatial-logics-and-model-checking-for-medical-imaging-extended-version-1811.06065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spatial-logics-and-model-checking-for-medical-imaging-extended-version-1811.06065"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-specification-and-verification-of-atomic-swap-smart-contracts-1811.06099</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-specification-and-verification-of-atomic-swap-smart-contracts-1811.06099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-specification-and-verification-of-atomic-swap-smart-contracts-1811.06099"/></url>
<url><loc>https://scifaro.com/en/abs/jets-and-differential-linear-logic-1811.06235</loc><lastmod>2021-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/jets-and-differential-linear-logic-1811.06235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/jets-and-differential-linear-logic-1811.06235"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-generalized-l-o-s-tarski-theorem-1811.06459</loc><lastmod>2018-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-generalized-l-o-s-tarski-theorem-1811.06459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-generalized-l-o-s-tarski-theorem-1811.06459"/></url>
<url><loc>https://scifaro.com/en/abs/verified-runtime-validation-for-partially-observable-hybrid-systems-1811.06502</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-runtime-validation-for-partially-observable-hybrid-systems-1811.06502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-runtime-validation-for-partially-observable-hybrid-systems-1811.06502"/></url>
<url><loc>https://scifaro.com/en/abs/high-granular-operator-spaces-and-less-contaminated-general-rough-mereologies-1811.06560</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-granular-operator-spaces-and-less-contaminated-general-rough-mereologies-1811.06560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-granular-operator-spaces-and-less-contaminated-general-rough-mereologies-1811.06560"/></url>
<url><loc>https://scifaro.com/en/abs/precondition-inference-via-partitioning-of-initial-states-1811.06771</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/precondition-inference-via-partitioning-of-initial-states-1811.06771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/precondition-inference-via-partitioning-of-initial-states-1811.06771"/></url>
<url><loc>https://scifaro.com/en/abs/tail-probabilities-for-randomized-program-runtimes-via-martingales-for-higher-moments-1811.06779</loc><lastmod>2019-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tail-probabilities-for-randomized-program-runtimes-via-martingales-for-higher-moments-1811.06779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tail-probabilities-for-randomized-program-runtimes-via-martingales-for-higher-moments-1811.06779"/></url>
<url><loc>https://scifaro.com/en/abs/progressive-algorithms-for-domination-and-independence-1811.06799</loc><lastmod>2018-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progressive-algorithms-for-domination-and-independence-1811.06799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progressive-algorithms-for-domination-and-independence-1811.06799"/></url>
<url><loc>https://scifaro.com/en/abs/computing-the-expected-execution-time-of-probabilistic-workflow-nets-1811.06961</loc><lastmod>2019-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-the-expected-execution-time-of-probabilistic-workflow-nets-1811.06961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-the-expected-execution-time-of-probabilistic-workflow-nets-1811.06961"/></url>
<url><loc>https://scifaro.com/en/abs/equilibria-based-probabilistic-model-checking-for-concurrent-stochastic-games-1811.07145</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilibria-based-probabilistic-model-checking-for-concurrent-stochastic-games-1811.07145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilibria-based-probabilistic-model-checking-for-concurrent-stochastic-games-1811.07145"/></url>
<url><loc>https://scifaro.com/en/abs/coinduction-in-uniform-foundations-for-corecursive-proof-search-with-horn-clauses-1811.07644</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinduction-in-uniform-foundations-for-corecursive-proof-search-with-horn-clauses-1811.07644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinduction-in-uniform-foundations-for-corecursive-proof-search-with-horn-clauses-1811.07644"/></url>
<url><loc>https://scifaro.com/en/abs/far-cubicle-a-new-reachability-algorithm-for-cubicle-1811.08131</loc><lastmod>2018-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/far-cubicle-a-new-reachability-algorithm-for-cubicle-1811.08131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/far-cubicle-a-new-reachability-algorithm-for-cubicle-1811.08131"/></url>
<url><loc>https://scifaro.com/en/abs/causal-inference-by-string-diagram-surgery-1811.08338</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-inference-by-string-diagram-surgery-1811.08338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-inference-by-string-diagram-surgery-1811.08338"/></url>
<url><loc>https://scifaro.com/en/abs/information-guided-temporal-logic-inference-with-prior-knowledge-1811.08846</loc><lastmod>2018-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-guided-temporal-logic-inference-with-prior-knowledge-1811.08846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-guided-temporal-logic-inference-with-prior-knowledge-1811.08846"/></url>
<url><loc>https://scifaro.com/en/abs/automated-amortised-resource-analysis-for-term-rewrite-systems-1811.09071</loc><lastmod>2018-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-amortised-resource-analysis-for-term-rewrite-systems-1811.09071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-amortised-resource-analysis-for-term-rewrite-systems-1811.09071"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-stand-alone-solar-photovoltaic-systems-1811.09438</loc><lastmod>2018-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-stand-alone-solar-photovoltaic-systems-1811.09438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-stand-alone-solar-photovoltaic-systems-1811.09438"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-modal-logic-with-implicit-modal-quantification-1811.09454</loc><lastmod>2019-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-modal-logic-with-implicit-modal-quantification-1811.09454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-modal-logic-with-implicit-modal-quantification-1811.09454"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-attacker-capability-via-model-checking-multiple-properties-extended-version-1811.10400</loc><lastmod>2018-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-attacker-capability-via-model-checking-multiple-properties-extended-version-1811.10400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-attacker-capability-via-model-checking-multiple-properties-extended-version-1811.10400"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-algebra-with-observations-1811.10401</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-algebra-with-observations-1811.10401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-algebra-with-observations-1811.10401"/></url>
<url><loc>https://scifaro.com/en/abs/user-support-for-the-combinator-logic-synthesizer-framework-1811.10815</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/user-support-for-the-combinator-logic-synthesizer-framework-1811.10815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/user-support-for-the-combinator-logic-synthesizer-framework-1811.10815"/></url>
<url><loc>https://scifaro.com/en/abs/counting-polynomial-roots-in-isabelle-hol-a-formal-proof-of-the-budan-fourier-theorem-1811.11093</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-polynomial-roots-in-isabelle-hol-a-formal-proof-of-the-budan-fourier-theorem-1811.11093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-polynomial-roots-in-isabelle-hol-a-formal-proof-of-the-budan-fourier-theorem-1811.11093"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-topological-proofs-with-model-checking-to-instrument-iterative-design-1811.11123</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-topological-proofs-with-model-checking-to-instrument-iterative-design-1811.11123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-topological-proofs-with-model-checking-to-instrument-iterative-design-1811.11123"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-unions-a-fibre-bundle-characterization-of-the-union-of-descriptively-near-sets-1811.11129</loc><lastmod>2018-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-unions-a-fibre-bundle-characterization-of-the-union-of-descriptively-near-sets-1811.11129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-unions-a-fibre-bundle-characterization-of-the-union-of-descriptively-near-sets-1811.11129"/></url>
<url><loc>https://scifaro.com/en/abs/course-of-value-induction-in-cedille-1811.11961</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/course-of-value-induction-in-cedille-1811.11961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/course-of-value-induction-in-cedille-1811.11961"/></url>
<url><loc>https://scifaro.com/en/abs/combining-refinement-of-parametric-models-with-goal-oriented-reduction-of-dynamics-1811.12377</loc><lastmod>2018-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-refinement-of-parametric-models-with-goal-oriented-reduction-of-dynamics-1811.12377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-refinement-of-parametric-models-with-goal-oriented-reduction-of-dynamics-1811.12377"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-timed-broadcast-protocols-1811.12576</loc><lastmod>2019-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-timed-broadcast-protocols-1811.12576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-timed-broadcast-protocols-1811.12576"/></url>
<url><loc>https://scifaro.com/en/abs/a-scheme-to-verify-services-with-unboundedly-many-clients-using-nusmv-1812.00183</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scheme-to-verify-services-with-unboundedly-many-clients-using-nusmv-1812.00183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scheme-to-verify-services-with-unboundedly-many-clients-using-nusmv-1812.00183"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-recursive-quantum-programs-1812.00349</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-recursive-quantum-programs-1812.00349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-recursive-quantum-programs-1812.00349"/></url>
<url><loc>https://scifaro.com/en/abs/debugging-smart-contract-s-business-logic-using-symbolic-model-checking-1812.00619</loc><lastmod>2018-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/debugging-smart-contract-s-business-logic-using-symbolic-model-checking-1812.00619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/debugging-smart-contract-s-business-logic-using-symbolic-model-checking-1812.00619"/></url>
<url><loc>https://scifaro.com/en/abs/a-high-level-operational-semantics-for-hardware-weak-memory-models-1812.00996</loc><lastmod>2018-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-high-level-operational-semantics-for-hardware-weak-memory-models-1812.00996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-high-level-operational-semantics-for-hardware-weak-memory-models-1812.00996"/></url>
<url><loc>https://scifaro.com/en/abs/graded-monads-and-graded-logics-for-the-linear-time-branching-time-spectrum-1812.01317</loc><lastmod>2020-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-monads-and-graded-logics-for-the-linear-time-branching-time-spectrum-1812.01317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-monads-and-graded-logics-for-the-linear-time-branching-time-spectrum-1812.01317"/></url>
<url><loc>https://scifaro.com/en/abs/searching-for-an-analogue-of-atr-in-the-weihrauch-lattice-1812.01549</loc><lastmod>2021-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/searching-for-an-analogue-of-atr-in-the-weihrauch-lattice-1812.01549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/searching-for-an-analogue-of-atr-in-the-weihrauch-lattice-1812.01549"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-lambda-pi-modulo-rewriting-using-the-size-change-principle-work-in-progress-1812.01853</loc><lastmod>2018-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-lambda-pi-modulo-rewriting-using-the-size-change-principle-work-in-progress-1812.01853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-lambda-pi-modulo-rewriting-using-the-size-change-principle-work-in-progress-1812.01853"/></url>
<url><loc>https://scifaro.com/en/abs/sculptures-in-concurrency-1812.02008</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sculptures-in-concurrency-1812.02008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sculptures-in-concurrency-1812.02008"/></url>
<url><loc>https://scifaro.com/en/abs/equational-axiomatization-of-algebras-with-structure-1812.02016</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-axiomatization-of-algebras-with-structure-1812.02016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-axiomatization-of-algebras-with-structure-1812.02016"/></url>
<url><loc>https://scifaro.com/en/abs/gems-of-corrado-b-ohm-1812.02243</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gems-of-corrado-b-ohm-1812.02243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gems-of-corrado-b-ohm-1812.02243"/></url>
<url><loc>https://scifaro.com/en/abs/css-minification-via-constraint-solving-technical-report-1812.02989</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/css-minification-via-constraint-solving-technical-report-1812.02989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/css-minification-via-constraint-solving-technical-report-1812.02989"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-pushdown-automata-via-first-order-grammars-1812.03518</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-pushdown-automata-via-first-order-grammars-1812.03518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-pushdown-automata-via-first-order-grammars-1812.03518"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-metatheory-of-the-quipper-quantum-programming-language-in-a-linear-logic-1812.03624</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-metatheory-of-the-quipper-quantum-programming-language-in-a-linear-logic-1812.03624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-metatheory-of-the-quipper-quantum-programming-language-in-a-linear-logic-1812.03624"/></url>
<url><loc>https://scifaro.com/en/abs/a-metric-for-linear-temporal-logic-1812.03923</loc><lastmod>2018-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-metric-for-linear-temporal-logic-1812.03923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-metric-for-linear-temporal-logic-1812.03923"/></url>
<url><loc>https://scifaro.com/en/abs/towards-machine-learning-induction-1812.04088</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-machine-learning-induction-1812.04088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-machine-learning-induction-1812.04088"/></url>
<url><loc>https://scifaro.com/en/abs/completing-the-picture-complexity-of-graded-modal-logics-with-converse-1812.04413</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completing-the-picture-complexity-of-graded-modal-logics-with-converse-1812.04413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completing-the-picture-complexity-of-graded-modal-logics-with-converse-1812.04413"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-average-case-analysis-of-substitution-resolution-in-lambda-calculus-1812.04452</loc><lastmod>2018-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-average-case-analysis-of-substitution-resolution-in-lambda-calculus-1812.04452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-average-case-analysis-of-substitution-resolution-in-lambda-calculus-1812.04452"/></url>
<url><loc>https://scifaro.com/en/abs/plasp-3-towards-effective-asp-planning-1812.04491</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plasp-3-towards-effective-asp-planning-1812.04491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plasp-3-towards-effective-asp-planning-1812.04491"/></url>
<url><loc>https://scifaro.com/en/abs/bosphorus-bridging-anf-and-cnf-solvers-1812.04580</loc><lastmod>2018-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bosphorus-bridging-anf-and-cnf-solvers-1812.04580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bosphorus-bridging-anf-and-cnf-solvers-1812.04580"/></url>
<url><loc>https://scifaro.com/en/abs/a-repetition-free-hypersequent-calculus-for-first-order-rational-pavelka-logic-1812.04861</loc><lastmod>2023-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-repetition-free-hypersequent-calculus-for-first-order-rational-pavelka-logic-1812.04861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-repetition-free-hypersequent-calculus-for-first-order-rational-pavelka-logic-1812.04861"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-several-calculi-for-first-order-infinite-valued-l-ukasiewicz-logic-1812.05297</loc><lastmod>2023-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-several-calculi-for-first-order-infinite-valued-l-ukasiewicz-logic-1812.05297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-several-calculi-for-first-order-infinite-valued-l-ukasiewicz-logic-1812.05297"/></url>
<url><loc>https://scifaro.com/en/abs/computational-interpretations-of-classical-reasoning-from-the-epsilon-calculus-to-stateful-programs-1812.05851</loc><lastmod>2018-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-interpretations-of-classical-reasoning-from-the-epsilon-calculus-to-stateful-programs-1812.05851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-interpretations-of-classical-reasoning-from-the-epsilon-calculus-to-stateful-programs-1812.05851"/></url>
<url><loc>https://scifaro.com/en/abs/facets-of-distribution-identities-in-probabilistic-team-semantics-1812.05873</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facets-of-distribution-identities-in-probabilistic-team-semantics-1812.05873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facets-of-distribution-identities-in-probabilistic-team-semantics-1812.05873"/></url>
<url><loc>https://scifaro.com/en/abs/solvability-typability-inhabitation-1812.06009</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solvability-typability-inhabitation-1812.06009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solvability-typability-inhabitation-1812.06009"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-fragments-of-first-order-modal-logics-with-counting-quantifiers-over-varying-domains-1812.06341</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-fragments-of-first-order-modal-logics-with-counting-quantifiers-over-varying-domains-1812.06341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-fragments-of-first-order-modal-logics-with-counting-quantifiers-over-varying-domains-1812.06341"/></url>
<url><loc>https://scifaro.com/en/abs/quine-s-fluted-fragment-revisited-1812.06440</loc><lastmod>2018-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quine-s-fluted-fragment-revisited-1812.06440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quine-s-fluted-fragment-revisited-1812.06440"/></url>
<url><loc>https://scifaro.com/en/abs/presenting-de-groot-duality-of-stably-compact-spaces-1812.06480</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presenting-de-groot-duality-of-stably-compact-spaces-1812.06480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presenting-de-groot-duality-of-stably-compact-spaces-1812.06480"/></url>
<url><loc>https://scifaro.com/en/abs/the-positivication-of-coalgebraic-logics-1812.07288</loc><lastmod>2018-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-positivication-of-coalgebraic-logics-1812.07288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-positivication-of-coalgebraic-logics-1812.07288"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-on-ordered-structures-1812.08003</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-on-ordered-structures-1812.08003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-on-ordered-structures-1812.08003"/></url>
<url><loc>https://scifaro.com/en/abs/building-on-the-diamonds-between-theories-theory-presentation-combinators-1812.08079</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-on-the-diamonds-between-theories-theory-presentation-combinators-1812.08079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-on-the-diamonds-between-theories-theory-presentation-combinators-1812.08079"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-observer-reduction-applied-to-opacity-verification-and-synthesis-1812.08083</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-observer-reduction-applied-to-opacity-verification-and-synthesis-1812.08083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-observer-reduction-applied-to-opacity-verification-and-synthesis-1812.08083"/></url>
<url><loc>https://scifaro.com/en/abs/a-benchmark-library-for-parametric-timed-model-checking-1812.08441</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-benchmark-library-for-parametric-timed-model-checking-1812.08441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-benchmark-library-for-parametric-timed-model-checking-1812.08441"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-an-industrial-asynchronous-leader-election-algorithm-using-abstractions-and-parametric-model-checking-1812.08949</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-an-industrial-asynchronous-leader-election-algorithm-using-abstractions-and-parametric-model-checking-1812.08949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-an-industrial-asynchronous-leader-election-algorithm-using-abstractions-and-parametric-model-checking-1812.08949"/></url>
<url><loc>https://scifaro.com/en/abs/the-content-correlation-of-multiple-streaming-edges-1812.09867</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-content-correlation-of-multiple-streaming-edges-1812.09867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-content-correlation-of-multiple-streaming-edges-1812.09867"/></url>
<url><loc>https://scifaro.com/en/abs/on-verifying-timed-hyperproperties-1812.10005</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-verifying-timed-hyperproperties-1812.10005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-verifying-timed-hyperproperties-1812.10005"/></url>
<url><loc>https://scifaro.com/en/abs/alpha-conversion-for-lambda-terms-with-explicit-weakenings-1812.10008</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alpha-conversion-for-lambda-terms-with-explicit-weakenings-1812.10008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alpha-conversion-for-lambda-terms-with-explicit-weakenings-1812.10008"/></url>
<url><loc>https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-a-concise-comparative-survey-1812.10026</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-a-concise-comparative-survey-1812.10026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-a-concise-comparative-survey-1812.10026"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-timed-logics-with-automata-modalities-1812.10146</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-timed-logics-with-automata-modalities-1812.10146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-timed-logics-with-automata-modalities-1812.10146"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-safety-critical-information-flow-between-pilot-and-computer-1812.10363</loc><lastmod>2018-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-safety-critical-information-flow-between-pilot-and-computer-1812.10363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-safety-critical-information-flow-between-pilot-and-computer-1812.10363"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-long-version-1812.10799</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-long-version-1812.10799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-long-version-1812.10799"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-algorithms-and-the-computational-content-of-classical-proofs-1812.11003</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-algorithms-and-the-computational-content-of-classical-proofs-1812.11003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-algorithms-and-the-computational-content-of-classical-proofs-1812.11003"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-constructive-formalization-of-perfect-graph-theorems-1812.11108</loc><lastmod>2018-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-constructive-formalization-of-perfect-graph-theorems-1812.11108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-constructive-formalization-of-perfect-graph-theorems-1812.11108"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-and-non-deterministic-call-by-push-value-language-1812.11573</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-and-non-deterministic-call-by-push-value-language-1812.11573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-and-non-deterministic-call-by-push-value-language-1812.11573"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-aleatoric-calculus-for-probabilistic-reasoning-extended-version-1812.11741</loc><lastmod>2019-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-aleatoric-calculus-for-probabilistic-reasoning-extended-version-1812.11741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-aleatoric-calculus-for-probabilistic-reasoning-extended-version-1812.11741"/></url>
<url><loc>https://scifaro.com/en/abs/vass-reachability-in-three-steps-1812.11966</loc><lastmod>2020-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vass-reachability-in-three-steps-1812.11966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vass-reachability-in-three-steps-1812.11966"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-3rd-workshop-on-formal-reasoning-about-causation-responsibility-and-explanations-in-science-and-technology-1901.00073</loc><lastmod>2019-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-formal-reasoning-about-causation-responsibility-and-explanations-in-science-and-technology-1901.00073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-3rd-workshop-on-formal-reasoning-about-causation-responsibility-and-explanations-in-science-and-technology-1901.00073"/></url>
<url><loc>https://scifaro.com/en/abs/online-monitoring-of-metric-temporal-logic-using-sequential-networks-1901.00175</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-monitoring-of-metric-temporal-logic-using-sequential-networks-1901.00175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-monitoring-of-metric-temporal-logic-using-sequential-networks-1901.00175"/></url>
<url><loc>https://scifaro.com/en/abs/pridemm-a-solver-for-relaxed-memory-models-1901.00428</loc><lastmod>2019-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pridemm-a-solver-for-relaxed-memory-models-1901.00428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pridemm-a-solver-for-relaxed-memory-models-1901.00428"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-cubical-type-theory-1901.00489</loc><lastmod>2019-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-cubical-type-theory-1901.00489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-cubical-type-theory-1901.00489"/></url>
<url><loc>https://scifaro.com/en/abs/the-challenges-in-specifying-and-explaining-synthesized-implementations-of-reactive-systems-1901.00591</loc><lastmod>2019-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-challenges-in-specifying-and-explaining-synthesized-implementations-of-reactive-systems-1901.00591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-challenges-in-specifying-and-explaining-synthesized-implementations-of-reactive-systems-1901.00591"/></url>
<url><loc>https://scifaro.com/en/abs/interactions-between-causal-structures-in-graph-rewriting-systems-1901.00592</loc><lastmod>2019-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactions-between-causal-structures-in-graph-rewriting-systems-1901.00592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactions-between-causal-structures-in-graph-rewriting-systems-1901.00592"/></url>
<url><loc>https://scifaro.com/en/abs/interventionist-counterfactuals-on-causal-teams-1901.00593</loc><lastmod>2019-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interventionist-counterfactuals-on-causal-teams-1901.00593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interventionist-counterfactuals-on-causal-teams-1901.00593"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-calculus-and-probabilistic-computation-1901.02853</loc><lastmod>2019-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-calculus-and-probabilistic-computation-1901.02853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-calculus-and-probabilistic-computation-1901.02853"/></url>
<url><loc>https://scifaro.com/en/abs/pml-2-integrated-program-verification-in-ml-1901.03208</loc><lastmod>2019-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pml-2-integrated-program-verification-in-ml-1901.03208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pml-2-integrated-program-verification-in-ml-1901.03208"/></url>
<url><loc>https://scifaro.com/en/abs/mechanization-of-separation-in-generic-extensions-1901.03313</loc><lastmod>2019-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanization-of-separation-in-generic-extensions-1901.03313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanization-of-separation-in-generic-extensions-1901.03313"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-regular-functions-1901.03366</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-regular-functions-1901.03366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-regular-functions-1901.03366"/></url>
<url><loc>https://scifaro.com/en/abs/towards-platform-independent-specification-and-verification-of-the-standard-trigonometry-functions-1901.03414</loc><lastmod>2019-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-platform-independent-specification-and-verification-of-the-standard-trigonometry-functions-1901.03414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-platform-independent-specification-and-verification-of-the-standard-trigonometry-functions-1901.03414"/></url>
<url><loc>https://scifaro.com/en/abs/life-is-random-time-is-not-markov-decision-processes-with-window-objectives-1901.03571</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/life-is-random-time-is-not-markov-decision-processes-with-window-objectives-1901.03571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/life-is-random-time-is-not-markov-decision-processes-with-window-objectives-1901.03571"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-the-interval-way-1901.03880</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-the-interval-way-1901.03880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-the-interval-way-1901.03880"/></url>
<url><loc>https://scifaro.com/en/abs/topology-is-relevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1901.04237</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-is-relevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1901.04237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-is-relevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1901.04237"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-second-order-logic-with-path-measure-quantifier-is-undecidable-1901.04349</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-path-measure-quantifier-is-undecidable-1901.04349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-second-order-logic-with-path-measure-quantifier-is-undecidable-1901.04349"/></url>
<url><loc>https://scifaro.com/en/abs/random-subgroups-of-rationals-1901.04743</loc><lastmod>2019-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-subgroups-of-rationals-1901.04743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-subgroups-of-rationals-1901.04743"/></url>
<url><loc>https://scifaro.com/en/abs/order-polarities-1901.04781</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-polarities-1901.04781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-polarities-1901.04781"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-satisfiability-checking-for-arithmetic-mu-calculi-1901.04893</loc><lastmod>2019-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-satisfiability-checking-for-arithmetic-mu-calculi-1901.04893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-satisfiability-checking-for-arithmetic-mu-calculi-1901.04893"/></url>
<url><loc>https://scifaro.com/en/abs/unconstrained-church-turing-thesis-cannot-possibly-be-true-1901.04911</loc><lastmod>2019-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unconstrained-church-turing-thesis-cannot-possibly-be-true-1901.04911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unconstrained-church-turing-thesis-cannot-possibly-be-true-1901.04911"/></url>
<url><loc>https://scifaro.com/en/abs/relational-proofs-for-quantum-programs-1901.05184</loc><lastmod>2019-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-proofs-for-quantum-programs-1901.05184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-proofs-for-quantum-programs-1901.05184"/></url>
<url><loc>https://scifaro.com/en/abs/the-notion-of-unimaginable-numbers-in-computational-number-theory-1901.05372</loc><lastmod>2019-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-notion-of-unimaginable-numbers-in-computational-number-theory-1901.05372"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-notion-of-unimaginable-numbers-in-computational-number-theory-1901.05372"/></url>
<url><loc>https://scifaro.com/en/abs/flat-model-checking-for-counting-ltl-using-quantifier-free-presburger-arithmetic-1901.05692</loc><lastmod>2019-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flat-model-checking-for-counting-ltl-using-quantifier-free-presburger-arithmetic-1901.05692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flat-model-checking-for-counting-ltl-using-quantifier-free-presburger-arithmetic-1901.05692"/></url>
<url><loc>https://scifaro.com/en/abs/the-distributive-graded-lattice-of-el-concept-descriptions-and-its-neighborhood-relation-extended-version-1901.05919</loc><lastmod>2019-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-distributive-graded-lattice-of-el-concept-descriptions-and-its-neighborhood-relation-extended-version-1901.05919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-distributive-graded-lattice-of-el-concept-descriptions-and-its-neighborhood-relation-extended-version-1901.05919"/></url>
<url><loc>https://scifaro.com/en/abs/modular-verification-for-almost-sure-termination-of-probabilistic-programs-1901.06087</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-verification-for-almost-sure-termination-of-probabilistic-programs-1901.06087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-verification-for-almost-sure-termination-of-probabilistic-programs-1901.06087"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-vs-second-order-encodings-for-ltlf-to-automata-translation-1901.06108</loc><lastmod>2019-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-vs-second-order-encodings-for-ltlf-to-automata-translation-1901.06108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-vs-second-order-encodings-for-ltlf-to-automata-translation-1901.06108"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-lifting-property-in-quantales-1901.06191</loc><lastmod>2019-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-lifting-property-in-quantales-1901.06191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-lifting-property-in-quantales-1901.06191"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-and-expressivity-of-propositional-dynamic-logics-with-finitely-many-variables-1901.06407</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-and-expressivity-of-propositional-dynamic-logics-with-finitely-many-variables-1901.06407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-and-expressivity-of-propositional-dynamic-logics-with-finitely-many-variables-1901.06407"/></url>
<url><loc>https://scifaro.com/en/abs/a-pre-expectation-calculus-for-probabilistic-sensitivity-1901.06540</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pre-expectation-calculus-for-probabilistic-sensitivity-1901.06540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pre-expectation-calculus-for-probabilistic-sensitivity-1901.06540"/></url>
<url><loc>https://scifaro.com/en/abs/moss-logic-for-ordered-coalgebras-1901.06547</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moss-logic-for-ordered-coalgebras-1901.06547"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moss-logic-for-ordered-coalgebras-1901.06547"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-order-logic-for-reasoning-about-knowledge-and-probability-1901.06886</loc><lastmod>2019-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-order-logic-for-reasoning-about-knowledge-and-probability-1901.06886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-order-logic-for-reasoning-about-knowledge-and-probability-1901.06886"/></url>
<url><loc>https://scifaro.com/en/abs/mso-nabla-is-undecidable-1901.06900</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mso-nabla-is-undecidable-1901.06900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mso-nabla-is-undecidable-1901.06900"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-complete-1901.07170</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-complete-1901.07170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-equivalence-of-first-order-grammars-is-ackermann-complete-1901.07170"/></url>
<url><loc>https://scifaro.com/en/abs/totality-for-mixed-inductive-and-coinductive-types-1901.07820</loc><lastmod>2025-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/totality-for-mixed-inductive-and-coinductive-types-1901.07820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/totality-for-mixed-inductive-and-coinductive-types-1901.07820"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-power-of-symmetric-linear-programs-1901.07825</loc><lastmod>2019-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-power-of-symmetric-linear-programs-1901.07825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-power-of-symmetric-linear-programs-1901.07825"/></url>
<url><loc>https://scifaro.com/en/abs/predicting-the-results-of-ltl-model-checking-using-multiple-machine-learning-algorithms-1901.07891</loc><lastmod>2019-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicting-the-results-of-ltl-model-checking-using-multiple-machine-learning-algorithms-1901.07891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicting-the-results-of-ltl-model-checking-using-multiple-machine-learning-algorithms-1901.07891"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-order-logic-with-frames-1901.09089</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-order-logic-with-frames-1901.09089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-order-logic-with-frames-1901.09089"/></url>
<url><loc>https://scifaro.com/en/abs/credulous-acceptability-poison-games-and-modal-logic-1901.09180</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/credulous-acceptability-poison-games-and-modal-logic-1901.09180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/credulous-acceptability-poison-games-and-modal-logic-1901.09180"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-non-normal-modal-logics-a-general-framework-1901.09812</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-non-normal-modal-logics-a-general-framework-1901.09812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-non-normal-modal-logics-a-general-framework-1901.09812"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-equivalences-from-state-effect-adjunctions-1901.10116</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-equivalences-from-state-effect-adjunctions-1901.10116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-equivalences-from-state-effect-adjunctions-1901.10116"/></url>
<url><loc>https://scifaro.com/en/abs/reqwire-reasoning-about-reversible-quantum-circuits-1901.10118</loc><lastmod>2019-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reqwire-reasoning-about-reversible-quantum-circuits-1901.10118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reqwire-reasoning-about-reversible-quantum-circuits-1901.10118"/></url>
<url><loc>https://scifaro.com/en/abs/unique-perfect-matchings-forbidden-transitions-and-proof-nets-for-linear-logic-with-mix-1901.10247</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-perfect-matchings-forbidden-transitions-and-proof-nets-for-linear-logic-with-mix-1901.10247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-perfect-matchings-forbidden-transitions-and-proof-nets-for-linear-logic-with-mix-1901.10247"/></url>
<url><loc>https://scifaro.com/en/abs/representation-theorems-for-extended-contact-algebras-based-on-equivalence-relations-1901.10367</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-theorems-for-extended-contact-algebras-based-on-equivalence-relations-1901.10367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-theorems-for-extended-contact-algebras-based-on-equivalence-relations-1901.10367"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-i-o-specification-1901.10541</loc><lastmod>2019-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-i-o-specification-1901.10541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-i-o-specification-1901.10541"/></url>
<url><loc>https://scifaro.com/en/abs/data-consistency-in-transactional-storage-systems-a-centralised-approach-1901.10615</loc><lastmod>2019-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-consistency-in-transactional-storage-systems-a-centralised-approach-1901.10615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-consistency-in-transactional-storage-systems-a-centralised-approach-1901.10615"/></url>
<url><loc>https://scifaro.com/en/abs/decreasing-diagrams-for-confluence-and-commutation-1901.10773</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decreasing-diagrams-for-confluence-and-commutation-1901.10773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decreasing-diagrams-for-confluence-and-commutation-1901.10773"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-overview-of-formal-languages-for-individual-based-modelling-of-ecosystems-1901.10820</loc><lastmod>2019-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-overview-of-formal-languages-for-individual-based-modelling-of-ecosystems-1901.10820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-overview-of-formal-languages-for-individual-based-modelling-of-ecosystems-1901.10820"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-independently-verifiable-privacy-compliant-type-systems-for-message-passing-between-black-box-components-1901.10892</loc><lastmod>2019-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-independently-verifiable-privacy-compliant-type-systems-for-message-passing-between-black-box-components-1901.10892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-independently-verifiable-privacy-compliant-type-systems-for-message-passing-between-black-box-components-1901.10892"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-equivalence-between-computation-tree-logic-and-failure-trace-testing-1901.10925</loc><lastmod>2019-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-equivalence-between-computation-tree-logic-and-failure-trace-testing-1901.10925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-equivalence-between-computation-tree-logic-and-failure-trace-testing-1901.10925"/></url>
<url><loc>https://scifaro.com/en/abs/on-properties-of-b-terms-1901.11010</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-properties-of-b-terms-1901.11010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-properties-of-b-terms-1901.11010"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-valued-overlap-and-quasi-overlap-functions-1902.00133</loc><lastmod>2019-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-valued-overlap-and-quasi-overlap-functions-1902.00133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-valued-overlap-and-quasi-overlap-functions-1902.00133"/></url>
<url><loc>https://scifaro.com/en/abs/around-finite-second-order-coherence-spaces-1902.00196</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/around-finite-second-order-coherence-spaces-1902.00196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/around-finite-second-order-coherence-spaces-1902.00196"/></url>
<url><loc>https://scifaro.com/en/abs/counting-of-teams-in-first-order-team-logics-1902.00246</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-of-teams-in-first-order-team-logics-1902.00246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-of-teams-in-first-order-team-logics-1902.00246"/></url>
<url><loc>https://scifaro.com/en/abs/signatures-and-induction-principles-for-higher-inductive-inductive-types-1902.00297</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signatures-and-induction-principles-for-higher-inductive-inductive-types-1902.00297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signatures-and-induction-principles-for-higher-inductive-inductive-types-1902.00297"/></url>
<url><loc>https://scifaro.com/en/abs/adventures-in-monitorability-from-branching-to-linear-time-and-back-again-1902.00435</loc><lastmod>2019-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adventures-in-monitorability-from-branching-to-linear-time-and-back-again-1902.00435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adventures-in-monitorability-from-branching-to-linear-time-and-back-again-1902.00435"/></url>
<url><loc>https://scifaro.com/en/abs/automated-zfc-theorem-proving-with-e-1902.00818</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-zfc-theorem-proving-with-e-1902.00818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-zfc-theorem-proving-with-e-1902.00818"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-epistemic-logic-with-communication-actions-1902.01164</loc><lastmod>2019-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-with-communication-actions-1902.01164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-with-communication-actions-1902.01164"/></url>
<url><loc>https://scifaro.com/en/abs/a-session-type-system-for-asynchronous-unreliable-broadcast-communication-1902.01353</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-session-type-system-for-asynchronous-unreliable-broadcast-communication-1902.01353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-session-type-system-for-asynchronous-unreliable-broadcast-communication-1902.01353"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-qed-pre-silicon-verification-for-automotive-microcontroller-cores-industrial-case-study-1902.01494</loc><lastmod>2019-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-qed-pre-silicon-verification-for-automotive-microcontroller-cores-industrial-case-study-1902.01494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-qed-pre-silicon-verification-for-automotive-microcontroller-cores-industrial-case-study-1902.01494"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-computing-with-terms-and-graphs-1902.01510</loc><lastmod>2019-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-computing-with-terms-and-graphs-1902.01510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-computing-with-terms-and-graphs-1902.01510"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-terms-by-graphs-with-structure-constraints-two-illustrations-1902.02010</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-terms-by-graphs-with-structure-constraints-two-illustrations-1902.02010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-terms-by-graphs-with-structure-constraints-two-illustrations-1902.02010"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-preserving-dpo-based-term-graph-rewriting-1902.02011</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-preserving-dpo-based-term-graph-rewriting-1902.02011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-preserving-dpo-based-term-graph-rewriting-1902.02011"/></url>
<url><loc>https://scifaro.com/en/abs/on-quasi-ordinal-diagram-systems-1902.02012</loc><lastmod>2019-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-quasi-ordinal-diagram-systems-1902.02012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-quasi-ordinal-diagram-systems-1902.02012"/></url>
<url><loc>https://scifaro.com/en/abs/a-coalgebraic-take-on-regular-and-omega-regular-behaviours-1902.02601</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coalgebraic-take-on-regular-and-omega-regular-behaviours-1902.02601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coalgebraic-take-on-regular-and-omega-regular-behaviours-1902.02601"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-time-synthesis-for-parametric-timed-automata-1902.03013</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-time-synthesis-for-parametric-timed-automata-1902.03013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-time-synthesis-for-parametric-timed-automata-1902.03013"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-analysis-of-immediate-observation-petri-nets-1902.03025</loc><lastmod>2019-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-analysis-of-immediate-observation-petri-nets-1902.03025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-analysis-of-immediate-observation-petri-nets-1902.03025"/></url>
<url><loc>https://scifaro.com/en/abs/a-hybrid-dynamic-logic-for-event-data-based-systems-1902.03074</loc><lastmod>2019-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hybrid-dynamic-logic-for-event-data-based-systems-1902.03074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hybrid-dynamic-logic-for-event-data-based-systems-1902.03074"/></url>
<url><loc>https://scifaro.com/en/abs/approximation-of-subsets-of-natural-numbers-by-c-e-sets-1902.03399</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximation-of-subsets-of-natural-numbers-by-c-e-sets-1902.03399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximation-of-subsets-of-natural-numbers-by-c-e-sets-1902.03399"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-unification-type-of-simple-symmetric-modal-logics-1902.03770</loc><lastmod>2019-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-unification-type-of-simple-symmetric-modal-logics-1902.03770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-unification-type-of-simple-symmetric-modal-logics-1902.03770"/></url>
<url><loc>https://scifaro.com/en/abs/a-typed-parallel-lambda-calculus-via-1-depth-intermediate-proofs-1902.03882</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-typed-parallel-lambda-calculus-via-1-depth-intermediate-proofs-1902.03882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-typed-parallel-lambda-calculus-via-1-depth-intermediate-proofs-1902.03882"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-model-checking-for-hyperproperties-1902.04111</loc><lastmod>2020-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-model-checking-for-hyperproperties-1902.04111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-model-checking-for-hyperproperties-1902.04111"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-invariant-generation-for-non-deterministic-recursive-programs-1902.04373</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-invariant-generation-for-non-deterministic-recursive-programs-1902.04373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-invariant-generation-for-non-deterministic-recursive-programs-1902.04373"/></url>
<url><loc>https://scifaro.com/en/abs/partial-and-conditional-expectations-in-markov-decision-processes-with-integer-weights-1902.04538</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-and-conditional-expectations-in-markov-decision-processes-with-integer-weights-1902.04538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-and-conditional-expectations-in-markov-decision-processes-with-integer-weights-1902.04538"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-approach-to-physics-based-attacks-in-cyber-physical-systems-extended-version-1902.04572</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-approach-to-physics-based-attacks-in-cyber-physical-systems-extended-version-1902.04572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-approach-to-physics-based-attacks-in-cyber-physical-systems-extended-version-1902.04572"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-abstract-structures-materialization-explained-categorically-1902.04809</loc><lastmod>2019-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-abstract-structures-materialization-explained-categorically-1902.04809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-abstract-structures-materialization-explained-categorically-1902.04809"/></url>
<url><loc>https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-1902.04836</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-1902.04836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-1902.04836"/></url>
<url><loc>https://scifaro.com/en/abs/the-cost-of-monitoring-alone-1902.05152</loc><lastmod>2019-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cost-of-monitoring-alone-1902.05152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cost-of-monitoring-alone-1902.05152"/></url>
<url><loc>https://scifaro.com/en/abs/computability-logic-giving-caesar-what-belongs-to-caesar-1902.05172</loc><lastmod>2019-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-logic-giving-caesar-what-belongs-to-caesar-1902.05172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-logic-giving-caesar-what-belongs-to-caesar-1902.05172"/></url>
<url><loc>https://scifaro.com/en/abs/an-application-of-parallel-cut-elimination-in-multiplicative-linear-logic-to-the-taylor-expansion-of-proof-nets-1902.05193</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-application-of-parallel-cut-elimination-in-multiplicative-linear-logic-to-the-taylor-expansion-of-proof-nets-1902.05193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-application-of-parallel-cut-elimination-in-multiplicative-linear-logic-to-the-taylor-expansion-of-proof-nets-1902.05193"/></url>
<url><loc>https://scifaro.com/en/abs/change-actions-models-of-generalised-differentiation-1902.05465</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/change-actions-models-of-generalised-differentiation-1902.05465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/change-actions-models-of-generalised-differentiation-1902.05465"/></url>
<url><loc>https://scifaro.com/en/abs/environmentally-friendly-gr-1-synthesis-1902.05629</loc><lastmod>2019-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/environmentally-friendly-gr-1-synthesis-1902.05629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/environmentally-friendly-gr-1-synthesis-1902.05629"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-for-minimal-time-of-cellular-automata-1902.05720</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-for-minimal-time-of-cellular-automata-1902.05720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-for-minimal-time-of-cellular-automata-1902.05720"/></url>
<url><loc>https://scifaro.com/en/abs/shepherding-hordes-of-markov-chains-1902.05727</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shepherding-hordes-of-markov-chains-1902.05727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shepherding-hordes-of-markov-chains-1902.05727"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebra-learning-via-duality-1902.05762</loc><lastmod>2019-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebra-learning-via-duality-1902.05762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebra-learning-via-duality-1902.05762"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-logics-with-some-betweenness-relations-expressiveness-satisfiability-and-membership-1902.05905</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-logics-with-some-betweenness-relations-expressiveness-satisfiability-and-membership-1902.05905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-logics-with-some-betweenness-relations-expressiveness-satisfiability-and-membership-1902.05905"/></url>
<url><loc>https://scifaro.com/en/abs/types-by-need-extended-version-1902.05945</loc><lastmod>2019-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/types-by-need-extended-version-1902.05945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/types-by-need-extended-version-1902.05945"/></url>
<url><loc>https://scifaro.com/en/abs/iterated-belief-base-revision-a-dynamic-epistemic-logic-approach-1902.06178</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterated-belief-base-revision-a-dynamic-epistemic-logic-approach-1902.06178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterated-belief-base-revision-a-dynamic-epistemic-logic-approach-1902.06178"/></url>
<url><loc>https://scifaro.com/en/abs/coverability-in-1-vass-with-disequality-tests-1902.06576</loc><lastmod>2020-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coverability-in-1-vass-with-disequality-tests-1902.06576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coverability-in-1-vass-with-disequality-tests-1902.06576"/></url>
<url><loc>https://scifaro.com/en/abs/appendix-for-cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1902.06632</loc><lastmod>2019-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/appendix-for-cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1902.06632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/appendix-for-cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1902.06632"/></url>
<url><loc>https://scifaro.com/en/abs/approximations-of-isomorphism-and-logics-with-linear-algebraic-operators-1902.06648</loc><lastmod>2019-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximations-of-isomorphism-and-logics-with-linear-algebraic-operators-1902.06648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximations-of-isomorphism-and-logics-with-linear-algebraic-operators-1902.06648"/></url>
<url><loc>https://scifaro.com/en/abs/a-static-higher-order-dependency-pair-framework-1902.06733</loc><lastmod>2019-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-static-higher-order-dependency-pair-framework-1902.06733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-static-higher-order-dependency-pair-framework-1902.06733"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-base-cirquent-calculus-ii-choice-quantifiers-1902.07123</loc><lastmod>2019-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-base-cirquent-calculus-ii-choice-quantifiers-1902.07123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-base-cirquent-calculus-ii-choice-quantifiers-1902.07123"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-substitution-at-one-fell-swoop-1902.07230</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-substitution-at-one-fell-swoop-1902.07230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-substitution-at-one-fell-swoop-1902.07230"/></url>
<url><loc>https://scifaro.com/en/abs/an-adequate-while-language-for-hybrid-computation-1902.07684</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-adequate-while-language-for-hybrid-computation-1902.07684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-adequate-while-language-for-hybrid-computation-1902.07684"/></url>
<url><loc>https://scifaro.com/en/abs/founded-world-views-with-autoepistemic-equilibrium-logic-1902.07741</loc><lastmod>2019-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/founded-world-views-with-autoepistemic-equilibrium-logic-1902.07741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/founded-world-views-with-autoepistemic-equilibrium-logic-1902.07741"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatisation-of-reversible-kleene-lattices-1902.08048</loc><lastmod>2019-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatisation-of-reversible-kleene-lattices-1902.08048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatisation-of-reversible-kleene-lattices-1902.08048"/></url>
<url><loc>https://scifaro.com/en/abs/schematic-refutations-of-formula-schemata-1902.08055</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/schematic-refutations-of-formula-schemata-1902.08055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/schematic-refutations-of-formula-schemata-1902.08055"/></url>
<url><loc>https://scifaro.com/en/abs/on-nominal-syntax-and-permutation-fixed-points-1902.08345</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-nominal-syntax-and-permutation-fixed-points-1902.08345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-nominal-syntax-and-permutation-fixed-points-1902.08345"/></url>
<url><loc>https://scifaro.com/en/abs/fast-computations-on-ordered-nominal-sets-1902.08414</loc><lastmod>2022-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-computations-on-ordered-nominal-sets-1902.08414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-computations-on-ordered-nominal-sets-1902.08414"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-total-correctness-to-partial-correctness-by-a-transformation-of-the-language-semantics-1902.08419</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-total-correctness-to-partial-correctness-by-a-transformation-of-the-language-semantics-1902.08419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-total-correctness-to-partial-correctness-by-a-transformation-of-the-language-semantics-1902.08419"/></url>
<url><loc>https://scifaro.com/en/abs/automating-the-diagram-method-to-prove-correctness-of-program-transformations-1902.08420</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-the-diagram-method-to-prove-correctness-of-program-transformations-1902.08420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-the-diagram-method-to-prove-correctness-of-program-transformations-1902.08420"/></url>
<url><loc>https://scifaro.com/en/abs/on-transforming-functions-accessing-global-variables-into-logically-constrained-term-rewriting-systems-1902.08421</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-transforming-functions-accessing-global-variables-into-logically-constrained-term-rewriting-systems-1902.08421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-transforming-functions-accessing-global-variables-into-logically-constrained-term-rewriting-systems-1902.08421"/></url>
<url><loc>https://scifaro.com/en/abs/on-transforming-narrowing-trees-into-regular-tree-grammars-generating-ranges-of-substitutions-1902.08423</loc><lastmod>2019-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-transforming-narrowing-trees-into-regular-tree-grammars-generating-ranges-of-substitutions-1902.08423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-transforming-narrowing-trees-into-regular-tree-grammars-generating-ranges-of-substitutions-1902.08423"/></url>
<url><loc>https://scifaro.com/en/abs/fully-automatic-verified-classification-of-all-frankl-complete-fc-6-set-families-1902.08765</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-automatic-verified-classification-of-all-frankl-complete-fc-6-set-families-1902.08765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-automatic-verified-classification-of-all-frankl-complete-fc-6-set-families-1902.08765"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-study-on-ctl-model-checking-using-machine-learning-1902.08789</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-study-on-ctl-model-checking-using-machine-learning-1902.08789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-study-on-ctl-model-checking-using-machine-learning-1902.08789"/></url>
<url><loc>https://scifaro.com/en/abs/automated-proof-search-system-for-logic-of-correlated-knowledge-1902.08847</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-proof-search-system-for-logic-of-correlated-knowledge-1902.08847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-proof-search-system-for-logic-of-correlated-knowledge-1902.08847"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-type-theory-and-universe-hierarchies-1902.08848</loc><lastmod>2019-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-type-theory-and-universe-hierarchies-1902.08848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-type-theory-and-universe-hierarchies-1902.08848"/></url>
<url><loc>https://scifaro.com/en/abs/homogenousness-and-specificity-1902.09214</loc><lastmod>2019-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homogenousness-and-specificity-1902.09214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homogenousness-and-specificity-1902.09214"/></url>
<url><loc>https://scifaro.com/en/abs/dependent-choice-as-a-termination-principle-1902.09539</loc><lastmod>2019-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependent-choice-as-a-termination-principle-1902.09539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependent-choice-as-a-termination-principle-1902.09539"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-linear-time-correctness-condition-for-multiplicative-linear-logic-1902.09693</loc><lastmod>2020-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-linear-time-correctness-condition-for-multiplicative-linear-logic-1902.09693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-linear-time-correctness-condition-for-multiplicative-linear-logic-1902.09693"/></url>
<url><loc>https://scifaro.com/en/abs/adding-the-power-set-to-description-logics-1902.09844</loc><lastmod>2019-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-the-power-set-to-description-logics-1902.09844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-the-power-set-to-description-logics-1902.09844"/></url>
<url><loc>https://scifaro.com/en/abs/correct-and-efficient-antichain-algorithms-for-refinement-checking-1902.09880</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-and-efficient-antichain-algorithms-for-refinement-checking-1902.09880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-and-efficient-antichain-algorithms-for-refinement-checking-1902.09880"/></url>
<url><loc>https://scifaro.com/en/abs/sld-resolution-reduction-of-second-order-horn-fragments-technical-report-1902.09900</loc><lastmod>2019-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sld-resolution-reduction-of-second-order-horn-fragments-technical-report-1902.09900"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sld-resolution-reduction-of-second-order-horn-fragments-technical-report-1902.09900"/></url>
<url><loc>https://scifaro.com/en/abs/hochc-a-refutationally-complete-and-semantically-invariant-system-of-higher-order-logic-modulo-theories-1902.10396</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hochc-a-refutationally-complete-and-semantically-invariant-system-of-higher-order-logic-modulo-theories-1902.10396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hochc-a-refutationally-complete-and-semantically-invariant-system-of-higher-order-logic-modulo-theories-1902.10396"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-invariants-for-linear-hybrid-automata-1902.10452</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-invariants-for-linear-hybrid-automata-1902.10452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-invariants-for-linear-hybrid-automata-1902.10452"/></url>
<url><loc>https://scifaro.com/en/abs/from-cubes-to-twisted-cubes-via-graph-morphisms-in-type-theory-1902.10820</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-cubes-to-twisted-cubes-via-graph-morphisms-in-type-theory-1902.10820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-cubes-to-twisted-cubes-via-graph-morphisms-in-type-theory-1902.10820"/></url>
<url><loc>https://scifaro.com/en/abs/representing-continuous-functions-between-greatest-fixed-points-of-indexed-containers-1902.10971</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-continuous-functions-between-greatest-fixed-points-of-indexed-containers-1902.10971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-continuous-functions-between-greatest-fixed-points-of-indexed-containers-1902.10971"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-higher-order-probabilistic-programs-with-conditioning-1902.11189</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-higher-order-probabilistic-programs-with-conditioning-1902.11189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-higher-order-probabilistic-programs-with-conditioning-1902.11189"/></url>
<url><loc>https://scifaro.com/en/abs/sequentiality-of-string-to-context-transducers-1902.11263</loc><lastmod>2019-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequentiality-of-string-to-context-transducers-1902.11263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequentiality-of-string-to-context-transducers-1902.11263"/></url>
<url><loc>https://scifaro.com/en/abs/relational-differential-dynamic-logic-1903.00153</loc><lastmod>2020-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-differential-dynamic-logic-1903.00153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-differential-dynamic-logic-1903.00153"/></url>
<url><loc>https://scifaro.com/en/abs/modular-specification-of-monads-through-higher-order-presentations-1903.00922</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-specification-of-monads-through-higher-order-presentations-1903.00922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-specification-of-monads-through-higher-order-presentations-1903.00922"/></url>
<url><loc>https://scifaro.com/en/abs/differentiable-causal-computations-via-delayed-trace-1903.01093</loc><lastmod>2019-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentiable-causal-computations-via-delayed-trace-1903.01093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentiable-causal-computations-via-delayed-trace-1903.01093"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-relational-decomposition-1903.01368</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-relational-decomposition-1903.01368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-relational-decomposition-1903.01368"/></url>
<url><loc>https://scifaro.com/en/abs/pinaka-symbolic-execution-meets-incremental-solving-competition-contribution-1903.02309</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pinaka-symbolic-execution-meets-incremental-solving-competition-contribution-1903.02309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pinaka-symbolic-execution-meets-incremental-solving-competition-contribution-1903.02309"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-succinctness-of-atoms-of-dependency-1903.02344</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-succinctness-of-atoms-of-dependency-1903.02344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-succinctness-of-atoms-of-dependency-1903.02344"/></url>
<url><loc>https://scifaro.com/en/abs/grunge-a-grand-unified-atp-challenge-1903.02539</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grunge-a-grand-unified-atp-challenge-1903.02539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grunge-a-grand-unified-atp-challenge-1903.02539"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-computation-of-concept-diagrams-1903.02593</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-computation-of-concept-diagrams-1903.02593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-computation-of-concept-diagrams-1903.02593"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-approach-to-the-existence-of-ideal-objects-in-commutative-algebra-1903.03070</loc><lastmod>2019-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-approach-to-the-existence-of-ideal-objects-in-commutative-algebra-1903.03070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-approach-to-the-existence-of-ideal-objects-in-commutative-algebra-1903.03070"/></url>
<url><loc>https://scifaro.com/en/abs/local-reasoning-for-parameterized-first-order-protocols-1903.03218</loc><lastmod>2019-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-reasoning-for-parameterized-first-order-protocols-1903.03218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-reasoning-for-parameterized-first-order-protocols-1903.03218"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-of-deterministic-polylogarithmic-time-and-space-1903.03413</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-of-deterministic-polylogarithmic-time-and-space-1903.03413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-of-deterministic-polylogarithmic-time-and-space-1903.03413"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-bigraphs-an-exercise-in-fuzzy-communicating-agents-1903.03680</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-bigraphs-an-exercise-in-fuzzy-communicating-agents-1903.03680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-bigraphs-an-exercise-in-fuzzy-communicating-agents-1903.03680"/></url>
<url><loc>https://scifaro.com/en/abs/trace-equivalence-and-epistemic-logic-to-express-security-properties-1903.03719</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-equivalence-and-epistemic-logic-to-express-security-properties-1903.03719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-equivalence-and-epistemic-logic-to-express-security-properties-1903.03719"/></url>
<url><loc>https://scifaro.com/en/abs/timed-systems-through-the-lens-of-logic-1903.03773</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-systems-through-the-lens-of-logic-1903.03773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-systems-through-the-lens-of-logic-1903.03773"/></url>
<url><loc>https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-1903.03991</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-1903.03991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dcsynth-guided-reactive-synthesis-with-soft-requirements-1903.03991"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-atl-on-vcgs-1903.04350</loc><lastmod>2019-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-atl-on-vcgs-1903.04350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-atl-on-vcgs-1903.04350"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logics-over-finite-traces-with-uncertainty-technical-report-1903.04940</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logics-over-finite-traces-with-uncertainty-technical-report-1903.04940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logics-over-finite-traces-with-uncertainty-technical-report-1903.04940"/></url>
<url><loc>https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-in-pl-type-theory-1903.05126</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-in-pl-type-theory-1903.05126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-in-pl-type-theory-1903.05126"/></url>
<url><loc>https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-intuitions-and-tutorial-1903.05127</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-intuitions-and-tutorial-1903.05127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-coinduction-and-fixed-points-intuitions-and-tutorial-1903.05127"/></url>
<url><loc>https://scifaro.com/en/abs/effective-local-compactness-and-the-hyperspace-of-located-sets-1903.05490</loc><lastmod>2019-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-local-compactness-and-the-hyperspace-of-located-sets-1903.05490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-local-compactness-and-the-hyperspace-of-located-sets-1903.05490"/></url>
<url><loc>https://scifaro.com/en/abs/a-functional-monadic-second-order-theory-of-infinite-trees-1903.05878</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-functional-monadic-second-order-theory-of-infinite-trees-1903.05878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-functional-monadic-second-order-theory-of-infinite-trees-1903.05878"/></url>
<url><loc>https://scifaro.com/en/abs/mutual-coinduction-1903.06514</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutual-coinduction-1903.06514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutual-coinduction-1903.06514"/></url>
<url><loc>https://scifaro.com/en/abs/lambda-congruences-and-extensionality-1903.06775</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lambda-congruences-and-extensionality-1903.06775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lambda-congruences-and-extensionality-1903.06775"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-uniform-proofs-1903.07371</loc><lastmod>2019-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-uniform-proofs-1903.07371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-uniform-proofs-1903.07371"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-proof-of-dependent-choice-in-classical-arithmetic-via-memoization-1903.07616</loc><lastmod>2019-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-proof-of-dependent-choice-in-classical-arithmetic-via-memoization-1903.07616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-proof-of-dependent-choice-in-classical-arithmetic-via-memoization-1903.07616"/></url>
<url><loc>https://scifaro.com/en/abs/turing-completeness-of-dynamics-in-abstract-persuasion-argumentation-1903.07837</loc><lastmod>2019-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turing-completeness-of-dynamics-in-abstract-persuasion-argumentation-1903.07837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turing-completeness-of-dynamics-in-abstract-persuasion-argumentation-1903.07837"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-covering-the-parameter-space-1903.07993</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-covering-the-parameter-space-1903.07993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-synthesis-for-markov-models-covering-the-parameter-space-1903.07993"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-relational-hoare-logic-with-expectations-1903.08357</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-relational-hoare-logic-with-expectations-1903.08357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-relational-hoare-logic-with-expectations-1903.08357"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-maximal-non-redundant-integer-cone-generators-1903.08571</loc><lastmod>2019-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-maximal-non-redundant-integer-cone-generators-1903.08571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-maximal-non-redundant-integer-cone-generators-1903.08571"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-vector-addition-systems-is-primitive-recursive-in-fixed-dimension-1903.08575</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-vector-addition-systems-is-primitive-recursive-in-fixed-dimension-1903.08575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-vector-addition-systems-is-primitive-recursive-in-fixed-dimension-1903.08575"/></url>
<url><loc>https://scifaro.com/en/abs/multi-adjoint-concept-lattices-via-quantaloid-enriched-categories-1903.08922</loc><lastmod>2021-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-adjoint-concept-lattices-via-quantaloid-enriched-categories-1903.08922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-adjoint-concept-lattices-via-quantaloid-enriched-categories-1903.08922"/></url>
<url><loc>https://scifaro.com/en/abs/a-model-counter-s-guide-to-probabilistic-systems-1903.09354</loc><lastmod>2019-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-model-counter-s-guide-to-probabilistic-systems-1903.09354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-model-counter-s-guide-to-probabilistic-systems-1903.09354"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-logics-based-on-riesz-spaces-1903.09463</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-logics-based-on-riesz-spaces-1903.09463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-logics-based-on-riesz-spaces-1903.09463"/></url>
<url><loc>https://scifaro.com/en/abs/graph-temporal-logic-inference-for-classification-and-identification-1903.09714</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-temporal-logic-inference-for-classification-and-identification-1903.09714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-temporal-logic-inference-for-classification-and-identification-1903.09714"/></url>
<url><loc>https://scifaro.com/en/abs/harnessing-higher-order-meta-logic-to-represent-and-reason-with-complex-ethical-theories-1903.09818</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harnessing-higher-order-meta-logic-to-represent-and-reason-with-complex-ethical-theories-1903.09818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harnessing-higher-order-meta-logic-to-represent-and-reason-with-complex-ethical-theories-1903.09818"/></url>
<url><loc>https://scifaro.com/en/abs/symmetry-reduction-for-the-local-mu-calculus-1903.10405</loc><lastmod>2019-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetry-reduction-for-the-local-mu-calculus-1903.10405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetry-reduction-for-the-local-mu-calculus-1903.10405"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-thresholds-in-inclusion-logic-1903.10706</loc><lastmod>2019-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-thresholds-in-inclusion-logic-1903.10706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-thresholds-in-inclusion-logic-1903.10706"/></url>
<url><loc>https://scifaro.com/en/abs/mghyper-checking-satisfiability-of-hyperltl-formulas-beyond-the-exists-forall-fragment-1903.11138</loc><lastmod>2019-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mghyper-checking-satisfiability-of-hyperltl-formulas-beyond-the-exists-forall-fragment-1903.11138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mghyper-checking-satisfiability-of-hyperltl-formulas-beyond-the-exists-forall-fragment-1903.11138"/></url>
<url><loc>https://scifaro.com/en/abs/local-search-for-fast-matrix-multiplication-1903.11391</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-search-for-fast-matrix-multiplication-1903.11391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-search-for-fast-matrix-multiplication-1903.11391"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-7th-international-workshop-on-theorem-proving-components-for-educational-software-1903.12402</loc><lastmod>2019-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-7th-international-workshop-on-theorem-proving-components-for-educational-software-1903.12402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-7th-international-workshop-on-theorem-proving-components-for-educational-software-1903.12402"/></url>
<url><loc>https://scifaro.com/en/abs/practical-synthesis-of-reactive-systems-from-ltl-specifications-via-parity-games-1903.12576</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-synthesis-of-reactive-systems-from-ltl-specifications-via-parity-games-1903.12576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-synthesis-of-reactive-systems-from-ltl-specifications-via-parity-games-1903.12576"/></url>
<url><loc>https://scifaro.com/en/abs/fooling-the-parallel-or-tester-with-probability-8-27-1903.12653</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fooling-the-parallel-or-tester-with-probability-8-27-1903.12653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fooling-the-parallel-or-tester-with-probability-8-27-1903.12653"/></url>
<url><loc>https://scifaro.com/en/abs/from-db-nets-to-coloured-petri-nets-with-priorities-extended-version-1904.00058</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-db-nets-to-coloured-petri-nets-with-priorities-extended-version-1904.00058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-db-nets-to-coloured-petri-nets-with-priorities-extended-version-1904.00058"/></url>
<url><loc>https://scifaro.com/en/abs/fo-fo3-for-linear-orders-with-monotone-binary-relations-1904.00189</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fo-fo3-for-linear-orders-with-monotone-binary-relations-1904.00189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fo-fo3-for-linear-orders-with-monotone-binary-relations-1904.00189"/></url>
<url><loc>https://scifaro.com/en/abs/ontology-focusing-knowledge-enriched-databases-on-demand-1904.00195</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ontology-focusing-knowledge-enriched-databases-on-demand-1904.00195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ontology-focusing-knowledge-enriched-databases-on-demand-1904.00195"/></url>
<url><loc>https://scifaro.com/en/abs/students-proof-assistant-spa-1904.00617</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/students-proof-assistant-spa-1904.00617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/students-proof-assistant-spa-1904.00617"/></url>
<url><loc>https://scifaro.com/en/abs/natural-deduction-assistant-nadea-1904.00618</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-deduction-assistant-nadea-1904.00618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-deduction-assistant-nadea-1904.00618"/></url>
<url><loc>https://scifaro.com/en/abs/towards-ranking-geometric-automated-theorem-provers-1904.00619</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-ranking-geometric-automated-theorem-provers-1904.00619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-ranking-geometric-automated-theorem-provers-1904.00619"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-and-algorithm-checking-for-courses-on-logic-and-formal-methods-1904.00620</loc><lastmod>2019-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-and-algorithm-checking-for-courses-on-logic-and-formal-methods-1904.00620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-and-algorithm-checking-for-courses-on-logic-and-formal-methods-1904.00620"/></url>
<url><loc>https://scifaro.com/en/abs/categories-with-families-unityped-simply-typed-and-dependently-typed-1904.00827</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categories-with-families-unityped-simply-typed-and-dependently-typed-1904.00827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categories-with-families-unityped-simply-typed-and-dependently-typed-1904.00827"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-for-feller-dynkin-processes-1904.00976</loc><lastmod>2024-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-for-feller-dynkin-processes-1904.00976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-for-feller-dynkin-processes-1904.00976"/></url>
<url><loc>https://scifaro.com/en/abs/towards-intuitive-reasoning-in-axiomatic-geometry-1904.01006</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-intuitive-reasoning-in-axiomatic-geometry-1904.01006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-intuitive-reasoning-in-axiomatic-geometry-1904.01006"/></url>
<url><loc>https://scifaro.com/en/abs/working-with-first-order-proofs-and-provers-1904.01079</loc><lastmod>2019-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/working-with-first-order-proofs-and-provers-1904.01079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/working-with-first-order-proofs-and-provers-1904.01079"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-results-for-the-synthesis-of-b-bounded-petri-nets-technical-report-1904.01094</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-results-for-the-synthesis-of-b-bounded-petri-nets-technical-report-1904.01094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-results-for-the-synthesis-of-b-bounded-petri-nets-technical-report-1904.01094"/></url>
<url><loc>https://scifaro.com/en/abs/aiming-low-is-harder-induction-for-lower-bounds-in-probabilistic-program-verification-1904.01117</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aiming-low-is-harder-induction-for-lower-bounds-in-probabilistic-program-verification-1904.01117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aiming-low-is-harder-induction-for-lower-bounds-in-probabilistic-program-verification-1904.01117"/></url>
<url><loc>https://scifaro.com/en/abs/on-transitive-modal-many-valued-logics-1904.01407</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-transitive-modal-many-valued-logics-1904.01407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-transitive-modal-many-valued-logics-1904.01407"/></url>
<url><loc>https://scifaro.com/en/abs/fundamentals-of-computability-logic-2020-1904.01431</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fundamentals-of-computability-logic-2020-1904.01431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fundamentals-of-computability-logic-2020-1904.01431"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-reachability-in-parametric-markov-decision-processes-1904.01503</loc><lastmod>2019-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-reachability-in-parametric-markov-decision-processes-1904.01503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-reachability-in-parametric-markov-decision-processes-1904.01503"/></url>
<url><loc>https://scifaro.com/en/abs/architectures-in-parametric-component-based-systems-qualitative-and-quantitative-modelling-1904.02222</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/architectures-in-parametric-component-based-systems-qualitative-and-quantitative-modelling-1904.02222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/architectures-in-parametric-component-based-systems-qualitative-and-quantitative-modelling-1904.02222"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-k-induction-learning-from-counterexamples-to-bidirectionally-explore-the-state-space-1904.02501</loc><lastmod>2019-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-k-induction-learning-from-counterexamples-to-bidirectionally-explore-the-state-space-1904.02501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-k-induction-learning-from-counterexamples-to-bidirectionally-explore-the-state-space-1904.02501"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logics-for-nominal-transition-systems-1904.02564</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logics-for-nominal-transition-systems-1904.02564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logics-for-nominal-transition-systems-1904.02564"/></url>
<url><loc>https://scifaro.com/en/abs/towards-specifying-symbolic-computation-1904.02729</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-specifying-symbolic-computation-1904.02729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-specifying-symbolic-computation-1904.02729"/></url>
<url><loc>https://scifaro.com/en/abs/holist-an-environment-for-machine-learning-of-higher-order-theorem-proving-1904.03241</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/holist-an-environment-for-machine-learning-of-higher-order-theorem-proving-1904.03241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/holist-an-environment-for-machine-learning-of-higher-order-theorem-proving-1904.03241"/></url>
<url><loc>https://scifaro.com/en/abs/system-fr-as-foundations-for-stainless-1904.03482</loc><lastmod>2020-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-fr-as-foundations-for-stainless-1904.03482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-fr-as-foundations-for-stainless-1904.03482"/></url>
<url><loc>https://scifaro.com/en/abs/cause-mining-and-controller-synthesis-with-stl-1904.03649</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cause-mining-and-controller-synthesis-with-stl-1904.03649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cause-mining-and-controller-synthesis-with-stl-1904.03649"/></url>
<url><loc>https://scifaro.com/en/abs/the-categorical-equivalence-between-disjunctive-sequent-calculi-and-algebraic-l-domains-1904.03671</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-categorical-equivalence-between-disjunctive-sequent-calculi-and-algebraic-l-domains-1904.03671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-categorical-equivalence-between-disjunctive-sequent-calculi-and-algebraic-l-domains-1904.03671"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchic-superposition-revisited-1904.03776</loc><lastmod>2019-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchic-superposition-revisited-1904.03776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchic-superposition-revisited-1904.03776"/></url>
<url><loc>https://scifaro.com/en/abs/fifty-years-of-hoare-s-logic-1904.03917</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fifty-years-of-hoare-s-logic-1904.03917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fifty-years-of-hoare-s-logic-1904.03917"/></url>
<url><loc>https://scifaro.com/en/abs/verification-logics-for-quantum-programs-1904.04304</loc><lastmod>2019-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-logics-for-quantum-programs-1904.04304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-logics-for-quantum-programs-1904.04304"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-block-based-cloud-storage-systems-1904.04442</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-block-based-cloud-storage-systems-1904.04442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-block-based-cloud-storage-systems-1904.04442"/></url>
<url><loc>https://scifaro.com/en/abs/one-dimensional-guarded-fragments-1904.04572</loc><lastmod>2019-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-dimensional-guarded-fragments-1904.04572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-dimensional-guarded-fragments-1904.04572"/></url>
<url><loc>https://scifaro.com/en/abs/predicative-proof-theory-of-pdl-and-basic-applications-1904.05131</loc><lastmod>2021-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicative-proof-theory-of-pdl-and-basic-applications-1904.05131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicative-proof-theory-of-pdl-and-basic-applications-1904.05131"/></url>
<url><loc>https://scifaro.com/en/abs/homogeneous-length-functions-on-groups-intertwined-computer-human-proofs-1904.05214</loc><lastmod>2019-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homogeneous-length-functions-on-groups-intertwined-computer-human-proofs-1904.05214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homogeneous-length-functions-on-groups-intertwined-computer-human-proofs-1904.05214"/></url>
<url><loc>https://scifaro.com/en/abs/parametrised-complexity-of-model-checking-and-satisfiability-in-propositional-dependence-logic-1904.06107</loc><lastmod>2020-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametrised-complexity-of-model-checking-and-satisfiability-in-propositional-dependence-logic-1904.06107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametrised-complexity-of-model-checking-and-satisfiability-in-propositional-dependence-logic-1904.06107"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-1904.06159</loc><lastmod>2019-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-1904.06159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-1904.06159"/></url>
<url><loc>https://scifaro.com/en/abs/transforming-opacity-verification-to-nonblocking-verification-in-modular-systems-1904.06242</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transforming-opacity-verification-to-nonblocking-verification-in-modular-systems-1904.06242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transforming-opacity-verification-to-nonblocking-verification-in-modular-systems-1904.06242"/></url>
<url><loc>https://scifaro.com/en/abs/verified-optimization-in-a-quantum-intermediate-representation-1904.06319</loc><lastmod>2019-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-optimization-in-a-quantum-intermediate-representation-1904.06319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-optimization-in-a-quantum-intermediate-representation-1904.06319"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theory-for-cartesian-closed-bicategories-1904.06538</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theory-for-cartesian-closed-bicategories-1904.06538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theory-for-cartesian-closed-bicategories-1904.06538"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-automated-trading-systems-in-a-concurrent-linear-framework-1904.06844</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-automated-trading-systems-in-a-concurrent-linear-framework-1904.06844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-automated-trading-systems-in-a-concurrent-linear-framework-1904.06844"/></url>
<url><loc>https://scifaro.com/en/abs/the-bang-calculus-and-the-two-girard-s-translations-1904.06845</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bang-calculus-and-the-two-girard-s-translations-1904.06845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bang-calculus-and-the-two-girard-s-translations-1904.06845"/></url>
<url><loc>https://scifaro.com/en/abs/from-linear-logic-to-cyclic-sharing-1904.06846</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-linear-logic-to-cyclic-sharing-1904.06846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-linear-logic-to-cyclic-sharing-1904.06846"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-lambek-calculus-with-an-exchange-modality-1904.06847</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-lambek-calculus-with-an-exchange-modality-1904.06847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-lambek-calculus-with-an-exchange-modality-1904.06847"/></url>
<url><loc>https://scifaro.com/en/abs/taking-linear-logic-apart-1904.06848</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taking-linear-logic-apart-1904.06848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taking-linear-logic-apart-1904.06848"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-interaction-graphs-1904.06849</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-interaction-graphs-1904.06849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-interaction-graphs-1904.06849"/></url>
<url><loc>https://scifaro.com/en/abs/the-illtp-library-for-intuitionistic-linear-logic-1904.06850</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-illtp-library-for-intuitionistic-linear-logic-1904.06850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-illtp-library-for-intuitionistic-linear-logic-1904.06850"/></url>
<url><loc>https://scifaro.com/en/abs/model-comparison-games-for-horn-description-logics-1904.06919</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-comparison-games-for-horn-description-logics-1904.06919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-comparison-games-for-horn-description-logics-1904.06919"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-admissible-shields-1904.06938</loc><lastmod>2019-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-admissible-shields-1904.06938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-admissible-shields-1904.06938"/></url>
<url><loc>https://scifaro.com/en/abs/non-sequential-theory-of-distributed-systems-1904.06942</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-sequential-theory-of-distributed-systems-1904.06942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-sequential-theory-of-distributed-systems-1904.06942"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-conversion-and-moment-bisimulation-for-stochastic-rewriting-systems-1904.07313</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-conversion-and-moment-bisimulation-for-stochastic-rewriting-systems-1904.07313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-conversion-and-moment-bisimulation-for-stochastic-rewriting-systems-1904.07313"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-description-logic-system-with-knowledge-element-based-on-alc-1904.07469</loc><lastmod>2019-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-description-logic-system-with-knowledge-element-based-on-alc-1904.07469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-description-logic-system-with-knowledge-element-based-on-alc-1904.07469"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-string-diagrams-1904.07534</loc><lastmod>2019-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-string-diagrams-1904.07534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-string-diagrams-1904.07534"/></url>
<url><loc>https://scifaro.com/en/abs/unification-and-combination-of-a-class-of-traversal-strategies-made-with-pattern-matching-and-fixed-points-1904.07668</loc><lastmod>2021-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-and-combination-of-a-class-of-traversal-strategies-made-with-pattern-matching-and-fixed-points-1904.07668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-and-combination-of-a-class-of-traversal-strategies-made-with-pattern-matching-and-fixed-points-1904.07668"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-for-game-logic-1904.07691</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-for-game-logic-1904.07691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-for-game-logic-1904.07691"/></url>
<url><loc>https://scifaro.com/en/abs/the-5th-reactive-synthesis-competition-syntcomp-2018-benchmarks-participants-results-1904.07736</loc><lastmod>2019-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-5th-reactive-synthesis-competition-syntcomp-2018-benchmarks-participants-results-1904.07736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-5th-reactive-synthesis-competition-syntcomp-2018-benchmarks-participants-results-1904.07736"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-formula-synthesis-method-with-past-signal-temporal-logic-1904.07828</loc><lastmod>2019-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-formula-synthesis-method-with-past-signal-temporal-logic-1904.07828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-formula-synthesis-method-with-past-signal-temporal-logic-1904.07828"/></url>
<url><loc>https://scifaro.com/en/abs/an-axiomatic-approach-to-liveness-for-differential-equations-1904.07984</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-axiomatic-approach-to-liveness-for-differential-equations-1904.07984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-axiomatic-approach-to-liveness-for-differential-equations-1904.07984"/></url>
<url><loc>https://scifaro.com/en/abs/sesqui-pushout-rewriting-concurrency-associativity-and-rule-algebra-framework-1904.08357</loc><lastmod>2019-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sesqui-pushout-rewriting-concurrency-associativity-and-rule-algebra-framework-1904.08357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sesqui-pushout-rewriting-concurrency-associativity-and-rule-algebra-framework-1904.08357"/></url>
<url><loc>https://scifaro.com/en/abs/towards-evolutionary-theorem-proving-for-isabelle-hol-1904.08468</loc><lastmod>2019-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-evolutionary-theorem-proving-for-isabelle-hol-1904.08468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-evolutionary-theorem-proving-for-isabelle-hol-1904.08468"/></url>
<url><loc>https://scifaro.com/en/abs/cubical-syntax-for-reflection-free-extensional-equality-1904.08562</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubical-syntax-for-reflection-free-extensional-equality-1904.08562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubical-syntax-for-reflection-free-extensional-equality-1904.08562"/></url>
<url><loc>https://scifaro.com/en/abs/doping-tests-for-cyber-physical-systems-1904.08641</loc><lastmod>2019-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doping-tests-for-cyber-physical-systems-1904.08641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doping-tests-for-cyber-physical-systems-1904.08641"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-in-the-unitary-sphere-1904.08785</loc><lastmod>2019-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-in-the-unitary-sphere-1904.08785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-in-the-unitary-sphere-1904.08785"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-equivalence-via-modalities-for-algebraic-effects-1904.08843</loc><lastmod>2019-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-equivalence-via-modalities-for-algebraic-effects-1904.08843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-equivalence-via-modalities-for-algebraic-effects-1904.08843"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-mobile-and-spatially-distributed-cyber-physical-systems-1904.08847</loc><lastmod>2019-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-mobile-and-spatially-distributed-cyber-physical-systems-1904.08847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-mobile-and-spatially-distributed-cyber-physical-systems-1904.08847"/></url>
<url><loc>https://scifaro.com/en/abs/true-parallel-graph-transformations-an-algebraic-approach-based-on-weak-spans-1904.08850</loc><lastmod>2019-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/true-parallel-graph-transformations-an-algebraic-approach-based-on-weak-spans-1904.08850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/true-parallel-graph-transformations-an-algebraic-approach-based-on-weak-spans-1904.08850"/></url>
<url><loc>https://scifaro.com/en/abs/compositionality-of-rewriting-rules-with-conditions-1904.09322</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositionality-of-rewriting-rules-with-conditions-1904.09322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositionality-of-rewriting-rules-with-conditions-1904.09322"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-twelfth-workshop-on-developments-in-computational-models-and-ninth-workshop-on-intersection-types-and-related-systems-1904.09561</loc><lastmod>2019-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-twelfth-workshop-on-developments-in-computational-models-and-ninth-workshop-on-intersection-types-and-related-systems-1904.09561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-twelfth-workshop-on-developments-in-computational-models-and-ninth-workshop-on-intersection-types-and-related-systems-1904.09561"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-channels-as-a-categorical-completion-1904.09600</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-channels-as-a-categorical-completion-1904.09600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-channels-as-a-categorical-completion-1904.09600"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-taylor-expansion-of-probabilistic-lambda-terms-long-version-1904.09650</loc><lastmod>2019-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-taylor-expansion-of-probabilistic-lambda-terms-long-version-1904.09650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-taylor-expansion-of-probabilistic-lambda-terms-long-version-1904.09650"/></url>
<url><loc>https://scifaro.com/en/abs/polymorphic-higher-order-termination-1904.09859</loc><lastmod>2019-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polymorphic-higher-order-termination-1904.09859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polymorphic-higher-order-termination-1904.09859"/></url>
<url><loc>https://scifaro.com/en/abs/cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1904.09899</loc><lastmod>2019-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1904.09899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-free-calculi-and-relational-semantics-for-temporal-stit-logics-1904.09899"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-for-unboundedness-problems-1904.10105</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-for-unboundedness-problems-1904.10105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-for-unboundedness-problems-1904.10105"/></url>
<url><loc>https://scifaro.com/en/abs/natural-deduction-and-normalization-proofs-for-the-intersection-type-discipline-1904.10106</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-deduction-and-normalization-proofs-for-the-intersection-type-discipline-1904.10106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-deduction-and-normalization-proofs-for-the-intersection-type-discipline-1904.10106"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-subtyping-with-constructors-1904.10108</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-subtyping-with-constructors-1904.10108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-subtyping-with-constructors-1904.10108"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-fragment-of-term-modal-logic-1904.10260</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-fragment-of-term-modal-logic-1904.10260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-fragment-of-term-modal-logic-1904.10260"/></url>
<url><loc>https://scifaro.com/en/abs/the-theorem-prover-museum-conserving-the-system-heritage-of-automated-reasoning-1904.10414</loc><lastmod>2019-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theorem-prover-museum-conserving-the-system-heritage-of-automated-reasoning-1904.10414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theorem-prover-museum-conserving-the-system-heritage-of-automated-reasoning-1904.10414"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-forcing-and-the-unprovability-of-the-continuum-hypothesis-1904.10570</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-forcing-and-the-unprovability-of-the-continuum-hypothesis-1904.10570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-forcing-and-the-unprovability-of-the-continuum-hypothesis-1904.10570"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-logical-reconstruction-of-intuitionistic-modal-logic-s4-1904.10605</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-logical-reconstruction-of-intuitionistic-modal-logic-s4-1904.10605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-logical-reconstruction-of-intuitionistic-modal-logic-s4-1904.10605"/></url>
<url><loc>https://scifaro.com/en/abs/the-differential-calculus-of-causal-functions-1904.10611</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-differential-calculus-of-causal-functions-1904.10611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-differential-calculus-of-causal-functions-1904.10611"/></url>
<url><loc>https://scifaro.com/en/abs/the-ideal-approach-to-computing-closed-subsets-in-well-quasi-ordering-1904.10703</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ideal-approach-to-computing-closed-subsets-in-well-quasi-ordering-1904.10703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ideal-approach-to-computing-closed-subsets-in-well-quasi-ordering-1904.10703"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-1904.10800</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-1904.10800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-semantic-measure-of-the-execution-time-in-call-by-value-lambda-calculus-1904.10800"/></url>
<url><loc>https://scifaro.com/en/abs/unification-and-combination-of-iterative-insertion-strategies-with-rudimentary-traversals-and-failure-1904.10901</loc><lastmod>2019-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-and-combination-of-iterative-insertion-strategies-with-rudimentary-traversals-and-failure-1904.10901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-and-combination-of-iterative-insertion-strategies-with-rudimentary-traversals-and-failure-1904.10901"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-and-the-array-property-fragment-1904.11381</loc><lastmod>2019-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-and-the-array-property-fragment-1904.11381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-and-the-array-property-fragment-1904.11381"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-logics-for-equivalence-of-effectful-programs-1904.11771</loc><lastmod>2019-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-logics-for-equivalence-of-effectful-programs-1904.11771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-logics-for-equivalence-of-effectful-programs-1904.11771"/></url>
<url><loc>https://scifaro.com/en/abs/a-certifying-extraction-with-time-bounds-from-coq-to-call-by-value-lambda-calculus-1904.11818</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-certifying-extraction-with-time-bounds-from-coq-to-call-by-value-lambda-calculus-1904.11818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-certifying-extraction-with-time-bounds-from-coq-to-call-by-value-lambda-calculus-1904.11818"/></url>
<url><loc>https://scifaro.com/en/abs/differential-logical-relations-part-i-the-simply-typed-case-long-version-1904.12137</loc><lastmod>2019-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-logical-relations-part-i-the-simply-typed-case-long-version-1904.12137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-logical-relations-part-i-the-simply-typed-case-long-version-1904.12137"/></url>
<url><loc>https://scifaro.com/en/abs/parameterised-counting-in-logspace-1904.12156</loc><lastmod>2021-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterised-counting-in-logspace-1904.12156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterised-counting-in-logspace-1904.12156"/></url>
<url><loc>https://scifaro.com/en/abs/tracelets-and-tracelet-analysis-of-compositional-rewriting-systems-1904.12829</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracelets-and-tracelet-analysis-of-compositional-rewriting-systems-1904.12829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracelets-and-tracelet-analysis-of-compositional-rewriting-systems-1904.12829"/></url>
<url><loc>https://scifaro.com/en/abs/qratpre-effective-qbf-preprocessing-via-strong-redundancy-properties-1904.12927</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qratpre-effective-qbf-preprocessing-via-strong-redundancy-properties-1904.12927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qratpre-effective-qbf-preprocessing-via-strong-redundancy-properties-1904.12927"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-incomputability-of-computable-dimension-1904.13112</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-incomputability-of-computable-dimension-1904.13112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-incomputability-of-computable-dimension-1904.13112"/></url>
<url><loc>https://scifaro.com/en/abs/computable-analysis-and-notions-of-continuity-in-coq-1904.13203</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-analysis-and-notions-of-continuity-in-coq-1904.13203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-analysis-and-notions-of-continuity-in-coq-1904.13203"/></url>
<url><loc>https://scifaro.com/en/abs/overlap-algebras-a-constructive-look-at-complete-boolean-algebras-1904.13320</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overlap-algebras-a-constructive-look-at-complete-boolean-algebras-1904.13320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overlap-algebras-a-constructive-look-at-complete-boolean-algebras-1904.13320"/></url>
<url><loc>https://scifaro.com/en/abs/behavioral-program-logic-and-lagc-semantics-without-continuations-technical-report-1904.13338</loc><lastmod>2019-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioral-program-logic-and-lagc-semantics-without-continuations-technical-report-1904.13338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioral-program-logic-and-lagc-semantics-without-continuations-technical-report-1904.13338"/></url>
<url><loc>https://scifaro.com/en/abs/the-sierpinski-object-in-the-scott-realizability-topos-1904.13354</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sierpinski-object-in-the-scott-realizability-topos-1904.13354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sierpinski-object-in-the-scott-realizability-topos-1904.13354"/></url>
<url><loc>https://scifaro.com/en/abs/discrete-time-stochastic-and-deterministic-petri-box-calculus-1905.00456</loc><lastmod>2019-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discrete-time-stochastic-and-deterministic-petri-box-calculus-1905.00456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discrete-time-stochastic-and-deterministic-petri-box-calculus-1905.00456"/></url>
<url><loc>https://scifaro.com/en/abs/computer-science-and-metaphysics-a-cross-fertilization-1905.00787</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-science-and-metaphysics-a-cross-fertilization-1905.00787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-science-and-metaphysics-a-cross-fertilization-1905.00787"/></url>
<url><loc>https://scifaro.com/en/abs/logic-based-specification-and-verification-of-homogeneous-dynamic-multi-agent-systems-1905.00810</loc><lastmod>2020-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-based-specification-and-verification-of-homogeneous-dynamic-multi-agent-systems-1905.00810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-based-specification-and-verification-of-homogeneous-dynamic-multi-agent-systems-1905.00810"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-construction-for-the-computational-definition-of-vector-spaces-1905.01305</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-construction-for-the-computational-definition-of-vector-spaces-1905.01305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-construction-for-the-computational-definition-of-vector-spaces-1905.01305"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-framework-for-p2p-deductive-databases-1905.01545</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-framework-for-p2p-deductive-databases-1905.01545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-framework-for-p2p-deductive-databases-1905.01545"/></url>
<url><loc>https://scifaro.com/en/abs/answer-set-solving-exploiting-treewidth-and-its-limits-1905.01688</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answer-set-solving-exploiting-treewidth-and-its-limits-1905.01688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answer-set-solving-exploiting-treewidth-and-its-limits-1905.01688"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-with-formal-mathematical-documents-in-isabelle-pide-1905.01735</loc><lastmod>2019-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-with-formal-mathematical-documents-in-isabelle-pide-1905.01735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-with-formal-mathematical-documents-in-isabelle-pide-1905.01735"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-proof-search-procedure-and-counter-model-generation-based-on-natural-deduction-bounds-1905.02059</loc><lastmod>2020-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-proof-search-procedure-and-counter-model-generation-based-on-natural-deduction-bounds-1905.02059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-proof-search-procedure-and-counter-model-generation-based-on-natural-deduction-bounds-1905.02059"/></url>
<url><loc>https://scifaro.com/en/abs/integrated-algorithms-for-hex-programs-and-applications-in-machine-learning-1905.02428</loc><lastmod>2019-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrated-algorithms-for-hex-programs-and-applications-in-machine-learning-1905.02428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrated-algorithms-for-hex-programs-and-applications-in-machine-learning-1905.02428"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theory-for-defining-logics-and-proofs-1905.02617</loc><lastmod>2019-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theory-for-defining-logics-and-proofs-1905.02617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theory-for-defining-logics-and-proofs-1905.02617"/></url>
<url><loc>https://scifaro.com/en/abs/optimization-modulo-the-theories-of-signed-bit-vectors-and-floating-point-numbers-1905.02838</loc><lastmod>2019-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimization-modulo-the-theories-of-signed-bit-vectors-and-floating-point-numbers-1905.02838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimization-modulo-the-theories-of-signed-bit-vectors-and-floating-point-numbers-1905.02838"/></url>
<url><loc>https://scifaro.com/en/abs/walk-refinement-walk-logic-and-the-iteration-number-of-the-weisfeiler-leman-algorithm-1905.03008</loc><lastmod>2019-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/walk-refinement-walk-logic-and-the-iteration-number-of-the-weisfeiler-leman-algorithm-1905.03008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/walk-refinement-walk-logic-and-the-iteration-number-of-the-weisfeiler-leman-algorithm-1905.03008"/></url>
<url><loc>https://scifaro.com/en/abs/discovering-and-proving-invariants-in-answer-set-programming-and-planning-1905.03196</loc><lastmod>2019-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discovering-and-proving-invariants-in-answer-set-programming-and-planning-1905.03196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discovering-and-proving-invariants-in-answer-set-programming-and-planning-1905.03196"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-constraint-answer-set-solver-ezsmt-1905.03334</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-constraint-answer-set-solver-ezsmt-1905.03334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-constraint-answer-set-solver-ezsmt-1905.03334"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressivity-and-applicability-of-model-representation-formalisms-1905.03651</loc><lastmod>2019-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressivity-and-applicability-of-model-representation-formalisms-1905.03651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressivity-and-applicability-of-model-representation-formalisms-1905.03651"/></url>
<url><loc>https://scifaro.com/en/abs/a-reconstruction-of-the-multipreference-closure-1905.03855</loc><lastmod>2020-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reconstruction-of-the-multipreference-closure-1905.03855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reconstruction-of-the-multipreference-closure-1905.03855"/></url>
<url><loc>https://scifaro.com/en/abs/horn-clauses-in-hybrid-dynamic-first-order-logic-1905.04146</loc><lastmod>2019-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/horn-clauses-in-hybrid-dynamic-first-order-logic-1905.04146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/horn-clauses-in-hybrid-dynamic-first-order-logic-1905.04146"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-information-flow-in-interactive-systems-1905.04332</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-information-flow-in-interactive-systems-1905.04332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-information-flow-in-interactive-systems-1905.04332"/></url>
<url><loc>https://scifaro.com/en/abs/rough-contact-in-general-rough-mereology-1905.04689</loc><lastmod>2019-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rough-contact-in-general-rough-mereology-1905.04689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rough-contact-in-general-rough-mereology-1905.04689"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-type-proof-systems-for-three-valued-default-logic-1905.04725</loc><lastmod>2019-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-type-proof-systems-for-three-valued-default-logic-1905.04725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-type-proof-systems-for-three-valued-default-logic-1905.04725"/></url>
<url><loc>https://scifaro.com/en/abs/solving-dependency-quantified-boolean-formulas-using-quantifier-localization-1905.04755</loc><lastmod>2021-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-dependency-quantified-boolean-formulas-using-quantifier-localization-1905.04755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-dependency-quantified-boolean-formulas-using-quantifier-localization-1905.04755"/></url>
<url><loc>https://scifaro.com/en/abs/operational-semantics-and-program-verification-using-many-sorted-hybrid-modal-logic-1905.05036</loc><lastmod>2025-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operational-semantics-and-program-verification-using-many-sorted-hybrid-modal-logic-1905.05036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operational-semantics-and-program-verification-using-many-sorted-hybrid-modal-logic-1905.05036"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-semantic-foundations-for-automated-verification-tools-in-isabelle-utp-1905.05500</loc><lastmod>2020-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-semantic-foundations-for-automated-verification-tools-in-isabelle-utp-1905.05500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-semantic-foundations-for-automated-verification-tools-in-isabelle-utp-1905.05500"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-architectures-of-parametric-weighted-component-based-systems-1905.05607</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-architectures-of-parametric-weighted-component-based-systems-1905.05607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-architectures-of-parametric-weighted-component-based-systems-1905.05607"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-logic-reasoning-1905.05665</loc><lastmod>2019-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-logic-reasoning-1905.05665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-logic-reasoning-1905.05665"/></url>
<url><loc>https://scifaro.com/en/abs/holpy-interactive-theorem-proving-in-python-1905.05970</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/holpy-interactive-theorem-proving-in-python-1905.05970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/holpy-interactive-theorem-proving-in-python-1905.05970"/></url>
<url><loc>https://scifaro.com/en/abs/a-non-wellfounded-labelled-proof-system-for-propositional-dynamic-logic-1905.06143</loc><lastmod>2019-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-non-wellfounded-labelled-proof-system-for-propositional-dynamic-logic-1905.06143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-non-wellfounded-labelled-proof-system-for-propositional-dynamic-logic-1905.06143"/></url>
<url><loc>https://scifaro.com/en/abs/extensions-to-justification-theory-1905.06184</loc><lastmod>2019-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensions-to-justification-theory-1905.06184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensions-to-justification-theory-1905.06184"/></url>
<url><loc>https://scifaro.com/en/abs/mechanised-assurance-cases-with-integrated-formal-methods-in-isabelle-1905.06192</loc><lastmod>2019-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanised-assurance-cases-with-integrated-formal-methods-in-isabelle-1905.06192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanised-assurance-cases-with-integrated-formal-methods-in-isabelle-1905.06192"/></url>
<url><loc>https://scifaro.com/en/abs/generic-encodings-of-constructor-rewriting-systems-1905.06233</loc><lastmod>2019-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-encodings-of-constructor-rewriting-systems-1905.06233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-encodings-of-constructor-rewriting-systems-1905.06233"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-cognitive-trust-in-stochastic-multiagent-systems-1905.06627</loc><lastmod>2019-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-cognitive-trust-in-stochastic-multiagent-systems-1905.06627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-cognitive-trust-in-stochastic-multiagent-systems-1905.06627"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-invariant-monadic-second-order-logic-in-the-finite-1905.06668</loc><lastmod>2019-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-invariant-monadic-second-order-logic-in-the-finite-1905.06668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-invariant-monadic-second-order-logic-in-the-finite-1905.06668"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-technology-for-the-archive-of-formal-proofs-with-application-to-mmt-1905.07244</loc><lastmod>2019-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-technology-for-the-archive-of-formal-proofs-with-application-to-mmt-1905.07244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-technology-for-the-archive-of-formal-proofs-with-application-to-mmt-1905.07244"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-for-rm-lp-mln-programs-1905.07550</loc><lastmod>2019-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-for-rm-lp-mln-programs-1905.07550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-for-rm-lp-mln-programs-1905.07550"/></url>
<url><loc>https://scifaro.com/en/abs/is-free-choice-permission-admissible-in-classical-deontic-logic-1905.07696</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-free-choice-permission-admissible-in-classical-deontic-logic-1905.07696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-free-choice-permission-admissible-in-classical-deontic-logic-1905.07696"/></url>
<url><loc>https://scifaro.com/en/abs/desfuncionalizar-para-provar-1905.08368</loc><lastmod>2019-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/desfuncionalizar-para-provar-1905.08368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/desfuncionalizar-para-provar-1905.08368"/></url>
<url><loc>https://scifaro.com/en/abs/checking-robustness-against-snapshot-isolation-1905.08406</loc><lastmod>2019-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-robustness-against-snapshot-isolation-1905.08406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-robustness-against-snapshot-isolation-1905.08406"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-preorders-on-stochastic-systems-logical-topological-and-computational-aspects-1905.08531</loc><lastmod>2019-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-preorders-on-stochastic-systems-logical-topological-and-computational-aspects-1905.08531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-preorders-on-stochastic-systems-logical-topological-and-computational-aspects-1905.08531"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-and-incompleteness-of-synchronous-kleene-algebra-1905.08554</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-and-incompleteness-of-synchronous-kleene-algebra-1905.08554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-and-incompleteness-of-synchronous-kleene-algebra-1905.08554"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-triangular-integer-loops-is-decidable-1905.08664</loc><lastmod>2019-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-triangular-integer-loops-is-decidable-1905.08664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-triangular-integer-loops-is-decidable-1905.08664"/></url>
<url><loc>https://scifaro.com/en/abs/automata-terms-in-a-lazy-wsks-decision-procedure-technical-report-1905.08697</loc><lastmod>2019-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-terms-in-a-lazy-wsks-decision-procedure-technical-report-1905.08697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-terms-in-a-lazy-wsks-decision-procedure-technical-report-1905.08697"/></url>
<url><loc>https://scifaro.com/en/abs/properties-and-extensions-of-alternating-path-relevance-i-1905.08842</loc><lastmod>2019-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-and-extensions-of-alternating-path-relevance-i-1905.08842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-and-extensions-of-alternating-path-relevance-i-1905.08842"/></url>
<url><loc>https://scifaro.com/en/abs/condition-decision-duality-and-the-internal-logic-of-extensive-restriction-categories-1905.09181</loc><lastmod>2020-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/condition-decision-duality-and-the-internal-logic-of-extensive-restriction-categories-1905.09181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/condition-decision-duality-and-the-internal-logic-of-extensive-restriction-categories-1905.09181"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-reasoning-on-textit-dl-lite-cal-r-with-defeasibility-1905.09221</loc><lastmod>2019-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-reasoning-on-textit-dl-lite-cal-r-with-defeasibility-1905.09221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-reasoning-on-textit-dl-lite-cal-r-with-defeasibility-1905.09221"/></url>
<url><loc>https://scifaro.com/en/abs/a-cdcl-style-calculus-for-solving-non-linear-constraints-1905.09227</loc><lastmod>2019-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cdcl-style-calculus-for-solving-non-linear-constraints-1905.09227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cdcl-style-calculus-for-solving-non-linear-constraints-1905.09227"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-prove-theorems-via-interacting-with-proof-assistants-1905.09381</loc><lastmod>2019-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-prove-theorems-via-interacting-with-proof-assistants-1905.09381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-prove-theorems-via-interacting-with-proof-assistants-1905.09381"/></url>
<url><loc>https://scifaro.com/en/abs/lewisian-fixed-points-i-two-incomparable-constructions-1905.09450</loc><lastmod>2019-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lewisian-fixed-points-i-two-incomparable-constructions-1905.09450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lewisian-fixed-points-i-two-incomparable-constructions-1905.09450"/></url>
<url><loc>https://scifaro.com/en/abs/towards-physical-hybrid-systems-1905.09520</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-physical-hybrid-systems-1905.09520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-physical-hybrid-systems-1905.09520"/></url>
<url><loc>https://scifaro.com/en/abs/non-finitely-axiomatisable-modal-product-logics-with-infinite-canonical-axiomatisations-1905.09536</loc><lastmod>2020-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-finitely-axiomatisable-modal-product-logics-with-infinite-canonical-axiomatisations-1905.09536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-finitely-axiomatisable-modal-product-logics-with-infinite-canonical-axiomatisations-1905.09536"/></url>
<url><loc>https://scifaro.com/en/abs/computing-expected-runtimes-for-constant-probability-programs-1905.09544</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-expected-runtimes-for-constant-probability-programs-1905.09544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-expected-runtimes-for-constant-probability-programs-1905.09544"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-an-expressive-description-logic-with-rational-grading-1905.10338</loc><lastmod>2019-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-an-expressive-description-logic-with-rational-grading-1905.10338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-an-expressive-description-logic-with-rational-grading-1905.10338"/></url>
<url><loc>https://scifaro.com/en/abs/towards-bit-width-independent-proofs-in-smt-solvers-1905.10434</loc><lastmod>2019-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-bit-width-independent-proofs-in-smt-solvers-1905.10434"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-bit-width-independent-proofs-in-smt-solvers-1905.10434"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-constructive-truth-and-falsity-in-peano-arithmetic-1905.10494</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-constructive-truth-and-falsity-in-peano-arithmetic-1905.10494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-constructive-truth-and-falsity-in-peano-arithmetic-1905.10494"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-reactive-synthesis-of-robust-controllers-1905.11157</loc><lastmod>2019-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-reactive-synthesis-of-robust-controllers-1905.11157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-reactive-synthesis-of-robust-controllers-1905.11157"/></url>
<url><loc>https://scifaro.com/en/abs/proving-non-termination-via-loop-acceleration-1905.11187</loc><lastmod>2019-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-non-termination-via-loop-acceleration-1905.11187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-non-termination-via-loop-acceleration-1905.11187"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-quality-and-fuzziness-of-strategic-behaviours-1905.11537</loc><lastmod>2019-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-quality-and-fuzziness-of-strategic-behaviours-1905.11537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-quality-and-fuzziness-of-strategic-behaviours-1905.11537"/></url>
<url><loc>https://scifaro.com/en/abs/nil-learning-nonlinear-interpolants-1905.11625</loc><lastmod>2019-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nil-learning-nonlinear-interpolants-1905.11625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nil-learning-nonlinear-interpolants-1905.11625"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-by-critical-pair-analysis-revisited-extended-version-1905.11733</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-by-critical-pair-analysis-revisited-extended-version-1905.11733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-by-critical-pair-analysis-revisited-extended-version-1905.11733"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-reversibility-in-reversing-petri-nets-with-application-to-wireless-communications-1905.11958</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-reversibility-in-reversing-petri-nets-with-application-to-wireless-communications-1905.11958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-reversibility-in-reversing-petri-nets-with-application-to-wireless-communications-1905.11958"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-games-in-dynamic-epistemic-logic-1905.12422</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-games-in-dynamic-epistemic-logic-1905.12422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-games-in-dynamic-epistemic-logic-1905.12422"/></url>
<url><loc>https://scifaro.com/en/abs/on-invariant-synthesis-for-parametric-systems-1905.12524</loc><lastmod>2019-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-invariant-synthesis-for-parametric-systems-1905.12524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-invariant-synthesis-for-parametric-systems-1905.12524"/></url>
<url><loc>https://scifaro.com/en/abs/a-non-repetitive-logic-for-verification-of-dynamic-memory-with-explicit-heap-conjunction-and-disjunction-1905.12944</loc><lastmod>2019-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-non-repetitive-logic-for-verification-of-dynamic-memory-with-explicit-heap-conjunction-and-disjunction-1905.12944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-non-repetitive-logic-for-verification-of-dynamic-memory-with-explicit-heap-conjunction-and-disjunction-1905.12944"/></url>
<url><loc>https://scifaro.com/en/abs/data-complexity-and-rewritability-of-ontology-mediated-queries-in-metric-temporal-logic-under-the-event-based-semantics-full-version-1905.12990</loc><lastmod>2019-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-complexity-and-rewritability-of-ontology-mediated-queries-in-metric-temporal-logic-under-the-event-based-semantics-full-version-1905.12990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-complexity-and-rewritability-of-ontology-mediated-queries-in-metric-temporal-logic-under-the-event-based-semantics-full-version-1905.12990"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-multi-case-data-aware-bpmn-1905.12991</loc><lastmod>2019-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-multi-case-data-aware-bpmn-1905.12991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-multi-case-data-aware-bpmn-1905.12991"/></url>
<url><loc>https://scifaro.com/en/abs/towards-finding-longer-proofs-1905.13100</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-finding-longer-proofs-1905.13100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-finding-longer-proofs-1905.13100"/></url>
<url><loc>https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-ii-1905.13157</loc><lastmod>2020-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-ii-1905.13157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rules-with-parameters-in-modal-logic-ii-1905.13157"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-and-extending-incremental-determinization-for-2qbf-1905.13411</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-and-extending-incremental-determinization-for-2qbf-1905.13411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-and-extending-incremental-determinization-for-2qbf-1905.13411"/></url>
<url><loc>https://scifaro.com/en/abs/differential-equation-invariance-axiomatization-1905.13429</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-equation-invariance-axiomatization-1905.13429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-equation-invariance-axiomatization-1905.13429"/></url>
<url><loc>https://scifaro.com/en/abs/concurrency-in-boolean-networks-1905.13467</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrency-in-boolean-networks-1905.13467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrency-in-boolean-networks-1905.13467"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-reactive-systems-from-hyperproperties-1905.13511</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-reactive-systems-from-hyperproperties-1905.13511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-reactive-systems-from-hyperproperties-1905.13511"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-quantitative-hyperproperties-1905.13514</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-quantitative-hyperproperties-1905.13514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-quantitative-hyperproperties-1905.13514"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-based-monitoring-of-hyperproperties-1905.13517</loc><lastmod>2019-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-based-monitoring-of-hyperproperties-1905.13517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-based-monitoring-of-hyperproperties-1905.13517"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-predicate-entailment-over-points-to-heaplets-is-syntax-recognition-1906.00217</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-predicate-entailment-over-points-to-heaplets-is-syntax-recognition-1906.00217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-predicate-entailment-over-points-to-heaplets-is-syntax-recognition-1906.00217"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-disclosure-in-data-integration-in-the-presence-of-source-constraints-1906.00624</loc><lastmod>2020-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-disclosure-in-data-integration-in-the-presence-of-source-constraints-1906.00624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-disclosure-in-data-integration-in-the-presence-of-source-constraints-1906.00624"/></url>
<url><loc>https://scifaro.com/en/abs/separation-and-renaming-in-nominal-sets-1906.00763</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-and-renaming-in-nominal-sets-1906.00763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-and-renaming-in-nominal-sets-1906.00763"/></url>
<url><loc>https://scifaro.com/en/abs/an-operational-guide-to-monitorability-1906.00766</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-operational-guide-to-monitorability-1906.00766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-operational-guide-to-monitorability-1906.00766"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-characterization-theorem-for-a-probabilistic-fuzzy-description-logic-1906.00784</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-characterization-theorem-for-a-probabilistic-fuzzy-description-logic-1906.00784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-characterization-theorem-for-a-probabilistic-fuzzy-description-logic-1906.00784"/></url>
<url><loc>https://scifaro.com/en/abs/rvhyper-a-runtime-verification-tool-for-temporal-hyperproperties-1906.00798</loc><lastmod>2019-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rvhyper-a-runtime-verification-tool-for-temporal-hyperproperties-1906.00798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rvhyper-a-runtime-verification-tool-for-temporal-hyperproperties-1906.00798"/></url>
<url><loc>https://scifaro.com/en/abs/on-radically-expanding-the-landscape-of-potential-applications-for-automated-proof-methods-1906.00931</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-radically-expanding-the-landscape-of-potential-applications-for-automated-proof-methods-1906.00931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-radically-expanding-the-landscape-of-potential-applications-for-automated-proof-methods-1906.00931"/></url>
<url><loc>https://scifaro.com/en/abs/bialgebraic-semantics-for-string-diagrams-1906.01519</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bialgebraic-semantics-for-string-diagrams-1906.01519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bialgebraic-semantics-for-string-diagrams-1906.01519"/></url>
<url><loc>https://scifaro.com/en/abs/interpolating-strong-induction-1906.01583</loc><lastmod>2019-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolating-strong-induction-1906.01583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolating-strong-induction-1906.01583"/></url>
<url><loc>https://scifaro.com/en/abs/dynamically-allocated-memory-verification-in-object-oriented-programs-using-prolog-1906.02808</loc><lastmod>2019-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamically-allocated-memory-verification-in-object-oriented-programs-using-prolog-1906.02808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamically-allocated-memory-verification-in-object-oriented-programs-using-prolog-1906.02808"/></url>
<url><loc>https://scifaro.com/en/abs/algebra-of-concurrent-games-1906.03452</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebra-of-concurrent-games-1906.03452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebra-of-concurrent-games-1906.03452"/></url>
<url><loc>https://scifaro.com/en/abs/whither-programs-as-specifications-1906.03557</loc><lastmod>2019-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/whither-programs-as-specifications-1906.03557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/whither-programs-as-specifications-1906.03557"/></url>
<url><loc>https://scifaro.com/en/abs/from-qbfs-to-mall-and-back-via-focussing-fragments-of-multiplicative-additive-linear-logic-for-each-level-of-the-polynomial-hierarchy-1906.03611</loc><lastmod>2020-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-qbfs-to-mall-and-back-via-focussing-fragments-of-multiplicative-additive-linear-logic-for-each-level-of-the-polynomial-hierarchy-1906.03611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-qbfs-to-mall-and-back-via-focussing-fragments-of-multiplicative-additive-linear-logic-for-each-level-of-the-polynomial-hierarchy-1906.03611"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-session-types-extended-version-1906.03836</loc><lastmod>2019-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-session-types-extended-version-1906.03836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-session-types-extended-version-1906.03836"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-the-axiom-of-choice-and-its-equivalent-theorems-1906.03930</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-the-axiom-of-choice-and-its-equivalent-theorems-1906.03930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-the-axiom-of-choice-and-its-equivalent-theorems-1906.03930"/></url>
<url><loc>https://scifaro.com/en/abs/stamina-stochastic-approximate-model-checker-for-infinite-state-analysis-1906.03978</loc><lastmod>2019-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stamina-stochastic-approximate-model-checker-for-infinite-state-analysis-1906.03978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stamina-stochastic-approximate-model-checker-for-infinite-state-analysis-1906.03978"/></url>
<url><loc>https://scifaro.com/en/abs/using-hoare-logic-in-a-process-algebra-setting-1906.04491</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-hoare-logic-in-a-process-algebra-setting-1906.04491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-hoare-logic-in-a-process-algebra-setting-1906.04491"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-graph-rewriting-1906.05170</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-graph-rewriting-1906.05170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-graph-rewriting-1906.05170"/></url>
<url><loc>https://scifaro.com/en/abs/the-halting-paradox-1906.05340</loc><lastmod>2019-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-halting-paradox-1906.05340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-halting-paradox-1906.05340"/></url>
<url><loc>https://scifaro.com/en/abs/two-modes-of-recognition-algebra-coalgebra-and-languages-1906.05573</loc><lastmod>2019-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-modes-of-recognition-algebra-coalgebra-and-languages-1906.05573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-modes-of-recognition-algebra-coalgebra-and-languages-1906.05573"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-denotational-semantics-of-linear-logic-with-least-and-greatest-fixed-points-of-formulas-1906.05593</loc><lastmod>2019-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-denotational-semantics-of-linear-logic-with-least-and-greatest-fixed-points-of-formulas-1906.05593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-denotational-semantics-of-linear-logic-with-least-and-greatest-fixed-points-of-formulas-1906.05593"/></url>
<url><loc>https://scifaro.com/en/abs/the-infty-groupoid-generated-by-an-arbitrary-topological-lambda-model-1906.05729</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-infty-groupoid-generated-by-an-arbitrary-topological-lambda-model-1906.05729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-infty-groupoid-generated-by-an-arbitrary-topological-lambda-model-1906.05729"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-language-for-faceted-dataflow-programs-1906.05937</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-language-for-faceted-dataflow-programs-1906.05937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-language-for-faceted-dataflow-programs-1906.05937"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-term-modal-logics-for-first-order-epistemic-planning-1906.06047</loc><lastmod>2020-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-term-modal-logics-for-first-order-epistemic-planning-1906.06047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-term-modal-logics-for-first-order-epistemic-planning-1906.06047"/></url>
<url><loc>https://scifaro.com/en/abs/extensions-of-generic-dol-for-generic-ontology-design-patterns-1906.06275</loc><lastmod>2019-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensions-of-generic-dol-for-generic-ontology-design-patterns-1906.06275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensions-of-generic-dol-for-generic-ontology-design-patterns-1906.06275"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-analyses-requirements-once-simplifying-testing-verification-in-automotive-model-based-development-1906.07083</loc><lastmod>2019-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-analyses-requirements-once-simplifying-testing-verification-in-automotive-model-based-development-1906.07083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-analyses-requirements-once-simplifying-testing-verification-in-automotive-model-based-development-1906.07083"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-verification-of-hyperproperties-for-cyber-physical-system-1906.07253</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-verification-of-hyperproperties-for-cyber-physical-system-1906.07253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-verification-of-hyperproperties-for-cyber-physical-system-1906.07253"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-data-aware-bpmn-extended-version-1906.07811</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-data-aware-bpmn-extended-version-1906.07811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modeling-and-smt-based-parameterized-verification-of-data-aware-bpmn-extended-version-1906.07811"/></url>
<url><loc>https://scifaro.com/en/abs/lifter-language-to-encode-induction-heuristics-for-isabelle-hol-1906.08084</loc><lastmod>2020-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifter-language-to-encode-induction-heuristics-for-isabelle-hol-1906.08084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifter-language-to-encode-induction-heuristics-for-isabelle-hol-1906.08084"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-representation-by-decision-trees-with-linear-classifiers-1906.08178</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-representation-by-decision-trees-with-linear-classifiers-1906.08178"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-representation-by-decision-trees-with-linear-classifiers-1906.08178"/></url>
<url><loc>https://scifaro.com/en/abs/transformation-of-xml-documents-with-prolog-1906.08361</loc><lastmod>2019-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transformation-of-xml-documents-with-prolog-1906.08361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transformation-of-xml-documents-with-prolog-1906.08361"/></url>
<url><loc>https://scifaro.com/en/abs/unification-of-template-expansion-and-xml-validation-1906.08369</loc><lastmod>2019-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-of-template-expansion-and-xml-validation-1906.08369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-of-template-expansion-and-xml-validation-1906.08369"/></url>
<url><loc>https://scifaro.com/en/abs/gray-box-monitoring-of-hyperproperties-extended-version-1906.08731</loc><lastmod>2019-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gray-box-monitoring-of-hyperproperties-extended-version-1906.08731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gray-box-monitoring-of-hyperproperties-extended-version-1906.08731"/></url>
<url><loc>https://scifaro.com/en/abs/a-topological-application-of-labelled-natural-deduction-1906.09105</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-topological-application-of-labelled-natural-deduction-1906.09105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-topological-application-of-labelled-natural-deduction-1906.09105"/></url>
<url><loc>https://scifaro.com/en/abs/an-alternative-approach-to-the-calculation-of-fundamental-groups-based-on-labeled-natural-deduction-1906.09107</loc><lastmod>2019-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-alternative-approach-to-the-calculation-of-fundamental-groups-based-on-labeled-natural-deduction-1906.09107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-alternative-approach-to-the-calculation-of-fundamental-groups-based-on-labeled-natural-deduction-1906.09107"/></url>
<url><loc>https://scifaro.com/en/abs/the-fluted-fragment-with-transitivity-1906.09131</loc><lastmod>2019-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fluted-fragment-with-transitivity-1906.09131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fluted-fragment-with-transitivity-1906.09131"/></url>
<url><loc>https://scifaro.com/en/abs/verification-and-control-of-turn-based-probabilistic-real-time-games-1906.09142</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-and-control-of-turn-based-probabilistic-real-time-games-1906.09142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-and-control-of-turn-based-probabilistic-real-time-games-1906.09142"/></url>
<url><loc>https://scifaro.com/en/abs/strong-bisimulation-for-control-operators-1906.09370</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-bisimulation-for-control-operators-1906.09370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-bisimulation-for-control-operators-1906.09370"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-approach-to-random-process-model-1906.09541</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-approach-to-random-process-model-1906.09541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-approach-to-random-process-model-1906.09541"/></url>
<url><loc>https://scifaro.com/en/abs/reflecting-algebraically-compact-functors-1906.09649</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflecting-algebraically-compact-functors-1906.09649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflecting-algebraically-compact-functors-1906.09649"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-relational-properties-using-trace-logic-1906.09899</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-relational-properties-using-trace-logic-1906.09899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-relational-properties-using-trace-logic-1906.09899"/></url>
<url><loc>https://scifaro.com/en/abs/from-quantified-ctl-to-qbf-1906.10005</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-quantified-ctl-to-qbf-1906.10005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-quantified-ctl-to-qbf-1906.10005"/></url>
<url><loc>https://scifaro.com/en/abs/tight-polynomial-worst-case-bounds-for-loop-programs-1906.10047</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-polynomial-worst-case-bounds-for-loop-programs-1906.10047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-polynomial-worst-case-bounds-for-loop-programs-1906.10047"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-based-learning-approach-to-explore-diabetes-patient-behaviors-1906.10073</loc><lastmod>2019-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-based-learning-approach-to-explore-diabetes-patient-behaviors-1906.10073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-based-learning-approach-to-explore-diabetes-patient-behaviors-1906.10073"/></url>
<url><loc>https://scifaro.com/en/abs/partial-quantifier-elimination-with-learning-1906.10357</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-quantifier-elimination-with-learning-1906.10357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-quantifier-elimination-with-learning-1906.10357"/></url>
<url><loc>https://scifaro.com/en/abs/a-unifying-framework-for-continuity-and-complexity-in-higher-types-1906.10719</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unifying-framework-for-continuity-and-complexity-in-higher-types-1906.10719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unifying-framework-for-continuity-and-complexity-in-higher-types-1906.10719"/></url>
<url><loc>https://scifaro.com/en/abs/reconfigurable-interaction-for-mas-modelling-1906.10793</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfigurable-interaction-for-mas-modelling-1906.10793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfigurable-interaction-for-mas-modelling-1906.10793"/></url>
<url><loc>https://scifaro.com/en/abs/ilinva-using-abduction-to-generate-loop-invariants-1906.11033</loc><lastmod>2019-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ilinva-using-abduction-to-generate-loop-invariants-1906.11033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ilinva-using-abduction-to-generate-loop-invariants-1906.11033"/></url>
<url><loc>https://scifaro.com/en/abs/on-free-completely-iterative-algebras-1906.11166</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-free-completely-iterative-algebras-1906.11166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-free-completely-iterative-algebras-1906.11166"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalisation-of-the-sparc-tso-memory-model-for-multi-core-machine-code-1906.11203</loc><lastmod>2019-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalisation-of-the-sparc-tso-memory-model-for-multi-core-machine-code-1906.11203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalisation-of-the-sparc-tso-memory-model-for-multi-core-machine-code-1906.11203"/></url>
<url><loc>https://scifaro.com/en/abs/a-stricter-heap-separating-points-to-logic-1906.11319</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stricter-heap-separating-points-to-logic-1906.11319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stricter-heap-separating-points-to-logic-1906.11319"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-pairs-termination-in-dependent-type-theory-modulo-rewriting-1906.11649</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-pairs-termination-in-dependent-type-theory-modulo-rewriting-1906.11649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-pairs-termination-in-dependent-type-theory-modulo-rewriting-1906.11649"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-model-for-proofs-with-costs-1906.11742</loc><lastmod>2019-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-model-for-proofs-with-costs-1906.11742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-model-for-proofs-with-costs-1906.11742"/></url>
<url><loc>https://scifaro.com/en/abs/computing-haar-measures-1906.12220</loc><lastmod>2019-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-haar-measures-1906.12220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-haar-measures-1906.12220"/></url>
<url><loc>https://scifaro.com/en/abs/drat-based-bit-vector-proofs-in-cvc4-1907.00087</loc><lastmod>2019-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drat-based-bit-vector-proofs-in-cvc4-1907.00087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drat-based-bit-vector-proofs-in-cvc4-1907.00087"/></url>
<url><loc>https://scifaro.com/en/abs/rough-concepts-1907.00359</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rough-concepts-1907.00359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rough-concepts-1907.00359"/></url>
<url><loc>https://scifaro.com/en/abs/typed-lambda-calculi-and-superclasses-of-regular-functions-1907.00467</loc><lastmod>2019-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-lambda-calculi-and-superclasses-of-regular-functions-1907.00467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-lambda-calculi-and-superclasses-of-regular-functions-1907.00467"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-approach-for-efficient-navigation-management-of-hybrid-electric-vehicles-on-long-trips-1907.00540</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-approach-for-efficient-navigation-management-of-hybrid-electric-vehicles-on-long-trips-1907.00540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-approach-for-efficient-navigation-management-of-hybrid-electric-vehicles-on-long-trips-1907.00540"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-verification-an-introduction-1907.00555</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-verification-an-introduction-1907.00555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-verification-an-introduction-1907.00555"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-that-a-compiler-preserves-concurrent-value-dependent-information-flow-security-1907.00713</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-that-a-compiler-preserves-concurrent-value-dependent-information-flow-security-1907.00713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-that-a-compiler-preserves-concurrent-value-dependent-information-flow-security-1907.00713"/></url>
<url><loc>https://scifaro.com/en/abs/translating-asynchronous-games-for-distributed-synthesis-full-version-1907.00829</loc><lastmod>2022-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-asynchronous-games-for-distributed-synthesis-full-version-1907.00829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-asynchronous-games-for-distributed-synthesis-full-version-1907.00829"/></url>
<url><loc>https://scifaro.com/en/abs/trimming-graphs-using-clausal-proof-optimization-1907.00929</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trimming-graphs-using-clausal-proof-optimization-1907.00929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trimming-graphs-using-clausal-proof-optimization-1907.00929"/></url>
<url><loc>https://scifaro.com/en/abs/core-first-unit-propagation-1907.01192</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/core-first-unit-propagation-1907.01192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/core-first-unit-propagation-1907.01192"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-cut-elimination-and-backward-proof-search-for-tense-logic-via-linear-nested-sequents-extended-version-1907.01270</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-cut-elimination-and-backward-proof-search-for-tense-logic-via-linear-nested-sequents-extended-version-1907.01270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-cut-elimination-and-backward-proof-search-for-tense-logic-via-linear-nested-sequents-extended-version-1907.01270"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-verified-x86-software-from-scratch-1907.01283</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-verified-x86-software-from-scratch-1907.01283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-verified-x86-software-from-scratch-1907.01283"/></url>
<url><loc>https://scifaro.com/en/abs/domain-aware-session-types-extended-version-1907.01318</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-aware-session-types-extended-version-1907.01318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-aware-session-types-extended-version-1907.01318"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-solution-to-the-cap-set-problem-1907.01449</loc><lastmod>2019-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-solution-to-the-cap-set-problem-1907.01449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-solution-to-the-cap-set-problem-1907.01449"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-decidable-about-parametric-timed-automata-1907.01721</loc><lastmod>2019-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-decidable-about-parametric-timed-automata-1907.01721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-decidable-about-parametric-timed-automata-1907.01721"/></url>
<url><loc>https://scifaro.com/en/abs/repairing-timed-automata-clock-guards-through-abstraction-and-testing-1907.02133</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/repairing-timed-automata-clock-guards-through-abstraction-and-testing-1907.02133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/repairing-timed-automata-clock-guards-through-abstraction-and-testing-1907.02133"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-local-time-semantics-for-networks-of-timed-automata-1907.02296</loc><lastmod>2019-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-local-time-semantics-for-networks-of-timed-automata-1907.02296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-local-time-semantics-for-networks-of-timed-automata-1907.02296"/></url>
<url><loc>https://scifaro.com/en/abs/domain-specific-language-to-encode-induction-heuristics-1907.02594</loc><lastmod>2019-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-specific-language-to-encode-induction-heuristics-1907.02594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-specific-language-to-encode-induction-heuristics-1907.02594"/></url>
<url><loc>https://scifaro.com/en/abs/operational-semantics-of-games-1907.02668</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operational-semantics-of-games-1907.02668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operational-semantics-of-games-1907.02668"/></url>
<url><loc>https://scifaro.com/en/abs/from-lcf-to-isabelle-hol-1907.02836</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-lcf-to-isabelle-hol-1907.02836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-lcf-to-isabelle-hol-1907.02836"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-bisimilarities-are-game-equivalent-1907.02860</loc><lastmod>2019-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-bisimilarities-are-game-equivalent-1907.02860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-bisimilarities-are-game-equivalent-1907.02860"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-composition-and-modular-verification-of-computer-controlled-systems-in-differential-dynamic-logic-1907.02881</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-composition-and-modular-verification-of-computer-controlled-systems-in-differential-dynamic-logic-1907.02881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-composition-and-modular-verification-of-computer-controlled-systems-in-differential-dynamic-logic-1907.02881"/></url>
<url><loc>https://scifaro.com/en/abs/a-neutral-temporal-deontic-stit-logic-1907.03265</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-neutral-temporal-deontic-stit-logic-1907.03265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-neutral-temporal-deontic-stit-logic-1907.03265"/></url>
<url><loc>https://scifaro.com/en/abs/the-yoneda-reduction-of-polymorphic-types-extended-version-1907.03481</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-yoneda-reduction-of-polymorphic-types-extended-version-1907.03481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-yoneda-reduction-of-polymorphic-types-extended-version-1907.03481"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-sixth-workshop-on-horn-clauses-for-verification-and-synthesis-and-third-workshop-on-program-equivalence-and-relational-reasoning-1907.03523</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-workshop-on-horn-clauses-for-verification-and-synthesis-and-third-workshop-on-program-equivalence-and-relational-reasoning-1907.03523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-workshop-on-horn-clauses-for-verification-and-synthesis-and-third-workshop-on-program-equivalence-and-relational-reasoning-1907.03523"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-of-max-plus-linear-systems-via-predicate-abstractions-1907.03564</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-of-max-plus-linear-systems-via-predicate-abstractions-1907.03564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-of-max-plus-linear-systems-via-predicate-abstractions-1907.03564"/></url>
<url><loc>https://scifaro.com/en/abs/unicode-8523-means-parallel-multiplicative-linear-logic-proofs-as-concurrent-functional-programs-1907.03631</loc><lastmod>2019-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unicode-8523-means-parallel-multiplicative-linear-logic-proofs-as-concurrent-functional-programs-1907.03631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unicode-8523-means-parallel-multiplicative-linear-logic-proofs-as-concurrent-functional-programs-1907.03631"/></url>
<url><loc>https://scifaro.com/en/abs/proof-compression-and-np-versus-pspace-part-2-1907.03858</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-compression-and-np-versus-pspace-part-2-1907.03858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-compression-and-np-versus-pspace-part-2-1907.03858"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-probabilistic-alternating-simulation-for-concurrent-games-1907.03928</loc><lastmod>2019-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-probabilistic-alternating-simulation-for-concurrent-games-1907.03928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-probabilistic-alternating-simulation-for-concurrent-games-1907.03928"/></url>
<url><loc>https://scifaro.com/en/abs/ultimate-treeautomizer-chc-comp-tool-description-1907.03998</loc><lastmod>2019-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ultimate-treeautomizer-chc-comp-tool-description-1907.03998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ultimate-treeautomizer-chc-comp-tool-description-1907.03998"/></url>
<url><loc>https://scifaro.com/en/abs/proving-properties-of-sorting-programs-a-case-study-in-horn-clause-verification-1907.03999</loc><lastmod>2019-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-properties-of-sorting-programs-a-case-study-in-horn-clause-verification-1907.03999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-properties-of-sorting-programs-a-case-study-in-horn-clause-verification-1907.03999"/></url>
<url><loc>https://scifaro.com/en/abs/handling-localisation-in-rely-guarantee-concurrency-an-algebraic-approach-1907.04005</loc><lastmod>2019-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/handling-localisation-in-rely-guarantee-concurrency-an-algebraic-approach-1907.04005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/handling-localisation-in-rely-guarantee-concurrency-an-algebraic-approach-1907.04005"/></url>
<url><loc>https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-1907.04036</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-1907.04036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-1907.04036"/></url>
<url><loc>https://scifaro.com/en/abs/making-study-populations-visible-through-knowledge-graphs-1907.04358</loc><lastmod>2019-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-study-populations-visible-through-knowledge-graphs-1907.04358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-study-populations-visible-through-knowledge-graphs-1907.04358"/></url>
<url><loc>https://scifaro.com/en/abs/sat-solvers-and-computer-algebra-systems-a-powerful-combination-for-mathematics-1907.04408</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-solvers-and-computer-algebra-systems-a-powerful-combination-for-mathematics-1907.04408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-solvers-and-computer-algebra-systems-a-powerful-combination-for-mathematics-1907.04408"/></url>
<url><loc>https://scifaro.com/en/abs/the-sat-cas-method-for-combinatorial-search-with-applications-to-best-matrices-1907.04987</loc><lastmod>2019-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sat-cas-method-for-combinatorial-search-with-applications-to-best-matrices-1907.04987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sat-cas-method-for-combinatorial-search-with-applications-to-best-matrices-1907.04987"/></url>
<url><loc>https://scifaro.com/en/abs/addmc-weighted-model-counting-with-algebraic-decision-diagrams-1907.05000</loc><lastmod>2020-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/addmc-weighted-model-counting-with-algebraic-decision-diagrams-1907.05000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/addmc-weighted-model-counting-with-algebraic-decision-diagrams-1907.05000"/></url>
<url><loc>https://scifaro.com/en/abs/from-hybrid-modal-logic-to-matching-logic-and-back-1907.05029</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-hybrid-modal-logic-to-matching-logic-and-back-1907.05029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-hybrid-modal-logic-to-matching-logic-and-back-1907.05029"/></url>
<url><loc>https://scifaro.com/en/abs/the-keys-to-decidable-hyperltl-satisfiability-small-models-or-very-simple-formulas-1907.05070</loc><lastmod>2019-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-keys-to-decidable-hyperltl-satisfiability-small-models-or-very-simple-formulas-1907.05070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-keys-to-decidable-hyperltl-satisfiability-small-models-or-very-simple-formulas-1907.05070"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-model-counting-sparse-xor-constraints-and-minimum-distance-1907.05121</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-model-counting-sparse-xor-constraints-and-minimum-distance-1907.05121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-model-counting-sparse-xor-constraints-and-minimum-distance-1907.05121"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-for-the-computational-lambda-calculus-1907.05706</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-for-the-computational-lambda-calculus-1907.05706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-for-the-computational-lambda-calculus-1907.05706"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-verification-of-uninterpreted-programs-in-nearly-linear-time-1907.05920</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-verification-of-uninterpreted-programs-in-nearly-linear-time-1907.05920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-verification-of-uninterpreted-programs-in-nearly-linear-time-1907.05920"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-epistemic-logic-1907.05995</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-epistemic-logic-1907.05995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-epistemic-logic-1907.05995"/></url>
<url><loc>https://scifaro.com/en/abs/crumbling-abstract-machines-1907.06057</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crumbling-abstract-machines-1907.06057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crumbling-abstract-machines-1907.06057"/></url>
<url><loc>https://scifaro.com/en/abs/sharing-equality-is-linear-1907.06101</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharing-equality-is-linear-1907.06101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharing-equality-is-linear-1907.06101"/></url>
<url><loc>https://scifaro.com/en/abs/solving-mean-payoff-games-via-quasi-dominions-1907.06264</loc><lastmod>2019-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-mean-payoff-games-via-quasi-dominions-1907.06264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-mean-payoff-games-via-quasi-dominions-1907.06264"/></url>
<url><loc>https://scifaro.com/en/abs/time-stamped-claim-logic-1907.06541</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-stamped-claim-logic-1907.06541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-stamped-claim-logic-1907.06541"/></url>
<url><loc>https://scifaro.com/en/abs/minimisation-of-event-structures-1907.07042</loc><lastmod>2019-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimisation-of-event-structures-1907.07042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimisation-of-event-structures-1907.07042"/></url>
<url><loc>https://scifaro.com/en/abs/mutation-testing-with-hyperproperties-1907.07368</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mutation-testing-with-hyperproperties-1907.07368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mutation-testing-with-hyperproperties-1907.07368"/></url>
<url><loc>https://scifaro.com/en/abs/typal-heterogeneous-equality-types-1907.07501</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typal-heterogeneous-equality-types-1907.07501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typal-heterogeneous-equality-types-1907.07501"/></url>
<url><loc>https://scifaro.com/en/abs/shallow-embedding-of-type-theory-is-morally-correct-1907.07562</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shallow-embedding-of-type-theory-is-morally-correct-1907.07562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shallow-embedding-of-type-theory-is-morally-correct-1907.07562"/></url>
<url><loc>https://scifaro.com/en/abs/defining-functions-on-equivalence-classes-1907.07591</loc><lastmod>2019-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defining-functions-on-equivalence-classes-1907.07591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defining-functions-on-equivalence-classes-1907.07591"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-verification-for-timed-event-streams-with-partial-information-1907.07761</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-verification-for-timed-event-streams-with-partial-information-1907.07761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-verification-for-timed-event-streams-with-partial-information-1907.07761"/></url>
<url><loc>https://scifaro.com/en/abs/delta-new-logic-programming-language-and-delta-methodology-for-p-computable-programs-on-turing-complete-languages-1907.07767</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delta-new-logic-programming-language-and-delta-methodology-for-p-computable-programs-on-turing-complete-languages-1907.07767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delta-new-logic-programming-language-and-delta-methodology-for-p-computable-programs-on-turing-complete-languages-1907.07767"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-trading-in-financial-markets-1907.07885</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-trading-in-financial-markets-1907.07885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-trading-in-financial-markets-1907.07885"/></url>
<url><loc>https://scifaro.com/en/abs/priorities-in-tock-csp-1907.07974</loc><lastmod>2019-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/priorities-in-tock-csp-1907.07974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/priorities-in-tock-csp-1907.07974"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-monniaux-problem-in-abstract-interpretation-1907.08257</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-monniaux-problem-in-abstract-interpretation-1907.08257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-monniaux-problem-in-abstract-interpretation-1907.08257"/></url>
<url><loc>https://scifaro.com/en/abs/a-tale-of-two-set-theories-1907.08368</loc><lastmod>2019-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tale-of-two-set-theories-1907.08368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tale-of-two-set-theories-1907.08368"/></url>
<url><loc>https://scifaro.com/en/abs/provenance-analysis-for-logic-and-games-1907.08470</loc><lastmod>2020-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provenance-analysis-for-logic-and-games-1907.08470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provenance-analysis-for-logic-and-games-1907.08470"/></url>
<url><loc>https://scifaro.com/en/abs/are-parametric-markov-chains-monotonic-1907.08491</loc><lastmod>2019-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-parametric-markov-chains-monotonic-1907.08491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-parametric-markov-chains-monotonic-1907.08491"/></url>
<url><loc>https://scifaro.com/en/abs/factoring-derivation-spaces-via-intersection-types-extended-version-1907.08820</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factoring-derivation-spaces-via-intersection-types-extended-version-1907.08820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factoring-derivation-spaces-via-intersection-types-extended-version-1907.08820"/></url>
<url><loc>https://scifaro.com/en/abs/uncertainty-about-evidence-1907.09098</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uncertainty-about-evidence-1907.09098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uncertainty-about-evidence-1907.09098"/></url>
<url><loc>https://scifaro.com/en/abs/credible-information-allowable-information-and-belief-revision-extended-abstract-1907.09099</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/credible-information-allowable-information-and-belief-revision-extended-abstract-1907.09099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/credible-information-allowable-information-and-belief-revision-extended-abstract-1907.09099"/></url>
<url><loc>https://scifaro.com/en/abs/when-do-introspection-axioms-matter-for-multi-agent-epistemic-reasoning-1907.09101</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-do-introspection-axioms-matter-for-multi-agent-epistemic-reasoning-1907.09101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-do-introspection-axioms-matter-for-multi-agent-epistemic-reasoning-1907.09101"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-algebraic-framework-for-non-monotonicity-1907.09103</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-algebraic-framework-for-non-monotonicity-1907.09103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-algebraic-framework-for-non-monotonicity-1907.09103"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-agree-without-understanding-each-other-public-announcement-logic-with-boolean-definitions-1907.09105</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-agree-without-understanding-each-other-public-announcement-logic-with-boolean-definitions-1907.09105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-agree-without-understanding-each-other-public-announcement-logic-with-boolean-definitions-1907.09105"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-approach-for-action-based-default-reasoning-1907.09124</loc><lastmod>2019-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-approach-for-action-based-default-reasoning-1907.09124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-approach-for-action-based-default-reasoning-1907.09124"/></url>
<url><loc>https://scifaro.com/en/abs/founded-auto-epistemic-equilibrium-logic-satisfies-epistemic-splitting-1907.09247</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/founded-auto-epistemic-equilibrium-logic-satisfies-epistemic-splitting-1907.09247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/founded-auto-epistemic-equilibrium-logic-satisfies-epistemic-splitting-1907.09247"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-solvers-for-computing-cautious-consequences-of-asp-programs-1907.09402</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-solvers-for-computing-cautious-consequences-of-asp-programs-1907.09402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-solvers-for-computing-cautious-consequences-of-asp-programs-1907.09402"/></url>
<url><loc>https://scifaro.com/en/abs/better-paracoherent-answer-sets-with-less-resources-1907.09560</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-paracoherent-answer-sets-with-less-resources-1907.09560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-paracoherent-answer-sets-with-less-resources-1907.09560"/></url>
<url><loc>https://scifaro.com/en/abs/codensity-games-for-bisimilarity-1907.09634</loc><lastmod>2019-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/codensity-games-for-bisimilarity-1907.09634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/codensity-games-for-bisimilarity-1907.09634"/></url>
<url><loc>https://scifaro.com/en/abs/cvc4sy-for-sygus-comp-2019-1907.10175</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cvc4sy-for-sygus-comp-2019-1907.10175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cvc4sy-for-sygus-comp-2019-1907.10175"/></url>
<url><loc>https://scifaro.com/en/abs/towards-logical-specification-of-statistical-machine-learning-1907.10327</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-logical-specification-of-statistical-machine-learning-1907.10327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-logical-specification-of-statistical-machine-learning-1907.10327"/></url>
<url><loc>https://scifaro.com/en/abs/anti-unification-in-constraint-logic-programming-1907.10333</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anti-unification-in-constraint-logic-programming-1907.10333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anti-unification-in-constraint-logic-programming-1907.10333"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-proofs-for-asp-the-asp-drupe-format-1907.10389</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-proofs-for-asp-the-asp-drupe-format-1907.10389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-proofs-for-asp-the-asp-drupe-format-1907.10389"/></url>
<url><loc>https://scifaro.com/en/abs/partial-compilation-of-asp-programs-1907.10469</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-compilation-of-asp-programs-1907.10469"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-compilation-of-asp-programs-1907.10469"/></url>
<url><loc>https://scifaro.com/en/abs/social-choice-methods-for-database-aggregation-1907.10492</loc><lastmod>2019-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/social-choice-methods-for-database-aggregation-1907.10492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/social-choice-methods-for-database-aggregation-1907.10492"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-analysis-of-maude-theories-with-narval-1907.10919</loc><lastmod>2019-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-analysis-of-maude-theories-with-narval-1907.10919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-analysis-of-maude-theories-with-narval-1907.10919"/></url>
<url><loc>https://scifaro.com/en/abs/on-uniform-equivalence-of-epistemic-logic-programs-1907.10925</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-uniform-equivalence-of-epistemic-logic-programs-1907.10925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-uniform-equivalence-of-epistemic-logic-programs-1907.10925"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-data-flows-in-concurrent-network-updates-full-version-1907.11061</loc><lastmod>2019-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-data-flows-in-concurrent-network-updates-full-version-1907.11061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-data-flows-in-concurrent-network-updates-full-version-1907.11061"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-explicit-negation-in-answer-set-programming-1907.11467</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-explicit-negation-in-answer-set-programming-1907.11467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-explicit-negation-in-answer-set-programming-1907.11467"/></url>
<url><loc>https://scifaro.com/en/abs/modality-definition-synthesis-for-epistemic-intuitionistic-logic-via-a-theorem-prover-1907.11838</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modality-definition-synthesis-for-epistemic-intuitionistic-logic-via-a-theorem-prover-1907.11838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modality-definition-synthesis-for-epistemic-intuitionistic-logic-via-a-theorem-prover-1907.11838"/></url>
<url><loc>https://scifaro.com/en/abs/relating-two-dialects-of-answer-set-programming-1907.12139</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-two-dialects-of-answer-set-programming-1907.12139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-two-dialects-of-answer-set-programming-1907.12139"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-autarkies-for-dqcnf-1907.12156</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-autarkies-for-dqcnf-1907.12156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-autarkies-for-dqcnf-1907.12156"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-labelling-and-learning-for-parity-game-solving-in-ltl-synthesis-1907.12157</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-labelling-and-learning-for-parity-game-solving-in-ltl-synthesis-1907.12157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-labelling-and-learning-for-parity-game-solving-in-ltl-synthesis-1907.12157"/></url>
<url><loc>https://scifaro.com/en/abs/strengthening-gossip-protocols-using-protocol-dependent-knowledge-1907.12321</loc><lastmod>2019-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strengthening-gossip-protocols-using-protocol-dependent-knowledge-1907.12321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strengthening-gossip-protocols-using-protocol-dependent-knowledge-1907.12321"/></url>
<url><loc>https://scifaro.com/en/abs/generating-theorem-proving-procedures-from-axioms-of-truncated-predicate-calculus-1907.12636</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-theorem-proving-procedures-from-axioms-of-truncated-predicate-calculus-1907.12636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-theorem-proving-procedures-from-axioms-of-truncated-predicate-calculus-1907.12636"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-bounded-model-checking-of-artificial-neural-networks-in-cuda-1907.12933</loc><lastmod>2019-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-bounded-model-checking-of-artificial-neural-networks-in-cuda-1907.12933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-bounded-model-checking-of-artificial-neural-networks-in-cuda-1907.12933"/></url>
<url><loc>https://scifaro.com/en/abs/partially-ordered-automata-and-piecewise-testability-1907.13115</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-ordered-automata-and-piecewise-testability-1907.13115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-ordered-automata-and-piecewise-testability-1907.13115"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-with-classical-connectives-1907.13227</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-with-classical-connectives-1907.13227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-with-classical-connectives-1907.13227"/></url>
<url><loc>https://scifaro.com/en/abs/reward-testing-equivalences-for-processes-1907.13348</loc><lastmod>2019-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reward-testing-equivalences-for-processes-1907.13348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reward-testing-equivalences-for-processes-1907.13348"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-temporal-logic-1908.00158</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-temporal-logic-1908.00158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-temporal-logic-1908.00158"/></url>
<url><loc>https://scifaro.com/en/abs/solving-a-flowshop-scheduling-problem-with-answer-set-programming-exploiting-the-problem-to-reduce-the-number-of-combinations-1908.00183</loc><lastmod>2019-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-a-flowshop-scheduling-problem-with-answer-set-programming-exploiting-the-problem-to-reduce-the-number-of-combinations-1908.00183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-a-flowshop-scheduling-problem-with-answer-set-programming-exploiting-the-problem-to-reduce-the-number-of-combinations-1908.00183"/></url>
<url><loc>https://scifaro.com/en/abs/advances-in-symmetry-breaking-for-sat-modulo-theories-1908.00860</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advances-in-symmetry-breaking-for-sat-modulo-theories-1908.00860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advances-in-symmetry-breaking-for-sat-modulo-theories-1908.00860"/></url>
<url><loc>https://scifaro.com/en/abs/quantale-semantics-of-lambek-calculus-with-subexponential-modalities-1908.01055</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantale-semantics-of-lambek-calculus-with-subexponential-modalities-1908.01055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantale-semantics-of-lambek-calculus-with-subexponential-modalities-1908.01055"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-i-emergence-of-general-concept-lattice-1908.01056</loc><lastmod>2019-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-i-emergence-of-general-concept-lattice-1908.01056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-i-emergence-of-general-concept-lattice-1908.01056"/></url>
<url><loc>https://scifaro.com/en/abs/circular-proofs-as-session-typed-processes-a-local-validity-condition-1908.01909</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/circular-proofs-as-session-typed-processes-a-local-validity-condition-1908.01909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/circular-proofs-as-session-typed-processes-a-local-validity-condition-1908.01909"/></url>
<url><loc>https://scifaro.com/en/abs/a-formally-verified-hol-algebra-for-dynamic-reliability-block-diagrams-1908.01930</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formally-verified-hol-algebra-for-dynamic-reliability-block-diagrams-1908.01930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formally-verified-hol-algebra-for-dynamic-reliability-block-diagrams-1908.01930"/></url>
<url><loc>https://scifaro.com/en/abs/a-state-class-construction-for-computing-the-intersection-of-time-petri-nets-languages-1908.02087</loc><lastmod>2019-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-state-class-construction-for-computing-the-intersection-of-time-petri-nets-languages-1908.02087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-state-class-construction-for-computing-the-intersection-of-time-petri-nets-languages-1908.02087"/></url>
<url><loc>https://scifaro.com/en/abs/dealing-with-imperfect-information-in-strategy-logic-1908.02488</loc><lastmod>2019-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dealing-with-imperfect-information-in-strategy-logic-1908.02488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dealing-with-imperfect-information-in-strategy-logic-1908.02488"/></url>
<url><loc>https://scifaro.com/en/abs/topological-run-time-monitoring-for-complex-systems-1908.03489</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-run-time-monitoring-for-complex-systems-1908.03489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-run-time-monitoring-for-complex-systems-1908.03489"/></url>
<url><loc>https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-1-espace-algorithms-1908.03501</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-1-espace-algorithms-1908.03501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-1-espace-algorithms-1908.03501"/></url>
<url><loc>https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-2-expspace-hardness-1908.03509</loc><lastmod>2019-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-2-expspace-hardness-1908.03509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expspace-completeness-of-the-logics-k4xs5-and-s4xs5-and-the-logic-of-subset-spaces-part-2-expspace-hardness-1908.03509"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-the-35th-international-conference-on-logic-programming-special-issue-1908.03719</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-the-35th-international-conference-on-logic-programming-special-issue-1908.03719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-the-35th-international-conference-on-logic-programming-special-issue-1908.03719"/></url>
<url><loc>https://scifaro.com/en/abs/large-scale-geometries-of-infinite-strings-1908.03800</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-scale-geometries-of-infinite-strings-1908.03800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-scale-geometries-of-infinite-strings-1908.03800"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-ii-tractable-lattice-construction-and-implication-extraction-1908.04260</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-ii-tractable-lattice-construction-and-implication-extraction-1908.04260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-theory-of-concept-lattice-ii-tractable-lattice-construction-and-implication-extraction-1908.04260"/></url>
<url><loc>https://scifaro.com/en/abs/topological-interpretation-of-interactive-computation-1908.04264</loc><lastmod>2019-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topological-interpretation-of-interactive-computation-1908.04264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topological-interpretation-of-interactive-computation-1908.04264"/></url>
<url><loc>https://scifaro.com/en/abs/the-far-side-of-the-cube-1908.04291</loc><lastmod>2019-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-far-side-of-the-cube-1908.04291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-far-side-of-the-cube-1908.04291"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-elementary-affine-lambda-calculus-with-and-without-fixed-points-1908.04921</loc><lastmod>2019-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-elementary-affine-lambda-calculus-with-and-without-fixed-points-1908.04921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-elementary-affine-lambda-calculus-with-and-without-fixed-points-1908.04921"/></url>
<url><loc>https://scifaro.com/en/abs/shield-synthesis-for-real-enforcing-safety-in-cyber-physical-systems-1908.05402</loc><lastmod>2019-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shield-synthesis-for-real-enforcing-safety-in-cyber-physical-systems-1908.05402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shield-synthesis-for-real-enforcing-safety-in-cyber-physical-systems-1908.05402"/></url>
<url><loc>https://scifaro.com/en/abs/vector-spaces-as-kripke-frames-1908.05528</loc><lastmod>2021-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vector-spaces-as-kripke-frames-1908.05528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vector-spaces-as-kripke-frames-1908.05528"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-win-first-order-safety-games-1908.05964</loc><lastmod>2019-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-win-first-order-safety-games-1908.05964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-win-first-order-safety-games-1908.05964"/></url>
<url><loc>https://scifaro.com/en/abs/a-gentzen-style-monadic-translation-of-g-odel-s-system-t-1908.05979</loc><lastmod>2020-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gentzen-style-monadic-translation-of-g-odel-s-system-t-1908.05979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gentzen-style-monadic-translation-of-g-odel-s-system-t-1908.05979"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-compilation-for-boolean-functional-synthesis-1908.06275</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-compilation-for-boolean-functional-synthesis-1908.06275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-compilation-for-boolean-functional-synthesis-1908.06275"/></url>
<url><loc>https://scifaro.com/en/abs/studying-algebraic-structures-using-prover9-and-mace4-1908.06479</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/studying-algebraic-structures-using-prover9-and-mace4-1908.06479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/studying-algebraic-structures-using-prover9-and-mace4-1908.06479"/></url>
<url><loc>https://scifaro.com/en/abs/taming-concurrency-for-verification-using-multiparty-session-types-technical-report-1908.06510</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-concurrency-for-verification-using-multiparty-session-types-technical-report-1908.06510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-concurrency-for-verification-using-multiparty-session-types-technical-report-1908.06510"/></url>
<url><loc>https://scifaro.com/en/abs/divide-and-congruence-iii-from-decomposition-of-modal-formulas-to-preservation-of-stability-and-divergence-1908.06550</loc><lastmod>2019-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/divide-and-congruence-iii-from-decomposition-of-modal-formulas-to-preservation-of-stability-and-divergence-1908.06550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/divide-and-congruence-iii-from-decomposition-of-modal-formulas-to-preservation-of-stability-and-divergence-1908.06550"/></url>
<url><loc>https://scifaro.com/en/abs/directed-homotopy-in-non-positively-curved-spaces-1908.06684</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-homotopy-in-non-positively-curved-spaces-1908.06684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-homotopy-in-non-positively-curved-spaces-1908.06684"/></url>
<url><loc>https://scifaro.com/en/abs/lemma-generation-for-horn-clause-satisfiability-a-preliminary-study-1908.07188</loc><lastmod>2019-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lemma-generation-for-horn-clause-satisfiability-a-preliminary-study-1908.07188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lemma-generation-for-horn-clause-satisfiability-a-preliminary-study-1908.07188"/></url>
<url><loc>https://scifaro.com/en/abs/polyvariant-program-specialisation-with-property-based-abstraction-1908.07189</loc><lastmod>2019-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyvariant-program-specialisation-with-property-based-abstraction-1908.07189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyvariant-program-specialisation-with-property-based-abstraction-1908.07189"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-combinatorial-proof-for-small-model-property-of-two-variable-logic-1908.07239</loc><lastmod>2020-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-combinatorial-proof-for-small-model-property-of-two-variable-logic-1908.07239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-combinatorial-proof-for-small-model-property-of-two-variable-logic-1908.07239"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-26th-international-workshop-on-expressiveness-in-concurrency-and-16th-workshop-on-structural-operational-semantics-1908.08213</loc><lastmod>2019-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-26th-international-workshop-on-expressiveness-in-concurrency-and-16th-workshop-on-structural-operational-semantics-1908.08213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-26th-international-workshop-on-expressiveness-in-concurrency-and-16th-workshop-on-structural-operational-semantics-1908.08213"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-process-calculi-using-encodings-1908.08633</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-process-calculi-using-encodings-1908.08633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-process-calculi-using-encodings-1908.08633"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-meaning-of-transition-system-specifications-1908.08635</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-meaning-of-transition-system-specifications-1908.08635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-meaning-of-transition-system-specifications-1908.08635"/></url>
<url><loc>https://scifaro.com/en/abs/conflict-vs-causality-in-event-structures-1908.08636</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conflict-vs-causality-in-event-structures-1908.08636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conflict-vs-causality-in-event-structures-1908.08636"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-workshop-on-proof-exchange-for-theorem-proving-1908.08639</loc><lastmod>2019-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-proof-exchange-for-theorem-proving-1908.08639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-proof-exchange-for-theorem-proving-1908.08639"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-second-workshop-on-verification-of-objects-at-runtime-execution-1908.09302</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-second-workshop-on-verification-of-objects-at-runtime-execution-1908.09302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-second-workshop-on-verification-of-objects-at-runtime-execution-1908.09302"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-bit-vector-invertibility-conditions-in-coq-extended-abstract-1908.09478</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-bit-vector-invertibility-conditions-in-coq-extended-abstract-1908.09478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-bit-vector-invertibility-conditions-in-coq-extended-abstract-1908.09478"/></url>
<url><loc>https://scifaro.com/en/abs/ekstrakto-a-tool-to-reconstruct-dedukti-proofs-from-tstp-files-extended-abstract-1908.09479</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ekstrakto-a-tool-to-reconstruct-dedukti-proofs-from-tstp-files-extended-abstract-1908.09479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ekstrakto-a-tool-to-reconstruct-dedukti-proofs-from-tstp-files-extended-abstract-1908.09479"/></url>
<url><loc>https://scifaro.com/en/abs/reconstructing-verit-proofs-in-isabelle-hol-1908.09480</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconstructing-verit-proofs-in-isabelle-hol-1908.09480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconstructing-verit-proofs-in-isabelle-hol-1908.09480"/></url>
<url><loc>https://scifaro.com/en/abs/cls-smt-bringing-together-combinatory-logic-synthesis-and-satisfiability-modulo-theories-1908.09481</loc><lastmod>2019-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cls-smt-bringing-together-combinatory-logic-synthesis-and-satisfiability-modulo-theories-1908.09481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cls-smt-bringing-together-combinatory-logic-synthesis-and-satisfiability-modulo-theories-1908.09481"/></url>
<url><loc>https://scifaro.com/en/abs/towards-constraint-logic-programming-over-strings-for-test-data-generation-1908.10203</loc><lastmod>2019-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-constraint-logic-programming-over-strings-for-test-data-generation-1908.10203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-constraint-logic-programming-over-strings-for-test-data-generation-1908.10203"/></url>
<url><loc>https://scifaro.com/en/abs/extending-description-logic-el-with-linear-constraints-on-the-probability-of-axioms-1908.10405</loc><lastmod>2019-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-description-logic-el-with-linear-constraints-on-the-probability-of-axioms-1908.10405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-description-logic-el-with-linear-constraints-on-the-probability-of-axioms-1908.10405"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-based-hfl-model-checking-algorithm-1908.10416</loc><lastmod>2019-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-based-hfl-model-checking-algorithm-1908.10416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-based-hfl-model-checking-algorithm-1908.10416"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-of-the-knowledge-base-paradigm-applied-to-delegation-revocation-1908.11132</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-of-the-knowledge-base-paradigm-applied-to-delegation-revocation-1908.11132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-of-the-knowledge-base-paradigm-applied-to-delegation-revocation-1908.11132"/></url>
<url><loc>https://scifaro.com/en/abs/cellular-monads-from-positive-gsos-specifications-1908.11169</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cellular-monads-from-positive-gsos-specifications-1908.11169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cellular-monads-from-positive-gsos-specifications-1908.11169"/></url>
<url><loc>https://scifaro.com/en/abs/factorization-and-normalization-essentially-1908.11289</loc><lastmod>2019-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factorization-and-normalization-essentially-1908.11289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factorization-and-normalization-essentially-1908.11289"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-sets-for-data-analysis-1908.11341</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-sets-for-data-analysis-1908.11341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-sets-for-data-analysis-1908.11341"/></url>
<url><loc>https://scifaro.com/en/abs/quantifiers-metamorphoses-generalizations-variations-algorithmic-semantics-1908.11342</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifiers-metamorphoses-generalizations-variations-algorithmic-semantics-1908.11342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifiers-metamorphoses-generalizations-variations-algorithmic-semantics-1908.11342"/></url>
<url><loc>https://scifaro.com/en/abs/local-reasoning-about-parametric-and-reconfigurable-component-based-systems-1908.11345</loc><lastmod>2019-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-reasoning-about-parametric-and-reconfigurable-component-based-systems-1908.11345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-reasoning-about-parametric-and-reconfigurable-component-based-systems-1908.11345"/></url>
<url><loc>https://scifaro.com/en/abs/automating-agential-reasoning-proof-calculi-and-syntactic-decidability-for-stit-logics-1908.11360</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-agential-reasoning-proof-calculi-and-syntactic-decidability-for-stit-logics-1908.11360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-agential-reasoning-proof-calculi-and-syntactic-decidability-for-stit-logics-1908.11360"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-specification-in-rewriting-logic-1908.11769</loc><lastmod>2020-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-specification-in-rewriting-logic-1908.11769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-specification-in-rewriting-logic-1908.11769"/></url>
<url><loc>https://scifaro.com/en/abs/conditions-for-unnecessary-logical-constraints-in-kernel-machines-1909.00216</loc><lastmod>2019-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditions-for-unnecessary-logical-constraints-in-kernel-machines-1909.00216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditions-for-unnecessary-logical-constraints-in-kernel-machines-1909.00216"/></url>
<url><loc>https://scifaro.com/en/abs/justness-a-completeness-criterion-for-capturing-liveness-properties-1909.00286</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justness-a-completeness-criterion-for-capturing-liveness-properties-1909.00286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justness-a-completeness-criterion-for-capturing-liveness-properties-1909.00286"/></url>
<url><loc>https://scifaro.com/en/abs/exptime-tableaux-for-type-pdl-1909.00436</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exptime-tableaux-for-type-pdl-1909.00436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exptime-tableaux-for-type-pdl-1909.00436"/></url>
<url><loc>https://scifaro.com/en/abs/drat-and-propagation-redundancy-proofs-without-new-variables-1909.00520</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drat-and-propagation-redundancy-proofs-without-new-variables-1909.00520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drat-and-propagation-redundancy-proofs-without-new-variables-1909.00520"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-symposium-on-working-formal-methods-1909.00584</loc><lastmod>2019-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-symposium-on-working-formal-methods-1909.00584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-symposium-on-working-formal-methods-1909.00584"/></url>
<url><loc>https://scifaro.com/en/abs/classes-of-graphs-with-low-complexity-the-case-of-classes-with-bounded-linear-rankwidth-1909.01564</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classes-of-graphs-with-low-complexity-the-case-of-classes-with-bounded-linear-rankwidth-1909.01564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classes-of-graphs-with-low-complexity-the-case-of-classes-with-bounded-linear-rankwidth-1909.01564"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-controlled-bad-sequences-over-finite-sets-of-mathbb-n-d-1909.01667</loc><lastmod>2020-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-controlled-bad-sequences-over-finite-sets-of-mathbb-n-d-1909.01667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-controlled-bad-sequences-over-finite-sets-of-mathbb-n-d-1909.01667"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-the-dpll-algorithm-in-dafny-1909.01743</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-the-dpll-algorithm-in-dafny-1909.01743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-the-dpll-algorithm-in-dafny-1909.01743"/></url>
<url><loc>https://scifaro.com/en/abs/co-inductive-proof-systems-for-compositional-proofs-in-reachability-logic-1909.01744</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-inductive-proof-systems-for-compositional-proofs-in-reachability-logic-1909.01744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-inductive-proof-systems-for-compositional-proofs-in-reachability-logic-1909.01744"/></url>
<url><loc>https://scifaro.com/en/abs/proof-based-synthesis-of-sorting-algorithms-using-multisets-in-theorema-1909.01747</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-based-synthesis-of-sorting-algorithms-using-multisets-in-theorema-1909.01747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-based-synthesis-of-sorting-algorithms-using-multisets-in-theorema-1909.01747"/></url>
<url><loc>https://scifaro.com/en/abs/probabilities-in-session-types-1909.01748</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilities-in-session-types-1909.01748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilities-in-session-types-1909.01748"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-maps-in-presheaf-categories-1909.01796</loc><lastmod>2019-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-maps-in-presheaf-categories-1909.01796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-maps-in-presheaf-categories-1909.01796"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-reachability-in-affine-vector-addition-systems-with-states-1909.02579</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-reachability-in-affine-vector-addition-systems-with-states-1909.02579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-reachability-in-affine-vector-addition-systems-with-states-1909.02579"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamic-epistemic-logic-analysis-of-the-equality-negation-task-1909.03263</loc><lastmod>2019-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamic-epistemic-logic-analysis-of-the-equality-negation-task-1909.03263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamic-epistemic-logic-analysis-of-the-equality-negation-task-1909.03263"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-liveness-preserving-conformance-testing-of-timed-i-o-automata-technical-report-1909.03703</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-liveness-preserving-conformance-testing-of-timed-i-o-automata-technical-report-1909.03703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-liveness-preserving-conformance-testing-of-timed-i-o-automata-technical-report-1909.03703"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strong-equivalences-for-lpmln-programs-1909.03764</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strong-equivalences-for-lpmln-programs-1909.03764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strong-equivalences-for-lpmln-programs-1909.03764"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-logic-approach-to-stochastic-and-spatial-constraint-system-specification-and-verification-1909.03819</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-logic-approach-to-stochastic-and-spatial-constraint-system-specification-and-verification-1909.03819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-logic-approach-to-stochastic-and-spatial-constraint-system-specification-and-verification-1909.03819"/></url>
<url><loc>https://scifaro.com/en/abs/learning-concepts-definable-in-first-order-logic-with-counting-1909.03820</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-concepts-definable-in-first-order-logic-with-counting-1909.03820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-concepts-definable-in-first-order-logic-with-counting-1909.03820"/></url>
<url><loc>https://scifaro.com/en/abs/on-cdcl-based-proof-systems-with-the-ordered-decision-strategy-1909.04135</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cdcl-based-proof-systems-with-the-ordered-decision-strategy-1909.04135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cdcl-based-proof-systems-with-the-ordered-decision-strategy-1909.04135"/></url>
<url><loc>https://scifaro.com/en/abs/incompleteness-ex-machina-1909.04569</loc><lastmod>2019-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incompleteness-ex-machina-1909.04569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incompleteness-ex-machina-1909.04569"/></url>
<url><loc>https://scifaro.com/en/abs/reinforcement-learning-for-temporal-logic-control-synthesis-with-probabilistic-satisfaction-guarantees-1909.05304</loc><lastmod>2019-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reinforcement-learning-for-temporal-logic-control-synthesis-with-probabilistic-satisfaction-guarantees-1909.05304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reinforcement-learning-for-temporal-logic-control-synthesis-with-probabilistic-satisfaction-guarantees-1909.05304"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-transformer-semantics-for-hybrid-systems-verification-components-for-isabelle-hol-1909.05618</loc><lastmod>2021-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-transformer-semantics-for-hybrid-systems-verification-components-for-isabelle-hol-1909.05618"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-transformer-semantics-for-hybrid-systems-verification-components-for-isabelle-hol-1909.05618"/></url>
<url><loc>https://scifaro.com/en/abs/open-multiparty-sessions-1909.05972</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-multiparty-sessions-1909.05972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-multiparty-sessions-1909.05972"/></url>
<url><loc>https://scifaro.com/en/abs/topology-is-irrelevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1909.06201</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topology-is-irrelevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1909.06201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topology-is-irrelevant-in-a-dichotomy-conjecture-for-infinite-domain-constraint-satisfaction-problems-1909.06201"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-call-by-value-a-missing-result-in-the-history-of-hoare-s-logic-1909.06215</loc><lastmod>2019-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-call-by-value-a-missing-result-in-the-history-of-hoare-s-logic-1909.06215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-call-by-value-a-missing-result-in-the-history-of-hoare-s-logic-1909.06215"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-a-random-population-is-exptime-hard-1909.06420</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-a-random-population-is-exptime-hard-1909.06420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-a-random-population-is-exptime-hard-1909.06420"/></url>
<url><loc>https://scifaro.com/en/abs/psi-calculi-revisited-connectivity-and-compositionality-1909.06692</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/psi-calculi-revisited-connectivity-and-compositionality-1909.06692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/psi-calculi-revisited-connectivity-and-compositionality-1909.06692"/></url>
<url><loc>https://scifaro.com/en/abs/a-substructural-epistemic-resource-logic-theory-and-modelling-applications-1909.07296</loc><lastmod>2019-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-substructural-epistemic-resource-logic-theory-and-modelling-applications-1909.07296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-substructural-epistemic-resource-logic-theory-and-modelling-applications-1909.07296"/></url>
<url><loc>https://scifaro.com/en/abs/on-correctness-of-an-n-queens-program-1909.07479</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-correctness-of-an-n-queens-program-1909.07479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-correctness-of-an-n-queens-program-1909.07479"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-exponential-comonad-in-s-finite-transition-kernels-and-probabilistic-coherent-spaces-1909.07589</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-exponential-comonad-in-s-finite-transition-kernels-and-probabilistic-coherent-spaces-1909.07589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-exponential-comonad-in-s-finite-transition-kernels-and-probabilistic-coherent-spaces-1909.07589"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-35th-international-conference-on-logic-programming-technical-communications-1909.07646</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-35th-international-conference-on-logic-programming-technical-communications-1909.07646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-35th-international-conference-on-logic-programming-technical-communications-1909.07646"/></url>
<url><loc>https://scifaro.com/en/abs/resource-aware-automata-and-games-for-optimal-synthesis-1909.07656</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-aware-automata-and-games-for-optimal-synthesis-1909.07656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-aware-automata-and-games-for-optimal-synthesis-1909.07656"/></url>
<url><loc>https://scifaro.com/en/abs/simple-fixpoint-iteration-to-solve-parity-games-1909.07659</loc><lastmod>2019-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-fixpoint-iteration-to-solve-parity-games-1909.07659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-fixpoint-iteration-to-solve-parity-games-1909.07659"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-logics-of-fuzzy-preferences-using-graded-modalities-1909.07674</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-logics-of-fuzzy-preferences-using-graded-modalities-1909.07674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-logics-of-fuzzy-preferences-using-graded-modalities-1909.07674"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-reachability-properties-in-markov-chains-via-incremental-induction-1909.08017</loc><lastmod>2019-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-reachability-properties-in-markov-chains-via-incremental-induction-1909.08017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-reachability-properties-in-markov-chains-via-incremental-induction-1909.08017"/></url>
<url><loc>https://scifaro.com/en/abs/a-three-valued-semantics-for-typed-logic-programming-1909.08232</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-three-valued-semantics-for-typed-logic-programming-1909.08232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-three-valued-semantics-for-typed-logic-programming-1909.08232"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-logic-programs-a-different-world-view-1909.08233</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-logic-programs-a-different-world-view-1909.08233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-logic-programs-a-different-world-view-1909.08233"/></url>
<url><loc>https://scifaro.com/en/abs/a-tractable-logic-for-molecular-biology-1909.08236</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tractable-logic-for-molecular-biology-1909.08236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tractable-logic-for-molecular-biology-1909.08236"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-strong-equivalences-of-lpmln-programs-1909.08238</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-strong-equivalences-of-lpmln-programs-1909.08238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-strong-equivalences-of-lpmln-programs-1909.08238"/></url>
<url><loc>https://scifaro.com/en/abs/restkb-a-library-of-commonsense-knowledge-about-dining-at-a-restaurant-1909.08239</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restkb-a-library-of-commonsense-knowledge-about-dining-at-a-restaurant-1909.08239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restkb-a-library-of-commonsense-knowledge-about-dining-at-a-restaurant-1909.08239"/></url>
<url><loc>https://scifaro.com/en/abs/most-general-variant-unifiers-1909.08241</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/most-general-variant-unifiers-1909.08241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/most-general-variant-unifiers-1909.08241"/></url>
<url><loc>https://scifaro.com/en/abs/extended-magic-for-negation-efficient-demand-driven-evaluation-of-stratified-datalog-with-precise-complexity-guarantees-1909.08246</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-magic-for-negation-efficient-demand-driven-evaluation-of-stratified-datalog-with-precise-complexity-guarantees-1909.08246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-magic-for-negation-efficient-demand-driven-evaluation-of-stratified-datalog-with-precise-complexity-guarantees-1909.08246"/></url>
<url><loc>https://scifaro.com/en/abs/a-rule-based-system-for-explainable-donor-patient-matching-in-liver-transplantation-1909.08248</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rule-based-system-for-explainable-donor-patient-matching-in-liver-transplantation-1909.08248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rule-based-system-for-explainable-donor-patient-matching-in-liver-transplantation-1909.08248"/></url>
<url><loc>https://scifaro.com/en/abs/bigdata-applications-from-graph-analytics-to-machine-learning-by-aggregates-in-recursion-1909.08249</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bigdata-applications-from-graph-analytics-to-machine-learning-by-aggregates-in-recursion-1909.08249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bigdata-applications-from-graph-analytics-to-machine-learning-by-aggregates-in-recursion-1909.08249"/></url>
<url><loc>https://scifaro.com/en/abs/advances-in-big-data-bio-analytics-1909.08254</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advances-in-big-data-bio-analytics-1909.08254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advances-in-big-data-bio-analytics-1909.08254"/></url>
<url><loc>https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-1909.08538</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-1909.08538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-expressive-and-quantitative-linear-temporal-logics-pick-any-two-for-free-1909.08538"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-optimal-reactive-synthesis-of-run-time-enforcement-shields-1909.08541</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-optimal-reactive-synthesis-of-run-time-enforcement-shields-1909.08541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-optimal-reactive-synthesis-of-run-time-enforcement-shields-1909.08541"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-right-path-a-modal-logic-for-supervised-learning-1909.08559</loc><lastmod>2019-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-right-path-a-modal-logic-for-supervised-learning-1909.08559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-right-path-a-modal-logic-for-supervised-learning-1909.08559"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-for-lpmln-programs-1909.08998</loc><lastmod>2019-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-for-lpmln-programs-1909.08998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-for-lpmln-programs-1909.08998"/></url>
<url><loc>https://scifaro.com/en/abs/a-simpler-o-m-log-n-algorithm-for-branching-bisimilarity-on-labelled-transition-systems-1909.10824</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simpler-o-m-log-n-algorithm-for-branching-bisimilarity-on-labelled-transition-systems-1909.10824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simpler-o-m-log-n-algorithm-for-branching-bisimilarity-on-labelled-transition-systems-1909.10824"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-of-document-spanners-1909.10869</loc><lastmod>2020-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-of-document-spanners-1909.10869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-of-document-spanners-1909.10869"/></url>
<url><loc>https://scifaro.com/en/abs/learning-definable-hypotheses-on-trees-1909.10994</loc><lastmod>2019-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-definable-hypotheses-on-trees-1909.10994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-definable-hypotheses-on-trees-1909.10994"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-hensel-s-lemma-over-the-p-adic-integers-1909.11342</loc><lastmod>2019-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-hensel-s-lemma-over-the-p-adic-integers-1909.11342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-hensel-s-lemma-over-the-p-adic-integers-1909.11342"/></url>
<url><loc>https://scifaro.com/en/abs/iterative-division-in-the-distributive-full-non-associative-lambek-calculus-1909.11350</loc><lastmod>2019-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterative-division-in-the-distributive-full-non-associative-lambek-calculus-1909.11350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterative-division-in-the-distributive-full-non-associative-lambek-calculus-1909.11350"/></url>
<url><loc>https://scifaro.com/en/abs/first-degree-entailment-with-group-attitudes-and-information-updates-1909.11363</loc><lastmod>2019-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-degree-entailment-with-group-attitudes-and-information-updates-1909.11363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-degree-entailment-with-group-attitudes-and-information-updates-1909.11363"/></url>
<url><loc>https://scifaro.com/en/abs/query-preserving-watermarking-schemes-for-locally-treelike-databases-1909.11369</loc><lastmod>2019-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-preserving-watermarking-schemes-for-locally-treelike-databases-1909.11369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-preserving-watermarking-schemes-for-locally-treelike-databases-1909.11369"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-verification-over-out-of-order-streams-1909.11593</loc><lastmod>2019-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-verification-over-out-of-order-streams-1909.11593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-verification-over-out-of-order-streams-1909.11593"/></url>
<url><loc>https://scifaro.com/en/abs/affine-extensions-of-integer-vector-addition-systems-with-states-1909.12386</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/affine-extensions-of-integer-vector-addition-systems-with-states-1909.12386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/affine-extensions-of-integer-vector-addition-systems-with-states-1909.12386"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-model-checking-of-self-modifying-code-1909.12635</loc><lastmod>2019-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-model-checking-of-self-modifying-code-1909.12635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-model-checking-of-self-modifying-code-1909.12635"/></url>
<url><loc>https://scifaro.com/en/abs/towards-declarative-comparabilities-application-to-functional-dependencies-1909.12656</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-declarative-comparabilities-application-to-functional-dependencies-1909.12656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-declarative-comparabilities-application-to-functional-dependencies-1909.12656"/></url>
<url><loc>https://scifaro.com/en/abs/towards-races-in-linear-logic-1909.13376</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-races-in-linear-logic-1909.13376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-races-in-linear-logic-1909.13376"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-undecidability-of-propositional-non-associative-linear-logics-1909.13444</loc><lastmod>2019-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-undecidability-of-propositional-non-associative-linear-logics-1909.13444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-undecidability-of-propositional-non-associative-linear-logics-1909.13444"/></url>
<url><loc>https://scifaro.com/en/abs/backpropagation-in-the-simply-typed-lambda-calculus-with-linear-negation-1909.13768</loc><lastmod>2019-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/backpropagation-in-the-simply-typed-lambda-calculus-with-linear-negation-1909.13768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/backpropagation-in-the-simply-typed-lambda-calculus-with-linear-negation-1909.13768"/></url>
<url><loc>https://scifaro.com/en/abs/extraction-of-efficient-programs-in-i-sigma-1-arithmetic-1910.00635</loc><lastmod>2019-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extraction-of-efficient-programs-in-i-sigma-1-arithmetic-1910.00635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extraction-of-efficient-programs-in-i-sigma-1-arithmetic-1910.00635"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-non-interference-for-fine-grained-concurrent-programs-1910.00905</loc><lastmod>2020-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-non-interference-for-fine-grained-concurrent-programs-1910.00905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-non-interference-for-fine-grained-concurrent-programs-1910.00905"/></url>
<url><loc>https://scifaro.com/en/abs/complete-intuitionistic-temporal-logics-in-topological-dynamics-1910.00907</loc><lastmod>2019-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-intuitionistic-temporal-logics-in-topological-dynamics-1910.00907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-intuitionistic-temporal-logics-in-topological-dynamics-1910.00907"/></url>
<url><loc>https://scifaro.com/en/abs/optimistic-value-iteration-1910.01100</loc><lastmod>2019-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimistic-value-iteration-1910.01100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimistic-value-iteration-1910.01100"/></url>
<url><loc>https://scifaro.com/en/abs/improving-reasoning-on-dqbf-1910.01181</loc><lastmod>2019-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-reasoning-on-dqbf-1910.01181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-reasoning-on-dqbf-1910.01181"/></url>
<url><loc>https://scifaro.com/en/abs/a-henkin-style-completeness-proof-for-the-modal-logic-s5-1910.01697</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-henkin-style-completeness-proof-for-the-modal-logic-s5-1910.01697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-henkin-style-completeness-proof-for-the-modal-logic-s5-1910.01697"/></url>
<url><loc>https://scifaro.com/en/abs/formula-transformers-and-combinatorial-test-generators-for-propositional-intuitionistic-theorem-provers-1910.01775</loc><lastmod>2019-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formula-transformers-and-combinatorial-test-generators-for-propositional-intuitionistic-theorem-provers-1910.01775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formula-transformers-and-combinatorial-test-generators-for-propositional-intuitionistic-theorem-provers-1910.01775"/></url>
<url><loc>https://scifaro.com/en/abs/types-for-parallel-complexity-in-the-pi-calculus-1910.02145</loc><lastmod>2019-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/types-for-parallel-complexity-in-the-pi-calculus-1910.02145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/types-for-parallel-complexity-in-the-pi-calculus-1910.02145"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logic-via-global-consequence-1910.02446</loc><lastmod>2019-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logic-via-global-consequence-1910.02446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logic-via-global-consequence-1910.02446"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-remark-on-analogical-reasoning-1910.02453</loc><lastmod>2019-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-remark-on-analogical-reasoning-1910.02453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-remark-on-analogical-reasoning-1910.02453"/></url>
<url><loc>https://scifaro.com/en/abs/representing-dependencies-in-event-structures-1910.02521</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-dependencies-in-event-structures-1910.02521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-dependencies-in-event-structures-1910.02521"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-duality-of-computation-an-algebraic-analysis-of-classical-realizability-models-1910.02732</loc><lastmod>2020-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-duality-of-computation-an-algebraic-analysis-of-classical-realizability-models-1910.02732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-duality-of-computation-an-algebraic-analysis-of-classical-realizability-models-1910.02732"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-the-expressive-power-of-unhygienic-substitution-in-metaprogramming-via-combinatory-logic-1910.03217</loc><lastmod>2019-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-the-expressive-power-of-unhygienic-substitution-in-metaprogramming-via-combinatory-logic-1910.03217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-the-expressive-power-of-unhygienic-substitution-in-metaprogramming-via-combinatory-logic-1910.03217"/></url>
<url><loc>https://scifaro.com/en/abs/clause-set-cycles-and-induction-1910.03917</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clause-set-cycles-and-induction-1910.03917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clause-set-cycles-and-induction-1910.03917"/></url>
<url><loc>https://scifaro.com/en/abs/a-query-driven-decision-procedure-for-distributed-autoepistemic-logic-with-inductive-definitions-1910.04010</loc><lastmod>2019-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-query-driven-decision-procedure-for-distributed-autoepistemic-logic-with-inductive-definitions-1910.04010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-query-driven-decision-procedure-for-distributed-autoepistemic-logic-with-inductive-definitions-1910.04010"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-mitl-to-fix-decision-procedures-1910.04216</loc><lastmod>2019-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-mitl-to-fix-decision-procedures-1910.04216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-mitl-to-fix-decision-procedures-1910.04216"/></url>
<url><loc>https://scifaro.com/en/abs/reversing-place-transition-nets-1910.04266</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversing-place-transition-nets-1910.04266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversing-place-transition-nets-1910.04266"/></url>
<url><loc>https://scifaro.com/en/abs/reflections-on-incremental-cardinality-constraints-for-maxsat-1910.04643</loc><lastmod>2019-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflections-on-incremental-cardinality-constraints-for-maxsat-1910.04643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflections-on-incremental-cardinality-constraints-for-maxsat-1910.04643"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-evaluation-strategies-for-continuous-real-functions-1910.04891</loc><lastmod>2019-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-evaluation-strategies-for-continuous-real-functions-1910.04891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-evaluation-strategies-for-continuous-real-functions-1910.04891"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-domains-with-classical-witnesses-1910.04948</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-domains-with-classical-witnesses-1910.04948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-domains-with-classical-witnesses-1910.04948"/></url>
<url><loc>https://scifaro.com/en/abs/internal-calculi-for-separation-logics-1910.05016</loc><lastmod>2019-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-calculi-for-separation-logics-1910.05016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-calculi-for-separation-logics-1910.05016"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-systems-verification-and-synthesis-1910.05208</loc><lastmod>2019-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-systems-verification-and-synthesis-1910.05208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-systems-verification-and-synthesis-1910.05208"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-interpolation-for-tense-logics-and-bi-intuitionistic-logic-via-nested-sequents-1910.05215</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-interpolation-for-tense-logics-and-bi-intuitionistic-logic-via-nested-sequents-1910.05215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-interpolation-for-tense-logics-and-bi-intuitionistic-logic-via-nested-sequents-1910.05215"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-assumptions-refinement-for-gr-1-specifications-1910.05558</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-assumptions-refinement-for-gr-1-specifications-1910.05558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-assumptions-refinement-for-gr-1-specifications-1910.05558"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-of-parity-exists-queries-1910.06004</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-of-parity-exists-queries-1910.06004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-of-parity-exists-queries-1910.06004"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-union-closed-fragment-of-existential-second-order-logic-and-logics-with-team-semantics-1910.06057</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-union-closed-fragment-of-existential-second-order-logic-and-logics-with-team-semantics-1910.06057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-union-closed-fragment-of-existential-second-order-logic-and-logics-with-team-semantics-1910.06057"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-event-frequencies-1910.06097</loc><lastmod>2020-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-event-frequencies-1910.06097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-event-frequencies-1910.06097"/></url>
<url><loc>https://scifaro.com/en/abs/on-axiomatization-of-lewis-conditional-logics-1910.06202</loc><lastmod>2019-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-axiomatization-of-lewis-conditional-logics-1910.06202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-axiomatization-of-lewis-conditional-logics-1910.06202"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-meets-parameterised-algorithms-1910.06281</loc><lastmod>2019-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-meets-parameterised-algorithms-1910.06281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-meets-parameterised-algorithms-1910.06281"/></url>
<url><loc>https://scifaro.com/en/abs/on-deriving-nested-calculi-for-intuitionistic-logics-from-semantic-systems-1910.06576</loc><lastmod>2020-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-deriving-nested-calculi-for-intuitionistic-logics-from-semantic-systems-1910.06576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-deriving-nested-calculi-for-intuitionistic-logics-from-semantic-systems-1910.06576"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-cut-elimination-for-intuitionistic-fuzzy-logic-via-linear-nested-sequents-1910.06657</loc><lastmod>2020-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-cut-elimination-for-intuitionistic-fuzzy-logic-via-linear-nested-sequents-1910.06657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-cut-elimination-for-intuitionistic-fuzzy-logic-via-linear-nested-sequents-1910.06657"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-derivative-categories-1910.07065</loc><lastmod>2019-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-derivative-categories-1910.07065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-derivative-categories-1910.07065"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-semantics-for-relative-truth-awareness-and-possibility-1910.07275</loc><lastmod>2021-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-semantics-for-relative-truth-awareness-and-possibility-1910.07275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-semantics-for-relative-truth-awareness-and-possibility-1910.07275"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-absorptive-polynomials-and-provenance-semantics-for-fixed-point-logic-1910.07910</loc><lastmod>2020-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-absorptive-polynomials-and-provenance-semantics-for-fixed-point-logic-1910.07910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-absorptive-polynomials-and-provenance-semantics-for-fixed-point-logic-1910.07910"/></url>
<url><loc>https://scifaro.com/en/abs/glueability-of-resource-proof-structures-inverting-the-taylor-expansion-long-version-1910.07936</loc><lastmod>2019-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/glueability-of-resource-proof-structures-inverting-the-taylor-expansion-long-version-1910.07936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/glueability-of-resource-proof-structures-inverting-the-taylor-expansion-long-version-1910.07936"/></url>
<url><loc>https://scifaro.com/en/abs/programming-and-symbolic-computation-in-maude-1910.08416</loc><lastmod>2019-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programming-and-symbolic-computation-in-maude-1910.08416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programming-and-symbolic-computation-in-maude-1910.08416"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-fourteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1910.08712</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-fourteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1910.08712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-fourteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-1910.08712"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-dft-and-drbd-formalizations-in-hol4-1910.08875</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-dft-and-drbd-formalizations-in-hol4-1910.08875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-dft-and-drbd-formalizations-in-hol4-1910.08875"/></url>
<url><loc>https://scifaro.com/en/abs/computing-branching-distances-using-quantitative-games-1910.08943</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-branching-distances-using-quantitative-games-1910.08943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-branching-distances-using-quantitative-games-1910.08943"/></url>
<url><loc>https://scifaro.com/en/abs/computer-supported-analysis-of-positive-properties-ultrafilters-and-modal-collapse-in-variants-of-g-odel-s-ontological-argument-1910.08955</loc><lastmod>2022-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-supported-analysis-of-positive-properties-ultrafilters-and-modal-collapse-in-variants-of-g-odel-s-ontological-argument-1910.08955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-supported-analysis-of-positive-properties-ultrafilters-and-modal-collapse-in-variants-of-g-odel-s-ontological-argument-1910.08955"/></url>
<url><loc>https://scifaro.com/en/abs/relational-test-tables-a-practical-specification-language-for-evolution-and-security-1910.09068</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-test-tables-a-practical-specification-language-for-evolution-and-security-1910.09068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-test-tables-a-practical-specification-language-for-evolution-and-security-1910.09068"/></url>
<url><loc>https://scifaro.com/en/abs/regular-model-checking-with-regular-relations-1910.09072</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-model-checking-with-regular-relations-1910.09072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-model-checking-with-regular-relations-1910.09072"/></url>
<url><loc>https://scifaro.com/en/abs/automated-reasoning-with-restricted-intensional-sets-1910.09118</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-reasoning-with-restricted-intensional-sets-1910.09118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-reasoning-with-restricted-intensional-sets-1910.09118"/></url>
<url><loc>https://scifaro.com/en/abs/signatures-and-models-for-syntax-and-operational-semantics-in-the-presence-of-variable-binding-1910.09162</loc><lastmod>2019-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/signatures-and-models-for-syntax-and-operational-semantics-in-the-presence-of-variable-binding-1910.09162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/signatures-and-models-for-syntax-and-operational-semantics-in-the-presence-of-variable-binding-1910.09162"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-a-unifying-proof-of-the-undecidability-of-several-diagrammatic-properties-of-term-rewriting-systems-1910.09254</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-a-unifying-proof-of-the-undecidability-of-several-diagrammatic-properties-of-term-rewriting-systems-1910.09254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-a-unifying-proof-of-the-undecidability-of-several-diagrammatic-properties-of-term-rewriting-systems-1910.09254"/></url>
<url><loc>https://scifaro.com/en/abs/on-concept-of-creative-petri-nets-1910.09326</loc><lastmod>2019-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-concept-of-creative-petri-nets-1910.09326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-concept-of-creative-petri-nets-1910.09326"/></url>
<url><loc>https://scifaro.com/en/abs/potl-a-first-order-complete-temporal-logic-for-operator-precedence-languages-1910.09327</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/potl-a-first-order-complete-temporal-logic-for-operator-precedence-languages-1910.09327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/potl-a-first-order-complete-temporal-logic-for-operator-precedence-languages-1910.09327"/></url>
<url><loc>https://scifaro.com/en/abs/the-lean-mathematical-library-1910.09336</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lean-mathematical-library-1910.09336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lean-mathematical-library-1910.09336"/></url>
<url><loc>https://scifaro.com/en/abs/a-tableau-construction-for-finite-linear-time-temporal-logic-1910.09339</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tableau-construction-for-finite-linear-time-temporal-logic-1910.09339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tableau-construction-for-finite-linear-time-temporal-logic-1910.09339"/></url>
<url><loc>https://scifaro.com/en/abs/on-well-founded-and-recursive-coalgebras-1910.09401</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-well-founded-and-recursive-coalgebras-1910.09401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-well-founded-and-recursive-coalgebras-1910.09401"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-programming-with-inductive-datatypes-causality-and-affine-type-theory-1910.09633</loc><lastmod>2021-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-programming-with-inductive-datatypes-causality-and-affine-type-theory-1910.09633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-programming-with-inductive-datatypes-causality-and-affine-type-theory-1910.09633"/></url>
<url><loc>https://scifaro.com/en/abs/the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-1910.09829</loc><lastmod>2020-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-1910.09829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-1910.09829"/></url>
<url><loc>https://scifaro.com/en/abs/review-of-recent-heap-specification-and-verification-techniques-1910.10176</loc><lastmod>2022-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/review-of-recent-heap-specification-and-verification-techniques-1910.10176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/review-of-recent-heap-specification-and-verification-techniques-1910.10176"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-of-uncertain-worlds-programming-with-logical-constraints-1910.10346</loc><lastmod>2021-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-of-uncertain-worlds-programming-with-logical-constraints-1910.10346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-of-uncertain-worlds-programming-with-logical-constraints-1910.10346"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-for-hyperproperties-1910.10546</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-hyperproperties-1910.10546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-for-hyperproperties-1910.10546"/></url>
<url><loc>https://scifaro.com/en/abs/farkas-certificates-and-minimal-witnesses-for-probabilistic-reachability-constraints-1910.10636</loc><lastmod>2020-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/farkas-certificates-and-minimal-witnesses-for-probabilistic-reachability-constraints-1910.10636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/farkas-certificates-and-minimal-witnesses-for-probabilistic-reachability-constraints-1910.10636"/></url>
<url><loc>https://scifaro.com/en/abs/metamath-zero-the-cartesian-theorem-prover-1910.10703</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metamath-zero-the-cartesian-theorem-prover-1910.10703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metamath-zero-the-cartesian-theorem-prover-1910.10703"/></url>
<url><loc>https://scifaro.com/en/abs/a-definitional-implementation-of-the-lax-logical-framework-llfp-in-coq-for-supporting-fast-and-loose-reasoning-1910.10848</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-definitional-implementation-of-the-lax-logical-framework-llfp-in-coq-for-supporting-fast-and-loose-reasoning-1910.10848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-definitional-implementation-of-the-lax-logical-framework-llfp-in-coq-for-supporting-fast-and-loose-reasoning-1910.10848"/></url>
<url><loc>https://scifaro.com/en/abs/rapid-prototyping-formal-systems-in-mmt-5-case-studies-1910.10850</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rapid-prototyping-formal-systems-in-mmt-5-case-studies-1910.10850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rapid-prototyping-formal-systems-in-mmt-5-case-studies-1910.10850"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-initial-algebra-for-higher-order-abstract-syntax-in-cedille-1910.10851</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-initial-algebra-for-higher-order-abstract-syntax-in-cedille-1910.10851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-initial-algebra-for-higher-order-abstract-syntax-in-cedille-1910.10851"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-causal-nets-and-reversible-event-structures-1910.10987</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-causal-nets-and-reversible-event-structures-1910.10987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-causal-nets-and-reversible-event-structures-1910.10987"/></url>
<url><loc>https://scifaro.com/en/abs/simple-strategies-in-multi-objective-mdps-technical-report-1910.11024</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-strategies-in-multi-objective-mdps-technical-report-1910.11024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-strategies-in-multi-objective-mdps-technical-report-1910.11024"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-dependability-analysis-of-shuffle-exchange-networks-using-hol-theorem-proving-1910.11203</loc><lastmod>2019-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-dependability-analysis-of-shuffle-exchange-networks-using-hol-theorem-proving-1910.11203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-dependability-analysis-of-shuffle-exchange-networks-using-hol-theorem-proving-1910.11203"/></url>
<url><loc>https://scifaro.com/en/abs/overview-of-logical-foundations-of-cyber-physical-systems-1910.11232</loc><lastmod>2021-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overview-of-logical-foundations-of-cyber-physical-systems-1910.11232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overview-of-logical-foundations-of-cyber-physical-systems-1910.11232"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-triangular-polynomial-loops-1910.11588</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-triangular-polynomial-loops-1910.11588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-triangular-polynomial-loops-1910.11588"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logics-with-language-parameters-1910.11594</loc><lastmod>2019-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logics-with-language-parameters-1910.11594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logics-with-language-parameters-1910.11594"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-perfectoid-spaces-1910.12320</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-perfectoid-spaces-1910.12320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-perfectoid-spaces-1910.12320"/></url>
<url><loc>https://scifaro.com/en/abs/simplifying-neural-networks-using-formal-verification-1910.12396</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplifying-neural-networks-using-formal-verification-1910.12396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplifying-neural-networks-using-formal-verification-1910.12396"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-probabilistic-invariants-and-the-optional-stopping-theorem-1910.12634</loc><lastmod>2019-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-probabilistic-invariants-and-the-optional-stopping-theorem-1910.12634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-probabilistic-invariants-and-the-optional-stopping-theorem-1910.12634"/></url>
<url><loc>https://scifaro.com/en/abs/weak-equivalence-of-higher-dimensional-automata-1910.12787</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-equivalence-of-higher-dimensional-automata-1910.12787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-equivalence-of-higher-dimensional-automata-1910.12787"/></url>
<url><loc>https://scifaro.com/en/abs/computer-supported-exploration-of-a-categorical-axiomatization-of-modeloids-1910.12863</loc><lastmod>2022-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-supported-exploration-of-a-categorical-axiomatization-of-modeloids-1910.12863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-supported-exploration-of-a-categorical-axiomatization-of-modeloids-1910.12863"/></url>
<url><loc>https://scifaro.com/en/abs/effective-wadge-hierarchy-in-computable-quasi-polish-spaces-1910.13220</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-wadge-hierarchy-in-computable-quasi-polish-spaces-1910.13220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-wadge-hierarchy-in-computable-quasi-polish-spaces-1910.13220"/></url>
<url><loc>https://scifaro.com/en/abs/differential-hoare-logics-and-refinement-calculi-for-hybrid-systems-with-isabelle-hol-1910.13554</loc><lastmod>2019-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-hoare-logics-and-refinement-calculi-for-hybrid-systems-with-isabelle-hol-1910.13554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-hoare-logics-and-refinement-calculi-for-hybrid-systems-with-isabelle-hol-1910.13554"/></url>
<url><loc>https://scifaro.com/en/abs/belief-revision-and-3-valued-logics-characterization-of-19-683-belief-change-operators-1910.14138</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-revision-and-3-valued-logics-characterization-of-19-683-belief-change-operators-1910.14138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-revision-and-3-valued-logics-characterization-of-19-683-belief-change-operators-1910.14138"/></url>
<url><loc>https://scifaro.com/en/abs/causality-control-flow-1910.14219</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-control-flow-1910.14219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-control-flow-1910.14219"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-synthesis-for-fragments-of-first-order-logic-over-data-words-1910.14294</loc><lastmod>2019-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-synthesis-for-fragments-of-first-order-logic-over-data-words-1910.14294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-synthesis-for-fragments-of-first-order-logic-over-data-words-1910.14294"/></url>
<url><loc>https://scifaro.com/en/abs/pomsets-with-boxes-protection-separation-and-locality-in-concurrent-kleene-algebra-1910.14384</loc><lastmod>2020-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pomsets-with-boxes-protection-separation-and-locality-in-concurrent-kleene-algebra-1910.14384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pomsets-with-boxes-protection-separation-and-locality-in-concurrent-kleene-algebra-1910.14384"/></url>
<url><loc>https://scifaro.com/en/abs/a-relational-program-logic-with-data-abstraction-and-dynamic-framing-1910.14560</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-relational-program-logic-with-data-abstraction-and-dynamic-framing-1910.14560"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-relational-program-logic-with-data-abstraction-and-dynamic-framing-1910.14560"/></url>
<url><loc>https://scifaro.com/en/abs/on-games-and-computation-1910.14603</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-games-and-computation-1910.14603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-games-and-computation-1910.14603"/></url>
<url><loc>https://scifaro.com/en/abs/an-implementation-of-homotopy-type-theory-in-isabelle-pure-1911.00399</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implementation-of-homotopy-type-theory-in-isabelle-pure-1911.00399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implementation-of-homotopy-type-theory-in-isabelle-pure-1911.00399"/></url>
<url><loc>https://scifaro.com/en/abs/sherali-adams-and-the-binary-encoding-of-combinatorial-principles-1911.00403</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sherali-adams-and-the-binary-encoding-of-combinatorial-principles-1911.00403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sherali-adams-and-the-binary-encoding-of-combinatorial-principles-1911.00403"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-dependency-pair-criterion-for-innermost-termination-1911.00406</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-dependency-pair-criterion-for-innermost-termination-1911.00406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-dependency-pair-criterion-for-innermost-termination-1911.00406"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-based-tool-to-embed-the-pi-calculus-into-a-computational-dpo-framework-1911.00407</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-based-tool-to-embed-the-pi-calculus-into-a-computational-dpo-framework-1911.00407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-based-tool-to-embed-the-pi-calculus-into-a-computational-dpo-framework-1911.00407"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-construction-of-multi-valued-concurrent-dynamic-logic-1911.00462</loc><lastmod>2019-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-construction-of-multi-valued-concurrent-dynamic-logic-1911.00462"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-construction-of-multi-valued-concurrent-dynamic-logic-1911.00462"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-to-univalent-foundations-of-mathematics-with-agda-1911.00580</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-to-univalent-foundations-of-mathematics-with-agda-1911.00580"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-to-univalent-foundations-of-mathematics-with-agda-1911.00580"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-el-is-exptime-complete-1911.00696</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-el-is-exptime-complete-1911.00696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-el-is-exptime-complete-1911.00696"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-lower-runtime-bounds-for-integer-programs-1911.01077</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-lower-runtime-bounds-for-integer-programs-1911.01077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-lower-runtime-bounds-for-integer-programs-1911.01077"/></url>
<url><loc>https://scifaro.com/en/abs/the-involutive-quantaloid-of-completely-distributive-lattices-1911.01085</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-involutive-quantaloid-of-completely-distributive-lattices-1911.01085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-involutive-quantaloid-of-completely-distributive-lattices-1911.01085"/></url>
<url><loc>https://scifaro.com/en/abs/generalising-kat-to-verify-weighted-computations-1911.01146</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalising-kat-to-verify-weighted-computations-1911.01146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalising-kat-to-verify-weighted-computations-1911.01146"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-arguments-in-an-argumentation-framework-into-three-valued-logical-expressions-1911.01185</loc><lastmod>2019-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-arguments-in-an-argumentation-framework-into-three-valued-logical-expressions-1911.01185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-arguments-in-an-argumentation-framework-into-three-valued-logical-expressions-1911.01185"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-visibility-based-weak-consistency-1911.01508</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-visibility-based-weak-consistency-1911.01508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-visibility-based-weak-consistency-1911.01508"/></url>
<url><loc>https://scifaro.com/en/abs/non-idempotent-intersection-types-in-logical-form-1911.01899</loc><lastmod>2019-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-idempotent-intersection-types-in-logical-form-1911.01899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-idempotent-intersection-types-in-logical-form-1911.01899"/></url>
<url><loc>https://scifaro.com/en/abs/display-to-labeled-proofs-and-back-again-for-tense-logics-1911.02289</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/display-to-labeled-proofs-and-back-again-for-tense-logics-1911.02289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/display-to-labeled-proofs-and-back-again-for-tense-logics-1911.02289"/></url>
<url><loc>https://scifaro.com/en/abs/promptness-and-bounded-fairness-in-concurrent-and-parameterized-systems-1911.03122</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/promptness-and-bounded-fairness-in-concurrent-and-parameterized-systems-1911.03122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/promptness-and-bounded-fairness-in-concurrent-and-parameterized-systems-1911.03122"/></url>
<url><loc>https://scifaro.com/en/abs/decision-procedures-for-guarded-logics-1911.03679</loc><lastmod>2021-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-procedures-for-guarded-logics-1911.03679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-procedures-for-guarded-logics-1911.03679"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-imperative-language-for-polynomial-time-1911.04026</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-imperative-language-for-polynomial-time-1911.04026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-imperative-language-for-polynomial-time-1911.04026"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-stochastic-boolean-satisfiability-a-logical-formalism-for-nexptime-decision-problems-with-uncertainty-1911.04112</loc><lastmod>2021-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-stochastic-boolean-satisfiability-a-logical-formalism-for-nexptime-decision-problems-with-uncertainty-1911.04112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-stochastic-boolean-satisfiability-a-logical-formalism-for-nexptime-decision-problems-with-uncertainty-1911.04112"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-openjdk-s-linkedlist-using-key-1911.04195</loc><lastmod>2019-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-openjdk-s-linkedlist-using-key-1911.04195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-openjdk-s-linkedlist-using-key-1911.04195"/></url>
<url><loc>https://scifaro.com/en/abs/bunch-theory-working-notes-on-applications-axioms-and-models-1911.04344</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bunch-theory-working-notes-on-applications-axioms-and-models-1911.04344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bunch-theory-working-notes-on-applications-axioms-and-models-1911.04344"/></url>
<url><loc>https://scifaro.com/en/abs/smart-contract-interactions-in-coq-1911.04732</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smart-contract-interactions-in-coq-1911.04732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smart-contract-interactions-in-coq-1911.04732"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-inductive-invariants-for-verification-of-cryptographic-protocols-with-unbounded-sessions-1911.05430</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-inductive-invariants-for-verification-of-cryptographic-protocols-with-unbounded-sessions-1911.05430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-inductive-invariants-for-verification-of-cryptographic-protocols-with-unbounded-sessions-1911.05430"/></url>
<url><loc>https://scifaro.com/en/abs/naive-cubical-type-theory-1911.05844</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/naive-cubical-type-theory-1911.05844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/naive-cubical-type-theory-1911.05844"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-behaviour-of-coalgebras-with-side-effects-and-algebras-with-effectful-iteration-1911.06346</loc><lastmod>2021-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-behaviour-of-coalgebras-with-side-effects-and-algebras-with-effectful-iteration-1911.06346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-behaviour-of-coalgebras-with-side-effects-and-algebras-with-effectful-iteration-1911.06346"/></url>
<url><loc>https://scifaro.com/en/abs/arguing-ecosystem-values-with-paraconsistent-logics-1911.06367</loc><lastmod>2019-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arguing-ecosystem-values-with-paraconsistent-logics-1911.06367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arguing-ecosystem-values-with-paraconsistent-logics-1911.06367"/></url>
<url><loc>https://scifaro.com/en/abs/smarter-features-simpler-learning-1911.06578</loc><lastmod>2020-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smarter-features-simpler-learning-1911.06578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smarter-features-simpler-learning-1911.06578"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-infinitary-quotient-inductive-types-1911.06899</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-infinitary-quotient-inductive-types-1911.06899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-infinitary-quotient-inductive-types-1911.06899"/></url>
<url><loc>https://scifaro.com/en/abs/linear-rankwidth-meets-stability-1911.07748</loc><lastmod>2019-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-rankwidth-meets-stability-1911.07748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-rankwidth-meets-stability-1911.07748"/></url>
<url><loc>https://scifaro.com/en/abs/combined-covers-and-beth-definability-extended-version-1911.07774</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combined-covers-and-beth-definability-extended-version-1911.07774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combined-covers-and-beth-definability-extended-version-1911.07774"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-compositional-reasoning-for-reactive-synthesis-from-finite-horizon-specifications-1911.08145</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-compositional-reasoning-for-reactive-synthesis-from-finite-horizon-specifications-1911.08145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-compositional-reasoning-for-reactive-synthesis-from-finite-horizon-specifications-1911.08145"/></url>
<url><loc>https://scifaro.com/en/abs/failure-of-normalization-in-impredicative-type-theory-with-proof-irrelevant-propositional-equality-1911.08174</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/failure-of-normalization-in-impredicative-type-theory-with-proof-irrelevant-propositional-equality-1911.08174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/failure-of-normalization-in-impredicative-type-theory-with-proof-irrelevant-propositional-equality-1911.08174"/></url>
<url><loc>https://scifaro.com/en/abs/timed-context-free-temporal-logics-1911.08406</loc><lastmod>2019-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-context-free-temporal-logics-1911.08406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-context-free-temporal-logics-1911.08406"/></url>
<url><loc>https://scifaro.com/en/abs/local-reasoning-for-global-graph-properties-1911.08632</loc><lastmod>2019-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-reasoning-for-global-graph-properties-1911.08632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-reasoning-for-global-graph-properties-1911.08632"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-minimal-perfect-hash-functions-using-sat-technology-1911.10099</loc><lastmod>2019-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-minimal-perfect-hash-functions-using-sat-technology-1911.10099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-minimal-perfect-hash-functions-using-sat-technology-1911.10099"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-mathematical-structure-of-cascade-effects-and-emergent-phenomena-1911.10376</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-mathematical-structure-of-cascade-effects-and-emergent-phenomena-1911.10376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-mathematical-structure-of-cascade-effects-and-emergent-phenomena-1911.10376"/></url>
<url><loc>https://scifaro.com/en/abs/the-bouquet-algorithm-for-model-checking-unbounded-until-1911.10478</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bouquet-algorithm-for-model-checking-unbounded-until-1911.10478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bouquet-algorithm-for-model-checking-unbounded-until-1911.10478"/></url>
<url><loc>https://scifaro.com/en/abs/checking-chase-termination-over-ontologies-of-existential-rules-with-equality-1911.10981</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-chase-termination-over-ontologies-of-existential-rules-with-equality-1911.10981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-chase-termination-over-ontologies-of-existential-rules-with-equality-1911.10981"/></url>
<url><loc>https://scifaro.com/en/abs/stit-semantics-for-epistemic-notions-based-on-information-disclosure-in-interactive-settings-1911.11086</loc><lastmod>2019-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stit-semantics-for-epistemic-notions-based-on-information-disclosure-in-interactive-settings-1911.11086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stit-semantics-for-epistemic-notions-based-on-information-disclosure-in-interactive-settings-1911.11086"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-analysis-of-quantum-programs-a-formal-approach-1911.11247</loc><lastmod>2020-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-analysis-of-quantum-programs-a-formal-approach-1911.11247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-analysis-of-quantum-programs-a-formal-approach-1911.11247"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-model-synchronization-with-multiary-delta-lenses-with-amendment-and-k-putput-1911.11302</loc><lastmod>2019-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-model-synchronization-with-multiary-delta-lenses-with-amendment-and-k-putput-1911.11302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-model-synchronization-with-multiary-delta-lenses-with-amendment-and-k-putput-1911.11302"/></url>
<url><loc>https://scifaro.com/en/abs/separateness-of-variables-a-novel-perspective-on-decidable-first-order-fragments-1911.11500</loc><lastmod>2019-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separateness-of-variables-a-novel-perspective-on-decidable-first-order-fragments-1911.11500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separateness-of-variables-a-novel-perspective-on-decidable-first-order-fragments-1911.11500"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-graph-matching-and-graph-edit-distance-using-answer-set-programming-1911.11584</loc><lastmod>2019-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-graph-matching-and-graph-edit-distance-using-answer-set-programming-1911.11584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-graph-matching-and-graph-edit-distance-using-answer-set-programming-1911.11584"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-system-for-the-universal-quantification-of-schematic-variables-1911.12749</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-system-for-the-universal-quantification-of-schematic-variables-1911.12749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-system-for-the-universal-quantification-of-schematic-variables-1911.12749"/></url>
<url><loc>https://scifaro.com/en/abs/a-geometrical-view-of-i-o-logic-1911.12837</loc><lastmod>2019-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-geometrical-view-of-i-o-logic-1911.12837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-geometrical-view-of-i-o-logic-1911.12837"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-recognition-of-graph-languages-1911.12884</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-recognition-of-graph-languages-1911.12884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-recognition-of-graph-languages-1911.12884"/></url>
<url><loc>https://scifaro.com/en/abs/general-supervised-learning-as-change-propagation-with-delta-lenses-1911.12904</loc><lastmod>2021-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-supervised-learning-as-change-propagation-with-delta-lenses-1911.12904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-supervised-learning-as-change-propagation-with-delta-lenses-1911.12904"/></url>
<url><loc>https://scifaro.com/en/abs/a-restricted-second-order-logic-for-non-deterministic-poly-logarithmic-time-1912.00010</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-restricted-second-order-logic-for-non-deterministic-poly-logarithmic-time-1912.00010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-restricted-second-order-logic-for-non-deterministic-poly-logarithmic-time-1912.00010"/></url>
<url><loc>https://scifaro.com/en/abs/negative-translations-for-affine-and-lukasiewicz-logic-1912.00012</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negative-translations-for-affine-and-lukasiewicz-logic-1912.00012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negative-translations-for-affine-and-lukasiewicz-logic-1912.00012"/></url>
<url><loc>https://scifaro.com/en/abs/pebble-intervals-automata-and-fo2-with-two-orders-extended-version-1912.00171</loc><lastmod>2019-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pebble-intervals-automata-and-fo2-with-two-orders-extended-version-1912.00171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pebble-intervals-automata-and-fo2-with-two-orders-extended-version-1912.00171"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-reduction-system-for-linear-logic-1912.00629</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-reduction-system-for-linear-logic-1912.00629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-reduction-system-for-linear-logic-1912.00629"/></url>
<url><loc>https://scifaro.com/en/abs/follow-the-flow-sets-relations-and-categories-as-special-cases-of-functions-with-no-domain-1912.00801</loc><lastmod>2019-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/follow-the-flow-sets-relations-and-categories-as-special-cases-of-functions-with-no-domain-1912.00801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/follow-the-flow-sets-relations-and-categories-as-special-cases-of-functions-with-no-domain-1912.00801"/></url>
<url><loc>https://scifaro.com/en/abs/fouriersat-a-fourier-expansion-based-algebraic-framework-for-solving-hybrid-boolean-constraints-1912.01032</loc><lastmod>2020-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fouriersat-a-fourier-expansion-based-algebraic-framework-for-solving-hybrid-boolean-constraints-1912.01032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fouriersat-a-fourier-expansion-based-algebraic-framework-for-solving-hybrid-boolean-constraints-1912.01032"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-formal-model-for-composable-container-systems-1912.01107</loc><lastmod>2019-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-formal-model-for-composable-container-systems-1912.01107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-formal-model-for-composable-container-systems-1912.01107"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-herbrand-functional-interpretation-1912.01333</loc><lastmod>2020-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-herbrand-functional-interpretation-1912.01333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-herbrand-functional-interpretation-1912.01333"/></url>
<url><loc>https://scifaro.com/en/abs/from-minizinc-to-optimization-modulo-theories-and-back-extended-version-1912.01476</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-minizinc-to-optimization-modulo-theories-and-back-extended-version-1912.01476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-minizinc-to-optimization-modulo-theories-and-back-extended-version-1912.01476"/></url>
<url><loc>https://scifaro.com/en/abs/game-description-logic-with-integers-a-gdl-numerical-extension-1912.01876</loc><lastmod>2020-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-description-logic-with-integers-a-gdl-numerical-extension-1912.01876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-description-logic-with-integers-a-gdl-numerical-extension-1912.01876"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantitative-understanding-of-pattern-matching-1912.01914</loc><lastmod>2019-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantitative-understanding-of-pattern-matching-1912.01914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantitative-understanding-of-pattern-matching-1912.01914"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-formalization-of-the-weak-perfect-graph-theorem-1912.02211</loc><lastmod>2019-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-formalization-of-the-weak-perfect-graph-theorem-1912.02211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-formalization-of-the-weak-perfect-graph-theorem-1912.02211"/></url>
<url><loc>https://scifaro.com/en/abs/exploration-of-neural-machine-translation-in-autoformalization-of-mathematics-in-mizar-1912.02636</loc><lastmod>2019-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploration-of-neural-machine-translation-in-autoformalization-of-mathematics-in-mizar-1912.02636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploration-of-neural-machine-translation-in-autoformalization-of-mathematics-in-mizar-1912.02636"/></url>
<url><loc>https://scifaro.com/en/abs/the-expressiveness-of-looping-terms-in-the-semantic-programming-1912.02731</loc><lastmod>2020-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-expressiveness-of-looping-terms-in-the-semantic-programming-1912.02731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-expressiveness-of-looping-terms-in-the-semantic-programming-1912.02731"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphism-revisited-1912.02885</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphism-revisited-1912.02885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphism-revisited-1912.02885"/></url>
<url><loc>https://scifaro.com/en/abs/recursive-algorithms-to-repair-prioritized-and-inconsistent-dl-lite-knowledge-base-1912.02898</loc><lastmod>2019-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursive-algorithms-to-repair-prioritized-and-inconsistent-dl-lite-knowledge-base-1912.02898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursive-algorithms-to-repair-prioritized-and-inconsistent-dl-lite-knowledge-base-1912.02898"/></url>
<url><loc>https://scifaro.com/en/abs/diversity-dependence-and-independence-1912.03252</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diversity-dependence-and-independence-1912.03252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diversity-dependence-and-independence-1912.03252"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-that-captures-beta-p-on-ordered-structures-1912.03841</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-that-captures-beta-p-on-ordered-structures-1912.03841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-that-captures-beta-p-on-ordered-structures-1912.03841"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-domains-in-formal-concept-analysis-1912.04496</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-domains-in-formal-concept-analysis-1912.04496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-domains-in-formal-concept-analysis-1912.04496"/></url>
<url><loc>https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-open-problems-1912.05616</loc><lastmod>2019-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-open-problems-1912.05616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ensuring-liveness-properties-of-distributed-systems-open-problems-1912.05616"/></url>
<url><loc>https://scifaro.com/en/abs/the-extended-hoa-format-for-synthesis-1912.05793</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-extended-hoa-format-for-synthesis-1912.05793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-extended-hoa-format-for-synthesis-1912.05793"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-debates-in-argumentation-theory-1912.05828</loc><lastmod>2019-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-debates-in-argumentation-theory-1912.05828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-debates-in-argumentation-theory-1912.05828"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-concatenation-over-finite-models-1912.06110</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-concatenation-over-finite-models-1912.06110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-concatenation-over-finite-models-1912.06110"/></url>
<url><loc>https://scifaro.com/en/abs/idris-ct-a-library-to-do-category-theory-in-idris-1912.06191</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/idris-ct-a-library-to-do-category-theory-in-idris-1912.06191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/idris-ct-a-library-to-do-category-theory-in-idris-1912.06191"/></url>
<url><loc>https://scifaro.com/en/abs/a-farewell-to-professor-rndr-v-v-e-ra-trnkov-a-drsc-1912.06467</loc><lastmod>2020-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-farewell-to-professor-rndr-v-v-e-ra-trnkov-a-drsc-1912.06467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-farewell-to-professor-rndr-v-v-e-ra-trnkov-a-drsc-1912.06467"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-verifying-population-protocols-1912.06578</loc><lastmod>2021-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-verifying-population-protocols-1912.06578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-verifying-population-protocols-1912.06578"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-the-irrationality-of-zeta-3-1912.06611</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-the-irrationality-of-zeta-3-1912.06611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-the-irrationality-of-zeta-3-1912.06611"/></url>
<url><loc>https://scifaro.com/en/abs/reconfiguration-and-message-losses-in-parameterized-broadcast-networks-1912.07042</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfiguration-and-message-losses-in-parameterized-broadcast-networks-1912.07042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfiguration-and-message-losses-in-parameterized-broadcast-networks-1912.07042"/></url>
<url><loc>https://scifaro.com/en/abs/synthetic-topology-in-homotopy-type-theory-for-probabilistic-programming-1912.07339</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthetic-topology-in-homotopy-type-theory-for-probabilistic-programming-1912.07339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthetic-topology-in-homotopy-type-theory-for-probabilistic-programming-1912.07339"/></url>
<url><loc>https://scifaro.com/en/abs/formal-analysis-of-the-biological-circuits-using-higher-order-logic-theorem-proving-1912.07340</loc><lastmod>2019-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-analysis-of-the-biological-circuits-using-higher-order-logic-theorem-proving-1912.07340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-analysis-of-the-biological-circuits-using-higher-order-logic-theorem-proving-1912.07340"/></url>
<url><loc>https://scifaro.com/en/abs/testing-membership-for-timed-automata-1912.08277</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-membership-for-timed-automata-1912.08277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-membership-for-timed-automata-1912.08277"/></url>
<url><loc>https://scifaro.com/en/abs/stone-duality-for-relations-1912.08418</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stone-duality-for-relations-1912.08418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stone-duality-for-relations-1912.08418"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-network-satisfaction-for-relation-algebras-with-normal-representations-1912.08482</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-network-satisfaction-for-relation-algebras-with-normal-representations-1912.08482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-network-satisfaction-for-relation-algebras-with-normal-representations-1912.08482"/></url>
<url><loc>https://scifaro.com/en/abs/formula-size-games-for-modal-logic-and-mu-calculus-1912.08715</loc><lastmod>2019-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formula-size-games-for-modal-logic-and-mu-calculus-1912.08715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formula-size-games-for-modal-logic-and-mu-calculus-1912.08715"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-graph-computation-models-1912.08966</loc><lastmod>2019-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-graph-computation-models-1912.08966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-tenth-international-workshop-on-graph-computation-models-1912.08966"/></url>
<url><loc>https://scifaro.com/en/abs/piecewise-linear-valued-csps-solvable-by-linear-programming-relaxation-1912.09298</loc><lastmod>2022-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/piecewise-linear-valued-csps-solvable-by-linear-programming-relaxation-1912.09298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/piecewise-linear-valued-csps-solvable-by-linear-programming-relaxation-1912.09298"/></url>
<url><loc>https://scifaro.com/en/abs/a-paraconsistent-asp-like-language-with-tractable-model-generation-1912.09715</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-paraconsistent-asp-like-language-with-tractable-model-generation-1912.09715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-paraconsistent-asp-like-language-with-tractable-model-generation-1912.09715"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-determinacy-of-concurrent-revisions-1912.09741</loc><lastmod>2019-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-determinacy-of-concurrent-revisions-1912.09741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-determinacy-of-concurrent-revisions-1912.09741"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-rectangular-grids-with-no-extra-non-unary-relations-1912.09797</loc><lastmod>2019-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-rectangular-grids-with-no-extra-non-unary-relations-1912.09797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-rectangular-grids-with-no-extra-non-unary-relations-1912.09797"/></url>
<url><loc>https://scifaro.com/en/abs/stubborn-set-reduction-for-two-player-reachability-games-1912.09875</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stubborn-set-reduction-for-two-player-reachability-games-1912.09875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stubborn-set-reduction-for-two-player-reachability-games-1912.09875"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-process-algebra-and-strategic-interleaving-1912.10041</loc><lastmod>2020-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-process-algebra-and-strategic-interleaving-1912.10041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-process-algebra-and-strategic-interleaving-1912.10041"/></url>
<url><loc>https://scifaro.com/en/abs/logic-and-rational-languages-of-scattered-and-countable-series-parallel-posets-1912.10240</loc><lastmod>2019-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-and-rational-languages-of-scattered-and-countable-series-parallel-posets-1912.10240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-and-rational-languages-of-scattered-and-countable-series-parallel-posets-1912.10240"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-x86-instruction-implementations-1912.10285</loc><lastmod>2019-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-x86-instruction-implementations-1912.10285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-x86-instruction-implementations-1912.10285"/></url>
<url><loc>https://scifaro.com/en/abs/bringing-belief-base-change-into-dynamic-epistemic-logic-1912.10515</loc><lastmod>2019-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bringing-belief-base-change-into-dynamic-epistemic-logic-1912.10515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bringing-belief-base-change-into-dynamic-epistemic-logic-1912.10515"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-correctness-for-pomset-logic-proof-nets-1912.10606</loc><lastmod>2023-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-correctness-for-pomset-logic-proof-nets-1912.10606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-correctness-for-pomset-logic-proof-nets-1912.10606"/></url>
<url><loc>https://scifaro.com/en/abs/towards-symbolic-factual-change-in-del-1912.10717</loc><lastmod>2019-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-symbolic-factual-change-in-del-1912.10717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-symbolic-factual-change-in-del-1912.10717"/></url>
<url><loc>https://scifaro.com/en/abs/narrowing-down-xml-template-expansion-and-schema-validation-1912.10816</loc><lastmod>2021-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/narrowing-down-xml-template-expansion-and-schema-validation-1912.10816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/narrowing-down-xml-template-expansion-and-schema-validation-1912.10816"/></url>
<url><loc>https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-mdps-1912.11223</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-mdps-1912.11223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-mdps-1912.11223"/></url>
<url><loc>https://scifaro.com/en/abs/action-logic-is-undecidable-1912.11273</loc><lastmod>2019-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/action-logic-is-undecidable-1912.11273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/action-logic-is-undecidable-1912.11273"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-second-international-workshop-on-automated-reasoning-challenges-applications-directions-exemplary-achievements-1912.11786</loc><lastmod>2019-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-second-international-workshop-on-automated-reasoning-challenges-applications-directions-exemplary-achievements-1912.11786"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-second-international-workshop-on-automated-reasoning-challenges-applications-directions-exemplary-achievements-1912.11786"/></url>
<url><loc>https://scifaro.com/en/abs/bitopological-duality-for-algebras-of-fittings-logic-and-natural-duality-extension-1912.12223</loc><lastmod>2019-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bitopological-duality-for-algebras-of-fittings-logic-and-natural-duality-extension-1912.12223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bitopological-duality-for-algebras-of-fittings-logic-and-natural-duality-extension-1912.12223"/></url>
<url><loc>https://scifaro.com/en/abs/aggregate-queries-on-sparse-databases-1912.12338</loc><lastmod>2020-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aggregate-queries-on-sparse-databases-1912.12338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aggregate-queries-on-sparse-databases-1912.12338"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-assignment-of-linear-erasure-and-duplication-1912.12837</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-assignment-of-linear-erasure-and-duplication-1912.12837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-assignment-of-linear-erasure-and-duplication-1912.12837"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-linear-temporal-logics-1912.12893</loc><lastmod>2020-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-linear-temporal-logics-1912.12893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-linear-temporal-logics-1912.12893"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-the-jungle-of-intuitionistic-temporal-logics-1912.12895</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-the-jungle-of-intuitionistic-temporal-logics-1912.12895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-the-jungle-of-intuitionistic-temporal-logics-1912.12895"/></url>
<url><loc>https://scifaro.com/en/abs/boldly-going-where-no-prover-has-gone-before-1912.12958</loc><lastmod>2020-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boldly-going-where-no-prover-has-gone-before-1912.12958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boldly-going-where-no-prover-has-gone-before-1912.12958"/></url>
<url><loc>https://scifaro.com/en/abs/the-challenge-of-unifying-semantic-and-syntactic-inference-restrictions-1912.12966</loc><lastmod>2020-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-challenge-of-unifying-semantic-and-syntactic-inference-restrictions-1912.12966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-challenge-of-unifying-semantic-and-syntactic-inference-restrictions-1912.12966"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-laws-of-monads-and-comonads-1912.13477</loc><lastmod>2020-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-laws-of-monads-and-comonads-1912.13477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-laws-of-monads-and-comonads-1912.13477"/></url>
<url><loc>https://scifaro.com/en/abs/rethinking-defeasible-reasoning-a-scalable-approach-2001.00406</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rethinking-defeasible-reasoning-a-scalable-approach-2001.00406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rethinking-defeasible-reasoning-a-scalable-approach-2001.00406"/></url>
<url><loc>https://scifaro.com/en/abs/on-supergraphs-satisfying-cmso-properties-2001.00758</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-supergraphs-satisfying-cmso-properties-2001.00758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-supergraphs-satisfying-cmso-properties-2001.00758"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-on-the-size-of-pc-and-urc-formulas-2001.00819</loc><lastmod>2021-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-on-the-size-of-pc-and-urc-formulas-2001.00819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-on-the-size-of-pc-and-urc-formulas-2001.00819"/></url>
<url><loc>https://scifaro.com/en/abs/selp-a-single-shot-epistemic-logic-program-solver-2001.01089</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/selp-a-single-shot-epistemic-logic-program-solver-2001.01089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/selp-a-single-shot-epistemic-logic-program-solver-2001.01089"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-2001.01516</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-2001.01516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-2001.01516"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-taylor-expansion-and-rigid-approximation-of-lambda-terms-2001.01619</loc><lastmod>2020-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-taylor-expansion-and-rigid-approximation-of-lambda-terms-2001.01619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-taylor-expansion-and-rigid-approximation-of-lambda-terms-2001.01619"/></url>
<url><loc>https://scifaro.com/en/abs/a-behavioural-theory-of-recursive-algorithms-2001.01862</loc><lastmod>2023-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-behavioural-theory-of-recursive-algorithms-2001.01862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-behavioural-theory-of-recursive-algorithms-2001.01862"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-theory-of-reflective-algorithms-i-reflective-sequential-algorithms-2001.01873</loc><lastmod>2023-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-theory-of-reflective-algorithms-i-reflective-sequential-algorithms-2001.01873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-theory-of-reflective-algorithms-i-reflective-sequential-algorithms-2001.01873"/></url>
<url><loc>https://scifaro.com/en/abs/a-journey-in-modal-proof-theory-from-minimal-normal-modal-logic-to-discrete-linear-temporal-logic-2001.02029</loc><lastmod>2020-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-journey-in-modal-proof-theory-from-minimal-normal-modal-logic-to-discrete-linear-temporal-logic-2001.02029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-journey-in-modal-proof-theory-from-minimal-normal-modal-logic-to-discrete-linear-temporal-logic-2001.02029"/></url>
<url><loc>https://scifaro.com/en/abs/pomset-logic-the-other-approach-to-non-commutativity-in-logic-2001.02155</loc><lastmod>2023-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pomset-logic-the-other-approach-to-non-commutativity-in-logic-2001.02155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pomset-logic-the-other-approach-to-non-commutativity-in-logic-2001.02155"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-reasoning-across-the-causal-hierarchy-2001.02889</loc><lastmod>2021-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-reasoning-across-the-causal-hierarchy-2001.02889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-reasoning-across-the-causal-hierarchy-2001.02889"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computational-content-of-zorn-s-lemma-2001.03540</loc><lastmod>2020-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computational-content-of-zorn-s-lemma-2001.03540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computational-content-of-zorn-s-lemma-2001.03540"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-loosely-guarded-fragment-and-querying-its-horn-fragment-using-resolution-2001.03829</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-loosely-guarded-fragment-and-querying-its-horn-fragment-using-resolution-2001.03829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-loosely-guarded-fragment-and-querying-its-horn-fragment-using-resolution-2001.03829"/></url>
<url><loc>https://scifaro.com/en/abs/commonly-knowing-whether-2001.03945</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/commonly-knowing-whether-2001.03945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/commonly-knowing-whether-2001.03945"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-visualization-of-saturation-attempts-in-vampire-2001.04100</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-visualization-of-saturation-attempts-in-vampire-2001.04100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-visualization-of-saturation-attempts-in-vampire-2001.04100"/></url>
<url><loc>https://scifaro.com/en/abs/newtonian-space-time-algebra-2001.04242</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/newtonian-space-time-algebra-2001.04242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/newtonian-space-time-algebra-2001.04242"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-quantum-process-algebra-eqpalg-approach-for-distributed-quantum-systems-2001.04249</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-quantum-process-algebra-eqpalg-approach-for-distributed-quantum-systems-2001.04249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-quantum-process-algebra-eqpalg-approach-for-distributed-quantum-systems-2001.04249"/></url>
<url><loc>https://scifaro.com/en/abs/on-concept-of-petri-nets-receptors-and-effectors-2001.04265</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-concept-of-petri-nets-receptors-and-effectors-2001.04265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-concept-of-petri-nets-receptors-and-effectors-2001.04265"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-linear-structure-of-cones-2001.04284</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-linear-structure-of-cones-2001.04284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-linear-structure-of-cones-2001.04284"/></url>
<url><loc>https://scifaro.com/en/abs/symblicit-exploration-and-elimination-for-probabilistic-model-checking-2001.04289</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symblicit-exploration-and-elimination-for-probabilistic-model-checking-2001.04289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symblicit-exploration-and-elimination-for-probabilistic-model-checking-2001.04289"/></url>
<url><loc>https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-2001.04347</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-2001.04347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-2001.04347"/></url>
<url><loc>https://scifaro.com/en/abs/state-diagrams-of-functional-programs-2001.04405</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/state-diagrams-of-functional-programs-2001.04405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/state-diagrams-of-functional-programs-2001.04405"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-packrat-parser-interpreter-for-parsing-expression-grammars-2001.04457</loc><lastmod>2020-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-packrat-parser-interpreter-for-parsing-expression-grammars-2001.04457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-packrat-parser-interpreter-for-parsing-expression-grammars-2001.04457"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplified-supreme-being-necessarily-exists-says-the-computer-computationally-explored-variants-of-g-odel-s-ontological-argument-2001.04701</loc><lastmod>2020-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplified-supreme-being-necessarily-exists-says-the-computer-computationally-explored-variants-of-g-odel-s-ontological-argument-2001.04701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplified-supreme-being-necessarily-exists-says-the-computer-computationally-explored-variants-of-g-odel-s-ontological-argument-2001.04701"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-syntax-and-semantics-for-directed-file-transformations-2001.04952</loc><lastmod>2021-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-syntax-and-semantics-for-directed-file-transformations-2001.04952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-syntax-and-semantics-for-directed-file-transformations-2001.04952"/></url>
<url><loc>https://scifaro.com/en/abs/a-circular-proof-system-for-the-hybrid-mu-calculus-2001.04971</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-circular-proof-system-for-the-hybrid-mu-calculus-2001.04971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-circular-proof-system-for-the-hybrid-mu-calculus-2001.04971"/></url>
<url><loc>https://scifaro.com/en/abs/strong-progress-for-session-typed-processes-in-a-linear-metalogic-with-circular-proofs-2001.05132</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-progress-for-session-typed-processes-in-a-linear-metalogic-with-circular-proofs-2001.05132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-progress-for-session-typed-processes-in-a-linear-metalogic-with-circular-proofs-2001.05132"/></url>
<url><loc>https://scifaro.com/en/abs/reward-shaping-for-reinforcement-learning-with-omega-regular-objectives-2001.05977</loc><lastmod>2020-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reward-shaping-for-reinforcement-learning-with-omega-regular-objectives-2001.05977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reward-shaping-for-reinforcement-learning-with-omega-regular-objectives-2001.05977"/></url>
<url><loc>https://scifaro.com/en/abs/strong-separation-logic-2001.06235</loc><lastmod>2021-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-separation-logic-2001.06235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-separation-logic-2001.06235"/></url>
<url><loc>https://scifaro.com/en/abs/pumping-lemmas-for-weighted-automata-2001.06272</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pumping-lemmas-for-weighted-automata-2001.06272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pumping-lemmas-for-weighted-automata-2001.06272"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-of-equations-by-monoidal-monads-2001.06348</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-of-equations-by-monoidal-monads-2001.06348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-of-equations-by-monoidal-monads-2001.06348"/></url>
<url><loc>https://scifaro.com/en/abs/relational-width-of-first-order-expansions-of-homogeneous-graphs-with-bounded-strict-width-2001.06676</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-width-of-first-order-expansions-of-homogeneous-graphs-with-bounded-strict-width-2001.06676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-width-of-first-order-expansions-of-homogeneous-graphs-with-bounded-strict-width-2001.06676"/></url>
<url><loc>https://scifaro.com/en/abs/fasim-a-framework-for-automatic-formal-analysis-of-simulink-models-of-linear-analog-circuits-2001.06702</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fasim-a-framework-for-automatic-formal-analysis-of-simulink-models-of-linear-analog-circuits-2001.06702"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fasim-a-framework-for-automatic-formal-analysis-of-simulink-models-of-linear-analog-circuits-2001.06702"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-action-logic-with-exponentiation-2001.06863</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-action-logic-with-exponentiation-2001.06863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-action-logic-with-exponentiation-2001.06863"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-first-order-affine-inductive-data-types-via-slice-categories-2001.06905</loc><lastmod>2021-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-first-order-affine-inductive-data-types-via-slice-categories-2001.06905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-first-order-affine-inductive-data-types-via-slice-categories-2001.06905"/></url>
<url><loc>https://scifaro.com/en/abs/modular-coinduction-up-to-for-higher-order-languages-via-first-order-transition-systems-2001.07063</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-coinduction-up-to-for-higher-order-languages-via-first-order-transition-systems-2001.07063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-coinduction-up-to-for-higher-order-languages-via-first-order-transition-systems-2001.07063"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-epistemic-logic-games-with-epistemic-temporal-goals-2001.07141</loc><lastmod>2020-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-games-with-epistemic-temporal-goals-2001.07141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-games-with-epistemic-temporal-goals-2001.07141"/></url>
<url><loc>https://scifaro.com/en/abs/a-graph-based-spatial-temporal-logic-for-knowledge-representation-and-automated-reasoning-in-cognitive-robots-2001.07205</loc><lastmod>2020-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graph-based-spatial-temporal-logic-for-knowledge-representation-and-automated-reasoning-in-cognitive-robots-2001.07205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graph-based-spatial-temporal-logic-for-knowledge-representation-and-automated-reasoning-in-cognitive-robots-2001.07205"/></url>
<url><loc>https://scifaro.com/en/abs/provenance-for-the-description-logic-elhr-2001.07541</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provenance-for-the-description-logic-elhr-2001.07541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provenance-for-the-description-logic-elhr-2001.07541"/></url>
<url><loc>https://scifaro.com/en/abs/incompleteness-for-stably-consistent-formal-systems-2001.07592</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incompleteness-for-stably-consistent-formal-systems-2001.07592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incompleteness-for-stably-consistent-formal-systems-2001.07592"/></url>
<url><loc>https://scifaro.com/en/abs/a-symmetric-protocol-to-establish-service-level-agreements-2001.07658</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symmetric-protocol-to-establish-service-level-agreements-2001.07658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symmetric-protocol-to-establish-service-level-agreements-2001.07658"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-maximal-progress-and-discrete-time-2001.08040</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-maximal-progress-and-discrete-time-2001.08040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-maximal-progress-and-discrete-time-2001.08040"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-preserving-composition-of-synchronously-and-asynchronously-interacting-workflow-net-components-2001.08064</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-preserving-composition-of-synchronously-and-asynchronously-interacting-workflow-net-components-2001.08064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-preserving-composition-of-synchronously-and-asynchronously-interacting-workflow-net-components-2001.08064"/></url>
<url><loc>https://scifaro.com/en/abs/asnp-a-tame-fragment-of-existential-second-order-logic-2001.08190</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asnp-a-tame-fragment-of-existential-second-order-logic-2001.08190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asnp-a-tame-fragment-of-existential-second-order-logic-2001.08190"/></url>
<url><loc>https://scifaro.com/en/abs/star-games-and-hydras-2001.08478</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/star-games-and-hydras-2001.08478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/star-games-and-hydras-2001.08478"/></url>
<url><loc>https://scifaro.com/en/abs/up-to-techniques-for-branching-bisimilarity-2001.08944</loc><lastmod>2020-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/up-to-techniques-for-branching-bisimilarity-2001.08944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/up-to-techniques-for-branching-bisimilarity-2001.08944"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-guided-neural-synthesis-2001.09245</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-guided-neural-synthesis-2001.09245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-guided-neural-synthesis-2001.09245"/></url>
<url><loc>https://scifaro.com/en/abs/operationally-based-program-equivalence-proofs-using-lctrss-2001.09649</loc><lastmod>2020-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operationally-based-program-equivalence-proofs-using-lctrss-2001.09649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operationally-based-program-equivalence-proofs-using-lctrss-2001.09649"/></url>
<url><loc>https://scifaro.com/en/abs/layered-clause-selection-for-theory-reasoning-2001.09705</loc><lastmod>2020-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-clause-selection-for-theory-reasoning-2001.09705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-clause-selection-for-theory-reasoning-2001.09705"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-forcing-in-isabelle-zf-2001.09715</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-forcing-in-isabelle-zf-2001.09715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-forcing-in-isabelle-zf-2001.09715"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-safety-constraints-coalgebraically-2001.09787</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-safety-constraints-coalgebraically-2001.09787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-safety-constraints-coalgebraically-2001.09787"/></url>
<url><loc>https://scifaro.com/en/abs/flatness-and-complexity-of-immediate-observation-petri-nets-2001.09966</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flatness-and-complexity-of-immediate-observation-petri-nets-2001.09966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flatness-and-complexity-of-immediate-observation-petri-nets-2001.09966"/></url>
<url><loc>https://scifaro.com/en/abs/subsumption-demodulation-in-first-order-theorem-proving-2001.10213</loc><lastmod>2020-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subsumption-demodulation-in-first-order-theorem-proving-2001.10213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subsumption-demodulation-in-first-order-theorem-proving-2001.10213"/></url>
<url><loc>https://scifaro.com/en/abs/veronica-expressive-and-precise-concurrent-information-flow-security-extended-version-with-technical-appendices-2001.11142</loc><lastmod>2020-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/veronica-expressive-and-precise-concurrent-information-flow-security-extended-version-with-technical-appendices-2001.11142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/veronica-expressive-and-precise-concurrent-information-flow-security-extended-version-with-technical-appendices-2001.11142"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-logic-in-linear-space-2001.11186</loc><lastmod>2020-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-logic-in-linear-space-2001.11186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-logic-in-linear-space-2001.11186"/></url>
<url><loc>https://scifaro.com/en/abs/the-hidden-subgroup-problem-for-universal-algebras-2001.11298</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hidden-subgroup-problem-for-universal-algebras-2001.11298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hidden-subgroup-problem-for-universal-algebras-2001.11298"/></url>
<url><loc>https://scifaro.com/en/abs/recursion-evolution-and-conscious-self-2001.11825</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursion-evolution-and-conscious-self-2001.11825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursion-evolution-and-conscious-self-2001.11825"/></url>
<url><loc>https://scifaro.com/en/abs/relational-semigroups-and-object-free-categories-2001.11895</loc><lastmod>2020-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-semigroups-and-object-free-categories-2001.11895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-semigroups-and-object-free-categories-2001.11895"/></url>
<url><loc>https://scifaro.com/en/abs/zeta-functions-and-the-linear-logic-of-markov-processes-2001.11906</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zeta-functions-and-the-linear-logic-of-markov-processes-2001.11906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zeta-functions-and-the-linear-logic-of-markov-processes-2001.11906"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-fixed-point-logic-2002.00188</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-fixed-point-logic-2002.00188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-fixed-point-logic-2002.00188"/></url>
<url><loc>https://scifaro.com/en/abs/agent-based-proof-design-via-lemma-flow-diagram-2002.00666</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/agent-based-proof-design-via-lemma-flow-diagram-2002.00666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/agent-based-proof-design-via-lemma-flow-diagram-2002.00666"/></url>
<url><loc>https://scifaro.com/en/abs/introduction-of-quantification-in-frame-semantics-2002.00720</loc><lastmod>2020-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introduction-of-quantification-in-frame-semantics-2002.00720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introduction-of-quantification-in-frame-semantics-2002.00720"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-difference-categories-extended-report-2002.01091</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-difference-categories-extended-report-2002.01091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-difference-categories-extended-report-2002.01091"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-guarded-separation-logic-complete-entailment-checking-for-separation-logic-with-inductive-definitions-2002.01202</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-guarded-separation-logic-complete-entailment-checking-for-separation-logic-with-inductive-definitions-2002.01202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-guarded-separation-logic-complete-entailment-checking-for-separation-logic-with-inductive-definitions-2002.01202"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-type-distributors-2002.01287</loc><lastmod>2021-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-type-distributors-2002.01287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-type-distributors-2002.01287"/></url>
<url><loc>https://scifaro.com/en/abs/completing-simple-valuations-in-k-categories-2002.01865</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completing-simple-valuations-in-k-categories-2002.01865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completing-simple-valuations-in-k-categories-2002.01865"/></url>
<url><loc>https://scifaro.com/en/abs/querying-guarded-fragments-via-resolution-2002.02228</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-guarded-fragments-via-resolution-2002.02228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-guarded-fragments-via-resolution-2002.02228"/></url>
<url><loc>https://scifaro.com/en/abs/convolution-and-concurrency-2002.02321</loc><lastmod>2020-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convolution-and-concurrency-2002.02321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convolution-and-concurrency-2002.02321"/></url>
<url><loc>https://scifaro.com/en/abs/relating-apartness-and-bisimulation-2002.02512</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-apartness-and-bisimulation-2002.02512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-apartness-and-bisimulation-2002.02512"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-hybrid-games-2002.02536</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-hybrid-games-2002.02536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-hybrid-games-2002.02536"/></url>
<url><loc>https://scifaro.com/en/abs/refining-constructive-hybrid-games-2002.02576</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-constructive-hybrid-games-2002.02576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-constructive-hybrid-games-2002.02576"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-euler-venn-diagrams-extended-2002.02929</loc><lastmod>2020-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-euler-venn-diagrams-extended-2002.02929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-euler-venn-diagrams-extended-2002.02929"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-atl-satisfiability-checking-2002.03117</loc><lastmod>2020-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-atl-satisfiability-checking-2002.03117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-atl-satisfiability-checking-2002.03117"/></url>
<url><loc>https://scifaro.com/en/abs/means-fit-effectivity-2002.03145</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/means-fit-effectivity-2002.03145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/means-fit-effectivity-2002.03145"/></url>
<url><loc>https://scifaro.com/en/abs/relativization-of-gurevich-s-conjectures-2002.03725</loc><lastmod>2020-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relativization-of-gurevich-s-conjectures-2002.03725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relativization-of-gurevich-s-conjectures-2002.03725"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-proofs-in-a-propositional-logic-modulo-isomorphisms-2002.03762</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-proofs-in-a-propositional-logic-modulo-isomorphisms-2002.03762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-proofs-in-a-propositional-logic-modulo-isomorphisms-2002.03762"/></url>
<url><loc>https://scifaro.com/en/abs/the-bang-calculus-revisited-2002.04011</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bang-calculus-revisited-2002.04011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bang-calculus-revisited-2002.04011"/></url>
<url><loc>https://scifaro.com/en/abs/theories-of-real-addition-with-and-without-a-predicate-for-integers-2002.04282</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theories-of-real-addition-with-and-without-a-predicate-for-integers-2002.04282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theories-of-real-addition-with-and-without-a-predicate-for-integers-2002.04282"/></url>
<url><loc>https://scifaro.com/en/abs/modular-path-queries-with-arithmetic-2002.04460</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-path-queries-with-arithmetic-2002.04460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-path-queries-with-arithmetic-2002.04460"/></url>
<url><loc>https://scifaro.com/en/abs/on-termination-of-transactions-over-semantic-document-models-2002.05064</loc><lastmod>2020-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-termination-of-transactions-over-semantic-document-models-2002.05064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-termination-of-transactions-over-semantic-document-models-2002.05064"/></url>
<url><loc>https://scifaro.com/en/abs/np-reasoning-in-the-monotone-mu-calculus-2002.05075</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-reasoning-in-the-monotone-mu-calculus-2002.05075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-reasoning-in-the-monotone-mu-calculus-2002.05075"/></url>
<url><loc>https://scifaro.com/en/abs/change-actions-from-incremental-computation-to-discrete-derivatives-2002.05256</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/change-actions-from-incremental-computation-to-discrete-derivatives-2002.05256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/change-actions-from-incremental-computation-to-discrete-derivatives-2002.05256"/></url>
<url><loc>https://scifaro.com/en/abs/the-abstract-machinery-of-interaction-long-version-2002.05649</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-abstract-machinery-of-interaction-long-version-2002.05649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-abstract-machinery-of-interaction-long-version-2002.05649"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-labelled-calculi-for-preferential-conditional-logics-based-on-neighbourhood-semantics-2002.05958</loc><lastmod>2020-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-labelled-calculi-for-preferential-conditional-logics-based-on-neighbourhood-semantics-2002.05958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-labelled-calculi-for-preferential-conditional-logics-based-on-neighbourhood-semantics-2002.05958"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-coinduction-in-agda-2002.06047</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-coinduction-in-agda-2002.06047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-coinduction-in-agda-2002.06047"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-and-query-answering-in-description-logics-with-global-and-local-cardinality-constraints-2002.06072</loc><lastmod>2020-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-and-query-answering-in-description-logics-with-global-and-local-cardinality-constraints-2002.06072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-and-query-answering-in-description-logics-with-global-and-local-cardinality-constraints-2002.06072"/></url>
<url><loc>https://scifaro.com/en/abs/graded-algebraic-theories-2002.06784</loc><lastmod>2020-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-algebraic-theories-2002.06784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-algebraic-theories-2002.06784"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-prove-theorems-by-learning-to-generate-theorems-2002.07019</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-prove-theorems-by-learning-to-generate-theorems-2002.07019"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-prove-theorems-by-learning-to-generate-theorems-2002.07019"/></url>
<url><loc>https://scifaro.com/en/abs/when-symmetries-are-not-enough-a-hierarchy-of-hard-constraint-satisfaction-problems-2002.07054</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-symmetries-are-not-enough-a-hierarchy-of-hard-constraint-satisfaction-problems-2002.07054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-symmetries-are-not-enough-a-hierarchy-of-hard-constraint-satisfaction-problems-2002.07054"/></url>
<url><loc>https://scifaro.com/en/abs/an-smt-based-concolic-testing-tool-for-logic-programs-2002.07115</loc><lastmod>2020-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-smt-based-concolic-testing-tool-for-logic-programs-2002.07115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-smt-based-concolic-testing-tool-for-logic-programs-2002.07115"/></url>
<url><loc>https://scifaro.com/en/abs/on-higher-order-cryptography-long-version-2002.07218</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-higher-order-cryptography-long-version-2002.07218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-higher-order-cryptography-long-version-2002.07218"/></url>
<url><loc>https://scifaro.com/en/abs/integrated-information-in-process-theories-2002.07654</loc><lastmod>2020-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrated-information-in-process-theories-2002.07654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrated-information-in-process-theories-2002.07654"/></url>
<url><loc>https://scifaro.com/en/abs/functional-pearl-the-distributive-lambda-calculus-2002.07944</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-pearl-the-distributive-lambda-calculus-2002.07944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-pearl-the-distributive-lambda-calculus-2002.07944"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-higher-inductive-types-as-groupoid-quotients-2002.08150</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-higher-inductive-types-as-groupoid-quotients-2002.08150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-higher-inductive-types-as-groupoid-quotients-2002.08150"/></url>
<url><loc>https://scifaro.com/en/abs/imprecise-probability-for-multiparty-session-types-in-process-algebra-2002.08175</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imprecise-probability-for-multiparty-session-types-in-process-algebra-2002.08175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imprecise-probability-for-multiparty-session-types-in-process-algebra-2002.08175"/></url>
<url><loc>https://scifaro.com/en/abs/interface-modeling-for-quality-and-resource-management-2002.08181</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interface-modeling-for-quality-and-resource-management-2002.08181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interface-modeling-for-quality-and-resource-management-2002.08181"/></url>
<url><loc>https://scifaro.com/en/abs/on-computability-of-data-word-functions-defined-by-transducers-2002.08203</loc><lastmod>2020-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-computability-of-data-word-functions-defined-by-transducers-2002.08203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-computability-of-data-word-functions-defined-by-transducers-2002.08203"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-probabilistic-lambda-calculi-2002.08392</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-probabilistic-lambda-calculi-2002.08392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-probabilistic-lambda-calculi-2002.08392"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-game-logic-2002.08523</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-game-logic-2002.08523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-game-logic-2002.08523"/></url>
<url><loc>https://scifaro.com/en/abs/from-stateless-to-stateful-priorities-technical-report-2002.08646</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-stateless-to-stateful-priorities-technical-report-2002.08646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-stateless-to-stateful-priorities-technical-report-2002.08646"/></url>
<url><loc>https://scifaro.com/en/abs/contextual-equivalence-for-signal-flow-graphs-2002.08874</loc><lastmod>2020-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contextual-equivalence-for-signal-flow-graphs-2002.08874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contextual-equivalence-for-signal-flow-graphs-2002.08874"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-of-reaction-systems-by-the-strictly-minimal-ones-2002.09033</loc><lastmod>2020-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-of-reaction-systems-by-the-strictly-minimal-ones-2002.09033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-of-reaction-systems-by-the-strictly-minimal-ones-2002.09033"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-type-theory-in-isabelle-2002.09282</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-type-theory-in-isabelle-2002.09282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-type-theory-in-isabelle-2002.09282"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-kleene-algebra-with-observations-from-hypotheses-to-completeness-2002.09682</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-kleene-algebra-with-observations-from-hypotheses-to-completeness-2002.09682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-kleene-algebra-with-observations-from-hypotheses-to-completeness-2002.09682"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-interpolants-in-euf-algorithms-using-dag-representations-2002.09784</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-interpolants-in-euf-algorithms-using-dag-representations-2002.09784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-interpolants-in-euf-algorithms-using-dag-representations-2002.09784"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanised-semantics-for-hol-with-ad-hoc-overloading-2002.10212</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanised-semantics-for-hol-with-ad-hoc-overloading-2002.10212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanised-semantics-for-hol-with-ad-hoc-overloading-2002.10212"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-checker-for-a-logical-framework-with-union-and-intersection-types-2002.10803</loc><lastmod>2020-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-checker-for-a-logical-framework-with-union-and-intersection-types-2002.10803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-checker-for-a-logical-framework-with-union-and-intersection-types-2002.10803"/></url>
<url><loc>https://scifaro.com/en/abs/failure-trace-semantics-for-a-process-algebra-with-time-outs-2002.10814</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/failure-trace-semantics-for-a-process-algebra-with-time-outs-2002.10814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/failure-trace-semantics-for-a-process-algebra-with-time-outs-2002.10814"/></url>
<url><loc>https://scifaro.com/en/abs/facets-of-the-pie-environment-for-proving-interpolating-and-eliminating-on-the-basis-of-first-order-logic-2002.10892</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facets-of-the-pie-environment-for-proving-interpolating-and-eliminating-on-the-basis-of-first-order-logic-2002.10892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facets-of-the-pie-environment-for-proving-interpolating-and-eliminating-on-the-basis-of-first-order-logic-2002.10892"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-pcl-over-product-valuation-monoids-2002.10973</loc><lastmod>2021-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-pcl-over-product-valuation-monoids-2002.10973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-pcl-over-product-valuation-monoids-2002.10973"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-non-bisimilarity-in-a-coalgebraic-approach-games-and-distinguishing-formulas-2002.11459</loc><lastmod>2020-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-non-bisimilarity-in-a-coalgebraic-approach-games-and-distinguishing-formulas-2002.11459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-non-bisimilarity-in-a-coalgebraic-approach-games-and-distinguishing-formulas-2002.11459"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-theorem-proving-components-for-educational-software-2002.11895</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-theorem-proving-components-for-educational-software-2002.11895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-theorem-proving-components-for-educational-software-2002.11895"/></url>
<url><loc>https://scifaro.com/en/abs/a-lower-bound-of-the-number-of-rewrite-rules-obtained-by-homological-methods-2002.11942</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lower-bound-of-the-number-of-rewrite-rules-obtained-by-homological-methods-2002.11942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lower-bound-of-the-number-of-rewrite-rules-obtained-by-homological-methods-2002.11942"/></url>
<url><loc>https://scifaro.com/en/abs/residuated-implications-derived-from-quasi-overlap-functions-on-lattices-2002.12267</loc><lastmod>2020-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/residuated-implications-derived-from-quasi-overlap-functions-on-lattices-2002.12267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/residuated-implications-derived-from-quasi-overlap-functions-on-lattices-2002.12267"/></url>
<url><loc>https://scifaro.com/en/abs/providing-hints-next-steps-and-feedback-in-a-tutoring-system-for-structural-induction-2002.12552</loc><lastmod>2020-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/providing-hints-next-steps-and-feedback-in-a-tutoring-system-for-structural-induction-2002.12552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/providing-hints-next-steps-and-feedback-in-a-tutoring-system-for-structural-induction-2002.12552"/></url>
<url><loc>https://scifaro.com/en/abs/a-mobile-application-for-self-guided-study-of-formal-reasoning-2002.12553</loc><lastmod>2020-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mobile-application-for-self-guided-study-of-formal-reasoning-2002.12553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mobile-application-for-self-guided-study-of-formal-reasoning-2002.12553"/></url>
<url><loc>https://scifaro.com/en/abs/tools-in-term-rewriting-for-education-2002.12554</loc><lastmod>2020-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tools-in-term-rewriting-for-education-2002.12554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tools-in-term-rewriting-for-education-2002.12554"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-a-formalized-logical-calculus-2002.12555</loc><lastmod>2020-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-a-formalized-logical-calculus-2002.12555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-a-formalized-logical-calculus-2002.12555"/></url>
<url><loc>https://scifaro.com/en/abs/solving-satisfiability-of-polynomial-formulas-by-sample-cell-projection-2003.00409</loc><lastmod>2020-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-satisfiability-of-polynomial-formulas-by-sample-cell-projection-2003.00409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-satisfiability-of-polynomial-formulas-by-sample-cell-projection-2003.00409"/></url>
<url><loc>https://scifaro.com/en/abs/process-algebra-process-scheduling-and-mutual-exclusion-2003.00473</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-algebra-process-scheduling-and-mutual-exclusion-2003.00473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-algebra-process-scheduling-and-mutual-exclusion-2003.00473"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-of-real-computation-and-probabilistic-independence-logic-2003.00644</loc><lastmod>2020-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-of-real-computation-and-probabilistic-independence-logic-2003.00644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-of-real-computation-and-probabilistic-independence-logic-2003.00644"/></url>
<url><loc>https://scifaro.com/en/abs/a-cubical-language-for-bishop-sets-2003.01491</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cubical-language-for-bishop-sets-2003.01491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cubical-language-for-bishop-sets-2003.01491"/></url>
<url><loc>https://scifaro.com/en/abs/sparse-tiling-through-overlap-closures-for-termination-of-string-rewriting-2003.01696</loc><lastmod>2020-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sparse-tiling-through-overlap-closures-for-termination-of-string-rewriting-2003.01696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sparse-tiling-through-overlap-closures-for-termination-of-string-rewriting-2003.01696"/></url>
<url><loc>https://scifaro.com/en/abs/an-effective-version-of-definability-in-metric-model-theory-2003.02087</loc><lastmod>2020-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-effective-version-of-definability-in-metric-model-theory-2003.02087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-effective-version-of-definability-in-metric-model-theory-2003.02087"/></url>
<url><loc>https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-2003.02521</loc><lastmod>2020-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-2003.02521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-open-world-query-answering-with-number-restrictions-2003.02521"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-better-understanding-of-partial-weighted-maxsat-proof-systems-2003.02718</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-better-understanding-of-partial-weighted-maxsat-proof-systems-2003.02718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-better-understanding-of-partial-weighted-maxsat-proof-systems-2003.02718"/></url>
<url><loc>https://scifaro.com/en/abs/static-symmetry-breaking-in-many-sorted-finite-model-finding-2003.02882</loc><lastmod>2020-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-symmetry-breaking-in-many-sorted-finite-model-finding-2003.02882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-symmetry-breaking-in-many-sorted-finite-model-finding-2003.02882"/></url>
<url><loc>https://scifaro.com/en/abs/boosting-answer-set-optimization-with-weighted-comparator-networks-2003.03332</loc><lastmod>2020-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boosting-answer-set-optimization-with-weighted-comparator-networks-2003.03332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boosting-answer-set-optimization-with-weighted-comparator-networks-2003.03332"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-random-access-stored-program-machines-2003.03514</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-random-access-stored-program-machines-2003.03514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-random-access-stored-program-machines-2003.03514"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-cyber-physical-systems-using-theorem-proving-invited-paper-2003.03729</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-cyber-physical-systems-using-theorem-proving-invited-paper-2003.03729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-cyber-physical-systems-using-theorem-proving-invited-paper-2003.03729"/></url>
<url><loc>https://scifaro.com/en/abs/strategic-abilities-of-asynchronous-agents-semantic-side-effects-and-how-to-tame-them-2003.03867</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategic-abilities-of-asynchronous-agents-semantic-side-effects-and-how-to-tame-them-2003.03867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategic-abilities-of-asynchronous-agents-semantic-side-effects-and-how-to-tame-them-2003.03867"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-treatment-of-aggregates-and-constraints-in-hybrid-asp-2003.04176</loc><lastmod>2020-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-treatment-of-aggregates-and-constraints-in-hybrid-asp-2003.04176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-treatment-of-aggregates-and-constraints-in-hybrid-asp-2003.04176"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-temporal-logics-to-neural-networks-2003.04218</loc><lastmod>2021-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-temporal-logics-to-neural-networks-2003.04218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-temporal-logics-to-neural-networks-2003.04218"/></url>
<url><loc>https://scifaro.com/en/abs/are-you-satisfied-by-this-partial-assignment-2003.04225</loc><lastmod>2020-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-you-satisfied-by-this-partial-assignment-2003.04225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-you-satisfied-by-this-partial-assignment-2003.04225"/></url>
<url><loc>https://scifaro.com/en/abs/hilbert-s-tenth-problem-in-coq-extended-version-2003.04604</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hilbert-s-tenth-problem-in-coq-extended-version-2003.04604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hilbert-s-tenth-problem-in-coq-extended-version-2003.04604"/></url>
<url><loc>https://scifaro.com/en/abs/scl-with-theory-constraints-2003.04627</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scl-with-theory-constraints-2003.04627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scl-with-theory-constraints-2003.04627"/></url>
<url><loc>https://scifaro.com/en/abs/dialectica-fuzzy-petri-nets-2003.04712</loc><lastmod>2020-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dialectica-fuzzy-petri-nets-2003.04712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dialectica-fuzzy-petri-nets-2003.04712"/></url>
<url><loc>https://scifaro.com/en/abs/module-checking-of-pushdown-multi-agent-systems-2003.04728</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/module-checking-of-pushdown-multi-agent-systems-2003.04728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/module-checking-of-pushdown-multi-agent-systems-2003.04728"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-2003.04730</loc><lastmod>2020-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-2003.04730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-logic-with-imperfect-information-2003.04730"/></url>
<url><loc>https://scifaro.com/en/abs/an-under-approximate-relational-logic-heralding-logics-of-insecurity-incorrect-implementation-more-2003.04791</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-under-approximate-relational-logic-heralding-logics-of-insecurity-incorrect-implementation-more-2003.04791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-under-approximate-relational-logic-heralding-logics-of-insecurity-incorrect-implementation-more-2003.04791"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-sets-with-atoms-definability-in-first-order-logic-2003.04803</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-sets-with-atoms-definability-in-first-order-logic-2003.04803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-sets-with-atoms-definability-in-first-order-logic-2003.04803"/></url>
<url><loc>https://scifaro.com/en/abs/interval-temporal-logic-decision-tree-learning-2003.04952</loc><lastmod>2020-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interval-temporal-logic-decision-tree-learning-2003.04952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interval-temporal-logic-decision-tree-learning-2003.04952"/></url>
<url><loc>https://scifaro.com/en/abs/animated-logic-correct-functional-conversion-to-conjunctive-normal-form-2003.05081</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/animated-logic-correct-functional-conversion-to-conjunctive-normal-form-2003.05081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/animated-logic-correct-functional-conversion-to-conjunctive-normal-form-2003.05081"/></url>
<url><loc>https://scifaro.com/en/abs/the-sequent-calculus-of-skew-monoidal-categories-2003.05213</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sequent-calculus-of-skew-monoidal-categories-2003.05213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sequent-calculus-of-skew-monoidal-categories-2003.05213"/></url>
<url><loc>https://scifaro.com/en/abs/local-local-reasoning-a-bi-hyperdoctrine-for-full-ground-store-2003.05386</loc><lastmod>2020-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-local-reasoning-a-bi-hyperdoctrine-for-full-ground-store-2003.05386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-local-reasoning-a-bi-hyperdoctrine-for-full-ground-store-2003.05386"/></url>
<url><loc>https://scifaro.com/en/abs/querying-and-repairing-inconsistent-prioritized-knowledge-bases-complexity-analysis-and-links-with-abstract-argumentation-2003.05746</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-and-repairing-inconsistent-prioritized-knowledge-bases-complexity-analysis-and-links-with-abstract-argumentation-2003.05746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-and-repairing-inconsistent-prioritized-knowledge-bases-complexity-analysis-and-links-with-abstract-argumentation-2003.05746"/></url>
<url><loc>https://scifaro.com/en/abs/on-monotonic-determinacy-and-rewritability-for-recursive-queries-and-views-2003.05898</loc><lastmod>2020-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-monotonic-determinacy-and-rewritability-for-recursive-queries-and-views-2003.05898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-monotonic-determinacy-and-rewritability-for-recursive-queries-and-views-2003.05898"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-is-tower-complete-2003.06077</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-is-tower-complete-2003.06077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-is-tower-complete-2003.06077"/></url>
<url><loc>https://scifaro.com/en/abs/experimental-evaluation-of-a-method-to-simplify-expressions-2003.06203</loc><lastmod>2020-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experimental-evaluation-of-a-method-to-simplify-expressions-2003.06203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experimental-evaluation-of-a-method-to-simplify-expressions-2003.06203"/></url>
<url><loc>https://scifaro.com/en/abs/comb-diagrams-for-discrete-time-feedback-2003.06214</loc><lastmod>2020-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comb-diagrams-for-discrete-time-feedback-2003.06214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comb-diagrams-for-discrete-time-feedback-2003.06214"/></url>
<url><loc>https://scifaro.com/en/abs/causal-unfoldings-and-disjunctive-causes-2003.06267</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-unfoldings-and-disjunctive-causes-2003.06267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-unfoldings-and-disjunctive-causes-2003.06267"/></url>
<url><loc>https://scifaro.com/en/abs/qed-at-large-a-survey-of-engineering-of-formally-verified-software-2003.06458</loc><lastmod>2020-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qed-at-large-a-survey-of-engineering-of-formally-verified-software-2003.06458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qed-at-large-a-survey-of-engineering-of-formally-verified-software-2003.06458"/></url>
<url><loc>https://scifaro.com/en/abs/patch-graph-rewriting-extended-version-2003.06488</loc><lastmod>2020-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patch-graph-rewriting-extended-version-2003.06488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patch-graph-rewriting-extended-version-2003.06488"/></url>
<url><loc>https://scifaro.com/en/abs/counting-bounded-tree-depth-homomorphisms-2003.08164</loc><lastmod>2020-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-bounded-tree-depth-homomorphisms-2003.08164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-bounded-tree-depth-homomorphisms-2003.08164"/></url>
<url><loc>https://scifaro.com/en/abs/axiom-pinpointing-2003.08298</loc><lastmod>2020-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiom-pinpointing-2003.08298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiom-pinpointing-2003.08298"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-up-to-techniques-and-games-for-systems-of-fixpoint-equations-2003.08877</loc><lastmod>2021-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-up-to-techniques-and-games-for-systems-of-fixpoint-equations-2003.08877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-up-to-techniques-and-games-for-systems-of-fixpoint-equations-2003.08877"/></url>
<url><loc>https://scifaro.com/en/abs/mcc-a-tool-for-unfolding-colored-petri-nets-in-pnml-format-2003.09134</loc><lastmod>2020-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcc-a-tool-for-unfolding-colored-petri-nets-in-pnml-format-2003.09134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcc-a-tool-for-unfolding-colored-petri-nets-in-pnml-format-2003.09134"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-functional-decision-diagrams-a-functional-semantics-for-binary-decision-diagrams-2003.09340</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-functional-decision-diagrams-a-functional-semantics-for-binary-decision-diagrams-2003.09340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-functional-decision-diagrams-a-functional-semantics-for-binary-decision-diagrams-2003.09340"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-2003.09395</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-2003.09395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-2003.09395"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-bicategories-with-choice-2003.09453</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-bicategories-with-choice-2003.09453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-bicategories-with-choice-2003.09453"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-conjunctive-query-answering-in-the-extended-dl-lite-family-2003.09508</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-conjunctive-query-answering-in-the-extended-dl-lite-family-2003.09508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-conjunctive-query-answering-in-the-extended-dl-lite-family-2003.09508"/></url>
<url><loc>https://scifaro.com/en/abs/partial-quantifier-elimination-by-certificate-clauses-2003.09667</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-quantifier-elimination-by-certificate-clauses-2003.09667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-quantifier-elimination-by-certificate-clauses-2003.09667"/></url>
<url><loc>https://scifaro.com/en/abs/a-trustful-monad-for-axiomatic-reasoning-with-probability-and-nondeterminism-2003.09993</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-trustful-monad-for-axiomatic-reasoning-with-probability-and-nondeterminism-2003.09993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-trustful-monad-for-axiomatic-reasoning-with-probability-and-nondeterminism-2003.09993"/></url>
<url><loc>https://scifaro.com/en/abs/a-csp-implementation-of-the-directed-bigraph-embedding-problem-2003.10209</loc><lastmod>2020-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-csp-implementation-of-the-directed-bigraph-embedding-problem-2003.10209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-csp-implementation-of-the-directed-bigraph-embedding-problem-2003.10209"/></url>
<url><loc>https://scifaro.com/en/abs/computer-assisted-verification-of-four-interval-arithmetic-operators-2003.10623</loc><lastmod>2020-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computer-assisted-verification-of-four-interval-arithmetic-operators-2003.10623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computer-assisted-verification-of-four-interval-arithmetic-operators-2003.10623"/></url>
<url><loc>https://scifaro.com/en/abs/deep-weisfeiler-leman-2003.10935</loc><lastmod>2020-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deep-weisfeiler-leman-2003.10935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deep-weisfeiler-leman-2003.10935"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-computation-of-graph-overlaps-for-rule-composition-theory-and-z3-prototyping-2003.11010</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-computation-of-graph-overlaps-for-rule-composition-theory-and-z3-prototyping-2003.11010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-computation-of-graph-overlaps-for-rule-composition-theory-and-z3-prototyping-2003.11010"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-sql-with-nulls-2003.11331</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-sql-with-nulls-2003.11331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-sql-with-nulls-2003.11331"/></url>
<url><loc>https://scifaro.com/en/abs/benchmarking-software-model-checkers-on-automotive-code-2003.11689</loc><lastmod>2020-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmarking-software-model-checkers-on-automotive-code-2003.11689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmarking-software-model-checkers-on-automotive-code-2003.11689"/></url>
<url><loc>https://scifaro.com/en/abs/no-go-theorems-for-distributive-laws-2003.12531</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-go-theorems-for-distributive-laws-2003.12531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-go-theorems-for-distributive-laws-2003.12531"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-reason-with-inconsistent-probabilistic-information-2003.12906</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-reason-with-inconsistent-probabilistic-information-2003.12906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-reason-with-inconsistent-probabilistic-information-2003.12906"/></url>
<url><loc>https://scifaro.com/en/abs/on-amenability-of-constraint-satisfaction-problems-2003.13108</loc><lastmod>2020-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-amenability-of-constraint-satisfaction-problems-2003.13108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-amenability-of-constraint-satisfaction-problems-2003.13108"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-as-a-logical-relation-2003.13542</loc><lastmod>2022-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-as-a-logical-relation-2003.13542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-as-a-logical-relation-2003.13542"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-weisfeiler-leman-dimension-of-finite-groups-2003.13745</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-weisfeiler-leman-dimension-of-finite-groups-2003.13745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-weisfeiler-leman-dimension-of-finite-groups-2003.13745"/></url>
<url><loc>https://scifaro.com/en/abs/vc-density-of-set-systems-defnable-in-tree-like-graphs-2003.14177</loc><lastmod>2020-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vc-density-of-set-systems-defnable-in-tree-like-graphs-2003.14177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vc-density-of-set-systems-defnable-in-tree-like-graphs-2003.14177"/></url>
<url><loc>https://scifaro.com/en/abs/utxo-vs-account-based-smart-contract-blockchain-programming-paradigms-2003.14271</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/utxo-vs-account-based-smart-contract-blockchain-programming-paradigms-2003.14271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/utxo-vs-account-based-smart-contract-blockchain-programming-paradigms-2003.14271"/></url>
<url><loc>https://scifaro.com/en/abs/fusible-numbers-and-peano-arithmetic-2003.14342</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fusible-numbers-and-peano-arithmetic-2003.14342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fusible-numbers-and-peano-arithmetic-2003.14342"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-hybrid-xpath-with-data-2004.00124</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-hybrid-xpath-with-data-2004.00124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-hybrid-xpath-with-data-2004.00124"/></url>
<url><loc>https://scifaro.com/en/abs/session-type-systems-based-on-linear-logic-classical-versus-intuitionistic-2004.01320</loc><lastmod>2020-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-type-systems-based-on-linear-logic-classical-versus-intuitionistic-2004.01320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-type-systems-based-on-linear-logic-classical-versus-intuitionistic-2004.01320"/></url>
<url><loc>https://scifaro.com/en/abs/omission-based-abstraction-for-answer-set-programs-2004.01410</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omission-based-abstraction-for-answer-set-programs-2004.01410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omission-based-abstraction-for-answer-set-programs-2004.01410"/></url>
<url><loc>https://scifaro.com/en/abs/ticking-clocks-as-dependent-right-adjoints-denotational-semantics-for-clocked-type-theory-2004.01709</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ticking-clocks-as-dependent-right-adjoints-denotational-semantics-for-clocked-type-theory-2004.01709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ticking-clocks-as-dependent-right-adjoints-denotational-semantics-for-clocked-type-theory-2004.01709"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-constraints-and-metaconstraints-with-temporal-logics-on-finite-traces-2004.01859</loc><lastmod>2020-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-constraints-and-metaconstraints-with-temporal-logics-on-finite-traces-2004.01859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-constraints-and-metaconstraints-with-temporal-logics-on-finite-traces-2004.01859"/></url>
<url><loc>https://scifaro.com/en/abs/simpler-completeness-proofs-for-modal-logics-with-intersection-2004.02120</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simpler-completeness-proofs-for-modal-logics-with-intersection-2004.02120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simpler-completeness-proofs-for-modal-logics-with-intersection-2004.02120"/></url>
<url><loc>https://scifaro.com/en/abs/clique-width-of-point-configurations-2004.02282</loc><lastmod>2020-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clique-width-of-point-configurations-2004.02282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clique-width-of-point-configurations-2004.02282"/></url>
<url><loc>https://scifaro.com/en/abs/the-mathematical-syntax-of-architectures-2004.03719</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mathematical-syntax-of-architectures-2004.03719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mathematical-syntax-of-architectures-2004.03719"/></url>
<url><loc>https://scifaro.com/en/abs/densities-of-almost-surely-terminating-probabilistic-programs-are-differentiable-almost-everywhere-2004.03924</loc><lastmod>2021-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/densities-of-almost-surely-terminating-probabilistic-programs-are-differentiable-almost-everywhere-2004.03924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/densities-of-almost-surely-terminating-probabilistic-programs-are-differentiable-almost-everywhere-2004.03924"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-runtime-verification-of-finite-state-properties-over-lossy-event-streams-2004.04214</loc><lastmod>2020-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-runtime-verification-of-finite-state-properties-over-lossy-event-streams-2004.04214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-runtime-verification-of-finite-state-properties-over-lossy-event-streams-2004.04214"/></url>
<url><loc>https://scifaro.com/en/abs/politeness-for-the-theory-of-algebraic-datatypes-2004.04854</loc><lastmod>2020-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/politeness-for-the-theory-of-algebraic-datatypes-2004.04854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/politeness-for-the-theory-of-algebraic-datatypes-2004.04854"/></url>
<url><loc>https://scifaro.com/en/abs/the-zx-calculus-a-complete-graphical-calculus-for-classical-circuits-using-spiders-2004.05287</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-zx-calculus-a-complete-graphical-calculus-for-classical-circuits-using-spiders-2004.05287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-zx-calculus-a-complete-graphical-calculus-for-classical-circuits-using-spiders-2004.05287"/></url>
<url><loc>https://scifaro.com/en/abs/computing-with-continuous-objects-a-uniform-co-inductive-approach-2004.05392</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-with-continuous-objects-a-uniform-co-inductive-approach-2004.05392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-with-continuous-objects-a-uniform-co-inductive-approach-2004.05392"/></url>
<url><loc>https://scifaro.com/en/abs/steps-and-traces-2004.05400</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steps-and-traces-2004.05400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steps-and-traces-2004.05400"/></url>
<url><loc>https://scifaro.com/en/abs/the-topological-and-logical-structure-of-concurrency-and-dependency-via-distributive-lattices-2004.05688</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topological-and-logical-structure-of-concurrency-and-dependency-via-distributive-lattices-2004.05688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topological-and-logical-structure-of-concurrency-and-dependency-via-distributive-lattices-2004.05688"/></url>
<url><loc>https://scifaro.com/en/abs/to-be-announced-2004.05802</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/to-be-announced-2004.05802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/to-be-announced-2004.05802"/></url>
<url><loc>https://scifaro.com/en/abs/generation-of-a-complete-set-of-properties-2004.05853</loc><lastmod>2020-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generation-of-a-complete-set-of-properties-2004.05853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generation-of-a-complete-set-of-properties-2004.05853"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-preservation-lattices-and-recognizability-2004.05943</loc><lastmod>2020-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-preservation-lattices-and-recognizability-2004.05943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-preservation-lattices-and-recognizability-2004.05943"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-methods-on-probabilistic-control-flow-programs-for-reliability-analysis-2004.06637</loc><lastmod>2020-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-methods-on-probabilistic-control-flow-programs-for-reliability-analysis-2004.06637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-methods-on-probabilistic-control-flow-programs-for-reliability-analysis-2004.06637"/></url>
<url><loc>https://scifaro.com/en/abs/prolog-technology-reinforcement-learning-prover-2004.06997</loc><lastmod>2020-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prolog-technology-reinforcement-learning-prover-2004.06997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prolog-technology-reinforcement-learning-prover-2004.06997"/></url>
<url><loc>https://scifaro.com/en/abs/computing-tropical-prevarieties-with-satisfiability-modulo-theories-smt-solvers-2004.07058</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-tropical-prevarieties-with-satisfiability-modulo-theories-smt-solvers-2004.07058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-tropical-prevarieties-with-satisfiability-modulo-theories-smt-solvers-2004.07058"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-rewritability-of-ontology-mediated-queries-in-linear-temporal-logic-2004.07221</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-rewritability-of-ontology-mediated-queries-in-linear-temporal-logic-2004.07221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-rewritability-of-ontology-mediated-queries-in-linear-temporal-logic-2004.07221"/></url>
<url><loc>https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-a-constructive-approach-to-finite-model-theory-2004.07390</loc><lastmod>2020-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-a-constructive-approach-to-finite-model-theory-2004.07390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-a-constructive-approach-to-finite-model-theory-2004.07390"/></url>
<url><loc>https://scifaro.com/en/abs/on-reductions-of-hintikka-sets-for-higher-order-logic-2004.07506</loc><lastmod>2021-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reductions-of-hintikka-sets-for-higher-order-logic-2004.07506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reductions-of-hintikka-sets-for-higher-order-logic-2004.07506"/></url>
<url><loc>https://scifaro.com/en/abs/entailment-checking-in-separation-logic-with-inductive-definitions-is-2-exptime-hard-2004.07578</loc><lastmod>2020-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entailment-checking-in-separation-logic-with-inductive-definitions-is-2-exptime-hard-2004.07578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entailment-checking-in-separation-logic-with-inductive-definitions-is-2-exptime-hard-2004.07578"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-unification-types-of-the-modal-logics-determined-by-classes-of-deterministic-frames-2004.07904</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-unification-types-of-the-modal-logics-determined-by-classes-of-deterministic-frames-2004.07904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-unification-types-of-the-modal-logics-determined-by-classes-of-deterministic-frames-2004.07904"/></url>
<url><loc>https://scifaro.com/en/abs/solving-bitvectors-with-mcsat-explanations-from-bits-and-pieces-long-version-2004.07940</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-bitvectors-with-mcsat-explanations-from-bits-and-pieces-long-version-2004.07940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-bitvectors-with-mcsat-explanations-from-bits-and-pieces-long-version-2004.07940"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-logic-for-verifying-continuous-time-markov-chains-2004.08059</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-logic-for-verifying-continuous-time-markov-chains-2004.08059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-logic-for-verifying-continuous-time-markov-chains-2004.08059"/></url>
<url><loc>https://scifaro.com/en/abs/intention-as-commitment-toward-time-2004.08144</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intention-as-commitment-toward-time-2004.08144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intention-as-commitment-toward-time-2004.08144"/></url>
<url><loc>https://scifaro.com/en/abs/stateful-premise-selection-by-recurrent-neural-networks-2004.08212</loc><lastmod>2020-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateful-premise-selection-by-recurrent-neural-networks-2004.08212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateful-premise-selection-by-recurrent-neural-networks-2004.08212"/></url>
<url><loc>https://scifaro.com/en/abs/translating-workflow-nets-to-process-trees-an-algorithmic-approach-2004.08213</loc><lastmod>2020-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-workflow-nets-to-process-trees-an-algorithmic-approach-2004.08213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-workflow-nets-to-process-trees-an-algorithmic-approach-2004.08213"/></url>
<url><loc>https://scifaro.com/en/abs/finding-small-proofs-for-description-logic-entailments-theory-and-practice-extended-technical-report-2004.08311</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-small-proofs-for-description-logic-entailments-theory-and-practice-extended-technical-report-2004.08311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-small-proofs-for-description-logic-entailments-theory-and-practice-extended-technical-report-2004.08311"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-nominal-props-2004.08380</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-nominal-props-2004.08380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-nominal-props-2004.08380"/></url>
<url><loc>https://scifaro.com/en/abs/parallelization-techniques-for-verifying-neural-networks-2004.08440</loc><lastmod>2020-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallelization-techniques-for-verifying-neural-networks-2004.08440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallelization-techniques-for-verifying-neural-networks-2004.08440"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-and-liveness-in-parametric-timed-automata-2004.09171</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-and-liveness-in-parametric-timed-automata-2004.09171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-and-liveness-in-parametric-timed-automata-2004.09171"/></url>
<url><loc>https://scifaro.com/en/abs/admissibly-represented-spaces-and-qcb-spaces-2004.09450</loc><lastmod>2020-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/admissibly-represented-spaces-and-qcb-spaces-2004.09450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/admissibly-represented-spaces-and-qcb-spaces-2004.09450"/></url>
<url><loc>https://scifaro.com/en/abs/on-verifying-designs-with-incomplete-specification-2004.09503</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-verifying-designs-with-incomplete-specification-2004.09503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-verifying-designs-with-incomplete-specification-2004.09503"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-consensus-in-the-heard-of-model-2004.09621</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-consensus-in-the-heard-of-model-2004.09621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-consensus-in-the-heard-of-model-2004.09621"/></url>
<url><loc>https://scifaro.com/en/abs/betweenness-of-partial-orders-2004.09777</loc><lastmod>2020-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/betweenness-of-partial-orders-2004.09777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/betweenness-of-partial-orders-2004.09777"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-betweenness-in-order-theoretic-trees-2004.10127</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-betweenness-in-order-theoretic-trees-2004.10127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-betweenness-in-order-theoretic-trees-2004.10127"/></url>
<url><loc>https://scifaro.com/en/abs/the-imandra-automated-reasoning-system-system-description-2004.10263</loc><lastmod>2020-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-imandra-automated-reasoning-system-system-description-2004.10263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-imandra-automated-reasoning-system-system-description-2004.10263"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-trace-encodings-of-bounded-synthesis-for-asynchronous-distributed-systems-2004.10413</loc><lastmod>2020-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-trace-encodings-of-bounded-synthesis-for-asynchronous-distributed-systems-2004.10413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-trace-encodings-of-bounded-synthesis-for-asynchronous-distributed-systems-2004.10413"/></url>
<url><loc>https://scifaro.com/en/abs/hidden-variables-simulating-quantum-contextuality-increasingly-violate-the-holevo-bound-2004.10654</loc><lastmod>2020-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hidden-variables-simulating-quantum-contextuality-increasingly-violate-the-holevo-bound-2004.10654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hidden-variables-simulating-quantum-contextuality-increasingly-violate-the-holevo-bound-2004.10654"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-flow-equivalence-in-desynchronized-designs-2004.10655</loc><lastmod>2020-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-flow-equivalence-in-desynchronized-designs-2004.10655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-flow-equivalence-in-desynchronized-designs-2004.10655"/></url>
<url><loc>https://scifaro.com/en/abs/exponentially-huge-natural-deduction-proofs-are-redundant-preliminary-results-on-m-supset-2004.10659</loc><lastmod>2020-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponentially-huge-natural-deduction-proofs-are-redundant-preliminary-results-on-m-supset-2004.10659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponentially-huge-natural-deduction-proofs-are-redundant-preliminary-results-on-m-supset-2004.10659"/></url>
<url><loc>https://scifaro.com/en/abs/simple-dataset-for-proof-method-recommendation-in-isabelle-hol-dataset-description-2004.10667</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-dataset-for-proof-method-recommendation-in-isabelle-hol-dataset-description-2004.10667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-dataset-for-proof-method-recommendation-in-isabelle-hol-dataset-description-2004.10667"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-of-riesz-spaces-and-modal-riesz-spaces-2004.11185</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-of-riesz-spaces-and-modal-riesz-spaces-2004.11185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-of-riesz-spaces-and-modal-riesz-spaces-2004.11185"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-proof-complexity-of-logics-of-bounded-branching-2004.11282</loc><lastmod>2022-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-proof-complexity-of-logics-of-bounded-branching-2004.11282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-proof-complexity-of-logics-of-bounded-branching-2004.11282"/></url>
<url><loc>https://scifaro.com/en/abs/on-skolem-hardness-and-saturation-points-in-markov-decision-processes-2004.11441</loc><lastmod>2020-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-skolem-hardness-and-saturation-points-in-markov-decision-processes-2004.11441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-skolem-hardness-and-saturation-points-in-markov-decision-processes-2004.11441"/></url>
<url><loc>https://scifaro.com/en/abs/invariants-for-continuous-linear-dynamical-systems-2004.11661</loc><lastmod>2020-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariants-for-continuous-linear-dynamical-systems-2004.11661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariants-for-continuous-linear-dynamical-systems-2004.11661"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-bisimilarity-for-reactive-systems-2004.11792</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-bisimilarity-for-reactive-systems-2004.11792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-bisimilarity-for-reactive-systems-2004.11792"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-approach-to-directed-rough-sets-2004.12171</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-approach-to-directed-rough-sets-2004.12171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-approach-to-directed-rough-sets-2004.12171"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-decomposition-in-integer-linear-arithmetic-technical-report-2004.12371</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-decomposition-in-integer-linear-arithmetic-technical-report-2004.12371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-decomposition-in-integer-linear-arithmetic-technical-report-2004.12371"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-4th-workshop-on-models-for-formal-analysis-of-real-systems-2004.12403</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-4th-workshop-on-models-for-formal-analysis-of-real-systems-2004.12403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-4th-workshop-on-models-for-formal-analysis-of-real-systems-2004.12403"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-linear-temporal-logic-with-team-semantics-2004.12682</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-linear-temporal-logic-with-team-semantics-2004.12682"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-linear-temporal-logic-with-team-semantics-2004.12682"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-floating-point-bit-blasting-api-for-verifying-c-programs-2004.12699</loc><lastmod>2020-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-floating-point-bit-blasting-api-for-verifying-c-programs-2004.12699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-floating-point-bit-blasting-api-for-verifying-c-programs-2004.12699"/></url>
<url><loc>https://scifaro.com/en/abs/formal-adventures-in-convex-and-conical-spaces-2004.12713</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-adventures-in-convex-and-conical-spaces-2004.12713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-adventures-in-convex-and-conical-spaces-2004.12713"/></url>
<url><loc>https://scifaro.com/en/abs/an-epistemic-approach-to-the-formal-specification-of-statistical-machine-learning-2004.12734</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-epistemic-approach-to-the-formal-specification-of-statistical-machine-learning-2004.12734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-epistemic-approach-to-the-formal-specification-of-statistical-machine-learning-2004.12734"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-of-reachability-how-many-changes-can-we-handle-2004.12739</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-of-reachability-how-many-changes-can-we-handle-2004.12739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-of-reachability-how-many-changes-can-we-handle-2004.12739"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-proof-system-for-1-free-regular-expressions-modulo-bisimilarity-2004.12740</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-proof-system-for-1-free-regular-expressions-modulo-bisimilarity-2004.12740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-proof-system-for-1-free-regular-expressions-modulo-bisimilarity-2004.12740"/></url>
<url><loc>https://scifaro.com/en/abs/the-benefit-of-being-non-lazy-in-probabilistic-lambda-calculus-2004.12891</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-benefit-of-being-non-lazy-in-probabilistic-lambda-calculus-2004.12891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-benefit-of-being-non-lazy-in-probabilistic-lambda-calculus-2004.12891"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-formulas-as-cographs-an-extension-of-boolean-logic-to-arbitrary-graphs-2004.12941</loc><lastmod>2020-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-formulas-as-cographs-an-extension-of-boolean-logic-to-arbitrary-graphs-2004.12941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-formulas-as-cographs-an-extension-of-boolean-logic-to-arbitrary-graphs-2004.12941"/></url>
<url><loc>https://scifaro.com/en/abs/iterative-variable-reordering-taming-huge-system-families-2004.13287</loc><lastmod>2020-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterative-variable-reordering-taming-huge-system-families-2004.13287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterative-variable-reordering-taming-huge-system-families-2004.13287"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-an-asynchronous-circuit-dedicated-to-the-protection-against-physical-attacks-2004.13289</loc><lastmod>2020-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-an-asynchronous-circuit-dedicated-to-the-protection-against-physical-attacks-2004.13289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-an-asynchronous-circuit-dedicated-to-the-protection-against-physical-attacks-2004.13289"/></url>
<url><loc>https://scifaro.com/en/abs/mixing-probabilistic-and-non-probabilistic-objectives-in-markov-decision-processes-2004.13789</loc><lastmod>2020-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixing-probabilistic-and-non-probabilistic-objectives-in-markov-decision-processes-2004.13789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixing-probabilistic-and-non-probabilistic-objectives-in-markov-decision-processes-2004.13789"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-homotopy-type-theory-with-an-interval-type-2004.14195</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-homotopy-type-theory-with-an-interval-type-2004.14195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-homotopy-type-theory-with-an-interval-type-2004.14195"/></url>
<url><loc>https://scifaro.com/en/abs/towards-faster-reasoners-by-using-transparent-huge-pages-2004.14378</loc><lastmod>2020-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-faster-reasoners-by-using-transparent-huge-pages-2004.14378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-faster-reasoners-by-using-transparent-huge-pages-2004.14378"/></url>
<url><loc>https://scifaro.com/en/abs/an-axiomatic-approach-to-existence-and-liveness-for-differential-equations-2004.14561</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-axiomatic-approach-to-existence-and-liveness-for-differential-equations-2004.14561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-axiomatic-approach-to-existence-and-liveness-for-differential-equations-2004.14561"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-16th-international-conference-on-quantum-physics-and-logic-2004.14750</loc><lastmod>2020-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-16th-international-conference-on-quantum-physics-and-logic-2004.14750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-16th-international-conference-on-quantum-physics-and-logic-2004.14750"/></url>
<url><loc>https://scifaro.com/en/abs/pric3-property-directed-reachability-for-mdps-2004.14835</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pric3-property-directed-reachability-for-mdps-2004.14835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pric3-property-directed-reachability-for-mdps-2004.14835"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-dynamic-data-race-prediction-2004.14931</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-dynamic-data-race-prediction-2004.14931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-dynamic-data-race-prediction-2004.14931"/></url>
<url><loc>https://scifaro.com/en/abs/from-equations-to-distinctions-two-interpretations-of-effectful-computations-2005.00196</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-equations-to-distinctions-two-interpretations-of-effectful-computations-2005.00196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-equations-to-distinctions-two-interpretations-of-effectful-computations-2005.00196"/></url>
<url><loc>https://scifaro.com/en/abs/combining-predicate-transformer-semantics-for-effects-a-case-study-in-parsing-regular-languages-2005.00197</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-predicate-transformer-semantics-for-effects-a-case-study-in-parsing-regular-languages-2005.00197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-predicate-transformer-semantics-for-effects-a-case-study-in-parsing-regular-languages-2005.00197"/></url>
<url><loc>https://scifaro.com/en/abs/why-fhilb-is-not-an-interesting-co-differential-category-2005.00208</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/why-fhilb-is-not-an-interesting-co-differential-category-2005.00208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/why-fhilb-is-not-an-interesting-co-differential-category-2005.00208"/></url>
<url><loc>https://scifaro.com/en/abs/effectus-of-quantum-probability-on-relational-structures-2005.00209</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectus-of-quantum-probability-on-relational-structures-2005.00209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectus-of-quantum-probability-on-relational-structures-2005.00209"/></url>
<url><loc>https://scifaro.com/en/abs/scott-continuity-in-generalized-probabilistic-theories-2005.00210</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scott-continuity-in-generalized-probabilistic-theories-2005.00210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scott-continuity-in-generalized-probabilistic-theories-2005.00210"/></url>
<url><loc>https://scifaro.com/en/abs/partial-univalence-in-n-truncated-type-theory-2005.00260</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-univalence-in-n-truncated-type-theory-2005.00260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-univalence-in-n-truncated-type-theory-2005.00260"/></url>
<url><loc>https://scifaro.com/en/abs/sensitive-instances-of-the-constraint-satisfaction-problem-2005.00266</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sensitive-instances-of-the-constraint-satisfaction-problem-2005.00266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sensitive-instances-of-the-constraint-satisfaction-problem-2005.00266"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-normalisation-procedure-for-linear-temporal-logic-and-very-weak-alternating-automata-2005.00472</loc><lastmod>2020-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-normalisation-procedure-for-linear-temporal-logic-and-very-weak-alternating-automata-2005.00472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-normalisation-procedure-for-linear-temporal-logic-and-very-weak-alternating-automata-2005.00472"/></url>
<url><loc>https://scifaro.com/en/abs/energy-mu-calculus-symbolic-fixed-point-algorithms-for-omega-regular-energy-games-2005.00641</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/energy-mu-calculus-symbolic-fixed-point-algorithms-for-omega-regular-energy-games-2005.00641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/energy-mu-calculus-symbolic-fixed-point-algorithms-for-omega-regular-energy-games-2005.00641"/></url>
<url><loc>https://scifaro.com/en/abs/on-infinite-guarded-recursive-specifications-in-process-algebra-2005.00746</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-infinite-guarded-recursive-specifications-in-process-algebra-2005.00746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-infinite-guarded-recursive-specifications-in-process-algebra-2005.00746"/></url>
<url><loc>https://scifaro.com/en/abs/regular-model-checking-revisited-technical-report-2005.00990</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-model-checking-revisited-technical-report-2005.00990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-model-checking-revisited-technical-report-2005.00990"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-parameter-synthesis-for-one-counter-automata-2005.01071</loc><lastmod>2021-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-parameter-synthesis-for-one-counter-automata-2005.01071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-parameter-synthesis-for-one-counter-automata-2005.01071"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-and-monotone-machines-2005.01624</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-and-monotone-machines-2005.01624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-and-monotone-machines-2005.01624"/></url>
<url><loc>https://scifaro.com/en/abs/presenting-convex-sets-of-probability-distributions-by-convex-semilattices-and-unique-bases-2005.01670</loc><lastmod>2020-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presenting-convex-sets-of-probability-distributions-by-convex-semilattices-and-unique-bases-2005.01670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presenting-convex-sets-of-probability-distributions-by-convex-semilattices-and-unique-bases-2005.01670"/></url>
<url><loc>https://scifaro.com/en/abs/factorize-factorization-2005.01808</loc><lastmod>2020-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factorize-factorization-2005.01808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factorize-factorization-2005.01808"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-linear-constraints-into-sat-2005.02073</loc><lastmod>2020-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-linear-constraints-into-sat-2005.02073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-linear-constraints-into-sat-2005.02073"/></url>
<url><loc>https://scifaro.com/en/abs/superposition-for-lambda-free-higher-order-logic-2005.02094</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superposition-for-lambda-free-higher-order-logic-2005.02094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superposition-for-lambda-free-higher-order-logic-2005.02094"/></url>
<url><loc>https://scifaro.com/en/abs/falsification-of-cyber-physical-systems-with-robustness-guided-black-box-checking-2005.02126</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/falsification-of-cyber-physical-systems-with-robustness-guided-black-box-checking-2005.02126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/falsification-of-cyber-physical-systems-with-robustness-guided-black-box-checking-2005.02126"/></url>
<url><loc>https://scifaro.com/en/abs/compositionality-of-the-mso-u-logic-2005.02384</loc><lastmod>2020-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositionality-of-the-mso-u-logic-2005.02384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositionality-of-the-mso-u-logic-2005.02384"/></url>
<url><loc>https://scifaro.com/en/abs/towards-concise-machine-discovered-proofs-of-g-odel-s-two-incompleteness-theorems-2005.02576</loc><lastmod>2020-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-concise-machine-discovered-proofs-of-g-odel-s-two-incompleteness-theorems-2005.02576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-concise-machine-discovered-proofs-of-g-odel-s-two-incompleteness-theorems-2005.02576"/></url>
<url><loc>https://scifaro.com/en/abs/experiences-from-exporting-major-proof-assistant-libraries-2005.03089</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experiences-from-exporting-major-proof-assistant-libraries-2005.03089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experiences-from-exporting-major-proof-assistant-libraries-2005.03089"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-learnability-of-possibilistic-theories-2005.03157</loc><lastmod>2020-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-learnability-of-possibilistic-theories-2005.03157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-learnability-of-possibilistic-theories-2005.03157"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-hyperproperties-of-markov-decision-processes-2005.03362</loc><lastmod>2020-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-hyperproperties-of-markov-decision-processes-2005.03362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-hyperproperties-of-markov-decision-processes-2005.03362"/></url>
<url><loc>https://scifaro.com/en/abs/checking-qualitative-liveness-properties-of-replicated-systems-with-stochastic-scheduling-2005.03555</loc><lastmod>2020-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-qualitative-liveness-properties-of-replicated-systems-with-stochastic-scheduling-2005.03555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-qualitative-liveness-properties-of-replicated-systems-with-stochastic-scheduling-2005.03555"/></url>
<url><loc>https://scifaro.com/en/abs/geologic-graphical-interactive-theorem-prover-for-euclidean-geometry-2005.03586</loc><lastmod>2020-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geologic-graphical-interactive-theorem-prover-for-euclidean-geometry-2005.03586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geologic-graphical-interactive-theorem-prover-for-euclidean-geometry-2005.03586"/></url>
<url><loc>https://scifaro.com/en/abs/the-zhou-ordinal-of-labelled-markov-processes-over-separable-spaces-2005.03630</loc><lastmod>2022-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-zhou-ordinal-of-labelled-markov-processes-over-separable-spaces-2005.03630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-zhou-ordinal-of-labelled-markov-processes-over-separable-spaces-2005.03630"/></url>
<url><loc>https://scifaro.com/en/abs/the-ghosts-of-forgotten-things-a-study-on-size-after-forgetting-2005.04123</loc><lastmod>2022-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ghosts-of-forgotten-things-a-study-on-size-after-forgetting-2005.04123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ghosts-of-forgotten-things-a-study-on-size-after-forgetting-2005.04123"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relational-width-of-first-order-expansions-of-finitely-bounded-homogeneous-binary-cores-with-bounded-strict-width-2005.04145</loc><lastmod>2020-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relational-width-of-first-order-expansions-of-finitely-bounded-homogeneous-binary-cores-with-bounded-strict-width-2005.04145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relational-width-of-first-order-expansions-of-finitely-bounded-homogeneous-binary-cores-with-bounded-strict-width-2005.04145"/></url>
<url><loc>https://scifaro.com/en/abs/graph-consistency-as-a-graduated-property-consistency-sustaining-and-improving-graph-transformations-2005.04162</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-consistency-as-a-graduated-property-consistency-sustaining-and-improving-graph-transformations-2005.04162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-consistency-as-a-graduated-property-consistency-sustaining-and-improving-graph-transformations-2005.04162"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-separation-logic-meets-template-games-2005.04453</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-separation-logic-meets-template-games-2005.04453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-separation-logic-meets-template-games-2005.04453"/></url>
<url><loc>https://scifaro.com/en/abs/absolutely-no-free-lunches-2005.04791</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/absolutely-no-free-lunches-2005.04791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/absolutely-no-free-lunches-2005.04791"/></url>
<url><loc>https://scifaro.com/en/abs/designing-new-phase-selection-heuristics-2005.04850</loc><lastmod>2020-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/designing-new-phase-selection-heuristics-2005.04850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/designing-new-phase-selection-heuristics-2005.04850"/></url>
<url><loc>https://scifaro.com/en/abs/positional-games-and-qbf-a-polished-encoding-2005.05098</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positional-games-and-qbf-a-polished-encoding-2005.05098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positional-games-and-qbf-a-polished-encoding-2005.05098"/></url>
<url><loc>https://scifaro.com/en/abs/whole-grain-petri-nets-and-processes-2005.05108</loc><lastmod>2023-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/whole-grain-petri-nets-and-processes-2005.05108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/whole-grain-petri-nets-and-processes-2005.05108"/></url>
<url><loc>https://scifaro.com/en/abs/restricted-chase-termination-for-existential-rules-a-hierarchical-approach-and-experimentation-2005.05423</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restricted-chase-termination-for-existential-rules-a-hierarchical-approach-and-experimentation-2005.05423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restricted-chase-termination-for-existential-rules-a-hierarchical-approach-and-experimentation-2005.05423"/></url>
<url><loc>https://scifaro.com/en/abs/computational-adequacy-for-substructural-lambda-calculi-2005.05433</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-adequacy-for-substructural-lambda-calculi-2005.05433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-adequacy-for-substructural-lambda-calculi-2005.05433"/></url>
<url><loc>https://scifaro.com/en/abs/mathzero-the-classification-problem-and-set-theoretic-type-theory-2005.05512</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathzero-the-classification-problem-and-set-theoretic-type-theory-2005.05512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathzero-the-classification-problem-and-set-theoretic-type-theory-2005.05512"/></url>
<url><loc>https://scifaro.com/en/abs/towards-spatial-bisimilarity-for-closure-models-logical-and-coalgebraic-characterisations-2005.05578</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-spatial-bisimilarity-for-closure-models-logical-and-coalgebraic-characterisations-2005.05578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-spatial-bisimilarity-for-closure-models-logical-and-coalgebraic-characterisations-2005.05578"/></url>
<url><loc>https://scifaro.com/en/abs/featured-games-2005.05666</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/featured-games-2005.05666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/featured-games-2005.05666"/></url>
<url><loc>https://scifaro.com/en/abs/strategies-for-linear-rewriting-systems-link-with-parallel-rewriting-and-involutive-divisions-2005.05764</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategies-for-linear-rewriting-systems-link-with-parallel-rewriting-and-involutive-divisions-2005.05764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategies-for-linear-rewriting-systems-link-with-parallel-rewriting-and-involutive-divisions-2005.05764"/></url>
<url><loc>https://scifaro.com/en/abs/initial-conflicts-for-transformation-rules-with-nested-application-conditions-2005.05901</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-conflicts-for-transformation-rules-with-nested-application-conditions-2005.05901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-conflicts-for-transformation-rules-with-nested-application-conditions-2005.05901"/></url>
<url><loc>https://scifaro.com/en/abs/pi-with-leftovers-a-mechanisation-in-agda-2005.05902</loc><lastmod>2021-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pi-with-leftovers-a-mechanisation-in-agda-2005.05902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pi-with-leftovers-a-mechanisation-in-agda-2005.05902"/></url>
<url><loc>https://scifaro.com/en/abs/blockchain-superoptimizer-2005.05912</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/blockchain-superoptimizer-2005.05912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/blockchain-superoptimizer-2005.05912"/></url>
<url><loc>https://scifaro.com/en/abs/the-hierarchy-of-hyperlogics-2005.05934</loc><lastmod>2020-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-hierarchy-of-hyperlogics-2005.05934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-hierarchy-of-hyperlogics-2005.05934"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-hyperproperties-with-nondeterminism-2005.06115</loc><lastmod>2020-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-hyperproperties-with-nondeterminism-2005.06115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-hyperproperties-with-nondeterminism-2005.06115"/></url>
<url><loc>https://scifaro.com/en/abs/yet-another-comparison-of-sat-encodings-for-the-at-most-k-constraint-2005.06274</loc><lastmod>2020-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/yet-another-comparison-of-sat-encodings-for-the-at-most-k-constraint-2005.06274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/yet-another-comparison-of-sat-encodings-for-the-at-most-k-constraint-2005.06274"/></url>
<url><loc>https://scifaro.com/en/abs/some-model-theory-of-guarded-negation-2005.06299</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-model-theory-of-guarded-negation-2005.06299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-model-theory-of-guarded-negation-2005.06299"/></url>
<url><loc>https://scifaro.com/en/abs/bisimilarity-in-fresh-register-automata-2005.06411</loc><lastmod>2025-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimilarity-in-fresh-register-automata-2005.06411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimilarity-in-fresh-register-automata-2005.06411"/></url>
<url><loc>https://scifaro.com/en/abs/generating-collection-transformations-from-proofs-2005.06503</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-collection-transformations-from-proofs-2005.06503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-collection-transformations-from-proofs-2005.06503"/></url>
<url><loc>https://scifaro.com/en/abs/the-extended-theory-of-trees-and-algebraic-co-datatypes-2005.06659</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-extended-theory-of-trees-and-algebraic-co-datatypes-2005.06659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-extended-theory-of-trees-and-algebraic-co-datatypes-2005.06659"/></url>
<url><loc>https://scifaro.com/en/abs/automated-requirements-based-testing-of-black-box-reactive-systems-2005.06750</loc><lastmod>2020-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-requirements-based-testing-of-black-box-reactive-systems-2005.06750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-requirements-based-testing-of-black-box-reactive-systems-2005.06750"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-of-category-theory-in-agda-2005.07059</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-of-category-theory-in-agda-2005.07059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-of-category-theory-in-agda-2005.07059"/></url>
<url><loc>https://scifaro.com/en/abs/adammc-a-model-checker-for-petri-nets-with-transits-against-flow-ltl-full-version-2005.07130</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adammc-a-model-checker-for-petri-nets-with-transits-against-flow-ltl-full-version-2005.07130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adammc-a-model-checker-for-petri-nets-with-transits-against-flow-ltl-full-version-2005.07130"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-hyperliveness-2005.07425</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-hyperliveness-2005.07425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-hyperliveness-2005.07425"/></url>
<url><loc>https://scifaro.com/en/abs/monads-and-quantitative-equational-theories-for-nondeterminism-and-probability-2005.07509</loc><lastmod>2020-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monads-and-quantitative-equational-theories-for-nondeterminism-and-probability-2005.07509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monads-and-quantitative-equational-theories-for-nondeterminism-and-probability-2005.07509"/></url>
<url><loc>https://scifaro.com/en/abs/bouncing-threads-for-infinitary-and-circular-proofs-2005.08257</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bouncing-threads-for-infinitary-and-circular-proofs-2005.08257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bouncing-threads-for-infinitary-and-circular-proofs-2005.08257"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-semantics-for-stream-reasoning-2005.08384</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-semantics-for-stream-reasoning-2005.08384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-semantics-for-stream-reasoning-2005.08384"/></url>
<url><loc>https://scifaro.com/en/abs/making-isabelle-content-accessible-in-knowledge-representation-formats-2005.08884</loc><lastmod>2020-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-isabelle-content-accessible-in-knowledge-representation-formats-2005.08884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-isabelle-content-accessible-in-knowledge-representation-formats-2005.08884"/></url>
<url><loc>https://scifaro.com/en/abs/some-common-mistakes-in-the-teaching-and-textbooks-of-modal-logic-2005.10137</loc><lastmod>2020-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-common-mistakes-in-the-teaching-and-textbooks-of-modal-logic-2005.10137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-common-mistakes-in-the-teaching-and-textbooks-of-modal-logic-2005.10137"/></url>
<url><loc>https://scifaro.com/en/abs/internal-parametricity-for-cubical-type-theory-2005.11290</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-parametricity-for-cubical-type-theory-2005.11290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-parametricity-for-cubical-type-theory-2005.11290"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-offline-monitoring-of-linear-temporal-logic-with-bit-vectors-2005.11737</loc><lastmod>2020-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-offline-monitoring-of-linear-temporal-logic-with-bit-vectors-2005.11737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-offline-monitoring-of-linear-temporal-logic-with-bit-vectors-2005.11737"/></url>
<url><loc>https://scifaro.com/en/abs/rtamt-online-robustness-monitors-from-stl-2005.11827</loc><lastmod>2020-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rtamt-online-robustness-monitors-from-stl-2005.11827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rtamt-online-robustness-monitors-from-stl-2005.11827"/></url>
<url><loc>https://scifaro.com/en/abs/formal-methods-with-a-touch-of-magic-2005.12175</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-methods-with-a-touch-of-magic-2005.12175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-methods-with-a-touch-of-magic-2005.12175"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-the-ibos-browser-security-properties-in-reachability-logic-2005.12232</loc><lastmod>2020-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-the-ibos-browser-security-properties-in-reachability-logic-2005.12232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-the-ibos-browser-security-properties-in-reachability-logic-2005.12232"/></url>
<url><loc>https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-2005.12582</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-2005.12582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differentials-and-distances-in-probabilistic-coherence-spaces-2005.12582"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-languages-for-formalizing-mathematics-2005.12876</loc><lastmod>2020-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-languages-for-formalizing-mathematics-2005.12876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-languages-for-formalizing-mathematics-2005.12876"/></url>
<url><loc>https://scifaro.com/en/abs/global-guidance-for-local-generalization-in-model-checking-2005.13301</loc><lastmod>2020-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-guidance-for-local-generalization-in-model-checking-2005.13301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-guidance-for-local-generalization-in-model-checking-2005.13301"/></url>
<url><loc>https://scifaro.com/en/abs/cdcl-crypto-sat-solvers-for-cryptanalysis-2005.13415</loc><lastmod>2020-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cdcl-crypto-sat-solvers-for-cryptanalysis-2005.13415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cdcl-crypto-sat-solvers-for-cryptanalysis-2005.13415"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-findel-derivatives-for-blockchain-2005.13602</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-findel-derivatives-for-blockchain-2005.13602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-findel-derivatives-for-blockchain-2005.13602"/></url>
<url><loc>https://scifaro.com/en/abs/local-algebraic-effect-theories-2005.13654</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-algebraic-effect-theories-2005.13654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-algebraic-effect-theories-2005.13654"/></url>
<url><loc>https://scifaro.com/en/abs/no-go-theorems-for-data-privacy-2005.13811</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-go-theorems-for-data-privacy-2005.13811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-go-theorems-for-data-privacy-2005.13811"/></url>
<url><loc>https://scifaro.com/en/abs/adding-an-abstraction-barrier-to-zf-set-theory-2005.13954</loc><lastmod>2020-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-an-abstraction-barrier-to-zf-set-theory-2005.13954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-an-abstraction-barrier-to-zf-set-theory-2005.13954"/></url>
<url><loc>https://scifaro.com/en/abs/ecumenical-modal-logic-2005.14325</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ecumenical-modal-logic-2005.14325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ecumenical-modal-logic-2005.14325"/></url>
<url><loc>https://scifaro.com/en/abs/optimising-attractor-computation-in-boolean-automata-networks-2005.14531</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimising-attractor-computation-in-boolean-automata-networks-2005.14531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimising-attractor-computation-in-boolean-automata-networks-2005.14531"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-logic-is-complete-for-convexity-in-the-plane-2006.00604</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-logic-is-complete-for-convexity-in-the-plane-2006.00604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-logic-is-complete-for-convexity-in-the-plane-2006.00604"/></url>
<url><loc>https://scifaro.com/en/abs/balancing-expressiveness-and-inexpressiveness-in-view-design-2006.00875</loc><lastmod>2020-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/balancing-expressiveness-and-inexpressiveness-in-view-design-2006.00875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/balancing-expressiveness-and-inexpressiveness-in-view-design-2006.00875"/></url>
<url><loc>https://scifaro.com/en/abs/two-variable-logic-with-ultimately-periodic-counting-2006.01193</loc><lastmod>2024-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-variable-logic-with-ultimately-periodic-counting-2006.01193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-variable-logic-with-ultimately-periodic-counting-2006.01193"/></url>
<url><loc>https://scifaro.com/en/abs/bitwuzla-at-the-smt-comp-2020-2006.01621</loc><lastmod>2020-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bitwuzla-at-the-smt-comp-2020-2006.01621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bitwuzla-at-the-smt-comp-2020-2006.01621"/></url>
<url><loc>https://scifaro.com/en/abs/generating-random-logic-programs-using-constraint-programming-2006.01889</loc><lastmod>2020-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-random-logic-programs-using-constraint-programming-2006.01889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-random-logic-programs-using-constraint-programming-2006.01889"/></url>
<url><loc>https://scifaro.com/en/abs/analogical-proportions-2006.02854</loc><lastmod>2024-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analogical-proportions-2006.02854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analogical-proportions-2006.02854"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-regular-coinduction-2006.02887</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-regular-coinduction-2006.02887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-regular-coinduction-2006.02887"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-line-editors-in-coq-2006.03525</loc><lastmod>2020-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-line-editors-in-coq-2006.03525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-line-editors-in-coq-2006.03525"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-logic-query-checking-over-finite-data-streams-2006.03751</loc><lastmod>2020-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-logic-query-checking-over-finite-data-streams-2006.03751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-logic-query-checking-over-finite-data-streams-2006.03751"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-timed-automata-with-one-clock-and-initialised-clock-dependent-probabilities-2006.04202</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-timed-automata-with-one-clock-and-initialised-clock-dependent-probabilities-2006.04202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-timed-automata-with-one-clock-and-initialised-clock-dependent-probabilities-2006.04202"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-theorems-for-first-order-logic-analysed-in-constructive-type-theory-extended-version-2006.04399</loc><lastmod>2021-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-theorems-for-first-order-logic-analysed-in-constructive-type-theory-extended-version-2006.04399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-theorems-for-first-order-logic-analysed-in-constructive-type-theory-extended-version-2006.04399"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-and-model-checking-for-the-logic-of-sub-intervals-under-the-homogeneity-assumption-2006.04652</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-and-model-checking-for-the-logic-of-sub-intervals-under-the-homogeneity-assumption-2006.04652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-and-model-checking-for-the-logic-of-sub-intervals-under-the-homogeneity-assumption-2006.04652"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-count-up-to-symmetry-2006.05080</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-count-up-to-symmetry-2006.05080"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-count-up-to-symmetry-2006.05080"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatisation-for-quantifier-free-separation-logic-2006.05156</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatisation-for-quantifier-free-separation-logic-2006.05156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatisation-for-quantifier-free-separation-logic-2006.05156"/></url>
<url><loc>https://scifaro.com/en/abs/non-iterative-modal-logics-are-coalgebraic-2006.05396</loc><lastmod>2020-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-iterative-modal-logics-are-coalgebraic-2006.05396"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-iterative-modal-logics-are-coalgebraic-2006.05396"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-optimal-deployment-in-the-cloud-of-component-based-applications-using-optimization-modulo-theory-mathematical-programming-and-symmetry-breaking-2006.05401</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-optimal-deployment-in-the-cloud-of-component-based-applications-using-optimization-modulo-theory-mathematical-programming-and-symmetry-breaking-2006.05401"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-optimal-deployment-in-the-cloud-of-component-based-applications-using-optimization-modulo-theory-mathematical-programming-and-symmetry-breaking-2006.05401"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-for-the-full-axiom-of-choice-2006.05433</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-for-the-full-axiom-of-choice-2006.05433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-for-the-full-axiom-of-choice-2006.05433"/></url>
<url><loc>https://scifaro.com/en/abs/hypersequent-calculi-for-non-normal-modal-and-deontic-logics-countermodels-and-optimal-complexity-2006.05436</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypersequent-calculi-for-non-normal-modal-and-deontic-logics-countermodels-and-optimal-complexity-2006.05436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypersequent-calculi-for-non-normal-modal-and-deontic-logics-countermodels-and-optimal-complexity-2006.05436"/></url>
<url><loc>https://scifaro.com/en/abs/a-theoretical-framework-for-symbolic-quick-error-detection-2006.05449</loc><lastmod>2020-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theoretical-framework-for-symbolic-quick-error-detection-2006.05449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theoretical-framework-for-symbolic-quick-error-detection-2006.05449"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-recursion-free-regular-monitors-2006.05463</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-recursion-free-regular-monitors-2006.05463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-recursion-free-regular-monitors-2006.05463"/></url>
<url><loc>https://scifaro.com/en/abs/checking-marking-reachability-with-the-state-equation-in-petri-net-subclasses-2006.05600</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-marking-reachability-with-the-state-equation-in-petri-net-subclasses-2006.05600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-marking-reachability-with-the-state-equation-in-petri-net-subclasses-2006.05600"/></url>
<url><loc>https://scifaro.com/en/abs/predicative-theories-of-continuous-lattices-2006.05642</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicative-theories-of-continuous-lattices-2006.05642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicative-theories-of-continuous-lattices-2006.05642"/></url>
<url><loc>https://scifaro.com/en/abs/minimizing-deduction-system-and-its-application-2006.05833</loc><lastmod>2020-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimizing-deduction-system-and-its-application-2006.05833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimizing-deduction-system-and-its-application-2006.05833"/></url>
<url><loc>https://scifaro.com/en/abs/s-semantics-an-example-2006.06077</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-semantics-an-example-2006.06077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-semantics-an-example-2006.06077"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-step-wise-explaining-how-to-solve-constraint-satisfaction-problems-2006.06343</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-step-wise-explaining-how-to-solve-constraint-satisfaction-problems-2006.06343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-step-wise-explaining-how-to-solve-constraint-satisfaction-problems-2006.06343"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-equational-axiomatisation-of-partial-differentiation-2006.06415</loc><lastmod>2020-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-equational-axiomatisation-of-partial-differentiation-2006.06415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-equational-axiomatisation-of-partial-differentiation-2006.06415"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-teams-in-first-order-team-logics-2006.06953</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-teams-in-first-order-team-logics-2006.06953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-teams-in-first-order-team-logics-2006.06953"/></url>
<url><loc>https://scifaro.com/en/abs/traversal-invariant-characterizations-of-logarithmic-space-2006.07067</loc><lastmod>2020-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/traversal-invariant-characterizations-of-logarithmic-space-2006.07067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/traversal-invariant-characterizations-of-logarithmic-space-2006.07067"/></url>
<url><loc>https://scifaro.com/en/abs/pointer-data-structure-synthesis-from-answer-set-programming-specifications-2006.07440</loc><lastmod>2020-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pointer-data-structure-synthesis-from-answer-set-programming-specifications-2006.07440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pointer-data-structure-synthesis-from-answer-set-programming-specifications-2006.07440"/></url>
<url><loc>https://scifaro.com/en/abs/pure-pattern-calculus-a-la-de-bruijn-2006.07674</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pure-pattern-calculus-a-la-de-bruijn-2006.07674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pure-pattern-calculus-a-la-de-bruijn-2006.07674"/></url>
<url><loc>https://scifaro.com/en/abs/grading-adjoint-logic-2006.08854</loc><lastmod>2020-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grading-adjoint-logic-2006.08854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grading-adjoint-logic-2006.08854"/></url>
<url><loc>https://scifaro.com/en/abs/isarstep-a-benchmark-for-high-level-mathematical-reasoning-2006.09265</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isarstep-a-benchmark-for-high-level-mathematical-reasoning-2006.09265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isarstep-a-benchmark-for-high-level-mathematical-reasoning-2006.09265"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-activity-networks-templates-supporting-variability-in-performability-models-2006.09291</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-activity-networks-templates-supporting-variability-in-performability-models-2006.09291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-activity-networks-templates-supporting-variability-in-performability-models-2006.09291"/></url>
<url><loc>https://scifaro.com/en/abs/leveraging-the-information-contained-in-theory-presentations-2006.09292</loc><lastmod>2020-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leveraging-the-information-contained-in-theory-presentations-2006.09292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leveraging-the-information-contained-in-theory-presentations-2006.09292"/></url>
<url><loc>https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-i-2006.09599</loc><lastmod>2025-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-i-2006.09599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-i-2006.09599"/></url>
<url><loc>https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-ii-2006.10239</loc><lastmod>2025-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-ii-2006.10239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-structure-of-idempotent-algebras-ii-2006.10239"/></url>
<url><loc>https://scifaro.com/en/abs/bi-abduction-for-shapes-with-ordered-data-2006.10439</loc><lastmod>2020-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-abduction-for-shapes-with-ordered-data-2006.10439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-abduction-for-shapes-with-ordered-data-2006.10439"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-theories-for-host-core-languages-2006.10604</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-theories-for-host-core-languages-2006.10604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-theories-for-host-core-languages-2006.10604"/></url>
<url><loc>https://scifaro.com/en/abs/common-equivalence-and-size-after-forgetting-2006.11152</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/common-equivalence-and-size-after-forgetting-2006.11152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/common-equivalence-and-size-after-forgetting-2006.11152"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-with-multiple-sources-per-vertex-2006.11159</loc><lastmod>2020-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-with-multiple-sources-per-vertex-2006.11159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-with-multiple-sources-per-vertex-2006.11159"/></url>
<url><loc>https://scifaro.com/en/abs/the-fluted-fragment-with-transitive-relations-2006.11169</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fluted-fragment-with-transitive-relations-2006.11169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fluted-fragment-with-transitive-relations-2006.11169"/></url>
<url><loc>https://scifaro.com/en/abs/learning-to-prove-from-synthetic-theorems-2006.11259</loc><lastmod>2020-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-to-prove-from-synthetic-theorems-2006.11259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-to-prove-from-synthetic-theorems-2006.11259"/></url>
<url><loc>https://scifaro.com/en/abs/moore-s-paradox-and-the-logic-of-belief-2006.11363</loc><lastmod>2020-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moore-s-paradox-and-the-logic-of-belief-2006.11363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moore-s-paradox-and-the-logic-of-belief-2006.11363"/></url>
<url><loc>https://scifaro.com/en/abs/graphs-of-relational-structures-restricted-types-2006.11713</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphs-of-relational-structures-restricted-types-2006.11713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphs-of-relational-structures-restricted-types-2006.11713"/></url>
<url><loc>https://scifaro.com/en/abs/large-and-infinitary-quotient-inductive-inductive-types-2006.11736</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/large-and-infinitary-quotient-inductive-inductive-types-2006.11736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/large-and-infinitary-quotient-inductive-inductive-types-2006.11736"/></url>
<url><loc>https://scifaro.com/en/abs/expressive-logics-for-coinductive-predicates-2006.12465</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressive-logics-for-coinductive-predicates-2006.12465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressive-logics-for-coinductive-predicates-2006.12465"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-type-theoretic-approach-to-regression-via-global-optimisation-2006.12868</loc><lastmod>2020-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-type-theoretic-approach-to-regression-via-global-optimisation-2006.12868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-type-theoretic-approach-to-regression-via-global-optimisation-2006.12868"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-soundness-of-the-encoding-methods-of-sat-based-model-checking-2006.13613</loc><lastmod>2022-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-soundness-of-the-encoding-methods-of-sat-based-model-checking-2006.13613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-soundness-of-the-encoding-methods-of-sat-based-model-checking-2006.13613"/></url>
<url><loc>https://scifaro.com/en/abs/reloc-reloaded-a-mechanized-relational-logic-for-fine-grained-concurrency-and-logical-atomicity-2006.13635</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reloc-reloaded-a-mechanized-relational-logic-for-fine-grained-concurrency-and-logical-atomicity-2006.13635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reloc-reloaded-a-mechanized-relational-logic-for-fine-grained-concurrency-and-logical-atomicity-2006.13635"/></url>
<url><loc>https://scifaro.com/en/abs/deepabstract-neural-network-abstraction-for-accelerating-verification-2006.13735</loc><lastmod>2020-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deepabstract-neural-network-abstraction-for-accelerating-verification-2006.13735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deepabstract-neural-network-abstraction-for-accelerating-verification-2006.13735"/></url>
<url><loc>https://scifaro.com/en/abs/a-hennessy-milner-theorem-for-atl-with-imperfect-information-2006.15000</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hennessy-milner-theorem-for-atl-with-imperfect-information-2006.15000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hennessy-milner-theorem-for-atl-with-imperfect-information-2006.15000"/></url>
<url><loc>https://scifaro.com/en/abs/generating-induction-principles-and-subterm-relations-for-inductive-types-using-metacoq-2006.15135</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-induction-principles-and-subterm-relations-for-inductive-types-using-metacoq-2006.15135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-induction-principles-and-subterm-relations-for-inductive-types-using-metacoq-2006.15135"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-theoretic-and-categorical-models-of-neural-information-networks-2006.15136</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-theoretic-and-categorical-models-of-neural-information-networks-2006.15136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-theoretic-and-categorical-models-of-neural-information-networks-2006.15136"/></url>
<url><loc>https://scifaro.com/en/abs/extensive-infinite-games-and-escalation-an-exercise-in-agda-2006.15137</loc><lastmod>2020-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensive-infinite-games-and-escalation-an-exercise-in-agda-2006.15137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensive-infinite-games-and-escalation-an-exercise-in-agda-2006.15137"/></url>
<url><loc>https://scifaro.com/en/abs/access-based-intuitionistic-knowledge-2006.15750</loc><lastmod>2021-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/access-based-intuitionistic-knowledge-2006.15750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/access-based-intuitionistic-knowledge-2006.15750"/></url>
<url><loc>https://scifaro.com/en/abs/game-comonads-generalised-quantifiers-2006.16039</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/game-comonads-generalised-quantifiers-2006.16039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/game-comonads-generalised-quantifiers-2006.16039"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-coherent-confluence-and-higher-globular-kleene-algebras-2006.16129</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-coherent-confluence-and-higher-globular-kleene-algebras-2006.16129"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-coherent-confluence-and-higher-globular-kleene-algebras-2006.16129"/></url>
<url><loc>https://scifaro.com/en/abs/it-s-time-to-play-safe-shield-synthesis-for-timed-systems-2006.16688</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/it-s-time-to-play-safe-shield-synthesis-for-timed-systems-2006.16688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/it-s-time-to-play-safe-shield-synthesis-for-timed-systems-2006.16688"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-models-of-simple-type-theories-a-polynomial-approach-2006.16949</loc><lastmod>2020-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-models-of-simple-type-theories-a-polynomial-approach-2006.16949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-models-of-simple-type-theories-a-polynomial-approach-2006.16949"/></url>
<url><loc>https://scifaro.com/en/abs/the-integers-as-a-higher-inductive-type-2007.00167</loc><lastmod>2020-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-integers-as-a-higher-inductive-type-2007.00167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-integers-as-a-higher-inductive-type-2007.00167"/></url>
<url><loc>https://scifaro.com/en/abs/a-typo-in-the-paterson-wegman-de-champeaux-algorithm-2007.00304</loc><lastmod>2020-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-typo-in-the-paterson-wegman-de-champeaux-algorithm-2007.00304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-typo-in-the-paterson-wegman-de-champeaux-algorithm-2007.00304"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-entailments-in-separation-logic-with-inductive-definitions-beyond-established-systems-2007.00502</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-entailments-in-separation-logic-with-inductive-definitions-beyond-established-systems-2007.00502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-entailments-in-separation-logic-with-inductive-definitions-beyond-established-systems-2007.00502"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-with-contextual-knowledge-and-influence-diagrams-2007.00571</loc><lastmod>2020-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-with-contextual-knowledge-and-influence-diagrams-2007.00571"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-with-contextual-knowledge-and-influence-diagrams-2007.00571"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-witnesses-for-probabilistic-timed-automata-2007.00637</loc><lastmod>2020-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-witnesses-for-probabilistic-timed-automata-2007.00637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-witnesses-for-probabilistic-timed-automata-2007.00637"/></url>
<url><loc>https://scifaro.com/en/abs/context-graphs-for-legal-reasoning-and-argumentation-2007.00732</loc><lastmod>2020-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-graphs-for-legal-reasoning-and-argumentation-2007.00732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-graphs-for-legal-reasoning-and-argumentation-2007.00732"/></url>
<url><loc>https://scifaro.com/en/abs/characteristic-logics-for-behavioural-hemimetrics-via-fuzzy-lax-extensions-2007.01033</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristic-logics-for-behavioural-hemimetrics-via-fuzzy-lax-extensions-2007.01033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristic-logics-for-behavioural-hemimetrics-via-fuzzy-lax-extensions-2007.01033"/></url>
<url><loc>https://scifaro.com/en/abs/most-of-leads-to-undecidability-failure-of-adding-frequencies-to-ltl-2007.01233</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/most-of-leads-to-undecidability-failure-of-adding-frequencies-to-ltl-2007.01233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/most-of-leads-to-undecidability-failure-of-adding-frequencies-to-ltl-2007.01233"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-spatial-properties-on-neighbourhood-spaces-2007.01266</loc><lastmod>2020-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-spatial-properties-on-neighbourhood-spaces-2007.01266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-spatial-properties-on-neighbourhood-spaces-2007.01266"/></url>
<url><loc>https://scifaro.com/en/abs/smt-switch-a-solver-agnostic-c-api-for-smt-solving-2007.01374</loc><lastmod>2020-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-switch-a-solver-agnostic-c-api-for-smt-solving-2007.01374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-switch-a-solver-agnostic-c-api-for-smt-solving-2007.01374"/></url>
<url><loc>https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-the-guarded-and-two-variable-fragments-2007.01597</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-the-guarded-and-two-variable-fragments-2007.01597"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-the-guarded-and-two-variable-fragments-2007.01597"/></url>
<url><loc>https://scifaro.com/en/abs/logical-separability-of-labeled-data-examples-under-ontologies-2007.01610</loc><lastmod>2022-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-separability-of-labeled-data-examples-under-ontologies-2007.01610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-separability-of-labeled-data-examples-under-ontologies-2007.01610"/></url>
<url><loc>https://scifaro.com/en/abs/active-learning-of-timed-automata-with-unobservable-resets-2007.01637</loc><lastmod>2020-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/active-learning-of-timed-automata-with-unobservable-resets-2007.01637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/active-learning-of-timed-automata-with-unobservable-resets-2007.01637"/></url>
<url><loc>https://scifaro.com/en/abs/many-sorted-hybrid-modal-languages-2007.01709</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-sorted-hybrid-modal-languages-2007.01709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-sorted-hybrid-modal-languages-2007.01709"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-soft-type-assignment-2007.01733</loc><lastmod>2020-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-soft-type-assignment-2007.01733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-soft-type-assignment-2007.01733"/></url>
<url><loc>https://scifaro.com/en/abs/supervisory-controller-synthesis-for-non-terminating-processes-is-an-obliging-game-2007.01773</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supervisory-controller-synthesis-for-non-terminating-processes-is-an-obliging-game-2007.01773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supervisory-controller-synthesis-for-non-terminating-processes-is-an-obliging-game-2007.01773"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-modelling-verification-and-transformation-of-concurrent-imperative-programs-2007.02261</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-modelling-verification-and-transformation-of-concurrent-imperative-programs-2007.02261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-modelling-verification-and-transformation-of-concurrent-imperative-programs-2007.02261"/></url>
<url><loc>https://scifaro.com/en/abs/logic-language-and-calculus-2007.02484</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-language-and-calculus-2007.02484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-language-and-calculus-2007.02484"/></url>
<url><loc>https://scifaro.com/en/abs/inferences-and-modal-vocabulary-2007.02487</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferences-and-modal-vocabulary-2007.02487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferences-and-modal-vocabulary-2007.02487"/></url>
<url><loc>https://scifaro.com/en/abs/enhancing-sat-solvers-with-glue-variable-predictions-2007.02559</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enhancing-sat-solvers-with-glue-variable-predictions-2007.02559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enhancing-sat-solvers-with-glue-variable-predictions-2007.02559"/></url>
<url><loc>https://scifaro.com/en/abs/simulation-guided-boolean-resubstitution-2007.02579</loc><lastmod>2020-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulation-guided-boolean-resubstitution-2007.02579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulation-guided-boolean-resubstitution-2007.02579"/></url>
<url><loc>https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-description-and-modal-logics-with-nominals-and-role-inclusions-2007.02736</loc><lastmod>2023-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-description-and-modal-logics-with-nominals-and-role-inclusions-2007.02736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/living-without-beth-and-craig-definitions-and-interpolants-in-description-and-modal-logics-with-nominals-and-role-inclusions-2007.02736"/></url>
<url><loc>https://scifaro.com/en/abs/on-ltl-model-checking-for-low-dimensional-discrete-linear-dynamical-systems-2007.02911</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-ltl-model-checking-for-low-dimensional-discrete-linear-dynamical-systems-2007.02911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-ltl-model-checking-for-low-dimensional-discrete-linear-dynamical-systems-2007.02911"/></url>
<url><loc>https://scifaro.com/en/abs/multi-player-equilibria-verification-for-concurrent-stochastic-games-2007.03365</loc><lastmod>2020-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-player-equilibria-verification-for-concurrent-stochastic-games-2007.03365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-player-equilibria-verification-for-concurrent-stochastic-games-2007.03365"/></url>
<url><loc>https://scifaro.com/en/abs/colored-props-for-large-scale-graphical-reasoning-2007.03564</loc><lastmod>2020-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/colored-props-for-large-scale-graphical-reasoning-2007.03564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/colored-props-for-large-scale-graphical-reasoning-2007.03564"/></url>
<url><loc>https://scifaro.com/en/abs/the-vectorial-lambda-calculus-revisited-2007.03648</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vectorial-lambda-calculus-revisited-2007.03648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vectorial-lambda-calculus-revisited-2007.03648"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-horn-and-krom-fragments-of-second-order-boolean-logic-2007.03867</loc><lastmod>2020-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-horn-and-krom-fragments-of-second-order-boolean-logic-2007.03867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-horn-and-krom-fragments-of-second-order-boolean-logic-2007.03867"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-emptiness-of-timed-b-uchi-automata-2007.04150</loc><lastmod>2020-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-emptiness-of-timed-b-uchi-automata-2007.04150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-emptiness-of-timed-b-uchi-automata-2007.04150"/></url>
<url><loc>https://scifaro.com/en/abs/closure-hyperdoctrines-with-paths-2007.04213</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-hyperdoctrines-with-paths-2007.04213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-hyperdoctrines-with-paths-2007.04213"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-reachability-analysis-of-high-dimensional-max-plus-linear-systems-2007.04510</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-high-dimensional-max-plus-linear-systems-2007.04510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-reachability-analysis-of-high-dimensional-max-plus-linear-systems-2007.04510"/></url>
<url><loc>https://scifaro.com/en/abs/treewidth-aware-complexity-in-asp-not-all-positive-cycles-are-equally-hard-2007.04620</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treewidth-aware-complexity-in-asp-not-all-positive-cycles-are-equally-hard-2007.04620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treewidth-aware-complexity-in-asp-not-all-positive-cycles-are-equally-hard-2007.04620"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-computational-semi-effects-and-categorical-gluing-for-equivariant-functors-2007.04621</loc><lastmod>2020-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-computational-semi-effects-and-categorical-gluing-for-equivariant-functors-2007.04621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-computational-semi-effects-and-categorical-gluing-for-equivariant-functors-2007.04621"/></url>
<url><loc>https://scifaro.com/en/abs/universal-algebra-in-unimath-2007.04840</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-algebra-in-unimath-2007.04840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-algebra-in-unimath-2007.04840"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-complexity-of-parity-objectives-in-countable-mdps-2007.05065</loc><lastmod>2020-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-complexity-of-parity-objectives-in-countable-mdps-2007.05065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-complexity-of-parity-objectives-in-countable-mdps-2007.05065"/></url>
<url><loc>https://scifaro.com/en/abs/on-flat-lossy-channel-machines-2007.05269</loc><lastmod>2020-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-flat-lossy-channel-machines-2007.05269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-flat-lossy-channel-machines-2007.05269"/></url>
<url><loc>https://scifaro.com/en/abs/extension-preservation-in-the-finite-and-prefix-classes-of-first-order-logic-2007.05459</loc><lastmod>2020-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-preservation-in-the-finite-and-prefix-classes-of-first-order-logic-2007.05459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-preservation-in-the-finite-and-prefix-classes-of-first-order-logic-2007.05459"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-existence-of-cut-off-in-parameterized-rendez-vous-networks-2007.05789</loc><lastmod>2020-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-existence-of-cut-off-in-parameterized-rendez-vous-networks-2007.05789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-existence-of-cut-off-in-parameterized-rendez-vous-networks-2007.05789"/></url>
<url><loc>https://scifaro.com/en/abs/context-aware-temporal-logic-for-probabilistic-systems-2007.05793</loc><lastmod>2020-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-aware-temporal-logic-for-probabilistic-systems-2007.05793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-aware-temporal-logic-for-probabilistic-systems-2007.05793"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-verification-and-synthesis-of-threshold-automata-2007.06248</loc><lastmod>2025-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-verification-and-synthesis-of-threshold-automata-2007.06248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-verification-and-synthesis-of-threshold-automata-2007.06248"/></url>
<url><loc>https://scifaro.com/en/abs/generating-functions-for-probabilistic-programs-2007.06327</loc><lastmod>2020-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-functions-for-probabilistic-programs-2007.06327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-functions-for-probabilistic-programs-2007.06327"/></url>
<url><loc>https://scifaro.com/en/abs/thirty-seven-years-of-relational-hoare-logic-remarks-on-its-principles-and-history-2007.06421</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thirty-seven-years-of-relational-hoare-logic-remarks-on-its-principles-and-history-2007.06421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thirty-seven-years-of-relational-hoare-logic-remarks-on-its-principles-and-history-2007.06421"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-path-feasibility-of-string-manipulating-programs-with-integer-data-type-2007.06913</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-path-feasibility-of-string-manipulating-programs-with-integer-data-type-2007.06913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-path-feasibility-of-string-manipulating-programs-with-integer-data-type-2007.06913"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-based-compositional-synthesis-full-version-2007.06941</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-based-compositional-synthesis-full-version-2007.06941"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-based-compositional-synthesis-full-version-2007.06941"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-branching-properties-on-petri-nets-with-transits-full-version-2007.07235</loc><lastmod>2020-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-branching-properties-on-petri-nets-with-transits-full-version-2007.07235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-branching-properties-on-petri-nets-with-transits-full-version-2007.07235"/></url>
<url><loc>https://scifaro.com/en/abs/widest-paths-and-global-propagation-in-bounded-value-iteration-for-stochastic-games-2007.07421</loc><lastmod>2020-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/widest-paths-and-global-propagation-in-bounded-value-iteration-for-stochastic-games-2007.07421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/widest-paths-and-global-propagation-in-bounded-value-iteration-for-stochastic-games-2007.07421"/></url>
<url><loc>https://scifaro.com/en/abs/partially-observable-concurrent-kleene-algebra-2007.07593</loc><lastmod>2023-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-observable-concurrent-kleene-algebra-2007.07593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-observable-concurrent-kleene-algebra-2007.07593"/></url>
<url><loc>https://scifaro.com/en/abs/computational-paths-an-approach-in-the-lnd-eq-trs-2-system-2007.07769</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-paths-an-approach-in-the-lnd-eq-trs-2-system-2007.07769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-paths-an-approach-in-the-lnd-eq-trs-2-system-2007.07769"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-theorems-through-the-lens-of-topology-2007.07879</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-theorems-through-the-lens-of-topology-2007.07879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-theorems-through-the-lens-of-topology-2007.07879"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theory-for-strictly-unital-infty-categories-2007.08307</loc><lastmod>2022-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theory-for-strictly-unital-infty-categories-2007.08307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theory-for-strictly-unital-infty-categories-2007.08307"/></url>
<url><loc>https://scifaro.com/en/abs/solving-random-parity-games-in-polynomial-time-2007.08387</loc><lastmod>2020-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-random-parity-games-in-polynomial-time-2007.08387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-random-parity-games-in-polynomial-time-2007.08387"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logics-with-composition-on-finite-forests-expressivity-and-complexity-extra-material-2007.08598</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logics-with-composition-on-finite-forests-expressivity-and-complexity-extra-material-2007.08598"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logics-with-composition-on-finite-forests-expressivity-and-complexity-extra-material-2007.08598"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-set-theory-and-omega-powers-of-finitary-languages-2007.08636</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-set-theory-and-omega-powers-of-finitary-languages-2007.08636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-set-theory-and-omega-powers-of-finitary-languages-2007.08636"/></url>
<url><loc>https://scifaro.com/en/abs/smart-choices-and-the-selection-monad-2007.08926</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smart-choices-and-the-selection-monad-2007.08926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smart-choices-and-the-selection-monad-2007.08926"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-in-two-dimensional-vector-addition-systems-with-states-one-test-is-for-free-2007.09096</loc><lastmod>2020-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-in-two-dimensional-vector-addition-systems-with-states-one-test-is-for-free-2007.09096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-in-two-dimensional-vector-addition-systems-with-states-one-test-is-for-free-2007.09096"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-restrictions-of-immediate-observation-petri-nets-2007.09189</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-restrictions-of-immediate-observation-petri-nets-2007.09189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-restrictions-of-immediate-observation-petri-nets-2007.09189"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-calculus-approach-to-correctness-enforcement-of-plcs-full-version-2007.09399</loc><lastmod>2020-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-calculus-approach-to-correctness-enforcement-of-plcs-full-version-2007.09399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-calculus-approach-to-correctness-enforcement-of-plcs-full-version-2007.09399"/></url>
<url><loc>https://scifaro.com/en/abs/retracing-some-paths-in-categorical-semantics-from-process-propositions-as-types-to-categorified-reals-and-computers-2007.10057</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retracing-some-paths-in-categorical-semantics-from-process-propositions-as-types-to-categorified-reals-and-computers-2007.10057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retracing-some-paths-in-categorical-semantics-from-process-propositions-as-types-to-categorified-reals-and-computers-2007.10057"/></url>
<url><loc>https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-technical-report-2007.10215</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-technical-report-2007.10215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-technical-report-2007.10215"/></url>
<url><loc>https://scifaro.com/en/abs/graph-rewrites-from-graphic-lambda-calculus-to-chemlambda-to-directed-interaction-combinators-2007.10288</loc><lastmod>2020-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-rewrites-from-graphic-lambda-calculus-to-chemlambda-to-directed-interaction-combinators-2007.10288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-rewrites-from-graphic-lambda-calculus-to-chemlambda-to-directed-interaction-combinators-2007.10288"/></url>
<url><loc>https://scifaro.com/en/abs/synrg-syntax-guided-synthesis-of-expressions-with-alternating-quantifiers-2007.10519</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synrg-syntax-guided-synthesis-of-expressions-with-alternating-quantifiers-2007.10519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synrg-syntax-guided-synthesis-of-expressions-with-alternating-quantifiers-2007.10519"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-termination-detection-for-distributed-actor-systems-2007.10553</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-termination-detection-for-distributed-actor-systems-2007.10553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-termination-detection-for-distributed-actor-systems-2007.10553"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-equivalences-based-on-open-pnets-2007.10770</loc><lastmod>2021-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-equivalences-based-on-open-pnets-2007.10770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-equivalences-based-on-open-pnets-2007.10770"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verified-trades-in-financial-markets-2007.10805</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verified-trades-in-financial-markets-2007.10805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verified-trades-in-financial-markets-2007.10805"/></url>
<url><loc>https://scifaro.com/en/abs/who-verifies-the-verifiers-a-computer-checked-implementation-of-the-dpll-algorithm-in-dafny-2007.10842</loc><lastmod>2020-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/who-verifies-the-verifiers-a-computer-checked-implementation-of-the-dpll-algorithm-in-dafny-2007.10842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/who-verifies-the-verifiers-a-computer-checked-implementation-of-the-dpll-algorithm-in-dafny-2007.10842"/></url>
<url><loc>https://scifaro.com/en/abs/graded-hoare-logic-and-its-categorical-semantics-2007.11235</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-hoare-logic-and-its-categorical-semantics-2007.11235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-hoare-logic-and-its-categorical-semantics-2007.11235"/></url>
<url><loc>https://scifaro.com/en/abs/differential-games-locality-and-model-checking-for-fo-logic-of-graphs-2007.11345</loc><lastmod>2020-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-games-locality-and-model-checking-for-fo-logic-of-graphs-2007.11345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-games-locality-and-model-checking-for-fo-logic-of-graphs-2007.11345"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-analysis-of-binary-sessions-2007.11832</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-analysis-of-binary-sessions-2007.11832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-analysis-of-binary-sessions-2007.11832"/></url>
<url><loc>https://scifaro.com/en/abs/from-2-sequents-and-linear-nested-sequents-to-natural-deduction-for-normal-modal-logics-2007.11875</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-2-sequents-and-linear-nested-sequents-to-natural-deduction-for-normal-modal-logics-2007.11875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-2-sequents-and-linear-nested-sequents-to-natural-deduction-for-normal-modal-logics-2007.11875"/></url>
<url><loc>https://scifaro.com/en/abs/process-symmetry-in-probabilistic-transducers-2007.11922</loc><lastmod>2020-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-symmetry-in-probabilistic-transducers-2007.11922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-symmetry-in-probabilistic-transducers-2007.11922"/></url>
<url><loc>https://scifaro.com/en/abs/algebras-of-utxo-blockchains-2007.12404</loc><lastmod>2022-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebras-of-utxo-blockchains-2007.12404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebras-of-utxo-blockchains-2007.12404"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-interpretation-in-formal-argumentation-with-a-galois-connection-for-abstract-dialectical-frameworks-and-may-must-argumentation-first-report-2007.12474</loc><lastmod>2020-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-interpretation-in-formal-argumentation-with-a-galois-connection-for-abstract-dialectical-frameworks-and-may-must-argumentation-first-report-2007.12474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-interpretation-in-formal-argumentation-with-a-galois-connection-for-abstract-dialectical-frameworks-and-may-must-argumentation-first-report-2007.12474"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-reactive-and-concurrent-programs-by-calculation-2007.13529</loc><lastmod>2021-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-reactive-and-concurrent-programs-by-calculation-2007.13529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-reactive-and-concurrent-programs-by-calculation-2007.13529"/></url>
<url><loc>https://scifaro.com/en/abs/extending-concurrent-separation-logic-to-enhance-modular-formalization-2007.13685</loc><lastmod>2020-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-concurrent-separation-logic-to-enhance-modular-formalization-2007.13685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-concurrent-separation-logic-to-enhance-modular-formalization-2007.13685"/></url>
<url><loc>https://scifaro.com/en/abs/local-variables-and-quantum-relational-hoare-logic-2007.14155</loc><lastmod>2020-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-variables-and-quantum-relational-hoare-logic-2007.14155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-variables-and-quantum-relational-hoare-logic-2007.14155"/></url>
<url><loc>https://scifaro.com/en/abs/opacity-of-discrete-event-systems-with-active-intruder-2007.14960</loc><lastmod>2020-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/opacity-of-discrete-event-systems-with-active-intruder-2007.14960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/opacity-of-discrete-event-systems-with-active-intruder-2007.14960"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-homotopy-domain-theory-2007.15082</loc><lastmod>2022-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-homotopy-domain-theory-2007.15082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-homotopy-domain-theory-2007.15082"/></url>
<url><loc>https://scifaro.com/en/abs/correctness-by-construction-for-probabilistic-programs-2007.15246</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctness-by-construction-for-probabilistic-programs-2007.15246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctness-by-construction-for-probabilistic-programs-2007.15246"/></url>
<url><loc>https://scifaro.com/en/abs/a-cook-s-tour-of-duality-in-logic-from-quantifiers-through-vietoris-to-measures-2007.15415</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cook-s-tour-of-duality-in-logic-from-quantifiers-through-vietoris-to-measures-2007.15415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cook-s-tour-of-duality-in-logic-from-quantifiers-through-vietoris-to-measures-2007.15415"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-strategies-on-collapsible-pushdown-arenas-with-imperfect-information-2007.15458</loc><lastmod>2020-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-collapsible-pushdown-arenas-with-imperfect-information-2007.15458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-strategies-on-collapsible-pushdown-arenas-with-imperfect-information-2007.15458"/></url>
<url><loc>https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-2007.15478</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-2007.15478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadratic-word-equations-with-length-constraints-counter-systems-and-presburger-arithmetic-with-divisibility-2007.15478"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-fusion-2007.15697</loc><lastmod>2023-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-fusion-2007.15697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-fusion-2007.15697"/></url>
<url><loc>https://scifaro.com/en/abs/stellar-resolution-multiplicatives-2007.16077</loc><lastmod>2020-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stellar-resolution-multiplicatives-2007.16077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stellar-resolution-multiplicatives-2007.16077"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-proof-search-for-polarized-logic-with-applications-to-full-intuitionistic-propositional-logic-2007.16161</loc><lastmod>2025-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-proof-search-for-polarized-logic-with-applications-to-full-intuitionistic-propositional-logic-2007.16161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-proof-search-for-polarized-logic-with-applications-to-full-intuitionistic-propositional-logic-2007.16161"/></url>
<url><loc>https://scifaro.com/en/abs/the-multiplicative-additive-lambek-calculus-with-subexponential-and-bracket-modalities-2008.00075</loc><lastmod>2020-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multiplicative-additive-lambek-calculus-with-subexponential-and-bracket-modalities-2008.00075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multiplicative-additive-lambek-calculus-with-subexponential-and-bracket-modalities-2008.00075"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-induced-subgraphs-and-the-l-o-s-tarski-theorem-2008.00420</loc><lastmod>2020-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-and-the-l-o-s-tarski-theorem-2008.00420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-and-the-l-o-s-tarski-theorem-2008.00420"/></url>
<url><loc>https://scifaro.com/en/abs/concolic-testing-in-clp-2008.00421</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concolic-testing-in-clp-2008.00421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concolic-testing-in-clp-2008.00421"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problems-for-linear-recurrences-involving-arbitrary-real-numbers-2008.00583</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problems-for-linear-recurrences-involving-arbitrary-real-numbers-2008.00583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problems-for-linear-recurrences-involving-arbitrary-real-numbers-2008.00583"/></url>
<url><loc>https://scifaro.com/en/abs/a-lemma-on-closures-and-its-application-to-modularity-in-logic-programming-semantics-2008.00724</loc><lastmod>2020-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lemma-on-closures-and-its-application-to-modularity-in-logic-programming-semantics-2008.00724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lemma-on-closures-and-its-application-to-modularity-in-logic-programming-semantics-2008.00724"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-automata-in-typed-lambda-calculi-ii-streaming-transducers-vs-categorical-semantics-2008.01050</loc><lastmod>2023-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-automata-in-typed-lambda-calculi-ii-streaming-transducers-vs-categorical-semantics-2008.01050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-automata-in-typed-lambda-calculi-ii-streaming-transducers-vs-categorical-semantics-2008.01050"/></url>
<url><loc>https://scifaro.com/en/abs/trace-logic-for-inductive-loop-reasoning-2008.01387</loc><lastmod>2020-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-logic-for-inductive-loop-reasoning-2008.01387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-logic-for-inductive-loop-reasoning-2008.01387"/></url>
<url><loc>https://scifaro.com/en/abs/modular-answer-set-programming-as-a-formal-specification-language-2008.02015</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-answer-set-programming-as-a-formal-specification-language-2008.02015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-answer-set-programming-as-a-formal-specification-language-2008.02015"/></url>
<url><loc>https://scifaro.com/en/abs/eclingo-a-solver-for-epistemic-logic-programs-2008.02018</loc><lastmod>2020-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eclingo-a-solver-for-epistemic-logic-programs-2008.02018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eclingo-a-solver-for-epistemic-logic-programs-2008.02018"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-tight-logic-programs-with-anthem-and-vampire-2008.02025</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-tight-logic-programs-with-anthem-and-vampire-2008.02025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-tight-logic-programs-with-anthem-and-vampire-2008.02025"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-equality-preservation-and-verified-generic-programming-2008.02123</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-equality-preservation-and-verified-generic-programming-2008.02123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-equality-preservation-and-verified-generic-programming-2008.02123"/></url>
<url><loc>https://scifaro.com/en/abs/proof-complexity-and-the-binary-encoding-of-combinatorial-principles-2008.02138</loc><lastmod>2022-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-complexity-and-the-binary-encoding-of-combinatorial-principles-2008.02138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-complexity-and-the-binary-encoding-of-combinatorial-principles-2008.02138"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-correctness-of-monadic-backward-induction-2008.02143</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-correctness-of-monadic-backward-induction-2008.02143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-correctness-of-monadic-backward-induction-2008.02143"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-reasoning-with-uncertainty-via-real-valued-logics-2008.02429</loc><lastmod>2022-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-reasoning-with-uncertainty-via-real-valued-logics-2008.02429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-reasoning-with-uncertainty-via-real-valued-logics-2008.02429"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-verification-and-program-transformation-and-7th-workshop-on-horn-clauses-for-verification-and-synthesis-2008.02483</loc><lastmod>2020-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-verification-and-program-transformation-and-7th-workshop-on-horn-clauses-for-verification-and-synthesis-2008.02483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-international-workshop-on-verification-and-program-transformation-and-7th-workshop-on-horn-clauses-for-verification-and-synthesis-2008.02483"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-taylor-expansion-of-lambda-terms-and-the-groupoid-structure-of-their-rigid-approximants-2008.02665</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-taylor-expansion-of-lambda-terms-and-the-groupoid-structure-of-their-rigid-approximants-2008.02665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-taylor-expansion-of-lambda-terms-and-the-groupoid-structure-of-their-rigid-approximants-2008.02665"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-and-bisimilarity-for-fuzzy-description-logics-under-the-g-odel-semantics-2008.02857</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-and-bisimilarity-for-fuzzy-description-logics-under-the-g-odel-semantics-2008.02857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-and-bisimilarity-for-fuzzy-description-logics-under-the-g-odel-semantics-2008.02857"/></url>
<url><loc>https://scifaro.com/en/abs/a-historical-account-of-my-early-research-interests-2008.02927</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-historical-account-of-my-early-research-interests-2008.02927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-historical-account-of-my-early-research-interests-2008.02927"/></url>
<url><loc>https://scifaro.com/en/abs/from-well-structured-transition-systems-to-program-verification-2008.02929</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-well-structured-transition-systems-to-program-verification-2008.02929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-well-structured-transition-systems-to-program-verification-2008.02929"/></url>
<url><loc>https://scifaro.com/en/abs/transformational-verification-of-quicksort-2008.02934</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transformational-verification-of-quicksort-2008.02934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transformational-verification-of-quicksort-2008.02934"/></url>
<url><loc>https://scifaro.com/en/abs/distilling-programs-to-prove-termination-2008.02936</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distilling-programs-to-prove-termination-2008.02936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distilling-programs-to-prove-termination-2008.02936"/></url>
<url><loc>https://scifaro.com/en/abs/competition-report-chc-comp-20-2008.02939</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/competition-report-chc-comp-20-2008.02939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/competition-report-chc-comp-20-2008.02939"/></url>
<url><loc>https://scifaro.com/en/abs/gluing-resource-proof-structures-inhabitation-and-inverting-the-taylor-expansion-2008.03103</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gluing-resource-proof-structures-inhabitation-and-inverting-the-taylor-expansion-2008.03103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gluing-resource-proof-structures-inhabitation-and-inverting-the-taylor-expansion-2008.03103"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-constraint-satisfaction-problems-symmetrically-2008.03115</loc><lastmod>2020-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-constraint-satisfaction-problems-symmetrically-2008.03115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-constraint-satisfaction-problems-symmetrically-2008.03115"/></url>
<url><loc>https://scifaro.com/en/abs/craig-interpolation-with-clausal-first-order-tableaux-2008.03489</loc><lastmod>2021-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/craig-interpolation-with-clausal-first-order-tableaux-2008.03489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/craig-interpolation-with-clausal-first-order-tableaux-2008.03489"/></url>
<url><loc>https://scifaro.com/en/abs/the-new-normal-we-cannot-eliminate-cuts-in-coinductive-calculi-but-we-can-explore-them-2008.03714</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-new-normal-we-cannot-eliminate-cuts-in-coinductive-calculi-but-we-can-explore-them-2008.03714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-new-normal-we-cannot-eliminate-cuts-in-coinductive-calculi-but-we-can-explore-them-2008.03714"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-safe-coalition-strategies-2008.03770</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-safe-coalition-strategies-2008.03770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-safe-coalition-strategies-2008.03770"/></url>
<url><loc>https://scifaro.com/en/abs/switss-computing-small-witnessing-subsystems-2008.04049</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/switss-computing-small-witnessing-subsystems-2008.04049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/switss-computing-small-witnessing-subsystems-2008.04049"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-maintenance-of-overgrounded-logic-programs-with-tailored-simplifications-2008.04108</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-maintenance-of-overgrounded-logic-programs-with-tailored-simplifications-2008.04108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-maintenance-of-overgrounded-logic-programs-with-tailored-simplifications-2008.04108"/></url>
<url><loc>https://scifaro.com/en/abs/proof-carrying-plans-a-resource-logic-for-ai-planning-2008.04165</loc><lastmod>2020-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-carrying-plans-a-resource-logic-for-ai-planning-2008.04165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-carrying-plans-a-resource-logic-for-ai-planning-2008.04165"/></url>
<url><loc>https://scifaro.com/en/abs/on-a-recipe-for-quantum-graphical-languages-2008.04193</loc><lastmod>2020-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-a-recipe-for-quantum-graphical-languages-2008.04193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-a-recipe-for-quantum-graphical-languages-2008.04193"/></url>
<url><loc>https://scifaro.com/en/abs/from-quasi-dominions-to-progress-measures-2008.04232</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-quasi-dominions-to-progress-measures-2008.04232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-quasi-dominions-to-progress-measures-2008.04232"/></url>
<url><loc>https://scifaro.com/en/abs/upper-approximating-probabilities-of-convergence-in-probabilistic-coherence-spaces-2008.04534</loc><lastmod>2020-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/upper-approximating-probabilities-of-convergence-in-probabilistic-coherence-spaces-2008.04534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/upper-approximating-probabilities-of-convergence-in-probabilistic-coherence-spaces-2008.04534"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-verification-of-concurrent-stochastic-systems-2008.04613</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-verification-of-concurrent-stochastic-systems-2008.04613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-verification-of-concurrent-stochastic-systems-2008.04613"/></url>
<url><loc>https://scifaro.com/en/abs/on-uniformly-sampling-traces-of-a-transition-system-extended-version-2008.05102</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-uniformly-sampling-traces-of-a-transition-system-extended-version-2008.05102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-uniformly-sampling-traces-of-a-transition-system-extended-version-2008.05102"/></url>
<url><loc>https://scifaro.com/en/abs/automated-temporal-equilibrium-analysis-verification-and-synthesis-of-multi-player-games-2008.05638</loc><lastmod>2020-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-temporal-equilibrium-analysis-verification-and-synthesis-of-multi-player-games-2008.05638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-temporal-equilibrium-analysis-verification-and-synthesis-of-multi-player-games-2008.05638"/></url>
<url><loc>https://scifaro.com/en/abs/equilibria-for-games-with-combined-qualitative-and-quantitative-objectives-2008.05643</loc><lastmod>2020-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equilibria-for-games-with-combined-qualitative-and-quantitative-objectives-2008.05643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equilibria-for-games-with-combined-qualitative-and-quantitative-objectives-2008.05643"/></url>
<url><loc>https://scifaro.com/en/abs/multi-player-games-with-ldl-goals-over-finite-traces-2008.05647</loc><lastmod>2020-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-player-games-with-ldl-goals-over-finite-traces-2008.05647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-player-games-with-ldl-goals-over-finite-traces-2008.05647"/></url>
<url><loc>https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-2008.05800</loc><lastmod>2021-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-2008.05800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-2008.05800"/></url>
<url><loc>https://scifaro.com/en/abs/partial-orders-residuation-and-first-order-linear-logic-2008.06351</loc><lastmod>2020-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-orders-residuation-and-first-order-linear-logic-2008.06351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-orders-residuation-and-first-order-linear-logic-2008.06351"/></url>
<url><loc>https://scifaro.com/en/abs/induction-models-on-mathbb-n-2008.06410</loc><lastmod>2020-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-models-on-mathbb-n-2008.06410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-models-on-mathbb-n-2008.06410"/></url>
<url><loc>https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-extended-version-2008.06453</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-extended-version-2008.06453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-extended-version-2008.06453"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-property-directed-verified-monitoring-of-signal-temporal-logic-2008.06589</loc><lastmod>2020-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-property-directed-verified-monitoring-of-signal-temporal-logic-2008.06589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-property-directed-verified-monitoring-of-signal-temporal-logic-2008.06589"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-hoare-logic-with-classical-variables-2008.06812</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-hoare-logic-with-classical-variables-2008.06812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-hoare-logic-with-classical-variables-2008.06812"/></url>
<url><loc>https://scifaro.com/en/abs/conjunctive-queries-unique-characterizations-and-exact-learnability-2008.06824</loc><lastmod>2022-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjunctive-queries-unique-characterizations-and-exact-learnability-2008.06824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjunctive-queries-unique-characterizations-and-exact-learnability-2008.06824"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-translation-of-tock-csp-into-timed-automata-2008.06935</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-translation-of-tock-csp-into-timed-automata-2008.06935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-translation-of-tock-csp-into-timed-automata-2008.06935"/></url>
<url><loc>https://scifaro.com/en/abs/a-classical-logic-view-on-a-paraconsistent-logic-2008.07292</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-classical-logic-view-on-a-paraconsistent-logic-2008.07292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-classical-logic-view-on-a-paraconsistent-logic-2008.07292"/></url>
<url><loc>https://scifaro.com/en/abs/the-transpension-type-technical-report-2008.08530</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-transpension-type-technical-report-2008.08530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-transpension-type-technical-report-2008.08530"/></url>
<url><loc>https://scifaro.com/en/abs/transpension-the-right-adjoint-to-the-pi-type-2008.08533</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transpension-the-right-adjoint-to-the-pi-type-2008.08533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transpension-the-right-adjoint-to-the-pi-type-2008.08533"/></url>
<url><loc>https://scifaro.com/en/abs/dpmc-weighted-model-counting-by-dynamic-programming-on-project-join-trees-2008.08748</loc><lastmod>2020-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dpmc-weighted-model-counting-by-dynamic-programming-on-project-join-trees-2008.08748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dpmc-weighted-model-counting-by-dynamic-programming-on-project-join-trees-2008.08748"/></url>
<url><loc>https://scifaro.com/en/abs/a-bunched-logic-for-conditional-independence-2008.09231</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bunched-logic-for-conditional-independence-2008.09231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bunched-logic-for-conditional-independence-2008.09231"/></url>
<url><loc>https://scifaro.com/en/abs/logic-induced-bisimulations-2008.09238</loc><lastmod>2020-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-induced-bisimulations-2008.09238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-induced-bisimulations-2008.09238"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-modelling-molecular-interaction-maps-2008.09546</loc><lastmod>2020-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-modelling-molecular-interaction-maps-2008.09546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-modelling-molecular-interaction-maps-2008.09546"/></url>
<url><loc>https://scifaro.com/en/abs/an-incremental-abstraction-scheme-for-solving-hard-smt-instances-over-bit-vectors-2008.10061</loc><lastmod>2020-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-incremental-abstraction-scheme-for-solving-hard-smt-instances-over-bit-vectors-2008.10061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-incremental-abstraction-scheme-for-solving-hard-smt-instances-over-bit-vectors-2008.10061"/></url>
<url><loc>https://scifaro.com/en/abs/decisiveness-for-countable-mdps-and-insights-for-nplcss-and-pomdps-2008.10426</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decisiveness-for-countable-mdps-and-insights-for-nplcss-and-pomdps-2008.10426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decisiveness-for-countable-mdps-and-insights-for-nplcss-and-pomdps-2008.10426"/></url>
<url><loc>https://scifaro.com/en/abs/rate-equations-for-graphs-2008.11066</loc><lastmod>2020-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rate-equations-for-graphs-2008.11066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rate-equations-for-graphs-2008.11066"/></url>
<url><loc>https://scifaro.com/en/abs/comonadic-semantics-for-guarded-fragments-2008.11094</loc><lastmod>2021-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comonadic-semantics-for-guarded-fragments-2008.11094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comonadic-semantics-for-guarded-fragments-2008.11094"/></url>
<url><loc>https://scifaro.com/en/abs/an-update-on-weihrauch-complexity-and-some-open-questions-2008.11168</loc><lastmod>2020-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-update-on-weihrauch-complexity-and-some-open-questions-2008.11168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-update-on-weihrauch-complexity-and-some-open-questions-2008.11168"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-bisimulation-semantics-for-a-process-algebra-with-time-outs-2008.11499</loc><lastmod>2023-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-bisimulation-semantics-for-a-process-algebra-with-time-outs-2008.11499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-bisimulation-semantics-for-a-process-algebra-with-time-outs-2008.11499"/></url>
<url><loc>https://scifaro.com/en/abs/logic-signed-petri-net-2008.11585</loc><lastmod>2020-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-signed-petri-net-2008.11585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-signed-petri-net-2008.11585"/></url>
<url><loc>https://scifaro.com/en/abs/countdown-games-and-simulation-on-succinct-one-counter-nets-2008.11753</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/countdown-games-and-simulation-on-succinct-one-counter-nets-2008.11753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/countdown-games-and-simulation-on-succinct-one-counter-nets-2008.11753"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-27th-international-workshop-on-expressiveness-in-concurrency-and-17th-workshop-on-structural-operational-semantics-2008.12414</loc><lastmod>2020-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-27th-international-workshop-on-expressiveness-in-concurrency-and-17th-workshop-on-structural-operational-semantics-2008.12414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-27th-international-workshop-on-expressiveness-in-concurrency-and-17th-workshop-on-structural-operational-semantics-2008.12414"/></url>
<url><loc>https://scifaro.com/en/abs/sos-rules-for-equivalences-of-reaction-systems-2008.13016</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sos-rules-for-equivalences-of-reaction-systems-2008.13016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sos-rules-for-equivalences-of-reaction-systems-2008.13016"/></url>
<url><loc>https://scifaro.com/en/abs/divergence-preserving-branching-bisimilarity-2008.13355</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/divergence-preserving-branching-bisimilarity-2008.13355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/divergence-preserving-branching-bisimilarity-2008.13355"/></url>
<url><loc>https://scifaro.com/en/abs/a-process-algebra-with-global-variables-2008.13356</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-process-algebra-with-global-variables-2008.13356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-process-algebra-with-global-variables-2008.13356"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-temporal-logic-2008.13357</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-temporal-logic-2008.13357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-temporal-logic-2008.13357"/></url>
<url><loc>https://scifaro.com/en/abs/incomplete-smt-techniques-for-solving-non-linear-formulas-over-the-integers-2008.13601</loc><lastmod>2020-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incomplete-smt-techniques-for-solving-non-linear-formulas-over-the-integers-2008.13601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incomplete-smt-techniques-for-solving-non-linear-formulas-over-the-integers-2008.13601"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-shacl-shape-containment-through-description-logics-reasoning-extended-version-2008.13603</loc><lastmod>2021-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-shacl-shape-containment-through-description-logics-reasoning-extended-version-2008.13603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-shacl-shape-containment-through-description-logics-reasoning-extended-version-2008.13603"/></url>
<url><loc>https://scifaro.com/en/abs/verifythis-2019-a-program-verification-competition-extended-report-2008.13610</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifythis-2019-a-program-verification-competition-extended-report-2008.13610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifythis-2019-a-program-verification-competition-extended-report-2008.13610"/></url>
<url><loc>https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-2009.00391</loc><lastmod>2020-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-2009.00391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/can-determinism-and-compositionality-coexist-in-rml-2009.00391"/></url>
<url><loc>https://scifaro.com/en/abs/church-s-thesis-and-related-axioms-in-coq-s-type-theory-2009.00416</loc><lastmod>2022-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/church-s-thesis-and-related-axioms-in-coq-s-type-theory-2009.00416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/church-s-thesis-and-related-axioms-in-coq-s-type-theory-2009.00416"/></url>
<url><loc>https://scifaro.com/en/abs/a-deontic-logic-analysis-of-autonomous-systems-safety-2009.00738</loc><lastmod>2020-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deontic-logic-analysis-of-autonomous-systems-safety-2009.00738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deontic-logic-analysis-of-autonomous-systems-safety-2009.00738"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-reasoning-with-global-assumptions-in-arithmetic-modal-logics-2009.00971</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-reasoning-with-global-assumptions-in-arithmetic-modal-logics-2009.00971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-reasoning-with-global-assumptions-in-arithmetic-modal-logics-2009.00971"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existence-of-hidden-machines-in-computational-time-hierarchies-2009.01145</loc><lastmod>2020-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existence-of-hidden-machines-in-computational-time-hierarchies-2009.01145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existence-of-hidden-machines-in-computational-time-hierarchies-2009.01145"/></url>
<url><loc>https://scifaro.com/en/abs/a-small-step-approach-to-multi-trace-checking-against-interactions-2009.01777</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-small-step-approach-to-multi-trace-checking-against-interactions-2009.01777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-small-step-approach-to-multi-trace-checking-against-interactions-2009.01777"/></url>
<url><loc>https://scifaro.com/en/abs/internal-infty-categorical-models-of-dependent-type-theory-towards-2ltt-eating-hott-2009.01883</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-infty-categorical-models-of-dependent-type-theory-towards-2ltt-eating-hott-2009.01883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-infty-categorical-models-of-dependent-type-theory-towards-2ltt-eating-hott-2009.01883"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-construction-of-explosive-relation-algebras-2009.02720</loc><lastmod>2020-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-construction-of-explosive-relation-algebras-2009.02720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-construction-of-explosive-relation-algebras-2009.02720"/></url>
<url><loc>https://scifaro.com/en/abs/ambiguity-hierarchy-of-regular-infinite-tree-languages-2009.02985</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ambiguity-hierarchy-of-regular-infinite-tree-languages-2009.02985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ambiguity-hierarchy-of-regular-infinite-tree-languages-2009.02985"/></url>
<url><loc>https://scifaro.com/en/abs/on-principal-types-and-well-foundedness-of-the-cummulativity-relation-in-ecc-2009.03486</loc><lastmod>2021-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-principal-types-and-well-foundedness-of-the-cummulativity-relation-in-ecc-2009.03486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-principal-types-and-well-foundedness-of-the-cummulativity-relation-in-ecc-2009.03486"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-control-state-choreographies-2009.03623</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-control-state-choreographies-2009.03623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-control-state-choreographies-2009.03623"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-in-polylogarithmic-time-and-space-2009.04259</loc><lastmod>2020-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-in-polylogarithmic-time-and-space-2009.04259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-in-polylogarithmic-time-and-space-2009.04259"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-run-to-completion-controllers-for-discrete-event-systems-2009.05554</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-run-to-completion-controllers-for-discrete-event-systems-2009.05554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-run-to-completion-controllers-for-discrete-event-systems-2009.05554"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-composition-of-propositional-logic-programs-2009.05774</loc><lastmod>2023-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-composition-of-propositional-logic-programs-2009.05774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-composition-of-propositional-logic-programs-2009.05774"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-applied-category-theory-2019-2009.06334</loc><lastmod>2020-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-applied-category-theory-2019-2009.06334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-applied-category-theory-2019-2009.06334"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-game-theory-with-mixed-strategies-probabilistic-open-games-using-a-distributive-law-2009.06831</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-game-theory-with-mixed-strategies-probabilistic-open-games-using-a-distributive-law-2009.06831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-game-theory-with-mixed-strategies-probabilistic-open-games-using-a-distributive-law-2009.06831"/></url>
<url><loc>https://scifaro.com/en/abs/topos-semantics-for-a-higher-order-temporal-logic-of-actions-2009.06834</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/topos-semantics-for-a-higher-order-temporal-logic-of-actions-2009.06834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/topos-semantics-for-a-higher-order-temporal-logic-of-actions-2009.06834"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagrams-for-regular-logic-extended-abstract-2009.06836</loc><lastmod>2020-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagrams-for-regular-logic-extended-abstract-2009.06836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagrams-for-regular-logic-extended-abstract-2009.06836"/></url>
<url><loc>https://scifaro.com/en/abs/finite-representability-of-semigroups-with-demonic-refinement-2009.06970</loc><lastmod>2021-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-representability-of-semigroups-with-demonic-refinement-2009.06970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-representability-of-semigroups-with-demonic-refinement-2009.06970"/></url>
<url><loc>https://scifaro.com/en/abs/faster-property-testers-in-a-variation-of-the-bounded-degree-model-2009.07770</loc><lastmod>2020-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faster-property-testers-in-a-variation-of-the-bounded-degree-model-2009.07770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faster-property-testers-in-a-variation-of-the-bounded-degree-model-2009.07770"/></url>
<url><loc>https://scifaro.com/en/abs/towards-refinable-choreographies-2009.07991</loc><lastmod>2020-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-refinable-choreographies-2009.07991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-refinable-choreographies-2009.07991"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-36th-international-conference-on-logic-programming-technical-communications-2009.09158</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-36th-international-conference-on-logic-programming-technical-communications-2009.09158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-36th-international-conference-on-logic-programming-technical-communications-2009.09158"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-international-symposium-on-games-automata-logics-and-formal-verification-2009.09360</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-international-symposium-on-games-automata-logics-and-formal-verification-2009.09360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-international-symposium-on-games-automata-logics-and-formal-verification-2009.09360"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-2009.09541</loc><lastmod>2021-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-2009.09541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-2009.09541"/></url>
<url><loc>https://scifaro.com/en/abs/answering-counting-queries-over-dl-lite-ontologies-2009.09801</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answering-counting-queries-over-dl-lite-ontologies-2009.09801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answering-counting-queries-over-dl-lite-ontologies-2009.09801"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-intrinsic-redundancy-in-huge-natural-deduction-proofs-ii-analysing-m-imply-super-polynomial-proofs-2009.09802</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-intrinsic-redundancy-in-huge-natural-deduction-proofs-ii-analysing-m-imply-super-polynomial-proofs-2009.09802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-intrinsic-redundancy-in-huge-natural-deduction-proofs-ii-analysing-m-imply-super-polynomial-proofs-2009.09802"/></url>
<url><loc>https://scifaro.com/en/abs/shacl-satisfiability-and-containment-extended-paper-2009.09806</loc><lastmod>2020-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shacl-satisfiability-and-containment-extended-paper-2009.09806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shacl-satisfiability-and-containment-extended-paper-2009.09806"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-hierarchical-system-with-operads-2009.09848</loc><lastmod>2020-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-hierarchical-system-with-operads-2009.09848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-hierarchical-system-with-operads-2009.09848"/></url>
<url><loc>https://scifaro.com/en/abs/model-guided-synthesis-of-inductive-lemmas-for-fol-with-least-fixpoints-2009.10207</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-guided-synthesis-of-inductive-lemmas-for-fol-with-least-fixpoints-2009.10207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-guided-synthesis-of-inductive-lemmas-for-fol-with-least-fixpoints-2009.10207"/></url>
<url><loc>https://scifaro.com/en/abs/justifications-for-goal-directed-constraint-answer-set-programming-2009.10238</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justifications-for-goal-directed-constraint-answer-set-programming-2009.10238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justifications-for-goal-directed-constraint-answer-set-programming-2009.10238"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-theorems-in-implicational-linear-logic-declaratively-2009.10241</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-theorems-in-implicational-linear-logic-declaratively-2009.10241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-theorems-in-implicational-linear-logic-declaratively-2009.10241"/></url>
<url><loc>https://scifaro.com/en/abs/burden-of-persuasion-in-argumentation-2009.10244</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/burden-of-persuasion-in-argumentation-2009.10244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/burden-of-persuasion-in-argumentation-2009.10244"/></url>
<url><loc>https://scifaro.com/en/abs/sequent-type-calculi-for-systems-of-nonmonotonic-paraconsistent-logics-2009.10246</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequent-type-calculi-for-systems-of-nonmonotonic-paraconsistent-logics-2009.10246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequent-type-calculi-for-systems-of-nonmonotonic-paraconsistent-logics-2009.10246"/></url>
<url><loc>https://scifaro.com/en/abs/enhancing-linear-algebraic-computation-of-logic-programs-using-sparse-representation-2009.10247</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enhancing-linear-algebraic-computation-of-logic-programs-using-sparse-representation-2009.10247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enhancing-linear-algebraic-computation-of-logic-programs-using-sparse-representation-2009.10247"/></url>
<url><loc>https://scifaro.com/en/abs/lp2pb-translating-answer-set-programs-into-pseudo-boolean-theories-2009.10248</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lp2pb-translating-answer-set-programs-into-pseudo-boolean-theories-2009.10248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lp2pb-translating-answer-set-programs-into-pseudo-boolean-theories-2009.10248"/></url>
<url><loc>https://scifaro.com/en/abs/learning-concepts-described-by-weight-aggregation-logic-2009.10574</loc><lastmod>2020-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-concepts-described-by-weight-aggregation-logic-2009.10574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-concepts-described-by-weight-aggregation-logic-2009.10574"/></url>
<url><loc>https://scifaro.com/en/abs/ltlf-synthesis-under-partial-observability-from-theory-to-practice-2009.10875</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltlf-synthesis-under-partial-observability-from-theory-to-practice-2009.10875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltlf-synthesis-under-partial-observability-from-theory-to-practice-2009.10875"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-parity-game-solvers-that-yield-winning-strategies-2009.10876</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-parity-game-solvers-that-yield-winning-strategies-2009.10876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-parity-game-solvers-that-yield-winning-strategies-2009.10876"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-execution-model-counting-entropy-maximization-automatic-search-synthesis-2009.10877</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-execution-model-counting-entropy-maximization-automatic-search-synthesis-2009.10877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-execution-model-counting-entropy-maximization-automatic-search-synthesis-2009.10877"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-theoretical-semantics-for-logics-of-nonsense-2009.10878</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-theoretical-semantics-for-logics-of-nonsense-2009.10878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-theoretical-semantics-for-logics-of-nonsense-2009.10878"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-game-theoretic-semantics-for-modal-mu-calculus-and-some-variants-2009.10880</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-game-theoretic-semantics-for-modal-mu-calculus-and-some-variants-2009.10880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-game-theoretic-semantics-for-modal-mu-calculus-and-some-variants-2009.10880"/></url>
<url><loc>https://scifaro.com/en/abs/local-higher-order-fixpoint-iteration-2009.10881</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-higher-order-fixpoint-iteration-2009.10881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-higher-order-fixpoint-iteration-2009.10881"/></url>
<url><loc>https://scifaro.com/en/abs/ltlf-synthesis-on-probabilistic-systems-2009.10883</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltlf-synthesis-on-probabilistic-systems-2009.10883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltlf-synthesis-on-probabilistic-systems-2009.10883"/></url>
<url><loc>https://scifaro.com/en/abs/behavioral-specification-theories-an-algebraic-taxonomy-2009.11011</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioral-specification-theories-an-algebraic-taxonomy-2009.11011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioral-specification-theories-an-algebraic-taxonomy-2009.11011"/></url>
<url><loc>https://scifaro.com/en/abs/variant-based-equational-unification-under-constructor-symbols-2009.11070</loc><lastmod>2020-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variant-based-equational-unification-under-constructor-symbols-2009.11070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variant-based-equational-unification-under-constructor-symbols-2009.11070"/></url>
<url><loc>https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-classes-of-bounded-degree-2009.11758</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-classes-of-bounded-degree-2009.11758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/successor-invariant-first-order-logic-on-classes-of-bounded-degree-2009.11758"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebra-of-non-deterministic-programs-demonic-operators-orders-and-axioms-2009.12081</loc><lastmod>2021-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebra-of-non-deterministic-programs-demonic-operators-orders-and-axioms-2009.12081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebra-of-non-deterministic-programs-demonic-operators-orders-and-axioms-2009.12081"/></url>
<url><loc>https://scifaro.com/en/abs/emergence-of-complex-data-from-simple-local-rules-in-a-network-game-2009.12210</loc><lastmod>2020-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/emergence-of-complex-data-from-simple-local-rules-in-a-network-game-2009.12210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/emergence-of-complex-data-from-simple-local-rules-in-a-network-game-2009.12210"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-sixteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2009.12521</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-sixteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2009.12521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-sixteenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2009.12521"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-hidden-markov-models-with-continuous-observations-2009.12978</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-hidden-markov-models-with-continuous-observations-2009.12978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-hidden-markov-models-with-continuous-observations-2009.12978"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-theorems-for-non-transitive-relations-2009.13065</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-theorems-for-non-transitive-relations-2009.13065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-theorems-for-non-transitive-relations-2009.13065"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-reachability-in-parametric-markov-decision-processes-2009.13128</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-reachability-in-parametric-markov-decision-processes-2009.13128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-reachability-in-parametric-markov-decision-processes-2009.13128"/></url>
<url><loc>https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-full-version-2009.13152</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-full-version-2009.13152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decisiveness-of-stochastic-systems-and-its-application-to-hybrid-models-full-version-2009.13152"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-for-updatable-timed-automata-made-faster-and-more-effective-2009.13260</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-for-updatable-timed-automata-made-faster-and-more-effective-2009.13260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-for-updatable-timed-automata-made-faster-and-more-effective-2009.13260"/></url>
<url><loc>https://scifaro.com/en/abs/the-probabilistic-description-logic-mathcal-balc-2009.13407</loc><lastmod>2020-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-probabilistic-description-logic-mathcal-balc-2009.13407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-probabilistic-description-logic-mathcal-balc-2009.13407"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-synthesis-with-safety-properties-2009.13459</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-synthesis-with-safety-properties-2009.13459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-synthesis-with-safety-properties-2009.13459"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-arithmetic-rtl-translating-verilog-to-c-to-acl2-2009.13761</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-arithmetic-rtl-translating-verilog-to-c-to-acl2-2009.13761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-arithmetic-rtl-translating-verilog-to-c-to-acl2-2009.13761"/></url>
<url><loc>https://scifaro.com/en/abs/iteration-in-acl2-2009.13762</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iteration-in-acl2-2009.13762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iteration-in-acl2-2009.13762"/></url>
<url><loc>https://scifaro.com/en/abs/new-rewriter-features-in-fgl-2009.13763</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/new-rewriter-features-in-fgl-2009.13763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/new-rewriter-features-in-fgl-2009.13763"/></url>
<url><loc>https://scifaro.com/en/abs/computing-and-proving-well-founded-orderings-through-finite-abstractions-2009.13764</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-and-proving-well-founded-orderings-through-finite-abstractions-2009.13764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-and-proving-well-founded-orderings-through-finite-abstractions-2009.13764"/></url>
<url><loc>https://scifaro.com/en/abs/rp-rewriter-an-optimized-rewriter-for-large-terms-in-acl2-2009.13765</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rp-rewriter-an-optimized-rewriter-for-large-terms-in-acl2-2009.13765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rp-rewriter-an-optimized-rewriter-for-large-terms-in-acl2-2009.13765"/></url>
<url><loc>https://scifaro.com/en/abs/quadratic-extensions-in-acl2-2009.13766</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadratic-extensions-in-acl2-2009.13766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadratic-extensions-in-acl2-2009.13766"/></url>
<url><loc>https://scifaro.com/en/abs/generating-mutually-inductive-theorems-from-concise-descriptions-2009.13767</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-mutually-inductive-theorems-from-concise-descriptions-2009.13767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-mutually-inductive-theorems-from-concise-descriptions-2009.13767"/></url>
<url><loc>https://scifaro.com/en/abs/ethereum-s-recursive-length-prefix-in-acl2-2009.13769</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ethereum-s-recursive-length-prefix-in-acl2-2009.13769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ethereum-s-recursive-length-prefix-in-acl2-2009.13769"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphic-data-type-transformations-2009.13771</loc><lastmod>2020-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphic-data-type-transformations-2009.13771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphic-data-type-transformations-2009.13771"/></url>
<url><loc>https://scifaro.com/en/abs/implementing-hybrid-semantics-from-functional-to-imperative-2009.14322</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementing-hybrid-semantics-from-functional-to-imperative-2009.14322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementing-hybrid-semantics-from-functional-to-imperative-2009.14322"/></url>
<url><loc>https://scifaro.com/en/abs/a-theoretical-study-of-full-tabled-constraint-logic-programming-2009.14430</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theoretical-study-of-full-tabled-constraint-logic-programming-2009.14430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theoretical-study-of-full-tabled-constraint-logic-programming-2009.14430"/></url>
<url><loc>https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-the-bi-intuitionistic-logic-2int-2009.14787</loc><lastmod>2020-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-the-bi-intuitionistic-logic-2int-2009.14787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cut-free-sequent-calculus-for-the-bi-intuitionistic-logic-2int-2009.14787"/></url>
<url><loc>https://scifaro.com/en/abs/erratum-to-frequency-linear-time-temporal-logic-2010.00296</loc><lastmod>2020-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/erratum-to-frequency-linear-time-temporal-logic-2010.00296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/erratum-to-frequency-linear-time-temporal-logic-2010.00296"/></url>
<url><loc>https://scifaro.com/en/abs/a-recursion-theoretic-foundation-of-computation-over-real-numbers-2010.00791</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-recursion-theoretic-foundation-of-computation-over-real-numbers-2010.00791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-recursion-theoretic-foundation-of-computation-over-real-numbers-2010.00791"/></url>
<url><loc>https://scifaro.com/en/abs/combining-weak-distributive-laws-application-to-up-to-techniques-2010.00811</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-weak-distributive-laws-application-to-up-to-techniques-2010.00811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-weak-distributive-laws-application-to-up-to-techniques-2010.00811"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-boolean-state-separation-technical-report-2010.00825</loc><lastmod>2020-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-boolean-state-separation-technical-report-2010.00825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-boolean-state-separation-technical-report-2010.00825"/></url>
<url><loc>https://scifaro.com/en/abs/are-two-binary-operators-necessary-to-obtain-a-finite-axiomatisation-of-parallel-composition-2010.01943</loc><lastmod>2022-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-two-binary-operators-necessary-to-obtain-a-finite-axiomatisation-of-parallel-composition-2010.01943"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-two-binary-operators-necessary-to-obtain-a-finite-axiomatisation-of-parallel-composition-2010.01943"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-analysis-of-tree-share-structure-2010.02340</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-analysis-of-tree-share-structure-2010.02340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-analysis-of-tree-share-structure-2010.02340"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-ring-of-witt-vectors-2010.02595</loc><lastmod>2020-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-ring-of-witt-vectors-2010.02595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-ring-of-witt-vectors-2010.02595"/></url>
<url><loc>https://scifaro.com/en/abs/zx-calculus-and-extended-hypergraph-rewriting-systems-i-a-multiway-approach-to-categorical-quantum-information-theory-2010.02752</loc><lastmod>2020-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zx-calculus-and-extended-hypergraph-rewriting-systems-i-a-multiway-approach-to-categorical-quantum-information-theory-2010.02752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zx-calculus-and-extended-hypergraph-rewriting-systems-i-a-multiway-approach-to-categorical-quantum-information-theory-2010.02752"/></url>
<url><loc>https://scifaro.com/en/abs/tight-polynomial-bounds-for-loop-programs-in-polynomial-space-2010.02823</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tight-polynomial-bounds-for-loop-programs-in-polynomial-space-2010.02823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tight-polynomial-bounds-for-loop-programs-in-polynomial-space-2010.02823"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-query-evaluation-over-structures-with-low-degree-2010.02982</loc><lastmod>2020-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-query-evaluation-over-structures-with-low-degree-2010.02982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-query-evaluation-over-structures-with-low-degree-2010.02982"/></url>
<url><loc>https://scifaro.com/en/abs/qctl-model-checking-with-qbf-solvers-2010.03185</loc><lastmod>2020-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qctl-model-checking-with-qbf-solvers-2010.03185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qctl-model-checking-with-qbf-solvers-2010.03185"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-temporal-logic-with-team-semantics-expressivity-and-complexity-2010.03311</loc><lastmod>2021-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-temporal-logic-with-team-semantics-expressivity-and-complexity-2010.03311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-temporal-logic-with-team-semantics-expressivity-and-complexity-2010.03311"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-shielding-under-uncertainty-2010.03842</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-shielding-under-uncertainty-2010.03842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-shielding-under-uncertainty-2010.03842"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-computation-in-cyclic-petri-nets-2010.04000</loc><lastmod>2020-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-computation-in-cyclic-petri-nets-2010.04000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-computation-in-cyclic-petri-nets-2010.04000"/></url>
<url><loc>https://scifaro.com/en/abs/igloo-soundly-linking-compositional-refinement-and-separation-logic-for-distributed-system-verification-2010.04749</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/igloo-soundly-linking-compositional-refinement-and-separation-logic-for-distributed-system-verification-2010.04749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/igloo-soundly-linking-compositional-refinement-and-separation-logic-for-distributed-system-verification-2010.04749"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-satisfaction-problems-over-finite-structures-2010.04958</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-over-finite-structures-2010.04958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-satisfaction-problems-over-finite-structures-2010.04958"/></url>
<url><loc>https://scifaro.com/en/abs/cuv-ee-blending-smt-lib-with-programs-and-weakest-preconditions-2010.05023</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cuv-ee-blending-smt-lib-with-programs-and-weakest-preconditions-2010.05023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cuv-ee-blending-smt-lib-with-programs-and-weakest-preconditions-2010.05023"/></url>
<url><loc>https://scifaro.com/en/abs/datalog-expressibility-for-monadic-and-guarded-second-order-logic-2010.05677</loc><lastmod>2025-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/datalog-expressibility-for-monadic-and-guarded-second-order-logic-2010.05677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/datalog-expressibility-for-monadic-and-guarded-second-order-logic-2010.05677"/></url>
<url><loc>https://scifaro.com/en/abs/some-classical-model-theoretic-aspects-of-bounded-shrub-depth-classes-2010.05799</loc><lastmod>2020-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-classical-model-theoretic-aspects-of-bounded-shrub-depth-classes-2010.05799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-classical-model-theoretic-aspects-of-bounded-shrub-depth-classes-2010.05799"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-approach-to-loop-verification-with-invariants-and-summaries-2010.05812</loc><lastmod>2021-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-approach-to-loop-verification-with-invariants-and-summaries-2010.05812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-approach-to-loop-verification-with-invariants-and-summaries-2010.05812"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-recursion-schemes-and-collapsible-pushdown-automata-logical-properties-2010.06366</loc><lastmod>2021-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-recursion-schemes-and-collapsible-pushdown-automata-logical-properties-2010.06366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-recursion-schemes-and-collapsible-pushdown-automata-logical-properties-2010.06366"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-expected-runtimes-of-probabilistic-integer-programs-using-expected-sizes-2010.06367</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-expected-runtimes-of-probabilistic-integer-programs-using-expected-sizes-2010.06367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-expected-runtimes-of-probabilistic-integer-programs-using-expected-sizes-2010.06367"/></url>
<url><loc>https://scifaro.com/en/abs/relating-structure-and-power-extended-version-2010.06496</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-structure-and-power-extended-version-2010.06496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-structure-and-power-extended-version-2010.06496"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-and-amalgamation-for-arrays-with-maxdiff-extended-version-2010.07082</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-and-amalgamation-for-arrays-with-maxdiff-extended-version-2010.07082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-and-amalgamation-for-arrays-with-maxdiff-extended-version-2010.07082"/></url>
<url><loc>https://scifaro.com/en/abs/an-smt-solver-for-regular-expressions-and-linear-arithmetic-over-string-length-2010.07253</loc><lastmod>2021-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-smt-solver-for-regular-expressions-and-linear-arithmetic-over-string-length-2010.07253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-smt-solver-for-regular-expressions-and-linear-arithmetic-over-string-length-2010.07253"/></url>
<url><loc>https://scifaro.com/en/abs/a-spatial-model-checker-in-gpu-extended-version-2010.07284</loc><lastmod>2020-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spatial-model-checker-in-gpu-extended-version-2010.07284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spatial-model-checker-in-gpu-extended-version-2010.07284"/></url>
<url><loc>https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-2010.07800</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-2010.07800"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-separation-logic-to-verify-termination-of-busy-waiting-for-abrupt-program-exit-2010.07800"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-to-the-ranks-efficient-rank-based-b-u-chi-automata-complementation-technical-report-2010.07834</loc><lastmod>2021-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-to-the-ranks-efficient-rank-based-b-u-chi-automata-complementation-technical-report-2010.07834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-to-the-ranks-efficient-rank-based-b-u-chi-automata-complementation-technical-report-2010.07834"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-congruence-criteria-for-weak-bisimilarity-2010.07899</loc><lastmod>2021-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-congruence-criteria-for-weak-bisimilarity-2010.07899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-congruence-criteria-for-weak-bisimilarity-2010.07899"/></url>
<url><loc>https://scifaro.com/en/abs/directed-reachability-for-infinite-state-systems-2010.07912</loc><lastmod>2020-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-reachability-for-infinite-state-systems-2010.07912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-reachability-for-infinite-state-systems-2010.07912"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-semantics-of-cyber-physical-systems-theory-2010.08003</loc><lastmod>2021-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-semantics-of-cyber-physical-systems-theory-2010.08003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-semantics-of-cyber-physical-systems-theory-2010.08003"/></url>
<url><loc>https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-2010.08230</loc><lastmod>2021-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-2010.08230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-2010.08230"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-process-histories-and-resource-transducers-2010.08233</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-process-histories-and-resource-transducers-2010.08233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-process-histories-and-resource-transducers-2010.08233"/></url>
<url><loc>https://scifaro.com/en/abs/general-semantic-construction-of-dependent-refinement-type-systems-categorically-2010.08280</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-semantic-construction-of-dependent-refinement-type-systems-categorically-2010.08280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-semantic-construction-of-dependent-refinement-type-systems-categorically-2010.08280"/></url>
<url><loc>https://scifaro.com/en/abs/a-symmetric-attractor-decomposition-lifting-algorithm-for-parity-games-2010.08288</loc><lastmod>2020-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symmetric-attractor-decomposition-lifting-algorithm-for-parity-games-2010.08288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symmetric-attractor-decomposition-lifting-algorithm-for-parity-games-2010.08288"/></url>
<url><loc>https://scifaro.com/en/abs/a-foundation-for-ledger-structures-2010.08337</loc><lastmod>2021-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-foundation-for-ledger-structures-2010.08337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-foundation-for-ledger-structures-2010.08337"/></url>
<url><loc>https://scifaro.com/en/abs/focused-proof-search-in-the-logic-of-bunched-implications-2010.08352</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focused-proof-search-in-the-logic-of-bunched-implications-2010.08352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focused-proof-search-in-the-logic-of-bunched-implications-2010.08352"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-to-quantify-approximate-simulation-on-graph-data-2010.08938</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-to-quantify-approximate-simulation-on-graph-data-2010.08938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-to-quantify-approximate-simulation-on-graph-data-2010.08938"/></url>
<url><loc>https://scifaro.com/en/abs/finding-cut-offs-in-leaderless-rendez-vous-protocols-is-easy-2010.09471</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-cut-offs-in-leaderless-rendez-vous-protocols-is-easy-2010.09471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-cut-offs-in-leaderless-rendez-vous-protocols-is-easy-2010.09471"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parallel-composition-for-true-concurrency-2010.09645</loc><lastmod>2020-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parallel-composition-for-true-concurrency-2010.09645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parallel-composition-for-true-concurrency-2010.09645"/></url>
<url><loc>https://scifaro.com/en/abs/the-computational-inevitability-of-life-self-replication-under-resource-bounded-nested-algorithmic-probability-2010.09646</loc><lastmod>2026-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-computational-inevitability-of-life-self-replication-under-resource-bounded-nested-algorithmic-probability-2010.09646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-computational-inevitability-of-life-self-replication-under-resource-bounded-nested-algorithmic-probability-2010.09646"/></url>
<url><loc>https://scifaro.com/en/abs/isotropy-and-combination-problems-2010.09821</loc><lastmod>2020-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isotropy-and-combination-problems-2010.09821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isotropy-and-combination-problems-2010.09821"/></url>
<url><loc>https://scifaro.com/en/abs/on-finite-and-unrestricted-query-entailment-beyond-sq-with-number-restrictions-on-transitive-roles-2010.11503</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-finite-and-unrestricted-query-entailment-beyond-sq-with-number-restrictions-on-transitive-roles-2010.11503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-finite-and-unrestricted-query-entailment-beyond-sq-with-number-restrictions-on-transitive-roles-2010.11503"/></url>
<url><loc>https://scifaro.com/en/abs/automata-and-fixpoints-for-asynchronous-hyperproperties-2010.11605</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-and-fixpoints-for-asynchronous-hyperproperties-2010.11605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-and-fixpoints-for-asynchronous-hyperproperties-2010.11605"/></url>
<url><loc>https://scifaro.com/en/abs/ghost-signals-verifying-termination-of-busy-waiting-extended-version-2010.11762</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ghost-signals-verifying-termination-of-busy-waiting-extended-version-2010.11762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ghost-signals-verifying-termination-of-busy-waiting-extended-version-2010.11762"/></url>
<url><loc>https://scifaro.com/en/abs/containment-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-2010.11842</loc><lastmod>2020-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/containment-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-2010.11842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/containment-in-monadic-disjunctive-datalog-mmsnp-and-expressive-description-logics-2010.11842"/></url>
<url><loc>https://scifaro.com/en/abs/canonization-for-bounded-and-dihedral-color-classes-in-choiceless-polynomial-time-2010.12182</loc><lastmod>2020-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonization-for-bounded-and-dihedral-color-classes-in-choiceless-polynomial-time-2010.12182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonization-for-bounded-and-dihedral-color-classes-in-choiceless-polynomial-time-2010.12182"/></url>
<url><loc>https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-fully-dependent-cc-omega-2010.12504</loc><lastmod>2020-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-fully-dependent-cc-omega-2010.12504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intuitionistic-set-theoretical-model-of-fully-dependent-cc-omega-2010.12504"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-and-positive-almost-sure-termination-2010.12689</loc><lastmod>2020-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-and-positive-almost-sure-termination-2010.12689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-and-positive-almost-sure-termination-2010.12689"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-b-uchi-arithmetic-2010.12892</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-b-uchi-arithmetic-2010.12892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-b-uchi-arithmetic-2010.12892"/></url>
<url><loc>https://scifaro.com/en/abs/deductive-stability-proofs-for-ordinary-differential-equations-2010.13096</loc><lastmod>2022-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deductive-stability-proofs-for-ordinary-differential-equations-2010.13096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deductive-stability-proofs-for-ordinary-differential-equations-2010.13096"/></url>
<url><loc>https://scifaro.com/en/abs/graded-modal-dependent-type-theory-2010.13163</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-modal-dependent-type-theory-2010.13163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-modal-dependent-type-theory-2010.13163"/></url>
<url><loc>https://scifaro.com/en/abs/whither-semantics-2010.13328</loc><lastmod>2020-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/whither-semantics-2010.13328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/whither-semantics-2010.13328"/></url>
<url><loc>https://scifaro.com/en/abs/multi-objective-optimization-of-long-run-average-and-total-rewards-2010.13566</loc><lastmod>2021-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-objective-optimization-of-long-run-average-and-total-rewards-2010.13566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-objective-optimization-of-long-run-average-and-total-rewards-2010.13566"/></url>
<url><loc>https://scifaro.com/en/abs/precise-subtyping-for-asynchronous-multiparty-sessions-2010.13925</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/precise-subtyping-for-asynchronous-multiparty-sessions-2010.13925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/precise-subtyping-for-asynchronous-multiparty-sessions-2010.13925"/></url>
<url><loc>https://scifaro.com/en/abs/client-server-sessions-in-linear-logic-2010.13926</loc><lastmod>2021-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/client-server-sessions-in-linear-logic-2010.13926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/client-server-sessions-in-linear-logic-2010.13926"/></url>
<url><loc>https://scifaro.com/en/abs/coherence-of-strict-equalities-in-dependent-type-theories-2010.14166</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherence-of-strict-equalities-in-dependent-type-theories-2010.14166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherence-of-strict-equalities-in-dependent-type-theories-2010.14166"/></url>
<url><loc>https://scifaro.com/en/abs/size-matters-in-the-modal-mu-calculus-2010.14430</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/size-matters-in-the-modal-mu-calculus-2010.14430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/size-matters-in-the-modal-mu-calculus-2010.14430"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-omega-regular-properties-on-linear-recurrence-sequences-2010.14432</loc><lastmod>2020-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-omega-regular-properties-on-linear-recurrence-sequences-2010.14432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-omega-regular-properties-on-linear-recurrence-sequences-2010.14432"/></url>
<url><loc>https://scifaro.com/en/abs/relatively-complete-verification-of-probabilistic-programs-2010.14548</loc><lastmod>2022-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relatively-complete-verification-of-probabilistic-programs-2010.14548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relatively-complete-verification-of-probabilistic-programs-2010.14548"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-extended-version-2010.14549</loc><lastmod>2020-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-extended-version-2010.14549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-extended-version-2010.14549"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-evaluation-of-first-order-counting-queries-2010.14814</loc><lastmod>2020-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-evaluation-of-first-order-counting-queries-2010.14814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-evaluation-of-first-order-counting-queries-2010.14814"/></url>
<url><loc>https://scifaro.com/en/abs/a-cyclic-proof-system-for-hfln-2010.14891</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cyclic-proof-system-for-hfln-2010.14891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cyclic-proof-system-for-hfln-2010.14891"/></url>
<url><loc>https://scifaro.com/en/abs/actris-2-0-asynchronous-session-type-based-reasoning-in-separation-logic-2010.15030</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/actris-2-0-asynchronous-session-type-based-reasoning-in-separation-logic-2010.15030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/actris-2-0-asynchronous-session-type-based-reasoning-in-separation-logic-2010.15030"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-patterns-2010.15596</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-patterns-2010.15596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-patterns-2010.15596"/></url>
<url><loc>https://scifaro.com/en/abs/three-computational-models-and-its-equivalence-2010.15600</loc><lastmod>2021-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/three-computational-models-and-its-equivalence-2010.15600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/three-computational-models-and-its-equivalence-2010.15600"/></url>
<url><loc>https://scifaro.com/en/abs/string-constraints-with-concatenation-and-transducers-solved-efficiently-technical-report-2010.15975</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-constraints-with-concatenation-and-transducers-solved-efficiently-technical-report-2010.15975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-constraints-with-concatenation-and-transducers-solved-efficiently-technical-report-2010.15975"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-interactive-proofs-to-mathematicians-2010.16013</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-interactive-proofs-to-mathematicians-2010.16013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-interactive-proofs-to-mathematicians-2010.16013"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-hol-as-a-meta-language-for-teaching-logic-2010.16014</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-hol-as-a-meta-language-for-teaching-logic-2010.16014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-hol-as-a-meta-language-for-teaching-logic-2010.16014"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-imo-problems-and-solutions-in-isabelle-hol-2010.16015</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-imo-problems-and-solutions-in-isabelle-hol-2010.16015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-imo-problems-and-solutions-in-isabelle-hol-2010.16015"/></url>
<url><loc>https://scifaro.com/en/abs/type-safety-of-rewrite-rules-in-dependent-types-2010.16111</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-safety-of-rewrite-rules-in-dependent-types-2010.16111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-safety-of-rewrite-rules-in-dependent-types-2010.16111"/></url>
<url><loc>https://scifaro.com/en/abs/towards-making-formal-methods-normal-meeting-developers-where-they-are-2010.16345</loc><lastmod>2020-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-making-formal-methods-normal-meeting-developers-where-they-are-2010.16345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-making-formal-methods-normal-meeting-developers-where-they-are-2010.16345"/></url>
<url><loc>https://scifaro.com/en/abs/partial-functions-and-recursion-in-univalent-type-theory-2011.00272</loc><lastmod>2020-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-functions-and-recursion-in-univalent-type-theory-2011.00272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-functions-and-recursion-in-univalent-type-theory-2011.00272"/></url>
<url><loc>https://scifaro.com/en/abs/out-of-control-reducing-probabilistic-models-by-control-state-elimination-2011.00983</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/out-of-control-reducing-probabilistic-models-by-control-state-elimination-2011.00983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/out-of-control-reducing-probabilistic-models-by-control-state-elimination-2011.00983"/></url>
<url><loc>https://scifaro.com/en/abs/mso-undecidability-for-hereditary-classes-of-unbounded-clique-width-2011.02894</loc><lastmod>2023-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mso-undecidability-for-hereditary-classes-of-unbounded-clique-width-2011.02894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mso-undecidability-for-hereditary-classes-of-unbounded-clique-width-2011.02894"/></url>
<url><loc>https://scifaro.com/en/abs/iterated-multiplication-in-vtc-0-2011.03095</loc><lastmod>2022-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iterated-multiplication-in-vtc-0-2011.03095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iterated-multiplication-in-vtc-0-2011.03095"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-differentiation-in-pcf-2011.03335</loc><lastmod>2021-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-differentiation-in-pcf-2011.03335"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-differentiation-in-pcf-2011.03335"/></url>
<url><loc>https://scifaro.com/en/abs/extending-equational-monadic-reasoning-with-monad-transformers-2011.03463</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-equational-monadic-reasoning-with-monad-transformers-2011.03463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-equational-monadic-reasoning-with-monad-transformers-2011.03463"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-temporary-coalitions-and-ltl-definable-ordered-objectives-in-infinite-concurrent-multiplayer-games-2011.03724</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-temporary-coalitions-and-ltl-definable-ordered-objectives-in-infinite-concurrent-multiplayer-games-2011.03724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-temporary-coalitions-and-ltl-definable-ordered-objectives-in-infinite-concurrent-multiplayer-games-2011.03724"/></url>
<url><loc>https://scifaro.com/en/abs/smooth-approximations-and-csps-over-finitely-bounded-homogeneous-structures-2011.03978</loc><lastmod>2021-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smooth-approximations-and-csps-over-finitely-bounded-homogeneous-structures-2011.03978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smooth-approximations-and-csps-over-finitely-bounded-homogeneous-structures-2011.03978"/></url>
<url><loc>https://scifaro.com/en/abs/generating-concurrent-programs-from-sequential-data-structure-knowledge-2011.04045</loc><lastmod>2020-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-concurrent-programs-from-sequential-data-structure-knowledge-2011.04045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-concurrent-programs-from-sequential-data-structure-knowledge-2011.04045"/></url>
<url><loc>https://scifaro.com/en/abs/a-syntactic-approach-to-studying-strongly-equivalent-logic-programs-2011.04454</loc><lastmod>2021-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syntactic-approach-to-studying-strongly-equivalent-logic-programs-2011.04454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syntactic-approach-to-studying-strongly-equivalent-logic-programs-2011.04454"/></url>
<url><loc>https://scifaro.com/en/abs/domain-semirings-united-2011.04704</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-semirings-united-2011.04704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-semirings-united-2011.04704"/></url>
<url><loc>https://scifaro.com/en/abs/session-coalgebras-a-coalgebraic-view-on-session-types-and-communication-protocols-2011.05712</loc><lastmod>2020-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/session-coalgebras-a-coalgebraic-view-on-session-types-and-communication-protocols-2011.05712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/session-coalgebras-a-coalgebraic-view-on-session-types-and-communication-protocols-2011.05712"/></url>
<url><loc>https://scifaro.com/en/abs/functorial-semantics-for-partial-theories-2011.06644</loc><lastmod>2020-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functorial-semantics-for-partial-theories-2011.06644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functorial-semantics-for-partial-theories-2011.06644"/></url>
<url><loc>https://scifaro.com/en/abs/answering-regular-path-queries-over-sq-ontologies-2011.08816</loc><lastmod>2020-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answering-regular-path-queries-over-sq-ontologies-2011.08816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answering-regular-path-queries-over-sq-ontologies-2011.08816"/></url>
<url><loc>https://scifaro.com/en/abs/mixed-nondeterministic-probabilistic-interfaces-2011.09435</loc><lastmod>2020-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mixed-nondeterministic-probabilistic-interfaces-2011.09435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mixed-nondeterministic-probabilistic-interfaces-2011.09435"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-full-higher-order-unification-2011.09507</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-full-higher-order-unification-2011.09507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-full-higher-order-unification-2011.09507"/></url>
<url><loc>https://scifaro.com/en/abs/logics-with-multiteam-semantics-2011.09834</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-with-multiteam-semantics-2011.09834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-with-multiteam-semantics-2011.09834"/></url>
<url><loc>https://scifaro.com/en/abs/learning-languages-with-decidable-hypotheses-2011.09866</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-languages-with-decidable-hypotheses-2011.09866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-languages-with-decidable-hypotheses-2011.09866"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-study-of-the-first-order-version-of-some-implicational-fragments-of-the-three-valued-lukasiewicz-logic-2011.09868</loc><lastmod>2020-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-study-of-the-first-order-version-of-some-implicational-fragments-of-the-three-valued-lukasiewicz-logic-2011.09868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-study-of-the-first-order-version-of-some-implicational-fragments-of-the-three-valued-lukasiewicz-logic-2011.09868"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-models-of-linear-logic-with-fixed-points-of-formulas-2011.10209</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-models-of-linear-logic-with-fixed-points-of-formulas-2011.10209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-models-of-linear-logic-with-fixed-points-of-formulas-2011.10209"/></url>
<url><loc>https://scifaro.com/en/abs/universal-semantics-for-the-stochastic-lambda-calculus-2011.13171</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-semantics-for-the-stochastic-lambda-calculus-2011.13171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-semantics-for-the-stochastic-lambda-calculus-2011.13171"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-non-linear-pattern-matching-automata-2011.13752</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-non-linear-pattern-matching-automata-2011.13752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-non-linear-pattern-matching-automata-2011.13752"/></url>
<url><loc>https://scifaro.com/en/abs/a-deductive-verification-framework-for-higher-order-programs-2011.14044</loc><lastmod>2020-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deductive-verification-framework-for-higher-order-programs-2011.14044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deductive-verification-framework-for-higher-order-programs-2011.14044"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-higher-order-fixpoint-logic-2011.14303</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-higher-order-fixpoint-logic-2011.14303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-higher-order-fixpoint-logic-2011.14303"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-preorders-via-graded-monads-2011.14339</loc><lastmod>2021-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-preorders-via-graded-monads-2011.14339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-preorders-via-graded-monads-2011.14339"/></url>
<url><loc>https://scifaro.com/en/abs/the-difference-lambda-calculus-a-language-for-difference-categories-2011.14476</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-difference-lambda-calculus-a-language-for-difference-categories-2011.14476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-difference-lambda-calculus-a-language-for-difference-categories-2011.14476"/></url>
<url><loc>https://scifaro.com/en/abs/the-costructure-cosemantics-adjunction-for-comodels-for-computational-effects-2011.14520</loc><lastmod>2020-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-costructure-cosemantics-adjunction-for-comodels-for-computational-effects-2011.14520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-costructure-cosemantics-adjunction-for-comodels-for-computational-effects-2011.14520"/></url>
<url><loc>https://scifaro.com/en/abs/multimodal-dependent-type-theory-2011.15021</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multimodal-dependent-type-theory-2011.15021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multimodal-dependent-type-theory-2011.15021"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-operational-representation-of-dependencies-in-event-structures-2012.00118</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-operational-representation-of-dependencies-in-event-structures-2012.00118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-operational-representation-of-dependencies-in-event-structures-2012.00118"/></url>
<url><loc>https://scifaro.com/en/abs/combining-nondeterminism-probability-and-termination-equational-and-metric-reasoning-2012.00382</loc><lastmod>2021-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-nondeterminism-probability-and-termination-equational-and-metric-reasoning-2012.00382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-nondeterminism-probability-and-termination-equational-and-metric-reasoning-2012.00382"/></url>
<url><loc>https://scifaro.com/en/abs/an-analytic-propositional-proof-system-on-graphs-2012.01102</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analytic-propositional-proof-system-on-graphs-2012.01102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analytic-propositional-proof-system-on-graphs-2012.01102"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-workshop-on-formal-methods-for-autonomous-systems-2012.01176</loc><lastmod>2020-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-formal-methods-for-autonomous-systems-2012.01176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-workshop-on-formal-methods-for-autonomous-systems-2012.01176"/></url>
<url><loc>https://scifaro.com/en/abs/the-model-counting-competition-2020-2012.01323</loc><lastmod>2024-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-model-counting-competition-2020-2012.01323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-model-counting-competition-2020-2012.01323"/></url>
<url><loc>https://scifaro.com/en/abs/learnability-and-positive-equivalence-relations-2012.01466</loc><lastmod>2021-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learnability-and-positive-equivalence-relations-2012.01466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learnability-and-positive-equivalence-relations-2012.01466"/></url>
<url><loc>https://scifaro.com/en/abs/modeling-adverse-conditions-in-the-framework-of-graph-transformation-systems-2012.01657</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modeling-adverse-conditions-in-the-framework-of-graph-transformation-systems-2012.01657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modeling-adverse-conditions-in-the-framework-of-graph-transformation-systems-2012.01657"/></url>
<url><loc>https://scifaro.com/en/abs/reversibility-and-composition-of-rewriting-in-hierarchies-2012.01661</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversibility-and-composition-of-rewriting-in-hierarchies-2012.01661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversibility-and-composition-of-rewriting-in-hierarchies-2012.01661"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-2012.01662</loc><lastmod>2020-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-2012.01662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-graph-programs-with-first-order-logic-2012.01662"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagram-rewrite-theory-i-rewriting-with-frobenius-structure-2012.01847</loc><lastmod>2022-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-i-rewriting-with-frobenius-structure-2012.01847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-i-rewriting-with-frobenius-structure-2012.01847"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-incremental-nacs-in-safe-graph-grammars-using-complementation-2012.02192</loc><lastmod>2020-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-incremental-nacs-in-safe-graph-grammars-using-complementation-2012.02192"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-incremental-nacs-in-safe-graph-grammars-using-complementation-2012.02192"/></url>
<url><loc>https://scifaro.com/en/abs/conformance-relations-and-hyperproperties-for-doping-detection-in-time-and-space-2012.03910</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conformance-relations-and-hyperproperties-for-doping-detection-in-time-and-space-2012.03910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conformance-relations-and-hyperproperties-for-doping-detection-in-time-and-space-2012.03910"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-semantics-for-probabilistic-logic-programming-2012.03916</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-semantics-for-probabilistic-logic-programming-2012.03916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-semantics-for-probabilistic-logic-programming-2012.03916"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-verification-of-timing-properties-in-interoperable-medical-systems-2012.04025</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-verification-of-timing-properties-in-interoperable-medical-systems-2012.04025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-verification-of-timing-properties-in-interoperable-medical-systems-2012.04025"/></url>
<url><loc>https://scifaro.com/en/abs/modular-analysis-of-tree-topology-models-2012.04739</loc><lastmod>2020-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-analysis-of-tree-topology-models-2012.04739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-analysis-of-tree-topology-models-2012.04739"/></url>
<url><loc>https://scifaro.com/en/abs/a-gentle-introduction-to-girard-s-transcendental-syntax-for-the-linear-logician-2012.04752</loc><lastmod>2022-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gentle-introduction-to-girard-s-transcendental-syntax-for-the-linear-logician-2012.04752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gentle-introduction-to-girard-s-transcendental-syntax-for-the-linear-logician-2012.04752"/></url>
<url><loc>https://scifaro.com/en/abs/many-valued-coalgebraic-modal-logic-one-step-completeness-and-finite-model-property-2012.05604</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-valued-coalgebraic-modal-logic-one-step-completeness-and-finite-model-property-2012.05604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-valued-coalgebraic-modal-logic-one-step-completeness-and-finite-model-property-2012.05604"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-control-in-the-unitary-sphere-lambda-s1-and-its-categorical-model-2012.05887</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-control-in-the-unitary-sphere-lambda-s1-and-its-categorical-model-2012.05887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-control-in-the-unitary-sphere-lambda-s1-and-its-categorical-model-2012.05887"/></url>
<url><loc>https://scifaro.com/en/abs/decompositional-minimisation-of-monolithic-processes-2012.06468</loc><lastmod>2020-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decompositional-minimisation-of-monolithic-processes-2012.06468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decompositional-minimisation-of-monolithic-processes-2012.06468"/></url>
<url><loc>https://scifaro.com/en/abs/a-novice-friendly-induction-tactic-for-lean-2012.08990</loc><lastmod>2020-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novice-friendly-induction-tactic-for-lean-2012.08990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novice-friendly-induction-tactic-for-lean-2012.08990"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-connective-in-natural-deduction-and-its-application-to-quantum-computing-2012.08994</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-connective-in-natural-deduction-and-its-application-to-quantum-computing-2012.08994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-connective-in-natural-deduction-and-its-application-to-quantum-computing-2012.08994"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-pal-cdot-s5-in-proof-assistant-2012.09388</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-pal-cdot-s5-in-proof-assistant-2012.09388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-pal-cdot-s5-in-proof-assistant-2012.09388"/></url>
<url><loc>https://scifaro.com/en/abs/online-shielding-for-stochastic-systems-2012.09539</loc><lastmod>2020-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-shielding-for-stochastic-systems-2012.09539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-shielding-for-stochastic-systems-2012.09539"/></url>
<url><loc>https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-extended-version-2012.09975</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-extended-version-2012.09975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-duality-theoretic-view-on-limits-of-finite-structures-extended-version-2012.09975"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-categories-for-dependent-type-theory-sketching-and-adequacy-2012.10783</loc><lastmod>2021-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-categories-for-dependent-type-theory-sketching-and-adequacy-2012.10783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-categories-for-dependent-type-theory-sketching-and-adequacy-2012.10783"/></url>
<url><loc>https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2012.10869</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2012.10869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2012.10869"/></url>
<url><loc>https://scifaro.com/en/abs/prove-it-a-proof-assistant-for-organizing-and-verifying-general-mathematical-knowledge-2012.10987</loc><lastmod>2020-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prove-it-a-proof-assistant-for-organizing-and-verifying-general-mathematical-knowledge-2012.10987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prove-it-a-proof-assistant-for-organizing-and-verifying-general-mathematical-knowledge-2012.10987"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-verification-of-fixed-point-implementations-of-neural-networks-2012.11220</loc><lastmod>2020-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-verification-of-fixed-point-implementations-of-neural-networks-2012.11220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-verification-of-fixed-point-implementations-of-neural-networks-2012.11220"/></url>
<url><loc>https://scifaro.com/en/abs/finitely-valued-propositional-dynamic-logic-2012.12133</loc><lastmod>2020-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitely-valued-propositional-dynamic-logic-2012.12133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitely-valued-propositional-dynamic-logic-2012.12133"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-and-model-synthesisfrom-partial-models-a-logic-based-perspective-2012.12398</loc><lastmod>2020-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-and-model-synthesisfrom-partial-models-a-logic-based-perspective-2012.12398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-and-model-synthesisfrom-partial-models-a-logic-based-perspective-2012.12398"/></url>
<url><loc>https://scifaro.com/en/abs/tractability-frontiers-in-probabilistic-team-semantics-and-existential-second-order-logic-over-the-reals-2012.12830</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractability-frontiers-in-probabilistic-team-semantics-and-existential-second-order-logic-over-the-reals-2012.12830"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractability-frontiers-in-probabilistic-team-semantics-and-existential-second-order-logic-over-the-reals-2012.12830"/></url>
<url><loc>https://scifaro.com/en/abs/using-spatial-logic-and-model-checking-for-nevus-segmentation-2012.13289</loc><lastmod>2020-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-spatial-logic-and-model-checking-for-nevus-segmentation-2012.13289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-spatial-logic-and-model-checking-for-nevus-segmentation-2012.13289"/></url>
<url><loc>https://scifaro.com/en/abs/a-standard-grammar-for-temporal-logics-on-finite-traces-2012.13638</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-standard-grammar-for-temporal-logics-on-finite-traces-2012.13638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-standard-grammar-for-temporal-logics-on-finite-traces-2012.13638"/></url>
<url><loc>https://scifaro.com/en/abs/time-fluid-field-based-coordination-through-programmable-distributed-schedulers-2012.13806</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-fluid-field-based-coordination-through-programmable-distributed-schedulers-2012.13806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-fluid-field-based-coordination-through-programmable-distributed-schedulers-2012.13806"/></url>
<url><loc>https://scifaro.com/en/abs/certified-quantum-computation-in-isabelle-hol-2012.13925</loc><lastmod>2020-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-quantum-computation-in-isabelle-hol-2012.13925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-quantum-computation-in-isabelle-hol-2012.13925"/></url>
<url><loc>https://scifaro.com/en/abs/the-temporal-logic-of-coalitional-goal-assignments-in-concurrent-multi-player-games-2012.14195</loc><lastmod>2022-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-temporal-logic-of-coalitional-goal-assignments-in-concurrent-multi-player-games-2012.14195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-temporal-logic-of-coalitional-goal-assignments-in-concurrent-multi-player-games-2012.14195"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-decidable-entailments-in-separation-logic-with-inductive-definitions-2012.14361</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-decidable-entailments-in-separation-logic-with-inductive-definitions-2012.14361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-decidable-entailments-in-separation-logic-with-inductive-definitions-2012.14361"/></url>
<url><loc>https://scifaro.com/en/abs/a-circular-version-of-g-odel-s-t-and-its-abstraction-complexity-2012.14421</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-circular-version-of-g-odel-s-t-and-its-abstraction-complexity-2012.14421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-circular-version-of-g-odel-s-t-and-its-abstraction-complexity-2012.14421"/></url>
<url><loc>https://scifaro.com/en/abs/explainable-reactive-synthesis-2012.14582</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explainable-reactive-synthesis-2012.14582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explainable-reactive-synthesis-2012.14582"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-approximate-implementations-for-unrealizable-specifications-2012.14592</loc><lastmod>2021-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-approximate-implementations-for-unrealizable-specifications-2012.14592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-approximate-implementations-for-unrealizable-specifications-2012.14592"/></url>
<url><loc>https://scifaro.com/en/abs/a-detailed-account-of-the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-2012.15704</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-detailed-account-of-the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-2012.15704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-detailed-account-of-the-inconsistent-labelling-problem-of-stutter-preserving-partial-order-reduction-2012.15704"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-a-cruise-control-system-using-simulink-and-spaceex-2101.00102</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-a-cruise-control-system-using-simulink-and-spaceex-2101.00102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-a-cruise-control-system-using-simulink-and-spaceex-2101.00102"/></url>
<url><loc>https://scifaro.com/en/abs/computable-random-variables-and-conditioning-2101.00956</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-random-variables-and-conditioning-2101.00956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-random-variables-and-conditioning-2101.00956"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-online-conformance-checking-using-incremental-prefix-alignment-computation-2101.00958</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-online-conformance-checking-using-incremental-prefix-alignment-computation-2101.00958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-online-conformance-checking-using-incremental-prefix-alignment-computation-2101.00958"/></url>
<url><loc>https://scifaro.com/en/abs/formal-game-grammar-and-equivalence-2101.00992</loc><lastmod>2021-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-game-grammar-and-equivalence-2101.00992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-game-grammar-and-equivalence-2101.00992"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-preference-logic-meets-iterated-belief-change-representation-results-and-postulates-characterization-2101.01676</loc><lastmod>2021-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-preference-logic-meets-iterated-belief-change-representation-results-and-postulates-characterization-2101.01676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-preference-logic-meets-iterated-belief-change-representation-results-and-postulates-characterization-2101.01676"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-up-to-garbage-in-graph-transformation-2101.01842</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-up-to-garbage-in-graph-transformation-2101.01842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-up-to-garbage-in-graph-transformation-2101.01842"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-first-order-constraints-a-category-independent-approach-2101.01944</loc><lastmod>2021-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-first-order-constraints-a-category-independent-approach-2101.01944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-first-order-constraints-a-category-independent-approach-2101.01944"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-proving-and-algebra-2101.02690</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-proving-and-algebra-2101.02690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-proving-and-algebra-2101.02690"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2101.02835</loc><lastmod>2021-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2101.02835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2101.02835"/></url>
<url><loc>https://scifaro.com/en/abs/quotients-inductive-types-and-quotient-inductive-types-2101.02994</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quotients-inductive-types-and-quotient-inductive-types-2101.02994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quotients-inductive-types-and-quotient-inductive-types-2101.02994"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-logic-approach-to-specification-proof-search-and-meta-proofs-in-sequent-systems-2101.03113</loc><lastmod>2021-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-logic-approach-to-specification-proof-search-and-meta-proofs-in-sequent-systems-2101.03113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-logic-approach-to-specification-proof-search-and-meta-proofs-in-sequent-systems-2101.03113"/></url>
<url><loc>https://scifaro.com/en/abs/polymorphic-system-i-2101.03215</loc><lastmod>2021-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polymorphic-system-i-2101.03215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polymorphic-system-i-2101.03215"/></url>
<url><loc>https://scifaro.com/en/abs/tietze-equivalences-as-weak-equivalences-2101.03591</loc><lastmod>2021-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tietze-equivalences-as-weak-equivalences-2101.03591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tietze-equivalences-as-weak-equivalences-2101.03591"/></url>
<url><loc>https://scifaro.com/en/abs/mechanisation-of-model-theoretic-conservative-extension-for-hol-with-ad-hoc-overloading-2101.03807</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanisation-of-model-theoretic-conservative-extension-for-hol-with-ad-hoc-overloading-2101.03807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanisation-of-model-theoretic-conservative-extension-for-hol-with-ad-hoc-overloading-2101.03807"/></url>
<url><loc>https://scifaro.com/en/abs/object-level-reasoning-with-logics-encoded-in-hol-light-2101.03808</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/object-level-reasoning-with-logics-encoded-in-hol-light-2101.03808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/object-level-reasoning-with-logics-encoded-in-hol-light-2101.03808"/></url>
<url><loc>https://scifaro.com/en/abs/deductive-systems-and-coherence-for-skew-prounital-closed-categories-2101.03809</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deductive-systems-and-coherence-for-skew-prounital-closed-categories-2101.03809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deductive-systems-and-coherence-for-skew-prounital-closed-categories-2101.03809"/></url>
<url><loc>https://scifaro.com/en/abs/implementation-of-two-layers-type-theory-in-dedukti-and-application-to-cubical-type-theory-2101.03810</loc><lastmod>2021-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementation-of-two-layers-type-theory-in-dedukti-and-application-to-cubical-type-theory-2101.03810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementation-of-two-layers-type-theory-in-dedukti-and-application-to-cubical-type-theory-2101.03810"/></url>
<url><loc>https://scifaro.com/en/abs/register-automata-with-extrema-constraints-and-an-application-to-two-variable-logic-2101.03866</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/register-automata-with-extrema-constraints-and-an-application-to-two-variable-logic-2101.03866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/register-automata-with-extrema-constraints-and-an-application-to-two-variable-logic-2101.03866"/></url>
<url><loc>https://scifaro.com/en/abs/parametricity-for-nested-types-and-gadts-2101.04819</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametricity-for-nested-types-and-gadts-2101.04819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametricity-for-nested-types-and-gadts-2101.04819"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-method-to-fidelity-based-model-checking-over-quantum-markov-chains-2101.04971</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-method-to-fidelity-based-model-checking-over-quantum-markov-chains-2101.04971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-method-to-fidelity-based-model-checking-over-quantum-markov-chains-2101.04971"/></url>
<url><loc>https://scifaro.com/en/abs/proposal-for-adding-useful-features-to-petri-net-model-checkers-2101.05024</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proposal-for-adding-useful-features-to-petri-net-model-checkers-2101.05024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proposal-for-adding-useful-features-to-petri-net-model-checkers-2101.05024"/></url>
<url><loc>https://scifaro.com/en/abs/secure-process-algebra-2101.05140</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/secure-process-algebra-2101.05140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/secure-process-algebra-2101.05140"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-symbolic-numeric-methods-for-reasoning-about-cps-and-iot-2101.05256</loc><lastmod>2021-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-symbolic-numeric-methods-for-reasoning-about-cps-and-iot-2101.05256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-6th-international-workshop-on-symbolic-numeric-methods-for-reasoning-about-cps-and-iot-2101.05256"/></url>
<url><loc>https://scifaro.com/en/abs/irrationality-and-transcendence-criteria-for-infinite-series-in-isabelle-hol-2101.05257</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irrationality-and-transcendence-criteria-for-infinite-series-in-isabelle-hol-2101.05257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irrationality-and-transcendence-criteria-for-infinite-series-in-isabelle-hol-2101.05257"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-of-e-commerce-ranking-signals-via-signal-temporal-logic-2101.05415</loc><lastmod>2021-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-of-e-commerce-ranking-signals-via-signal-temporal-logic-2101.05415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-of-e-commerce-ranking-signals-via-signal-temporal-logic-2101.05415"/></url>
<url><loc>https://scifaro.com/en/abs/lebesgue-integration-detailed-proofs-to-be-formalized-in-coq-2101.05678</loc><lastmod>2021-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lebesgue-integration-detailed-proofs-to-be-formalized-in-coq-2101.05678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lebesgue-integration-detailed-proofs-to-be-formalized-in-coq-2101.05678"/></url>
<url><loc>https://scifaro.com/en/abs/a-strong-bisimulation-for-a-classical-term-calculus-2101.05754</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strong-bisimulation-for-a-classical-term-calculus-2101.05754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strong-bisimulation-for-a-classical-term-calculus-2101.05754"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-contract-theory-for-programs-with-procedures-2101.06087</loc><lastmod>2021-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-contract-theory-for-programs-with-procedures-2101.06087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-contract-theory-for-programs-with-procedures-2101.06087"/></url>
<url><loc>https://scifaro.com/en/abs/switched-systems-as-hybrid-programs-2101.06195</loc><lastmod>2021-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/switched-systems-as-hybrid-programs-2101.06195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/switched-systems-as-hybrid-programs-2101.06195"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-guided-prophecy-for-model-checking-modulo-the-theory-of-arrays-2101.06825</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-guided-prophecy-for-model-checking-modulo-the-theory-of-arrays-2101.06825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-guided-prophecy-for-model-checking-modulo-the-theory-of-arrays-2101.06825"/></url>
<url><loc>https://scifaro.com/en/abs/reversible-computation-in-petri-nets-2101.07066</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reversible-computation-in-petri-nets-2101.07066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reversible-computation-in-petri-nets-2101.07066"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-monitoring-of-hyperproperties-using-prefix-trees-2101.07109</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-monitoring-of-hyperproperties-using-prefix-trees-2101.07109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-monitoring-of-hyperproperties-using-prefix-trees-2101.07109"/></url>
<url><loc>https://scifaro.com/en/abs/realizing-omega-regular-hyperproperties-2101.07161</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizing-omega-regular-hyperproperties-2101.07161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizing-omega-regular-hyperproperties-2101.07161"/></url>
<url><loc>https://scifaro.com/en/abs/syntroids-synthesizing-a-game-for-fpgas-using-temporal-logic-specifications-2101.07232</loc><lastmod>2021-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntroids-synthesizing-a-game-for-fpgas-using-temporal-logic-specifications-2101.07232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntroids-synthesizing-a-game-for-fpgas-using-temporal-logic-specifications-2101.07232"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-and-synthesis-of-stochastic-hybrid-systems-a-survey-2101.07491</loc><lastmod>2022-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-and-synthesis-of-stochastic-hybrid-systems-a-survey-2101.07491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-and-synthesis-of-stochastic-hybrid-systems-a-survey-2101.07491"/></url>
<url><loc>https://scifaro.com/en/abs/proof-automation-in-the-theory-of-finite-sets-and-finite-set-relation-algebra-2101.07700</loc><lastmod>2021-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-automation-in-the-theory-of-finite-sets-and-finite-set-relation-algebra-2101.07700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-automation-in-the-theory-of-finite-sets-and-finite-set-relation-algebra-2101.07700"/></url>
<url><loc>https://scifaro.com/en/abs/resource-bisimilarity-in-petri-nets-is-decidable-2101.07711</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-bisimilarity-in-petri-nets-is-decidable-2101.07711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-bisimilarity-in-petri-nets-is-decidable-2101.07711"/></url>
<url><loc>https://scifaro.com/en/abs/a-bi-directional-extensible-interface-between-lean-and-mathematica-2101.07758</loc><lastmod>2021-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bi-directional-extensible-interface-between-lean-and-mathematica-2101.07758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bi-directional-extensible-interface-between-lean-and-mathematica-2101.07758"/></url>
<url><loc>https://scifaro.com/en/abs/the-coq-proof-script-visualiser-coq-psv-2101.07761</loc><lastmod>2021-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-coq-proof-script-visualiser-coq-psv-2101.07761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-coq-proof-script-visualiser-coq-psv-2101.07761"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-monitoring-hyperproperties-2101.07847</loc><lastmod>2021-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-monitoring-hyperproperties-2101.07847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-monitoring-hyperproperties-2101.07847"/></url>
<url><loc>https://scifaro.com/en/abs/fixpoint-theory-upside-down-2101.08184</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixpoint-theory-upside-down-2101.08184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixpoint-theory-upside-down-2101.08184"/></url>
<url><loc>https://scifaro.com/en/abs/program-repair-for-hyperproperties-2101.08257</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-repair-for-hyperproperties-2101.08257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-repair-for-hyperproperties-2101.08257"/></url>
<url><loc>https://scifaro.com/en/abs/factorization-in-call-by-name-and-call-by-value-calculi-via-linear-logic-long-version-2101.08364</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/factorization-in-call-by-name-and-call-by-value-calculi-via-linear-logic-long-version-2101.08364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/factorization-in-call-by-name-and-call-by-value-calculi-via-linear-logic-long-version-2101.08364"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-theory-of-the-triguarded-fragment-and-related-logics-2101.08377</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-theory-of-the-triguarded-fragment-and-related-logics-2101.08377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-theory-of-the-triguarded-fragment-and-related-logics-2101.08377"/></url>
<url><loc>https://scifaro.com/en/abs/complete-trace-models-of-state-and-control-2101.08491</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-trace-models-of-state-and-control-2101.08491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-trace-models-of-state-and-control-2101.08491"/></url>
<url><loc>https://scifaro.com/en/abs/work-sensitive-dynamic-complexity-of-formal-languages-2101.08735</loc><lastmod>2021-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/work-sensitive-dynamic-complexity-of-formal-languages-2101.08735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/work-sensitive-dynamic-complexity-of-formal-languages-2101.08735"/></url>
<url><loc>https://scifaro.com/en/abs/controller-synthesis-for-hyperproperties-2101.08880</loc><lastmod>2021-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controller-synthesis-for-hyperproperties-2101.08880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controller-synthesis-for-hyperproperties-2101.08880"/></url>
<url><loc>https://scifaro.com/en/abs/peqcheck-localized-and-context-aware-checking-of-functional-equivalence-technical-report-2101.09042</loc><lastmod>2021-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peqcheck-localized-and-context-aware-checking-of-functional-equivalence-technical-report-2101.09042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peqcheck-localized-and-context-aware-checking-of-functional-equivalence-technical-report-2101.09042"/></url>
<url><loc>https://scifaro.com/en/abs/relational-type-theory-all-proofs-2101.09655</loc><lastmod>2021-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-type-theory-all-proofs-2101.09655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-type-theory-all-proofs-2101.09655"/></url>
<url><loc>https://scifaro.com/en/abs/a-machine-checked-proof-of-birkhoff-s-variety-theorem-in-martin-l-of-type-theory-2101.10166</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-machine-checked-proof-of-birkhoff-s-variety-theorem-in-martin-l-of-type-theory-2101.10166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-machine-checked-proof-of-birkhoff-s-variety-theorem-in-martin-l-of-type-theory-2101.10166"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-vector-space-semantics-for-lambek-calculus-with-a-relevant-modality-extended-abstract-2101.10486</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-vector-space-semantics-for-lambek-calculus-with-a-relevant-modality-extended-abstract-2101.10486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-vector-space-semantics-for-lambek-calculus-with-a-relevant-modality-extended-abstract-2101.10486"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-of-partially-normal-skew-monoidal-categories-2101.10487</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-of-partially-normal-skew-monoidal-categories-2101.10487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-of-partially-normal-skew-monoidal-categories-2101.10487"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-derivative-ascent-a-categorical-approach-to-learning-boolean-circuits-2101.10488</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-derivative-ascent-a-categorical-approach-to-learning-boolean-circuits-2101.10488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-derivative-ascent-a-categorical-approach-to-learning-boolean-circuits-2101.10488"/></url>
<url><loc>https://scifaro.com/en/abs/behavioral-mereology-a-modal-logic-for-passing-constraints-2101.10490</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioral-mereology-a-modal-logic-for-passing-constraints-2101.10490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioral-mereology-a-modal-logic-for-passing-constraints-2101.10490"/></url>
<url><loc>https://scifaro.com/en/abs/dualizing-sup-preserving-endomaps-of-a-complete-lattice-2101.10493</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dualizing-sup-preserving-endomaps-of-a-complete-lattice-2101.10493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dualizing-sup-preserving-endomaps-of-a-complete-lattice-2101.10493"/></url>
<url><loc>https://scifaro.com/en/abs/products-in-a-category-with-only-one-object-2101.10494</loc><lastmod>2021-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/products-in-a-category-with-only-one-object-2101.10494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/products-in-a-category-with-only-one-object-2101.10494"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-for-fresh-name-generation-2101.10720</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-for-fresh-name-generation-2101.10720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-for-fresh-name-generation-2101.10720"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-for-cubical-type-theory-2101.11479</loc><lastmod>2022-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-for-cubical-type-theory-2101.11479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-for-cubical-type-theory-2101.11479"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-fixed-parameter-tractability-of-query-evaluation-over-guarded-tgds-2101.11727</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-fixed-parameter-tractability-of-query-evaluation-over-guarded-tgds-2101.11727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-fixed-parameter-tractability-of-query-evaluation-over-guarded-tgds-2101.11727"/></url>
<url><loc>https://scifaro.com/en/abs/alignment-completeness-for-relational-hoare-logics-2101.11730</loc><lastmod>2021-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alignment-completeness-for-relational-hoare-logics-2101.11730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alignment-completeness-for-relational-hoare-logics-2101.11730"/></url>
<url><loc>https://scifaro.com/en/abs/type-based-analysis-of-logarithmic-amortised-complexity-2101.12029</loc><lastmod>2023-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-based-analysis-of-logarithmic-amortised-complexity-2101.12029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-based-analysis-of-logarithmic-amortised-complexity-2101.12029"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-game-theory-compositionally-2101.12045</loc><lastmod>2021-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-game-theory-compositionally-2101.12045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-game-theory-compositionally-2101.12045"/></url>
<url><loc>https://scifaro.com/en/abs/wiring-diagrams-as-normal-forms-for-computing-in-symmetric-monoidal-categories-2101.12046</loc><lastmod>2021-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wiring-diagrams-as-normal-forms-for-computing-in-symmetric-monoidal-categories-2101.12046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wiring-diagrams-as-normal-forms-for-computing-in-symmetric-monoidal-categories-2101.12046"/></url>
<url><loc>https://scifaro.com/en/abs/safety-verification-of-parameterized-systems-under-release-acquire-2101.12123</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-verification-of-parameterized-systems-under-release-acquire-2101.12123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-verification-of-parameterized-systems-under-release-acquire-2101.12123"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterizations-of-fuzzy-bisimulations-in-fuzzy-modal-logics-over-residuated-lattices-2101.12349</loc><lastmod>2021-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterizations-of-fuzzy-bisimulations-in-fuzzy-modal-logics-over-residuated-lattices-2101.12349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterizations-of-fuzzy-bisimulations-in-fuzzy-modal-logics-over-residuated-lattices-2101.12349"/></url>
<url><loc>https://scifaro.com/en/abs/a-symmetric-lambda-calculus-corresponding-to-the-negation-free-bilateral-natural-deduction-2101.12607</loc><lastmod>2021-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symmetric-lambda-calculus-corresponding-to-the-negation-free-bilateral-natural-deduction-2101.12607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symmetric-lambda-calculus-corresponding-to-the-negation-free-bilateral-natural-deduction-2101.12607"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-synthesis-for-probabilistic-programs-reaches-new-horizons-2101.12683</loc><lastmod>2021-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-synthesis-for-probabilistic-programs-reaches-new-horizons-2101.12683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-synthesis-for-probabilistic-programs-reaches-new-horizons-2101.12683"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantum-interpretation-of-bunched-logic-for-quantum-separation-logic-2102.00329</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantum-interpretation-of-bunched-logic-for-quantum-separation-logic-2102.00329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantum-interpretation-of-bunched-logic-for-quantum-separation-logic-2102.00329"/></url>
<url><loc>https://scifaro.com/en/abs/superposition-with-lambdas-2102.00453</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superposition-with-lambdas-2102.00453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superposition-with-lambdas-2102.00453"/></url>
<url><loc>https://scifaro.com/en/abs/commutative-monads-for-probabilistic-programming-languages-2102.00510</loc><lastmod>2021-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/commutative-monads-for-probabilistic-programming-languages-2102.00510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/commutative-monads-for-probabilistic-programming-languages-2102.00510"/></url>
<url><loc>https://scifaro.com/en/abs/global-types-and-event-structure-semantics-for-asynchronous-multiparty-sessions-2102.00865</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-types-and-event-structure-semantics-for-asynchronous-multiparty-sessions-2102.00865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-types-and-event-structure-semantics-for-asynchronous-multiparty-sessions-2102.00865"/></url>
<url><loc>https://scifaro.com/en/abs/quadratic-type-checking-for-objective-type-theory-2102.00905</loc><lastmod>2021-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quadratic-type-checking-for-objective-type-theory-2102.00905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quadratic-type-checking-for-objective-type-theory-2102.00905"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-the-hashgraph-consensus-algorithm-2102.01167</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-the-hashgraph-consensus-algorithm-2102.01167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-the-hashgraph-consensus-algorithm-2102.01167"/></url>
<url><loc>https://scifaro.com/en/abs/justifications-and-a-reconstruction-of-parity-game-solving-algorithms-2102.01440</loc><lastmod>2021-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justifications-and-a-reconstruction-of-parity-game-solving-algorithms-2102.01440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justifications-and-a-reconstruction-of-parity-game-solving-algorithms-2102.01440"/></url>
<url><loc>https://scifaro.com/en/abs/pecan-an-automated-theorem-prover-for-automatic-sequences-using-b-uchi-automata-2102.01727</loc><lastmod>2021-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pecan-an-automated-theorem-prover-for-automatic-sequences-using-b-uchi-automata-2102.01727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pecan-an-automated-theorem-prover-for-automatic-sequences-using-b-uchi-automata-2102.01727"/></url>
<url><loc>https://scifaro.com/en/abs/greatest-hits-higher-inductive-types-in-coinductive-definitions-via-induction-under-clocks-2102.01969</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/greatest-hits-higher-inductive-types-in-coinductive-definitions-via-induction-under-clocks-2102.01969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/greatest-hits-higher-inductive-types-in-coinductive-definitions-via-induction-under-clocks-2102.01969"/></url>
<url><loc>https://scifaro.com/en/abs/on-stochastic-rewriting-and-combinatorics-via-rule-algebraic-methods-2102.02364</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-stochastic-rewriting-and-combinatorics-via-rule-algebraic-methods-2102.02364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-stochastic-rewriting-and-combinatorics-via-rule-algebraic-methods-2102.02364"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-independence-in-attributed-graph-rewriting-2102.02366</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-independence-in-attributed-graph-rewriting-2102.02366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-independence-in-attributed-graph-rewriting-2102.02366"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-dedekind-domains-and-class-groups-of-global-fields-2102.02600</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-dedekind-domains-and-class-groups-of-global-fields-2102.02600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-dedekind-domains-and-class-groups-of-global-fields-2102.02600"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-a-turing-complete-choreographic-language-in-coq-2102.02627</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-a-turing-complete-choreographic-language-in-coq-2102.02627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-a-turing-complete-choreographic-language-in-coq-2102.02627"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-differential-equation-solutions-from-computer-algebra-systems-in-isabelle-hol-2102.02679</loc><lastmod>2021-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-differential-equation-solutions-from-computer-algebra-systems-in-isabelle-hol-2102.02679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-differential-equation-solutions-from-computer-algebra-systems-in-isabelle-hol-2102.02679"/></url>
<url><loc>https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2102.02990</loc><lastmod>2021-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2102.02990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-constrained-process-graphs-for-the-process-semantics-of-regular-expressions-2102.02990"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-decision-procedure-for-univariate-real-arithmetic-with-the-bkr-algorithm-2102.03003</loc><lastmod>2021-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-decision-procedure-for-univariate-real-arithmetic-with-the-bkr-algorithm-2102.03003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-decision-procedure-for-univariate-real-arithmetic-with-the-bkr-algorithm-2102.03003"/></url>
<url><loc>https://scifaro.com/en/abs/injective-objects-and-fibered-codensity-liftings-2102.03510</loc><lastmod>2021-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/injective-objects-and-fibered-codensity-liftings-2102.03510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/injective-objects-and-fibered-codensity-liftings-2102.03510"/></url>
<url><loc>https://scifaro.com/en/abs/from-matching-logic-to-parallel-imperative-language-verification-2102.04011</loc><lastmod>2021-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-matching-logic-to-parallel-imperative-language-verification-2102.04011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-matching-logic-to-parallel-imperative-language-verification-2102.04011"/></url>
<url><loc>https://scifaro.com/en/abs/native-type-theory-2102.04672</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/native-type-theory-2102.04672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/native-type-theory-2102.04672"/></url>
<url><loc>https://scifaro.com/en/abs/an-interactive-proof-of-termination-for-a-concurrent-lambda-calculus-with-references-and-explicit-substitutions-2102.05161</loc><lastmod>2021-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interactive-proof-of-termination-for-a-concurrent-lambda-calculus-with-references-and-explicit-substitutions-2102.05161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interactive-proof-of-termination-for-a-concurrent-lambda-calculus-with-references-and-explicit-substitutions-2102.05161"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-cardinality-constraints-into-constraint-logic-programming-with-sets-2102.05422</loc><lastmod>2021-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-cardinality-constraints-into-constraint-logic-programming-with-sets-2102.05422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-cardinality-constraints-into-constraint-logic-programming-with-sets-2102.05422"/></url>
<url><loc>https://scifaro.com/en/abs/interpreting-a-concurrent-lambda-calculus-in-differential-proof-nets-extended-version-2102.05736</loc><lastmod>2021-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpreting-a-concurrent-lambda-calculus-in-differential-proof-nets-extended-version-2102.05736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpreting-a-concurrent-lambda-calculus-in-differential-proof-nets-extended-version-2102.05736"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-modal-completeness-for-provability-logic-2102.05945</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-modal-completeness-for-provability-logic-2102.05945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-modal-completeness-for-provability-logic-2102.05945"/></url>
<url><loc>https://scifaro.com/en/abs/zero-one-laws-for-provability-logic-axiomatizing-validity-in-almost-all-models-and-almost-all-frames-2102.05947</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zero-one-laws-for-provability-logic-axiomatizing-validity-in-almost-all-models-and-almost-all-frames-2102.05947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zero-one-laws-for-provability-logic-axiomatizing-validity-in-almost-all-models-and-almost-all-frames-2102.05947"/></url>
<url><loc>https://scifaro.com/en/abs/universal-algebra-in-unimath-2102.05952</loc><lastmod>2025-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-algebra-in-unimath-2102.05952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-algebra-in-unimath-2102.05952"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-high-level-latency-insensitive-designs-with-formal-model-checking-2102.06326</loc><lastmod>2021-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-high-level-latency-insensitive-designs-with-formal-model-checking-2102.06326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-high-level-latency-insensitive-designs-with-formal-model-checking-2102.06326"/></url>
<url><loc>https://scifaro.com/en/abs/on-signings-and-the-well-founded-semantics-2102.06495</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-signings-and-the-well-founded-semantics-2102.06495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-signings-and-the-well-founded-semantics-2102.06495"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-cocompleteness-and-finitary-functors-2102.06532</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-cocompleteness-and-finitary-functors-2102.06532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-cocompleteness-and-finitary-functors-2102.06532"/></url>
<url><loc>https://scifaro.com/en/abs/vsync-push-button-verification-and-optimization-for-synchronization-primitives-on-weak-memory-models-technical-report-2102.06590</loc><lastmod>2021-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vsync-push-button-verification-and-optimization-for-synchronization-primitives-on-weak-memory-models-technical-report-2102.06590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vsync-push-button-verification-and-optimization-for-synchronization-primitives-on-weak-memory-models-technical-report-2102.06590"/></url>
<url><loc>https://scifaro.com/en/abs/responsibility-and-verification-importance-value-in-temporal-logics-2102.06655</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/responsibility-and-verification-importance-value-in-temporal-logics-2102.06655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/responsibility-and-verification-importance-value-in-temporal-logics-2102.06655"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-and-permutations-2102.06880</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-and-permutations-2102.06880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-and-permutations-2102.06880"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-graphs-of-bounded-twin-width-2102.06881</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-graphs-of-bounded-twin-width-2102.06881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-graphs-of-bounded-twin-width-2102.06881"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-polynomial-termination-complexity-for-vass-programs-2102.06889</loc><lastmod>2021-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-polynomial-termination-complexity-for-vass-programs-2102.06889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-polynomial-termination-complexity-for-vass-programs-2102.06889"/></url>
<url><loc>https://scifaro.com/en/abs/strong-call-by-value-is-reasonable-implosively-2102.06928</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-call-by-value-is-reasonable-implosively-2102.06928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-call-by-value-is-reasonable-implosively-2102.06928"/></url>
<url><loc>https://scifaro.com/en/abs/on-synthesizing-skolem-functions-for-first-order-logic-formulae-2102.07463</loc><lastmod>2022-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-synthesizing-skolem-functions-for-first-order-logic-formulae-2102.07463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-synthesizing-skolem-functions-for-first-order-logic-formulae-2102.07463"/></url>
<url><loc>https://scifaro.com/en/abs/sequence-types-and-infinitary-semantics-2102.07515</loc><lastmod>2021-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequence-types-and-infinitary-semantics-2102.07515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequence-types-and-infinitary-semantics-2102.07515"/></url>
<url><loc>https://scifaro.com/en/abs/collapsing-the-bounded-width-hierarchy-for-infinite-domain-csps-when-symmetries-are-enough-2102.07531</loc><lastmod>2024-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/collapsing-the-bounded-width-hierarchy-for-infinite-domain-csps-when-symmetries-are-enough-2102.07531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/collapsing-the-bounded-width-hierarchy-for-infinite-domain-csps-when-symmetries-are-enough-2102.07531"/></url>
<url><loc>https://scifaro.com/en/abs/formalized-haar-measure-2102.07636</loc><lastmod>2021-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalized-haar-measure-2102.07636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalized-haar-measure-2102.07636"/></url>
<url><loc>https://scifaro.com/en/abs/arboreal-categories-an-axiomatic-theory-of-resources-2102.08109</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arboreal-categories-an-axiomatic-theory-of-resources-2102.08109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arboreal-categories-an-axiomatic-theory-of-resources-2102.08109"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-unification-and-matching-of-higher-order-expressions-with-recursive-let-2102.08146</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-unification-and-matching-of-higher-order-expressions-with-recursive-let-2102.08146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-unification-and-matching-of-higher-order-expressions-with-recursive-let-2102.08146"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-for-sturmian-words-2102.08207</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-for-sturmian-words-2102.08207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-for-sturmian-words-2102.08207"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-coequations-coinduction-and-completeness-2102.08286</loc><lastmod>2023-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-coequations-coinduction-and-completeness-2102.08286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-coequations-coinduction-and-completeness-2102.08286"/></url>
<url><loc>https://scifaro.com/en/abs/safe-fast-concurrent-proof-checking-for-the-lambda-pi-calculus-modulo-rewriting-2102.08766</loc><lastmod>2022-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-fast-concurrent-proof-checking-for-the-lambda-pi-calculus-modulo-rewriting-2102.08766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-fast-concurrent-proof-checking-for-the-lambda-pi-calculus-modulo-rewriting-2102.08766"/></url>
<url><loc>https://scifaro.com/en/abs/an-asymptotic-analysis-of-probabilistic-logic-programming-with-implications-for-expressing-projective-families-of-distributions-2102.08777</loc><lastmod>2021-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-asymptotic-analysis-of-probabilistic-logic-programming-with-implications-for-expressing-projective-families-of-distributions-2102.08777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-asymptotic-analysis-of-probabilistic-logic-programming-with-implications-for-expressing-projective-families-of-distributions-2102.08777"/></url>
<url><loc>https://scifaro.com/en/abs/combinators-and-the-story-of-computation-2102.09658</loc><lastmod>2021-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinators-and-the-story-of-computation-2102.09658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinators-and-the-story-of-computation-2102.09658"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-and-axiomatization-for-stochastic-differential-dynamic-logic-2102.09667</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-and-axiomatization-for-stochastic-differential-dynamic-logic-2102.09667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-and-axiomatization-for-stochastic-differential-dynamic-logic-2102.09667"/></url>
<url><loc>https://scifaro.com/en/abs/crowbar-behavioral-symbolic-execution-for-deductive-verification-of-active-objects-2102.10127</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crowbar-behavioral-symbolic-execution-for-deductive-verification-of-active-objects-2102.10127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crowbar-behavioral-symbolic-execution-for-deductive-verification-of-active-objects-2102.10127"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-dependence-and-independence-the-local-variants-2102.10368</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-dependence-and-independence-the-local-variants-2102.10368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-dependence-and-independence-the-local-variants-2102.10368"/></url>
<url><loc>https://scifaro.com/en/abs/relative-expressiveness-of-defeasible-logics-ii-2102.10532</loc><lastmod>2024-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-expressiveness-of-defeasible-logics-ii-2102.10532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-expressiveness-of-defeasible-logics-ii-2102.10532"/></url>
<url><loc>https://scifaro.com/en/abs/mining-el-bases-with-adaptable-role-depth-2102.10689</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mining-el-bases-with-adaptable-role-depth-2102.10689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mining-el-bases-with-adaptable-role-depth-2102.10689"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-hidden-variable-problems-from-quantum-mechanics-by-logics-of-dependence-and-independence-2102.10931</loc><lastmod>2022-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-hidden-variable-problems-from-quantum-mechanics-by-logics-of-dependence-and-independence-2102.10931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-hidden-variable-problems-from-quantum-mechanics-by-logics-of-dependence-and-independence-2102.10931"/></url>
<url><loc>https://scifaro.com/en/abs/polymorphic-automorphisms-and-the-picard-group-2102.11081</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polymorphic-automorphisms-and-the-picard-group-2102.11081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polymorphic-automorphisms-and-the-picard-group-2102.11081"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-axiomatisability-of-parallel-composition-2102.11166</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-axiomatisability-of-parallel-composition-2102.11166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-axiomatisability-of-parallel-composition-2102.11166"/></url>
<url><loc>https://scifaro.com/en/abs/behavioral-qltl-2102.11184</loc><lastmod>2021-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioral-qltl-2102.11184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioral-qltl-2102.11184"/></url>
<url><loc>https://scifaro.com/en/abs/a-tier-based-typed-programming-language-characterizing-feasible-functionals-2102.11605</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tier-based-typed-programming-language-characterizing-feasible-functionals-2102.11605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tier-based-typed-programming-language-characterizing-feasible-functionals-2102.11605"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-completeness-of-proper-display-calculi-2102.11641</loc><lastmod>2021-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-completeness-of-proper-display-calculi-2102.11641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-completeness-of-proper-display-calculi-2102.11641"/></url>
<url><loc>https://scifaro.com/en/abs/relative-induction-principles-for-type-theories-2102.11649</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-induction-principles-for-type-theories-2102.11649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-induction-principles-for-type-theories-2102.11649"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-elgot-iteration-in-foundations-2102.11828</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-elgot-iteration-in-foundations-2102.11828"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-elgot-iteration-in-foundations-2102.11828"/></url>
<url><loc>https://scifaro.com/en/abs/finite-confluences-and-closed-pattern-mining-2102.11924</loc><lastmod>2021-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-confluences-and-closed-pattern-mining-2102.11924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-confluences-and-closed-pattern-mining-2102.11924"/></url>
<url><loc>https://scifaro.com/en/abs/being-correct-is-not-enough-efficient-verification-using-robust-linear-temporal-logic-2102.11991</loc><lastmod>2022-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/being-correct-is-not-enough-efficient-verification-using-robust-linear-temporal-logic-2102.11991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/being-correct-is-not-enough-efficient-verification-using-robust-linear-temporal-logic-2102.11991"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-parameterized-complexity-of-learning-first-order-logic-2102.12201</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-learning-first-order-logic-2102.12201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-parameterized-complexity-of-learning-first-order-logic-2102.12201"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-correspondence-for-hybrid-logic-with-binder-2102.13291</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-correspondence-for-hybrid-logic-with-binder-2102.13291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-correspondence-for-hybrid-logic-with-binder-2102.13291"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-universe-hierarchies-and-first-class-universe-levels-2103.00223</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-universe-hierarchies-and-first-class-universe-levels-2103.00223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-universe-hierarchies-and-first-class-universe-levels-2103.00223"/></url>
<url><loc>https://scifaro.com/en/abs/on-problems-dual-to-unification-the-string-rewriting-case-2103.00386</loc><lastmod>2024-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-problems-dual-to-unification-the-string-rewriting-case-2103.00386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-problems-dual-to-unification-the-string-rewriting-case-2103.00386"/></url>
<url><loc>https://scifaro.com/en/abs/on-causal-semantics-of-petri-nets-2103.00729</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-causal-semantics-of-petri-nets-2103.00729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-causal-semantics-of-petri-nets-2103.00729"/></url>
<url><loc>https://scifaro.com/en/abs/extending-prolog-for-quantified-boolean-horn-formulas-2103.01046</loc><lastmod>2021-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-prolog-for-quantified-boolean-horn-formulas-2103.01046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-prolog-for-quantified-boolean-horn-formulas-2103.01046"/></url>
<url><loc>https://scifaro.com/en/abs/the-fusemate-logic-programming-system-system-description-2103.01395</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fusemate-logic-programming-system-system-description-2103.01395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fusemate-logic-programming-system-system-description-2103.01395"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-processes-and-conflicts-in-place-transition-systems-2103.01490</loc><lastmod>2021-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-processes-and-conflicts-in-place-transition-systems-2103.01490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-processes-and-conflicts-in-place-transition-systems-2103.01490"/></url>
<url><loc>https://scifaro.com/en/abs/focus-style-proof-systems-and-interpolation-for-the-alternation-free-mu-calculus-2103.01671</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focus-style-proof-systems-and-interpolation-for-the-alternation-free-mu-calculus-2103.01671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focus-style-proof-systems-and-interpolation-for-the-alternation-free-mu-calculus-2103.01671"/></url>
<url><loc>https://scifaro.com/en/abs/sld-resolution-without-occur-check-an-example-2103.01911</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sld-resolution-without-occur-check-an-example-2103.01911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sld-resolution-without-occur-check-an-example-2103.01911"/></url>
<url><loc>https://scifaro.com/en/abs/internal-category-with-families-in-presheaves-2103.02024</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-category-with-families-in-presheaves-2103.02024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-category-with-families-in-presheaves-2103.02024"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-optimal-explanations-for-ensemble-trees-via-logical-reasoning-2103.02191</loc><lastmod>2021-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-optimal-explanations-for-ensemble-trees-via-logical-reasoning-2103.02191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-optimal-explanations-for-ensemble-trees-via-logical-reasoning-2103.02191"/></url>
<url><loc>https://scifaro.com/en/abs/provability-in-bi-s-sequent-calculus-is-decidable-2103.02343</loc><lastmod>2024-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provability-in-bi-s-sequent-calculus-is-decidable-2103.02343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provability-in-bi-s-sequent-calculus-is-decidable-2103.02343"/></url>
<url><loc>https://scifaro.com/en/abs/algebra-based-synthesis-of-loops-and-their-invariants-invited-paper-2103.03599</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebra-based-synthesis-of-loops-and-their-invariants-invited-paper-2103.03599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebra-based-synthesis-of-loops-and-their-invariants-invited-paper-2103.03599"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-graph-trail-properties-in-isabelle-hol-2103.03607</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-graph-trail-properties-in-isabelle-hol-2103.03607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-graph-trail-properties-in-isabelle-hol-2103.03607"/></url>
<url><loc>https://scifaro.com/en/abs/modal-reasoning-metric-reasoning-via-lawvere-2103.03871</loc><lastmod>2021-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-reasoning-metric-reasoning-via-lawvere-2103.03871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-reasoning-metric-reasoning-via-lawvere-2103.03871"/></url>
<url><loc>https://scifaro.com/en/abs/logical-foundations-personal-perspective-2103.03930</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-foundations-personal-perspective-2103.03930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-foundations-personal-perspective-2103.03930"/></url>
<url><loc>https://scifaro.com/en/abs/reduction-free-normalisation-for-a-proof-irrelevant-type-of-propositions-2103.04287</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reduction-free-normalisation-for-a-proof-irrelevant-type-of-propositions-2103.04287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reduction-free-normalisation-for-a-proof-irrelevant-type-of-propositions-2103.04287"/></url>
<url><loc>https://scifaro.com/en/abs/robust-model-checking-with-imprecise-markov-reward-models-2103.04841</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-model-checking-with-imprecise-markov-reward-models-2103.04841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-model-checking-with-imprecise-markov-reward-models-2103.04841"/></url>
<url><loc>https://scifaro.com/en/abs/multiway-turing-machines-2103.04961</loc><lastmod>2021-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiway-turing-machines-2103.04961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiway-turing-machines-2103.04961"/></url>
<url><loc>https://scifaro.com/en/abs/presburger-arithmetic-with-threshold-counting-quantifiers-is-easy-2103.05087</loc><lastmod>2021-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/presburger-arithmetic-with-threshold-counting-quantifiers-is-easy-2103.05087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/presburger-arithmetic-with-threshold-counting-quantifiers-is-easy-2103.05087"/></url>
<url><loc>https://scifaro.com/en/abs/the-modal-logic-of-stepwise-removal-2103.05117</loc><lastmod>2021-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-modal-logic-of-stepwise-removal-2103.05117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-modal-logic-of-stepwise-removal-2103.05117"/></url>
<url><loc>https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-1-foundation-2103.05581</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-1-foundation-2103.05581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-1-foundation-2103.05581"/></url>
<url><loc>https://scifaro.com/en/abs/relic-reduced-logic-inference-for-composition-for-quantifier-elimination-based-compositional-reasoning-and-verification-2103.05776</loc><lastmod>2021-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relic-reduced-logic-inference-for-composition-for-quantifier-elimination-based-compositional-reasoning-and-verification-2103.05776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relic-reduced-logic-inference-for-composition-for-quantifier-elimination-based-compositional-reasoning-and-verification-2103.05776"/></url>
<url><loc>https://scifaro.com/en/abs/residuation-for-soft-constraints-lexicographic-orders-and-approximation-techniques-2103.06741</loc><lastmod>2021-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/residuation-for-soft-constraints-lexicographic-orders-and-approximation-techniques-2103.06741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/residuation-for-soft-constraints-lexicographic-orders-and-approximation-techniques-2103.06741"/></url>
<url><loc>https://scifaro.com/en/abs/after-100-years-can-we-finally-crack-post-s-problem-of-tag-a-story-of-computational-irreducibility-and-more-2103.06931</loc><lastmod>2021-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/after-100-years-can-we-finally-crack-post-s-problem-of-tag-a-story-of-computational-irreducibility-and-more-2103.06931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/after-100-years-can-we-finally-crack-post-s-problem-of-tag-a-story-of-computational-irreducibility-and-more-2103.06931"/></url>
<url><loc>https://scifaro.com/en/abs/an-extensible-equality-checking-algorithm-for-dependent-type-theories-2103.07397</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extensible-equality-checking-algorithm-for-dependent-type-theories-2103.07397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extensible-equality-checking-algorithm-for-dependent-type-theories-2103.07397"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-sketch-conditions-and-constraints-a-category-independent-approach-2103.07558</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-sketch-conditions-and-constraints-a-category-independent-approach-2103.07558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-sketch-conditions-and-constraints-a-category-independent-approach-2103.07558"/></url>
<url><loc>https://scifaro.com/en/abs/proving-and-disproving-programs-with-shared-mutable-data-2103.07699</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-and-disproving-programs-with-shared-mutable-data-2103.07699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-and-disproving-programs-with-shared-mutable-data-2103.07699"/></url>
<url><loc>https://scifaro.com/en/abs/imperative-process-algebra-with-abstraction-2103.07863</loc><lastmod>2022-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imperative-process-algebra-with-abstraction-2103.07863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imperative-process-algebra-with-abstraction-2103.07863"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-fragments-of-first-order-logic-2103.08046</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-fragments-of-first-order-logic-2103.08046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-fragments-of-first-order-logic-2103.08046"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-to-verify-signal-temporal-logic-specifications-of-hybrid-systems-extended-technical-report-2103.08117</loc><lastmod>2021-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-to-verify-signal-temporal-logic-specifications-of-hybrid-systems-extended-technical-report-2103.08117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-to-verify-signal-temporal-logic-specifications-of-hybrid-systems-extended-technical-report-2103.08117"/></url>
<url><loc>https://scifaro.com/en/abs/specification-decomposition-for-reactive-synthesis-2103.08459</loc><lastmod>2021-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-decomposition-for-reactive-synthesis-2103.08459"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-decomposition-for-reactive-synthesis-2103.08459"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-projective-measurements-and-the-chsh-inequality-in-isabelle-hol-2103.08535</loc><lastmod>2021-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-projective-measurements-and-the-chsh-inequality-in-isabelle-hol-2103.08535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-projective-measurements-and-the-chsh-inequality-in-isabelle-hol-2103.08535"/></url>
<url><loc>https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-2-structure-2103.09092</loc><lastmod>2021-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-2-structure-2103.09092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-agda-universal-algebra-library-part-2-structure-2103.09092"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-isomorphic-subgraphs-in-sat-long-version-2103.10267</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-isomorphic-subgraphs-in-sat-long-version-2103.10267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-isomorphic-subgraphs-in-sat-long-version-2103.10267"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-complete-semantics-based-on-undecidedness-blocking-2103.10701</loc><lastmod>2021-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-complete-semantics-based-on-undecidedness-blocking-2103.10701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-complete-semantics-based-on-undecidedness-blocking-2103.10701"/></url>
<url><loc>https://scifaro.com/en/abs/building-specifications-in-the-event-b-institution-2103.10881</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-specifications-in-the-event-b-institution-2103.10881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-specifications-in-the-event-b-institution-2103.10881"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-zagier-s-one-sentence-proof-2103.11389</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-zagier-s-one-sentence-proof-2103.11389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-zagier-s-one-sentence-proof-2103.11389"/></url>
<url><loc>https://scifaro.com/en/abs/a-superposition-based-calculus-for-quantum-diagrammatic-reasoning-and-beyond-2103.11709</loc><lastmod>2021-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-superposition-based-calculus-for-quantum-diagrammatic-reasoning-and-beyond-2103.11709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-superposition-based-calculus-for-quantum-diagrammatic-reasoning-and-beyond-2103.11709"/></url>
<url><loc>https://scifaro.com/en/abs/combinators-a-centennial-view-2103.12811</loc><lastmod>2021-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinators-a-centennial-view-2103.12811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinators-a-centennial-view-2103.12811"/></url>
<url><loc>https://scifaro.com/en/abs/on-counting-propositional-logic-2103.12862</loc><lastmod>2021-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-counting-propositional-logic-2103.12862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-counting-propositional-logic-2103.12862"/></url>
<url><loc>https://scifaro.com/en/abs/on-symmetry-and-quantification-a-new-approach-to-verify-distributed-protocols-2103.14831</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-symmetry-and-quantification-a-new-approach-to-verify-distributed-protocols-2103.14831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-symmetry-and-quantification-a-new-approach-to-verify-distributed-protocols-2103.14831"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-logic-of-functional-dependence-2103.14946</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-logic-of-functional-dependence-2103.14946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-logic-of-functional-dependence-2103.14946"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hierarchical-community-structure-of-practical-boolean-formulas-2103.14992</loc><lastmod>2021-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hierarchical-community-structure-of-practical-boolean-formulas-2103.14992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hierarchical-community-structure-of-practical-boolean-formulas-2103.14992"/></url>
<url><loc>https://scifaro.com/en/abs/deriving-laws-for-developing-concurrent-programs-in-a-rely-guarantee-style-2103.15292</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deriving-laws-for-developing-concurrent-programs-in-a-rely-guarantee-style-2103.15292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deriving-laws-for-developing-concurrent-programs-in-a-rely-guarantee-style-2103.15292"/></url>
<url><loc>https://scifaro.com/en/abs/disentangling-parallelism-and-interference-in-game-semantics-2103.15453</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disentangling-parallelism-and-interference-in-game-semantics-2103.15453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disentangling-parallelism-and-interference-in-game-semantics-2103.15453"/></url>
<url><loc>https://scifaro.com/en/abs/a-web-interface-for-petri-nets-with-transits-and-petri-games-2103.15521</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-web-interface-for-petri-nets-with-transits-and-petri-games-2103.15521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-web-interface-for-petri-nets-with-transits-and-petri-games-2103.15521"/></url>
<url><loc>https://scifaro.com/en/abs/enabling-replications-and-contexts-in-reversible-concurrent-calculus-2103.15623</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enabling-replications-and-contexts-in-reversible-concurrent-calculus-2103.15623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enabling-replications-and-contexts-in-reversible-concurrent-calculus-2103.15623"/></url>
<url><loc>https://scifaro.com/en/abs/representation-of-a-vehicular-traffic-model-using-hybrid-systems-2103.15710</loc><lastmod>2021-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-of-a-vehicular-traffic-model-using-hybrid-systems-2103.15710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-of-a-vehicular-traffic-model-using-hybrid-systems-2103.15710"/></url>
<url><loc>https://scifaro.com/en/abs/zx-calculus-and-extended-wolfram-model-systems-ii-fast-diagrammatic-reasoning-with-an-application-to-quantum-circuit-simplification-2103.15820</loc><lastmod>2021-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zx-calculus-and-extended-wolfram-model-systems-ii-fast-diagrammatic-reasoning-with-an-application-to-quantum-circuit-simplification-2103.15820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zx-calculus-and-extended-wolfram-model-systems-ii-fast-diagrammatic-reasoning-with-an-application-to-quantum-circuit-simplification-2103.15820"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-envelopes-2103.16156</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-envelopes-2103.16156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-envelopes-2103.16156"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-power-of-algebraic-approximations-of-graph-isomorphism-2103.16294</loc><lastmod>2021-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-power-of-algebraic-approximations-of-graph-isomorphism-2103.16294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-power-of-algebraic-approximations-of-graph-isomorphism-2103.16294"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-framework-for-congruence-of-applicative-bisimilarity-in-higher-order-languages-2103.16833</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-framework-for-congruence-of-applicative-bisimilarity-in-higher-order-languages-2103.16833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-framework-for-congruence-of-applicative-bisimilarity-in-higher-order-languages-2103.16833"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-instruction-set-semantics-via-type-classes-2104.00762</loc><lastmod>2022-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-instruction-set-semantics-via-type-classes-2104.00762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-instruction-set-semantics-via-type-classes-2104.00762"/></url>
<url><loc>https://scifaro.com/en/abs/solving-homotopy-domain-equations-2104.01195</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-homotopy-domain-equations-2104.01195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-homotopy-domain-equations-2104.01195"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-for-a-computational-lambda-calculus-with-global-state-2104.01358</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-for-a-computational-lambda-calculus-with-global-state-2104.01358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-for-a-computational-lambda-calculus-with-global-state-2104.01358"/></url>
<url><loc>https://scifaro.com/en/abs/place-bisimilarity-is-decidable-indeed-2104.01392</loc><lastmod>2024-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/place-bisimilarity-is-decidable-indeed-2104.01392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/place-bisimilarity-is-decidable-indeed-2104.01392"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-programming-language-as-an-instrument-for-specifying-and-verifying-dynamic-memory-2104.01667</loc><lastmod>2021-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-programming-language-as-an-instrument-for-specifying-and-verifying-dynamic-memory-2104.01667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-programming-language-as-an-instrument-for-specifying-and-verifying-dynamic-memory-2104.01667"/></url>
<url><loc>https://scifaro.com/en/abs/connecting-constructive-notions-of-ordinals-in-homotopy-type-theory-2104.02549</loc><lastmod>2022-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connecting-constructive-notions-of-ordinals-in-homotopy-type-theory-2104.02549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connecting-constructive-notions-of-ordinals-in-homotopy-type-theory-2104.02549"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-elimination-distance-to-first-order-logic-properties-2104.02998</loc><lastmod>2021-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-elimination-distance-to-first-order-logic-properties-2104.02998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-elimination-distance-to-first-order-logic-properties-2104.02998"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-heap-for-constrained-horn-clauses-extended-technical-report-2104.04224</loc><lastmod>2021-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-heap-for-constrained-horn-clauses-extended-technical-report-2104.04224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-heap-for-constrained-horn-clauses-extended-technical-report-2104.04224"/></url>
<url><loc>https://scifaro.com/en/abs/semantical-investigations-on-non-classical-logics-with-recovery-operators-negation-2104.04284</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantical-investigations-on-non-classical-logics-with-recovery-operators-negation-2104.04284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantical-investigations-on-non-classical-logics-with-recovery-operators-negation-2104.04284"/></url>
<url><loc>https://scifaro.com/en/abs/on-elementary-logics-for-quantitative-dependencies-2104.04313</loc><lastmod>2021-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-elementary-logics-for-quantitative-dependencies-2104.04313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-elementary-logics-for-quantitative-dependencies-2104.04313"/></url>
<url><loc>https://scifaro.com/en/abs/inapproximability-of-unique-games-in-fixed-point-logic-with-counting-2104.04566</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inapproximability-of-unique-games-in-fixed-point-logic-with-counting-2104.04566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inapproximability-of-unique-games-in-fixed-point-logic-with-counting-2104.04566"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-logic-with-classical-proofs-and-refutations-extended-version-2104.04589</loc><lastmod>2021-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-logic-with-classical-proofs-and-refutations-extended-version-2104.04589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-logic-with-classical-proofs-and-refutations-extended-version-2104.04589"/></url>
<url><loc>https://scifaro.com/en/abs/a-scalable-algorithm-for-decentralized-actor-termination-detection-2104.05128</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-scalable-algorithm-for-decentralized-actor-termination-detection-2104.05128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-scalable-algorithm-for-decentralized-actor-termination-detection-2104.05128"/></url>
<url><loc>https://scifaro.com/en/abs/online-machine-learning-techniques-for-coq-a-comparison-2104.05207</loc><lastmod>2021-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-machine-learning-techniques-for-coq-a-comparison-2104.05207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-machine-learning-techniques-for-coq-a-comparison-2104.05207"/></url>
<url><loc>https://scifaro.com/en/abs/a-coq-formalization-of-lebesgue-integration-of-nonnegative-functions-2104.05256</loc><lastmod>2021-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coq-formalization-of-lebesgue-integration-of-nonnegative-functions-2104.05256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coq-formalization-of-lebesgue-integration-of-nonnegative-functions-2104.05256"/></url>
<url><loc>https://scifaro.com/en/abs/quotients-of-bounded-natural-functors-2104.05348</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quotients-of-bounded-natural-functors-2104.05348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quotients-of-bounded-natural-functors-2104.05348"/></url>
<url><loc>https://scifaro.com/en/abs/actors-a-process-algebra-based-approach-2104.05438</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/actors-a-process-algebra-based-approach-2104.05438"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/actors-a-process-algebra-based-approach-2104.05438"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-denotational-semantics-of-higher-order-probabilistic-programs-beyond-the-discrete-case-2104.06016</loc><lastmod>2021-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-denotational-semantics-of-higher-order-probabilistic-programs-beyond-the-discrete-case-2104.06016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-denotational-semantics-of-higher-order-probabilistic-programs-beyond-the-discrete-case-2104.06016"/></url>
<url><loc>https://scifaro.com/en/abs/good-for-game-qptl-an-alternating-hodges-semantics-2104.06085</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/good-for-game-qptl-an-alternating-hodges-semantics-2104.06085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/good-for-game-qptl-an-alternating-hodges-semantics-2104.06085"/></url>
<url><loc>https://scifaro.com/en/abs/almost-all-classical-theorems-are-intuitionistic-2104.06723</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-all-classical-theorems-are-intuitionistic-2104.06723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-all-classical-theorems-are-intuitionistic-2104.06723"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-processes-with-expected-stopping-time-2104.07278</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-processes-with-expected-stopping-time-2104.07278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-processes-with-expected-stopping-time-2104.07278"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-time-and-space-tradeoffs-for-probabilistic-verification-2104.07466</loc><lastmod>2021-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-time-and-space-tradeoffs-for-probabilistic-verification-2104.07466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-time-and-space-tradeoffs-for-probabilistic-verification-2104.07466"/></url>
<url><loc>https://scifaro.com/en/abs/log-set-formulas-as-programs-2104.08130</loc><lastmod>2021-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/log-set-formulas-as-programs-2104.08130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/log-set-formulas-as-programs-2104.08130"/></url>
<url><loc>https://scifaro.com/en/abs/dependent-type-theory-as-related-to-the-bourbaki-notions-of-structure-and-isomorphism-2104.08958</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependent-type-theory-as-related-to-the-bourbaki-notions-of-structure-and-isomorphism-2104.08958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependent-type-theory-as-related-to-the-bourbaki-notions-of-structure-and-isomorphism-2104.08958"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-polynomial-trajectories-for-ltl-verification-2104.08980</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-polynomial-trajectories-for-ltl-verification-2104.08980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-polynomial-trajectories-for-ltl-verification-2104.08980"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-denotational-semantics-for-proofs-in-constructive-modal-logic-2104.09115</loc><lastmod>2021-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-denotational-semantics-for-proofs-in-constructive-modal-logic-2104.09115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-denotational-semantics-for-proofs-in-constructive-modal-logic-2104.09115"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-and-complexity-in-weakening-and-contraction-hypersequent-substructural-logics-2104.09716</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-and-complexity-in-weakening-and-contraction-hypersequent-substructural-logics-2104.09716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-and-complexity-in-weakening-and-contraction-hypersequent-substructural-logics-2104.09716"/></url>
<url><loc>https://scifaro.com/en/abs/on-link-deletion-and-point-deletion-in-games-on-graphs-2104.09816</loc><lastmod>2021-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-link-deletion-and-point-deletion-in-games-on-graphs-2104.09816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-link-deletion-and-point-deletion-in-games-on-graphs-2104.09816"/></url>
<url><loc>https://scifaro.com/en/abs/an-initial-algebra-theorem-without-iteration-2104.09837</loc><lastmod>2022-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-initial-algebra-theorem-without-iteration-2104.09837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-initial-algebra-theorem-without-iteration-2104.09837"/></url>
<url><loc>https://scifaro.com/en/abs/a-polyhedral-abstraction-for-petri-nets-and-its-application-to-smt-based-model-checking-2104.09850</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-polyhedral-abstraction-for-petri-nets-and-its-application-to-smt-based-model-checking-2104.09850"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-polyhedral-abstraction-for-petri-nets-and-its-application-to-smt-based-model-checking-2104.09850"/></url>
<url><loc>https://scifaro.com/en/abs/on-reduction-and-normalization-in-the-computational-core-2104.10267</loc><lastmod>2022-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-reduction-and-normalization-in-the-computational-core-2104.10267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-reduction-and-normalization-in-the-computational-core-2104.10267"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-width-of-regular-classes-of-finite-structures-2104.10286</loc><lastmod>2021-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-width-of-regular-classes-of-finite-structures-2104.10286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-width-of-regular-classes-of-finite-structures-2104.10286"/></url>
<url><loc>https://scifaro.com/en/abs/tutorial-designing-distributed-software-in-mcrl2-2104.10542</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tutorial-designing-distributed-software-in-mcrl2-2104.10542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tutorial-designing-distributed-software-in-mcrl2-2104.10542"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-more-efficient-approach-for-the-satisfiability-of-two-variable-logic-2104.10621</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-more-efficient-approach-for-the-satisfiability-of-two-variable-logic-2104.10621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-more-efficient-approach-for-the-satisfiability-of-two-variable-logic-2104.10621"/></url>
<url><loc>https://scifaro.com/en/abs/the-orbit-problem-for-parametric-linear-dynamical-systems-2104.10634</loc><lastmod>2021-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-orbit-problem-for-parametric-linear-dynamical-systems-2104.10634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-orbit-problem-for-parametric-linear-dynamical-systems-2104.10634"/></url>
<url><loc>https://scifaro.com/en/abs/on-sequentiality-and-well-bracketing-in-the-pi-calculus-2104.10942</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-sequentiality-and-well-bracketing-in-the-pi-calculus-2104.10942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-sequentiality-and-well-bracketing-in-the-pi-calculus-2104.10942"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-and-verification-of-reconfigurable-multi-agent-systems-2104.10998</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-and-verification-of-reconfigurable-multi-agent-systems-2104.10998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-and-verification-of-reconfigurable-multi-agent-systems-2104.10998"/></url>
<url><loc>https://scifaro.com/en/abs/cameleer-a-deductive-verification-tool-for-ocaml-extended-version-2104.11050</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cameleer-a-deductive-verification-tool-for-ocaml-extended-version-2104.11050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cameleer-a-deductive-verification-tool-for-ocaml-extended-version-2104.11050"/></url>
<url><loc>https://scifaro.com/en/abs/universal-horn-sentences-and-the-joint-embedding-property-2104.11123</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-horn-sentences-and-the-joint-embedding-property-2104.11123"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-horn-sentences-and-the-joint-embedding-property-2104.11123"/></url>
<url><loc>https://scifaro.com/en/abs/ackermann-s-function-in-iterative-form-a-proof-assistant-experiment-2104.11157</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ackermann-s-function-in-iterative-form-a-proof-assistant-experiment-2104.11157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ackermann-s-function-in-iterative-form-a-proof-assistant-experiment-2104.11157"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-approach-to-cnf-sat-from-a-probabilistic-point-of-view-2104.11233</loc><lastmod>2021-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-approach-to-cnf-sat-from-a-probabilistic-point-of-view-2104.11233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-approach-to-cnf-sat-from-a-probabilistic-point-of-view-2104.11233"/></url>
<url><loc>https://scifaro.com/en/abs/tractability-of-quantified-temporal-constraints-to-the-max-2104.11442</loc><lastmod>2021-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractability-of-quantified-temporal-constraints-to-the-max-2104.11442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractability-of-quantified-temporal-constraints-to-the-max-2104.11442"/></url>
<url><loc>https://scifaro.com/en/abs/reflexive-combinatory-algebras-2104.11449</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflexive-combinatory-algebras-2104.11449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflexive-combinatory-algebras-2104.11449"/></url>
<url><loc>https://scifaro.com/en/abs/decision-tree-learning-in-cegis-based-termination-analysis-2104.11463</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-tree-learning-in-cegis-based-termination-analysis-2104.11463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-tree-learning-in-cegis-based-termination-analysis-2104.11463"/></url>
<url><loc>https://scifaro.com/en/abs/a-multi-agent-model-for-polarization-under-confirmation-bias-in-social-networks-2104.11538</loc><lastmod>2021-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-multi-agent-model-for-polarization-under-confirmation-bias-in-social-networks-2104.11538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-multi-agent-model-for-polarization-under-confirmation-bias-in-social-networks-2104.11538"/></url>
<url><loc>https://scifaro.com/en/abs/producing-symmetrical-facts-for-lists-induced-by-the-list-reversal-mapping-in-isabelle-hol-2104.11622</loc><lastmod>2022-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/producing-symmetrical-facts-for-lists-induced-by-the-list-reversal-mapping-in-isabelle-hol-2104.11622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/producing-symmetrical-facts-for-lists-induced-by-the-list-reversal-mapping-in-isabelle-hol-2104.11622"/></url>
<url><loc>https://scifaro.com/en/abs/politeness-and-stable-infiniteness-stronger-together-2104.11738</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/politeness-and-stable-infiniteness-stronger-together-2104.11738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/politeness-and-stable-infiniteness-stronger-together-2104.11738"/></url>
<url><loc>https://scifaro.com/en/abs/on-logics-and-homomorphism-closure-2104.11955</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-logics-and-homomorphism-closure-2104.11955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-logics-and-homomorphism-closure-2104.11955"/></url>
<url><loc>https://scifaro.com/en/abs/on-measure-quantifiers-in-first-order-arithmetic-long-version-2104.12124</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-measure-quantifiers-in-first-order-arithmetic-long-version-2104.12124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-measure-quantifiers-in-first-order-arithmetic-long-version-2104.12124"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-s-metalogic-formalization-and-proof-checker-2104.12224</loc><lastmod>2021-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-s-metalogic-formalization-and-proof-checker-2104.12224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-s-metalogic-formalization-and-proof-checker-2104.12224"/></url>
<url><loc>https://scifaro.com/en/abs/improved-bounded-model-checking-of-timed-automata-2104.12444</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-bounded-model-checking-of-timed-automata-2104.12444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-bounded-model-checking-of-timed-automata-2104.12444"/></url>
<url><loc>https://scifaro.com/en/abs/bijective-proofs-for-eulerian-numbers-of-types-b-and-d-2104.12445</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bijective-proofs-for-eulerian-numbers-of-types-b-and-d-2104.12445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bijective-proofs-for-eulerian-numbers-of-types-b-and-d-2104.12445"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-controller-synthesis-for-timed-systems-2104.12577</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-controller-synthesis-for-timed-systems-2104.12577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-controller-synthesis-for-timed-systems-2104.12577"/></url>
<url><loc>https://scifaro.com/en/abs/the-relative-consistency-of-the-axiom-of-choice-mechanized-using-isabelle-zf-2104.12674</loc><lastmod>2021-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-relative-consistency-of-the-axiom-of-choice-mechanized-using-isabelle-zf-2104.12674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-relative-consistency-of-the-axiom-of-choice-mechanized-using-isabelle-zf-2104.12674"/></url>
<url><loc>https://scifaro.com/en/abs/the-reachability-problem-for-petri-nets-is-not-primitive-recursive-2104.12695</loc><lastmod>2021-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-reachability-problem-for-petri-nets-is-not-primitive-recursive-2104.12695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-reachability-problem-for-petri-nets-is-not-primitive-recursive-2104.12695"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-extensions-of-hyperltl-2104.12886</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-extensions-of-hyperltl-2104.12886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-extensions-of-hyperltl-2104.12886"/></url>
<url><loc>https://scifaro.com/en/abs/separating-rank-logic-from-polynomial-time-2104.12999</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-rank-logic-from-polynomial-time-2104.12999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-rank-logic-from-polynomial-time-2104.12999"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-validity-2104.13021</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-validity-2104.13021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-validity-2104.13021"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-decision-procedure-for-orders-in-isabelle-hol-2104.13117</loc><lastmod>2021-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-decision-procedure-for-orders-in-isabelle-hol-2104.13117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-decision-procedure-for-orders-in-isabelle-hol-2104.13117"/></url>
<url><loc>https://scifaro.com/en/abs/why-does-propositional-quantification-make-modal-and-temporal-logics-on-trees-robustly-hard-2104.13122</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/why-does-propositional-quantification-make-modal-and-temporal-logics-on-trees-robustly-hard-2104.13122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/why-does-propositional-quantification-make-modal-and-temporal-logics-on-trees-robustly-hard-2104.13122"/></url>
<url><loc>https://scifaro.com/en/abs/combinatorial-proofs-and-decomposition-theorems-for-first-order-logic-2104.13124</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatorial-proofs-and-decomposition-theorems-for-first-order-logic-2104.13124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatorial-proofs-and-decomposition-theorems-for-first-order-logic-2104.13124"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-local-computation-of-differential-bisimulations-via-coupling-and-up-to-methods-2104.13160</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-local-computation-of-differential-bisimulations-via-coupling-and-up-to-methods-2104.13160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-local-computation-of-differential-bisimulations-via-coupling-and-up-to-methods-2104.13160"/></url>
<url><loc>https://scifaro.com/en/abs/the-ksmt-calculus-is-a-delta-complete-decision-procedure-for-non-linear-constraints-2104.13269</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-ksmt-calculus-is-a-delta-complete-decision-procedure-for-non-linear-constraints-2104.13269"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-ksmt-calculus-is-a-delta-complete-decision-procedure-for-non-linear-constraints-2104.13269"/></url>
<url><loc>https://scifaro.com/en/abs/on-generalized-metric-spaces-for-the-simply-typed-lambda-calculus-extended-version-2104.13324</loc><lastmod>2021-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-generalized-metric-spaces-for-the-simply-typed-lambda-calculus-extended-version-2104.13324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-generalized-metric-spaces-for-the-simply-typed-lambda-calculus-extended-version-2104.13324"/></url>
<url><loc>https://scifaro.com/en/abs/truth-and-knowledge-2104.13573</loc><lastmod>2022-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truth-and-knowledge-2104.13573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truth-and-knowledge-2104.13573"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-causes-in-markov-chains-2104.13604</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-causes-in-markov-chains-2104.13604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-causes-in-markov-chains-2104.13604"/></url>
<url><loc>https://scifaro.com/en/abs/typability-and-type-inference-in-atomic-polymorphism-2104.13675</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typability-and-type-inference-in-atomic-polymorphism-2104.13675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typability-and-type-inference-in-atomic-polymorphism-2104.13675"/></url>
<url><loc>https://scifaro.com/en/abs/linear-additives-2104.13739</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-additives-2104.13739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-additives-2104.13739"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanised-proof-of-g-odel-s-incompleteness-theorems-using-nominal-isabelle-2104.13792</loc><lastmod>2021-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanised-proof-of-g-odel-s-incompleteness-theorems-using-nominal-isabelle-2104.13792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanised-proof-of-g-odel-s-incompleteness-theorems-using-nominal-isabelle-2104.13792"/></url>
<url><loc>https://scifaro.com/en/abs/the-space-of-interaction-long-version-2104.13795</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-space-of-interaction-long-version-2104.13795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-space-of-interaction-long-version-2104.13795"/></url>
<url><loc>https://scifaro.com/en/abs/verified-approximation-algorithms-2104.13851</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-approximation-algorithms-2104.13851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-approximation-algorithms-2104.13851"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-bounds-and-strong-call-by-value-normalization-2104.13979</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-bounds-and-strong-call-by-value-normalization-2104.13979"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-bounds-and-strong-call-by-value-normalization-2104.13979"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-for-asynchronous-hyperproperties-2104.14025</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-for-asynchronous-hyperproperties-2104.14025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-for-asynchronous-hyperproperties-2104.14025"/></url>
<url><loc>https://scifaro.com/en/abs/a-normal-form-characterization-for-efficient-boolean-skolem-function-synthesis-2104.14098</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-normal-form-characterization-for-efficient-boolean-skolem-function-synthesis-2104.14098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-normal-form-characterization-for-efficient-boolean-skolem-function-synthesis-2104.14098"/></url>
<url><loc>https://scifaro.com/en/abs/initial-limit-datalog-a-new-extensible-class-of-decidable-constrained-horn-clauses-2104.14175</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-limit-datalog-a-new-extensible-class-of-decidable-constrained-horn-clauses-2104.14175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-limit-datalog-a-new-extensible-class-of-decidable-constrained-horn-clauses-2104.14175"/></url>
<url><loc>https://scifaro.com/en/abs/assuming-just-enough-fairness-to-make-session-types-complete-for-lock-freedom-2104.14226</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assuming-just-enough-fairness-to-make-session-types-complete-for-lock-freedom-2104.14226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assuming-just-enough-fairness-to-make-session-types-complete-for-lock-freedom-2104.14226"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizations-and-computability-of-weighted-monadic-second-order-logic-2104.14266</loc><lastmod>2021-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizations-and-computability-of-weighted-monadic-second-order-logic-2104.14266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizations-and-computability-of-weighted-monadic-second-order-logic-2104.14266"/></url>
<url><loc>https://scifaro.com/en/abs/moonlight-a-lightweight-tool-for-monitoring-spatio-temporal-properties-2104.14333</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moonlight-a-lightweight-tool-for-monitoring-spatio-temporal-properties-2104.14333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moonlight-a-lightweight-tool-for-monitoring-spatio-temporal-properties-2104.14333"/></url>
<url><loc>https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-finite-model-theory-through-the-constructive-lens-2104.14445</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-finite-model-theory-through-the-constructive-lens-2104.14445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trakhtenbrot-s-theorem-in-coq-finite-model-theory-through-the-constructive-lens-2104.14445"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2104.14669</loc><lastmod>2022-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2104.14669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2104.14669"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagram-rewrite-theory-ii-rewriting-with-symmetric-monoidal-structure-2104.14686</loc><lastmod>2022-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-ii-rewriting-with-symmetric-monoidal-structure-2104.14686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-ii-rewriting-with-symmetric-monoidal-structure-2104.14686"/></url>
<url><loc>https://scifaro.com/en/abs/tableau-based-decision-procedure-for-non-fregean-logic-of-sentential-identity-2104.14697</loc><lastmod>2021-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-non-fregean-logic-of-sentential-identity-2104.14697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableau-based-decision-procedure-for-non-fregean-logic-of-sentential-identity-2104.14697"/></url>
<url><loc>https://scifaro.com/en/abs/multi-structural-games-and-number-of-quantifiers-2104.14709</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-structural-games-and-number-of-quantifiers-2104.14709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-structural-games-and-number-of-quantifiers-2104.14709"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-functions-as-non-deterministic-processes-extended-version-2104.14759</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-functions-as-non-deterministic-processes-extended-version-2104.14759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-functions-as-non-deterministic-processes-extended-version-2104.14759"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-two-truly-concurrent-equivalences-for-finite-bounded-petri-nets-2104.14856</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-two-truly-concurrent-equivalences-for-finite-bounded-petri-nets-2104.14856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-two-truly-concurrent-equivalences-for-finite-bounded-petri-nets-2104.14856"/></url>
<url><loc>https://scifaro.com/en/abs/a-decidable-equivalence-for-a-turing-complete-distributed-model-of-computation-2104.14859</loc><lastmod>2022-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decidable-equivalence-for-a-turing-complete-distributed-model-of-computation-2104.14859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decidable-equivalence-for-a-turing-complete-distributed-model-of-computation-2104.14859"/></url>
<url><loc>https://scifaro.com/en/abs/resource-separation-in-dynamic-logic-of-propositional-assignments-2104.14884</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-separation-in-dynamic-logic-of-propositional-assignments-2104.14884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-separation-in-dynamic-logic-of-propositional-assignments-2104.14884"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-stream-logic-modulo-theories-full-version-2104.14988</loc><lastmod>2022-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-stream-logic-modulo-theories-full-version-2104.14988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-stream-logic-modulo-theories-full-version-2104.14988"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-face-lattice-of-polyhedra-2104.15021</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-face-lattice-of-polyhedra-2104.15021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-face-lattice-of-polyhedra-2104.15021"/></url>
<url><loc>https://scifaro.com/en/abs/some-constructive-variants-of-s4-with-the-finite-model-property-2104.15053</loc><lastmod>2021-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-constructive-variants-of-s4-with-the-finite-model-property-2104.15053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-constructive-variants-of-s4-with-the-finite-model-property-2104.15053"/></url>
<url><loc>https://scifaro.com/en/abs/types-are-internal-infty-groupoids-2105.00024</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/types-are-internal-infty-groupoids-2105.00024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/types-are-internal-infty-groupoids-2105.00024"/></url>
<url><loc>https://scifaro.com/en/abs/lr-multisemigroups-and-modal-convolution-algebras-2105.00188</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lr-multisemigroups-and-modal-convolution-algebras-2105.00188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lr-multisemigroups-and-modal-convolution-algebras-2105.00188"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-tight-typing-in-a-unified-framework-2105.00564</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-tight-typing-in-a-unified-framework-2105.00564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-tight-typing-in-a-unified-framework-2105.00564"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-behavioural-inequivalence-generically-in-quasilinear-time-2105.00669</loc><lastmod>2021-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-behavioural-inequivalence-generically-in-quasilinear-time-2105.00669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-behavioural-inequivalence-generically-in-quasilinear-time-2105.00669"/></url>
<url><loc>https://scifaro.com/en/abs/in-search-of-lost-time-axiomatising-parallel-composition-in-process-algebras-2105.00735</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/in-search-of-lost-time-axiomatising-parallel-composition-in-process-algebras-2105.00735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/in-search-of-lost-time-axiomatising-parallel-composition-in-process-algebras-2105.00735"/></url>
<url><loc>https://scifaro.com/en/abs/what-s-decidable-about-atomic-polymorphism-2105.00748</loc><lastmod>2021-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-s-decidable-about-atomic-polymorphism-2105.00748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-s-decidable-about-atomic-polymorphism-2105.00748"/></url>
<url><loc>https://scifaro.com/en/abs/generating-extended-resolution-proofs-with-a-bdd-based-sat-solver-2105.00885</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-extended-resolution-proofs-with-a-bdd-based-sat-solver-2105.00885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-extended-resolution-proofs-with-a-bdd-based-sat-solver-2105.00885"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-clones-for-abstract-syntax-2105.00969</loc><lastmod>2024-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-clones-for-abstract-syntax-2105.00969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-clones-for-abstract-syntax-2105.00969"/></url>
<url><loc>https://scifaro.com/en/abs/a-subatomic-proof-system-for-decision-trees-2105.01382</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-subatomic-proof-system-for-decision-trees-2105.01382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-subatomic-proof-system-for-decision-trees-2105.01382"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-model-checking-step-by-step-2105.01861</loc><lastmod>2021-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-model-checking-step-by-step-2105.01861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-model-checking-step-by-step-2105.01861"/></url>
<url><loc>https://scifaro.com/en/abs/flavours-of-sequential-information-flow-2105.02013</loc><lastmod>2021-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flavours-of-sequential-information-flow-2105.02013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flavours-of-sequential-information-flow-2105.02013"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-concurrent-rule-construction-for-double-pushout-rewriting-2105.02309</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-concurrent-rule-construction-for-double-pushout-rewriting-2105.02309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-concurrent-rule-construction-for-double-pushout-rewriting-2105.02309"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-typing-for-intersection-types-2105.02352</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-typing-for-intersection-types-2105.02352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-typing-for-intersection-types-2105.02352"/></url>
<url><loc>https://scifaro.com/en/abs/parallelized-sequential-composition-pipelines-and-hardware-weak-memory-models-2105.02444</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallelized-sequential-composition-pipelines-and-hardware-weak-memory-models-2105.02444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallelized-sequential-composition-pipelines-and-hardware-weak-memory-models-2105.02444"/></url>
<url><loc>https://scifaro.com/en/abs/positional-injectivity-for-innocent-strategies-2105.02485</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positional-injectivity-for-innocent-strategies-2105.02485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positional-injectivity-for-innocent-strategies-2105.02485"/></url>
<url><loc>https://scifaro.com/en/abs/probablistic-bigraphs-2105.02559</loc><lastmod>2022-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probablistic-bigraphs-2105.02559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probablistic-bigraphs-2105.02559"/></url>
<url><loc>https://scifaro.com/en/abs/concurrency-theorems-for-non-linear-rewriting-theories-2105.02842</loc><lastmod>2021-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrency-theorems-for-non-linear-rewriting-theories-2105.02842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrency-theorems-for-non-linear-rewriting-theories-2105.02842"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-procedure-for-a-theory-of-finite-sets-with-finite-integer-intervals-2105.03005</loc><lastmod>2026-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-procedure-for-a-theory-of-finite-sets-with-finite-integer-intervals-2105.03005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-procedure-for-a-theory-of-finite-sets-with-finite-integer-intervals-2105.03005"/></url>
<url><loc>https://scifaro.com/en/abs/lov-asz-type-theorems-and-game-comonads-2105.03274</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lov-asz-type-theorems-and-game-comonads-2105.03274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lov-asz-type-theorems-and-game-comonads-2105.03274"/></url>
<url><loc>https://scifaro.com/en/abs/gadts-functoriality-parametricity-pick-two-2105.03389</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gadts-functoriality-parametricity-pick-two-2105.03389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gadts-functoriality-parametricity-pick-two-2105.03389"/></url>
<url><loc>https://scifaro.com/en/abs/fast-automated-reasoning-over-string-diagrams-using-multiway-causal-structure-2105.04057</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-automated-reasoning-over-string-diagrams-using-multiway-causal-structure-2105.04057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-automated-reasoning-over-string-diagrams-using-multiway-causal-structure-2105.04057"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-reasoning-about-lf-specifications-2105.04110</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-reasoning-about-lf-specifications-2105.04110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-reasoning-about-lf-specifications-2105.04110"/></url>
<url><loc>https://scifaro.com/en/abs/hyperltl-satisfiability-is-sigma-1-1-complete-hyperctl-satisfiability-is-sigma-1-2-complete-2105.04176</loc><lastmod>2021-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperltl-satisfiability-is-sigma-1-1-complete-hyperctl-satisfiability-is-sigma-1-2-complete-2105.04176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperltl-satisfiability-is-sigma-1-1-complete-hyperctl-satisfiability-is-sigma-1-2-complete-2105.04176"/></url>
<url><loc>https://scifaro.com/en/abs/incorrectness-logic-for-graph-programs-2105.04501</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorrectness-logic-for-graph-programs-2105.04501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorrectness-logic-for-graph-programs-2105.04501"/></url>
<url><loc>https://scifaro.com/en/abs/fibrational-initial-algebra-final-coalgebra-coincidence-over-initial-algebras-turning-verification-witnesses-upside-down-2105.04817</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fibrational-initial-algebra-final-coalgebra-coincidence-over-initial-algebras-turning-verification-witnesses-upside-down-2105.04817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fibrational-initial-algebra-final-coalgebra-coincidence-over-initial-algebras-turning-verification-witnesses-upside-down-2105.04817"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-template-games-and-the-gray-tensor-product-of-2-categories-2105.04929</loc><lastmod>2021-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-template-games-and-the-gray-tensor-product-of-2-categories-2105.04929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-template-games-and-the-gray-tensor-product-of-2-categories-2105.04929"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verified-simulations-of-state-rich-processes-using-interaction-trees-in-isabelle-hol-2105.05133</loc><lastmod>2021-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verified-simulations-of-state-rich-processes-using-interaction-trees-in-isabelle-hol-2105.05133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verified-simulations-of-state-rich-processes-using-interaction-trees-in-isabelle-hol-2105.05133"/></url>
<url><loc>https://scifaro.com/en/abs/iltis-learning-logic-in-the-web-2105.05763</loc><lastmod>2022-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/iltis-learning-logic-in-the-web-2105.05763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/iltis-learning-logic-in-the-web-2105.05763"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-the-incremental-merkle-tree-algorithm-with-dafny-2105.06009</loc><lastmod>2021-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-the-incremental-merkle-tree-algorithm-with-dafny-2105.06009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-the-incremental-merkle-tree-algorithm-with-dafny-2105.06009"/></url>
<url><loc>https://scifaro.com/en/abs/tracelet-hopf-algebras-and-decomposition-spaces-extended-abstract-2105.06186</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracelet-hopf-algebras-and-decomposition-spaces-extended-abstract-2105.06186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracelet-hopf-algebras-and-decomposition-spaces-extended-abstract-2105.06186"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-model-checking-of-continuous-space-2105.06194</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-model-checking-of-continuous-space-2105.06194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-model-checking-of-continuous-space-2105.06194"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-fo-definability-of-regular-languages-2105.06202</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-fo-definability-of-regular-languages-2105.06202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-fo-definability-of-regular-languages-2105.06202"/></url>
<url><loc>https://scifaro.com/en/abs/a-graphical-calculus-for-lagrangian-relations-2105.06244</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graphical-calculus-for-lagrangian-relations-2105.06244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graphical-calculus-for-lagrangian-relations-2105.06244"/></url>
<url><loc>https://scifaro.com/en/abs/merit-and-blame-assignment-with-kind-2-2105.06575</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/merit-and-blame-assignment-with-kind-2-2105.06575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/merit-and-blame-assignment-with-kind-2-2105.06575"/></url>
<url><loc>https://scifaro.com/en/abs/on-bisimilarities-for-closure-spaces-preliminary-version-2105.06690</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bisimilarities-for-closure-spaces-preliminary-version-2105.06690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bisimilarities-for-closure-spaces-preliminary-version-2105.06690"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-reachability-problems-are-decidable-in-fifo-machines-2105.06723</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-reachability-problems-are-decidable-in-fifo-machines-2105.06723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-reachability-problems-are-decidable-in-fifo-machines-2105.06723"/></url>
<url><loc>https://scifaro.com/en/abs/a-separator-theorem-for-hypergraphs-and-a-csp-sat-algorithm-2105.06744</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-separator-theorem-for-hypergraphs-and-a-csp-sat-algorithm-2105.06744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-separator-theorem-for-hypergraphs-and-a-csp-sat-algorithm-2105.06744"/></url>
<url><loc>https://scifaro.com/en/abs/demonic-lattices-and-semilattices-in-relational-semigroups-with-ordinary-composition-2105.06787</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/demonic-lattices-and-semilattices-in-relational-semigroups-with-ordinary-composition-2105.06787"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/demonic-lattices-and-semilattices-in-relational-semigroups-with-ordinary-composition-2105.06787"/></url>
<url><loc>https://scifaro.com/en/abs/from-multisets-over-distributions-to-distributions-over-multisets-2105.06908</loc><lastmod>2021-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-multisets-over-distributions-to-distributions-over-multisets-2105.06908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-multisets-over-distributions-to-distributions-over-multisets-2105.06908"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-reasoning-and-efficient-semi-algebraic-proofs-2105.07531</loc><lastmod>2021-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-reasoning-and-efficient-semi-algebraic-proofs-2105.07531"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-reasoning-and-efficient-semi-algebraic-proofs-2105.07531"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatisation-for-divergence-preserving-branching-congruence-of-finite-state-behaviours-2105.07595</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatisation-for-divergence-preserving-branching-congruence-of-finite-state-behaviours-2105.07595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatisation-for-divergence-preserving-branching-congruence-of-finite-state-behaviours-2105.07595"/></url>
<url><loc>https://scifaro.com/en/abs/summing-up-smart-transitions-2105.07663</loc><lastmod>2021-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/summing-up-smart-transitions-2105.07663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/summing-up-smart-transitions-2105.07663"/></url>
<url><loc>https://scifaro.com/en/abs/deep-induction-rules-for-gadts-2105.08155</loc><lastmod>2021-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deep-induction-rules-for-gadts-2105.08155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deep-induction-rules-for-gadts-2105.08155"/></url>
<url><loc>https://scifaro.com/en/abs/the-topological-mu-calculus-completeness-and-decidability-2105.08231</loc><lastmod>2021-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-topological-mu-calculus-completeness-and-decidability-2105.08231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-topological-mu-calculus-completeness-and-decidability-2105.08231"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-and-approximate-monitoring-2105.08353</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-and-approximate-monitoring-2105.08353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-and-approximate-monitoring-2105.08353"/></url>
<url><loc>https://scifaro.com/en/abs/an-internal-language-for-categories-enriched-over-generalised-metric-spaces-2105.08473</loc><lastmod>2021-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-internal-language-for-categories-enriched-over-generalised-metric-spaces-2105.08473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-internal-language-for-categories-enriched-over-generalised-metric-spaces-2105.08473"/></url>
<url><loc>https://scifaro.com/en/abs/a-spatial-logic-for-simplicial-models-2105.08708</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spatial-logic-for-simplicial-models-2105.08708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spatial-logic-for-simplicial-models-2105.08708"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-logical-structure-of-choice-and-bar-induction-principles-2105.08951</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-logical-structure-of-choice-and-bar-induction-principles-2105.08951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-logical-structure-of-choice-and-bar-induction-principles-2105.08951"/></url>
<url><loc>https://scifaro.com/en/abs/everything-you-always-wanted-to-know-about-generalization-of-proof-obligations-in-pdr-2105.09169</loc><lastmod>2022-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/everything-you-always-wanted-to-know-about-generalization-of-proof-obligations-in-pdr-2105.09169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/everything-you-always-wanted-to-know-about-generalization-of-proof-obligations-in-pdr-2105.09169"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-characterisation-of-first-order-logic-with-neighbour-2105.09368</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-characterisation-of-first-order-logic-with-neighbour-2105.09368"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-characterisation-of-first-order-logic-with-neighbour-2105.09368"/></url>
<url><loc>https://scifaro.com/en/abs/from-verification-to-causality-based-explications-2105.09533</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-verification-to-causality-based-explications-2105.09533"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-verification-to-causality-based-explications-2105.09533"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-non-punctuality-for-timed-temporal-logic-with-freeze-quantifiers-2105.09534</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-non-punctuality-for-timed-temporal-logic-with-freeze-quantifiers-2105.09534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-non-punctuality-for-timed-temporal-logic-with-freeze-quantifiers-2105.09534"/></url>
<url><loc>https://scifaro.com/en/abs/lazybvtoint-at-the-smt-competition-2020-2105.09743</loc><lastmod>2021-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazybvtoint-at-the-smt-competition-2020-2105.09743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazybvtoint-at-the-smt-competition-2020-2105.09743"/></url>
<url><loc>https://scifaro.com/en/abs/join-inverse-rig-categories-for-reversible-functional-programming-and-beyond-2105.09929</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/join-inverse-rig-categories-for-reversible-functional-programming-and-beyond-2105.09929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/join-inverse-rig-categories-for-reversible-functional-programming-and-beyond-2105.09929"/></url>
<url><loc>https://scifaro.com/en/abs/expressivity-of-quantitative-modal-logics-categorical-foundations-via-codensity-and-approximation-2105.10164</loc><lastmod>2021-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressivity-of-quantitative-modal-logics-categorical-foundations-via-codensity-and-approximation-2105.10164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressivity-of-quantitative-modal-logics-categorical-foundations-via-codensity-and-approximation-2105.10164"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-order-complete-temporal-logic-for-structured-context-free-languages-2105.10740</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-order-complete-temporal-logic-for-structured-context-free-languages-2105.10740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-order-complete-temporal-logic-for-structured-context-free-languages-2105.10740"/></url>
<url><loc>https://scifaro.com/en/abs/pasocs-a-parallel-approximate-solver-for-probabilistic-logic-programs-under-the-credal-semantics-2105.10908</loc><lastmod>2021-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pasocs-a-parallel-approximate-solver-for-probabilistic-logic-programs-under-the-credal-semantics-2105.10908"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pasocs-a-parallel-approximate-solver-for-probabilistic-logic-programs-under-the-credal-semantics-2105.10908"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-references-2105.10914</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-references-2105.10914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-references-2105.10914"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-interpolation-via-nested-sequents-and-hypersequents-2105.10930</loc><lastmod>2021-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-interpolation-via-nested-sequents-and-hypersequents-2105.10930"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-interpolation-via-nested-sequents-and-hypersequents-2105.10930"/></url>
<url><loc>https://scifaro.com/en/abs/diagrammatic-polyhedral-algebra-2105.10946</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagrammatic-polyhedral-algebra-2105.10946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagrammatic-polyhedral-algebra-2105.10946"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-monitoring-dynamic-networks-of-spatially-distributed-cyber-physical-systems-2105.11400</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-monitoring-dynamic-networks-of-spatially-distributed-cyber-physical-systems-2105.11400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-monitoring-dynamic-networks-of-spatially-distributed-cyber-physical-systems-2105.11400"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-properties-of-first-order-modal-logics-of-linear-kripke-frames-in-restricted-languages-2105.11811</loc><lastmod>2021-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-properties-of-first-order-modal-logics-of-linear-kripke-frames-in-restricted-languages-2105.11811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-properties-of-first-order-modal-logics-of-linear-kripke-frames-in-restricted-languages-2105.11811"/></url>
<url><loc>https://scifaro.com/en/abs/a-beginner-guide-to-iris-coq-and-separation-logic-2105.12077</loc><lastmod>2025-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-beginner-guide-to-iris-coq-and-separation-logic-2105.12077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-beginner-guide-to-iris-coq-and-separation-logic-2105.12077"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-monitoring-for-markov-decision-processes-2105.12322</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-monitoring-for-markov-decision-processes-2105.12322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-monitoring-for-markov-decision-processes-2105.12322"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-finite-horizon-markov-chains-with-probabilistic-inference-2105.12326</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-finite-horizon-markov-chains-with-probabilistic-inference-2105.12326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-finite-horizon-markov-chains-with-probabilistic-inference-2105.12326"/></url>
<url><loc>https://scifaro.com/en/abs/tempest-synthesis-tool-for-reactive-systems-and-shields-in-probabilistic-environments-2105.12588</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tempest-synthesis-tool-for-reactive-systems-and-shields-in-probabilistic-environments-2105.12588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tempest-synthesis-tool-for-reactive-systems-and-shields-in-probabilistic-environments-2105.12588"/></url>
<url><loc>https://scifaro.com/en/abs/a-flexible-fpga-based-isa-configurable-soc-platform-2105.12678</loc><lastmod>2021-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-flexible-fpga-based-isa-configurable-soc-platform-2105.12678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-flexible-fpga-based-isa-configurable-soc-platform-2105.12678"/></url>
<url><loc>https://scifaro.com/en/abs/algebras-of-sets-and-coherent-sets-of-gambles-2105.12986</loc><lastmod>2021-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebras-of-sets-and-coherent-sets-of-gambles-2105.12986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebras-of-sets-and-coherent-sets-of-gambles-2105.12986"/></url>
<url><loc>https://scifaro.com/en/abs/rigorous-roundoff-error-analysis-of-probabilistic-floating-point-computations-2105.13217</loc><lastmod>2021-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rigorous-roundoff-error-analysis-of-probabilistic-floating-point-computations-2105.13217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rigorous-roundoff-error-analysis-of-probabilistic-floating-point-computations-2105.13217"/></url>
<url><loc>https://scifaro.com/en/abs/a-modular-first-formalisation-of-combinatorial-design-theory-2105.13583</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modular-first-formalisation-of-combinatorial-design-theory-2105.13583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modular-first-formalisation-of-combinatorial-design-theory-2105.13583"/></url>
<url><loc>https://scifaro.com/en/abs/latticed-k-induction-with-an-application-to-probabilistic-programs-2105.14100</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/latticed-k-induction-with-an-application-to-probabilistic-programs-2105.14100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/latticed-k-induction-with-an-application-to-probabilistic-programs-2105.14100"/></url>
<url><loc>https://scifaro.com/en/abs/verified-quadratic-virtual-substitution-for-real-arithmetic-2105.14183</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-quadratic-virtual-substitution-for-real-arithmetic-2105.14183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-quadratic-virtual-substitution-for-real-arithmetic-2105.14183"/></url>
<url><loc>https://scifaro.com/en/abs/causality-based-game-solving-2105.14247</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causality-based-game-solving-2105.14247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causality-based-game-solving-2105.14247"/></url>
<url><loc>https://scifaro.com/en/abs/computing-with-infinite-objects-the-gray-code-case-2105.14261</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-with-infinite-objects-the-gray-code-case-2105.14261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-with-infinite-objects-the-gray-code-case-2105.14261"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-invariant-barrier-certificates-via-difference-of-convex-programming-2105.14311</loc><lastmod>2021-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-invariant-barrier-certificates-via-difference-of-convex-programming-2105.14311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-invariant-barrier-certificates-via-difference-of-convex-programming-2105.14311"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-logical-framework-for-explanations-in-classifier-systems-2105.14452</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-logical-framework-for-explanations-in-classifier-systems-2105.14452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-logical-framework-for-explanations-in-classifier-systems-2105.14452"/></url>
<url><loc>https://scifaro.com/en/abs/intensional-kleene-and-rice-theorems-for-abstract-program-semantics-2105.14579</loc><lastmod>2021-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intensional-kleene-and-rice-theorems-for-abstract-program-semantics-2105.14579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intensional-kleene-and-rice-theorems-for-abstract-program-semantics-2105.14579"/></url>
<url><loc>https://scifaro.com/en/abs/an-automated-approach-to-the-collatz-conjecture-2105.14697</loc><lastmod>2023-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automated-approach-to-the-collatz-conjecture-2105.14697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automated-approach-to-the-collatz-conjecture-2105.14697"/></url>
<url><loc>https://scifaro.com/en/abs/parameterised-complexity-of-propositional-inclusion-and-independence-logic-2105.14887</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterised-complexity-of-propositional-inclusion-and-independence-logic-2105.14887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterised-complexity-of-propositional-inclusion-and-independence-logic-2105.14887"/></url>
<url><loc>https://scifaro.com/en/abs/computing-least-and-greatest-fixed-points-in-absorptive-semirings-2106.00399</loc><lastmod>2021-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-least-and-greatest-fixed-points-in-absorptive-semirings-2106.00399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-least-and-greatest-fixed-points-in-absorptive-semirings-2106.00399"/></url>
<url><loc>https://scifaro.com/en/abs/porous-invariants-2106.00662</loc><lastmod>2021-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/porous-invariants-2106.00662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/porous-invariants-2106.00662"/></url>
<url><loc>https://scifaro.com/en/abs/quantifiers-on-demand-2106.00664</loc><lastmod>2021-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifiers-on-demand-2106.00664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifiers-on-demand-2106.00664"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-prophecy-for-proving-temporal-properties-of-infinite-state-systems-2106.00966</loc><lastmod>2021-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-prophecy-for-proving-temporal-properties-of-infinite-state-systems-2106.00966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-prophecy-for-proving-temporal-properties-of-infinite-state-systems-2106.00966"/></url>
<url><loc>https://scifaro.com/en/abs/some-complexity-results-for-stateful-network-verification-2106.01030</loc><lastmod>2021-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-complexity-results-for-stateful-network-verification-2106.01030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-complexity-results-for-stateful-network-verification-2106.01030"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2106.01414</loc><lastmod>2021-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2106.01414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2106.01414"/></url>
<url><loc>https://scifaro.com/en/abs/a-coalgebraic-approach-to-dualities-for-neighborhood-frames-2106.01628</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coalgebraic-approach-to-dualities-for-neighborhood-frames-2106.01628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coalgebraic-approach-to-dualities-for-neighborhood-frames-2106.01628"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verified-next-generation-airborne-collision-avoidance-games-in-acas-x-2106.02030</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verified-next-generation-airborne-collision-avoidance-games-in-acas-x-2106.02030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verified-next-generation-airborne-collision-avoidance-games-in-acas-x-2106.02030"/></url>
<url><loc>https://scifaro.com/en/abs/hypercontracts-2106.02449</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hypercontracts-2106.02449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hypercontracts-2106.02449"/></url>
<url><loc>https://scifaro.com/en/abs/certified-dqbf-solving-by-definition-extraction-2106.02550</loc><lastmod>2021-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-dqbf-solving-by-definition-extraction-2106.02550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-dqbf-solving-by-definition-extraction-2106.02550"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-long-version-2106.02573</loc><lastmod>2021-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-long-version-2106.02573"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-theory-for-the-life-sciences-a-unifying-theory-of-ctmc-semantics-long-version-2106.02573"/></url>
<url><loc>https://scifaro.com/en/abs/domain-range-semigroups-and-finite-representations-2106.02709</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-range-semigroups-and-finite-representations-2106.02709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-range-semigroups-and-finite-representations-2106.02709"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-nonexistence-of-fo-continuous-path-and-tree-decompositions-2106.04201</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-nonexistence-of-fo-continuous-path-and-tree-decompositions-2106.04201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-nonexistence-of-fo-continuous-path-and-tree-decompositions-2106.04201"/></url>
<url><loc>https://scifaro.com/en/abs/interpolation-and-model-checking-for-nonlinear-arithmetic-2106.04340</loc><lastmod>2021-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolation-and-model-checking-for-nonlinear-arithmetic-2106.04340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolation-and-model-checking-for-nonlinear-arithmetic-2106.04340"/></url>
<url><loc>https://scifaro.com/en/abs/globular-weak-omega-categories-as-models-of-a-type-theory-2106.04475</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/globular-weak-omega-categories-as-models-of-a-type-theory-2106.04475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/globular-weak-omega-categories-as-models-of-a-type-theory-2106.04475"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-propositional-configuration-logics-2106.05041</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-propositional-configuration-logics-2106.05041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-propositional-configuration-logics-2106.05041"/></url>
<url><loc>https://scifaro.com/en/abs/choice-logics-and-their-computational-properties-2106.05052</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choice-logics-and-their-computational-properties-2106.05052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choice-logics-and-their-computational-properties-2106.05052"/></url>
<url><loc>https://scifaro.com/en/abs/automating-induction-by-reflection-2106.05066</loc><lastmod>2021-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-induction-by-reflection-2106.05066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-induction-by-reflection-2106.05066"/></url>
<url><loc>https://scifaro.com/en/abs/stream-processors-and-comodels-2106.05473</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stream-processors-and-comodels-2106.05473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stream-processors-and-comodels-2106.05473"/></url>
<url><loc>https://scifaro.com/en/abs/finding-normal-binary-floating-point-factors-efficiently-2106.05631</loc><lastmod>2023-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-normal-binary-floating-point-factors-efficiently-2106.05631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-normal-binary-floating-point-factors-efficiently-2106.05631"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-systems-verification-with-isabelle-hol-simpler-syntax-better-models-faster-proofs-2106.05987</loc><lastmod>2021-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-systems-verification-with-isabelle-hol-simpler-syntax-better-models-faster-proofs-2106.05987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-systems-verification-with-isabelle-hol-simpler-syntax-better-models-faster-proofs-2106.05987"/></url>
<url><loc>https://scifaro.com/en/abs/nawrotzki-s-algorithm-for-the-countable-splitting-lemma-constructively-2106.06614</loc><lastmod>2021-06-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nawrotzki-s-algorithm-for-the-countable-splitting-lemma-constructively-2106.06614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nawrotzki-s-algorithm-for-the-countable-splitting-lemma-constructively-2106.06614"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-confluence-in-typed-probabilistic-lambda-calculi-2106.06633</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-confluence-in-typed-probabilistic-lambda-calculi-2106.06633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-confluence-in-typed-probabilistic-lambda-calculi-2106.06633"/></url>
<url><loc>https://scifaro.com/en/abs/minimization-and-canonization-of-gfg-transition-based-automata-2106.06745</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimization-and-canonization-of-gfg-transition-based-automata-2106.06745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimization-and-canonization-of-gfg-transition-based-automata-2106.06745"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagrammatic-electrical-circuit-theory-2106.07763</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagrammatic-electrical-circuit-theory-2106.07763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagrammatic-electrical-circuit-theory-2106.07763"/></url>
<url><loc>https://scifaro.com/en/abs/on-star-expressions-and-coalgebraic-completeness-theorems-2106.08074</loc><lastmod>2022-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-star-expressions-and-coalgebraic-completeness-theorems-2106.08074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-star-expressions-and-coalgebraic-completeness-theorems-2106.08074"/></url>
<url><loc>https://scifaro.com/en/abs/on-doctrines-and-cartesian-bicategories-2106.08142</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-doctrines-and-cartesian-bicategories-2106.08142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-doctrines-and-cartesian-bicategories-2106.08142"/></url>
<url><loc>https://scifaro.com/en/abs/asymptotic-elimination-of-partially-continuous-aggregation-functions-in-directed-graphical-models-2106.10122</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asymptotic-elimination-of-partially-continuous-aggregation-functions-in-directed-graphical-models-2106.10122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asymptotic-elimination-of-partially-continuous-aggregation-functions-in-directed-graphical-models-2106.10122"/></url>
<url><loc>https://scifaro.com/en/abs/a-benchmarks-library-for-extended-parametric-timed-automata-2106.10232</loc><lastmod>2021-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-benchmarks-library-for-extended-parametric-timed-automata-2106.10232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-benchmarks-library-for-extended-parametric-timed-automata-2106.10232"/></url>
<url><loc>https://scifaro.com/en/abs/defeasible-reasoning-via-datalog-neg-2106.10946</loc><lastmod>2024-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defeasible-reasoning-via-datalog-neg-2106.10946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defeasible-reasoning-via-datalog-neg-2106.10946"/></url>
<url><loc>https://scifaro.com/en/abs/uncertainty-based-semantics-for-multi-agent-knowing-how-logics-2106.11492</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uncertainty-based-semantics-for-multi-agent-knowing-how-logics-2106.11492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uncertainty-based-semantics-for-multi-agent-knowing-how-logics-2106.11492"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-epistemic-logic-with-names-2106.11493</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-epistemic-logic-with-names-2106.11493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-epistemic-logic-with-names-2106.11493"/></url>
<url><loc>https://scifaro.com/en/abs/language-based-decisions-2106.11494</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/language-based-decisions-2106.11494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/language-based-decisions-2106.11494"/></url>
<url><loc>https://scifaro.com/en/abs/an-awareness-epistemic-framework-for-belief-argumentation-and-their-dynamics-2106.11495</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-awareness-epistemic-framework-for-belief-argumentation-and-their-dynamics-2106.11495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-awareness-epistemic-framework-for-belief-argumentation-and-their-dynamics-2106.11495"/></url>
<url><loc>https://scifaro.com/en/abs/no-finite-model-property-for-logics-of-quantified-announcements-2106.11498</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/no-finite-model-property-for-logics-of-quantified-announcements-2106.11498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/no-finite-model-property-for-logics-of-quantified-announcements-2106.11498"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-from-probability-2106.11501</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-from-probability-2106.11501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-from-probability-2106.11501"/></url>
<url><loc>https://scifaro.com/en/abs/a-deontic-stit-logic-based-on-beliefs-and-expected-utility-2106.11506</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deontic-stit-logic-based-on-beliefs-and-expected-utility-2106.11506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deontic-stit-logic-based-on-beliefs-and-expected-utility-2106.11506"/></url>
<url><loc>https://scifaro.com/en/abs/communication-pattern-models-an-extension-of-action-models-for-dynamic-network-distributed-systems-2106.11508</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communication-pattern-models-an-extension-of-action-models-for-dynamic-network-distributed-systems-2106.11508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communication-pattern-models-an-extension-of-action-models-for-dynamic-network-distributed-systems-2106.11508"/></url>
<url><loc>https://scifaro.com/en/abs/a-bibliography-of-combinators-2106.11729</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bibliography-of-combinators-2106.11729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bibliography-of-combinators-2106.11729"/></url>
<url><loc>https://scifaro.com/en/abs/the-failure-of-cut-elimination-in-cyclic-proof-for-first-order-logic-with-inductive-definitions-2106.11798</loc><lastmod>2024-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-failure-of-cut-elimination-in-cyclic-proof-for-first-order-logic-with-inductive-definitions-2106.11798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-failure-of-cut-elimination-in-cyclic-proof-for-first-order-logic-with-inductive-definitions-2106.11798"/></url>
<url><loc>https://scifaro.com/en/abs/linear-logic-the-pi-calculus-and-their-metatheory-a-recipe-for-proofs-as-processes-2106.11818</loc><lastmod>2021-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-logic-the-pi-calculus-and-their-metatheory-a-recipe-for-proofs-as-processes-2106.11818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-logic-the-pi-calculus-and-their-metatheory-a-recipe-for-proofs-as-processes-2106.11818"/></url>
<url><loc>https://scifaro.com/en/abs/beginners-quest-to-formalize-mathematics-a-feasibility-study-in-isabelle-2106.12351</loc><lastmod>2021-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beginners-quest-to-formalize-mathematics-a-feasibility-study-in-isabelle-2106.12351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beginners-quest-to-formalize-mathematics-a-feasibility-study-in-isabelle-2106.12351"/></url>
<url><loc>https://scifaro.com/en/abs/substitution-principle-and-semidirect-products-2106.12525</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/substitution-principle-and-semidirect-products-2106.12525"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/substitution-principle-and-semidirect-products-2106.12525"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-mutual-exclusion-in-a-process-algebra-with-time-outs-2106.12785</loc><lastmod>2023-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-mutual-exclusion-in-a-process-algebra-with-time-outs-2106.12785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-mutual-exclusion-in-a-process-algebra-with-time-outs-2106.12785"/></url>
<url><loc>https://scifaro.com/en/abs/accelerating-the-computation-of-dead-and-concurrent-places-using-reductions-2106.12813</loc><lastmod>2021-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accelerating-the-computation-of-dead-and-concurrent-places-using-reductions-2106.12813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accelerating-the-computation-of-dead-and-concurrent-places-using-reductions-2106.12813"/></url>
<url><loc>https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2106.12892</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2106.12892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2106.12892"/></url>
<url><loc>https://scifaro.com/en/abs/semialgebras-and-weak-distributive-laws-2106.13489</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semialgebras-and-weak-distributive-laws-2106.13489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semialgebras-and-weak-distributive-laws-2106.13489"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-deciding-syntactic-equivalence-up-to-renaming-for-term-rewriting-systems-extended-version-2106.13520</loc><lastmod>2022-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-deciding-syntactic-equivalence-up-to-renaming-for-term-rewriting-systems-extended-version-2106.13520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-deciding-syntactic-equivalence-up-to-renaming-for-term-rewriting-systems-extended-version-2106.13520"/></url>
<url><loc>https://scifaro.com/en/abs/a-curiously-effective-backtracking-strategy-for-connection-tableaux-2106.13722</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-curiously-effective-backtracking-strategy-for-connection-tableaux-2106.13722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-curiously-effective-backtracking-strategy-for-connection-tableaux-2106.13722"/></url>
<url><loc>https://scifaro.com/en/abs/from-linear-term-rewriting-to-graph-rewriting-with-preservation-of-termination-2106.13826</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-linear-term-rewriting-to-graph-rewriting-with-preservation-of-termination-2106.13826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-linear-term-rewriting-to-graph-rewriting-with-preservation-of-termination-2106.13826"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-with-a-graph-meta-language-2106.13843</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-with-a-graph-meta-language-2106.13843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-with-a-graph-meta-language-2106.13843"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-a-smart-contract-for-a-simple-casino-2106.14457</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-a-smart-contract-for-a-simple-casino-2106.14457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-a-smart-contract-for-a-simple-casino-2106.14457"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-model-for-joining-property-graphs-2106.14766</loc><lastmod>2021-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-model-for-joining-property-graphs-2106.14766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-model-for-joining-property-graphs-2106.14766"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-synthesis-of-modular-systems-full-version-2106.14783</loc><lastmod>2022-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-synthesis-of-modular-systems-full-version-2106.14783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-synthesis-of-modular-systems-full-version-2106.14783"/></url>
<url><loc>https://scifaro.com/en/abs/the-price-of-selfishness-conjunctive-query-entailment-for-alcself-is-2exptime-hard-2106.15150</loc><lastmod>2021-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-price-of-selfishness-conjunctive-query-entailment-for-alcself-is-2exptime-hard-2106.15150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-price-of-selfishness-conjunctive-query-entailment-for-alcself-is-2exptime-hard-2106.15150"/></url>
<url><loc>https://scifaro.com/en/abs/on-classical-decidable-logics-extended-with-percentage-quantifiers-and-arithmetics-2106.15250</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-classical-decidable-logics-extended-with-percentage-quantifiers-and-arithmetics-2106.15250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-classical-decidable-logics-extended-with-percentage-quantifiers-and-arithmetics-2106.15250"/></url>
<url><loc>https://scifaro.com/en/abs/on-free-description-logics-with-definite-descriptions-2106.15513</loc><lastmod>2021-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-free-description-logics-with-definite-descriptions-2106.15513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-free-description-logics-with-definite-descriptions-2106.15513"/></url>
<url><loc>https://scifaro.com/en/abs/s-n-t-implications-2106.15746</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/s-n-t-implications-2106.15746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/s-n-t-implications-2106.15746"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-the-space-of-valuations-of-a-quasi-polish-space-as-a-space-of-ideals-2106.15780</loc><lastmod>2021-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-the-space-of-valuations-of-a-quasi-polish-space-as-a-space-of-ideals-2106.15780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-the-space-of-valuations-of-a-quasi-polish-space-as-a-space-of-ideals-2106.15780"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-for-quantitative-equational-logics-2106.15932</loc><lastmod>2021-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-for-quantitative-equational-logics-2106.15932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-for-quantitative-equational-logics-2106.15932"/></url>
<url><loc>https://scifaro.com/en/abs/a-domain-theoretic-approach-to-statistical-programming-languages-2106.16190</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-domain-theoretic-approach-to-statistical-programming-languages-2106.16190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-domain-theoretic-approach-to-statistical-programming-languages-2106.16190"/></url>
<url><loc>https://scifaro.com/en/abs/an-extended-and-more-practical-mwp-flow-analysis-2107.00086</loc><lastmod>2021-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extended-and-more-practical-mwp-flow-analysis-2107.00086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extended-and-more-practical-mwp-flow-analysis-2107.00086"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-reasoning-about-lf-specifications-2107.00111</loc><lastmod>2022-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-reasoning-about-lf-specifications-2107.00111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-reasoning-about-lf-specifications-2107.00111"/></url>
<url><loc>https://scifaro.com/en/abs/addressing-machines-as-models-of-lambda-calculus-2107.00319</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/addressing-machines-as-models-of-lambda-calculus-2107.00319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/addressing-machines-as-models-of-lambda-calculus-2107.00319"/></url>
<url><loc>https://scifaro.com/en/abs/computing-cq-lower-bounds-over-owl-2-through-approximation-to-rsa-2107.00369</loc><lastmod>2021-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-cq-lower-bounds-over-owl-2-through-approximation-to-rsa-2107.00369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-cq-lower-bounds-over-owl-2-through-approximation-to-rsa-2107.00369"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-octorotor-flight-envelope-using-barrier-functions-and-smt-solving-2107.00612</loc><lastmod>2021-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-octorotor-flight-envelope-using-barrier-functions-and-smt-solving-2107.00612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-octorotor-flight-envelope-using-barrier-functions-and-smt-solving-2107.00612"/></url>
<url><loc>https://scifaro.com/en/abs/formal-semantics-of-a-classical-quantum-language-2107.00804</loc><lastmod>2021-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-semantics-of-a-classical-quantum-language-2107.00804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-semantics-of-a-classical-quantum-language-2107.00804"/></url>
<url><loc>https://scifaro.com/en/abs/incorporating-monitors-in-reactive-synthesis-without-paying-the-price-2107.00929</loc><lastmod>2021-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorporating-monitors-in-reactive-synthesis-without-paying-the-price-2107.00929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorporating-monitors-in-reactive-synthesis-without-paying-the-price-2107.00929"/></url>
<url><loc>https://scifaro.com/en/abs/live-synthesis-2107.01136</loc><lastmod>2021-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/live-synthesis-2107.01136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/live-synthesis-2107.01136"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-probabilistic-adversarial-computations-categorical-semantics-and-program-logics-2107.01155</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-probabilistic-adversarial-computations-categorical-semantics-and-program-logics-2107.01155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-probabilistic-adversarial-computations-categorical-semantics-and-program-logics-2107.01155"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-and-its-infinitary-quantifier-extensions-over-countable-words-2107.01468</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-and-its-infinitary-quantifier-extensions-over-countable-words-2107.01468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-and-its-infinitary-quantifier-extensions-over-countable-words-2107.01468"/></url>
<url><loc>https://scifaro.com/en/abs/the-semantics-of-package-management-via-event-structures-2107.01542</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-semantics-of-package-management-via-event-structures-2107.01542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-semantics-of-package-management-via-event-structures-2107.01542"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventh-workshop-on-proof-exchange-for-theorem-proving-2107.01544</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-proof-exchange-for-theorem-proving-2107.01544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventh-workshop-on-proof-exchange-for-theorem-proving-2107.01544"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-coherence-theorem-with-applications-in-homotopy-type-theory-2107.01594</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-coherence-theorem-with-applications-in-homotopy-type-theory-2107.01594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-coherence-theorem-with-applications-in-homotopy-type-theory-2107.01594"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-model-checking-branching-processes-2107.01687</loc><lastmod>2021-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-model-checking-branching-processes-2107.01687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-model-checking-branching-processes-2107.01687"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-semantics-of-the-graalvm-intermediate-representation-2107.01815</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-semantics-of-the-graalvm-intermediate-representation-2107.01815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-semantics-of-the-graalvm-intermediate-representation-2107.01815"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-modal-logics-via-structural-refinement-2107.01998</loc><lastmod>2021-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-modal-logics-via-structural-refinement-2107.01998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-modal-logics-via-structural-refinement-2107.01998"/></url>
<url><loc>https://scifaro.com/en/abs/automated-inference-of-production-rules-for-glycans-2107.02203</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-inference-of-production-rules-for-glycans-2107.02203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-inference-of-production-rules-for-glycans-2107.02203"/></url>
<url><loc>https://scifaro.com/en/abs/symbol-elimination-for-parametric-second-order-entailment-problems-with-applications-to-problems-in-wireless-network-theory-2107.02333</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbol-elimination-for-parametric-second-order-entailment-problems-with-applications-to-problems-in-wireless-network-theory-2107.02333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbol-elimination-for-parametric-second-order-entailment-problems-with-applications-to-problems-in-wireless-network-theory-2107.02333"/></url>
<url><loc>https://scifaro.com/en/abs/proof-generation-in-cdsat-2107.02351</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-generation-in-cdsat-2107.02351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-generation-in-cdsat-2107.02351"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-proof-carrying-logical-transformations-2107.02352</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-proof-carrying-logical-transformations-2107.02352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-proof-carrying-logical-transformations-2107.02352"/></url>
<url><loc>https://scifaro.com/en/abs/general-automation-in-coq-through-modular-transformations-2107.02353</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-automation-in-coq-through-modular-transformations-2107.02353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-automation-in-coq-through-modular-transformations-2107.02353"/></url>
<url><loc>https://scifaro.com/en/abs/alethe-towards-a-generic-smt-proof-format-extended-abstract-2107.02354</loc><lastmod>2021-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alethe-towards-a-generic-smt-proof-format-extended-abstract-2107.02354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alethe-towards-a-generic-smt-proof-format-extended-abstract-2107.02354"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-for-strategic-hyperproperties-2107.02509</loc><lastmod>2022-06-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-for-strategic-hyperproperties-2107.02509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-for-strategic-hyperproperties-2107.02509"/></url>
<url><loc>https://scifaro.com/en/abs/the-quantitative-collapse-of-concurrent-games-with-symmetry-2107.03155</loc><lastmod>2021-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-quantitative-collapse-of-concurrent-games-with-symmetry-2107.03155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-quantitative-collapse-of-concurrent-games-with-symmetry-2107.03155"/></url>
<url><loc>https://scifaro.com/en/abs/a-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2107.03189</loc><lastmod>2021-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2107.03189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2107.03189"/></url>
<url><loc>https://scifaro.com/en/abs/stable-graphs-of-bounded-twin-width-2107.03711</loc><lastmod>2022-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-graphs-of-bounded-twin-width-2107.03711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-graphs-of-bounded-twin-width-2107.03711"/></url>
<url><loc>https://scifaro.com/en/abs/choiceless-polynomial-time-symmetric-circuits-and-cai-f-urer-immerman-graphs-2107.03778</loc><lastmod>2023-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choiceless-polynomial-time-symmetric-circuits-and-cai-f-urer-immerman-graphs-2107.03778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choiceless-polynomial-time-symmetric-circuits-and-cai-f-urer-immerman-graphs-2107.03778"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-problem-for-a-quantitative-fragment-of-pctl-2107.03794</loc><lastmod>2021-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-a-quantitative-fragment-of-pctl-2107.03794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-problem-for-a-quantitative-fragment-of-pctl-2107.03794"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithm-for-reversible-logic-circuit-synthesis-based-on-tensor-decomposition-2107.04298</loc><lastmod>2024-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithm-for-reversible-logic-circuit-synthesis-based-on-tensor-decomposition-2107.04298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithm-for-reversible-logic-circuit-synthesis-based-on-tensor-decomposition-2107.04298"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-reconfigurations-of-distributed-systems-2107.05253</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-reconfigurations-of-distributed-systems-2107.05253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-reconfigurations-of-distributed-systems-2107.05253"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-differentiation-2107.05261</loc><lastmod>2021-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-differentiation-2107.05261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-differentiation-2107.05261"/></url>
<url><loc>https://scifaro.com/en/abs/separating-data-examples-by-description-logic-concepts-with-restricted-signatures-2107.05285</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-data-examples-by-description-logic-concepts-with-restricted-signatures-2107.05285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-data-examples-by-description-logic-concepts-with-restricted-signatures-2107.05285"/></url>
<url><loc>https://scifaro.com/en/abs/separating-lrec-from-lfp-2107.05296</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-lrec-from-lfp-2107.05296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-lrec-from-lfp-2107.05296"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-like-model-checking-on-the-fly-for-atl-2107.05378</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-like-model-checking-on-the-fly-for-atl-2107.05378"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-like-model-checking-on-the-fly-for-atl-2107.05378"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-an-automated-prover-for-projective-geometry-as-a-new-tactic-in-the-coq-proof-assistant-2107.05493</loc><lastmod>2021-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-an-automated-prover-for-projective-geometry-as-a-new-tactic-in-the-coq-proof-assistant-2107.05493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-an-automated-prover-for-projective-geometry-as-a-new-tactic-in-the-coq-proof-assistant-2107.05493"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-with-connectivity-operators-2107.05928</loc><lastmod>2021-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-with-connectivity-operators-2107.05928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-with-connectivity-operators-2107.05928"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2107.06042</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2107.06042"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2107.06042"/></url>
<url><loc>https://scifaro.com/en/abs/injecting-finiteness-to-prove-completeness-for-finite-linear-temporal-logic-2107.06045</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/injecting-finiteness-to-prove-completeness-for-finite-linear-temporal-logic-2107.06045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/injecting-finiteness-to-prove-completeness-for-finite-linear-temporal-logic-2107.06045"/></url>
<url><loc>https://scifaro.com/en/abs/a-rational-entailment-for-expressive-description-logics-via-description-logic-programs-2107.06075</loc><lastmod>2022-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rational-entailment-for-expressive-description-logics-via-description-logic-programs-2107.06075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rational-entailment-for-expressive-description-logics-via-description-logic-programs-2107.06075"/></url>
<url><loc>https://scifaro.com/en/abs/decentralized-ltl-enforcement-2107.06084</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decentralized-ltl-enforcement-2107.06084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decentralized-ltl-enforcement-2107.06084"/></url>
<url><loc>https://scifaro.com/en/abs/from-identity-to-difference-a-quantitative-interpretation-of-the-identity-type-2107.06150</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-identity-to-difference-a-quantitative-interpretation-of-the-identity-type-2107.06150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-identity-to-difference-a-quantitative-interpretation-of-the-identity-type-2107.06150"/></url>
<url><loc>https://scifaro.com/en/abs/a-model-of-systems-with-modes-and-mode-transitions-2107.06152</loc><lastmod>2021-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-model-of-systems-with-modes-and-mode-transitions-2107.06152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-model-of-systems-with-modes-and-mode-transitions-2107.06152"/></url>
<url><loc>https://scifaro.com/en/abs/useful-open-call-by-need-2107.06591</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/useful-open-call-by-need-2107.06591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/useful-open-call-by-need-2107.06591"/></url>
<url><loc>https://scifaro.com/en/abs/improved-sat-models-for-nfa-learning-2107.06672</loc><lastmod>2021-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-sat-models-for-nfa-learning-2107.06672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-sat-models-for-nfa-learning-2107.06672"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-free-logics-with-descriptions-2107.07228</loc><lastmod>2021-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-free-logics-with-descriptions-2107.07228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-free-logics-with-descriptions-2107.07228"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-sixteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2107.07376</loc><lastmod>2021-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-sixteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2107.07376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-sixteenth-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2107.07376"/></url>
<url><loc>https://scifaro.com/en/abs/facilitating-meta-theory-reasoning-invited-paper-2107.07661</loc><lastmod>2021-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/facilitating-meta-theory-reasoning-invited-paper-2107.07661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/facilitating-meta-theory-reasoning-invited-paper-2107.07661"/></url>
<url><loc>https://scifaro.com/en/abs/interacting-safely-with-an-unsafe-environment-2107.07662</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interacting-safely-with-an-unsafe-environment-2107.07662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interacting-safely-with-an-unsafe-environment-2107.07662"/></url>
<url><loc>https://scifaro.com/en/abs/countability-of-inductive-types-formalized-in-the-object-logic-level-2107.07663</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/countability-of-inductive-types-formalized-in-the-object-logic-level-2107.07663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/countability-of-inductive-types-formalized-in-the-object-logic-level-2107.07663"/></url>
<url><loc>https://scifaro.com/en/abs/smltocoq-automated-generation-of-coq-specifications-and-proof-obligations-from-sml-programs-with-contracts-2107.07664</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smltocoq-automated-generation-of-coq-specifications-and-proof-obligations-from-sml-programs-with-contracts-2107.07664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smltocoq-automated-generation-of-coq-specifications-and-proof-obligations-from-sml-programs-with-contracts-2107.07664"/></url>
<url><loc>https://scifaro.com/en/abs/systematic-translation-of-formalizations-of-type-theory-from-intrinsic-to-extrinsic-style-2107.07665</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/systematic-translation-of-formalizations-of-type-theory-from-intrinsic-to-extrinsic-style-2107.07665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/systematic-translation-of-formalizations-of-type-theory-from-intrinsic-to-extrinsic-style-2107.07665"/></url>
<url><loc>https://scifaro.com/en/abs/adelfa-a-system-for-reasoning-about-lf-specifications-2107.07666</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adelfa-a-system-for-reasoning-about-lf-specifications-2107.07666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adelfa-a-system-for-reasoning-about-lf-specifications-2107.07666"/></url>
<url><loc>https://scifaro.com/en/abs/automating-induction-by-reflection-2107.07669</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-induction-by-reflection-2107.07669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-induction-by-reflection-2107.07669"/></url>
<url><loc>https://scifaro.com/en/abs/double-glueing-over-free-exponential-with-measure-theoretic-applications-2107.07726</loc><lastmod>2026-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/double-glueing-over-free-exponential-with-measure-theoretic-applications-2107.07726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/double-glueing-over-free-exponential-with-measure-theoretic-applications-2107.07726"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-homomorphism-closed-decidable-queries-with-existential-rules-2107.07811</loc><lastmod>2021-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-homomorphism-closed-decidable-queries-with-existential-rules-2107.07811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-homomorphism-closed-decidable-queries-with-existential-rules-2107.07811"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-basis-for-relational-semantics-2107.08253</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-basis-for-relational-semantics-2107.08253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-basis-for-relational-semantics-2107.08253"/></url>
<url><loc>https://scifaro.com/en/abs/proof-search-on-bilateralist-judgments-over-non-deterministic-semantics-2107.08349</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-search-on-bilateralist-judgments-over-non-deterministic-semantics-2107.08349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-search-on-bilateralist-judgments-over-non-deterministic-semantics-2107.08349"/></url>
<url><loc>https://scifaro.com/en/abs/ac-simplifications-and-closure-redundancies-in-the-superposition-calculus-2107.08409</loc><lastmod>2021-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ac-simplifications-and-closure-redundancies-in-the-superposition-calculus-2107.08409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ac-simplifications-and-closure-redundancies-in-the-superposition-calculus-2107.08409"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-process-algebra-for-true-concurrency-2107.08453</loc><lastmod>2021-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-process-algebra-for-true-concurrency-2107.08453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-process-algebra-for-true-concurrency-2107.08453"/></url>
<url><loc>https://scifaro.com/en/abs/cobordisms-and-commutative-categorial-grammars-2107.08728</loc><lastmod>2021-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cobordisms-and-commutative-categorial-grammars-2107.08728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cobordisms-and-commutative-categorial-grammars-2107.08728"/></url>
<url><loc>https://scifaro.com/en/abs/gensys-a-scalable-fixed-point-engine-for-maximal-controller-synthesis-over-infinite-state-spaces-2107.08794</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gensys-a-scalable-fixed-point-engine-for-maximal-controller-synthesis-over-infinite-state-spaces-2107.08794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gensys-a-scalable-fixed-point-engine-for-maximal-controller-synthesis-over-infinite-state-spaces-2107.08794"/></url>
<url><loc>https://scifaro.com/en/abs/structured-proofs-for-adversarial-cyber-physical-systems-2107.08852</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structured-proofs-for-adversarial-cyber-physical-systems-2107.08852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structured-proofs-for-adversarial-cyber-physical-systems-2107.08852"/></url>
<url><loc>https://scifaro.com/en/abs/dormancy-aware-timed-branching-bisimilarity-with-an-application-to-communication-protocol-analysis-2107.08921</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dormancy-aware-timed-branching-bisimilarity-with-an-application-to-communication-protocol-analysis-2107.08921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dormancy-aware-timed-branching-bisimilarity-with-an-application-to-communication-protocol-analysis-2107.08921"/></url>
<url><loc>https://scifaro.com/en/abs/global-winning-conditions-in-synthesis-of-distributed-systems-with-causal-memory-full-version-2107.09280</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/global-winning-conditions-in-synthesis-of-distributed-systems-with-causal-memory-full-version-2107.09280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/global-winning-conditions-in-synthesis-of-distributed-systems-with-causal-memory-full-version-2107.09280"/></url>
<url><loc>https://scifaro.com/en/abs/learning-theorem-proving-components-2107.10034</loc><lastmod>2021-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-theorem-proving-components-2107.10034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-theorem-proving-components-2107.10034"/></url>
<url><loc>https://scifaro.com/en/abs/jefl-joint-embedding-of-formal-proof-libraries-2107.10188</loc><lastmod>2021-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/jefl-joint-embedding-of-formal-proof-libraries-2107.10188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/jefl-joint-embedding-of-formal-proof-libraries-2107.10188"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-expertise-2107.10832</loc><lastmod>2021-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-expertise-2107.10832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-expertise-2107.10832"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-galois-theory-2107.10988</loc><lastmod>2021-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-galois-theory-2107.10988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-galois-theory-2107.10988"/></url>
<url><loc>https://scifaro.com/en/abs/type-based-enforcement-of-infinitary-trace-properties-for-java-2107.11280</loc><lastmod>2022-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-based-enforcement-of-infinitary-trace-properties-for-java-2107.11280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-based-enforcement-of-infinitary-trace-properties-for-java-2107.11280"/></url>
<url><loc>https://scifaro.com/en/abs/case-studies-in-formal-reasoning-about-lambda-calculus-semantics-church-rosser-standardization-and-hoas-2107.11674</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/case-studies-in-formal-reasoning-about-lambda-calculus-semantics-church-rosser-standardization-and-hoas-2107.11674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/case-studies-in-formal-reasoning-about-lambda-calculus-semantics-church-rosser-standardization-and-hoas-2107.11674"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-recursive-quantum-programs-2107.11679</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-recursive-quantum-programs-2107.11679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-recursive-quantum-programs-2107.11679"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-algorithms-for-hyperproperties-2107.11841</loc><lastmod>2021-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-algorithms-for-hyperproperties-2107.11841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-algorithms-for-hyperproperties-2107.11841"/></url>
<url><loc>https://scifaro.com/en/abs/hardness-of-busy-beaver-value-bb-15-2107.12475</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardness-of-busy-beaver-value-bb-15-2107.12475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardness-of-busy-beaver-value-bb-15-2107.12475"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterization-of-coherent-uninterpreted-programs-2107.12902</loc><lastmod>2021-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterization-of-coherent-uninterpreted-programs-2107.12902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterization-of-coherent-uninterpreted-programs-2107.12902"/></url>
<url><loc>https://scifaro.com/en/abs/type-theories-in-category-theory-2107.13242</loc><lastmod>2022-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theories-in-category-theory-2107.13242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theories-in-category-theory-2107.13242"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-variational-quantum-programming-2107.13347</loc><lastmod>2022-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-variational-quantum-programming-2107.13347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-variational-quantum-programming-2107.13347"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-and-synthesis-modulo-oracles-2107.13477</loc><lastmod>2021-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-and-synthesis-modulo-oracles-2107.13477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-and-synthesis-modulo-oracles-2107.13477"/></url>
<url><loc>https://scifaro.com/en/abs/separator-logic-and-star-free-expressions-for-graphs-2107.13953</loc><lastmod>2021-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separator-logic-and-star-free-expressions-for-graphs-2107.13953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separator-logic-and-star-free-expressions-for-graphs-2107.13953"/></url>
<url><loc>https://scifaro.com/en/abs/a-sketch-of-a-proof-theoretic-semantics-for-necessity-2107.13975</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sketch-of-a-proof-theoretic-semantics-for-necessity-2107.13975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sketch-of-a-proof-theoretic-semantics-for-necessity-2107.13975"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theoretic-semantics-a-problem-with-negation-and-prospects-for-modality-2107.13988</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theoretic-semantics-a-problem-with-negation-and-prospects-for-modality-2107.13988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theoretic-semantics-a-problem-with-negation-and-prospects-for-modality-2107.13988"/></url>
<url><loc>https://scifaro.com/en/abs/syllepsis-in-homotopy-type-theory-2107.14283</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syllepsis-in-homotopy-type-theory-2107.14283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syllepsis-in-homotopy-type-theory-2107.14283"/></url>
<url><loc>https://scifaro.com/en/abs/refining-labelled-systems-for-modal-and-constructive-logics-with-applications-2107.14487</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refining-labelled-systems-for-modal-and-constructive-logics-with-applications-2107.14487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refining-labelled-systems-for-modal-and-constructive-logics-with-applications-2107.14487"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-extended-version-2107.14651</loc><lastmod>2021-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-extended-version-2107.14651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-extended-version-2107.14651"/></url>
<url><loc>https://scifaro.com/en/abs/interleaving-reconfigurable-interaction-separating-choice-from-scheduling-using-glue-2107.14668</loc><lastmod>2021-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interleaving-reconfigurable-interaction-separating-choice-from-scheduling-using-glue-2107.14668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interleaving-reconfigurable-interaction-separating-choice-from-scheduling-using-glue-2107.14668"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-synthesis-modulo-theories-using-abstraction-refinement-2108.00090</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-synthesis-modulo-theories-using-abstraction-refinement-2108.00090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-synthesis-modulo-theories-using-abstraction-refinement-2108.00090"/></url>
<url><loc>https://scifaro.com/en/abs/enabling-preserving-bisimulation-equivalence-2108.00142</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enabling-preserving-bisimulation-equivalence-2108.00142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enabling-preserving-bisimulation-equivalence-2108.00142"/></url>
<url><loc>https://scifaro.com/en/abs/finitely-bounded-homogeneity-turned-inside-out-2108.00452</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitely-bounded-homogeneity-turned-inside-out-2108.00452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitely-bounded-homogeneity-turned-inside-out-2108.00452"/></url>
<url><loc>https://scifaro.com/en/abs/elements-of-differential-geometry-in-lean-a-report-for-mathematicians-2108.00484</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elements-of-differential-geometry-in-lean-a-report-for-mathematicians-2108.00484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elements-of-differential-geometry-in-lean-a-report-for-mathematicians-2108.00484"/></url>
<url><loc>https://scifaro.com/en/abs/analysis-and-transformation-of-constrained-horn-clauses-for-program-verification-2108.00739</loc><lastmod>2021-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysis-and-transformation-of-constrained-horn-clauses-for-program-verification-2108.00739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysis-and-transformation-of-constrained-horn-clauses-for-program-verification-2108.00739"/></url>
<url><loc>https://scifaro.com/en/abs/owicki-gries-reasoning-for-c11-programs-with-relaxed-dependencies-extended-version-2108.01418</loc><lastmod>2021-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/owicki-gries-reasoning-for-c11-programs-with-relaxed-dependencies-extended-version-2108.01418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/owicki-gries-reasoning-for-c11-programs-with-relaxed-dependencies-extended-version-2108.01418"/></url>
<url><loc>https://scifaro.com/en/abs/inference-systems-with-corules-for-combined-safety-and-liveness-properties-of-binary-session-types-2108.01503</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inference-systems-with-corules-for-combined-safety-and-liveness-properties-of-binary-session-types-2108.01503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inference-systems-with-corules-for-combined-safety-and-liveness-properties-of-binary-session-types-2108.01503"/></url>
<url><loc>https://scifaro.com/en/abs/towards-substructural-property-based-testing-2108.01610</loc><lastmod>2021-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-substructural-property-based-testing-2108.01610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-substructural-property-based-testing-2108.01610"/></url>
<url><loc>https://scifaro.com/en/abs/localisable-monads-2108.01756</loc><lastmod>2021-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localisable-monads-2108.01756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localisable-monads-2108.01756"/></url>
<url><loc>https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-intuitionist-negative-free-logic-natural-deduction-and-normalisation-2108.01976</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-intuitionist-negative-free-logic-natural-deduction-and-normalisation-2108.01976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-intuitionist-negative-free-logic-natural-deduction-and-normalisation-2108.01976"/></url>
<url><loc>https://scifaro.com/en/abs/two-treatments-of-definite-descriptions-in-intuitionist-negative-free-logic-2108.01977</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-treatments-of-definite-descriptions-in-intuitionist-negative-free-logic-2108.01977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-treatments-of-definite-descriptions-in-intuitionist-negative-free-logic-2108.01977"/></url>
<url><loc>https://scifaro.com/en/abs/definite-descriptions-in-intuitionist-positive-free-logic-2108.01978</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definite-descriptions-in-intuitionist-positive-free-logic-2108.01978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definite-descriptions-in-intuitionist-positive-free-logic-2108.01978"/></url>
<url><loc>https://scifaro.com/en/abs/an-asp-based-solution-to-the-chemotherapy-treatment-scheduling-problem-2108.02637</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-asp-based-solution-to-the-chemotherapy-treatment-scheduling-problem-2108.02637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-asp-based-solution-to-the-chemotherapy-treatment-scheduling-problem-2108.02637"/></url>
<url><loc>https://scifaro.com/en/abs/dezyne-paving-the-way-to-practical-formal-software-engineering-2108.02962</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dezyne-paving-the-way-to-practical-formal-software-engineering-2108.02962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dezyne-paving-the-way-to-practical-formal-software-engineering-2108.02962"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-theory-pattern-for-linearized-control-systems-2108.02964</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-theory-pattern-for-linearized-control-systems-2108.02964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-theory-pattern-for-linearized-control-systems-2108.02964"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-and-explicit-proof-management-in-keymaera-x-2108.02965</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-and-explicit-proof-management-in-keymaera-x-2108.02965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-and-explicit-proof-management-in-keymaera-x-2108.02965"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-counterexamples-with-giant-step-assertion-checking-2108.02967</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-counterexamples-with-giant-step-assertion-checking-2108.02967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-counterexamples-with-giant-step-assertion-checking-2108.02967"/></url>
<url><loc>https://scifaro.com/en/abs/deductive-verification-via-the-debug-adapter-protocol-2108.02968</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deductive-verification-via-the-debug-adapter-protocol-2108.02968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deductive-verification-via-the-debug-adapter-protocol-2108.02968"/></url>
<url><loc>https://scifaro.com/en/abs/how-the-analyzer-can-help-the-user-help-the-analyzer-2108.02969</loc><lastmod>2021-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-the-analyzer-can-help-the-user-help-the-analyzer-2108.02969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-the-analyzer-can-help-the-user-help-the-analyzer-2108.02969"/></url>
<url><loc>https://scifaro.com/en/abs/optimizing-probabilities-in-probabilistic-logic-programs-2108.03095</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimizing-probabilities-in-probabilistic-logic-programs-2108.03095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimizing-probabilities-in-probabilistic-logic-programs-2108.03095"/></url>
<url><loc>https://scifaro.com/en/abs/here-and-there-with-arithmetic-2108.03187</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/here-and-there-with-arithmetic-2108.03187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/here-and-there-with-arithmetic-2108.03187"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-and-subformula-property-for-a-system-of-classical-logic-with-tarski-s-rule-and-a-correction-2108.03939</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-and-subformula-property-for-a-system-of-classical-logic-with-tarski-s-rule-and-a-correction-2108.03939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-and-subformula-property-for-a-system-of-classical-logic-with-tarski-s-rule-and-a-correction-2108.03939"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-and-semantics-for-a-theory-of-definite-descriptions-2108.03944</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-and-semantics-for-a-theory-of-definite-descriptions-2108.03944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-and-semantics-for-a-theory-of-definite-descriptions-2108.03944"/></url>
<url><loc>https://scifaro.com/en/abs/explicit-non-normal-modal-logic-2108.04486</loc><lastmod>2023-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explicit-non-normal-modal-logic-2108.04486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explicit-non-normal-modal-logic-2108.04486"/></url>
<url><loc>https://scifaro.com/en/abs/proving-unsat-in-smt-the-case-of-quantifier-free-non-linear-real-arithmetic-2108.05320</loc><lastmod>2021-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-unsat-in-smt-the-case-of-quantifier-free-non-linear-real-arithmetic-2108.05320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-unsat-in-smt-the-case-of-quantifier-free-non-linear-real-arithmetic-2108.05320"/></url>
<url><loc>https://scifaro.com/en/abs/lutz-s-spoiler-technique-revisited-a-unified-approach-to-worst-case-optimal-entailment-of-unions-of-conjunctive-queries-in-locally-forward-description-logics-2108.05680</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lutz-s-spoiler-technique-revisited-a-unified-approach-to-worst-case-optimal-entailment-of-unions-of-conjunctive-queries-in-locally-forward-description-logics-2108.05680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lutz-s-spoiler-technique-revisited-a-unified-approach-to-worst-case-optimal-entailment-of-unions-of-conjunctive-queries-in-locally-forward-description-logics-2108.05680"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-for-bilateral-classical-logic-with-some-philosophical-remarks-and-a-note-on-it-2108.05842</loc><lastmod>2021-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-for-bilateral-classical-logic-with-some-philosophical-remarks-and-a-note-on-it-2108.05842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-for-bilateral-classical-logic-with-some-philosophical-remarks-and-a-note-on-it-2108.05842"/></url>
<url><loc>https://scifaro.com/en/abs/natural-deduction-calculus-for-first-order-logic-2108.06015</loc><lastmod>2021-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-deduction-calculus-for-first-order-logic-2108.06015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-deduction-calculus-for-first-order-logic-2108.06015"/></url>
<url><loc>https://scifaro.com/en/abs/scaling-up-hardware-accelerator-verification-using-a-qed-with-functional-decomposition-2108.06081</loc><lastmod>2022-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scaling-up-hardware-accelerator-verification-using-a-qed-with-functional-decomposition-2108.06081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scaling-up-hardware-accelerator-verification-using-a-qed-with-functional-decomposition-2108.06081"/></url>
<url><loc>https://scifaro.com/en/abs/shacl-a-description-logic-in-disguise-2108.06096</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shacl-a-description-logic-in-disguise-2108.06096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shacl-a-description-logic-in-disguise-2108.06096"/></url>
<url><loc>https://scifaro.com/en/abs/an-ml-style-record-calculus-with-extensible-records-2108.06296</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-ml-style-record-calculus-with-extensible-records-2108.06296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-ml-style-record-calculus-with-extensible-records-2108.06296"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-correspondence-for-relevance-logics-bunched-implication-logics-and-relation-algebras-the-algorithm-pearl-and-its-implementation-technical-report-2108.06603</loc><lastmod>2021-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-correspondence-for-relevance-logics-bunched-implication-logics-and-relation-algebras-the-algorithm-pearl-and-its-implementation-technical-report-2108.06603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-correspondence-for-relevance-logics-bunched-implication-logics-and-relation-algebras-the-algorithm-pearl-and-its-implementation-technical-report-2108.06603"/></url>
<url><loc>https://scifaro.com/en/abs/a-conjecture-equivalent-to-the-collatz-conjecture-2108.06922</loc><lastmod>2021-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-conjecture-equivalent-to-the-collatz-conjecture-2108.06922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-conjecture-equivalent-to-the-collatz-conjecture-2108.06922"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-c11-style-weak-memory-libraries-via-refinement-2108.06944</loc><lastmod>2021-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-c11-style-weak-memory-libraries-via-refinement-2108.06944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-c11-style-weak-memory-libraries-via-refinement-2108.06944"/></url>
<url><loc>https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-long-version-2108.07510</loc><lastmod>2021-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-long-version-2108.07510"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-long-version-2108.07510"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-dynamical-type-theories-for-navigation-2108.07625</loc><lastmod>2021-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-dynamical-type-theories-for-navigation-2108.07625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-dynamical-type-theories-for-navigation-2108.07625"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-automatic-relations-and-their-applications-to-smt-and-chc-solving-2108.07642</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-automatic-relations-and-their-applications-to-smt-and-chc-solving-2108.07642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-automatic-relations-and-their-applications-to-smt-and-chc-solving-2108.07642"/></url>
<url><loc>https://scifaro.com/en/abs/timed-automata-robustness-analysis-via-model-checking-2108.08018</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-automata-robustness-analysis-via-model-checking-2108.08018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-automata-robustness-analysis-via-model-checking-2108.08018"/></url>
<url><loc>https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2108.08070</loc><lastmod>2021-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2108.08070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2108.08070"/></url>
<url><loc>https://scifaro.com/en/abs/on-correctness-and-completeness-of-an-n-queens-program-2108.08079</loc><lastmod>2022-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-correctness-and-completeness-of-an-n-queens-program-2108.08079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-correctness-and-completeness-of-an-n-queens-program-2108.08079"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-automatic-proof-of-lamport-s-paxos-2108.08796</loc><lastmod>2021-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-automatic-proof-of-lamport-s-paxos-2108.08796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-automatic-proof-of-lamport-s-paxos-2108.08796"/></url>
<url><loc>https://scifaro.com/en/abs/description-logics-as-polyadic-modal-logics-2108.08838</loc><lastmod>2021-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/description-logics-as-polyadic-modal-logics-2108.08838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/description-logics-as-polyadic-modal-logics-2108.08838"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-28th-international-workshop-on-expressiveness-in-concurrency-and-18th-workshop-on-structural-operational-semantics-2108.09624</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-28th-international-workshop-on-expressiveness-in-concurrency-and-18th-workshop-on-structural-operational-semantics-2108.09624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-28th-international-workshop-on-expressiveness-in-concurrency-and-18th-workshop-on-structural-operational-semantics-2108.09624"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-calculi-with-reversibility-probabilism-and-guards-2108.10156</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-calculi-with-reversibility-probabilism-and-guards-2108.10156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-calculi-with-reversibility-probabilism-and-guards-2108.10156"/></url>
<url><loc>https://scifaro.com/en/abs/the-multiverse-logical-modularity-for-proof-assistants-2108.10259</loc><lastmod>2021-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-multiverse-logical-modularity-for-proof-assistants-2108.10259"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-multiverse-logical-modularity-for-proof-assistants-2108.10259"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplicial-model-for-kb4-n-epistemic-logic-with-agents-that-may-die-2108.10293</loc><lastmod>2022-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplicial-model-for-kb4-n-epistemic-logic-with-agents-that-may-die-2108.10293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplicial-model-for-kb4-n-epistemic-logic-with-agents-that-may-die-2108.10293"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-choice-and-probability-distributions-an-open-problem-the-real-hotel-2108.10489</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-choice-and-probability-distributions-an-open-problem-the-real-hotel-2108.10489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-choice-and-probability-distributions-an-open-problem-the-real-hotel-2108.10489"/></url>
<url><loc>https://scifaro.com/en/abs/separating-the-expressive-power-of-propositional-dynamic-and-modal-fixpoint-logics-2108.10490</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-the-expressive-power-of-propositional-dynamic-and-modal-fixpoint-logics-2108.10490"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-the-expressive-power-of-propositional-dynamic-and-modal-fixpoint-logics-2108.10490"/></url>
<url><loc>https://scifaro.com/en/abs/on-decidability-of-the-bisimilarity-on-higher-order-processes-with-parameterization-2108.10494</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-decidability-of-the-bisimilarity-on-higher-order-processes-with-parameterization-2108.10494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-decidability-of-the-bisimilarity-on-higher-order-processes-with-parameterization-2108.10494"/></url>
<url><loc>https://scifaro.com/en/abs/the-mays-and-musts-of-concurrent-strategies-2108.10558</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-mays-and-musts-of-concurrent-strategies-2108.10558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-mays-and-musts-of-concurrent-strategies-2108.10558"/></url>
<url><loc>https://scifaro.com/en/abs/scalar-actions-in-lean-s-mathlib-2108.10700</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalar-actions-in-lean-s-mathlib-2108.10700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalar-actions-in-lean-s-mathlib-2108.10700"/></url>
<url><loc>https://scifaro.com/en/abs/convexity-via-weak-distributive-laws-2108.10718</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convexity-via-weak-distributive-laws-2108.10718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convexity-via-weak-distributive-laws-2108.10718"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-an-algorithm-a-modern-view-2108.10728</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-an-algorithm-a-modern-view-2108.10728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-an-algorithm-a-modern-view-2108.10728"/></url>
<url><loc>https://scifaro.com/en/abs/on-encoding-lf-in-a-predicate-logic-over-simply-typed-lambda-terms-2108.10848</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-encoding-lf-in-a-predicate-logic-over-simply-typed-lambda-terms-2108.10848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-encoding-lf-in-a-predicate-logic-over-simply-typed-lambda-terms-2108.10848"/></url>
<url><loc>https://scifaro.com/en/abs/on-specialization-of-a-program-model-of-naive-pattern-matching-in-strings-extended-abstract-2108.10865</loc><lastmod>2021-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-specialization-of-a-program-model-of-naive-pattern-matching-in-strings-extended-abstract-2108.10865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-specialization-of-a-program-model-of-naive-pattern-matching-in-strings-extended-abstract-2108.10865"/></url>
<url><loc>https://scifaro.com/en/abs/towards-formalising-schutz-axioms-for-minkowski-spacetime-in-isabelle-hol-2108.10868</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-formalising-schutz-axioms-for-minkowski-spacetime-in-isabelle-hol-2108.10868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-formalising-schutz-axioms-for-minkowski-spacetime-in-isabelle-hol-2108.10868"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-2108.11226</loc><lastmod>2021-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-2108.11226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-translations-from-synchronous-communication-to-synchronizing-locks-2108.11226"/></url>
<url><loc>https://scifaro.com/en/abs/p-rho-log-a-system-for-rule-based-programming-2108.11699</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/p-rho-log-a-system-for-rule-based-programming-2108.11699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/p-rho-log-a-system-for-rule-based-programming-2108.11699"/></url>
<url><loc>https://scifaro.com/en/abs/automata-linear-dynamic-logic-on-finite-traces-2108.12003</loc><lastmod>2025-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-linear-dynamic-logic-on-finite-traces-2108.12003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-linear-dynamic-logic-on-finite-traces-2108.12003"/></url>
<url><loc>https://scifaro.com/en/abs/geometric-models-for-temporally-attributed-description-logics-2108.12239</loc><lastmod>2021-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometric-models-for-temporally-attributed-description-logics-2108.12239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometric-models-for-temporally-attributed-description-logics-2108.12239"/></url>
<url><loc>https://scifaro.com/en/abs/revising-ontologies-via-models-the-alc-formula-case-2108.12331</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revising-ontologies-via-models-the-alc-formula-case-2108.12331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revising-ontologies-via-models-the-alc-formula-case-2108.12331"/></url>
<url><loc>https://scifaro.com/en/abs/cirquent-calculus-in-a-nutshell-2108.12552</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cirquent-calculus-in-a-nutshell-2108.12552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cirquent-calculus-in-a-nutshell-2108.12552"/></url>
<url><loc>https://scifaro.com/en/abs/an-upper-bound-for-provenance-in-elhr-2108.12774</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-upper-bound-for-provenance-in-elhr-2108.12774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-upper-bound-for-provenance-in-elhr-2108.12774"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-version-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2108.13104</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-version-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2108.13104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-version-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2108.13104"/></url>
<url><loc>https://scifaro.com/en/abs/representation-and-processing-of-instantaneous-and-durative-temporal-phenomena-2108.13365</loc><lastmod>2021-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-and-processing-of-instantaneous-and-durative-temporal-phenomena-2108.13365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-and-processing-of-instantaneous-and-durative-temporal-phenomena-2108.13365"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-gromov-hausdorff-space-2108.13660</loc><lastmod>2021-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-gromov-hausdorff-space-2108.13660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-gromov-hausdorff-space-2108.13660"/></url>
<url><loc>https://scifaro.com/en/abs/irredundant-buffer-and-splitter-insertion-and-scheduling-based-optimization-for-aqfp-circuits-2109.00291</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/irredundant-buffer-and-splitter-insertion-and-scheduling-based-optimization-for-aqfp-circuits-2109.00291"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/irredundant-buffer-and-splitter-insertion-and-scheduling-based-optimization-for-aqfp-circuits-2109.00291"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-matching-logic-2109.00319</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-matching-logic-2109.00319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-matching-logic-2109.00319"/></url>
<url><loc>https://scifaro.com/en/abs/separating-minimal-valuations-point-continuous-valuations-and-continuous-valuations-2109.00426</loc><lastmod>2021-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separating-minimal-valuations-point-continuous-valuations-and-continuous-valuations-2109.00426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separating-minimal-valuations-point-continuous-valuations-and-continuous-valuations-2109.00426"/></url>
<url><loc>https://scifaro.com/en/abs/the-second-international-verification-of-neural-networks-competition-vnn-comp-2021-summary-and-results-2109.00498</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-second-international-verification-of-neural-networks-competition-vnn-comp-2021-summary-and-results-2109.00498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-second-international-verification-of-neural-networks-competition-vnn-comp-2021-summary-and-results-2109.00498"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-interactive-proofs-2109.00775</loc><lastmod>2023-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-interactive-proofs-2109.00775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-interactive-proofs-2109.00775"/></url>
<url><loc>https://scifaro.com/en/abs/the-weihrauch-degree-of-finding-nash-equilibria-in-multiplayer-games-2109.00972</loc><lastmod>2025-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-weihrauch-degree-of-finding-nash-equilibria-in-multiplayer-games-2109.00972"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-weihrauch-degree-of-finding-nash-equilibria-in-multiplayer-games-2109.00972"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-the-proof-theoretic-foundations-of-logic-programming-2109.01483</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-the-proof-theoretic-foundations-of-logic-programming-2109.01483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-the-proof-theoretic-foundations-of-logic-programming-2109.01483"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-17th-international-conference-on-quantum-physics-and-logic-2109.01534</loc><lastmod>2021-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-17th-international-conference-on-quantum-physics-and-logic-2109.01534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-17th-international-conference-on-quantum-physics-and-logic-2109.01534"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-proof-complexity-of-mcsat-2109.01585</loc><lastmod>2021-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-proof-complexity-of-mcsat-2109.01585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-proof-complexity-of-mcsat-2109.01585"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-meta-theorems-for-distance-and-matching-2109.01875</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-meta-theorems-for-distance-and-matching-2109.01875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-meta-theorems-for-distance-and-matching-2109.01875"/></url>
<url><loc>https://scifaro.com/en/abs/steady-state-distributions-in-generalized-exclusion-processes-2109.02114</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/steady-state-distributions-in-generalized-exclusion-processes-2109.02114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/steady-state-distributions-in-generalized-exclusion-processes-2109.02114"/></url>
<url><loc>https://scifaro.com/en/abs/gottesman-types-for-quantum-programs-2109.02197</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gottesman-types-for-quantum-programs-2109.02197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gottesman-types-for-quantum-programs-2109.02197"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-crisp-simulations-and-crisp-directed-simulations-between-fuzzy-labeled-transition-systems-by-using-fuzzy-modal-logics-2109.02334</loc><lastmod>2021-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-crisp-simulations-and-crisp-directed-simulations-between-fuzzy-labeled-transition-systems-by-using-fuzzy-modal-logics-2109.02334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-crisp-simulations-and-crisp-directed-simulations-between-fuzzy-labeled-transition-systems-by-using-fuzzy-modal-logics-2109.02334"/></url>
<url><loc>https://scifaro.com/en/abs/tractability-frontier-for-dually-closed-temporal-quantified-constraint-satisfaction-problems-2109.02721</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractability-frontier-for-dually-closed-temporal-quantified-constraint-satisfaction-problems-2109.02721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractability-frontier-for-dually-closed-temporal-quantified-constraint-satisfaction-problems-2109.02721"/></url>
<url><loc>https://scifaro.com/en/abs/statistical-model-checking-of-common-attack-scenarios-on-blockchain-2109.02803</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/statistical-model-checking-of-common-attack-scenarios-on-blockchain-2109.02803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/statistical-model-checking-of-common-attack-scenarios-on-blockchain-2109.02803"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving-2109.02805</loc><lastmod>2021-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving-2109.02805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-in-finite-domains-where-semantic-evaluation-competes-with-smt-solving-2109.02805"/></url>
<url><loc>https://scifaro.com/en/abs/learned-provability-likelihood-for-tactical-search-2109.03234</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learned-provability-likelihood-for-tactical-search-2109.03234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learned-provability-likelihood-for-tactical-search-2109.03234"/></url>
<url><loc>https://scifaro.com/en/abs/e-cyclist-implementation-of-an-efficient-validation-of-folid-cyclic-induction-reasoning-2109.03235</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/e-cyclist-implementation-of-an-efficient-validation-of-folid-cyclic-induction-reasoning-2109.03235"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/e-cyclist-implementation-of-an-efficient-validation-of-folid-cyclic-induction-reasoning-2109.03235"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-pi-calculi-with-reversibility-probabilism-and-guards-2109.03278</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-pi-calculi-with-reversibility-probabilism-and-guards-2109.03278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-pi-calculi-with-reversibility-probabilism-and-guards-2109.03278"/></url>
<url><loc>https://scifaro.com/en/abs/any-horizon-uniform-random-sampling-and-enumeration-of-constrained-scenarios-for-simulation-based-formal-verification-2109.03330</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/any-horizon-uniform-random-sampling-and-enumeration-of-constrained-scenarios-for-simulation-based-formal-verification-2109.03330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/any-horizon-uniform-random-sampling-and-enumeration-of-constrained-scenarios-for-simulation-based-formal-verification-2109.03330"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-closure-modulo-permutation-equations-2109.03720</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-closure-modulo-permutation-equations-2109.03720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-closure-modulo-permutation-equations-2109.03720"/></url>
<url><loc>https://scifaro.com/en/abs/conjectures-tests-and-proofs-an-overview-of-theory-exploration-2109.03721</loc><lastmod>2021-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjectures-tests-and-proofs-an-overview-of-theory-exploration-2109.03721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjectures-tests-and-proofs-an-overview-of-theory-exploration-2109.03721"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-8th-workshop-on-horn-clauses-for-verification-and-synthesis-2109.03988</loc><lastmod>2021-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-horn-clauses-for-verification-and-synthesis-2109.03988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-8th-workshop-on-horn-clauses-for-verification-and-synthesis-2109.03988"/></url>
<url><loc>https://scifaro.com/en/abs/regular-path-clauses-and-their-application-in-solving-loops-2109.04631</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-path-clauses-and-their-application-in-solving-loops-2109.04631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-path-clauses-and-their-application-in-solving-loops-2109.04631"/></url>
<url><loc>https://scifaro.com/en/abs/a-fixed-point-theorem-for-horn-formula-equations-2109.04633</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fixed-point-theorem-for-horn-formula-equations-2109.04633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fixed-point-theorem-for-horn-formula-equations-2109.04633"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-assisted-reasoning-of-model-augmented-system-requirements-with-event-calculus-and-goal-directed-answer-set-programming-2109.04634</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-assisted-reasoning-of-model-augmented-system-requirements-with-event-calculus-and-goal-directed-answer-set-programming-2109.04634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-assisted-reasoning-of-model-augmented-system-requirements-with-event-calculus-and-goal-directed-answer-set-programming-2109.04634"/></url>
<url><loc>https://scifaro.com/en/abs/competition-report-chc-comp-21-2109.04635</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/competition-report-chc-comp-21-2109.04635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/competition-report-chc-comp-21-2109.04635"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-black-box-checking-via-model-checking-with-strengthened-specifications-2109.04656</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-black-box-checking-via-model-checking-with-strengthened-specifications-2109.04656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-black-box-checking-via-model-checking-with-strengthened-specifications-2109.04656"/></url>
<url><loc>https://scifaro.com/en/abs/combining-event-calculus-and-description-logic-reasoning-via-logic-programming-2109.04803</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-event-calculus-and-description-logic-reasoning-via-logic-programming-2109.04803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-event-calculus-and-description-logic-reasoning-via-logic-programming-2109.04803"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-cyber-physical-systems-theory-2109.04858</loc><lastmod>2021-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-cyber-physical-systems-theory-2109.04858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-cyber-physical-systems-theory-2109.04858"/></url>
<url><loc>https://scifaro.com/en/abs/understanding-the-relative-strength-of-qbf-cdcl-solvers-and-qbf-resolution-2109.04862</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/understanding-the-relative-strength-of-qbf-cdcl-solvers-and-qbf-resolution-2109.04862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/understanding-the-relative-strength-of-qbf-cdcl-solvers-and-qbf-resolution-2109.04862"/></url>
<url><loc>https://scifaro.com/en/abs/mining-counterexamples-for-wide-signature-algebras-with-an-isabelle-server-2109.05264</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mining-counterexamples-for-wide-signature-algebras-with-an-isabelle-server-2109.05264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mining-counterexamples-for-wide-signature-algebras-with-an-isabelle-server-2109.05264"/></url>
<url><loc>https://scifaro.com/en/abs/np-satisfiability-for-arrays-as-powers-2109.05363</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-satisfiability-for-arrays-as-powers-2109.05363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-satisfiability-for-arrays-as-powers-2109.05363"/></url>
<url><loc>https://scifaro.com/en/abs/delp-dynamic-epistemic-logic-for-security-protocols-2109.05599</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delp-dynamic-epistemic-logic-for-security-protocols-2109.05599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delp-dynamic-epistemic-logic-for-security-protocols-2109.05599"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-semantics-of-reversible-pattern-matching-2109.05837</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-semantics-of-reversible-pattern-matching-2109.05837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-semantics-of-reversible-pattern-matching-2109.05837"/></url>
<url><loc>https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-localities-2109.05936</loc><lastmod>2021-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-localities-2109.05936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truly-concurrent-process-algebra-with-localities-2109.05936"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagram-rewrite-theory-iii-confluence-with-and-without-frobenius-2109.06049</loc><lastmod>2022-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-iii-confluence-with-and-without-frobenius-2109.06049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagram-rewrite-theory-iii-confluence-with-and-without-frobenius-2109.06049"/></url>
<url><loc>https://scifaro.com/en/abs/coverability-termination-and-finiteness-in-recursive-petri-nets-2109.06804</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coverability-termination-and-finiteness-in-recursive-petri-nets-2109.06804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coverability-termination-and-finiteness-in-recursive-petri-nets-2109.06804"/></url>
<url><loc>https://scifaro.com/en/abs/limitations-of-the-invertible-map-equivalences-2109.07218</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limitations-of-the-invertible-map-equivalences-2109.07218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limitations-of-the-invertible-map-equivalences-2109.07218"/></url>
<url><loc>https://scifaro.com/en/abs/learning-what-others-know-2109.07255</loc><lastmod>2021-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-what-others-know-2109.07255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-what-others-know-2109.07255"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-37th-international-conference-on-logic-programming-technical-communications-2109.07914</loc><lastmod>2021-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-37th-international-conference-on-logic-programming-technical-communications-2109.07914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-37th-international-conference-on-logic-programming-technical-communications-2109.07914"/></url>
<url><loc>https://scifaro.com/en/abs/online-monitoring-of-spatio-temporal-properties-for-imprecise-signals-2109.08081</loc><lastmod>2021-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-monitoring-of-spatio-temporal-properties-for-imprecise-signals-2109.08081"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-monitoring-of-spatio-temporal-properties-for-imprecise-signals-2109.08081"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-occur-check-2109.08278</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-occur-check-2109.08278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-occur-check-2109.08278"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-and-stream-extensions-of-answer-set-programming-2109.08281</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-and-stream-extensions-of-answer-set-programming-2109.08281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-and-stream-extensions-of-answer-set-programming-2109.08281"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-requirements-for-well-defined-hybrid-probabilistic-logic-programs-2109.08283</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-requirements-for-well-defined-hybrid-probabilistic-logic-programs-2109.08283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-requirements-for-well-defined-hybrid-probabilistic-logic-programs-2109.08283"/></url>
<url><loc>https://scifaro.com/en/abs/apia-an-architecture-for-policy-aware-intentional-agents-2109.08287</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/apia-an-architecture-for-policy-aware-intentional-agents-2109.08287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/apia-an-architecture-for-policy-aware-intentional-agents-2109.08287"/></url>
<url><loc>https://scifaro.com/en/abs/geolog-scalable-logic-programming-on-spatial-data-2109.08295</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geolog-scalable-logic-programming-on-spatial-data-2109.08295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geolog-scalable-logic-programming-on-spatial-data-2109.08295"/></url>
<url><loc>https://scifaro.com/en/abs/discasp-a-graph-based-asp-system-for-finding-relevant-consistent-concepts-with-applications-to-conversational-socialbots-2109.08297</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discasp-a-graph-based-asp-system-for-finding-relevant-consistent-concepts-with-applications-to-conversational-socialbots-2109.08297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discasp-a-graph-based-asp-system-for-finding-relevant-consistent-concepts-with-applications-to-conversational-socialbots-2109.08297"/></url>
<url><loc>https://scifaro.com/en/abs/compilation-of-aggregates-in-asp-2109.08303</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compilation-of-aggregates-in-asp-2109.08303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compilation-of-aggregates-in-asp-2109.08303"/></url>
<url><loc>https://scifaro.com/en/abs/formalisation-of-action-with-durations-in-answer-set-programming-2109.08305</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalisation-of-action-with-durations-in-answer-set-programming-2109.08305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalisation-of-action-with-durations-in-answer-set-programming-2109.08305"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-convexity-of-a-fragment-of-pure-set-theory-with-applications-within-a-nelson-oppen-framework-2109.08309</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-convexity-of-a-fragment-of-pure-set-theory-with-applications-within-a-nelson-oppen-framework-2109.08309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-convexity-of-a-fragment-of-pure-set-theory-with-applications-within-a-nelson-oppen-framework-2109.08309"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-size-of-disjunctive-formulas-in-the-mu-calculus-2109.08310</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-size-of-disjunctive-formulas-in-the-mu-calculus-2109.08310"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-size-of-disjunctive-formulas-in-the-mu-calculus-2109.08310"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2109.08313</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2109.08313"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-property-and-bisimulation-for-lfd-2109.08313"/></url>
<url><loc>https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-2109.08315</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-2109.08315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reconfigurable-broadcast-networks-and-asynchronous-shared-memory-systems-are-equivalent-2109.08315"/></url>
<url><loc>https://scifaro.com/en/abs/adding-the-relation-meets-to-the-temporal-logic-of-prefixes-and-infixes-makes-it-expspace-complete-2109.08320</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-the-relation-meets-to-the-temporal-logic-of-prefixes-and-infixes-makes-it-expspace-complete-2109.08320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-the-relation-meets-to-the-temporal-logic-of-prefixes-and-infixes-makes-it-expspace-complete-2109.08320"/></url>
<url><loc>https://scifaro.com/en/abs/filtration-and-canonical-completeness-for-continuous-modal-mu-calculi-2109.08321</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filtration-and-canonical-completeness-for-continuous-modal-mu-calculi-2109.08321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filtration-and-canonical-completeness-for-continuous-modal-mu-calculi-2109.08321"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-succinctness-of-regular-expressions-2109.08324</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-succinctness-of-regular-expressions-2109.08324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-succinctness-of-regular-expressions-2109.08324"/></url>
<url><loc>https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2109.08326</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2109.08326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witnessing-subsystems-for-probabilistic-systems-with-low-tree-width-2109.08326"/></url>
<url><loc>https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2109.08327</loc><lastmod>2021-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2109.08327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiring-provenance-for-b-uchi-games-strategy-analysis-with-absorptive-polynomials-2109.08327"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-answer-set-programming-solver-systems-2109.08681</loc><lastmod>2021-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-answer-set-programming-solver-systems-2109.08681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-answer-set-programming-solver-systems-2109.08681"/></url>
<url><loc>https://scifaro.com/en/abs/evl-a-typed-functional-language-for-event-processing-2109.08960</loc><lastmod>2021-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evl-a-typed-functional-language-for-event-processing-2109.08960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evl-a-typed-functional-language-for-event-processing-2109.08960"/></url>
<url><loc>https://scifaro.com/en/abs/a-parameterized-view-on-the-complexity-of-dependence-logic-2109.09342</loc><lastmod>2021-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parameterized-view-on-the-complexity-of-dependence-logic-2109.09342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parameterized-view-on-the-complexity-of-dependence-logic-2109.09342"/></url>
<url><loc>https://scifaro.com/en/abs/money-grows-on-proof-trees-the-formal-fa1-2-ledger-standard-2109.09451</loc><lastmod>2021-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/money-grows-on-proof-trees-the-formal-fa1-2-ledger-standard-2109.09451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/money-grows-on-proof-trees-the-formal-fa1-2-ledger-standard-2109.09451"/></url>
<url><loc>https://scifaro.com/en/abs/a-flexible-proof-format-for-sat-solver-elaborator-communication-2109.09665</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-flexible-proof-format-for-sat-solver-elaborator-communication-2109.09665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-flexible-proof-format-for-sat-solver-elaborator-communication-2109.09665"/></url>
<url><loc>https://scifaro.com/en/abs/perpetual-free-choice-petri-nets-are-lucent-proof-of-a-theorem-of-van-der-aalst-using-cp-exhaustions-2109.10002</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/perpetual-free-choice-petri-nets-are-lucent-proof-of-a-theorem-of-van-der-aalst-using-cp-exhaustions-2109.10002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/perpetual-free-choice-petri-nets-are-lucent-proof-of-a-theorem-of-van-der-aalst-using-cp-exhaustions-2109.10002"/></url>
<url><loc>https://scifaro.com/en/abs/a-temporal-logic-of-epistemic-and-normative-justifications-with-an-application-to-the-protagoras-paradox-2109.10018</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-temporal-logic-of-epistemic-and-normative-justifications-with-an-application-to-the-protagoras-paradox-2109.10018"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-temporal-logic-of-epistemic-and-normative-justifications-with-an-application-to-the-protagoras-paradox-2109.10018"/></url>
<url><loc>https://scifaro.com/en/abs/adding-negation-to-lambda-mu-2109.10447</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-negation-to-lambda-mu-2109.10447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-negation-to-lambda-mu-2109.10447"/></url>
<url><loc>https://scifaro.com/en/abs/query-evaluation-in-datalogmtl-taming-infinite-query-results-2109.10691</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-evaluation-in-datalogmtl-taming-infinite-query-results-2109.10691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-evaluation-in-datalogmtl-taming-infinite-query-results-2109.10691"/></url>
<url><loc>https://scifaro.com/en/abs/the-point-to-set-principle-and-the-dimensions-of-hamel-bases-2109.10981</loc><lastmod>2023-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-point-to-set-principle-and-the-dimensions-of-hamel-bases-2109.10981"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-point-to-set-principle-and-the-dimensions-of-hamel-bases-2109.10981"/></url>
<url><loc>https://scifaro.com/en/abs/union-and-intersection-of-all-justifications-2109.11216</loc><lastmod>2021-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/union-and-intersection-of-all-justifications-2109.11216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/union-and-intersection-of-all-justifications-2109.11216"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-write-a-coequation-2109.11967</loc><lastmod>2021-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-write-a-coequation-2109.11967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-write-a-coequation-2109.11967"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-switched-stochastic-systems-via-barrier-certificates-2109.12420</loc><lastmod>2021-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-switched-stochastic-systems-via-barrier-certificates-2109.12420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-switched-stochastic-systems-via-barrier-certificates-2109.12420"/></url>
<url><loc>https://scifaro.com/en/abs/the-vmt-lib-language-and-tools-2109.12821</loc><lastmod>2021-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vmt-lib-language-and-tools-2109.12821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vmt-lib-language-and-tools-2109.12821"/></url>
<url><loc>https://scifaro.com/en/abs/hyperqb-a-bounded-model-checker-for-hyperproperties-2109.12989</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperqb-a-bounded-model-checker-for-hyperproperties-2109.12989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperqb-a-bounded-model-checker-for-hyperproperties-2109.12989"/></url>
<url><loc>https://scifaro.com/en/abs/state-complexity-of-protocols-with-leaders-2109.15171</loc><lastmod>2022-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/state-complexity-of-protocols-with-leaders-2109.15171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/state-complexity-of-protocols-with-leaders-2109.15171"/></url>
<url><loc>https://scifaro.com/en/abs/deadlock-freedom-for-asynchronous-and-cyclic-process-networks-2110.00146</loc><lastmod>2021-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deadlock-freedom-for-asynchronous-and-cyclic-process-networks-2110.00146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deadlock-freedom-for-asynchronous-and-cyclic-process-networks-2110.00146"/></url>
<url><loc>https://scifaro.com/en/abs/decomposing-monolithic-processes-in-a-process-algebra-with-multi-actions-2110.00147</loc><lastmod>2021-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposing-monolithic-processes-in-a-process-algebra-with-multi-actions-2110.00147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposing-monolithic-processes-in-a-process-algebra-with-multi-actions-2110.00147"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-deciding-provability-in-linear-logic-and-its-fragments-2110.00562</loc><lastmod>2021-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-deciding-provability-in-linear-logic-and-its-fragments-2110.00562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-deciding-provability-in-linear-logic-and-its-fragments-2110.00562"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-implicit-complexity-2110.01114</loc><lastmod>2025-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-implicit-complexity-2110.01114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-implicit-complexity-2110.01114"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-quantum-programs-theory-tools-and-challenges-2110.01320</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-quantum-programs-theory-tools-and-challenges-2110.01320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-quantum-programs-theory-tools-and-challenges-2110.01320"/></url>
<url><loc>https://scifaro.com/en/abs/one-dimensional-fragment-over-words-and-trees-2110.02678</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-dimensional-fragment-over-words-and-trees-2110.02678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-dimensional-fragment-over-words-and-trees-2110.02678"/></url>
<url><loc>https://scifaro.com/en/abs/concrete-categorical-model-of-a-quantum-circuit-description-language-with-measurement-2110.02691</loc><lastmod>2022-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concrete-categorical-model-of-a-quantum-circuit-description-language-with-measurement-2110.02691"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concrete-categorical-model-of-a-quantum-circuit-description-language-with-measurement-2110.02691"/></url>
<url><loc>https://scifaro.com/en/abs/active-learning-for-sound-negotiations-2110.02783</loc><lastmod>2022-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/active-learning-for-sound-negotiations-2110.02783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/active-learning-for-sound-negotiations-2110.02783"/></url>
<url><loc>https://scifaro.com/en/abs/unprovability-results-for-clause-set-cycles-2110.03246</loc><lastmod>2022-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unprovability-results-for-clause-set-cycles-2110.03246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unprovability-results-for-clause-set-cycles-2110.03246"/></url>
<url><loc>https://scifaro.com/en/abs/on-equivalence-checking-for-orthocomplemented-bisemilattices-in-log-linear-time-2110.03315</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-equivalence-checking-for-orthocomplemented-bisemilattices-in-log-linear-time-2110.03315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-equivalence-checking-for-orthocomplemented-bisemilattices-in-log-linear-time-2110.03315"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-geometric-algebra-in-lean-2110.03551</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-geometric-algebra-in-lean-2110.03551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-geometric-algebra-in-lean-2110.03551"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-guarded-fragments-2110.03821</loc><lastmod>2021-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-guarded-fragments-2110.03821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-guarded-fragments-2110.03821"/></url>
<url><loc>https://scifaro.com/en/abs/a-subexponential-view-of-domains-in-session-types-2110.03964</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-subexponential-view-of-domains-in-session-types-2110.03964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-subexponential-view-of-domains-in-session-types-2110.03964"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-logic-of-legal-competences-2110.04454</loc><lastmod>2021-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-logic-of-legal-competences-2110.04454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-logic-of-legal-competences-2110.04454"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-extensional-binary-tries-2110.05063</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-extensional-binary-tries-2110.05063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-extensional-binary-tries-2110.05063"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-equality-in-substructural-logic-via-lipschitz-doctrines-2110.05388</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-equality-in-substructural-logic-via-lipschitz-doctrines-2110.05388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-equality-in-substructural-logic-via-lipschitz-doctrines-2110.05388"/></url>
<url><loc>https://scifaro.com/en/abs/free-commutative-monoids-in-homotopy-type-theory-2110.05412</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-commutative-monoids-in-homotopy-type-theory-2110.05412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-commutative-monoids-in-homotopy-type-theory-2110.05412"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-kaexp-pol-problems-for-deterministic-machines-2110.05630</loc><lastmod>2021-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-kaexp-pol-problems-for-deterministic-machines-2110.05630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-kaexp-pol-problems-for-deterministic-machines-2110.05630"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-model-counting-in-fo2-with-cardinality-constraints-and-counting-quantifiers-a-closed-form-formula-2110.05992</loc><lastmod>2022-04-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-model-counting-in-fo2-with-cardinality-constraints-and-counting-quantifiers-a-closed-form-formula-2110.05992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-model-counting-in-fo2-with-cardinality-constraints-and-counting-quantifiers-a-closed-form-formula-2110.05992"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-modal-xi-calculus-on-the-aspects-of-application-and-bisimulation-2110.07689</loc><lastmod>2023-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-modal-xi-calculus-on-the-aspects-of-application-and-bisimulation-2110.07689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-modal-xi-calculus-on-the-aspects-of-application-and-bisimulation-2110.07689"/></url>
<url><loc>https://scifaro.com/en/abs/the-pebble-relation-comonad-in-finite-model-theory-2110.08196</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pebble-relation-comonad-in-finite-model-theory-2110.08196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pebble-relation-comonad-in-finite-model-theory-2110.08196"/></url>
<url><loc>https://scifaro.com/en/abs/voting-theory-in-the-lean-theorem-prover-2110.08453</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/voting-theory-in-the-lean-theorem-prover-2110.08453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/voting-theory-in-the-lean-theorem-prover-2110.08453"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-mpi-programs-2110.08537</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-mpi-programs-2110.08537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-mpi-programs-2110.08537"/></url>
<url><loc>https://scifaro.com/en/abs/sahlqvist-correspondence-theory-for-second-order-propositional-modal-logic-2110.08561</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sahlqvist-correspondence-theory-for-second-order-propositional-modal-logic-2110.08561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sahlqvist-correspondence-theory-for-second-order-propositional-modal-logic-2110.08561"/></url>
<url><loc>https://scifaro.com/en/abs/correct-probabilistic-model-checking-with-floating-point-arithmetic-2110.08785</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-probabilistic-model-checking-with-floating-point-arithmetic-2110.08785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-probabilistic-model-checking-with-floating-point-arithmetic-2110.08785"/></url>
<url><loc>https://scifaro.com/en/abs/learning-first-order-rules-with-relational-path-contrast-for-inductive-relation-reasoning-2110.08810</loc><lastmod>2024-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-first-order-rules-with-relational-path-contrast-for-inductive-relation-reasoning-2110.08810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-first-order-rules-with-relational-path-contrast-for-inductive-relation-reasoning-2110.08810"/></url>
<url><loc>https://scifaro.com/en/abs/category-theoretical-semantics-of-the-description-logic-alc-extended-version-2110.08837</loc><lastmod>2022-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/category-theoretical-semantics-of-the-description-logic-alc-extended-version-2110.08837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/category-theoretical-semantics-of-the-description-logic-alc-extended-version-2110.08837"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-of-conjectures-2110.08920</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-of-conjectures-2110.08920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-of-conjectures-2110.08920"/></url>
<url><loc>https://scifaro.com/en/abs/random-formula-generators-2110.09228</loc><lastmod>2021-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-formula-generators-2110.09228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-formula-generators-2110.09228"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-compliance-in-process-choreographies-foundations-algorithms-and-implementation-2110.09399</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-compliance-in-process-choreographies-foundations-algorithms-and-implementation-2110.09399"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-compliance-in-process-choreographies-foundations-algorithms-and-implementation-2110.09399"/></url>
<url><loc>https://scifaro.com/en/abs/bppchecker-an-smt-based-model-checker-on-basic-parallel-processes-full-version-2110.09414</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bppchecker-an-smt-based-model-checker-on-basic-parallel-processes-full-version-2110.09414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bppchecker-an-smt-based-model-checker-on-basic-parallel-processes-full-version-2110.09414"/></url>
<url><loc>https://scifaro.com/en/abs/permutation-invariance-of-deep-neural-networks-with-relus-2110.09578</loc><lastmod>2021-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permutation-invariance-of-deep-neural-networks-with-relus-2110.09578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permutation-invariance-of-deep-neural-networks-with-relus-2110.09578"/></url>
<url><loc>https://scifaro.com/en/abs/comonadic-semantics-for-hybrid-logic-and-bounded-fragments-2110.09844</loc><lastmod>2021-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comonadic-semantics-for-hybrid-logic-and-bounded-fragments-2110.09844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comonadic-semantics-for-hybrid-logic-and-bounded-fragments-2110.09844"/></url>
<url><loc>https://scifaro.com/en/abs/predicate-and-relation-liftings-for-coalgebras-with-side-effects-an-application-in-coalgebraic-modal-logic-2110.09911</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predicate-and-relation-liftings-for-coalgebras-with-side-effects-an-application-in-coalgebraic-modal-logic-2110.09911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predicate-and-relation-liftings-for-coalgebras-with-side-effects-an-application-in-coalgebraic-modal-logic-2110.09911"/></url>
<url><loc>https://scifaro.com/en/abs/sky-is-not-the-limit-tighter-rank-bounds-for-elevator-automata-in-b-u-chi-automata-complementation-technical-report-2110.10187</loc><lastmod>2022-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sky-is-not-the-limit-tighter-rank-bounds-for-elevator-automata-in-b-u-chi-automata-complementation-technical-report-2110.10187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sky-is-not-the-limit-tighter-rank-bounds-for-elevator-automata-in-b-u-chi-automata-complementation-technical-report-2110.10187"/></url>
<url><loc>https://scifaro.com/en/abs/anaphora-and-ellipsis-in-lambek-calculus-with-a-relevant-modality-syntax-and-semantics-2110.10641</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anaphora-and-ellipsis-in-lambek-calculus-with-a-relevant-modality-syntax-and-semantics-2110.10641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anaphora-and-ellipsis-in-lambek-calculus-with-a-relevant-modality-syntax-and-semantics-2110.10641"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-algebraic-theories-2110.10970</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-algebraic-theories-2110.10970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-algebraic-theories-2110.10970"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-compcert-with-verifast-2110.11034</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-compcert-with-verifast-2110.11034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-compcert-with-verifast-2110.11034"/></url>
<url><loc>https://scifaro.com/en/abs/applying-second-order-quantifier-elimination-in-inspecting-g-odel-s-ontological-proof-2110.11108</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/applying-second-order-quantifier-elimination-in-inspecting-g-odel-s-ontological-proof-2110.11108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/applying-second-order-quantifier-elimination-in-inspecting-g-odel-s-ontological-proof-2110.11108"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-teamltl-and-first-order-team-logic-over-hyperproperties-2110.11109</loc><lastmod>2021-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-teamltl-and-first-order-team-logic-over-hyperproperties-2110.11109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-teamltl-and-first-order-team-logic-over-hyperproperties-2110.11109"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-distributed-quantum-protocols-2110.11416</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-distributed-quantum-protocols-2110.11416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-distributed-quantum-protocols-2110.11416"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-third-workshop-on-formal-methods-for-autonomous-systems-2110.11527</loc><lastmod>2021-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-formal-methods-for-autonomous-systems-2110.11527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-third-workshop-on-formal-methods-for-autonomous-systems-2110.11527"/></url>
<url><loc>https://scifaro.com/en/abs/proof-carrying-parameters-in-certified-symbolic-execution-the-case-study-of-antiunification-2110.11700</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-carrying-parameters-in-certified-symbolic-execution-the-case-study-of-antiunification-2110.11700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-carrying-parameters-in-certified-symbolic-execution-the-case-study-of-antiunification-2110.11700"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-with-verified-guarantees-2110.11755</loc><lastmod>2021-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-with-verified-guarantees-2110.11755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-with-verified-guarantees-2110.11755"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-formalisation-of-justification-and-justifiability-2110.12581</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-formalisation-of-justification-and-justifiability-2110.12581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-formalisation-of-justification-and-justifiability-2110.12581"/></url>
<url><loc>https://scifaro.com/en/abs/extending-urban-multi-lane-spatial-logic-to-formalise-road-junction-rules-2110.12583</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-urban-multi-lane-spatial-logic-to-formalise-road-junction-rules-2110.12583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-urban-multi-lane-spatial-logic-to-formalise-road-junction-rules-2110.12583"/></url>
<url><loc>https://scifaro.com/en/abs/towards-partial-monitoring-it-is-always-too-soon-to-give-up-2110.12585</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-partial-monitoring-it-is-always-too-soon-to-give-up-2110.12585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-partial-monitoring-it-is-always-too-soon-to-give-up-2110.12585"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-team-semantics-revisited-2110.12699</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-team-semantics-revisited-2110.12699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-team-semantics-revisited-2110.12699"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-polynomial-non-clausal-class-in-many-valued-logic-2110.12901</loc><lastmod>2021-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-polynomial-non-clausal-class-in-many-valued-logic-2110.12901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-polynomial-non-clausal-class-in-many-valued-logic-2110.12901"/></url>
<url><loc>https://scifaro.com/en/abs/on-enumerating-short-projected-models-2110.12924</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-enumerating-short-projected-models-2110.12924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-enumerating-short-projected-models-2110.12924"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-refinement-proofs-in-separation-logic-2110.13559</loc><lastmod>2021-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-refinement-proofs-in-separation-logic-2110.13559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-refinement-proofs-in-separation-logic-2110.13559"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-of-predicate-subtyping-with-proof-irrelevance-in-the-lambda-pi-calculus-modulo-theory-2110.13704</loc><lastmod>2021-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-of-predicate-subtyping-with-proof-irrelevance-in-the-lambda-pi-calculus-modulo-theory-2110.13704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-of-predicate-subtyping-with-proof-irrelevance-in-the-lambda-pi-calculus-modulo-theory-2110.13704"/></url>
<url><loc>https://scifaro.com/en/abs/a-non-deterministic-multiset-query-language-2111.00218</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-non-deterministic-multiset-query-language-2111.00218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-non-deterministic-multiset-query-language-2111.00218"/></url>
<url><loc>https://scifaro.com/en/abs/on-small-types-in-univalent-foundations-2111.00482</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-small-types-in-univalent-foundations-2111.00482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-small-types-in-univalent-foundations-2111.00482"/></url>
<url><loc>https://scifaro.com/en/abs/a-modular-construction-of-type-theories-2111.00543</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modular-construction-of-type-theories-2111.00543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modular-construction-of-type-theories-2111.00543"/></url>
<url><loc>https://scifaro.com/en/abs/a-graphical-framework-for-the-category-based-metamodel-for-access-control-and-obligations-2111.00588</loc><lastmod>2021-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-graphical-framework-for-the-category-based-metamodel-for-access-control-and-obligations-2111.00588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-graphical-framework-for-the-category-based-metamodel-for-access-control-and-obligations-2111.00588"/></url>
<url><loc>https://scifaro.com/en/abs/some-questions-of-uniformity-in-algorithmic-randomness-2111.01472</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-questions-of-uniformity-in-algorithmic-randomness-2111.01472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-questions-of-uniformity-in-algorithmic-randomness-2111.01472"/></url>
<url><loc>https://scifaro.com/en/abs/a-strong-call-by-need-calculus-2111.01485</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strong-call-by-need-calculus-2111.01485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strong-call-by-need-calculus-2111.01485"/></url>
<url><loc>https://scifaro.com/en/abs/fair-mutual-exclusion-for-n-processes-extended-version-2111.02251</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-mutual-exclusion-for-n-processes-extended-version-2111.02251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-mutual-exclusion-for-n-processes-extended-version-2111.02251"/></url>
<url><loc>https://scifaro.com/en/abs/logically-sound-arguments-for-the-effectiveness-of-ml-safety-measures-2111.02649</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logically-sound-arguments-for-the-effectiveness-of-ml-safety-measures-2111.02649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logically-sound-arguments-for-the-effectiveness-of-ml-safety-measures-2111.02649"/></url>
<url><loc>https://scifaro.com/en/abs/small-model-property-reflects-in-games-and-automata-2111.02998</loc><lastmod>2021-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-model-property-reflects-in-games-and-automata-2111.02998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-model-property-reflects-in-games-and-automata-2111.02998"/></url>
<url><loc>https://scifaro.com/en/abs/sound-approximate-and-asymptotic-probabilistic-bisimulations-for-pctl-2111.03117</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-approximate-and-asymptotic-probabilistic-bisimulations-for-pctl-2111.03117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-approximate-and-asymptotic-probabilistic-bisimulations-for-pctl-2111.03117"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-repair-and-deadlock-detection-for-parameterized-systems-2111.03322</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-repair-and-deadlock-detection-for-parameterized-systems-2111.03322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-repair-and-deadlock-detection-for-parameterized-systems-2111.03322"/></url>
<url><loc>https://scifaro.com/en/abs/learning-formulas-in-finite-variable-logics-2111.03534</loc><lastmod>2021-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-formulas-in-finite-variable-logics-2111.03534"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-formulas-in-finite-variable-logics-2111.03534"/></url>
<url><loc>https://scifaro.com/en/abs/monotonic-safety-for-scalable-and-data-efficient-probabilistic-safety-analysis-2111.03781</loc><lastmod>2022-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monotonic-safety-for-scalable-and-data-efficient-probabilistic-safety-analysis-2111.03781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monotonic-safety-for-scalable-and-data-efficient-probabilistic-safety-analysis-2111.03781"/></url>
<url><loc>https://scifaro.com/en/abs/confidence-composition-for-monitors-of-verification-assumptions-2111.03782</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confidence-composition-for-monitors-of-verification-assumptions-2111.03782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confidence-composition-for-monitors-of-verification-assumptions-2111.03782"/></url>
<url><loc>https://scifaro.com/en/abs/computational-category-theoretic-rewriting-2111.03784</loc><lastmod>2023-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-category-theoretic-rewriting-2111.03784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-category-theoretic-rewriting-2111.03784"/></url>
<url><loc>https://scifaro.com/en/abs/a-presheaf-semantics-for-quantified-temporal-logics-2111.03855</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-presheaf-semantics-for-quantified-temporal-logics-2111.03855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-presheaf-semantics-for-quantified-temporal-logics-2111.03855"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-piecewise-linear-algebra-2111.03956</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-piecewise-linear-algebra-2111.03956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-piecewise-linear-algebra-2111.03956"/></url>
<url><loc>https://scifaro.com/en/abs/pattern-based-subterm-selection-in-isabelle-2111.04082</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pattern-based-subterm-selection-in-isabelle-2111.04082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pattern-based-subterm-selection-in-isabelle-2111.04082"/></url>
<url><loc>https://scifaro.com/en/abs/order-theoretic-trees-monadic-second-order-descriptions-and-regularity-2111.04083</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-theoretic-trees-monadic-second-order-descriptions-and-regularity-2111.04083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-theoretic-trees-monadic-second-order-descriptions-and-regularity-2111.04083"/></url>
<url><loc>https://scifaro.com/en/abs/gradient-descent-for-randomized-controllers-under-partial-observability-2111.04407</loc><lastmod>2021-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gradient-descent-for-randomized-controllers-under-partial-observability-2111.04407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gradient-descent-for-randomized-controllers-under-partial-observability-2111.04407"/></url>
<url><loc>https://scifaro.com/en/abs/modularity-and-combination-of-associative-commutative-congruence-closure-algorithms-enriched-with-semantic-properties-2111.04793</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modularity-and-combination-of-associative-commutative-congruence-closure-algorithms-enriched-with-semantic-properties-2111.04793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modularity-and-combination-of-associative-commutative-congruence-closure-algorithms-enriched-with-semantic-properties-2111.04793"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-independent-linear-inferences-2111.05209</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-independent-linear-inferences-2111.05209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-independent-linear-inferences-2111.05209"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-ackermann-fragment-with-one-leading-existential-quantifier-2111.05388</loc><lastmod>2022-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-ackermann-fragment-with-one-leading-existential-quantifier-2111.05388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-ackermann-fragment-with-one-leading-existential-quantifier-2111.05388"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-rewritability-and-complexity-of-two-dimensional-temporal-ontology-mediated-queries-2111.06806</loc><lastmod>2022-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-rewritability-and-complexity-of-two-dimensional-temporal-ontology-mediated-queries-2111.06806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-rewritability-and-complexity-of-two-dimensional-temporal-ontology-mediated-queries-2111.06806"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-an-arbitrary-higher-lambda-model-2111.07092</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-an-arbitrary-higher-lambda-model-2111.07092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-an-arbitrary-higher-lambda-model-2111.07092"/></url>
<url><loc>https://scifaro.com/en/abs/birkhoff-s-completeness-theorem-for-multi-sorted-algebras-formalized-in-agda-2111.07936</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/birkhoff-s-completeness-theorem-for-multi-sorted-algebras-formalized-in-agda-2111.07936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/birkhoff-s-completeness-theorem-for-multi-sorted-algebras-formalized-in-agda-2111.07936"/></url>
<url><loc>https://scifaro.com/en/abs/towards-capturing-ptime-with-no-counting-construct-but-with-a-choice-operator-2111.07978</loc><lastmod>2021-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-capturing-ptime-with-no-counting-construct-but-with-a-choice-operator-2111.07978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-capturing-ptime-with-no-counting-construct-but-with-a-choice-operator-2111.07978"/></url>
<url><loc>https://scifaro.com/en/abs/a-maude-implementation-of-rewritable-petri-nets-a-feasible-model-for-dynamically-reconfigurable-systems-2111.08205</loc><lastmod>2021-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-maude-implementation-of-rewritable-petri-nets-a-feasible-model-for-dynamically-reconfigurable-systems-2111.08205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-maude-implementation-of-rewritable-petri-nets-a-feasible-model-for-dynamically-reconfigurable-systems-2111.08205"/></url>
<url><loc>https://scifaro.com/en/abs/f-ides-with-features-and-vcs-designed-to-assist-human-reasoning-when-verification-fails-2111.08207</loc><lastmod>2021-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/f-ides-with-features-and-vcs-designed-to-assist-human-reasoning-when-verification-fails-2111.08207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/f-ides-with-features-and-vcs-designed-to-assist-human-reasoning-when-verification-fails-2111.08207"/></url>
<url><loc>https://scifaro.com/en/abs/experience-report-teaching-code-analysis-and-verification-using-frama-c-2111.08208</loc><lastmod>2021-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experience-report-teaching-code-analysis-and-verification-using-frama-c-2111.08208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experience-report-teaching-code-analysis-and-verification-using-frama-c-2111.08208"/></url>
<url><loc>https://scifaro.com/en/abs/some-doxastic-l-ukasiewicz-logic-2111.08564</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-doxastic-l-ukasiewicz-logic-2111.08564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-doxastic-l-ukasiewicz-logic-2111.08564"/></url>
<url><loc>https://scifaro.com/en/abs/parametricity-features-and-their-requirements-2111.09822</loc><lastmod>2021-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametricity-features-and-their-requirements-2111.09822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametricity-features-and-their-requirements-2111.09822"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-transform-methods-in-higher-order-logic-a-survey-2111.10049</loc><lastmod>2021-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-transform-methods-in-higher-order-logic-a-survey-2111.10049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-transform-methods-in-higher-order-logic-a-survey-2111.10049"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-checking-and-autonomy-2111.10630</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-checking-and-autonomy-2111.10630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-checking-and-autonomy-2111.10630"/></url>
<url><loc>https://scifaro.com/en/abs/strictification-of-weakly-stable-type-theoretic-structures-using-generic-contexts-2111.10862</loc><lastmod>2022-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strictification-of-weakly-stable-type-theoretic-structures-using-generic-contexts-2111.10862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strictification-of-weakly-stable-type-theoretic-structures-using-generic-contexts-2111.10862"/></url>
<url><loc>https://scifaro.com/en/abs/the-central-valuations-monad-2111.10873</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-central-valuations-monad-2111.10873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-central-valuations-monad-2111.10873"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiom-system-for-1-free-kleene-star-expressions-under-bisimilarity-an-elementary-proof-2111.11144</loc><lastmod>2021-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiom-system-for-1-free-kleene-star-expressions-under-bisimilarity-an-elementary-proof-2111.11144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiom-system-for-1-free-kleene-star-expressions-under-bisimilarity-an-elementary-proof-2111.11144"/></url>
<url><loc>https://scifaro.com/en/abs/vector-space-semantics-for-lambek-calculus-with-soft-subexponentials-2111.11331</loc><lastmod>2023-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vector-space-semantics-for-lambek-calculus-with-soft-subexponentials-2111.11331"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vector-space-semantics-for-lambek-calculus-with-soft-subexponentials-2111.11331"/></url>
<url><loc>https://scifaro.com/en/abs/deconfined-global-types-for-asynchronous-sessions-2111.11984</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deconfined-global-types-for-asynchronous-sessions-2111.11984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deconfined-global-types-for-asynchronous-sessions-2111.11984"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-bond-graph-using-higher-order-logic-theorem-proving-2111.12274</loc><lastmod>2021-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-bond-graph-using-higher-order-logic-theorem-proving-2111.12274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-bond-graph-using-higher-order-logic-theorem-proving-2111.12274"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-session-based-concurrency-deadlock-freedom-in-cyclic-process-networks-2111.13091</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-session-based-concurrency-deadlock-freedom-in-cyclic-process-networks-2111.13091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-session-based-concurrency-deadlock-freedom-in-cyclic-process-networks-2111.13091"/></url>
<url><loc>https://scifaro.com/en/abs/esbmc-solidity-an-smt-based-model-checker-for-solidity-smart-contracts-2111.13117</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/esbmc-solidity-an-smt-based-model-checker-for-solidity-smart-contracts-2111.13117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/esbmc-solidity-an-smt-based-model-checker-for-solidity-smart-contracts-2111.13117"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-interpretation-of-normal-logic-programs-2111.13249</loc><lastmod>2021-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-interpretation-of-normal-logic-programs-2111.13249"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-interpretation-of-normal-logic-programs-2111.13249"/></url>
<url><loc>https://scifaro.com/en/abs/is-causal-reasoning-harder-than-probabilistic-reasoning-2111.13936</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-causal-reasoning-harder-than-probabilistic-reasoning-2111.13936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-causal-reasoning-harder-than-probabilistic-reasoning-2111.13936"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-and-non-termination-proofs-2111.13952</loc><lastmod>2022-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-and-non-termination-proofs-2111.13952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-modular-loop-acceleration-and-non-termination-proofs-2111.13952"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-weak-omega-categories-as-models-of-a-type-theory-2111.14208</loc><lastmod>2024-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-weak-omega-categories-as-models-of-a-type-theory-2111.14208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-weak-omega-categories-as-models-of-a-type-theory-2111.14208"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-dependent-type-theory-the-example-of-catt-2111.14736</loc><lastmod>2024-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-dependent-type-theory-the-example-of-catt-2111.14736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-dependent-type-theory-the-example-of-catt-2111.14736"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-to-measure-the-robustness-of-programs-in-the-unpredictable-environment-2111.15319</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-to-measure-the-robustness-of-programs-in-the-unpredictable-environment-2111.15319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-to-measure-the-robustness-of-programs-in-the-unpredictable-environment-2111.15319"/></url>
<url><loc>https://scifaro.com/en/abs/induced-betweenness-in-order-theoretic-trees-2111.15357</loc><lastmod>2021-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induced-betweenness-in-order-theoretic-trees-2111.15357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induced-betweenness-in-order-theoretic-trees-2111.15357"/></url>
<url><loc>https://scifaro.com/en/abs/a-short-note-on-the-counting-complexity-of-conjunctive-queries-2112.01108</loc><lastmod>2021-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-short-note-on-the-counting-complexity-of-conjunctive-queries-2112.01108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-short-note-on-the-counting-complexity-of-conjunctive-queries-2112.01108"/></url>
<url><loc>https://scifaro.com/en/abs/windmills-of-the-minds-an-algorithm-for-fermat-s-two-squares-theorem-2112.02556</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/windmills-of-the-minds-an-algorithm-for-fermat-s-two-squares-theorem-2112.02556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/windmills-of-the-minds-an-algorithm-for-fermat-s-two-squares-theorem-2112.02556"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-semantics-and-expressiveness-of-the-sentential-calculus-with-identity-2112.02696</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-semantics-and-expressiveness-of-the-sentential-calculus-with-identity-2112.02696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-semantics-and-expressiveness-of-the-sentential-calculus-with-identity-2112.02696"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-translation-from-floating-point-to-real-interval-arithmetic-2112.02804</loc><lastmod>2021-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-translation-from-floating-point-to-real-interval-arithmetic-2112.02804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-translation-from-floating-point-to-real-interval-arithmetic-2112.02804"/></url>
<url><loc>https://scifaro.com/en/abs/eager-functions-as-processes-2112.02863</loc><lastmod>2021-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eager-functions-as-processes-2112.02863"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eager-functions-as-processes-2112.02863"/></url>
<url><loc>https://scifaro.com/en/abs/is-complexity-important-for-philosophy-of-mind-2112.03877</loc><lastmod>2021-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/is-complexity-important-for-philosophy-of-mind-2112.03877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/is-complexity-important-for-philosophy-of-mind-2112.03877"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-lie-algebras-2112.04570</loc><lastmod>2021-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-lie-algebras-2112.04570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-lie-algebras-2112.04570"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-assessments-for-decidable-fragments-of-set-theory-iv-a-quadratic-reduction-of-constraints-over-nested-sets-to-boolean-formulae-2112.04797</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-assessments-for-decidable-fragments-of-set-theory-iv-a-quadratic-reduction-of-constraints-over-nested-sets-to-boolean-formulae-2112.04797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-assessments-for-decidable-fragments-of-set-theory-iv-a-quadratic-reduction-of-constraints-over-nested-sets-to-boolean-formulae-2112.04797"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-cut-elimination-for-the-logic-of-bunched-implications-formalized-in-coq-2112.05515</loc><lastmod>2021-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-cut-elimination-for-the-logic-of-bunched-implications-formalized-in-coq-2112.05515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-cut-elimination-for-the-logic-of-bunched-implications-formalized-in-coq-2112.05515"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-higher-order-termination-in-coq-2112.05715</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-higher-order-termination-in-coq-2112.05715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-higher-order-termination-in-coq-2112.05715"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-foundations-of-discrete-reinforcement-learning-in-isabelle-hol-2112.05996</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-foundations-of-discrete-reinforcement-learning-in-isabelle-hol-2112.05996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-foundations-of-discrete-reinforcement-learning-in-isabelle-hol-2112.05996"/></url>
<url><loc>https://scifaro.com/en/abs/interpreting-lambda-calculus-in-domain-valued-random-variables-2112.06339</loc><lastmod>2026-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpreting-lambda-calculus-in-domain-valued-random-variables-2112.06339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpreting-lambda-calculus-in-domain-valued-random-variables-2112.06339"/></url>
<url><loc>https://scifaro.com/en/abs/on-homotopy-of-walks-and-spherical-maps-in-homotopy-type-theory-2112.06609</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-homotopy-of-walks-and-spherical-maps-in-homotopy-type-theory-2112.06609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-homotopy-of-walks-and-spherical-maps-in-homotopy-type-theory-2112.06609"/></url>
<url><loc>https://scifaro.com/en/abs/on-planarity-of-graphs-in-homotopy-type-theory-2112.06633</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-planarity-of-graphs-in-homotopy-type-theory-2112.06633"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-planarity-of-graphs-in-homotopy-type-theory-2112.06633"/></url>
<url><loc>https://scifaro.com/en/abs/rational-pavelka-logic-the-best-among-three-worlds-2112.06762</loc><lastmod>2021-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-pavelka-logic-the-best-among-three-worlds-2112.06762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-pavelka-logic-the-best-among-three-worlds-2112.06762"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-an-effect-handler-based-define-by-run-reverse-mode-ad-library-2112.07292</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-an-effect-handler-based-define-by-run-reverse-mode-ad-library-2112.07292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-an-effect-handler-based-define-by-run-reverse-mode-ad-library-2112.07292"/></url>
<url><loc>https://scifaro.com/en/abs/answering-queries-with-negation-over-existential-rules-2112.07376</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answering-queries-with-negation-over-existential-rules-2112.07376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answering-queries-with-negation-over-existential-rules-2112.07376"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-calculi-for-non-deterministic-many-valued-logics-2112.07377</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-calculi-for-non-deterministic-many-valued-logics-2112.07377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-calculi-for-non-deterministic-many-valued-logics-2112.07377"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-the-program-expressive-power-of-existential-rule-languages-2112.08136</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-the-program-expressive-power-of-existential-rule-languages-2112.08136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-the-program-expressive-power-of-existential-rule-languages-2112.08136"/></url>
<url><loc>https://scifaro.com/en/abs/on-up-to-context-techniques-in-the-pi-calculus-2112.08765</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-up-to-context-techniques-in-the-pi-calculus-2112.08765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-up-to-context-techniques-in-the-pi-calculus-2112.08765"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-on-parametric-verification-of-failure-detectors-2112.08826</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-on-parametric-verification-of-failure-detectors-2112.08826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-on-parametric-verification-of-failure-detectors-2112.08826"/></url>
<url><loc>https://scifaro.com/en/abs/skeleton-abstraction-for-universal-temporal-properties-2112.08884</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skeleton-abstraction-for-universal-temporal-properties-2112.08884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skeleton-abstraction-for-universal-temporal-properties-2112.08884"/></url>
<url><loc>https://scifaro.com/en/abs/about-a-proof-pearl-a-purported-solution-to-a-poplmark-challenge-problem-that-is-not-one-2112.09274</loc><lastmod>2021-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-a-proof-pearl-a-purported-solution-to-a-poplmark-challenge-problem-that-is-not-one-2112.09274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-a-proof-pearl-a-purported-solution-to-a-poplmark-challenge-problem-that-is-not-one-2112.09274"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-model-for-polarization-under-confirmation-bias-in-social-networks-2112.09542</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-model-for-polarization-under-confirmation-bias-in-social-networks-2112.09542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-model-for-polarization-under-confirmation-bias-in-social-networks-2112.09542"/></url>
<url><loc>https://scifaro.com/en/abs/playing-against-fair-adversaries-in-stochastic-games-with-total-rewards-2112.09811</loc><lastmod>2022-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/playing-against-fair-adversaries-in-stochastic-games-with-total-rewards-2112.09811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/playing-against-fair-adversaries-in-stochastic-games-with-total-rewards-2112.09811"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-specialization-of-rewriting-logic-theories-with-presto-2112.10201</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-specialization-of-rewriting-logic-theories-with-presto-2112.10201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-specialization-of-rewriting-logic-theories-with-presto-2112.10201"/></url>
<url><loc>https://scifaro.com/en/abs/concurrence-for-well-formed-cafs-naive-semantics-2112.10445</loc><lastmod>2021-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrence-for-well-formed-cafs-naive-semantics-2112.10445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrence-for-well-formed-cafs-naive-semantics-2112.10445"/></url>
<url><loc>https://scifaro.com/en/abs/list-types-for-resource-aware-languages-an-implicit-name-approach-2112.11062</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/list-types-for-resource-aware-languages-an-implicit-name-approach-2112.11062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/list-types-for-resource-aware-languages-an-implicit-name-approach-2112.11062"/></url>
<url><loc>https://scifaro.com/en/abs/a-machine-checked-direct-proof-of-the-steiner-lehmus-theorem-2112.11182</loc><lastmod>2021-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-machine-checked-direct-proof-of-the-steiner-lehmus-theorem-2112.11182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-machine-checked-direct-proof-of-the-steiner-lehmus-theorem-2112.11182"/></url>
<url><loc>https://scifaro.com/en/abs/model-sketching-by-abstraction-refinement-for-lifted-model-checking-extended-version-2112.11546</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-sketching-by-abstraction-refinement-for-lifted-model-checking-extended-version-2112.11546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-sketching-by-abstraction-refinement-for-lifted-model-checking-extended-version-2112.11546"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-church-s-thesis-synthetic-computability-without-choice-2112.11781</loc><lastmod>2021-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-church-s-thesis-synthetic-computability-without-choice-2112.11781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-church-s-thesis-synthetic-computability-without-choice-2112.11781"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-symmetry-breaking-constraints-with-inductive-logic-programming-2112.11806</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-symmetry-breaking-constraints-with-inductive-logic-programming-2112.11806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-symmetry-breaking-constraints-with-inductive-logic-programming-2112.11806"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-formal-performance-analysis-of-multistate-coherent-systems-using-hol-theorem-proving-2112.12976</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-formal-performance-analysis-of-multistate-coherent-systems-using-hol-theorem-proving-2112.12976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-formal-performance-analysis-of-multistate-coherent-systems-using-hol-theorem-proving-2112.12976"/></url>
<url><loc>https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-parametric-mdps-2112.13020</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-parametric-mdps-2112.13020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenario-based-verification-of-uncertain-parametric-mdps-2112.13020"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-37th-conference-on-mathematical-foundations-of-programming-semantics-2112.13746</loc><lastmod>2021-12-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-37th-conference-on-mathematical-foundations-of-programming-semantics-2112.13746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-37th-conference-on-mathematical-foundations-of-programming-semantics-2112.13746"/></url>
<url><loc>https://scifaro.com/en/abs/multinomial-and-hypergeometric-distributions-in-markov-categories-2112.14044</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multinomial-and-hypergeometric-distributions-in-markov-categories-2112.14044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multinomial-and-hypergeometric-distributions-in-markov-categories-2112.14044"/></url>
<url><loc>https://scifaro.com/en/abs/learning-from-what-s-right-and-learning-from-what-s-wrong-2112.14045</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-from-what-s-right-and-learning-from-what-s-wrong-2112.14045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-from-what-s-right-and-learning-from-what-s-wrong-2112.14045"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-glivenko-g-odel-theorem-for-nuclei-2112.14049</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-glivenko-g-odel-theorem-for-nuclei-2112.14049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-glivenko-g-odel-theorem-for-nuclei-2112.14049"/></url>
<url><loc>https://scifaro.com/en/abs/a-cartesian-bicategory-of-polynomial-functors-in-homotopy-type-theory-2112.14050</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cartesian-bicategory-of-polynomial-functors-in-homotopy-type-theory-2112.14050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cartesian-bicategory-of-polynomial-functors-in-homotopy-type-theory-2112.14050"/></url>
<url><loc>https://scifaro.com/en/abs/sharp-elements-and-apartness-in-domains-2112.14052</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharp-elements-and-apartness-in-domains-2112.14052"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharp-elements-and-apartness-in-domains-2112.14052"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-regions-for-concurrent-programs-2112.14055</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-regions-for-concurrent-programs-2112.14055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-regions-for-concurrent-programs-2112.14055"/></url>
<url><loc>https://scifaro.com/en/abs/two-guarded-recursive-powerdomains-for-applicative-simulation-2112.14056</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-guarded-recursive-powerdomains-for-applicative-simulation-2112.14056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-guarded-recursive-powerdomains-for-applicative-simulation-2112.14056"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-and-coinductive-predicate-liftings-for-effectful-programs-2112.14057</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-and-coinductive-predicate-liftings-for-effectful-programs-2112.14057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-and-coinductive-predicate-liftings-for-effectful-programs-2112.14057"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-realizability-for-safety-ltl-and-related-subfragments-2112.14102</loc><lastmod>2022-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-realizability-for-safety-ltl-and-related-subfragments-2112.14102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-realizability-for-safety-ltl-and-related-subfragments-2112.14102"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-symbolic-automata-2112.14252</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-symbolic-automata-2112.14252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-symbolic-automata-2112.14252"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-system-for-graph-non-isomorphism-verification-2112.14303</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-system-for-graph-non-isomorphism-verification-2112.14303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-system-for-graph-non-isomorphism-verification-2112.14303"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-second-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-2112.14305</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-second-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-2112.14305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-second-joint-international-workshop-on-linearity-trends-in-linear-logic-and-applications-2112.14305"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relational-translation-method-for-propositional-modal-logics-2112.14605</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relational-translation-method-for-propositional-modal-logics-2112.14605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relational-translation-method-for-propositional-modal-logics-2112.14605"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-realizability-on-conjunctive-structures-2112.14606</loc><lastmod>2021-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-realizability-on-conjunctive-structures-2112.14606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-realizability-on-conjunctive-structures-2112.14606"/></url>
<url><loc>https://scifaro.com/en/abs/flag-a-self-dual-modality-for-non-commutative-contraction-and-duplication-in-the-category-of-coherence-spaces-2112.14961</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flag-a-self-dual-modality-for-non-commutative-contraction-and-duplication-in-the-category-of-coherence-spaces-2112.14961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flag-a-self-dual-modality-for-non-commutative-contraction-and-duplication-in-the-category-of-coherence-spaces-2112.14961"/></url>
<url><loc>https://scifaro.com/en/abs/exponentially-handsome-proof-nets-and-their-normalization-2112.14962</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponentially-handsome-proof-nets-and-their-normalization-2112.14962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponentially-handsome-proof-nets-and-their-normalization-2112.14962"/></url>
<url><loc>https://scifaro.com/en/abs/a-deep-inference-system-for-differential-linear-logic-2112.14963</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deep-inference-system-for-differential-linear-logic-2112.14963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deep-inference-system-for-differential-linear-logic-2112.14963"/></url>
<url><loc>https://scifaro.com/en/abs/super-exponentials-in-linear-logic-2112.14964</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/super-exponentials-in-linear-logic-2112.14964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/super-exponentials-in-linear-logic-2112.14964"/></url>
<url><loc>https://scifaro.com/en/abs/a-braided-lambda-calculus-2112.14965</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-braided-lambda-calculus-2112.14965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-braided-lambda-calculus-2112.14965"/></url>
<url><loc>https://scifaro.com/en/abs/harmony-in-the-light-of-computational-ludics-2112.14967</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/harmony-in-the-light-of-computational-ludics-2112.14967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/harmony-in-the-light-of-computational-ludics-2112.14967"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-in-object-centric-workflow-petri-nets-2112.14994</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-in-object-centric-workflow-petri-nets-2112.14994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-in-object-centric-workflow-petri-nets-2112.14994"/></url>
<url><loc>https://scifaro.com/en/abs/an-extension-of-trakhtenbrot-s-theorem-2112.14996</loc><lastmod>2022-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-extension-of-trakhtenbrot-s-theorem-2112.14996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-extension-of-trakhtenbrot-s-theorem-2112.14996"/></url>
<url><loc>https://scifaro.com/en/abs/feferman-vaught-decompositions-for-prefix-classes-of-first-order-logic-2112.15064</loc><lastmod>2022-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/feferman-vaught-decompositions-for-prefix-classes-of-first-order-logic-2112.15064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/feferman-vaught-decompositions-for-prefix-classes-of-first-order-logic-2112.15064"/></url>
<url><loc>https://scifaro.com/en/abs/structural-liveness-of-immediate-observation-petri-nets-2112.15524</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-liveness-of-immediate-observation-petri-nets-2112.15524"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-liveness-of-immediate-observation-petri-nets-2112.15524"/></url>
<url><loc>https://scifaro.com/en/abs/event-structure-semantics-for-multiparty-sessions-2201.00221</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/event-structure-semantics-for-multiparty-sessions-2201.00221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/event-structure-semantics-for-multiparty-sessions-2201.00221"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-criterion-for-mathcal-m-mathcal-n-adhesivity-with-an-application-to-hierarchical-graphs-2201.00233</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-criterion-for-mathcal-m-mathcal-n-adhesivity-with-an-application-to-hierarchical-graphs-2201.00233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-criterion-for-mathcal-m-mathcal-n-adhesivity-with-an-application-to-hierarchical-graphs-2201.00233"/></url>
<url><loc>https://scifaro.com/en/abs/the-solutions-to-single-variable-polynomials-implemented-and-verified-in-lean-2201.00255</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-solutions-to-single-variable-polynomials-implemented-and-verified-in-lean-2201.00255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-solutions-to-single-variable-polynomials-implemented-and-verified-in-lean-2201.00255"/></url>
<url><loc>https://scifaro.com/en/abs/the-area-method-in-the-wolfram-language-2201.00538</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-area-method-in-the-wolfram-language-2201.00538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-area-method-in-the-wolfram-language-2201.00538"/></url>
<url><loc>https://scifaro.com/en/abs/automated-generation-of-illustrations-for-synthetic-geometry-proofs-2201.00540</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-generation-of-illustrations-for-synthetic-geometry-proofs-2201.00540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-generation-of-illustrations-for-synthetic-geometry-proofs-2201.00540"/></url>
<url><loc>https://scifaro.com/en/abs/spreads-and-packings-of-pg-3-2-formally-2201.00541</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spreads-and-packings-of-pg-3-2-formally-2201.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spreads-and-packings-of-pg-3-2-formally-2201.00541"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-geometric-axioms-for-minkowski-spacetime-and-without-loss-of-generality-theorems-2201.00542</loc><lastmod>2022-01-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-geometric-axioms-for-minkowski-spacetime-and-without-loss-of-generality-theorems-2201.00542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-geometric-axioms-for-minkowski-spacetime-and-without-loss-of-generality-theorems-2201.00542"/></url>
<url><loc>https://scifaro.com/en/abs/duality-for-the-existential-fragment-of-first-order-logic-on-words-with-numerical-predicates-of-a-fixed-arity-2201.00872</loc><lastmod>2022-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-for-the-existential-fragment-of-first-order-logic-on-words-with-numerical-predicates-of-a-fixed-arity-2201.00872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-for-the-existential-fragment-of-first-order-logic-on-words-with-numerical-predicates-of-a-fixed-arity-2201.00872"/></url>
<url><loc>https://scifaro.com/en/abs/non-associative-and-projective-linear-logics-2201.02043</loc><lastmod>2022-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-associative-and-projective-linear-logics-2201.02043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-associative-and-projective-linear-logics-2201.02043"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problem-of-some-bundled-foml-fragments-2201.02336</loc><lastmod>2022-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problem-of-some-bundled-foml-fragments-2201.02336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problem-of-some-bundled-foml-fragments-2201.02336"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-separation-over-countable-ordinals-2201.03089</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-separation-over-countable-ordinals-2201.03089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-separation-over-countable-ordinals-2201.03089"/></url>
<url><loc>https://scifaro.com/en/abs/bidirectional-runtime-enforcement-of-first-order-branching-time-properties-2201.03108</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bidirectional-runtime-enforcement-of-first-order-branching-time-properties-2201.03108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bidirectional-runtime-enforcement-of-first-order-branching-time-properties-2201.03108"/></url>
<url><loc>https://scifaro.com/en/abs/a-coq-formalization-of-the-bochner-integral-2201.03242</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coq-formalization-of-the-bochner-integral-2201.03242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coq-formalization-of-the-bochner-integral-2201.03242"/></url>
<url><loc>https://scifaro.com/en/abs/formal-metatheory-of-second-order-abstract-syntax-2201.03504</loc><lastmod>2022-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-metatheory-of-second-order-abstract-syntax-2201.03504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-metatheory-of-second-order-abstract-syntax-2201.03504"/></url>
<url><loc>https://scifaro.com/en/abs/a-faithful-and-quantitative-notion-of-distant-reduction-for-the-lambda-calculus-with-generalized-applications-2201.04156</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-faithful-and-quantitative-notion-of-distant-reduction-for-the-lambda-calculus-with-generalized-applications-2201.04156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-faithful-and-quantitative-notion-of-distant-reduction-for-the-lambda-calculus-with-generalized-applications-2201.04156"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-soundness-in-workflow-nets-2201.05588</loc><lastmod>2022-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-soundness-in-workflow-nets-2201.05588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-soundness-in-workflow-nets-2201.05588"/></url>
<url><loc>https://scifaro.com/en/abs/mechanizing-matching-logic-in-coq-2201.05716</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanizing-matching-logic-in-coq-2201.05716"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanizing-matching-logic-in-coq-2201.05716"/></url>
<url><loc>https://scifaro.com/en/abs/r-check-a-model-checker-for-verifying-reconfigurable-mas-2201.06312</loc><lastmod>2022-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/r-check-a-model-checker-for-verifying-reconfigurable-mas-2201.06312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/r-check-a-model-checker-for-verifying-reconfigurable-mas-2201.06312"/></url>
<url><loc>https://scifaro.com/en/abs/a-tree-clock-data-structure-for-causal-orderings-in-concurrent-executions-2201.06325</loc><lastmod>2025-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tree-clock-data-structure-for-causal-orderings-in-concurrent-executions-2201.06325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tree-clock-data-structure-for-causal-orderings-in-concurrent-executions-2201.06325"/></url>
<url><loc>https://scifaro.com/en/abs/robust-computation-tree-logic-2201.07116</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-computation-tree-logic-2201.07116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-computation-tree-logic-2201.07116"/></url>
<url><loc>https://scifaro.com/en/abs/online-generation-of-proofs-without-words-2201.07274</loc><lastmod>2022-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/online-generation-of-proofs-without-words-2201.07274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/online-generation-of-proofs-without-words-2201.07274"/></url>
<url><loc>https://scifaro.com/en/abs/automated-theorem-proving-in-the-classroom-2201.07275</loc><lastmod>2022-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-theorem-proving-in-the-classroom-2201.07275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-theorem-proving-in-the-classroom-2201.07275"/></url>
<url><loc>https://scifaro.com/en/abs/on-probability-raising-causality-in-markov-decision-processes-2201.08768</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-probability-raising-causality-in-markov-decision-processes-2201.08768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-probability-raising-causality-in-markov-decision-processes-2201.08768"/></url>
<url><loc>https://scifaro.com/en/abs/incoherent-coherences-2201.08811</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incoherent-coherences-2201.08811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incoherent-coherences-2201.08811"/></url>
<url><loc>https://scifaro.com/en/abs/biochemical-space-language-in-relation-to-multiset-rewriting-systems-2201.08817</loc><lastmod>2022-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/biochemical-space-language-in-relation-to-multiset-rewriting-systems-2201.08817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/biochemical-space-language-in-relation-to-multiset-rewriting-systems-2201.08817"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-nonexpansive-operations-in-quantitative-algebraic-reasoning-2201.09087</loc><lastmod>2022-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-nonexpansive-operations-in-quantitative-algebraic-reasoning-2201.09087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-nonexpansive-operations-in-quantitative-algebraic-reasoning-2201.09087"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fly-solving-for-symbolic-parity-games-2201.09607</loc><lastmod>2022-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fly-solving-for-symbolic-parity-games-2201.09607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fly-solving-for-symbolic-parity-games-2201.09607"/></url>
<url><loc>https://scifaro.com/en/abs/a-sorted-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2201.09769</loc><lastmod>2022-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sorted-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2201.09769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sorted-datalog-hammer-for-supervisor-verification-conditions-modulo-simple-linear-arithmetic-2201.09769"/></url>
<url><loc>https://scifaro.com/en/abs/learning-model-checking-and-the-kernel-trick-for-signal-temporal-logic-on-stochastic-processes-2201.09928</loc><lastmod>2022-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-model-checking-and-the-kernel-trick-for-signal-temporal-logic-on-stochastic-processes-2201.09928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-model-checking-and-the-kernel-trick-for-signal-temporal-logic-on-stochastic-processes-2201.09928"/></url>
<url><loc>https://scifaro.com/en/abs/monadic-monadic-second-order-logic-2201.09969</loc><lastmod>2022-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadic-monadic-second-order-logic-2201.09969"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadic-monadic-second-order-logic-2201.09969"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-game-logic-and-modal-mu-calculus-2201.10012</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-game-logic-and-modal-mu-calculus-2201.10012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-game-logic-and-modal-mu-calculus-2201.10012"/></url>
<url><loc>https://scifaro.com/en/abs/the-trusted-computing-base-of-the-compcert-verified-compiler-2201.10280</loc><lastmod>2022-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-trusted-computing-base-of-the-compcert-verified-compiler-2201.10280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-trusted-computing-base-of-the-compcert-verified-compiler-2201.10280"/></url>
<url><loc>https://scifaro.com/en/abs/a-special-case-of-schematic-syntactic-unification-2201.10298</loc><lastmod>2023-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-special-case-of-schematic-syntactic-unification-2201.10298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-special-case-of-schematic-syntactic-unification-2201.10298"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-analysis-of-reconfigurable-broadcast-networks-long-version-2201.10432</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-analysis-of-reconfigurable-broadcast-networks-long-version-2201.10432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-analysis-of-reconfigurable-broadcast-networks-long-version-2201.10432"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-algorithms-and-relevant-properties-of-reversible-primitive-permutations-with-lean-2201.10443</loc><lastmod>2022-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-algorithms-and-relevant-properties-of-reversible-primitive-permutations-with-lean-2201.10443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-algorithms-and-relevant-properties-of-reversible-primitive-permutations-with-lean-2201.10443"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-theory-of-sequential-digital-circuits-denotational-operational-and-algebraic-semantics-2201.10456</loc><lastmod>2026-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-theory-of-sequential-digital-circuits-denotational-operational-and-algebraic-semantics-2201.10456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-theory-of-sequential-digital-circuits-denotational-operational-and-algebraic-semantics-2201.10456"/></url>
<url><loc>https://scifaro.com/en/abs/automating-safety-and-security-co-design-through-semantically-rich-architecture-patterns-2201.10563</loc><lastmod>2022-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-safety-and-security-co-design-through-semantically-rich-architecture-patterns-2201.10563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-safety-and-security-co-design-through-semantically-rich-architecture-patterns-2201.10563"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-the-high-level-specification-and-verification-of-synchronous-digital-logic-systems-2201.10632</loc><lastmod>2023-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-the-high-level-specification-and-verification-of-synchronous-digital-logic-systems-2201.10632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-the-high-level-specification-and-verification-of-synchronous-digital-logic-systems-2201.10632"/></url>
<url><loc>https://scifaro.com/en/abs/bicategorical-type-theory-semantics-and-syntax-2201.10662</loc><lastmod>2023-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bicategorical-type-theory-semantics-and-syntax-2201.10662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bicategorical-type-theory-semantics-and-syntax-2201.10662"/></url>
<url><loc>https://scifaro.com/en/abs/treelike-decompositions-for-transductions-of-sparse-graphs-2201.11082</loc><lastmod>2022-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/treelike-decompositions-for-transductions-of-sparse-graphs-2201.11082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/treelike-decompositions-for-transductions-of-sparse-graphs-2201.11082"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-linear-lambda-calculus-2201.11221</loc><lastmod>2025-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-linear-lambda-calculus-2201.11221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-linear-lambda-calculus-2201.11221"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-for-entailment-checking-in-quantitative-separation-logic-extended-version-2201.11464</loc><lastmod>2022-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-for-entailment-checking-in-quantitative-separation-logic-extended-version-2201.11464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-for-entailment-checking-in-quantitative-separation-logic-extended-version-2201.11464"/></url>
<url><loc>https://scifaro.com/en/abs/logical-pseudocode-connecting-algorithms-with-proofs-2201.12572</loc><lastmod>2022-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-pseudocode-connecting-algorithms-with-proofs-2201.12572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-pseudocode-connecting-algorithms-with-proofs-2201.12572"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-asynchronous-hyperproperties-for-recursive-programs-2201.12859</loc><lastmod>2023-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-asynchronous-hyperproperties-for-recursive-programs-2201.12859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-asynchronous-hyperproperties-for-recursive-programs-2201.12859"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-procedure-for-separation-logic-with-inductive-definitions-and-theory-reasoning-2201.13227</loc><lastmod>2022-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-procedure-for-separation-logic-with-inductive-definitions-and-theory-reasoning-2201.13227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-procedure-for-separation-logic-with-inductive-definitions-and-theory-reasoning-2201.13227"/></url>
<url><loc>https://scifaro.com/en/abs/a-higher-order-language-for-markov-kernels-and-linear-operators-2202.00142</loc><lastmod>2023-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-higher-order-language-for-markov-kernels-and-linear-operators-2202.00142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-higher-order-language-for-markov-kernels-and-linear-operators-2202.00142"/></url>
<url><loc>https://scifaro.com/en/abs/interactive-configurator-with-fo-and-idp-z3-2202.00343</loc><lastmod>2023-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interactive-configurator-with-fo-and-idp-z3-2202.00343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interactive-configurator-with-fo-and-idp-z3-2202.00343"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-temporal-logic-on-finite-traces-semantic-properties-decidable-fragments-and-applications-2202.00610</loc><lastmod>2022-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-temporal-logic-on-finite-traces-semantic-properties-decidable-fragments-and-applications-2202.00610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-temporal-logic-on-finite-traces-semantic-properties-decidable-fragments-and-applications-2202.00610"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-efficient-exact-real-number-computation-from-proofs-in-constructive-type-theory-2202.00891</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-efficient-exact-real-number-computation-from-proofs-in-constructive-type-theory-2202.00891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-efficient-exact-real-number-computation-from-proofs-in-constructive-type-theory-2202.00891"/></url>
<url><loc>https://scifaro.com/en/abs/quantification-and-aggregation-over-concepts-of-the-ontology-2202.00898</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantification-and-aggregation-over-concepts-of-the-ontology-2202.00898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantification-and-aggregation-over-concepts-of-the-ontology-2202.00898"/></url>
<url><loc>https://scifaro.com/en/abs/modal-reduction-principles-across-relational-semantics-2202.00899</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-reduction-principles-across-relational-semantics-2202.00899"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-reduction-principles-across-relational-semantics-2202.00899"/></url>
<url><loc>https://scifaro.com/en/abs/are-bundles-good-deals-for-foml-2202.01581</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-bundles-good-deals-for-foml-2202.01581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-bundles-good-deals-for-foml-2202.01581"/></url>
<url><loc>https://scifaro.com/en/abs/use-and-abuse-of-instance-parameters-in-the-lean-mathematical-library-2202.01629</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/use-and-abuse-of-instance-parameters-in-the-lean-mathematical-library-2202.01629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/use-and-abuse-of-instance-parameters-in-the-lean-mathematical-library-2202.01629"/></url>
<url><loc>https://scifaro.com/en/abs/mv-datalog-effective-rule-based-reasoning-with-uncertain-observations-2202.01718</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mv-datalog-effective-rule-based-reasoning-with-uncertain-observations-2202.01718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mv-datalog-effective-rule-based-reasoning-with-uncertain-observations-2202.01718"/></url>
<url><loc>https://scifaro.com/en/abs/on-expressive-rule-based-logics-2202.01761</loc><lastmod>2022-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-expressive-rule-based-logics-2202.01761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-expressive-rule-based-logics-2202.01761"/></url>
<url><loc>https://scifaro.com/en/abs/improving-automatic-complexity-analysis-of-integer-programs-2202.01769</loc><lastmod>2022-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-automatic-complexity-analysis-of-integer-programs-2202.01769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-automatic-complexity-analysis-of-integer-programs-2202.01769"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-streams-for-dataflow-programming-2202.02061</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-streams-for-dataflow-programming-2202.02061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-streams-for-dataflow-programming-2202.02061"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-theorem-proving-components-for-educational-software-2202.02144</loc><lastmod>2022-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-theorem-proving-components-for-educational-software-2202.02144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-10th-international-workshop-on-theorem-proving-components-for-educational-software-2202.02144"/></url>
<url><loc>https://scifaro.com/en/abs/leveraging-the-power-of-graph-algorithms-efficient-algorithms-for-computer-aided-verification-2202.02660</loc><lastmod>2022-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leveraging-the-power-of-graph-algorithms-efficient-algorithms-for-computer-aided-verification-2202.02660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leveraging-the-power-of-graph-algorithms-efficient-algorithms-for-computer-aided-verification-2202.02660"/></url>
<url><loc>https://scifaro.com/en/abs/call-by-value-solvability-and-multi-types-2202.03079</loc><lastmod>2022-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/call-by-value-solvability-and-multi-types-2202.03079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/call-by-value-solvability-and-multi-types-2202.03079"/></url>
<url><loc>https://scifaro.com/en/abs/eager-functions-as-processes-long-version-2202.03187</loc><lastmod>2022-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eager-functions-as-processes-long-version-2202.03187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eager-functions-as-processes-long-version-2202.03187"/></url>
<url><loc>https://scifaro.com/en/abs/automated-instantiation-of-control-flow-tracing-exercises-2202.03565</loc><lastmod>2022-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-instantiation-of-control-flow-tracing-exercises-2202.03565"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-instantiation-of-control-flow-tracing-exercises-2202.03565"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-intuitionistic-and-classical-propositional-logic-using-isabelle-2202.03567</loc><lastmod>2022-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-intuitionistic-and-classical-propositional-logic-using-isabelle-2202.03567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-intuitionistic-and-classical-propositional-logic-using-isabelle-2202.03567"/></url>
<url><loc>https://scifaro.com/en/abs/evolution-of-sasylf-2008-2021-2202.03568</loc><lastmod>2022-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evolution-of-sasylf-2008-2021-2202.03568"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evolution-of-sasylf-2008-2021-2202.03568"/></url>
<url><loc>https://scifaro.com/en/abs/distal-combinatorial-tools-for-graphs-of-bounded-twin-width-2202.04006</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distal-combinatorial-tools-for-graphs-of-bounded-twin-width-2202.04006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distal-combinatorial-tools-for-graphs-of-bounded-twin-width-2202.04006"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebra-of-alignment-for-relational-verification-2202.04278</loc><lastmod>2023-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebra-of-alignment-for-relational-verification-2202.04278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebra-of-alignment-for-relational-verification-2202.04278"/></url>
<url><loc>https://scifaro.com/en/abs/proving-non-termination-and-lower-runtime-bounds-with-loat-system-description-2202.04546</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-non-termination-and-lower-runtime-bounds-with-loat-system-description-2202.04546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-non-termination-and-lower-runtime-bounds-with-loat-system-description-2202.04546"/></url>
<url><loc>https://scifaro.com/en/abs/lebesgue-induction-and-tonelli-s-theorem-in-coq-2202.05040</loc><lastmod>2022-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lebesgue-induction-and-tonelli-s-theorem-in-coq-2202.05040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lebesgue-induction-and-tonelli-s-theorem-in-coq-2202.05040"/></url>
<url><loc>https://scifaro.com/en/abs/formalized-functional-analysis-with-semilinear-maps-2202.05360</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalized-functional-analysis-with-semilinear-maps-2202.05360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalized-functional-analysis-with-semilinear-maps-2202.05360"/></url>
<url><loc>https://scifaro.com/en/abs/checking-continuous-stochastic-logic-against-quantum-continuous-time-markov-chains-2202.05412</loc><lastmod>2025-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-continuous-stochastic-logic-against-quantum-continuous-time-markov-chains-2202.05412"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-continuous-stochastic-logic-against-quantum-continuous-time-markov-chains-2202.05412"/></url>
<url><loc>https://scifaro.com/en/abs/an-inductive-recursive-universe-generic-for-small-families-2202.05529</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inductive-recursive-universe-generic-for-small-families-2202.05529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inductive-recursive-universe-generic-for-small-families-2202.05529"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatizing-consciousness-with-applications-2202.05700</loc><lastmod>2022-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatizing-consciousness-with-applications-2202.05700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatizing-consciousness-with-applications-2202.05700"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-a-stochastic-approximation-theorem-2202.05959</loc><lastmod>2022-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-a-stochastic-approximation-theorem-2202.05959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-a-stochastic-approximation-theorem-2202.05959"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplified-variant-of-g-odel-s-ontological-argument-2202.06264</loc><lastmod>2023-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplified-variant-of-g-odel-s-ontological-argument-2202.06264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplified-variant-of-g-odel-s-ontological-argument-2202.06264"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relationship-between-shy-and-warded-datalog-2202.06285</loc><lastmod>2022-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relationship-between-shy-and-warded-datalog-2202.06285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relationship-between-shy-and-warded-datalog-2202.06285"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-semantics-for-nominal-automata-2202.06546</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-semantics-for-nominal-automata-2202.06546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-semantics-for-nominal-automata-2202.06546"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-algebraic-approach-for-the-quantitative-modeling-of-connectors-in-architectures-2202.06594</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-algebraic-approach-for-the-quantitative-modeling-of-connectors-in-architectures-2202.06594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-algebraic-approach-for-the-quantitative-modeling-of-connectors-in-architectures-2202.06594"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-strongest-post-2202.06765</loc><lastmod>2022-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-strongest-post-2202.06765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-strongest-post-2202.06765"/></url>
<url><loc>https://scifaro.com/en/abs/processes-parametrised-by-an-algebraic-theory-2202.06901</loc><lastmod>2022-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/processes-parametrised-by-an-algebraic-theory-2202.06901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/processes-parametrised-by-an-algebraic-theory-2202.06901"/></url>
<url><loc>https://scifaro.com/en/abs/interpolants-and-explicit-definitions-in-extensions-of-the-description-logic-el-2202.07186</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolants-and-explicit-definitions-in-extensions-of-the-description-logic-el-2202.07186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolants-and-explicit-definitions-in-extensions-of-the-description-logic-el-2202.07186"/></url>
<url><loc>https://scifaro.com/en/abs/the-directed-plump-ordering-2202.07329</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-directed-plump-ordering-2202.07329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-directed-plump-ordering-2202.07329"/></url>
<url><loc>https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-rational-parameters-2202.07416</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-rational-parameters-2202.07416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-rational-parameters-2202.07416"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-cartesian-product-of-well-orderings-2202.07487</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-cartesian-product-of-well-orderings-2202.07487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-cartesian-product-of-well-orderings-2202.07487"/></url>
<url><loc>https://scifaro.com/en/abs/the-addition-of-temporal-neighborhood-makes-the-logic-of-prefixes-and-sub-intervals-expspace-complete-2202.07881</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-addition-of-temporal-neighborhood-makes-the-logic-of-prefixes-and-sub-intervals-expspace-complete-2202.07881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-addition-of-temporal-neighborhood-makes-the-logic-of-prefixes-and-sub-intervals-expspace-complete-2202.07881"/></url>
<url><loc>https://scifaro.com/en/abs/querying-inconsistent-prioritized-data-with-orbits-algorithms-implementation-and-experiments-2202.07980</loc><lastmod>2026-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-inconsistent-prioritized-data-with-orbits-algorithms-implementation-and-experiments-2202.07980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-inconsistent-prioritized-data-with-orbits-algorithms-implementation-and-experiments-2202.07980"/></url>
<url><loc>https://scifaro.com/en/abs/natural-language-proof-checking-in-introduction-to-proof-classes-first-experiences-with-diproche-2202.08131</loc><lastmod>2022-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-language-proof-checking-in-introduction-to-proof-classes-first-experiences-with-diproche-2202.08131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-language-proof-checking-in-introduction-to-proof-classes-first-experiences-with-diproche-2202.08131"/></url>
<url><loc>https://scifaro.com/en/abs/query-answering-with-transitive-and-linear-ordered-data-2202.08555</loc><lastmod>2022-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-answering-with-transitive-and-linear-ordered-data-2202.08555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-answering-with-transitive-and-linear-ordered-data-2202.08555"/></url>
<url><loc>https://scifaro.com/en/abs/bilimits-in-categories-of-partial-maps-2202.08657</loc><lastmod>2022-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bilimits-in-categories-of-partial-maps-2202.08657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bilimits-in-categories-of-partial-maps-2202.08657"/></url>
<url><loc>https://scifaro.com/en/abs/a-completeness-result-for-inequational-reasoning-in-a-full-higher-order-setting-2202.08725</loc><lastmod>2022-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-completeness-result-for-inequational-reasoning-in-a-full-higher-order-setting-2202.08725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-completeness-result-for-inequational-reasoning-in-a-full-higher-order-setting-2202.08725"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-combination-of-model-checking-and-runtime-verification-on-multi-agent-systems-2202.09344</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-combination-of-model-checking-and-runtime-verification-on-multi-agent-systems-2202.09344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-combination-of-model-checking-and-runtime-verification-on-multi-agent-systems-2202.09344"/></url>
<url><loc>https://scifaro.com/en/abs/valasp-a-tool-for-data-validation-in-answer-set-programming-2202.09626</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/valasp-a-tool-for-data-validation-in-answer-set-programming-2202.09626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/valasp-a-tool-for-data-validation-in-answer-set-programming-2202.09626"/></url>
<url><loc>https://scifaro.com/en/abs/decision-problems-in-a-logic-for-reasoning-about-reconfigurable-distributed-systems-2202.09637</loc><lastmod>2022-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-problems-in-a-logic-for-reasoning-about-reconfigurable-distributed-systems-2202.09637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-problems-in-a-logic-for-reasoning-about-reconfigurable-distributed-systems-2202.09637"/></url>
<url><loc>https://scifaro.com/en/abs/a-rule-based-operational-semantics-of-graph-query-languages-2202.10142</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rule-based-operational-semantics-of-graph-query-languages-2202.10142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rule-based-operational-semantics-of-graph-query-languages-2202.10142"/></url>
<url><loc>https://scifaro.com/en/abs/defining-long-words-succinctly-in-fo-and-mso-2202.10180</loc><lastmod>2022-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defining-long-words-succinctly-in-fo-and-mso-2202.10180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defining-long-words-succinctly-in-fo-and-mso-2202.10180"/></url>
<url><loc>https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-propositional-logic-2202.10639</loc><lastmod>2022-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-propositional-logic-2202.10639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-heuristic-proof-procedure-for-propositional-logic-2202.10639"/></url>
<url><loc>https://scifaro.com/en/abs/stateful-structural-operational-semantics-2202.10866</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateful-structural-operational-semantics-2202.10866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateful-structural-operational-semantics-2202.10866"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-hyperproperties-with-circuits-2202.11570</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-hyperproperties-with-circuits-2202.11570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-hyperproperties-with-circuits-2202.11570"/></url>
<url><loc>https://scifaro.com/en/abs/actions-over-core-closed-knowledge-bases-2202.12592</loc><lastmod>2022-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/actions-over-core-closed-knowledge-bases-2202.12592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/actions-over-core-closed-knowledge-bases-2202.12592"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-evaluating-nfer-2202.13677</loc><lastmod>2022-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-evaluating-nfer-2202.13677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-evaluating-nfer-2202.13677"/></url>
<url><loc>https://scifaro.com/en/abs/reasonable-space-for-the-lambda-calculus-logarithmically-2203.00362</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasonable-space-for-the-lambda-calculus-logarithmically-2203.00362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasonable-space-for-the-lambda-calculus-logarithmically-2203.00362"/></url>
<url><loc>https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-a-unifying-theory-for-quasitoposes-2203.01032</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-a-unifying-theory-for-quasitoposes-2203.01032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-rewriting-and-relabeling-with-pbpo-a-unifying-theory-for-quasitoposes-2203.01032"/></url>
<url><loc>https://scifaro.com/en/abs/characteristics-of-de-bruijn-s-early-proof-checker-automath-2203.01173</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characteristics-of-de-bruijn-s-early-proof-checker-automath-2203.01173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characteristics-of-de-bruijn-s-early-proof-checker-automath-2203.01173"/></url>
<url><loc>https://scifaro.com/en/abs/theoretical-foundation-of-colored-petri-net-through-an-analysis-of-their-markings-as-multi-classification-2203.01194</loc><lastmod>2022-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theoretical-foundation-of-colored-petri-net-through-an-analysis-of-their-markings-as-multi-classification-2203.01194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theoretical-foundation-of-colored-petri-net-through-an-analysis-of-their-markings-as-multi-classification-2203.01194"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-definitions-with-differential-equations-for-keymaera-x-system-description-2203.01272</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-definitions-with-differential-equations-for-keymaera-x-system-description-2203.01272"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-definitions-with-differential-equations-for-keymaera-x-system-description-2203.01272"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-cut-restriction-first-steps-2203.01600</loc><lastmod>2022-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-cut-restriction-first-steps-2203.01600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-cut-restriction-first-steps-2203.01600"/></url>
<url><loc>https://scifaro.com/en/abs/pushdown-automata-and-context-free-grammars-in-bisimulation-semantics-2203.01713</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pushdown-automata-and-context-free-grammars-in-bisimulation-semantics-2203.01713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pushdown-automata-and-context-free-grammars-in-bisimulation-semantics-2203.01713"/></url>
<url><loc>https://scifaro.com/en/abs/the-orthologic-of-epistemic-modals-2203.02872</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-orthologic-of-epistemic-modals-2203.02872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-orthologic-of-epistemic-modals-2203.02872"/></url>
<url><loc>https://scifaro.com/en/abs/zero-one-laws-and-almost-sure-valuations-of-first-order-logic-in-semiring-semantics-2203.03425</loc><lastmod>2022-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zero-one-laws-and-almost-sure-valuations-of-first-order-logic-in-semiring-semantics-2203.03425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zero-one-laws-and-almost-sure-valuations-of-first-order-logic-in-semiring-semantics-2203.03425"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-enforcement-of-hyperproperties-2203.04146</loc><lastmod>2022-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-enforcement-of-hyperproperties-2203.04146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-enforcement-of-hyperproperties-2203.04146"/></url>
<url><loc>https://scifaro.com/en/abs/computing-unsatisfiable-cores-for-ltlf-specifications-2203.04834</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-unsatisfiable-cores-for-ltlf-specifications-2203.04834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-unsatisfiable-cores-for-ltlf-specifications-2203.04834"/></url>
<url><loc>https://scifaro.com/en/abs/a-study-for-recovering-the-cut-elimination-property-in-cyclic-proof-systems-by-restricting-the-arity-of-inductive-predicates-2203.05791</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-study-for-recovering-the-cut-elimination-property-in-cyclic-proof-systems-by-restricting-the-arity-of-inductive-predicates-2203.05791"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-study-for-recovering-the-cut-elimination-property-in-cyclic-proof-systems-by-restricting-the-arity-of-inductive-predicates-2203.05791"/></url>
<url><loc>https://scifaro.com/en/abs/the-regular-languages-of-first-order-logic-with-one-alternation-2203.06075</loc><lastmod>2022-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-regular-languages-of-first-order-logic-with-one-alternation-2203.06075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-regular-languages-of-first-order-logic-with-one-alternation-2203.06075"/></url>
<url><loc>https://scifaro.com/en/abs/logics-for-epistemic-actions-completeness-decidability-expressivity-2203.06744</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-for-epistemic-actions-completeness-decidability-expressivity-2203.06744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-for-epistemic-actions-completeness-decidability-expressivity-2203.06744"/></url>
<url><loc>https://scifaro.com/en/abs/smc4pep-stochastic-model-checking-of-product-engineering-processes-2203.06974</loc><lastmod>2022-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smc4pep-stochastic-model-checking-of-product-engineering-processes-2203.06974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smc4pep-stochastic-model-checking-of-product-engineering-processes-2203.06974"/></url>
<url><loc>https://scifaro.com/en/abs/lowerbounds-for-bisimulation-by-partition-refinement-2203.07158</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lowerbounds-for-bisimulation-by-partition-refinement-2203.07158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lowerbounds-for-bisimulation-by-partition-refinement-2203.07158"/></url>
<url><loc>https://scifaro.com/en/abs/hyperatl-a-logic-for-hyperproperties-in-multi-agent-systems-2203.07283</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperatl-a-logic-for-hyperproperties-in-multi-agent-systems-2203.07283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperatl-a-logic-for-hyperproperties-in-multi-agent-systems-2203.07283"/></url>
<url><loc>https://scifaro.com/en/abs/a-nivat-theorem-for-weighted-alternating-automata-over-commutative-semirings-2203.07370</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-nivat-theorem-for-weighted-alternating-automata-over-commutative-semirings-2203.07370"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-nivat-theorem-for-weighted-alternating-automata-over-commutative-semirings-2203.07370"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-verification-of-data-aware-dynamic-systems-with-arithmetic-2203.07982</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-verification-of-data-aware-dynamic-systems-with-arithmetic-2203.07982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-verification-of-data-aware-dynamic-systems-with-arithmetic-2203.07982"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-decentralised-exchanges-in-coq-2203.08016</loc><lastmod>2022-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-decentralised-exchanges-in-coq-2203.08016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-decentralised-exchanges-in-coq-2203.08016"/></url>
<url><loc>https://scifaro.com/en/abs/on-higher-order-reachability-games-vs-may-reachability-2203.08416</loc><lastmod>2024-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-higher-order-reachability-games-vs-may-reachability-2203.08416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-higher-order-reachability-games-vs-may-reachability-2203.08416"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-interpretation-on-e-graphs-2203.09191</loc><lastmod>2022-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-interpretation-on-e-graphs-2203.09191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-interpretation-on-e-graphs-2203.09191"/></url>
<url><loc>https://scifaro.com/en/abs/neighbourhood-semantics-and-axioms-for-strategic-fragment-of-classical-stit-logic-2203.09225</loc><lastmod>2022-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neighbourhood-semantics-and-axioms-for-strategic-fragment-of-classical-stit-logic-2203.09225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neighbourhood-semantics-and-axioms-for-strategic-fragment-of-classical-stit-logic-2203.09225"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-workshop-on-models-for-formal-analysis-of-real-systems-2203.09299</loc><lastmod>2022-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-models-for-formal-analysis-of-real-systems-2203.09299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-workshop-on-models-for-formal-analysis-of-real-systems-2203.09299"/></url>
<url><loc>https://scifaro.com/en/abs/non-commutative-propositional-logic-with-short-circuited-biconditional-and-nand-2203.09321</loc><lastmod>2022-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-commutative-propositional-logic-with-short-circuited-biconditional-and-nand-2203.09321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-commutative-propositional-logic-with-short-circuited-biconditional-and-nand-2203.09321"/></url>
<url><loc>https://scifaro.com/en/abs/learning-of-structurally-unambiguous-probabilistic-grammars-2203.09441</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-of-structurally-unambiguous-probabilistic-grammars-2203.09441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-of-structurally-unambiguous-probabilistic-grammars-2203.09441"/></url>
<url><loc>https://scifaro.com/en/abs/a-coinductive-reformulation-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2203.09501</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coinductive-reformulation-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2203.09501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coinductive-reformulation-of-milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-2203.09501"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-dunn-belnap-logic-2203.09652</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-dunn-belnap-logic-2203.09652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-dunn-belnap-logic-2203.09652"/></url>
<url><loc>https://scifaro.com/en/abs/reliably-reproducing-machine-checked-proofs-with-the-coq-platform-2203.09835</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reliably-reproducing-machine-checked-proofs-with-the-coq-platform-2203.09835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reliably-reproducing-machine-checked-proofs-with-the-coq-platform-2203.09835"/></url>
<url><loc>https://scifaro.com/en/abs/an-overview-of-modest-models-and-tools-for-real-stochastic-timed-systems-2203.09881</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-overview-of-modest-models-and-tools-for-real-stochastic-timed-systems-2203.09881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-overview-of-modest-models-and-tools-for-real-stochastic-timed-systems-2203.09881"/></url>
<url><loc>https://scifaro.com/en/abs/formally-modeling-autonomous-vehicles-in-lnt-for-simulation-and-testing-2203.09885</loc><lastmod>2022-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-modeling-autonomous-vehicles-in-lnt-for-simulation-and-testing-2203.09885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-modeling-autonomous-vehicles-in-lnt-for-simulation-and-testing-2203.09885"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-synthesis-of-finite-state-controllers-for-pomdps-2203.10803</loc><lastmod>2022-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-synthesis-of-finite-state-controllers-for-pomdps-2203.10803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-synthesis-of-finite-state-controllers-for-pomdps-2203.10803"/></url>
<url><loc>https://scifaro.com/en/abs/quasilinear-time-computation-of-generic-modal-witnesses-for-behavioural-inequivalence-2203.11175</loc><lastmod>2023-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasilinear-time-computation-of-generic-modal-witnesses-for-behavioural-inequivalence-2203.11175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasilinear-time-computation-of-generic-modal-witnesses-for-behavioural-inequivalence-2203.11175"/></url>
<url><loc>https://scifaro.com/en/abs/curry-and-howard-meet-borel-2203.11265</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/curry-and-howard-meet-borel-2203.11265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/curry-and-howard-meet-borel-2203.11265"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-the-expressiveness-of-the-pi-calculus-and-ccs-2203.11519</loc><lastmod>2022-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-the-expressiveness-of-the-pi-calculus-and-ccs-2203.11519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-the-expressiveness-of-the-pi-calculus-and-ccs-2203.11519"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-sessions-with-input-races-2203.12876</loc><lastmod>2022-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-sessions-with-input-races-2203.12876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-sessions-with-input-races-2203.12876"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-context-free-session-types-in-system-f-2203.12877</loc><lastmod>2022-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-context-free-session-types-in-system-f-2203.12877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-context-free-session-types-in-system-f-2203.12877"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-cubical-and-multimodal-type-theory-2203.13000</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-cubical-and-multimodal-type-theory-2203.13000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-cubical-and-multimodal-type-theory-2203.13000"/></url>
<url><loc>https://scifaro.com/en/abs/omega-forest-algebras-and-temporal-logics-2203.13858</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omega-forest-algebras-and-temporal-logics-2203.13858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omega-forest-algebras-and-temporal-logics-2203.13858"/></url>
<url><loc>https://scifaro.com/en/abs/the-lattice-theoretic-essence-of-property-directed-reachability-analysis-2203.14261</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lattice-theoretic-essence-of-property-directed-reachability-analysis-2203.14261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lattice-theoretic-essence-of-property-directed-reachability-analysis-2203.14261"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-of-data-aware-processes-with-arithmetic-conditions-2203.14809</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-of-data-aware-processes-with-arithmetic-conditions-2203.14809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-of-data-aware-processes-with-arithmetic-conditions-2203.14809"/></url>
<url><loc>https://scifaro.com/en/abs/how-functorial-are-deep-gadts-2203.14891</loc><lastmod>2022-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-functorial-are-deep-gadts-2203.14891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-functorial-are-deep-gadts-2203.14891"/></url>
<url><loc>https://scifaro.com/en/abs/graded-monads-and-behavioural-equivalence-games-2203.15467</loc><lastmod>2024-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-monads-and-behavioural-equivalence-games-2203.15467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-monads-and-behavioural-equivalence-games-2203.15467"/></url>
<url><loc>https://scifaro.com/en/abs/primality-tests-and-prime-certificate-2203.16341</loc><lastmod>2022-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/primality-tests-and-prime-certificate-2203.16341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/primality-tests-and-prime-certificate-2203.16341"/></url>
<url><loc>https://scifaro.com/en/abs/algebraicsystems-compositional-verification-for-autonomous-system-design-2203.16343</loc><lastmod>2022-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraicsystems-compositional-verification-for-autonomous-system-design-2203.16343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraicsystems-compositional-verification-for-autonomous-system-design-2203.16343"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-the-ring-of-ad-eles-of-a-global-field-2203.16344</loc><lastmod>2022-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-the-ring-of-ad-eles-of-a-global-field-2203.16344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-the-ring-of-ad-eles-of-a-global-field-2203.16344"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalization-of-falsity-in-finitely-many-valued-logics-2203.16890</loc><lastmod>2022-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalization-of-falsity-in-finitely-many-valued-logics-2203.16890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalization-of-falsity-in-finitely-many-valued-logics-2203.16890"/></url>
<url><loc>https://scifaro.com/en/abs/4dl-a-four-valued-dynamic-logic-and-its-proof-theory-2203.17179</loc><lastmod>2023-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/4dl-a-four-valued-dynamic-logic-and-its-proof-theory-2203.17179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/4dl-a-four-valued-dynamic-logic-and-its-proof-theory-2203.17179"/></url>
<url><loc>https://scifaro.com/en/abs/current-challenges-in-infinite-domain-constraint-satisfaction-dilemmas-of-the-infinite-sheep-2203.17182</loc><lastmod>2022-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/current-challenges-in-infinite-domain-constraint-satisfaction-dilemmas-of-the-infinite-sheep-2203.17182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/current-challenges-in-infinite-domain-constraint-satisfaction-dilemmas-of-the-infinite-sheep-2203.17182"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-logic-for-low-level-programs-2204.00076</loc><lastmod>2022-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-logic-for-low-level-programs-2204.00076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-logic-for-low-level-programs-2204.00076"/></url>
<url><loc>https://scifaro.com/en/abs/the-higher-dimensional-propositional-calculus-2204.00435</loc><lastmod>2024-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-higher-dimensional-propositional-calculus-2204.00435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-higher-dimensional-propositional-calculus-2204.00435"/></url>
<url><loc>https://scifaro.com/en/abs/modular-sat-based-techniques-for-reasoning-tasks-in-team-semantics-2204.00576</loc><lastmod>2022-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-sat-based-techniques-for-reasoning-tasks-in-team-semantics-2204.00576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-sat-based-techniques-for-reasoning-tasks-in-team-semantics-2204.00576"/></url>
<url><loc>https://scifaro.com/en/abs/separability-and-harmony-in-ecumenical-systems-2204.02076</loc><lastmod>2022-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separability-and-harmony-in-ecumenical-systems-2204.02076"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separability-and-harmony-in-ecumenical-systems-2204.02076"/></url>
<url><loc>https://scifaro.com/en/abs/when-locality-meets-preservation-2204.02108</loc><lastmod>2022-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-locality-meets-preservation-2204.02108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-locality-meets-preservation-2204.02108"/></url>
<url><loc>https://scifaro.com/en/abs/on-an-ecumenical-natural-deduction-with-stoup-part-i-the-propositional-case-2204.02199</loc><lastmod>2022-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-an-ecumenical-natural-deduction-with-stoup-part-i-the-propositional-case-2204.02199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-an-ecumenical-natural-deduction-with-stoup-part-i-the-propositional-case-2204.02199"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-pre-processing-for-automated-reasoning-in-dependent-type-theory-2204.02643</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-pre-processing-for-automated-reasoning-in-dependent-type-theory-2204.02643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-pre-processing-for-automated-reasoning-in-dependent-type-theory-2204.02643"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-16th-logical-and-semantic-frameworks-with-applications-2204.03415</loc><lastmod>2022-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-16th-logical-and-semantic-frameworks-with-applications-2204.03415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-16th-logical-and-semantic-frameworks-with-applications-2204.03415"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-treatment-of-structural-definitions-on-syntax-for-capture-avoiding-substitution-context-application-named-substitution-partial-differentiation-and-so-on-2204.03870</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-treatment-of-structural-definitions-on-syntax-for-capture-avoiding-substitution-context-application-named-substitution-partial-differentiation-and-so-on-2204.03870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-treatment-of-structural-definitions-on-syntax-for-capture-avoiding-substitution-context-application-named-substitution-partial-differentiation-and-so-on-2204.03870"/></url>
<url><loc>https://scifaro.com/en/abs/about-opposition-and-duality-in-paraconsistent-type-theory-2204.03882</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-opposition-and-duality-in-paraconsistent-type-theory-2204.03882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-opposition-and-duality-in-paraconsistent-type-theory-2204.03882"/></url>
<url><loc>https://scifaro.com/en/abs/secav-a-sequent-calculus-verifier-in-isabelle-hol-2204.03884</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/secav-a-sequent-calculus-verifier-in-isabelle-hol-2204.03884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/secav-a-sequent-calculus-verifier-in-isabelle-hol-2204.03884"/></url>
<url><loc>https://scifaro.com/en/abs/a-quick-overview-on-the-quantum-control-approach-to-the-lambda-calculus-2204.03885</loc><lastmod>2022-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quick-overview-on-the-quantum-control-approach-to-the-lambda-calculus-2204.03885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quick-overview-on-the-quantum-control-approach-to-the-lambda-calculus-2204.03885"/></url>
<url><loc>https://scifaro.com/en/abs/on-presburger-arithmetic-extended-with-non-unary-counting-quantifiers-2204.03903</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-presburger-arithmetic-extended-with-non-unary-counting-quantifiers-2204.03903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-presburger-arithmetic-extended-with-non-unary-counting-quantifiers-2204.03903"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-for-symmetric-monoidal-categories-with-commutative-co-monoid-structure-2204.04274</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-for-symmetric-monoidal-categories-with-commutative-co-monoid-structure-2204.04274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-for-symmetric-monoidal-categories-with-commutative-co-monoid-structure-2204.04274"/></url>
<url><loc>https://scifaro.com/en/abs/polyarbernn-a-neural-network-guided-solver-and-optimizer-for-bounded-polynomial-inequalities-2204.05365</loc><lastmod>2022-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyarbernn-a-neural-network-guided-solver-and-optimizer-for-bounded-polynomial-inequalities-2204.05365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyarbernn-a-neural-network-guided-solver-and-optimizer-for-bounded-polynomial-inequalities-2204.05365"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-occur-check-extended-report-2204.05379</loc><lastmod>2025-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-occur-check-extended-report-2204.05379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-occur-check-extended-report-2204.05379"/></url>
<url><loc>https://scifaro.com/en/abs/free-monads-intrinsic-scoping-and-higher-order-preunification-2204.05653</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-monads-intrinsic-scoping-and-higher-order-preunification-2204.05653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-monads-intrinsic-scoping-and-higher-order-preunification-2204.05653"/></url>
<url><loc>https://scifaro.com/en/abs/encodability-criteria-for-quantum-based-systems-2204.06068</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encodability-criteria-for-quantum-based-systems-2204.06068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encodability-criteria-for-quantum-based-systems-2204.06068"/></url>
<url><loc>https://scifaro.com/en/abs/acacia-bonsai-a-modern-implementation-of-downset-based-ltl-realizability-2204.06079</loc><lastmod>2022-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acacia-bonsai-a-modern-implementation-of-downset-based-ltl-realizability-2204.06079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acacia-bonsai-a-modern-implementation-of-downset-based-ltl-realizability-2204.06079"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-10th-international-conference-on-non-classical-logics-theory-and-applications-2204.06359</loc><lastmod>2022-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-10th-international-conference-on-non-classical-logics-theory-and-applications-2204.06359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-10th-international-conference-on-non-classical-logics-theory-and-applications-2204.06359"/></url>
<url><loc>https://scifaro.com/en/abs/four-algorithms-for-propositional-forgetting-2204.06528</loc><lastmod>2022-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-algorithms-for-propositional-forgetting-2204.06528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-algorithms-for-propositional-forgetting-2204.06528"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-by-evaluation-for-the-lambek-calculus-2204.06719</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-by-evaluation-for-the-lambek-calculus-2204.06719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-by-evaluation-for-the-lambek-calculus-2204.06719"/></url>
<url><loc>https://scifaro.com/en/abs/a-van-benthem-theorem-for-atomic-and-molecular-logics-2204.06720</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-atomic-and-molecular-logics-2204.06720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-van-benthem-theorem-for-atomic-and-molecular-logics-2204.06720"/></url>
<url><loc>https://scifaro.com/en/abs/non-normal-super-strict-implications-2204.06721</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-normal-super-strict-implications-2204.06721"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-normal-super-strict-implications-2204.06721"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-for-some-infectious-logics-and-their-relatives-2204.06722</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-for-some-infectious-logics-and-their-relatives-2204.06722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-for-some-infectious-logics-and-their-relatives-2204.06722"/></url>
<url><loc>https://scifaro.com/en/abs/combining-first-order-classical-and-intuitionistic-logic-2204.06723</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-first-order-classical-and-intuitionistic-logic-2204.06723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-first-order-classical-and-intuitionistic-logic-2204.06723"/></url>
<url><loc>https://scifaro.com/en/abs/natural-deduction-for-assertibility-and-deniability-2204.06724</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-deduction-for-assertibility-and-deniability-2204.06724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-deduction-for-assertibility-and-deniability-2204.06724"/></url>
<url><loc>https://scifaro.com/en/abs/monadicity-of-non-deterministic-logical-matrices-is-undecidable-2204.06725</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monadicity-of-non-deterministic-logical-matrices-is-undecidable-2204.06725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monadicity-of-non-deterministic-logical-matrices-is-undecidable-2204.06725"/></url>
<url><loc>https://scifaro.com/en/abs/puzzles-of-existential-generalisation-from-type-theoretic-perspective-2204.06726</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/puzzles-of-existential-generalisation-from-type-theoretic-perspective-2204.06726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/puzzles-of-existential-generalisation-from-type-theoretic-perspective-2204.06726"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-of-skew-non-commutative-mill-2204.06727</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-of-skew-non-commutative-mill-2204.06727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-of-skew-non-commutative-mill-2204.06727"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-intuitionistic-sentential-logic-with-identity-via-sequent-calculus-2204.06728</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-intuitionistic-sentential-logic-with-identity-via-sequent-calculus-2204.06728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-intuitionistic-sentential-logic-with-identity-via-sequent-calculus-2204.06728"/></url>
<url><loc>https://scifaro.com/en/abs/superconnexivity-reconsidered-2204.06729</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superconnexivity-reconsidered-2204.06729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superconnexivity-reconsidered-2204.06729"/></url>
<url><loc>https://scifaro.com/en/abs/another-combination-of-classical-and-intuitionistic-conditionals-2204.06730</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/another-combination-of-classical-and-intuitionistic-conditionals-2204.06730"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/another-combination-of-classical-and-intuitionistic-conditionals-2204.06730"/></url>
<url><loc>https://scifaro.com/en/abs/mortensen-logics-2204.06731</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mortensen-logics-2204.06731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mortensen-logics-2204.06731"/></url>
<url><loc>https://scifaro.com/en/abs/bilateral-inversion-principles-2204.06732</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bilateral-inversion-principles-2204.06732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bilateral-inversion-principles-2204.06732"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-negations-and-four-valuedness-2204.06733</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-negations-and-four-valuedness-2204.06733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-negations-and-four-valuedness-2204.06733"/></url>
<url><loc>https://scifaro.com/en/abs/the-forms-of-categorical-proposition-2204.06734</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-forms-of-categorical-proposition-2204.06734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-forms-of-categorical-proposition-2204.06734"/></url>
<url><loc>https://scifaro.com/en/abs/algebraizability-of-the-logic-of-quasi-n4-lattices-2204.06735</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraizability-of-the-logic-of-quasi-n4-lattices-2204.06735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraizability-of-the-logic-of-quasi-n4-lattices-2204.06735"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-paraconsistent-transition-systems-2204.06737</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-paraconsistent-transition-systems-2204.06737"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-paraconsistent-transition-systems-2204.06737"/></url>
<url><loc>https://scifaro.com/en/abs/routley-star-in-information-based-semantics-2204.06738</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/routley-star-in-information-based-semantics-2204.06738"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/routley-star-in-information-based-semantics-2204.06738"/></url>
<url><loc>https://scifaro.com/en/abs/dunn-semantics-for-contra-classical-logics-2204.06739</loc><lastmod>2022-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dunn-semantics-for-contra-classical-logics-2204.06739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dunn-semantics-for-contra-classical-logics-2204.06739"/></url>
<url><loc>https://scifaro.com/en/abs/probability-monads-with-submonads-of-deterministic-states-extended-version-2204.07003</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probability-monads-with-submonads-of-deterministic-states-extended-version-2204.07003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probability-monads-with-submonads-of-deterministic-states-extended-version-2204.07003"/></url>
<url><loc>https://scifaro.com/en/abs/methods-for-efficient-unfolding-of-colored-petri-nets-2204.07039</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/methods-for-efficient-unfolding-of-colored-petri-nets-2204.07039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/methods-for-efficient-unfolding-of-colored-petri-nets-2204.07039"/></url>
<url><loc>https://scifaro.com/en/abs/fundamentals-of-compositional-rewriting-theory-2204.07175</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fundamentals-of-compositional-rewriting-theory-2204.07175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fundamentals-of-compositional-rewriting-theory-2204.07175"/></url>
<url><loc>https://scifaro.com/en/abs/ftmpst-fault-tolerant-multiparty-session-types-2204.07728</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ftmpst-fault-tolerant-multiparty-session-types-2204.07728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ftmpst-fault-tolerant-multiparty-session-types-2204.07728"/></url>
<url><loc>https://scifaro.com/en/abs/dependence-logics-in-temporal-settings-2204.07839</loc><lastmod>2024-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependence-logics-in-temporal-settings-2204.07839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependence-logics-in-temporal-settings-2204.07839"/></url>
<url><loc>https://scifaro.com/en/abs/an-experiment-of-randomized-hints-on-an-axiom-of-infinite-valued-lukasiewicz-logic-2204.08512</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-experiment-of-randomized-hints-on-an-axiom-of-infinite-valued-lukasiewicz-logic-2204.08512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-experiment-of-randomized-hints-on-an-axiom-of-infinite-valued-lukasiewicz-logic-2204.08512"/></url>
<url><loc>https://scifaro.com/en/abs/strategies-for-asymptotic-normalization-2204.08772</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategies-for-asymptotic-normalization-2204.08772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategies-for-asymptotic-normalization-2204.08772"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-strategic-abilities-in-information-sharing-systems-2204.08896</loc><lastmod>2022-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-strategic-abilities-in-information-sharing-systems-2204.08896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-strategic-abilities-in-information-sharing-systems-2204.08896"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-asymptotic-expressivity-of-inference-frameworks-2204.09457</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-asymptotic-expressivity-of-inference-frameworks-2204.09457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-asymptotic-expressivity-of-inference-frameworks-2204.09457"/></url>
<url><loc>https://scifaro.com/en/abs/modular-control-plane-verification-via-temporal-invariants-2204.10303</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-control-plane-verification-via-temporal-invariants-2204.10303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-control-plane-verification-via-temporal-invariants-2204.10303"/></url>
<url><loc>https://scifaro.com/en/abs/mitl-verification-under-timing-uncertainty-2204.10493</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mitl-verification-under-timing-uncertainty-2204.10493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mitl-verification-under-timing-uncertainty-2204.10493"/></url>
<url><loc>https://scifaro.com/en/abs/linear-algebraic-models-of-linear-logic-as-categories-of-modules-over-sigma-semirings-2204.10589</loc><lastmod>2022-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-algebraic-models-of-linear-logic-as-categories-of-modules-over-sigma-semirings-2204.10589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-algebraic-models-of-linear-logic-as-categories-of-modules-over-sigma-semirings-2204.10589"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-locally-tight-programs-2204.10789</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-locally-tight-programs-2204.10789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-locally-tight-programs-2204.10789"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-by-construction-synthesis-adapting-to-the-environment-at-runtime-2204.10912</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-by-construction-synthesis-adapting-to-the-environment-at-runtime-2204.10912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-by-construction-synthesis-adapting-to-the-environment-at-runtime-2204.10912"/></url>
<url><loc>https://scifaro.com/en/abs/unboundedness-for-recursion-schemes-a-simpler-type-system-2204.11023</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unboundedness-for-recursion-schemes-a-simpler-type-system-2204.11023"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unboundedness-for-recursion-schemes-a-simpler-type-system-2204.11023"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-approach-to-quantitative-verification-2204.11302</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-approach-to-quantitative-verification-2204.11302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-approach-to-quantitative-verification-2204.11302"/></url>
<url><loc>https://scifaro.com/en/abs/model-repair-via-symmetry-2204.11376</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-repair-via-symmetry-2204.11376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-repair-via-symmetry-2204.11376"/></url>
<url><loc>https://scifaro.com/en/abs/general-interpolation-and-strong-amalgamation-for-contiguous-arrays-2204.11771</loc><lastmod>2022-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/general-interpolation-and-strong-amalgamation-for-contiguous-arrays-2204.11771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/general-interpolation-and-strong-amalgamation-for-contiguous-arrays-2204.11771"/></url>
<url><loc>https://scifaro.com/en/abs/computing-reachable-simulations-2204.11804</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-reachable-simulations-2204.11804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-reachable-simulations-2204.11804"/></url>
<url><loc>https://scifaro.com/en/abs/on-an-invariance-problem-for-parameterized-concurrent-systems-2204.12117</loc><lastmod>2022-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-an-invariance-problem-for-parameterized-concurrent-systems-2204.12117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-an-invariance-problem-for-parameterized-concurrent-systems-2204.12117"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-automatic-difficulty-estimation-of-logic-formalization-exercises-2204.12197</loc><lastmod>2022-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-automatic-difficulty-estimation-of-logic-formalization-exercises-2204.12197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-automatic-difficulty-estimation-of-logic-formalization-exercises-2204.12197"/></url>
<url><loc>https://scifaro.com/en/abs/the-pseudo-reachability-problem-for-diagonalisable-linear-dynamical-systems-2204.12253</loc><lastmod>2022-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-pseudo-reachability-problem-for-diagonalisable-linear-dynamical-systems-2204.12253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-pseudo-reachability-problem-for-diagonalisable-linear-dynamical-systems-2204.12253"/></url>
<url><loc>https://scifaro.com/en/abs/structural-rules-and-algebraic-properties-of-intersection-types-2204.12376</loc><lastmod>2022-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-rules-and-algebraic-properties-of-intersection-types-2204.12376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-rules-and-algebraic-properties-of-intersection-types-2204.12376"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-controller-synthesis-for-deadlock-avoidance-2204.12409</loc><lastmod>2025-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-controller-synthesis-for-deadlock-avoidance-2204.12409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-controller-synthesis-for-deadlock-avoidance-2204.12409"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-synchronizing-markov-decision-processes-2204.12814</loc><lastmod>2022-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-synchronizing-markov-decision-processes-2204.12814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-synchronizing-markov-decision-processes-2204.12814"/></url>
<url><loc>https://scifaro.com/en/abs/fairness-and-promptness-in-muller-formulas-2204.13215</loc><lastmod>2024-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fairness-and-promptness-in-muller-formulas-2204.13215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fairness-and-promptness-in-muller-formulas-2204.13215"/></url>
<url><loc>https://scifaro.com/en/abs/evtl-a-temporal-logic-for-the-transient-analysis-of-cyber-physical-systems-2204.13357</loc><lastmod>2022-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evtl-a-temporal-logic-for-the-transient-analysis-of-cyber-physical-systems-2204.13357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evtl-a-temporal-logic-for-the-transient-analysis-of-cyber-physical-systems-2204.13357"/></url>
<url><loc>https://scifaro.com/en/abs/skolem-meets-schanuel-2204.13417</loc><lastmod>2022-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolem-meets-schanuel-2204.13417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolem-meets-schanuel-2204.13417"/></url>
<url><loc>https://scifaro.com/en/abs/on-quantitative-algebraic-higher-order-theories-2204.13654</loc><lastmod>2022-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-quantitative-algebraic-higher-order-theories-2204.13654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-quantitative-algebraic-higher-order-theories-2204.13654"/></url>
<url><loc>https://scifaro.com/en/abs/linear-temporal-logic-modulo-theories-over-finite-traces-extended-version-2204.13693</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-temporal-logic-modulo-theories-over-finite-traces-extended-version-2204.13693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-temporal-logic-modulo-theories-over-finite-traces-extended-version-2204.13693"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-for-unifying-gaussian-probability-and-nondeterminism-2204.14024</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-for-unifying-gaussian-probability-and-nondeterminism-2204.14024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-for-unifying-gaussian-probability-and-nondeterminism-2204.14024"/></url>
<url><loc>https://scifaro.com/en/abs/strategy-synthesis-for-global-window-pctl-2204.14107</loc><lastmod>2022-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategy-synthesis-for-global-window-pctl-2204.14107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategy-synthesis-for-global-window-pctl-2204.14107"/></url>
<url><loc>https://scifaro.com/en/abs/findfacts-a-scalable-theorem-search-2204.14191</loc><lastmod>2022-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/findfacts-a-scalable-theorem-search-2204.14191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/findfacts-a-scalable-theorem-search-2204.14191"/></url>
<url><loc>https://scifaro.com/en/abs/finite-entailment-of-ucrpqs-over-alc-ontologies-2204.14261</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-entailment-of-ucrpqs-over-alc-ontologies-2204.14261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-entailment-of-ucrpqs-over-alc-ontologies-2204.14261"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-interpolation-in-coalgebraic-modal-logic-2205.00448</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-interpolation-in-coalgebraic-modal-logic-2205.00448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-interpolation-in-coalgebraic-modal-logic-2205.00448"/></url>
<url><loc>https://scifaro.com/en/abs/time-and-g-odel-fuzzy-temporal-reasoning-in-pspace-2205.00574</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/time-and-g-odel-fuzzy-temporal-reasoning-in-pspace-2205.00574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/time-and-g-odel-fuzzy-temporal-reasoning-in-pspace-2205.00574"/></url>
<url><loc>https://scifaro.com/en/abs/typed-non-determinism-in-functional-and-concurrent-calculi-2205.00680</loc><lastmod>2023-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-non-determinism-in-functional-and-concurrent-calculi-2205.00680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-non-determinism-in-functional-and-concurrent-calculi-2205.00680"/></url>
<url><loc>https://scifaro.com/en/abs/on-verifying-expectations-and-observations-of-intelligent-agents-2205.00784</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-verifying-expectations-and-observations-of-intelligent-agents-2205.00784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-verifying-expectations-and-observations-of-intelligent-agents-2205.00784"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-role-of-postconditions-in-dynamic-first-order-epistemic-logic-2205.00876</loc><lastmod>2022-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-role-of-postconditions-in-dynamic-first-order-epistemic-logic-2205.00876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-role-of-postconditions-in-dynamic-first-order-epistemic-logic-2205.00876"/></url>
<url><loc>https://scifaro.com/en/abs/bridging-causal-reversibility-and-time-reversibility-a-stochastic-process-algebraic-approach-2205.01420</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bridging-causal-reversibility-and-time-reversibility-a-stochastic-process-algebraic-approach-2205.01420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bridging-causal-reversibility-and-time-reversibility-a-stochastic-process-algebraic-approach-2205.01420"/></url>
<url><loc>https://scifaro.com/en/abs/does-a-program-yield-the-right-distribution-verifying-probabilistic-programs-via-generating-functions-2205.01449</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/does-a-program-yield-the-right-distribution-verifying-probabilistic-programs-via-generating-functions-2205.01449"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/does-a-program-yield-the-right-distribution-verifying-probabilistic-programs-via-generating-functions-2205.01449"/></url>
<url><loc>https://scifaro.com/en/abs/unique-characterisability-and-learnability-of-temporal-instance-queries-2205.01651</loc><lastmod>2022-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unique-characterisability-and-learnability-of-temporal-instance-queries-2205.01651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unique-characterisability-and-learnability-of-temporal-instance-queries-2205.01651"/></url>
<url><loc>https://scifaro.com/en/abs/combining-type-checking-and-set-constraint-solving-to-improve-automated-software-verification-2205.01713</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-type-checking-and-set-constraint-solving-to-improve-automated-software-verification-2205.01713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-type-checking-and-set-constraint-solving-to-improve-automated-software-verification-2205.01713"/></url>
<url><loc>https://scifaro.com/en/abs/birkhoff-von-neumann-quantum-logic-as-an-assertion-language-for-quantum-programs-2205.01959</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/birkhoff-von-neumann-quantum-logic-as-an-assertion-language-for-quantum-programs-2205.01959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/birkhoff-von-neumann-quantum-logic-as-an-assertion-language-for-quantum-programs-2205.01959"/></url>
<url><loc>https://scifaro.com/en/abs/the-sup-connective-in-imall-a-categorical-semantics-2205.02142</loc><lastmod>2026-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sup-connective-in-imall-a-categorical-semantics-2205.02142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sup-connective-in-imall-a-categorical-semantics-2205.02142"/></url>
<url><loc>https://scifaro.com/en/abs/low-level-bi-abduction-2205.02590</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-level-bi-abduction-2205.02590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-level-bi-abduction-2205.02590"/></url>
<url><loc>https://scifaro.com/en/abs/region-based-merging-of-open-domain-terminological-knowledge-2205.02660</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/region-based-merging-of-open-domain-terminological-knowledge-2205.02660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/region-based-merging-of-open-domain-terminological-knowledge-2205.02660"/></url>
<url><loc>https://scifaro.com/en/abs/automating-reasoning-with-standpoint-logic-via-nested-sequents-2205.02749</loc><lastmod>2022-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-reasoning-with-standpoint-logic-via-nested-sequents-2205.02749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-reasoning-with-standpoint-logic-via-nested-sequents-2205.02749"/></url>
<url><loc>https://scifaro.com/en/abs/adequate-and-computational-encodings-in-the-logical-framework-dedukti-2205.02883</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adequate-and-computational-encodings-in-the-logical-framework-dedukti-2205.02883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adequate-and-computational-encodings-in-the-logical-framework-dedukti-2205.02883"/></url>
<url><loc>https://scifaro.com/en/abs/wetzel-formalisation-of-an-undecidable-problem-linked-to-the-continuum-hypothesis-2205.03159</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wetzel-formalisation-of-an-undecidable-problem-linked-to-the-continuum-hypothesis-2205.03159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wetzel-formalisation-of-an-undecidable-problem-linked-to-the-continuum-hypothesis-2205.03159"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-based-tractable-approximation-of-probability-2205.03198</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-based-tractable-approximation-of-probability-2205.03198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-based-tractable-approximation-of-probability-2205.03198"/></url>
<url><loc>https://scifaro.com/en/abs/one-sorted-program-algebras-2205.03311</loc><lastmod>2022-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-sorted-program-algebras-2205.03311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-sorted-program-algebras-2205.03311"/></url>
<url><loc>https://scifaro.com/en/abs/weakening-and-iterating-laws-using-string-diagrams-2205.03640</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakening-and-iterating-laws-using-string-diagrams-2205.03640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakening-and-iterating-laws-using-string-diagrams-2205.03640"/></url>
<url><loc>https://scifaro.com/en/abs/mechanising-g-odel-l-ob-provability-logic-in-hol-light-2205.03659</loc><lastmod>2023-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanising-g-odel-l-ob-provability-logic-in-hol-light-2205.03659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanising-g-odel-l-ob-provability-logic-in-hol-light-2205.03659"/></url>
<url><loc>https://scifaro.com/en/abs/an-stl-based-formulation-of-resilience-in-cyber-physical-systems-2205.03961</loc><lastmod>2022-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-stl-based-formulation-of-resilience-in-cyber-physical-systems-2205.03961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-stl-based-formulation-of-resilience-in-cyber-physical-systems-2205.03961"/></url>
<url><loc>https://scifaro.com/en/abs/a-coherent-differential-pcf-2205.04109</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coherent-differential-pcf-2205.04109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coherent-differential-pcf-2205.04109"/></url>
<url><loc>https://scifaro.com/en/abs/unitless-frobenius-quantales-2205.04111</loc><lastmod>2022-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unitless-frobenius-quantales-2205.04111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unitless-frobenius-quantales-2205.04111"/></url>
<url><loc>https://scifaro.com/en/abs/omega-regular-energy-problems-2205.04392</loc><lastmod>2024-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omega-regular-energy-problems-2205.04392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omega-regular-energy-problems-2205.04392"/></url>
<url><loc>https://scifaro.com/en/abs/a-specification-logic-for-programs-in-the-probabilistic-guarded-command-language-extended-version-2205.04822</loc><lastmod>2022-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-specification-logic-for-programs-in-the-probabilistic-guarded-command-language-extended-version-2205.04822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-specification-logic-for-programs-in-the-probabilistic-guarded-command-language-extended-version-2205.04822"/></url>
<url><loc>https://scifaro.com/en/abs/envelopes-and-waves-safe-multivehicle-collision-avoidance-for-horizontal-non-deterministic-turns-2205.04833</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/envelopes-and-waves-safe-multivehicle-collision-avoidance-for-horizontal-non-deterministic-turns-2205.04833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/envelopes-and-waves-safe-multivehicle-collision-avoidance-for-horizontal-non-deterministic-turns-2205.04833"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-ordered-disjunction-a-logical-perspective-2205.04882</loc><lastmod>2022-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-ordered-disjunction-a-logical-perspective-2205.04882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-ordered-disjunction-a-logical-perspective-2205.04882"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-in-the-description-logic-alc-under-category-semantics-2205.04911</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-in-the-description-logic-alc-under-category-semantics-2205.04911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-in-the-description-logic-alc-under-category-semantics-2205.04911"/></url>
<url><loc>https://scifaro.com/en/abs/a-g-odel-calculus-for-linear-temporal-logic-2205.05182</loc><lastmod>2022-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-g-odel-calculus-for-linear-temporal-logic-2205.05182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-g-odel-calculus-for-linear-temporal-logic-2205.05182"/></url>
<url><loc>https://scifaro.com/en/abs/a-game-comonadic-account-of-courcelle-and-feferman-vaught-mostowski-theorems-2205.05387</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-game-comonadic-account-of-courcelle-and-feferman-vaught-mostowski-theorems-2205.05387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-game-comonadic-account-of-courcelle-and-feferman-vaught-mostowski-theorems-2205.05387"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-presentation-of-semifree-monads-2205.05392</loc><lastmod>2022-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-presentation-of-semifree-monads-2205.05392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-presentation-of-semifree-monads-2205.05392"/></url>
<url><loc>https://scifaro.com/en/abs/abductive-reasoning-in-intuitionistic-propositional-logic-via-theorem-synthesis-2205.05728</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abductive-reasoning-in-intuitionistic-propositional-logic-via-theorem-synthesis-2205.05728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abductive-reasoning-in-intuitionistic-propositional-logic-via-theorem-synthesis-2205.05728"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-synthesis-of-smart-contract-control-flows-2205.06039</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-synthesis-of-smart-contract-control-flows-2205.06039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-synthesis-of-smart-contract-control-flows-2205.06039"/></url>
<url><loc>https://scifaro.com/en/abs/ivoire-deliverable-1-1-classification-of-existing-vos-tools-and-formalization-of-vos-semantics-2205.06138</loc><lastmod>2022-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ivoire-deliverable-1-1-classification-of-existing-vos-tools-and-formalization-of-vos-semantics-2205.06138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ivoire-deliverable-1-1-classification-of-existing-vos-tools-and-formalization-of-vos-semantics-2205.06138"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-program-verification-via-inductive-synthesis-of-inductive-invariants-2205.06152</loc><lastmod>2023-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-program-verification-via-inductive-synthesis-of-inductive-invariants-2205.06152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-program-verification-via-inductive-synthesis-of-inductive-invariants-2205.06152"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-catamorphism-based-contracts-using-constrained-horn-clauses-2205.06236</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-catamorphism-based-contracts-using-constrained-horn-clauses-2205.06236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-catamorphism-based-contracts-using-constrained-horn-clauses-2205.06236"/></url>
<url><loc>https://scifaro.com/en/abs/plain-and-simple-inductive-invariant-inference-for-distributed-protocols-in-tla-2205.06360</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/plain-and-simple-inductive-invariant-inference-for-distributed-protocols-in-tla-2205.06360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/plain-and-simple-inductive-invariant-inference-for-distributed-protocols-in-tla-2205.06360"/></url>
<url><loc>https://scifaro.com/en/abs/pvs-embeddings-of-propositional-and-quantified-modal-logic-2205.06391</loc><lastmod>2022-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pvs-embeddings-of-propositional-and-quantified-modal-logic-2205.06391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pvs-embeddings-of-propositional-and-quantified-modal-logic-2205.06391"/></url>
<url><loc>https://scifaro.com/en/abs/a-hoare-logic-with-regular-behavioral-specifications-2205.06584</loc><lastmod>2022-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hoare-logic-with-regular-behavioral-specifications-2205.06584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hoare-logic-with-regular-behavioral-specifications-2205.06584"/></url>
<url><loc>https://scifaro.com/en/abs/lash-1-0-system-description-2205.06640</loc><lastmod>2022-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lash-1-0-system-description-2205.06640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lash-1-0-system-description-2205.06640"/></url>
<url><loc>https://scifaro.com/en/abs/fully-abstract-encodings-of-lambda-calculus-in-hocore-through-abstract-machines-2205.06665</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-abstract-encodings-of-lambda-calculus-in-hocore-through-abstract-machines-2205.06665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-abstract-encodings-of-lambda-calculus-in-hocore-through-abstract-machines-2205.06665"/></url>
<url><loc>https://scifaro.com/en/abs/from-gs-monoidal-to-oplax-cartesian-categories-constructions-and-functorial-completeness-2205.06892</loc><lastmod>2023-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-gs-monoidal-to-oplax-cartesian-categories-constructions-and-functorial-completeness-2205.06892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-gs-monoidal-to-oplax-cartesian-categories-constructions-and-functorial-completeness-2205.06892"/></url>
<url><loc>https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-counting-2205.07783</loc><lastmod>2022-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-counting-2205.07783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-equivalence-of-logic-programs-with-counting-2205.07783"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-vectors-using-an-smt-theory-of-sequences-2205.08095</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-vectors-using-an-smt-theory-of-sequences-2205.08095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-vectors-using-an-smt-theory-of-sequences-2205.08095"/></url>
<url><loc>https://scifaro.com/en/abs/local-completeness-logic-on-kleene-algebra-with-tests-2205.08128</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-completeness-logic-on-kleene-algebra-with-tests-2205.08128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-completeness-logic-on-kleene-algebra-with-tests-2205.08128"/></url>
<url><loc>https://scifaro.com/en/abs/chemical-case-studies-in-keymaera-x-2205.08270</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chemical-case-studies-in-keymaera-x-2205.08270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chemical-case-studies-in-keymaera-x-2205.08270"/></url>
<url><loc>https://scifaro.com/en/abs/scl-eq-scl-for-first-order-logic-with-equality-2205.08297</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scl-eq-scl-for-first-order-logic-with-equality-2205.08297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scl-eq-scl-for-first-order-logic-with-equality-2205.08297"/></url>
<url><loc>https://scifaro.com/en/abs/sampling-based-verification-of-ctmcs-with-uncertain-rates-2205.08300</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sampling-based-verification-of-ctmcs-with-uncertain-rates-2205.08300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sampling-based-verification-of-ctmcs-with-uncertain-rates-2205.08300"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-analysis-in-the-agda-proof-assistant-2205.08354</loc><lastmod>2022-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-analysis-in-the-agda-proof-assistant-2205.08354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-analysis-in-the-agda-proof-assistant-2205.08354"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-modeling-with-stock-and-flow-diagrams-2205.08373</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-modeling-with-stock-and-flow-diagrams-2205.08373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-modeling-with-stock-and-flow-diagrams-2205.08373"/></url>
<url><loc>https://scifaro.com/en/abs/building-information-modeling-using-constraint-logic-programming-2205.08572</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/building-information-modeling-using-constraint-logic-programming-2205.08572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/building-information-modeling-using-constraint-logic-programming-2205.08572"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-proofs-hypersequents-and-transitive-closure-logic-2205.08616</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-proofs-hypersequents-and-transitive-closure-logic-2205.08616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-proofs-hypersequents-and-transitive-closure-logic-2205.08616"/></url>
<url><loc>https://scifaro.com/en/abs/mechanized-analysis-of-anselm-s-modal-ontological-argument-2205.08628</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanized-analysis-of-anselm-s-modal-ontological-argument-2205.08628"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanized-analysis-of-anselm-s-modal-ontological-argument-2205.08628"/></url>
<url><loc>https://scifaro.com/en/abs/dpo-dynamic-programming-optimization-on-hybrid-constraints-2205.08632</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dpo-dynamic-programming-optimization-on-hybrid-constraints-2205.08632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dpo-dynamic-programming-optimization-on-hybrid-constraints-2205.08632"/></url>
<url><loc>https://scifaro.com/en/abs/an-approach-to-translating-haskell-programs-to-agda-and-reasoning-about-them-2205.08718</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approach-to-translating-haskell-programs-to-agda-and-reasoning-about-them-2205.08718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approach-to-translating-haskell-programs-to-agda-and-reasoning-about-them-2205.08718"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-2205.08869</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-2205.08869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-2205.08869"/></url>
<url><loc>https://scifaro.com/en/abs/finite-two-dimensional-proof-systems-for-non-finitely-axiomatizable-logics-2205.08920</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-two-dimensional-proof-systems-for-non-finitely-axiomatizable-logics-2205.08920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-two-dimensional-proof-systems-for-non-finitely-axiomatizable-logics-2205.08920"/></url>
<url><loc>https://scifaro.com/en/abs/zigzag-normalisation-for-associative-n-categories-2205.08952</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zigzag-normalisation-for-associative-n-categories-2205.08952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zigzag-normalisation-for-associative-n-categories-2205.08952"/></url>
<url><loc>https://scifaro.com/en/abs/ctl-model-checking-for-data-aware-dynamic-systems-with-arithmetic-2205.08976</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ctl-model-checking-for-data-aware-dynamic-systems-with-arithmetic-2205.08976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ctl-model-checking-for-data-aware-dynamic-systems-with-arithmetic-2205.08976"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-advanced-vos-semantics-and-vo-refinement-2205.08988</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-advanced-vos-semantics-and-vo-refinement-2205.08988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-advanced-vos-semantics-and-vo-refinement-2205.08988"/></url>
<url><loc>https://scifaro.com/en/abs/ramsey-quantifiers-over-automatic-structures-complexity-and-applications-to-verification-2205.09015</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ramsey-quantifiers-over-automatic-structures-complexity-and-applications-to-verification-2205.09015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ramsey-quantifiers-over-automatic-structures-complexity-and-applications-to-verification-2205.09015"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-checking-of-contracts-with-kind-2-2205.09082</loc><lastmod>2022-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-checking-of-contracts-with-kind-2-2205.09082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-checking-of-contracts-with-kind-2-2205.09082"/></url>
<url><loc>https://scifaro.com/en/abs/rensets-and-renaming-based-recursion-for-syntax-with-bindings-2205.09233</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rensets-and-renaming-based-recursion-for-syntax-with-bindings-2205.09233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rensets-and-renaming-based-recursion-for-syntax-with-bindings-2205.09233"/></url>
<url><loc>https://scifaro.com/en/abs/neural-networks-in-imandra-matrix-representation-as-a-verification-choice-2205.09556</loc><lastmod>2022-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-networks-in-imandra-matrix-representation-as-a-verification-choice-2205.09556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-networks-in-imandra-matrix-representation-as-a-verification-choice-2205.09556"/></url>
<url><loc>https://scifaro.com/en/abs/evonne-interactive-proof-visualization-for-description-logics-system-description-extended-version-2205.09583</loc><lastmod>2022-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evonne-interactive-proof-visualization-for-description-logics-system-description-extended-version-2205.09583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evonne-interactive-proof-visualization-for-description-logics-system-description-extended-version-2205.09583"/></url>
<url><loc>https://scifaro.com/en/abs/dper-dynamic-programming-for-exist-random-stochastic-sat-2205.09826</loc><lastmod>2022-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dper-dynamic-programming-for-exist-random-stochastic-sat-2205.09826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dper-dynamic-programming-for-exist-random-stochastic-sat-2205.09826"/></url>
<url><loc>https://scifaro.com/en/abs/linking-sanctions-to-norms-in-practice-2205.10295</loc><lastmod>2022-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linking-sanctions-to-norms-in-practice-2205.10295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linking-sanctions-to-norms-in-practice-2205.10295"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-seventeenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2205.11103</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-seventeenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2205.11103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-seventeenth-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2205.11103"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-causal-theories-are-models-of-bv-logic-2205.11219</loc><lastmod>2022-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-causal-theories-are-models-of-bv-logic-2205.11219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-causal-theories-are-models-of-bv-logic-2205.11219"/></url>
<url><loc>https://scifaro.com/en/abs/sound-automation-of-magic-wands-extended-version-2205.11325</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-automation-of-magic-wands-extended-version-2205.11325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-automation-of-magic-wands-extended-version-2205.11325"/></url>
<url><loc>https://scifaro.com/en/abs/all-prime-numbers-have-primitive-roots-2205.11694</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/all-prime-numbers-have-primitive-roots-2205.11694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/all-prime-numbers-have-primitive-roots-2205.11694"/></url>
<url><loc>https://scifaro.com/en/abs/using-acl2-to-teach-students-about-software-testing-2205.11695</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-acl2-to-teach-students-about-software-testing-2205.11695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-acl2-to-teach-students-about-software-testing-2205.11695"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanized-proof-of-bounded-convergence-time-for-the-distributed-perimeter-surveillance-system-dpss-algorithm-a-2205.11697</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanized-proof-of-bounded-convergence-time-for-the-distributed-perimeter-surveillance-system-dpss-algorithm-a-2205.11697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanized-proof-of-bounded-convergence-time-for-the-distributed-perimeter-surveillance-system-dpss-algorithm-a-2205.11697"/></url>
<url><loc>https://scifaro.com/en/abs/vwsim-a-circuit-simulator-2205.11698</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vwsim-a-circuit-simulator-2205.11698"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vwsim-a-circuit-simulator-2205.11698"/></url>
<url><loc>https://scifaro.com/en/abs/a-free-group-of-rotations-of-rank-2-2205.11699</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-free-group-of-rotations-of-rank-2-2205.11699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-free-group-of-rotations-of-rank-2-2205.11699"/></url>
<url><loc>https://scifaro.com/en/abs/verified-implementation-of-an-efficient-term-rewriting-algorithm-for-multiplier-verification-on-acl2-2205.11703</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-implementation-of-an-efficient-term-rewriting-algorithm-for-multiplier-verification-on-acl2-2205.11703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-implementation-of-an-efficient-term-rewriting-algorithm-for-multiplier-verification-on-acl2-2205.11703"/></url>
<url><loc>https://scifaro.com/en/abs/acl2s-systems-programming-2205.11704</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acl2s-systems-programming-2205.11704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acl2s-systems-programming-2205.11704"/></url>
<url><loc>https://scifaro.com/en/abs/a-complex-java-code-generator-for-acl2-based-on-a-shallow-embedding-of-acl2-in-java-2205.11707</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complex-java-code-generator-for-acl2-based-on-a-shallow-embedding-of-acl2-in-java-2205.11707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complex-java-code-generator-for-acl2-based-on-a-shallow-embedding-of-acl2-in-java-2205.11707"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-generating-c-code-generator-for-acl2-based-on-a-shallow-embedding-of-c-in-acl2-2205.11708</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-generating-c-code-generator-for-acl2-based-on-a-shallow-embedding-of-c-in-acl2-2205.11708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-generating-c-code-generator-for-acl2-based-on-a-shallow-embedding-of-c-in-acl2-2205.11708"/></url>
<url><loc>https://scifaro.com/en/abs/hardware-software-co-assurance-using-the-rust-programming-language-and-acl2-2205.11709</loc><lastmod>2022-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hardware-software-co-assurance-using-the-rust-programming-language-and-acl2-2205.11709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hardware-software-co-assurance-using-the-rust-programming-language-and-acl2-2205.11709"/></url>
<url><loc>https://scifaro.com/en/abs/information-flow-guided-synthesis-full-version-2205.12085</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-flow-guided-synthesis-full-version-2205.12085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-flow-guided-synthesis-full-version-2205.12085"/></url>
<url><loc>https://scifaro.com/en/abs/towards-efficient-matching-of-regexes-with-backreferences-using-register-set-automata-technical-report-2205.12114</loc><lastmod>2026-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-efficient-matching-of-regexes-with-backreferences-using-register-set-automata-technical-report-2205.12114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-efficient-matching-of-regexes-with-backreferences-using-register-set-automata-technical-report-2205.12114"/></url>
<url><loc>https://scifaro.com/en/abs/sat-preprocessors-and-symmetry-2205.12799</loc><lastmod>2022-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-preprocessors-and-symmetry-2205.12799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-preprocessors-and-symmetry-2205.12799"/></url>
<url><loc>https://scifaro.com/en/abs/runtime-composition-of-systems-of-interacting-cyber-physical-components-2205.13008</loc><lastmod>2022-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/runtime-composition-of-systems-of-interacting-cyber-physical-components-2205.13008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/runtime-composition-of-systems-of-interacting-cyber-physical-components-2205.13008"/></url>
<url><loc>https://scifaro.com/en/abs/towards-syntactic-epistemic-logic-2205.13145</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-syntactic-epistemic-logic-2205.13145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-syntactic-epistemic-logic-2205.13145"/></url>
<url><loc>https://scifaro.com/en/abs/properties-of-the-hebrew-calendar-2205.13345</loc><lastmod>2022-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/properties-of-the-hebrew-calendar-2205.13345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/properties-of-the-hebrew-calendar-2205.13345"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-2205.13347</loc><lastmod>2022-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-2205.13347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-finite-group-theory-2205.13347"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-fuzzy-geometric-logic-2205.13387</loc><lastmod>2022-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-fuzzy-geometric-logic-2205.13387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-fuzzy-geometric-logic-2205.13387"/></url>
<url><loc>https://scifaro.com/en/abs/choiceless-polynomial-time-with-witnessed-symmetric-choice-2205.14003</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choiceless-polynomial-time-with-witnessed-symmetric-choice-2205.14003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choiceless-polynomial-time-with-witnessed-symmetric-choice-2205.14003"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanically-assisted-examination-of-vacuity-and-question-begging-in-anselm-s-ontological-argument-2205.14071</loc><lastmod>2022-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanically-assisted-examination-of-vacuity-and-question-begging-in-anselm-s-ontological-argument-2205.14071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanically-assisted-examination-of-vacuity-and-question-begging-in-anselm-s-ontological-argument-2205.14071"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-call-by-need-lambda-calculus-extended-version-2205.14916</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-call-by-need-lambda-calculus-extended-version-2205.14916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-call-by-need-lambda-calculus-extended-version-2205.14916"/></url>
<url><loc>https://scifaro.com/en/abs/a-fundamental-probabilistic-fuzzy-logic-framework-suitable-for-causal-reasoning-2205.15016</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fundamental-probabilistic-fuzzy-logic-framework-suitable-for-causal-reasoning-2205.15016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fundamental-probabilistic-fuzzy-logic-framework-suitable-for-causal-reasoning-2205.15016"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-hyperproperties-combined-with-functional-specifications-2205.15138</loc><lastmod>2022-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-hyperproperties-combined-with-functional-specifications-2205.15138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-hyperproperties-combined-with-functional-specifications-2205.15138"/></url>
<url><loc>https://scifaro.com/en/abs/exponentials-as-substitutions-and-the-cost-of-cut-elimination-in-linear-logic-2205.15203</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponentials-as-substitutions-and-the-cost-of-cut-elimination-in-linear-logic-2205.15203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponentials-as-substitutions-and-the-cost-of-cut-elimination-in-linear-logic-2205.15203"/></url>
<url><loc>https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2018-2021-2206.00251</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2018-2021-2206.00251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-reactive-synthesis-competition-syntcomp-2018-2021-2206.00251"/></url>
<url><loc>https://scifaro.com/en/abs/games-for-hybrid-logic-from-semantic-games-to-analytic-calculi-2206.00349</loc><lastmod>2022-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-for-hybrid-logic-from-semantic-games-to-analytic-calculi-2206.00349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-for-hybrid-logic-from-semantic-games-to-analytic-calculi-2206.00349"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-complexity-of-group-problems-2206.00371</loc><lastmod>2023-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-complexity-of-group-problems-2206.00371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-complexity-of-group-problems-2206.00371"/></url>
<url><loc>https://scifaro.com/en/abs/neural-network-verification-with-proof-production-2206.00512</loc><lastmod>2022-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-network-verification-with-proof-production-2206.00512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-network-verification-with-proof-production-2206.00512"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-quantified-boolean-announcements-2206.00903</loc><lastmod>2025-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-quantified-boolean-announcements-2206.00903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-quantified-boolean-announcements-2206.00903"/></url>
<url><loc>https://scifaro.com/en/abs/a-tableau-method-for-the-realizability-and-synthesis-of-reactive-safety-specifications-2206.01492</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tableau-method-for-the-realizability-and-synthesis-of-reactive-safety-specifications-2206.01492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tableau-method-for-the-realizability-and-synthesis-of-reactive-safety-specifications-2206.01492"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-with-local-and-remote-data-constraints-2206.01692</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-with-local-and-remote-data-constraints-2206.01692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-with-local-and-remote-data-constraints-2206.01692"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-algebra-of-computon-spaces-2206.01694</loc><lastmod>2022-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-algebra-of-computon-spaces-2206.01694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-algebra-of-computon-spaces-2206.01694"/></url>
<url><loc>https://scifaro.com/en/abs/prophecy-variables-for-hyperproperty-verification-2206.01797</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prophecy-variables-for-hyperproperty-verification-2206.01797"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prophecy-variables-for-hyperproperty-verification-2206.01797"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-hyperproperty-violations-2206.02074</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-hyperproperty-violations-2206.02074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-hyperproperty-violations-2206.02074"/></url>
<url><loc>https://scifaro.com/en/abs/situation-theory-and-channel-theory-as-a-unified-framework-for-imperfect-information-management-2206.02283</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/situation-theory-and-channel-theory-as-a-unified-framework-for-imperfect-information-management-2206.02283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/situation-theory-and-channel-theory-as-a-unified-framework-for-imperfect-information-management-2206.02283"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-horizontal-compression-of-dag-derivations-in-minimal-purely-implicational-logic-2206.02300</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-horizontal-compression-of-dag-derivations-in-minimal-purely-implicational-logic-2206.02300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-horizontal-compression-of-dag-derivations-in-minimal-purely-implicational-logic-2206.02300"/></url>
<url><loc>https://scifaro.com/en/abs/imperative-process-algebra-and-models-of-computation-2206.02472</loc><lastmod>2024-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imperative-process-algebra-and-models-of-computation-2206.02472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imperative-process-algebra-and-models-of-computation-2206.02472"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-generalised-and-structural-soundness-of-workflow-nets-via-relaxations-2206.02606</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-generalised-and-structural-soundness-of-workflow-nets-via-relaxations-2206.02606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-generalised-and-structural-soundness-of-workflow-nets-via-relaxations-2206.02606"/></url>
<url><loc>https://scifaro.com/en/abs/randomized-synthesis-for-diversity-and-cost-constraints-with-control-improvisation-2206.02775</loc><lastmod>2022-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/randomized-synthesis-for-diversity-and-cost-constraints-with-control-improvisation-2206.02775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/randomized-synthesis-for-diversity-and-cost-constraints-with-control-improvisation-2206.02775"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-theoretic-view-of-contextual-types-from-simple-types-to-dependent-types-2206.02831</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-theoretic-view-of-contextual-types-from-simple-types-to-dependent-types-2206.02831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-theoretic-view-of-contextual-types-from-simple-types-to-dependent-types-2206.02831"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-model-checking-of-industrial-simulink-models-2206.02992</loc><lastmod>2022-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-model-checking-of-industrial-simulink-models-2206.02992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-model-checking-of-industrial-simulink-models-2206.02992"/></url>
<url><loc>https://scifaro.com/en/abs/relevant-reasoners-in-a-classical-world-2206.03109</loc><lastmod>2022-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relevant-reasoners-in-a-classical-world-2206.03109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relevant-reasoners-in-a-classical-world-2206.03109"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-coq-formalization-of-a-quantified-modal-logic-2206.03358</loc><lastmod>2023-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-coq-formalization-of-a-quantified-modal-logic-2206.03358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-coq-formalization-of-a-quantified-modal-logic-2206.03358"/></url>
<url><loc>https://scifaro.com/en/abs/software-verification-of-hyperproperties-beyond-k-safety-2206.03381</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-verification-of-hyperproperties-beyond-k-safety-2206.03381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-verification-of-hyperproperties-beyond-k-safety-2206.03381"/></url>
<url><loc>https://scifaro.com/en/abs/automated-expected-amortised-cost-analysis-of-probabilistic-data-structures-2206.03537</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-expected-amortised-cost-analysis-of-probabilistic-data-structures-2206.03537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-expected-amortised-cost-analysis-of-probabilistic-data-structures-2206.03537"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-framework-for-interacting-cyber-physical-agents-2206.03997</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-framework-for-interacting-cyber-physical-agents-2206.03997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-framework-for-interacting-cyber-physical-agents-2206.03997"/></url>
<url><loc>https://scifaro.com/en/abs/finite-model-theory-and-proof-complexity-revisited-distinguishing-graphs-in-choiceless-polynomial-time-and-the-extended-polynomial-calculus-2206.05086</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-model-theory-and-proof-complexity-revisited-distinguishing-graphs-in-choiceless-polynomial-time-and-the-extended-polynomial-calculus-2206.05086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-model-theory-and-proof-complexity-revisited-distinguishing-graphs-in-choiceless-polynomial-time-and-the-extended-polynomial-calculus-2206.05086"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-logic-semantics-and-statistical-analysis-for-probabilistic-event-b-2206.05813</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-logic-semantics-and-statistical-analysis-for-probabilistic-event-b-2206.05813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-logic-semantics-and-statistical-analysis-for-probabilistic-event-b-2206.05813"/></url>
<url><loc>https://scifaro.com/en/abs/a-sahlqvist-style-correspondence-theorem-for-linear-time-temporal-logic-2206.05973</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sahlqvist-style-correspondence-theorem-for-linear-time-temporal-logic-2206.05973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sahlqvist-style-correspondence-theorem-for-linear-time-temporal-logic-2206.05973"/></url>
<url><loc>https://scifaro.com/en/abs/local-dependence-and-guarding-2206.06046</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-dependence-and-guarding-2206.06046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-dependence-and-guarding-2206.06046"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2206.06049</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2206.06049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2206.06049"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-proof-tree-automata-and-proof-tree-graphs-2206.06294</loc><lastmod>2022-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-proof-tree-automata-and-proof-tree-graphs-2206.06294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-proof-tree-automata-and-proof-tree-graphs-2206.06294"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-based-segmental-simulation-of-chemical-reaction-networks-2206.06677</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-based-segmental-simulation-of-chemical-reaction-networks-2206.06677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-based-segmental-simulation-of-chemical-reaction-networks-2206.06677"/></url>
<url><loc>https://scifaro.com/en/abs/structure-and-power-an-emerging-landscape-2206.07393</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-and-power-an-emerging-landscape-2206.07393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-and-power-an-emerging-landscape-2206.07393"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-eve-of-true-explainability-for-owl-ontologies-description-logic-proofs-with-evee-and-evonne-extended-version-2206.07711</loc><lastmod>2022-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-eve-of-true-explainability-for-owl-ontologies-description-logic-proofs-with-evee-and-evonne-extended-version-2206.07711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-eve-of-true-explainability-for-owl-ontologies-description-logic-proofs-with-evee-and-evonne-extended-version-2206.07711"/></url>
<url><loc>https://scifaro.com/en/abs/an-investigation-of-kripke-style-modal-type-theories-2206.07823</loc><lastmod>2023-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-investigation-of-kripke-style-modal-type-theories-2206.07823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-investigation-of-kripke-style-modal-type-theories-2206.07823"/></url>
<url><loc>https://scifaro.com/en/abs/twin-width-and-types-2206.08248</loc><lastmod>2022-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twin-width-and-types-2206.08248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twin-width-and-types-2206.08248"/></url>
<url><loc>https://scifaro.com/en/abs/recursion-does-not-always-help-2206.08413</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/recursion-does-not-always-help-2206.08413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/recursion-does-not-always-help-2206.08413"/></url>
<url><loc>https://scifaro.com/en/abs/relaxing-safety-for-metric-first-order-temporal-logic-via-dynamic-free-variables-2206.08714</loc><lastmod>2022-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relaxing-safety-for-metric-first-order-temporal-logic-via-dynamic-free-variables-2206.08714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relaxing-safety-for-metric-first-order-temporal-logic-via-dynamic-free-variables-2206.08714"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-exploration-of-combinatorial-scientific-models-2206.08755</loc><lastmod>2022-06-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-exploration-of-combinatorial-scientific-models-2206.08755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-exploration-of-combinatorial-scientific-models-2206.08755"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-and-modular-sequent-systems-for-description-logics-2206.09020</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-and-modular-sequent-systems-for-description-logics-2206.09020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-and-modular-sequent-systems-for-description-logics-2206.09020"/></url>
<url><loc>https://scifaro.com/en/abs/robin-milner-s-work-on-concurrency-an-appreciation-2206.09250</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robin-milner-s-work-on-concurrency-an-appreciation-2206.09250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robin-milner-s-work-on-concurrency-an-appreciation-2206.09250"/></url>
<url><loc>https://scifaro.com/en/abs/two-results-on-separation-logic-with-theory-reasoning-2206.09389</loc><lastmod>2022-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-results-on-separation-logic-with-theory-reasoning-2206.09389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-results-on-separation-logic-with-theory-reasoning-2206.09389"/></url>
<url><loc>https://scifaro.com/en/abs/the-many-worlds-calculus-2206.10234</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-many-worlds-calculus-2206.10234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-many-worlds-calculus-2206.10234"/></url>
<url><loc>https://scifaro.com/en/abs/geometry-of-interaction-for-zx-diagrams-2206.10916</loc><lastmod>2022-08-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geometry-of-interaction-for-zx-diagrams-2206.10916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geometry-of-interaction-for-zx-diagrams-2206.10916"/></url>
<url><loc>https://scifaro.com/en/abs/from-spot-2-0-to-spot-2-10-what-s-new-2206.11366</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-spot-2-0-to-spot-2-10-what-s-new-2206.11366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-spot-2-0-to-spot-2-10-what-s-new-2206.11366"/></url>
<url><loc>https://scifaro.com/en/abs/algebra-based-reasoning-for-loop-synthesis-2206.11495</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebra-based-reasoning-for-loop-synthesis-2206.11495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebra-based-reasoning-for-loop-synthesis-2206.11495"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-model-theory-of-ordered-logics-expressivity-and-interpolation-extended-version-2206.11751</loc><lastmod>2022-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-model-theory-of-ordered-logics-expressivity-and-interpolation-extended-version-2206.11751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-model-theory-of-ordered-logics-expressivity-and-interpolation-extended-version-2206.11751"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-presheaf-representations-of-strategies-and-cohomological-refinements-of-k-consistency-and-k-equivalence-2206.12156</loc><lastmod>2022-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-presheaf-representations-of-strategies-and-cohomological-refinements-of-k-consistency-and-k-equivalence-2206.12156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-presheaf-representations-of-strategies-and-cohomological-refinements-of-k-consistency-and-k-equivalence-2206.12156"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-analytic-functions-in-vtc-0-2206.12164</loc><lastmod>2023-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-analytic-functions-in-vtc-0-2206.12164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-analytic-functions-in-vtc-0-2206.12164"/></url>
<url><loc>https://scifaro.com/en/abs/checking-trustworthiness-of-probabilistic-computations-in-a-typed-natural-deduction-system-2206.12934</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checking-trustworthiness-of-probabilistic-computations-in-a-typed-natural-deduction-system-2206.12934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checking-trustworthiness-of-probabilistic-computations-in-a-typed-natural-deduction-system-2206.12934"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-and-metric-rewriting-abstract-non-expansive-and-graded-systems-2206.13610</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-and-metric-rewriting-abstract-non-expansive-and-graded-systems-2206.13610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-and-metric-rewriting-abstract-non-expansive-and-graded-systems-2206.13610"/></url>
<url><loc>https://scifaro.com/en/abs/on-two-variable-guarded-fragment-logic-with-expressive-local-presburger-constraints-2206.13731</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-two-variable-guarded-fragment-logic-with-expressive-local-presburger-constraints-2206.13731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-two-variable-guarded-fragment-logic-with-expressive-local-presburger-constraints-2206.13731"/></url>
<url><loc>https://scifaro.com/en/abs/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes-2206.13765</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes-2206.13765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes-2206.13765"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-interpretation-hoare-logic-and-incorrectness-logic-for-quantum-programs-2206.13772</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-interpretation-hoare-logic-and-incorrectness-logic-for-quantum-programs-2206.13772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-interpretation-hoare-logic-and-incorrectness-logic-for-quantum-programs-2206.13772"/></url>
<url><loc>https://scifaro.com/en/abs/program-semantics-and-a-verification-technique-for-knowledge-based-multi-agent-systems-2206.13841</loc><lastmod>2022-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-semantics-and-a-verification-technique-for-knowledge-based-multi-agent-systems-2206.13841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-semantics-and-a-verification-technique-for-knowledge-based-multi-agent-systems-2206.13841"/></url>
<url><loc>https://scifaro.com/en/abs/computation-as-uncertainty-reduction-a-simplified-order-theoretic-framework-2206.13885</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-as-uncertainty-reduction-a-simplified-order-theoretic-framework-2206.13885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-as-uncertainty-reduction-a-simplified-order-theoretic-framework-2206.13885"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantitative-extension-of-interval-temporal-logic-over-infinite-words-2206.13920</loc><lastmod>2022-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantitative-extension-of-interval-temporal-logic-over-infinite-words-2206.13920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantitative-extension-of-interval-temporal-logic-over-infinite-words-2206.13920"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-axiomatisation-of-branching-bisimulation-congruence-over-ccs-2206.13927</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-axiomatisation-of-branching-bisimulation-congruence-over-ccs-2206.13927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-axiomatisation-of-branching-bisimulation-congruence-over-ccs-2206.13927"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-specification-of-operating-system-based-on-arinc-653-2206.14189</loc><lastmod>2022-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-specification-of-operating-system-based-on-arinc-653-2206.14189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-specification-of-operating-system-based-on-arinc-653-2206.14189"/></url>
<url><loc>https://scifaro.com/en/abs/minimization-of-dynamical-systems-over-monoids-2206.15169</loc><lastmod>2023-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimization-of-dynamical-systems-over-monoids-2206.15169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimization-of-dynamical-systems-over-monoids-2206.15169"/></url>
<url><loc>https://scifaro.com/en/abs/tuple-interpretations-and-applications-to-higher-order-runtime-complexity-2206.15202</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tuple-interpretations-and-applications-to-higher-order-runtime-complexity-2206.15202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tuple-interpretations-and-applications-to-higher-order-runtime-complexity-2206.15202"/></url>
<url><loc>https://scifaro.com/en/abs/cohomology-in-constraint-satisfaction-and-structure-isomorphism-2206.15253</loc><lastmod>2022-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cohomology-in-constraint-satisfaction-and-structure-isomorphism-2206.15253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cohomology-in-constraint-satisfaction-and-structure-isomorphism-2206.15253"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-in-non-normal-modal-description-logics-2207.00119</loc><lastmod>2022-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-in-non-normal-modal-description-logics-2207.00119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-in-non-normal-modal-description-logics-2207.00119"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-process-modelling-combining-situation-calculus-and-petri-nets-2207.00317</loc><lastmod>2022-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-process-modelling-combining-situation-calculus-and-petri-nets-2207.00317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-process-modelling-combining-situation-calculus-and-petri-nets-2207.00317"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-on-satisfiability-checking-for-the-mu-calculus-through-tree-automata-2207.00517</loc><lastmod>2022-08-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-on-satisfiability-checking-for-the-mu-calculus-through-tree-automata-2207.00517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-on-satisfiability-checking-for-the-mu-calculus-through-tree-automata-2207.00517"/></url>
<url><loc>https://scifaro.com/en/abs/what-makes-a-strong-monad-2207.00851</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-makes-a-strong-monad-2207.00851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-makes-a-strong-monad-2207.00851"/></url>
<url><loc>https://scifaro.com/en/abs/auto-active-verification-of-floating-point-programs-via-nonlinear-real-provers-2207.00921</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/auto-active-verification-of-floating-point-programs-via-nonlinear-real-provers-2207.00921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/auto-active-verification-of-floating-point-programs-via-nonlinear-real-provers-2207.00921"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-framework-for-distributed-cyber-physical-systems-2207.01048</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-framework-for-distributed-cyber-physical-systems-2207.01048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-framework-for-distributed-cyber-physical-systems-2207.01048"/></url>
<url><loc>https://scifaro.com/en/abs/sahlqvist-type-completeness-theory-for-hybrid-logic-with-binder-2207.01288</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sahlqvist-type-completeness-theory-for-hybrid-logic-with-binder-2207.01288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sahlqvist-type-completeness-theory-for-hybrid-logic-with-binder-2207.01288"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-safety-properties-using-interpolation-and-k-induction-2207.01338</loc><lastmod>2022-07-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-safety-properties-using-interpolation-and-k-induction-2207.01338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-safety-properties-using-interpolation-and-k-induction-2207.01338"/></url>
<url><loc>https://scifaro.com/en/abs/a-stochastic-game-approach-to-masking-fault-tolerance-bisimulation-and-quantification-2207.02045</loc><lastmod>2022-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-stochastic-game-approach-to-masking-fault-tolerance-bisimulation-and-quantification-2207.02045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-stochastic-game-approach-to-masking-fault-tolerance-bisimulation-and-quantification-2207.02045"/></url>
<url><loc>https://scifaro.com/en/abs/partial-residuated-implications-derived-from-partial-triangular-norms-and-partial-residuated-lattices-2207.02601</loc><lastmod>2022-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-residuated-implications-derived-from-partial-triangular-norms-and-partial-residuated-lattices-2207.02601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-residuated-implications-derived-from-partial-triangular-norms-and-partial-residuated-lattices-2207.02601"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-rational-verification-2207.02637</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-rational-verification-2207.02637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-rational-verification-2207.02637"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-home-space-problem-for-petri-nets-and-its-ackermannian-complexity-2207.02697</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-home-space-problem-for-petri-nets-and-its-ackermannian-complexity-2207.02697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-home-space-problem-for-petri-nets-and-its-ackermannian-complexity-2207.02697"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-fisher-s-inequality-formal-linear-algebraic-proof-techniques-in-combinatorics-2207.02728</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-fisher-s-inequality-formal-linear-algebraic-proof-techniques-in-combinatorics-2207.02728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-fisher-s-inequality-formal-linear-algebraic-proof-techniques-in-combinatorics-2207.02728"/></url>
<url><loc>https://scifaro.com/en/abs/towards-concurrent-quantitative-separation-logic-2207.02822</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-concurrent-quantitative-separation-logic-2207.02822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-concurrent-quantitative-separation-logic-2207.02822"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-and-decidability-of-temporal-logics-for-asynchronous-hyperproperties-2207.02956</loc><lastmod>2022-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-and-decidability-of-temporal-logics-for-asynchronous-hyperproperties-2207.02956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-and-decidability-of-temporal-logics-for-asynchronous-hyperproperties-2207.02956"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-validation-obligations-to-security-concerns-2207.03209</loc><lastmod>2022-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-validation-obligations-to-security-concerns-2207.03209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-validation-obligations-to-security-concerns-2207.03209"/></url>
<url><loc>https://scifaro.com/en/abs/on-session-typing-probabilistic-polynomial-time-and-cryptographic-experiments-long-version-2207.03360</loc><lastmod>2022-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-session-typing-probabilistic-polynomial-time-and-cryptographic-experiments-long-version-2207.03360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-session-typing-probabilistic-polynomial-time-and-cryptographic-experiments-long-version-2207.03360"/></url>
<url><loc>https://scifaro.com/en/abs/an-infinitary-proof-theory-of-linear-logic-ensuring-fair-termination-in-the-linear-pi-calculus-2207.03749</loc><lastmod>2022-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-infinitary-proof-theory-of-linear-logic-ensuring-fair-termination-in-the-linear-pi-calculus-2207.03749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-infinitary-proof-theory-of-linear-logic-ensuring-fair-termination-in-the-linear-pi-calculus-2207.03749"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagrams-for-layered-explanations-2207.03929</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagrams-for-layered-explanations-2207.03929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagrams-for-layered-explanations-2207.03929"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-processes-in-the-absence-of-conflicts-in-general-place-transition-systems-2207.04362</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-processes-in-the-absence-of-conflicts-in-general-place-transition-systems-2207.04362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-processes-in-the-absence-of-conflicts-in-general-place-transition-systems-2207.04362"/></url>
<url><loc>https://scifaro.com/en/abs/epi-constructivism-decidable-sets-of-computable-numbers-as-foundational-objects-for-mathematics-2207.04647</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epi-constructivism-decidable-sets-of-computable-numbers-as-foundational-objects-for-mathematics-2207.04647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epi-constructivism-decidable-sets-of-computable-numbers-as-foundational-objects-for-mathematics-2207.04647"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariance-in-the-two-variable-fragment-of-first-order-logic-2207.04986</loc><lastmod>2022-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariance-in-the-two-variable-fragment-of-first-order-logic-2207.04986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariance-in-the-two-variable-fragment-of-first-order-logic-2207.04986"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-generation-for-infinite-state-chemical-reaction-networks-2207.05207</loc><lastmod>2022-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-generation-for-infinite-state-chemical-reaction-networks-2207.05207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-generation-for-infinite-state-chemical-reaction-networks-2207.05207"/></url>
<url><loc>https://scifaro.com/en/abs/hennessy-milner-theorems-via-galois-connections-2207.05407</loc><lastmod>2023-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hennessy-milner-theorems-via-galois-connections-2207.05407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hennessy-milner-theorems-via-galois-connections-2207.05407"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-logic-a-new-foundation-for-computer-mathematics-2207.05610</loc><lastmod>2022-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-logic-a-new-foundation-for-computer-mathematics-2207.05610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-logic-a-new-foundation-for-computer-mathematics-2207.05610"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-runtime-verification-for-monitoring-under-uncertainties-and-assumptions-2207.05678</loc><lastmod>2022-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-runtime-verification-for-monitoring-under-uncertainties-and-assumptions-2207.05678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-runtime-verification-for-monitoring-under-uncertainties-and-assumptions-2207.05678"/></url>
<url><loc>https://scifaro.com/en/abs/multi-a-formal-playground-for-multi-smart-contract-interaction-2207.06681</loc><lastmod>2022-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-a-formal-playground-for-multi-smart-contract-interaction-2207.06681"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-a-formal-playground-for-multi-smart-contract-interaction-2207.06681"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-problem-for-constraint-ltl-2207.06708</loc><lastmod>2022-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-problem-for-constraint-ltl-2207.06708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-problem-for-constraint-ltl-2207.06708"/></url>
<url><loc>https://scifaro.com/en/abs/parameter-synthesis-in-markov-models-a-gentle-survey-2207.06801</loc><lastmod>2022-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameter-synthesis-in-markov-models-a-gentle-survey-2207.06801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameter-synthesis-in-markov-models-a-gentle-survey-2207.06801"/></url>
<url><loc>https://scifaro.com/en/abs/node-replication-theory-and-practice-2207.07143</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/node-replication-theory-and-practice-2207.07143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/node-replication-theory-and-practice-2207.07143"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-incompleteness-of-hilbert-system-for-a-combination-of-classical-and-intuitionistic-propositional-logic-2207.07416</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-incompleteness-of-hilbert-system-for-a-combination-of-classical-and-intuitionistic-propositional-logic-2207.07416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-incompleteness-of-hilbert-system-for-a-combination-of-classical-and-intuitionistic-propositional-logic-2207.07416"/></url>
<url><loc>https://scifaro.com/en/abs/zone-based-verification-of-timed-automata-extrapolations-simulations-and-what-next-2207.07479</loc><lastmod>2022-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zone-based-verification-of-timed-automata-extrapolations-simulations-and-what-next-2207.07479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zone-based-verification-of-timed-automata-extrapolations-simulations-and-what-next-2207.07479"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-szemer-edi-s-regularity-lemma-and-roth-s-theorem-on-arithmetic-progressions-in-isabelle-hol-2207.07499</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-szemer-edi-s-regularity-lemma-and-roth-s-theorem-on-arithmetic-progressions-in-isabelle-hol-2207.07499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-szemer-edi-s-regularity-lemma-and-roth-s-theorem-on-arithmetic-progressions-in-isabelle-hol-2207.07499"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-points-and-noetherian-topologies-2207.07614</loc><lastmod>2022-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-points-and-noetherian-topologies-2207.07614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-points-and-noetherian-topologies-2207.07614"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-logic-and-twin-width-in-tournaments-and-dense-oriented-graphs-2207.07683</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-logic-and-twin-width-in-tournaments-and-dense-oriented-graphs-2207.07683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-logic-and-twin-width-in-tournaments-and-dense-oriented-graphs-2207.07683"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verified-32-and-64-bit-integer-division-using-double-precision-floating-point-arithmetic-2207.08420</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verified-32-and-64-bit-integer-division-using-double-precision-floating-point-arithmetic-2207.08420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verified-32-and-64-bit-integer-division-using-double-precision-floating-point-arithmetic-2207.08420"/></url>
<url><loc>https://scifaro.com/en/abs/cd-tools-condensed-detachment-and-structure-generating-theorem-proving-system-description-2207.08453</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cd-tools-condensed-detachment-and-structure-generating-theorem-proving-system-description-2207.08453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cd-tools-condensed-detachment-and-structure-generating-theorem-proving-system-description-2207.08453"/></url>
<url><loc>https://scifaro.com/en/abs/multiplicative-linear-logic-from-a-resolution-based-tile-system-2207.08465</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiplicative-linear-logic-from-a-resolution-based-tile-system-2207.08465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiplicative-linear-logic-from-a-resolution-based-tile-system-2207.08465"/></url>
<url><loc>https://scifaro.com/en/abs/conjunctive-queries-existentially-quantified-systems-of-equations-and-finite-substitutions-2207.08572</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjunctive-queries-existentially-quantified-systems-of-equations-and-finite-substitutions-2207.08572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjunctive-queries-existentially-quantified-systems-of-equations-and-finite-substitutions-2207.08572"/></url>
<url><loc>https://scifaro.com/en/abs/the-theory-of-call-by-value-solvability-long-version-2207.08697</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-theory-of-call-by-value-solvability-long-version-2207.08697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-theory-of-call-by-value-solvability-long-version-2207.08697"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-for-rectangular-hybrid-systems-a-quantified-encoding-approach-2207.08775</loc><lastmod>2022-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-for-rectangular-hybrid-systems-a-quantified-encoding-approach-2207.08775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-for-rectangular-hybrid-systems-a-quantified-encoding-approach-2207.08775"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-analysis-of-normalisation-by-evaluation-for-typed-lambda-calculus-2207.08777</loc><lastmod>2022-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-analysis-of-normalisation-by-evaluation-for-typed-lambda-calculus-2207.08777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-analysis-of-normalisation-by-evaluation-for-typed-lambda-calculus-2207.08777"/></url>
<url><loc>https://scifaro.com/en/abs/one-or-nothing-anti-unification-over-the-simply-typed-lambda-calculus-2207.08918</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-or-nothing-anti-unification-over-the-simply-typed-lambda-calculus-2207.08918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-or-nothing-anti-unification-over-the-simply-typed-lambda-calculus-2207.08918"/></url>
<url><loc>https://scifaro.com/en/abs/existentially-quantified-systems-of-equations-as-an-implicit-representation-of-answers-in-logic-programming-2207.09142</loc><lastmod>2022-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existentially-quantified-systems-of-equations-as-an-implicit-representation-of-answers-in-logic-programming-2207.09142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existentially-quantified-systems-of-equations-as-an-implicit-representation-of-answers-in-logic-programming-2207.09142"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-hennessy-milner-theorems-via-notions-of-density-2207.09187</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-hennessy-milner-theorems-via-notions-of-density-2207.09187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-hennessy-milner-theorems-via-notions-of-density-2207.09187"/></url>
<url><loc>https://scifaro.com/en/abs/central-submonads-and-notions-of-computation-soundness-completeness-and-internal-languages-2207.09190</loc><lastmod>2025-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/central-submonads-and-notions-of-computation-soundness-completeness-and-internal-languages-2207.09190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/central-submonads-and-notions-of-computation-soundness-completeness-and-internal-languages-2207.09190"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-the-polynomial-hierarchy-by-second-order-revised-krom-logic-2207.09226</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-the-polynomial-hierarchy-by-second-order-revised-krom-logic-2207.09226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-the-polynomial-hierarchy-by-second-order-revised-krom-logic-2207.09226"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-krull-topology-in-lean-2207.09486</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-krull-topology-in-lean-2207.09486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-krull-topology-in-lean-2207.09486"/></url>
<url><loc>https://scifaro.com/en/abs/testselector-automatic-test-suite-selection-for-student-projects-extended-version-2207.09509</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testselector-automatic-test-suite-selection-for-student-projects-extended-version-2207.09509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testselector-automatic-test-suite-selection-for-student-projects-extended-version-2207.09509"/></url>
<url><loc>https://scifaro.com/en/abs/careful-autonomous-agents-in-environments-with-multiple-common-resources-2207.09707</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/careful-autonomous-agents-in-environments-with-multiple-common-resources-2207.09707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/careful-autonomous-agents-in-environments-with-multiple-common-resources-2207.09707"/></url>
<url><loc>https://scifaro.com/en/abs/auto-active-verification-of-graph-algorithms-written-in-ocaml-2207.09854</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/auto-active-verification-of-graph-algorithms-written-in-ocaml-2207.09854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/auto-active-verification-of-graph-algorithms-written-in-ocaml-2207.09854"/></url>
<url><loc>https://scifaro.com/en/abs/a-lattice-theoretical-view-of-strategy-iteration-2207.09872</loc><lastmod>2022-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lattice-theoretical-view-of-strategy-iteration-2207.09872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lattice-theoretical-view-of-strategy-iteration-2207.09872"/></url>
<url><loc>https://scifaro.com/en/abs/pfmc-a-parallel-symbolic-model-checker-for-security-protocol-verification-2207.09895</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pfmc-a-parallel-symbolic-model-checker-for-security-protocol-verification-2207.09895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pfmc-a-parallel-symbolic-model-checker-for-security-protocol-verification-2207.09895"/></url>
<url><loc>https://scifaro.com/en/abs/a-totally-predictable-outcome-an-investigation-of-traversals-of-infinite-structures-2207.10010</loc><lastmod>2022-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-totally-predictable-outcome-an-investigation-of-traversals-of-infinite-structures-2207.10010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-totally-predictable-outcome-an-investigation-of-traversals-of-infinite-structures-2207.10010"/></url>
<url><loc>https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-public-announcement-logic-2207.10262</loc><lastmod>2022-10-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-public-announcement-logic-2207.10262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-labelled-sequent-calculus-for-public-announcement-logic-2207.10262"/></url>
<url><loc>https://scifaro.com/en/abs/a-linter-for-isabelle-implementation-and-evaluation-2207.10424</loc><lastmod>2022-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linter-for-isabelle-implementation-and-evaluation-2207.10424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linter-for-isabelle-implementation-and-evaluation-2207.10424"/></url>
<url><loc>https://scifaro.com/en/abs/checkinn-wide-range-neural-network-verification-in-imandra-extended-2207.10562</loc><lastmod>2022-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/checkinn-wide-range-neural-network-verification-in-imandra-extended-2207.10562"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/checkinn-wide-range-neural-network-verification-in-imandra-extended-2207.10562"/></url>
<url><loc>https://scifaro.com/en/abs/on-feller-continuity-and-full-abstraction-long-version-2207.10590</loc><lastmod>2022-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-feller-continuity-and-full-abstraction-long-version-2207.10590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-feller-continuity-and-full-abstraction-long-version-2207.10590"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-shortest-drat-proof-of-the-pigeonhole-principle-2207.11284</loc><lastmod>2022-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-shortest-drat-proof-of-the-pigeonhole-principle-2207.11284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-shortest-drat-proof-of-the-pigeonhole-principle-2207.11284"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-hol-gst-a-formal-proof-environment-for-generalized-set-theories-2207.12039</loc><lastmod>2022-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-hol-gst-a-formal-proof-environment-for-generalized-set-theories-2207.12039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-hol-gst-a-formal-proof-environment-for-generalized-set-theories-2207.12039"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-the-change-of-variables-formula-for-integrals-in-mathlib-2207.12742</loc><lastmod>2022-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-the-change-of-variables-formula-for-integrals-in-mathlib-2207.12742"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-the-change-of-variables-formula-for-integrals-in-mathlib-2207.12742"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-for-fitch-style-modal-calculi-2207.12807</loc><lastmod>2022-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-for-fitch-style-modal-calculi-2207.12807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-for-fitch-style-modal-calculi-2207.12807"/></url>
<url><loc>https://scifaro.com/en/abs/extensible-proof-systems-for-infinite-state-systems-2207.12953</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensible-proof-systems-for-infinite-state-systems-2207.12953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensible-proof-systems-for-infinite-state-systems-2207.12953"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-proof-producing-multi-threaded-sat-solving-with-gimsatul-through-sharing-instead-of-copying-clauses-2207.13577</loc><lastmod>2022-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-proof-producing-multi-threaded-sat-solving-with-gimsatul-through-sharing-instead-of-copying-clauses-2207.13577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-proof-producing-multi-threaded-sat-solving-with-gimsatul-through-sharing-instead-of-copying-clauses-2207.13577"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-bounds-for-omega-regular-properties-in-bounded-parameter-markov-decision-processes-2207.13660</loc><lastmod>2022-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-bounds-for-omega-regular-properties-in-bounded-parameter-markov-decision-processes-2207.13660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-bounds-for-omega-regular-properties-in-bounded-parameter-markov-decision-processes-2207.13660"/></url>
<url><loc>https://scifaro.com/en/abs/frobenius-structures-in-star-autonomous-categories-2207.13912</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/frobenius-structures-in-star-autonomous-categories-2207.13912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/frobenius-structures-in-star-autonomous-categories-2207.13912"/></url>
<url><loc>https://scifaro.com/en/abs/trace-refinement-in-b-and-event-b-2207.14043</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-refinement-in-b-and-event-b-2207.14043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-refinement-in-b-and-event-b-2207.14043"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-matching-logic-2207.14139</loc><lastmod>2022-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-matching-logic-2207.14139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-matching-logic-2207.14139"/></url>
<url><loc>https://scifaro.com/en/abs/regression-verification-of-unbalanced-recursive-functions-with-multiple-calls-long-version-2207.14364</loc><lastmod>2022-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regression-verification-of-unbalanced-recursive-functions-with-multiple-calls-long-version-2207.14364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regression-verification-of-unbalanced-recursive-functions-with-multiple-calls-long-version-2207.14364"/></url>
<url><loc>https://scifaro.com/en/abs/on-translating-conditional-statements-into-mathematical-logic-2208.00252</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-translating-conditional-statements-into-mathematical-logic-2208.00252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-translating-conditional-statements-into-mathematical-logic-2208.00252"/></url>
<url><loc>https://scifaro.com/en/abs/left-computably-enumerable-reals-and-initial-segment-complexity-2208.00423</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/left-computably-enumerable-reals-and-initial-segment-complexity-2208.00423"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/left-computably-enumerable-reals-and-initial-segment-complexity-2208.00423"/></url>
<url><loc>https://scifaro.com/en/abs/countdown-mu-calculus-2208.00536</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/countdown-mu-calculus-2208.00536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/countdown-mu-calculus-2208.00536"/></url>
<url><loc>https://scifaro.com/en/abs/finding-smart-contract-vulnerabilities-with-concert-s-property-based-testing-framework-2208.00758</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-smart-contract-vulnerabilities-with-concert-s-property-based-testing-framework-2208.00758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-smart-contract-vulnerabilities-with-concert-s-property-based-testing-framework-2208.00758"/></url>
<url><loc>https://scifaro.com/en/abs/analysing-parallel-complexity-of-term-rewriting-2208.01005</loc><lastmod>2022-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analysing-parallel-complexity-of-term-rewriting-2208.01005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analysing-parallel-complexity-of-term-rewriting-2208.01005"/></url>
<url><loc>https://scifaro.com/en/abs/conjunctive-queries-for-logic-based-information-extraction-2208.01298</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjunctive-queries-for-logic-based-information-extraction-2208.01298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjunctive-queries-for-logic-based-information-extraction-2208.01298"/></url>
<url><loc>https://scifaro.com/en/abs/stratified-certification-for-k-induction-2208.01443</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stratified-certification-for-k-induction-2208.01443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stratified-certification-for-k-induction-2208.01443"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-a-logic-of-separated-relations-2208.01520</loc><lastmod>2022-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-a-logic-of-separated-relations-2208.01520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-a-logic-of-separated-relations-2208.01520"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-38th-international-conference-on-logic-programming-2208.02685</loc><lastmod>2022-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-38th-international-conference-on-logic-programming-2208.02685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-38th-international-conference-on-logic-programming-2208.02685"/></url>
<url><loc>https://scifaro.com/en/abs/np-decision-procedure-for-monomial-and-linear-integer-constraints-2208.02713</loc><lastmod>2022-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/np-decision-procedure-for-monomial-and-linear-integer-constraints-2208.02713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/np-decision-procedure-for-monomial-and-linear-integer-constraints-2208.02713"/></url>
<url><loc>https://scifaro.com/en/abs/deductive-verification-of-smart-contracts-with-dafny-2208.02920</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deductive-verification-of-smart-contracts-with-dafny-2208.02920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deductive-verification-of-smart-contracts-with-dafny-2208.02920"/></url>
<url><loc>https://scifaro.com/en/abs/covariant-contravariant-refinement-modal-mu-calculus-2208.02989</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/covariant-contravariant-refinement-modal-mu-calculus-2208.02989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/covariant-contravariant-refinement-modal-mu-calculus-2208.02989"/></url>
<url><loc>https://scifaro.com/en/abs/property-directed-reachability-for-generalized-petri-nets-2208.03043</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-directed-reachability-for-generalized-petri-nets-2208.03043"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-directed-reachability-for-generalized-petri-nets-2208.03043"/></url>
<url><loc>https://scifaro.com/en/abs/on-model-reconciliation-how-to-reconcile-when-robot-does-not-know-human-s-model-2208.03091</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-model-reconciliation-how-to-reconcile-when-robot-does-not-know-human-s-model-2208.03091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-model-reconciliation-how-to-reconcile-when-robot-does-not-know-human-s-model-2208.03091"/></url>
<url><loc>https://scifaro.com/en/abs/an-iterative-fixpoint-semantics-for-mknf-hybrid-knowledge-bases-with-function-symbols-2208.03092</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-iterative-fixpoint-semantics-for-mknf-hybrid-knowledge-bases-with-function-symbols-2208.03092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-iterative-fixpoint-semantics-for-mknf-hybrid-knowledge-bases-with-function-symbols-2208.03092"/></url>
<url><loc>https://scifaro.com/en/abs/a-gaze-into-the-internal-logic-of-graph-neural-networks-with-logic-2208.03093</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-gaze-into-the-internal-logic-of-graph-neural-networks-with-logic-2208.03093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-gaze-into-the-internal-logic-of-graph-neural-networks-with-logic-2208.03093"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-authoring-with-factual-english-2208.03094</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-authoring-with-factual-english-2208.03094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-authoring-with-factual-english-2208.03094"/></url>
<url><loc>https://scifaro.com/en/abs/a-model-oriented-approach-for-lifting-symmetries-in-answer-set-programming-2208.03095</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-model-oriented-approach-for-lifting-symmetries-in-answer-set-programming-2208.03095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-model-oriented-approach-for-lifting-symmetries-in-answer-set-programming-2208.03095"/></url>
<url><loc>https://scifaro.com/en/abs/tools-and-methodologies-for-verifying-answer-set-programs-2208.03096</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tools-and-methodologies-for-verifying-answer-set-programs-2208.03096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tools-and-methodologies-for-verifying-answer-set-programs-2208.03096"/></url>
<url><loc>https://scifaro.com/en/abs/decomposition-strategies-for-solving-scheduling-problems-in-industrial-applications-2208.03100</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decomposition-strategies-for-solving-scheduling-problems-in-industrial-applications-2208.03100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decomposition-strategies-for-solving-scheduling-problems-in-industrial-applications-2208.03100"/></url>
<url><loc>https://scifaro.com/en/abs/basic-elements-of-logical-graphs-2208.03194</loc><lastmod>2022-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/basic-elements-of-logical-graphs-2208.03194"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/basic-elements-of-logical-graphs-2208.03194"/></url>
<url><loc>https://scifaro.com/en/abs/a-set-theoretic-decision-procedure-for-quantifier-free-decidable-languages-extended-with-restricted-quantifiers-2208.03518</loc><lastmod>2022-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-set-theoretic-decision-procedure-for-quantifier-free-decidable-languages-extended-with-restricted-quantifiers-2208.03518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-set-theoretic-decision-procedure-for-quantifier-free-decidable-languages-extended-with-restricted-quantifiers-2208.03518"/></url>
<url><loc>https://scifaro.com/en/abs/uclid5-multi-modal-formal-modeling-verification-and-synthesis-2208.03699</loc><lastmod>2022-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uclid5-multi-modal-formal-modeling-verification-and-synthesis-2208.03699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uclid5-multi-modal-formal-modeling-verification-and-synthesis-2208.03699"/></url>
<url><loc>https://scifaro.com/en/abs/programs-as-diagrams-from-categorical-computability-to-computable-categories-2208.03817</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programs-as-diagrams-from-categorical-computability-to-computable-categories-2208.03817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programs-as-diagrams-from-categorical-computability-to-computable-categories-2208.03817"/></url>
<url><loc>https://scifaro.com/en/abs/type-theoretic-approaches-to-ordinals-2208.03844</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theoretic-approaches-to-ordinals-2208.03844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theoretic-approaches-to-ordinals-2208.03844"/></url>
<url><loc>https://scifaro.com/en/abs/mso-queries-on-trees-enumerating-answers-under-updates-using-forest-algebras-2208.04180</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mso-queries-on-trees-enumerating-answers-under-updates-using-forest-algebras-2208.04180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mso-queries-on-trees-enumerating-answers-under-updates-using-forest-algebras-2208.04180"/></url>
<url><loc>https://scifaro.com/en/abs/on-composing-communicating-systems-2208.04634</loc><lastmod>2022-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-composing-communicating-systems-2208.04634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-composing-communicating-systems-2208.04634"/></url>
<url><loc>https://scifaro.com/en/abs/the-completeness-of-reasoning-algorithms-for-clause-sets-in-description-logic-alc-2208.05279</loc><lastmod>2022-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-completeness-of-reasoning-algorithms-for-clause-sets-in-description-logic-alc-2208.05279"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-completeness-of-reasoning-algorithms-for-clause-sets-in-description-logic-alc-2208.05279"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-the-busy-forbidden-protocol-using-an-extension-of-the-cones-and-foci-framework-2208.05334</loc><lastmod>2023-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-the-busy-forbidden-protocol-using-an-extension-of-the-cones-and-foci-framework-2208.05334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-the-busy-forbidden-protocol-using-an-extension-of-the-cones-and-foci-framework-2208.05334"/></url>
<url><loc>https://scifaro.com/en/abs/a-compositional-approach-to-verifying-modular-robotic-systems-2208.05507</loc><lastmod>2023-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-compositional-approach-to-verifying-modular-robotic-systems-2208.05507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-compositional-approach-to-verifying-modular-robotic-systems-2208.05507"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-nexp-complete-problems-to-dqbf-2208.06014</loc><lastmod>2022-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-nexp-complete-problems-to-dqbf-2208.06014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-nexp-complete-problems-to-dqbf-2208.06014"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-formalization-of-the-heat-conduction-problem-in-hol-2208.06642</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-formalization-of-the-heat-conduction-problem-in-hol-2208.06642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-formalization-of-the-heat-conduction-problem-in-hol-2208.06642"/></url>
<url><loc>https://scifaro.com/en/abs/automated-conversion-of-axiomatic-to-operational-models-theory-and-practice-2208.06733</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-conversion-of-axiomatic-to-operational-models-theory-and-practice-2208.06733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-conversion-of-axiomatic-to-operational-models-theory-and-practice-2208.06733"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-technical-report-2208.07041</loc><lastmod>2022-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-technical-report-2208.07041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-technical-report-2208.07041"/></url>
<url><loc>https://scifaro.com/en/abs/smart-contract-synthesis-modulo-hyperproperties-2208.07180</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smart-contract-synthesis-modulo-hyperproperties-2208.07180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smart-contract-synthesis-modulo-hyperproperties-2208.07180"/></url>
<url><loc>https://scifaro.com/en/abs/exact-separation-logic-extended-version-2208.07200</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-separation-logic-extended-version-2208.07200"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-separation-logic-extended-version-2208.07200"/></url>
<url><loc>https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-conexptime-complete-2208.07577</loc><lastmod>2022-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-conexptime-complete-2208.07577"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/order-invariance-of-two-variable-logic-is-conexptime-complete-2208.07577"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-extended-version-2208.07644</loc><lastmod>2022-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-extended-version-2208.07644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-extended-version-2208.07644"/></url>
<url><loc>https://scifaro.com/en/abs/sat-inspired-higher-order-eliminations-2208.07775</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-inspired-higher-order-eliminations-2208.07775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-inspired-higher-order-eliminations-2208.07775"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-information-extraction-system-for-string-constraints-2208.08806</loc><lastmod>2022-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-information-extraction-system-for-string-constraints-2208.08806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-information-extraction-system-for-string-constraints-2208.08806"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-implementation-of-b-trees-in-isabelle-hol-2208.09066</loc><lastmod>2022-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-implementation-of-b-trees-in-isabelle-hol-2208.09066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-implementation-of-b-trees-in-isabelle-hol-2208.09066"/></url>
<url><loc>https://scifaro.com/en/abs/verification-preserving-inlining-in-automatic-separation-logic-verifiers-extended-version-2208.10456</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-preserving-inlining-in-automatic-separation-logic-verifiers-extended-version-2208.10456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-preserving-inlining-in-automatic-separation-logic-verifiers-extended-version-2208.10456"/></url>
<url><loc>https://scifaro.com/en/abs/regular-languages-defined-by-first-order-formulas-without-quantifier-alternation-2208.10480</loc><lastmod>2022-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-languages-defined-by-first-order-formulas-without-quantifier-alternation-2208.10480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-languages-defined-by-first-order-formulas-without-quantifier-alternation-2208.10480"/></url>
<url><loc>https://scifaro.com/en/abs/backwards-reachability-for-probabilistic-timed-automata-a-replication-report-2208.11928</loc><lastmod>2022-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/backwards-reachability-for-probabilistic-timed-automata-a-replication-report-2208.11928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/backwards-reachability-for-probabilistic-timed-automata-a-replication-report-2208.11928"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-scott-continuity-and-computability-2208.12347</loc><lastmod>2022-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-scott-continuity-and-computability-2208.12347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-scott-continuity-and-computability-2208.12347"/></url>
<url><loc>https://scifaro.com/en/abs/software-performability-analysis-using-fast-parametric-model-checking-2208.12723</loc><lastmod>2022-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/software-performability-analysis-using-fast-parametric-model-checking-2208.12723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/software-performability-analysis-using-fast-parametric-model-checking-2208.12723"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-many-one-reduction-from-the-halting-problem-to-semi-unification-extended-version-2208.13428</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-many-one-reduction-from-the-halting-problem-to-semi-unification-extended-version-2208.13428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-many-one-reduction-from-the-halting-problem-to-semi-unification-extended-version-2208.13428"/></url>
<url><loc>https://scifaro.com/en/abs/the-syntactic-side-of-autonomous-categories-enriched-over-generalised-metric-spaces-2208.14356</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-syntactic-side-of-autonomous-categories-enriched-over-generalised-metric-spaces-2208.14356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-syntactic-side-of-autonomous-categories-enriched-over-generalised-metric-spaces-2208.14356"/></url>
<url><loc>https://scifaro.com/en/abs/explaining-ontology-mediated-query-answers-using-proofs-over-universal-models-technical-report-2208.14381</loc><lastmod>2022-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explaining-ontology-mediated-query-answers-using-proofs-over-universal-models-technical-report-2208.14381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explaining-ontology-mediated-query-answers-using-proofs-over-universal-models-technical-report-2208.14381"/></url>
<url><loc>https://scifaro.com/en/abs/complete-and-tractable-machine-independent-characterizations-of-second-order-polytime-2208.14739</loc><lastmod>2025-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-and-tractable-machine-independent-characterizations-of-second-order-polytime-2208.14739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-and-tractable-machine-independent-characterizations-of-second-order-polytime-2208.14739"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-29th-international-workshop-on-expressiveness-in-concurrency-and-19th-workshop-on-structural-operational-semantics-2208.14777</loc><lastmod>2022-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-29th-international-workshop-on-expressiveness-in-concurrency-and-19th-workshop-on-structural-operational-semantics-2208.14777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-29th-international-workshop-on-expressiveness-in-concurrency-and-19th-workshop-on-structural-operational-semantics-2208.14777"/></url>
<url><loc>https://scifaro.com/en/abs/a-co-algebraic-framework-for-ordered-processes-2209.00634</loc><lastmod>2022-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-co-algebraic-framework-for-ordered-processes-2209.00634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-co-algebraic-framework-for-ordered-processes-2209.00634"/></url>
<url><loc>https://scifaro.com/en/abs/notions-of-parametricity-as-monoidal-models-for-type-theory-2209.01085</loc><lastmod>2022-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notions-of-parametricity-as-monoidal-models-for-type-theory-2209.01085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notions-of-parametricity-as-monoidal-models-for-type-theory-2209.01085"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-theory-of-choreographic-programming-2209.01886</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-theory-of-choreographic-programming-2209.01886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-theory-of-choreographic-programming-2209.01886"/></url>
<url><loc>https://scifaro.com/en/abs/measure-construction-by-extension-in-dependent-type-theory-with-application-to-integration-2209.02345</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measure-construction-by-extension-in-dependent-type-theory-with-application-to-integration-2209.02345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measure-construction-by-extension-in-dependent-type-theory-with-application-to-integration-2209.02345"/></url>
<url><loc>https://scifaro.com/en/abs/a-generic-type-system-for-higher-order-psi-calculi-2209.02354</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generic-type-system-for-higher-order-psi-calculi-2209.02354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generic-type-system-for-higher-order-psi-calculi-2209.02354"/></url>
<url><loc>https://scifaro.com/en/abs/encodability-and-separation-for-a-reflective-higher-order-calculus-2209.02356</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encodability-and-separation-for-a-reflective-higher-order-calculus-2209.02356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encodability-and-separation-for-a-reflective-higher-order-calculus-2209.02356"/></url>
<url><loc>https://scifaro.com/en/abs/token-multiplicity-in-reversing-petri-nets-under-the-individual-token-interpretation-2209.02359</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/token-multiplicity-in-reversing-petri-nets-under-the-individual-token-interpretation-2209.02359"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/token-multiplicity-in-reversing-petri-nets-under-the-individual-token-interpretation-2209.02359"/></url>
<url><loc>https://scifaro.com/en/abs/finite-cliquewidth-sets-of-existential-rules-toward-a-general-criterion-for-decidable-yet-highly-expressive-querying-2209.02464</loc><lastmod>2022-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-cliquewidth-sets-of-existential-rules-toward-a-general-criterion-for-decidable-yet-highly-expressive-querying-2209.02464"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-cliquewidth-sets-of-existential-rules-toward-a-general-criterion-for-decidable-yet-highly-expressive-querying-2209.02464"/></url>
<url><loc>https://scifaro.com/en/abs/variable-binding-and-substitution-for-nameless-dummies-2209.02614</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-binding-and-substitution-for-nameless-dummies-2209.02614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-binding-and-substitution-for-nameless-dummies-2209.02614"/></url>
<url><loc>https://scifaro.com/en/abs/learning-interpretable-temporal-properties-from-positive-examples-only-2209.02650</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-interpretable-temporal-properties-from-positive-examples-only-2209.02650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-interpretable-temporal-properties-from-positive-examples-only-2209.02650"/></url>
<url><loc>https://scifaro.com/en/abs/separators-in-continuous-petri-nets-2209.02767</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separators-in-continuous-petri-nets-2209.02767"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separators-in-continuous-petri-nets-2209.02767"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-probability-raising-causality-in-markov-decision-processes-2209.02973</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-probability-raising-causality-in-markov-decision-processes-2209.02973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-probability-raising-causality-in-markov-decision-processes-2209.02973"/></url>
<url><loc>https://scifaro.com/en/abs/avoiding-pragmatic-oddity-a-bottom-up-defeasible-deontic-logic-2209.04553</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/avoiding-pragmatic-oddity-a-bottom-up-defeasible-deontic-logic-2209.04553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/avoiding-pragmatic-oddity-a-bottom-up-defeasible-deontic-logic-2209.04553"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-and-expressive-power-of-second-order-extended-logic-2209.04837</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-and-expressive-power-of-second-order-extended-logic-2209.04837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-and-expressive-power-of-second-order-extended-logic-2209.04837"/></url>
<url><loc>https://scifaro.com/en/abs/on-using-verifast-vercors-plural-and-key-to-check-object-usage-2209.05136</loc><lastmod>2023-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-using-verifast-vercors-plural-and-key-to-check-object-usage-2209.05136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-using-verifast-vercors-plural-and-key-to-check-object-usage-2209.05136"/></url>
<url><loc>https://scifaro.com/en/abs/proof-stitch-proof-combination-for-divide-and-conquer-sat-solvers-2209.05201</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-stitch-proof-combination-for-divide-and-conquer-sat-solvers-2209.05201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-stitch-proof-combination-for-divide-and-conquer-sat-solvers-2209.05201"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-respecting-duration-and-causality-for-the-non-interleaving-applied-pi-calculus-2209.05231</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-respecting-duration-and-causality-for-the-non-interleaving-applied-pi-calculus-2209.05231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-respecting-duration-and-causality-for-the-non-interleaving-applied-pi-calculus-2209.05231"/></url>
<url><loc>https://scifaro.com/en/abs/from-ccs-to-csp-the-m-among-n-synchronisation-approach-2209.05232</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-ccs-to-csp-the-m-among-n-synchronisation-approach-2209.05232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-ccs-to-csp-the-m-among-n-synchronisation-approach-2209.05232"/></url>
<url><loc>https://scifaro.com/en/abs/a-bunch-of-sessions-a-propositions-as-sessions-interpretation-of-bunched-implications-in-channel-based-concurrency-2209.05421</loc><lastmod>2022-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bunch-of-sessions-a-propositions-as-sessions-interpretation-of-bunched-implications-in-channel-based-concurrency-2209.05421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bunch-of-sessions-a-propositions-as-sessions-interpretation-of-bunched-implications-in-channel-based-concurrency-2209.05421"/></url>
<url><loc>https://scifaro.com/en/abs/ruleformer-context-aware-differentiable-rule-mining-over-knowledge-graph-2209.05815</loc><lastmod>2022-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ruleformer-context-aware-differentiable-rule-mining-over-knowledge-graph-2209.05815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ruleformer-context-aware-differentiable-rule-mining-over-knowledge-graph-2209.05815"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-for-unbounded-client-server-systems-2209.05879</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-for-unbounded-client-server-systems-2209.05879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-for-unbounded-client-server-systems-2209.05879"/></url>
<url><loc>https://scifaro.com/en/abs/inputs-outputs-and-composition-in-the-logic-of-information-flows-2209.06448</loc><lastmod>2022-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inputs-outputs-and-composition-in-the-logic-of-information-flows-2209.06448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inputs-outputs-and-composition-in-the-logic-of-information-flows-2209.06448"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-2209.06819</loc><lastmod>2022-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-2209.06819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressiveness-of-mixed-choice-sessions-2209.06819"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-2209.06820</loc><lastmod>2022-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-2209.06820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-functional-sessions-cyclic-and-concurrent-2209.06820"/></url>
<url><loc>https://scifaro.com/en/abs/set-theory-in-the-foundation-of-math-internal-classes-and-external-sets-2209.07497</loc><lastmod>2026-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-theory-in-the-foundation-of-math-internal-classes-and-external-sets-2209.07497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-theory-in-the-foundation-of-math-internal-classes-and-external-sets-2209.07497"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iii-the-complexity-of-bv-and-pomset-logic-2209.07825</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iii-the-complexity-of-bv-and-pomset-logic-2209.07825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-of-interaction-and-structure-iii-the-complexity-of-bv-and-pomset-logic-2209.07825"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-order-completeness-result-about-characteristic-boolean-algebras-in-classical-realizability-2209.08838</loc><lastmod>2022-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-order-completeness-result-about-characteristic-boolean-algebras-in-classical-realizability-2209.08838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-order-completeness-result-about-characteristic-boolean-algebras-in-classical-realizability-2209.08838"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-sixth-working-formal-methods-symposium-2209.09208</loc><lastmod>2022-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-working-formal-methods-symposium-2209.09208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-working-formal-methods-symposium-2209.09208"/></url>
<url><loc>https://scifaro.com/en/abs/correctness-of-broadcast-via-multicast-graphically-and-formally-2209.09472</loc><lastmod>2022-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctness-of-broadcast-via-multicast-graphically-and-formally-2209.09472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctness-of-broadcast-via-multicast-graphically-and-formally-2209.09472"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-inductive-invariants-as-barrier-certificates-synthesis-via-difference-of-convex-programming-2209.09703</loc><lastmod>2022-09-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-inductive-invariants-as-barrier-certificates-synthesis-via-difference-of-convex-programming-2209.09703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-inductive-invariants-as-barrier-certificates-synthesis-via-difference-of-convex-programming-2209.09703"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existential-fragments-of-local-first-order-logics-with-data-2209.10309</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existential-fragments-of-local-first-order-logics-with-data-2209.10309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existential-fragments-of-local-first-order-logics-with-data-2209.10309"/></url>
<url><loc>https://scifaro.com/en/abs/capturing-bisimulation-invariant-exponential-time-complexity-classes-2209.10311</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/capturing-bisimulation-invariant-exponential-time-complexity-classes-2209.10311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/capturing-bisimulation-invariant-exponential-time-complexity-classes-2209.10311"/></url>
<url><loc>https://scifaro.com/en/abs/parametric-interval-temporal-logic-over-infinite-words-2209.10316</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametric-interval-temporal-logic-over-infinite-words-2209.10316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametric-interval-temporal-logic-over-infinite-words-2209.10316"/></url>
<url><loc>https://scifaro.com/en/abs/cryptosolve-towards-a-tool-for-the-symbolic-analysis-of-cryptographic-algorithms-2209.10321</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cryptosolve-towards-a-tool-for-the-symbolic-analysis-of-cryptographic-algorithms-2209.10321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cryptosolve-towards-a-tool-for-the-symbolic-analysis-of-cryptographic-algorithms-2209.10321"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-through-translations-for-modal-logic-with-recursion-2209.10377</loc><lastmod>2022-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-through-translations-for-modal-logic-with-recursion-2209.10377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-through-translations-for-modal-logic-with-recursion-2209.10377"/></url>
<url><loc>https://scifaro.com/en/abs/on-probabilistic-omega-pushdown-systems-and-omega-probabilistic-computational-tree-logic-2209.10517</loc><lastmod>2026-04-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-probabilistic-omega-pushdown-systems-and-omega-probabilistic-computational-tree-logic-2209.10517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-probabilistic-omega-pushdown-systems-and-omega-probabilistic-computational-tree-logic-2209.10517"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-kozen-tiuryn-logic-into-residuated-one-sorted-kleene-algebra-with-tests-2209.10610</loc><lastmod>2022-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-kozen-tiuryn-logic-into-residuated-one-sorted-kleene-algebra-with-tests-2209.10610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-kozen-tiuryn-logic-into-residuated-one-sorted-kleene-algebra-with-tests-2209.10610"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-complete-algorithm-for-real-quantifier-elimination-in-isabelle-hol-2209.10978</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-complete-algorithm-for-real-quantifier-elimination-in-isabelle-hol-2209.10978"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-complete-algorithm-for-real-quantifier-elimination-in-isabelle-hol-2209.10978"/></url>
<url><loc>https://scifaro.com/en/abs/answer-set-programs-for-repair-updates-and-counterfactual-interventions-2209.12110</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answer-set-programs-for-repair-updates-and-counterfactual-interventions-2209.12110"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answer-set-programs-for-repair-updates-and-counterfactual-interventions-2209.12110"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-functions-over-the-integers-computable-in-polynomial-time-using-discrete-differential-equations-2209.12168</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-functions-over-the-integers-computable-in-polynomial-time-using-discrete-differential-equations-2209.12168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-functions-over-the-integers-computable-in-polynomial-time-using-discrete-differential-equations-2209.12168"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-parity-reasoning-efficiently-using-pseudo-boolean-proofs-2209.12185</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-parity-reasoning-efficiently-using-pseudo-boolean-proofs-2209.12185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-parity-reasoning-efficiently-using-pseudo-boolean-proofs-2209.12185"/></url>
<url><loc>https://scifaro.com/en/abs/milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-is-complete-crystallization-near-collapsing-process-graph-interpretations-of-regular-expressions-2209.12188</loc><lastmod>2022-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-is-complete-crystallization-near-collapsing-process-graph-interpretations-of-regular-expressions-2209.12188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/milner-s-proof-system-for-regular-expressions-modulo-bisimilarity-is-complete-crystallization-near-collapsing-process-graph-interpretations-of-regular-expressions-2209.12188"/></url>
<url><loc>https://scifaro.com/en/abs/generating-compressed-combinatory-proof-structures-an-approach-to-automated-first-order-theorem-proving-2209.12592</loc><lastmod>2022-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-compressed-combinatory-proof-structures-an-approach-to-automated-first-order-theorem-proving-2209.12592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-compressed-combinatory-proof-structures-an-approach-to-automated-first-order-theorem-proving-2209.12592"/></url>
<url><loc>https://scifaro.com/en/abs/truth-and-preferences-a-game-approach-for-qualitative-choice-logic-2209.12777</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truth-and-preferences-a-game-approach-for-qualitative-choice-logic-2209.12777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truth-and-preferences-a-game-approach-for-qualitative-choice-logic-2209.12777"/></url>
<url><loc>https://scifaro.com/en/abs/abductive-forgetting-2209.12825</loc><lastmod>2025-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abductive-forgetting-2209.12825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abductive-forgetting-2209.12825"/></url>
<url><loc>https://scifaro.com/en/abs/static-knowledge-vs-dynamic-argumentation-a-dual-theory-based-on-kripke-semantics-2209.13082</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-knowledge-vs-dynamic-argumentation-a-dual-theory-based-on-kripke-semantics-2209.13082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-knowledge-vs-dynamic-argumentation-a-dual-theory-based-on-kripke-semantics-2209.13082"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-formal-methods-for-autonomous-systems-fmas-and-fourth-international-workshop-on-automated-and-verifiable-software-system-development-asyde-2209.13181</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-formal-methods-for-autonomous-systems-fmas-and-fourth-international-workshop-on-automated-and-verifiable-software-system-development-asyde-2209.13181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fourth-international-workshop-on-formal-methods-for-autonomous-systems-fmas-and-fourth-international-workshop-on-automated-and-verifiable-software-system-development-asyde-2209.13181"/></url>
<url><loc>https://scifaro.com/en/abs/structure-in-theorem-proving-analyzing-and-improving-the-isabelle-archive-of-formal-proofs-2209.13305</loc><lastmod>2022-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-in-theorem-proving-analyzing-and-improving-the-isabelle-archive-of-formal-proofs-2209.13305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-in-theorem-proving-analyzing-and-improving-the-isabelle-archive-of-formal-proofs-2209.13305"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-2209.13725</loc><lastmod>2025-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-2209.13725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-2209.13725"/></url>
<url><loc>https://scifaro.com/en/abs/the-isabelle-community-benchmark-2209.13894</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-isabelle-community-benchmark-2209.13894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-isabelle-community-benchmark-2209.13894"/></url>
<url><loc>https://scifaro.com/en/abs/towards-runtime-monitoring-of-complex-system-requirements-for-autonomous-driving-functions-2209.14032</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-runtime-monitoring-of-complex-system-requirements-for-autonomous-driving-functions-2209.14032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-runtime-monitoring-of-complex-system-requirements-for-autonomous-driving-functions-2209.14032"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-digital-highway-code-using-formal-modelling-and-verification-of-timed-automata-2209.14036</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-digital-highway-code-using-formal-modelling-and-verification-of-timed-automata-2209.14036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-digital-highway-code-using-formal-modelling-and-verification-of-timed-automata-2209.14036"/></url>
<url><loc>https://scifaro.com/en/abs/scheduling-of-missions-with-constrained-tasks-for-heterogeneous-robot-systems-2209.14040</loc><lastmod>2022-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scheduling-of-missions-with-constrained-tasks-for-heterogeneous-robot-systems-2209.14040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scheduling-of-missions-with-constrained-tasks-for-heterogeneous-robot-systems-2209.14040"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-verified-tableau-prover-for-a-quantifier-free-fragment-of-set-theory-2209.14133</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-verified-tableau-prover-for-a-quantifier-free-fragment-of-set-theory-2209.14133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-verified-tableau-prover-for-a-quantifier-free-fragment-of-set-theory-2209.14133"/></url>
<url><loc>https://scifaro.com/en/abs/an-inductive-construction-for-many-valued-coalgebraic-modal-logic-2209.14688</loc><lastmod>2022-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-inductive-construction-for-many-valued-coalgebraic-modal-logic-2209.14688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-inductive-construction-for-many-valued-coalgebraic-modal-logic-2209.14688"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-correspondences-between-hybrid-trajectory-semantics-2209.14945</loc><lastmod>2022-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-correspondences-between-hybrid-trajectory-semantics-2209.14945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-correspondences-between-hybrid-trajectory-semantics-2209.14945"/></url>
<url><loc>https://scifaro.com/en/abs/formalized-class-group-computations-and-integral-points-on-mordell-elliptic-curves-2209.15492</loc><lastmod>2022-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalized-class-group-computations-and-integral-points-on-mordell-elliptic-curves-2209.15492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalized-class-group-computations-and-integral-points-on-mordell-elliptic-curves-2209.15492"/></url>
<url><loc>https://scifaro.com/en/abs/executable-first-order-queries-in-the-logic-of-information-flows-2210.00240</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/executable-first-order-queries-in-the-logic-of-information-flows-2210.00240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/executable-first-order-queries-in-the-logic-of-information-flows-2210.00240"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-cyclic-entailment-procedure-in-a-fragment-of-separation-logic-2210.00616</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-cyclic-entailment-procedure-in-a-fragment-of-separation-logic-2210.00616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-cyclic-entailment-procedure-in-a-fragment-of-separation-logic-2210.00616"/></url>
<url><loc>https://scifaro.com/en/abs/relational-models-for-the-lambek-calculus-with-intersection-and-constants-2210.00654</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-models-for-the-lambek-calculus-with-intersection-and-constants-2210.00654"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-models-for-the-lambek-calculus-with-intersection-and-constants-2210.00654"/></url>
<url><loc>https://scifaro.com/en/abs/the-geometry-of-reachability-in-continuous-vector-addition-systems-with-states-2210.00785</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-geometry-of-reachability-in-continuous-vector-addition-systems-with-states-2210.00785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-geometry-of-reachability-in-continuous-vector-addition-systems-with-states-2210.00785"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-for-first-order-modal-logics-via-reachability-rules-2210.00789</loc><lastmod>2023-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-for-first-order-modal-logics-via-reachability-rules-2210.00789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-for-first-order-modal-logics-via-reachability-rules-2210.00789"/></url>
<url><loc>https://scifaro.com/en/abs/uniqueness-of-logical-connectives-in-a-bilateralist-setting-2210.00989</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniqueness-of-logical-connectives-in-a-bilateralist-setting-2210.00989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniqueness-of-logical-connectives-in-a-bilateralist-setting-2210.00989"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-polyadic-boolean-modal-logics-model-checking-and-satisfiability-2210.01034</loc><lastmod>2022-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-polyadic-boolean-modal-logics-model-checking-and-satisfiability-2210.01034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-polyadic-boolean-modal-logics-model-checking-and-satisfiability-2210.01034"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-dominant-strategies-for-liveness-full-version-2210.01660</loc><lastmod>2023-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-dominant-strategies-for-liveness-full-version-2210.01660"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-dominant-strategies-for-liveness-full-version-2210.01660"/></url>
<url><loc>https://scifaro.com/en/abs/gradual-c0-symbolic-execution-for-gradual-verification-2210.02428</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gradual-c0-symbolic-execution-for-gradual-verification-2210.02428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gradual-c0-symbolic-execution-for-gradual-verification-2210.02428"/></url>
<url><loc>https://scifaro.com/en/abs/what-should-a-generic-object-be-2210.04202</loc><lastmod>2023-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-should-a-generic-object-be-2210.04202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-should-a-generic-object-be-2210.04202"/></url>
<url><loc>https://scifaro.com/en/abs/communication-between-agents-in-dynamic-epistemic-logic-2210.04656</loc><lastmod>2022-10-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/communication-between-agents-in-dynamic-epistemic-logic-2210.04656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/communication-between-agents-in-dynamic-epistemic-logic-2210.04656"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-fast-fourier-transform-in-rocq-2210.05225</loc><lastmod>2025-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-fast-fourier-transform-in-rocq-2210.05225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-fast-fourier-transform-in-rocq-2210.05225"/></url>
<url><loc>https://scifaro.com/en/abs/definite-formulae-negation-as-failure-and-the-base-extension-semantics-of-intuitionistic-propositional-logic-2210.05336</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definite-formulae-negation-as-failure-and-the-base-extension-semantics-of-intuitionistic-propositional-logic-2210.05336"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definite-formulae-negation-as-failure-and-the-base-extension-semantics-of-intuitionistic-propositional-logic-2210.05336"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-may-s-theorem-2210.05342</loc><lastmod>2022-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-may-s-theorem-2210.05342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-may-s-theorem-2210.05342"/></url>
<url><loc>https://scifaro.com/en/abs/from-proof-theoretic-validity-to-base-extension-semantics-for-intuitionistic-propositional-logic-2210.05344</loc><lastmod>2024-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-proof-theoretic-validity-to-base-extension-semantics-for-intuitionistic-propositional-logic-2210.05344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-proof-theoretic-validity-to-base-extension-semantics-for-intuitionistic-propositional-logic-2210.05344"/></url>
<url><loc>https://scifaro.com/en/abs/stateful-realizers-for-nonstandard-analysis-2210.05346</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stateful-realizers-for-nonstandard-analysis-2210.05346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stateful-realizers-for-nonstandard-analysis-2210.05346"/></url>
<url><loc>https://scifaro.com/en/abs/semantical-analysis-of-the-logic-of-bunched-implications-2210.05348</loc><lastmod>2022-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantical-analysis-of-the-logic-of-bunched-implications-2210.05348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantical-analysis-of-the-logic-of-bunched-implications-2210.05348"/></url>
<url><loc>https://scifaro.com/en/abs/controlling-unfolding-in-type-theory-2210.05420</loc><lastmod>2025-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/controlling-unfolding-in-type-theory-2210.05420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/controlling-unfolding-in-type-theory-2210.05420"/></url>
<url><loc>https://scifaro.com/en/abs/the-design-and-regulation-of-exchanges-a-formal-approach-2210.05447</loc><lastmod>2022-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-design-and-regulation-of-exchanges-a-formal-approach-2210.05447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-design-and-regulation-of-exchanges-a-formal-approach-2210.05447"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-of-the-generalized-spectra-of-graphs-2210.05482</loc><lastmod>2022-10-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-of-the-generalized-spectra-of-graphs-2210.05482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-of-the-generalized-spectra-of-graphs-2210.05482"/></url>
<url><loc>https://scifaro.com/en/abs/on-monotonicities-of-interval-valued-functions-2210.05602</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-monotonicities-of-interval-valued-functions-2210.05602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-monotonicities-of-interval-valued-functions-2210.05602"/></url>
<url><loc>https://scifaro.com/en/abs/abstract-homogeneity-of-interval-valued-functions-2210.05858</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstract-homogeneity-of-interval-valued-functions-2210.05858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstract-homogeneity-of-interval-valued-functions-2210.05858"/></url>
<url><loc>https://scifaro.com/en/abs/a-language-for-evaluating-derivatives-of-functionals-using-automatic-differentiation-2210.06095</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-language-for-evaluating-derivatives-of-functionals-using-automatic-differentiation-2210.06095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-language-for-evaluating-derivatives-of-functionals-using-automatic-differentiation-2210.06095"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-preservation-of-properties-when-changing-communication-models-2210.06196</loc><lastmod>2022-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-preservation-of-properties-when-changing-communication-models-2210.06196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-preservation-of-properties-when-changing-communication-models-2210.06196"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-with-higher-order-rational-circular-terms-2210.06663</loc><lastmod>2023-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-with-higher-order-rational-circular-terms-2210.06663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-with-higher-order-rational-circular-terms-2210.06663"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-and-completeness-of-sparql-query-containment-solver-specs-2210.07083</loc><lastmod>2022-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-and-completeness-of-sparql-query-containment-solver-specs-2210.07083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-and-completeness-of-sparql-query-containment-solver-specs-2210.07083"/></url>
<url><loc>https://scifaro.com/en/abs/towards-uniform-certification-in-qbf-2210.07085</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-uniform-certification-in-qbf-2210.07085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-uniform-certification-in-qbf-2210.07085"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-black-box-classifier-systems-2210.07161</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-black-box-classifier-systems-2210.07161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-black-box-classifier-systems-2210.07161"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-and-refutations-for-intuitionistic-and-second-order-logic-extended-version-2210.07274</loc><lastmod>2022-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-and-refutations-for-intuitionistic-and-second-order-logic-extended-version-2210.07274"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-and-refutations-for-intuitionistic-and-second-order-logic-extended-version-2210.07274"/></url>
<url><loc>https://scifaro.com/en/abs/positive-hennessy-milner-logic-for-branching-bisimulation-2210.07380</loc><lastmod>2025-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-hennessy-milner-logic-for-branching-bisimulation-2210.07380"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-hennessy-milner-logic-for-branching-bisimulation-2210.07380"/></url>
<url><loc>https://scifaro.com/en/abs/designing-a-general-library-for-convolutions-2210.07693</loc><lastmod>2022-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/designing-a-general-library-for-convolutions-2210.07693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/designing-a-general-library-for-convolutions-2210.07693"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-h-principle-and-sphere-eversion-2210.07746</loc><lastmod>2022-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-h-principle-and-sphere-eversion-2210.07746"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-h-principle-and-sphere-eversion-2210.07746"/></url>
<url><loc>https://scifaro.com/en/abs/witnessed-symmetric-choice-and-interpretations-in-fixed-point-logic-with-counting-2210.07869</loc><lastmod>2026-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/witnessed-symmetric-choice-and-interpretations-in-fixed-point-logic-with-counting-2210.07869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/witnessed-symmetric-choice-and-interpretations-in-fixed-point-logic-with-counting-2210.07869"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-of-formal-choreographic-languages-2210.08223</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-of-formal-choreographic-languages-2210.08223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-of-formal-choreographic-languages-2210.08223"/></url>
<url><loc>https://scifaro.com/en/abs/non-transferability-in-communication-channels-and-tarski-s-truth-theorem-2210.08405</loc><lastmod>2024-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-transferability-in-communication-channels-and-tarski-s-truth-theorem-2210.08405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-transferability-in-communication-channels-and-tarski-s-truth-theorem-2210.08405"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-of-surface-embedded-graphs-2210.08914</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-of-surface-embedded-graphs-2210.08914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-of-surface-embedded-graphs-2210.08914"/></url>
<url><loc>https://scifaro.com/en/abs/contextuality-in-distributed-systems-2210.09476</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contextuality-in-distributed-systems-2210.09476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contextuality-in-distributed-systems-2210.09476"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-reasoning-for-side-effectful-iterators-and-iterator-adapters-2210.09857</loc><lastmod>2022-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-reasoning-for-side-effectful-iterators-and-iterator-adapters-2210.09857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-reasoning-for-side-effectful-iterators-and-iterator-adapters-2210.09857"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-petri-net-mutual-reachability-in-presburger-2210.09931</loc><lastmod>2022-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-petri-net-mutual-reachability-in-presburger-2210.09931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-petri-net-mutual-reachability-in-presburger-2210.09931"/></url>
<url><loc>https://scifaro.com/en/abs/deconstructing-the-calculus-of-relations-with-tape-diagrams-2210.09950</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deconstructing-the-calculus-of-relations-with-tape-diagrams-2210.09950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deconstructing-the-calculus-of-relations-with-tape-diagrams-2210.09950"/></url>
<url><loc>https://scifaro.com/en/abs/comparative-plausibility-in-neighbourhood-models-axiom-systems-and-sequent-calculi-2210.10480</loc><lastmod>2022-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparative-plausibility-in-neighbourhood-models-axiom-systems-and-sequent-calculi-2210.10480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparative-plausibility-in-neighbourhood-models-axiom-systems-and-sequent-calculi-2210.10480"/></url>
<url><loc>https://scifaro.com/en/abs/on-bisimulation-in-absence-of-restriction-2210.10574</loc><lastmod>2022-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bisimulation-in-absence-of-restriction-2210.10574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bisimulation-in-absence-of-restriction-2210.10574"/></url>
<url><loc>https://scifaro.com/en/abs/holbert-reading-writing-proving-and-learning-in-the-browser-2210.11411</loc><lastmod>2022-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/holbert-reading-writing-proving-and-learning-in-the-browser-2210.11411"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/holbert-reading-writing-proving-and-learning-in-the-browser-2210.11411"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-chemical-physics-using-the-lean-theorem-prover-2210.12150</loc><lastmod>2023-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-chemical-physics-using-the-lean-theorem-prover-2210.12150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-chemical-physics-using-the-lean-theorem-prover-2210.12150"/></url>
<url><loc>https://scifaro.com/en/abs/on-tools-for-completeness-of-kleene-algebra-with-hypotheses-2210.13020</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-tools-for-completeness-of-kleene-algebra-with-hypotheses-2210.13020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-tools-for-completeness-of-kleene-algebra-with-hypotheses-2210.13020"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-higher-order-mathematical-operational-semantics-2210.13387</loc><lastmod>2026-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-higher-order-mathematical-operational-semantics-2210.13387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-higher-order-mathematical-operational-semantics-2210.13387"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-inlining-a-compositional-and-context-sensitive-static-analysis-framework-2210.14436</loc><lastmod>2022-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-inlining-a-compositional-and-context-sensitive-static-analysis-framework-2210.14436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-inlining-a-compositional-and-context-sensitive-static-analysis-framework-2210.14436"/></url>
<url><loc>https://scifaro.com/en/abs/existential-definability-over-the-subword-ordering-2210.15642</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-definability-over-the-subword-ordering-2210.15642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-definability-over-the-subword-ordering-2210.15642"/></url>
<url><loc>https://scifaro.com/en/abs/some-remarks-on-counting-propositional-logic-2210.16160</loc><lastmod>2022-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-remarks-on-counting-propositional-logic-2210.16160"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-remarks-on-counting-propositional-logic-2210.16160"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-grammar-logics-via-structural-refinement-2210.17139</loc><lastmod>2025-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-grammar-logics-via-structural-refinement-2210.17139"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-for-intuitionistic-grammar-logics-via-structural-refinement-2210.17139"/></url>
<url><loc>https://scifaro.com/en/abs/hhlpy-practical-verification-of-hybrid-systems-using-hoare-logic-2210.17163</loc><lastmod>2023-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hhlpy-practical-verification-of-hybrid-systems-using-hoare-logic-2210.17163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hhlpy-practical-verification-of-hybrid-systems-using-hoare-logic-2210.17163"/></url>
<url><loc>https://scifaro.com/en/abs/true-concurrency-can-be-easy-2211.00557</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/true-concurrency-can-be-easy-2211.00557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/true-concurrency-can-be-easy-2211.00557"/></url>
<url><loc>https://scifaro.com/en/abs/baxmc-a-cegar-approach-to-max-sat-2211.00973</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/baxmc-a-cegar-approach-to-max-sat-2211.00973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/baxmc-a-cegar-approach-to-max-sat-2211.00973"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-fourth-international-conference-on-applied-category-theory-2211.01102</loc><lastmod>2022-11-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-fourth-international-conference-on-applied-category-theory-2211.01102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-fourth-international-conference-on-applied-category-theory-2211.01102"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-framework-for-modeling-with-stock-and-flow-diagrams-2211.01290</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-framework-for-modeling-with-stock-and-flow-diagrams-2211.01290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-framework-for-modeling-with-stock-and-flow-diagrams-2211.01290"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-to-model-software-development-by-multiple-agents-following-a-common-specification-2211.01341</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-to-model-software-development-by-multiple-agents-following-a-common-specification-2211.01341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-to-model-software-development-by-multiple-agents-following-a-common-specification-2211.01341"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-for-first-order-logic-with-disjoint-paths-predicates-in-proper-minor-closed-graph-classes-2211.01723</loc><lastmod>2024-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-for-first-order-logic-with-disjoint-paths-predicates-in-proper-minor-closed-graph-classes-2211.01723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-for-first-order-logic-with-disjoint-paths-predicates-in-proper-minor-closed-graph-classes-2211.01723"/></url>
<url><loc>https://scifaro.com/en/abs/jacobians-and-gradients-for-cartesian-differential-categories-2211.01835</loc><lastmod>2022-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/jacobians-and-gradients-for-cartesian-differential-categories-2211.01835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/jacobians-and-gradients-for-cartesian-differential-categories-2211.01835"/></url>
<url><loc>https://scifaro.com/en/abs/on-robustness-for-the-skolem-positivity-and-ultimate-positivity-problems-2211.02365</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-robustness-for-the-skolem-positivity-and-ultimate-positivity-problems-2211.02365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-robustness-for-the-skolem-positivity-and-ultimate-positivity-problems-2211.02365"/></url>
<url><loc>https://scifaro.com/en/abs/the-threshold-problem-for-hypergeometric-sequences-with-quadratic-parameters-2211.02447</loc><lastmod>2024-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-threshold-problem-for-hypergeometric-sequences-with-quadratic-parameters-2211.02447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-threshold-problem-for-hypergeometric-sequences-with-quadratic-parameters-2211.02447"/></url>
<url><loc>https://scifaro.com/en/abs/modulo-counting-first-order-logic-on-bounded-expansion-classes-2211.03704</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modulo-counting-first-order-logic-on-bounded-expansion-classes-2211.03704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modulo-counting-first-order-logic-on-bounded-expansion-classes-2211.03704"/></url>
<url><loc>https://scifaro.com/en/abs/when-less-is-more-consequence-finding-in-a-weak-theory-of-arithmetic-2211.04000</loc><lastmod>2022-11-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-less-is-more-consequence-finding-in-a-weak-theory-of-arithmetic-2211.04000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-less-is-more-consequence-finding-in-a-weak-theory-of-arithmetic-2211.04000"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-linear-dynamical-systems-under-floating-point-rounding-2211.04301</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-linear-dynamical-systems-under-floating-point-rounding-2211.04301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-linear-dynamical-systems-under-floating-point-rounding-2211.04301"/></url>
<url><loc>https://scifaro.com/en/abs/finitary-simulation-of-infinitary-beta-reduction-via-taylor-expansion-and-applications-2211.05608</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitary-simulation-of-infinitary-beta-reduction-via-taylor-expansion-and-applications-2211.05608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitary-simulation-of-infinitary-beta-reduction-via-taylor-expansion-and-applications-2211.05608"/></url>
<url><loc>https://scifaro.com/en/abs/translating-proofs-from-an-impredicative-type-system-to-a-predicative-one-2211.05700</loc><lastmod>2022-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-proofs-from-an-impredicative-type-system-to-a-predicative-one-2211.05700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-proofs-from-an-impredicative-type-system-to-a-predicative-one-2211.05700"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-verification-and-strategy-synthesis-for-turn-based-stochastic-games-2211.06141</loc><lastmod>2022-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-verification-and-strategy-synthesis-for-turn-based-stochastic-games-2211.06141"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-verification-and-strategy-synthesis-for-turn-based-stochastic-games-2211.06141"/></url>
<url><loc>https://scifaro.com/en/abs/under-lock-and-key-a-proof-system-for-a-multimodal-logic-2211.06217</loc><lastmod>2023-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/under-lock-and-key-a-proof-system-for-a-multimodal-logic-2211.06217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/under-lock-and-key-a-proof-system-for-a-multimodal-logic-2211.06217"/></url>
<url><loc>https://scifaro.com/en/abs/open-higher-order-logic-long-version-2211.06671</loc><lastmod>2022-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/open-higher-order-logic-long-version-2211.06671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/open-higher-order-logic-long-version-2211.06671"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-verification-with-the-tla-trifecta-tlc-apalache-and-tlaps-2211.07216</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-verification-with-the-tla-trifecta-tlc-apalache-and-tlaps-2211.07216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-verification-with-the-tla-trifecta-tlc-apalache-and-tlaps-2211.07216"/></url>
<url><loc>https://scifaro.com/en/abs/external-univalence-for-second-order-generalized-algebraic-theories-2211.07487</loc><lastmod>2022-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/external-univalence-for-second-order-generalized-algebraic-theories-2211.07487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/external-univalence-for-second-order-generalized-algebraic-theories-2211.07487"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-cheri-c-semantics-for-verification-2211.07511</loc><lastmod>2023-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-cheri-c-semantics-for-verification-2211.07511"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-cheri-c-semantics-for-verification-2211.07511"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-semantics-for-model-comparison-games-for-description-logics-2211.09655</loc><lastmod>2022-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-semantics-for-model-comparison-games-for-description-logics-2211.09655"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-semantics-for-model-comparison-games-for-description-logics-2211.09655"/></url>
<url><loc>https://scifaro.com/en/abs/some-problems-about-co-consonance-of-topological-spaces-2211.10202</loc><lastmod>2022-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-problems-about-co-consonance-of-topological-spaces-2211.10202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-problems-about-co-consonance-of-topological-spaces-2211.10202"/></url>
<url><loc>https://scifaro.com/en/abs/local-search-for-satisfiability-modulo-integer-arithmetic-theories-2211.10219</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-search-for-satisfiability-modulo-integer-arithmetic-theories-2211.10219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-search-for-satisfiability-modulo-integer-arithmetic-theories-2211.10219"/></url>
<url><loc>https://scifaro.com/en/abs/the-internal-operads-of-combinatory-algebras-2211.11118</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-internal-operads-of-combinatory-algebras-2211.11118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-internal-operads-of-combinatory-algebras-2211.11118"/></url>
<url><loc>https://scifaro.com/en/abs/on-extensions-of-quasi-overlap-and-quasi-grouping-functions-defined-on-bounded-lattices-2211.11493</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-extensions-of-quasi-overlap-and-quasi-grouping-functions-defined-on-bounded-lattices-2211.11493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-extensions-of-quasi-overlap-and-quasi-grouping-functions-defined-on-bounded-lattices-2211.11493"/></url>
<url><loc>https://scifaro.com/en/abs/ain-t-no-stopping-us-monitoring-now-2211.11544</loc><lastmod>2022-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ain-t-no-stopping-us-monitoring-now-2211.11544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ain-t-no-stopping-us-monitoring-now-2211.11544"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-early-technical-report-2211.11885</loc><lastmod>2023-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-early-technical-report-2211.11885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-early-technical-report-2211.11885"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-functions-on-final-comodels-of-free-algebraic-theories-2211.11897</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-functions-on-final-comodels-of-free-algebraic-theories-2211.11897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-functions-on-final-comodels-of-free-algebraic-theories-2211.11897"/></url>
<url><loc>https://scifaro.com/en/abs/contract-strengthening-through-constrained-horn-clause-verification-2211.12228</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contract-strengthening-through-constrained-horn-clause-verification-2211.12228"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contract-strengthening-through-constrained-horn-clause-verification-2211.12228"/></url>
<url><loc>https://scifaro.com/en/abs/optirica-towards-an-efficient-optimizing-horn-solver-2211.12229</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optirica-towards-an-efficient-optimizing-horn-solver-2211.12229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optirica-towards-an-efficient-optimizing-horn-solver-2211.12229"/></url>
<url><loc>https://scifaro.com/en/abs/chc-comp-2022-competition-report-2211.12231</loc><lastmod>2022-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chc-comp-2022-competition-report-2211.12231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chc-comp-2022-competition-report-2211.12231"/></url>
<url><loc>https://scifaro.com/en/abs/exponential-separations-using-guarded-extension-variables-2211.12456</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exponential-separations-using-guarded-extension-variables-2211.12456"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exponential-separations-using-guarded-extension-variables-2211.12456"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-diagrammatic-calculus-for-boolean-satisfiability-2211.12629</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-diagrammatic-calculus-for-boolean-satisfiability-2211.12629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-diagrammatic-calculus-for-boolean-satisfiability-2211.12629"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-category-of-c-spaces-2211.12734</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-category-of-c-spaces-2211.12734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-category-of-c-spaces-2211.12734"/></url>
<url><loc>https://scifaro.com/en/abs/a-calculus-for-amortized-expected-runtimes-2211.12923</loc><lastmod>2022-11-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-calculus-for-amortized-expected-runtimes-2211.12923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-calculus-for-amortized-expected-runtimes-2211.12923"/></url>
<url><loc>https://scifaro.com/en/abs/the-functional-machine-calculus-ii-semantics-2211.13140</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-functional-machine-calculus-ii-semantics-2211.13140"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-functional-machine-calculus-ii-semantics-2211.13140"/></url>
<url><loc>https://scifaro.com/en/abs/impure-simplicial-complexes-complete-axiomatization-2211.13543</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/impure-simplicial-complexes-complete-axiomatization-2211.13543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/impure-simplicial-complexes-complete-axiomatization-2211.13543"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-safety-and-cosafety-fragments-of-linear-temporal-logic-2211.14913</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-safety-and-cosafety-fragments-of-linear-temporal-logic-2211.14913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-safety-and-cosafety-fragments-of-linear-temporal-logic-2211.14913"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-query-satisfiability-of-constrained-horn-clauses-2211.15207</loc><lastmod>2024-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-query-satisfiability-of-constrained-horn-clauses-2211.15207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-query-satisfiability-of-constrained-horn-clauses-2211.15207"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-answer-enumeration-in-description-logics-with-functional-roles-extended-version-2211.15248</loc><lastmod>2022-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-answer-enumeration-in-description-logics-with-functional-roles-extended-version-2211.15248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-answer-enumeration-in-description-logics-with-functional-roles-extended-version-2211.15248"/></url>
<url><loc>https://scifaro.com/en/abs/flexible-correct-by-construction-programming-2211.15261</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flexible-correct-by-construction-programming-2211.15261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flexible-correct-by-construction-programming-2211.15261"/></url>
<url><loc>https://scifaro.com/en/abs/branch-well-structured-transition-systems-and-extensions-2211.15913</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branch-well-structured-transition-systems-and-extensions-2211.15913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branch-well-structured-transition-systems-and-extensions-2211.15913"/></url>
<url><loc>https://scifaro.com/en/abs/non-uniform-complexity-via-non-wellfounded-proofs-2211.16104</loc><lastmod>2022-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-uniform-complexity-via-non-wellfounded-proofs-2211.16104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-uniform-complexity-via-non-wellfounded-proofs-2211.16104"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-promises-in-weak-memory-models-with-event-structures-extended-version-2211.16330</loc><lastmod>2022-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-promises-in-weak-memory-models-with-event-structures-extended-version-2211.16330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-promises-in-weak-memory-models-with-event-structures-extended-version-2211.16330"/></url>
<url><loc>https://scifaro.com/en/abs/a-finite-axiomatisation-of-finite-state-automata-using-string-diagrams-2211.16484</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-axiomatisation-of-finite-state-automata-using-string-diagrams-2211.16484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-axiomatisation-of-finite-state-automata-using-string-diagrams-2211.16484"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-arithmetic-temporal-properties-on-finite-traces-2211.17166</loc><lastmod>2022-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-arithmetic-temporal-properties-on-finite-traces-2211.17166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-arithmetic-temporal-properties-on-finite-traces-2211.17166"/></url>
<url><loc>https://scifaro.com/en/abs/linear-rank-intersection-types-2211.17186</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-rank-intersection-types-2211.17186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-rank-intersection-types-2211.17186"/></url>
<url><loc>https://scifaro.com/en/abs/learning-temporal-logic-properties-an-overview-of-two-recent-methods-2212.00916</loc><lastmod>2022-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-temporal-logic-properties-an-overview-of-two-recent-methods-2212.00916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-temporal-logic-properties-an-overview-of-two-recent-methods-2212.00916"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-tree-width-and-path-width-of-conjunctive-regular-path-queries-2212.01679</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-tree-width-and-path-width-of-conjunctive-regular-path-queries-2212.01679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-tree-width-and-path-width-of-conjunctive-regular-path-queries-2212.01679"/></url>
<url><loc>https://scifaro.com/en/abs/differential-testing-of-a-verification-framework-for-compiler-optimizations-experience-paper-2212.01748</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/differential-testing-of-a-verification-framework-for-compiler-optimizations-experience-paper-2212.01748"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/differential-testing-of-a-verification-framework-for-compiler-optimizations-experience-paper-2212.01748"/></url>
<url><loc>https://scifaro.com/en/abs/word-equations-in-synergy-with-regular-constraints-technical-report-2212.02317</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/word-equations-in-synergy-with-regular-constraints-technical-report-2212.02317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/word-equations-in-synergy-with-regular-constraints-technical-report-2212.02317"/></url>
<url><loc>https://scifaro.com/en/abs/integration-in-cones-2212.02371</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integration-in-cones-2212.02371"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integration-in-cones-2212.02371"/></url>
<url><loc>https://scifaro.com/en/abs/leroy-and-blazy-were-right-their-memory-model-soundness-proof-is-automatable-extended-version-2212.02425</loc><lastmod>2022-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leroy-and-blazy-were-right-their-memory-model-soundness-proof-is-automatable-extended-version-2212.02425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leroy-and-blazy-were-right-their-memory-model-soundness-proof-is-automatable-extended-version-2212.02425"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-of-eval-readback-and-eval-apply-big-step-evaluators-by-structuring-the-lambda-calculus-s-strategy-space-2212.02494</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-of-eval-readback-and-eval-apply-big-step-evaluators-by-structuring-the-lambda-calculus-s-strategy-space-2212.02494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-of-eval-readback-and-eval-apply-big-step-evaluators-by-structuring-the-lambda-calculus-s-strategy-space-2212.02494"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-nested-relational-queries-from-implicit-specifications-via-model-theory-and-via-proof-theory-2212.03085</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-nested-relational-queries-from-implicit-specifications-via-model-theory-and-via-proof-theory-2212.03085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-nested-relational-queries-from-implicit-specifications-via-model-theory-and-via-proof-theory-2212.03085"/></url>
<url><loc>https://scifaro.com/en/abs/univalent-monoidal-categories-2212.03146</loc><lastmod>2023-08-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/univalent-monoidal-categories-2212.03146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/univalent-monoidal-categories-2212.03146"/></url>
<url><loc>https://scifaro.com/en/abs/type-theory-with-explicit-universe-polymorphism-revised-and-extended-version-2212.03284</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theory-with-explicit-universe-polymorphism-revised-and-extended-version-2212.03284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theory-with-explicit-universe-polymorphism-revised-and-extended-version-2212.03284"/></url>
<url><loc>https://scifaro.com/en/abs/verifire-verifying-an-industrial-learning-based-wildfire-detection-system-2212.03287</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifire-verifying-an-industrial-learning-based-wildfire-detection-system-2212.03287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifire-verifying-an-industrial-learning-based-wildfire-detection-system-2212.03287"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modeling-and-analysis-of-legal-contracts-using-contractcheck-2212.03349</loc><lastmod>2022-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modeling-and-analysis-of-legal-contracts-using-contractcheck-2212.03349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modeling-and-analysis-of-legal-contracts-using-contractcheck-2212.03349"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-of-shacl-features-and-extensions-for-full-equality-and-disjointness-tests-2212.03553</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-of-shacl-features-and-extensions-for-full-equality-and-disjointness-tests-2212.03553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-of-shacl-features-and-extensions-for-full-equality-and-disjointness-tests-2212.03553"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-decidable-bounded-quantification-via-dinaturality-2212.04882</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-decidable-bounded-quantification-via-dinaturality-2212.04882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-decidable-bounded-quantification-via-dinaturality-2212.04882"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fair-termination-of-client-server-sessions-2212.05457</loc><lastmod>2022-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fair-termination-of-client-server-sessions-2212.05457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fair-termination-of-client-server-sessions-2212.05457"/></url>
<url><loc>https://scifaro.com/en/abs/mcmini-a-programmable-dpor-based-model-checker-for-multithreaded-programs-2212.05468</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcmini-a-programmable-dpor-based-model-checker-for-multithreaded-programs-2212.05468"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcmini-a-programmable-dpor-based-model-checker-for-multithreaded-programs-2212.05468"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-doob-s-martingale-convergence-theorems-in-mathlib-2212.05578</loc><lastmod>2022-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-doob-s-martingale-convergence-theorems-in-mathlib-2212.05578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-doob-s-martingale-convergence-theorems-in-mathlib-2212.05578"/></url>
<url><loc>https://scifaro.com/en/abs/deontic-paradoxes-in-library-lending-regulations-a-case-study-in-flint-2212.05893</loc><lastmod>2022-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deontic-paradoxes-in-library-lending-regulations-a-case-study-in-flint-2212.05893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deontic-paradoxes-in-library-lending-regulations-a-case-study-in-flint-2212.05893"/></url>
<url><loc>https://scifaro.com/en/abs/data-layout-from-a-type-theoretic-perspective-2212.06321</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-layout-from-a-type-theoretic-perspective-2212.06321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-layout-from-a-type-theoretic-perspective-2212.06321"/></url>
<url><loc>https://scifaro.com/en/abs/smt-sampling-via-model-guided-approximation-2212.06472</loc><lastmod>2022-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-sampling-via-model-guided-approximation-2212.06472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-sampling-via-model-guided-approximation-2212.06472"/></url>
<url><loc>https://scifaro.com/en/abs/a-programming-language-characterizing-quantum-polynomial-time-2212.06656</loc><lastmod>2025-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-programming-language-characterizing-quantum-polynomial-time-2212.06656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-programming-language-characterizing-quantum-polynomial-time-2212.06656"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-and-validation-of-power-electronics-converter-systems-using-coloured-petri-nets-2212.06781</loc><lastmod>2022-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-and-validation-of-power-electronics-converter-systems-using-coloured-petri-nets-2212.06781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-and-validation-of-power-electronics-converter-systems-using-coloured-petri-nets-2212.06781"/></url>
<url><loc>https://scifaro.com/en/abs/unfoldings-and-coverings-of-weighted-graphs-2212.07205</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unfoldings-and-coverings-of-weighted-graphs-2212.07205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unfoldings-and-coverings-of-weighted-graphs-2212.07205"/></url>
<url><loc>https://scifaro.com/en/abs/bi-invariance-for-uniform-strategies-on-event-structures-2212.07976</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bi-invariance-for-uniform-strategies-on-event-structures-2212.07976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bi-invariance-for-uniform-strategies-on-event-structures-2212.07976"/></url>
<url><loc>https://scifaro.com/en/abs/the-formal-theory-of-monads-univalently-2212.08515</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-formal-theory-of-monads-univalently-2212.08515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-formal-theory-of-monads-univalently-2212.08515"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-the-infinite-chase-2212.08522</loc><lastmod>2022-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-the-infinite-chase-2212.08522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-the-infinite-chase-2212.08522"/></url>
<url><loc>https://scifaro.com/en/abs/just-testing-2212.08829</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/just-testing-2212.08829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/just-testing-2212.08829"/></url>
<url><loc>https://scifaro.com/en/abs/sufficient-statistics-and-split-idempotents-in-discrete-probability-theory-2212.09191</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sufficient-statistics-and-split-idempotents-in-discrete-probability-theory-2212.09191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sufficient-statistics-and-split-idempotents-in-discrete-probability-theory-2212.09191"/></url>
<url><loc>https://scifaro.com/en/abs/dealing-with-observability-in-interaction-based-offline-runtime-verification-of-distributed-systems-2212.09324</loc><lastmod>2022-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dealing-with-observability-in-interaction-based-offline-runtime-verification-of-distributed-systems-2212.09324"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dealing-with-observability-in-interaction-based-offline-runtime-verification-of-distributed-systems-2212.09324"/></url>
<url><loc>https://scifaro.com/en/abs/solving-quantified-modal-logic-problems-by-translation-to-classical-logics-2212.09570</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-quantified-modal-logic-problems-by-translation-to-classical-logics-2212.09570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-quantified-modal-logic-problems-by-translation-to-classical-logics-2212.09570"/></url>
<url><loc>https://scifaro.com/en/abs/making-relational-hoare-logic-alignment-complete-2212.10338</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-relational-hoare-logic-alignment-complete-2212.10338"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-relational-hoare-logic-alignment-complete-2212.10338"/></url>
<url><loc>https://scifaro.com/en/abs/pragmatic-isomorphism-proofs-between-coq-representations-application-to-lambda-term-families-2212.10453</loc><lastmod>2022-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pragmatic-isomorphism-proofs-between-coq-representations-application-to-lambda-term-families-2212.10453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pragmatic-isomorphism-proofs-between-coq-representations-application-to-lambda-term-families-2212.10453"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-thirteenth-international-workshop-on-graph-computation-models-2212.10975</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-thirteenth-international-workshop-on-graph-computation-models-2212.10975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-thirteenth-international-workshop-on-graph-computation-models-2212.10975"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-satisfiability-checking-for-arithmetic-mu-calculi-2212.11055</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-satisfiability-checking-for-arithmetic-mu-calculi-2212.11055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-satisfiability-checking-for-arithmetic-mu-calculi-2212.11055"/></url>
<url><loc>https://scifaro.com/en/abs/extended-addressing-machines-for-pcf-with-explicit-substitutions-2212.11147</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-addressing-machines-for-pcf-with-explicit-substitutions-2212.11147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-addressing-machines-for-pcf-with-explicit-substitutions-2212.11147"/></url>
<url><loc>https://scifaro.com/en/abs/template-based-conjecturing-for-automated-induction-in-isabelle-hol-2212.11151</loc><lastmod>2023-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/template-based-conjecturing-for-automated-induction-in-isabelle-hol-2212.11151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/template-based-conjecturing-for-automated-induction-in-isabelle-hol-2212.11151"/></url>
<url><loc>https://scifaro.com/en/abs/robtl-a-temporal-logic-for-the-robustness-of-cyber-physical-systems-2212.11158</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robtl-a-temporal-logic-for-the-robustness-of-cyber-physical-systems-2212.11158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robtl-a-temporal-logic-for-the-robustness-of-cyber-physical-systems-2212.11158"/></url>
<url><loc>https://scifaro.com/en/abs/python-client-for-isabelle-server-2212.11173</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/python-client-for-isabelle-server-2212.11173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/python-client-for-isabelle-server-2212.11173"/></url>
<url><loc>https://scifaro.com/en/abs/fair-must-testing-for-i-o-automata-2212.11248</loc><lastmod>2022-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fair-must-testing-for-i-o-automata-2212.11248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fair-must-testing-for-i-o-automata-2212.11248"/></url>
<url><loc>https://scifaro.com/en/abs/tighter-bounds-for-query-answering-with-guarded-tgds-2212.11362</loc><lastmod>2026-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tighter-bounds-for-query-answering-with-guarded-tgds-2212.11362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tighter-bounds-for-query-answering-with-guarded-tgds-2212.11362"/></url>
<url><loc>https://scifaro.com/en/abs/towards-mechanised-proofs-in-double-pushout-graph-transformation-2212.11630</loc><lastmod>2022-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-mechanised-proofs-in-double-pushout-graph-transformation-2212.11630"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-mechanised-proofs-in-double-pushout-graph-transformation-2212.11630"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-growth-rate-of-polyregular-functions-2212.11631</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-growth-rate-of-polyregular-functions-2212.11631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-growth-rate-of-polyregular-functions-2212.11631"/></url>
<url><loc>https://scifaro.com/en/abs/sum-and-tensor-of-quantitative-effects-2212.11784</loc><lastmod>2024-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sum-and-tensor-of-quantitative-effects-2212.11784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sum-and-tensor-of-quantitative-effects-2212.11784"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-automating-vehicle-soa-threat-analysis-using-a-model-based-methodology-2212.12347</loc><lastmod>2022-12-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-automating-vehicle-soa-threat-analysis-using-a-model-based-methodology-2212.12347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-automating-vehicle-soa-threat-analysis-using-a-model-based-methodology-2212.12347"/></url>
<url><loc>https://scifaro.com/en/abs/decoupled-fitness-criteria-for-reactive-systems-2212.12455</loc><lastmod>2023-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decoupled-fitness-criteria-for-reactive-systems-2212.12455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decoupled-fitness-criteria-for-reactive-systems-2212.12455"/></url>
<url><loc>https://scifaro.com/en/abs/modular-formal-verification-of-rust-programs-with-unsafe-blocks-2212.12976</loc><lastmod>2022-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-formal-verification-of-rust-programs-with-unsafe-blocks-2212.12976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-formal-verification-of-rust-programs-with-unsafe-blocks-2212.12976"/></url>
<url><loc>https://scifaro.com/en/abs/monoidal-width-2212.13229</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoidal-width-2212.13229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoidal-width-2212.13229"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-c-programs-with-verifast-2212.13754</loc><lastmod>2022-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-c-programs-with-verifast-2212.13754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-c-programs-with-verifast-2212.13754"/></url>
<url><loc>https://scifaro.com/en/abs/modular-termination-verification-with-a-higher-order-concurrent-separation-logic-intermediate-report-2212.14126</loc><lastmod>2023-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-termination-verification-with-a-higher-order-concurrent-separation-logic-intermediate-report-2212.14126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-termination-verification-with-a-higher-order-concurrent-separation-logic-intermediate-report-2212.14126"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-streams-in-monoidal-categories-2212.14494</loc><lastmod>2025-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-streams-in-monoidal-categories-2212.14494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-streams-in-monoidal-categories-2212.14494"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-recursors-as-epi-recursors-extended-technical-report-2301.00894</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-recursors-as-epi-recursors-extended-technical-report-2301.00894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-recursors-as-epi-recursors-extended-technical-report-2301.00894"/></url>
<url><loc>https://scifaro.com/en/abs/correct-by-design-teamwork-plans-for-multi-agent-systems-2301.01257</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correct-by-design-teamwork-plans-for-multi-agent-systems-2301.01257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correct-by-design-teamwork-plans-for-multi-agent-systems-2301.01257"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-as-stateful-programs-a-first-order-logic-with-abstract-hoare-triples-and-an-interpretation-into-an-imperative-language-2301.01690</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-as-stateful-programs-a-first-order-logic-with-abstract-hoare-triples-and-an-interpretation-into-an-imperative-language-2301.01690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-as-stateful-programs-a-first-order-logic-with-abstract-hoare-triples-and-an-interpretation-into-an-imperative-language-2301.01690"/></url>
<url><loc>https://scifaro.com/en/abs/defining-logical-systems-via-algebraic-constraints-on-proofs-2301.02125</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/defining-logical-systems-via-algebraic-constraints-on-proofs-2301.02125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/defining-logical-systems-via-algebraic-constraints-on-proofs-2301.02125"/></url>
<url><loc>https://scifaro.com/en/abs/representable-and-diagonally-representable-weakening-relation-algebras-2301.02213</loc><lastmod>2023-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representable-and-diagonally-representable-weakening-relation-algebras-2301.02213"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representable-and-diagonally-representable-weakening-relation-algebras-2301.02213"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theoretic-semantics-and-tactical-proof-2301.02302</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theoretic-semantics-and-tactical-proof-2301.02302"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theoretic-semantics-and-tactical-proof-2301.02302"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-weihrauch-degree-of-the-additive-ramsey-theorem-2301.02833</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-weihrauch-degree-of-the-additive-ramsey-theorem-2301.02833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-weihrauch-degree-of-the-additive-ramsey-theorem-2301.02833"/></url>
<url><loc>https://scifaro.com/en/abs/implementations-of-two-algorithms-for-the-threshold-synthesis-problem-2301.03667</loc><lastmod>2023-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementations-of-two-algorithms-for-the-threshold-synthesis-problem-2301.03667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementations-of-two-algorithms-for-the-threshold-synthesis-problem-2301.03667"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-disproof-of-the-hirsch-conjecture-2301.04060</loc><lastmod>2023-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-disproof-of-the-hirsch-conjecture-2301.04060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-disproof-of-the-hirsch-conjecture-2301.04060"/></url>
<url><loc>https://scifaro.com/en/abs/a-performance-verification-methodology-for-resource-allocation-heuristics-2301.04205</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-performance-verification-methodology-for-resource-allocation-heuristics-2301.04205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-performance-verification-methodology-for-resource-allocation-heuristics-2301.04205"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-net-semantics-up-to-step-net-bisimilarity-2301.04483</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-net-semantics-up-to-step-net-bisimilarity-2301.04483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-net-semantics-up-to-step-net-bisimilarity-2301.04483"/></url>
<url><loc>https://scifaro.com/en/abs/patch-locale-of-a-spectral-locale-in-univalent-type-theory-2301.04728</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/patch-locale-of-a-spectral-locale-in-univalent-type-theory-2301.04728"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/patch-locale-of-a-spectral-locale-in-univalent-type-theory-2301.04728"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-model-management-a-survey-2301.04846</loc><lastmod>2023-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-model-management-a-survey-2301.04846"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-model-management-a-survey-2301.04846"/></url>
<url><loc>https://scifaro.com/en/abs/local-consistency-as-a-reduction-between-constraint-satisfaction-problems-2301.05084</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-consistency-as-a-reduction-between-constraint-satisfaction-problems-2301.05084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-consistency-as-a-reduction-between-constraint-satisfaction-problems-2301.05084"/></url>
<url><loc>https://scifaro.com/en/abs/folding-interpretations-2301.05101</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/folding-interpretations-2301.05101"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/folding-interpretations-2301.05101"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-verification-with-neural-networks-2301.06136</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-verification-with-neural-networks-2301.06136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-verification-with-neural-networks-2301.06136"/></url>
<url><loc>https://scifaro.com/en/abs/shades-of-iteration-from-elgot-to-kleene-2301.06202</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shades-of-iteration-from-elgot-to-kleene-2301.06202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shades-of-iteration-from-elgot-to-kleene-2301.06202"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-loop-conditions-for-bounded-model-checking-hyperproperties-2301.06209</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-loop-conditions-for-bounded-model-checking-hyperproperties-2301.06209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-loop-conditions-for-bounded-model-checking-hyperproperties-2301.06209"/></url>
<url><loc>https://scifaro.com/en/abs/a-separation-logic-for-sequences-in-pointer-programs-and-its-decidability-2301.06237</loc><lastmod>2023-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-separation-logic-for-sequences-in-pointer-programs-and-its-decidability-2301.06237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-separation-logic-for-sequences-in-pointer-programs-and-its-decidability-2301.06237"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-and-branching-bisimilarities-from-generalized-open-maps-2301.07004</loc><lastmod>2023-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-and-branching-bisimilarities-from-generalized-open-maps-2301.07004"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-and-branching-bisimilarities-from-generalized-open-maps-2301.07004"/></url>
<url><loc>https://scifaro.com/en/abs/bounded-model-checking-for-asynchronous-hyperproperties-2301.07208</loc><lastmod>2023-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounded-model-checking-for-asynchronous-hyperproperties-2301.07208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounded-model-checking-for-asynchronous-hyperproperties-2301.07208"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-structural-hardness-of-logic-programs-what-makes-cycles-and-reachability-hard-for-treewidth-2301.07472</loc><lastmod>2023-01-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-structural-hardness-of-logic-programs-what-makes-cycles-and-reachability-hard-for-treewidth-2301.07472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-structural-hardness-of-logic-programs-what-makes-cycles-and-reachability-hard-for-treewidth-2301.07472"/></url>
<url><loc>https://scifaro.com/en/abs/an-automata-based-framework-for-verification-and-bug-hunting-in-quantum-circuits-technical-report-2301.07747</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automata-based-framework-for-verification-and-bug-hunting-in-quantum-circuits-technical-report-2301.07747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automata-based-framework-for-verification-and-bug-hunting-in-quantum-circuits-technical-report-2301.07747"/></url>
<url><loc>https://scifaro.com/en/abs/view-based-axiomatic-reasoning-for-pso-extended-version-2301.07967</loc><lastmod>2023-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/view-based-axiomatic-reasoning-for-pso-extended-version-2301.07967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/view-based-axiomatic-reasoning-for-pso-extended-version-2301.07967"/></url>
<url><loc>https://scifaro.com/en/abs/system-f-mu-omega-with-context-free-session-types-2301.08659</loc><lastmod>2023-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-f-mu-omega-with-context-free-session-types-2301.08659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-f-mu-omega-with-context-free-session-types-2301.08659"/></url>
<url><loc>https://scifaro.com/en/abs/the-umbilical-cord-of-finite-model-theory-2301.09145</loc><lastmod>2023-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-umbilical-cord-of-finite-model-theory-2301.09145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-umbilical-cord-of-finite-model-theory-2301.09145"/></url>
<url><loc>https://scifaro.com/en/abs/verified-reductions-for-optimization-2301.09347</loc><lastmod>2023-02-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-reductions-for-optimization-2301.09347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-reductions-for-optimization-2301.09347"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-reasoning-for-coinductive-types-2301.09802</loc><lastmod>2023-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-reasoning-for-coinductive-types-2301.09802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-reasoning-for-coinductive-types-2301.09802"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-weakest-precondition-transformers-via-a-cps-transformation-2301.09997</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-weakest-precondition-transformers-via-a-cps-transformation-2301.09997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-weakest-precondition-transformers-via-a-cps-transformation-2301.09997"/></url>
<url><loc>https://scifaro.com/en/abs/taming-large-bounds-in-synthesis-from-bounded-liveness-specifications-full-version-2301.10032</loc><lastmod>2023-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-large-bounds-in-synthesis-from-bounded-liveness-specifications-full-version-2301.10032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-large-bounds-in-synthesis-from-bounded-liveness-specifications-full-version-2301.10032"/></url>
<url><loc>https://scifaro.com/en/abs/hyper-hoare-logic-dis-proving-program-hyperproperties-extended-version-2301.10037</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyper-hoare-logic-dis-proving-program-hyperproperties-extended-version-2301.10037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyper-hoare-logic-dis-proving-program-hyperproperties-extended-version-2301.10037"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-probabilistic-couplings-in-higher-order-separation-logic-2301.10061</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-probabilistic-couplings-in-higher-order-separation-logic-2301.10061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-probabilistic-couplings-in-higher-order-separation-logic-2301.10061"/></url>
<url><loc>https://scifaro.com/en/abs/linear-arboreal-categories-2301.10088</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-arboreal-categories-2301.10088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-arboreal-categories-2301.10088"/></url>
<url><loc>https://scifaro.com/en/abs/a-practitioner-s-guide-to-mdp-model-checking-algorithms-2301.10197</loc><lastmod>2023-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practitioner-s-guide-to-mdp-model-checking-algorithms-2301.10197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practitioner-s-guide-to-mdp-model-checking-algorithms-2301.10197"/></url>
<url><loc>https://scifaro.com/en/abs/c-sar-sat-attack-resistant-logic-locking-for-rsfq-circuits-2301.10216</loc><lastmod>2023-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/c-sar-sat-attack-resistant-logic-locking-for-rsfq-circuits-2301.10216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/c-sar-sat-attack-resistant-logic-locking-for-rsfq-circuits-2301.10216"/></url>
<url><loc>https://scifaro.com/en/abs/relation-algebraic-verification-of-disjoint-set-forests-2301.10311</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relation-algebraic-verification-of-disjoint-set-forests-2301.10311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relation-algebraic-verification-of-disjoint-set-forests-2301.10311"/></url>
<url><loc>https://scifaro.com/en/abs/lecture-notes-on-monadic-first-and-second-order-logic-on-strings-2301.10519</loc><lastmod>2023-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lecture-notes-on-monadic-first-and-second-order-logic-on-strings-2301.10519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lecture-notes-on-monadic-first-and-second-order-logic-on-strings-2301.10519"/></url>
<url><loc>https://scifaro.com/en/abs/on-an-ordinary-expansion-of-first-order-belnap-dunn-logic-2301.10555</loc><lastmod>2026-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-an-ordinary-expansion-of-first-order-belnap-dunn-logic-2301.10555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-an-ordinary-expansion-of-first-order-belnap-dunn-logic-2301.10555"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-with-explicit-dependencies-2301.10556</loc><lastmod>2023-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-with-explicit-dependencies-2301.10556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-with-explicit-dependencies-2301.10556"/></url>
<url><loc>https://scifaro.com/en/abs/a-majority-logic-synthesis-framework-for-single-flux-quantum-circuits-2301.10695</loc><lastmod>2023-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-majority-logic-synthesis-framework-for-single-flux-quantum-circuits-2301.10695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-majority-logic-synthesis-framework-for-single-flux-quantum-circuits-2301.10695"/></url>
<url><loc>https://scifaro.com/en/abs/set-theoretic-and-type-theoretic-ordinals-coincide-2301.10696</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-theoretic-and-type-theoretic-ordinals-coincide-2301.10696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-theoretic-and-type-theoretic-ordinals-coincide-2301.10696"/></url>
<url><loc>https://scifaro.com/en/abs/multisets-and-distributions-2301.10812</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multisets-and-distributions-2301.10812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multisets-and-distributions-2301.10812"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-safety-and-liveness-2301.11175</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-safety-and-liveness-2301.11175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-safety-and-liveness-2301.11175"/></url>
<url><loc>https://scifaro.com/en/abs/autohyper-explicit-state-model-checking-for-hyperltl-2301.11229</loc><lastmod>2023-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autohyper-explicit-state-model-checking-for-hyperltl-2301.11229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autohyper-explicit-state-model-checking-for-hyperltl-2301.11229"/></url>
<url><loc>https://scifaro.com/en/abs/robust-almost-sure-reachability-in-multi-environment-mdps-2301.11296</loc><lastmod>2024-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-almost-sure-reachability-in-multi-environment-mdps-2301.11296"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-almost-sure-reachability-in-multi-environment-mdps-2301.11296"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-inference-system-for-skip-free-guarded-kleene-algebra-with-tests-2301.11301</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-inference-system-for-skip-free-guarded-kleene-algebra-with-tests-2301.11301"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-inference-system-for-skip-free-guarded-kleene-algebra-with-tests-2301.11301"/></url>
<url><loc>https://scifaro.com/en/abs/conservative-safety-monitors-of-stochastic-dynamical-systems-2301.11330</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conservative-safety-monitors-of-stochastic-dynamical-systems-2301.11330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conservative-safety-monitors-of-stochastic-dynamical-systems-2301.11330"/></url>
<url><loc>https://scifaro.com/en/abs/stack-aware-hyperproperties-2301.11521</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stack-aware-hyperproperties-2301.11521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stack-aware-hyperproperties-2301.11521"/></url>
<url><loc>https://scifaro.com/en/abs/on-bisimilarity-for-quasi-discrete-closure-spaces-2301.11634</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-bisimilarity-for-quasi-discrete-closure-spaces-2301.11634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-bisimilarity-for-quasi-discrete-closure-spaces-2301.11634"/></url>
<url><loc>https://scifaro.com/en/abs/neural-abstractions-2301.11683</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-abstractions-2301.11683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-abstractions-2301.11683"/></url>
<url><loc>https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2301.11842</loc><lastmod>2026-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2301.11842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalization-for-multimodal-type-theory-2301.11842"/></url>
<url><loc>https://scifaro.com/en/abs/the-cartesian-closed-bicategory-of-thin-spans-of-groupoids-2301.11860</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cartesian-closed-bicategory-of-thin-spans-of-groupoids-2301.11860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cartesian-closed-bicategory-of-thin-spans-of-groupoids-2301.11860"/></url>
<url><loc>https://scifaro.com/en/abs/the-produoidal-algebra-of-process-decomposition-2301.11867</loc><lastmod>2023-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-produoidal-algebra-of-process-decomposition-2301.11867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-produoidal-algebra-of-process-decomposition-2301.11867"/></url>
<url><loc>https://scifaro.com/en/abs/domain-theory-in-constructive-and-predicative-univalent-foundations-2301.12405</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-theory-in-constructive-and-predicative-univalent-foundations-2301.12405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-theory-in-constructive-and-predicative-univalent-foundations-2301.12405"/></url>
<url><loc>https://scifaro.com/en/abs/profinite-lambda-terms-and-parametricity-2301.12475</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/profinite-lambda-terms-and-parametricity-2301.12475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/profinite-lambda-terms-and-parametricity-2301.12475"/></url>
<url><loc>https://scifaro.com/en/abs/a-log-sensitive-encoding-of-turing-machines-in-the-lambda-calculus-2301.12556</loc><lastmod>2023-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-log-sensitive-encoding-of-turing-machines-in-the-lambda-calculus-2301.12556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-log-sensitive-encoding-of-turing-machines-in-the-lambda-calculus-2301.12556"/></url>
<url><loc>https://scifaro.com/en/abs/a-pbpo-graph-rewriting-tutorial-2301.12912</loc><lastmod>2023-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pbpo-graph-rewriting-tutorial-2301.12912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pbpo-graph-rewriting-tutorial-2301.12912"/></url>
<url><loc>https://scifaro.com/en/abs/an-order-out-of-nowhere-a-new-algorithm-for-infinite-domain-csps-2301.12977</loc><lastmod>2025-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-order-out-of-nowhere-a-new-algorithm-for-infinite-domain-csps-2301.12977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-order-out-of-nowhere-a-new-algorithm-for-infinite-domain-csps-2301.12977"/></url>
<url><loc>https://scifaro.com/en/abs/evidential-decision-theory-via-partial-markov-categories-2301.12989</loc><lastmod>2025-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evidential-decision-theory-via-partial-markov-categories-2301.12989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evidential-decision-theory-via-partial-markov-categories-2301.12989"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-presheaves-are-quasitoposes-2301.13067</loc><lastmod>2023-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-presheaves-are-quasitoposes-2301.13067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-presheaves-are-quasitoposes-2301.13067"/></url>
<url><loc>https://scifaro.com/en/abs/multi-structural-games-and-beyond-2301.13329</loc><lastmod>2025-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-structural-games-and-beyond-2301.13329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-structural-games-and-beyond-2301.13329"/></url>
<url><loc>https://scifaro.com/en/abs/flipper-games-for-monadically-stable-graph-classes-2301.13735</loc><lastmod>2025-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/flipper-games-for-monadically-stable-graph-classes-2301.13735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/flipper-games-for-monadically-stable-graph-classes-2301.13735"/></url>
<url><loc>https://scifaro.com/en/abs/anti-unification-and-generalization-a-survey-2302.00277</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anti-unification-and-generalization-a-survey-2302.00277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anti-unification-and-generalization-a-survey-2302.00277"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalisation-of-gallagher-s-ergodic-theorem-2302.00448</loc><lastmod>2023-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalisation-of-gallagher-s-ergodic-theorem-2302.00448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalisation-of-gallagher-s-ergodic-theorem-2302.00448"/></url>
<url><loc>https://scifaro.com/en/abs/decentralized-stream-runtime-verification-for-timed-asynchronous-networks-2302.00506</loc><lastmod>2023-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decentralized-stream-runtime-verification-for-timed-asynchronous-networks-2302.00506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decentralized-stream-runtime-verification-for-timed-asynchronous-networks-2302.00506"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-complexity-of-weighted-team-definability-2302.00541</loc><lastmod>2023-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-complexity-of-weighted-team-definability-2302.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-complexity-of-weighted-team-definability-2302.00541"/></url>
<url><loc>https://scifaro.com/en/abs/orbit-finite-linear-programming-2302.00802</loc><lastmod>2024-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orbit-finite-linear-programming-2302.00802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orbit-finite-linear-programming-2302.00802"/></url>
<url><loc>https://scifaro.com/en/abs/a-typed-lambda-calculus-for-establishing-trust-in-probabilistic-programs-2302.00958</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-typed-lambda-calculus-for-establishing-trust-in-probabilistic-programs-2302.00958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-typed-lambda-calculus-for-establishing-trust-in-probabilistic-programs-2302.00958"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-linear-loops-under-commutative-updates-2302.01003</loc><lastmod>2023-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-linear-loops-under-commutative-updates-2302.01003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-linear-loops-under-commutative-updates-2302.01003"/></url>
<url><loc>https://scifaro.com/en/abs/from-thin-concurrent-games-to-generalized-species-of-structures-extended-version-2302.01082</loc><lastmod>2025-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-thin-concurrent-games-to-generalized-species-of-structures-extended-version-2302.01082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-thin-concurrent-games-to-generalized-species-of-structures-extended-version-2302.01082"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-logics-for-the-lawvere-quantale-2302.01224</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-logics-for-the-lawvere-quantale-2302.01224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-logics-for-the-lawvere-quantale-2302.01224"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-the-automated-verification-of-algebraic-effects-and-handlers-extended-version-2302.01265</loc><lastmod>2023-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-the-automated-verification-of-algebraic-effects-and-handlers-extended-version-2302.01265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-the-automated-verification-of-algebraic-effects-and-handlers-extended-version-2302.01265"/></url>
<url><loc>https://scifaro.com/en/abs/computational-philosophy-of-science-2302.02105</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-philosophy-of-science-2302.02105"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-philosophy-of-science-2302.02105"/></url>
<url><loc>https://scifaro.com/en/abs/aprove-modular-termination-analysis-of-memory-manipulating-c-programs-2302.02382</loc><lastmod>2025-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aprove-modular-termination-analysis-of-memory-manipulating-c-programs-2302.02382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aprove-modular-termination-analysis-of-memory-manipulating-c-programs-2302.02382"/></url>
<url><loc>https://scifaro.com/en/abs/leveraging-polyhedral-reductions-for-solving-petri-net-reachability-problems-2302.02686</loc><lastmod>2023-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leveraging-polyhedral-reductions-for-solving-petri-net-reachability-problems-2302.02686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leveraging-polyhedral-reductions-for-solving-petri-net-reachability-problems-2302.02686"/></url>
<url><loc>https://scifaro.com/en/abs/rational-functions-via-recursive-schemes-2302.03074</loc><lastmod>2023-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-functions-via-recursive-schemes-2302.03074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-functions-via-recursive-schemes-2302.03074"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-semantics-of-datalog-with-equality-2302.03167</loc><lastmod>2026-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-semantics-of-datalog-with-equality-2302.03167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-semantics-of-datalog-with-equality-2302.03167"/></url>
<url><loc>https://scifaro.com/en/abs/qualitative-uncertainty-and-dynamics-of-argumentation-through-dynamic-logic-2302.03305</loc><lastmod>2023-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qualitative-uncertainty-and-dynamics-of-argumentation-through-dynamic-logic-2302.03305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qualitative-uncertainty-and-dynamics-of-argumentation-through-dynamic-logic-2302.03305"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-model-checking-on-structurally-sparse-graph-classes-2302.03527</loc><lastmod>2023-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-model-checking-on-structurally-sparse-graph-classes-2302.03527"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-model-checking-on-structurally-sparse-graph-classes-2302.03527"/></url>
<url><loc>https://scifaro.com/en/abs/on-discovering-interesting-combinatorial-integer-sequences-2302.04606</loc><lastmod>2023-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-discovering-interesting-combinatorial-integer-sequences-2302.04606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-discovering-interesting-combinatorial-integer-sequences-2302.04606"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-characterizations-of-least-model-and-uniform-equivalence-of-propositional-krom-logic-programs-2302.04664</loc><lastmod>2023-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-characterizations-of-least-model-and-uniform-equivalence-of-propositional-krom-logic-programs-2302.04664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-characterizations-of-least-model-and-uniform-equivalence-of-propositional-krom-logic-programs-2302.04664"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-system-for-a-logic-of-presuppositions-2302.04665</loc><lastmod>2023-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-system-for-a-logic-of-presuppositions-2302.04665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-system-for-a-logic-of-presuppositions-2302.04665"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-equations-in-the-time-warp-algebra-2302.04668</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-equations-in-the-time-warp-algebra-2302.04668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-equations-in-the-time-warp-algebra-2302.04668"/></url>
<url><loc>https://scifaro.com/en/abs/strategies-as-resource-terms-and-their-categorical-semantics-2302.04685</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategies-as-resource-terms-and-their-categorical-semantics-2302.04685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategies-as-resource-terms-and-their-categorical-semantics-2302.04685"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-lattice-of-program-metrics-2302.05022</loc><lastmod>2023-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-lattice-of-program-metrics-2302.05022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-lattice-of-program-metrics-2302.05022"/></url>
<url><loc>https://scifaro.com/en/abs/for-the-metatheory-of-type-theory-internal-sconing-is-enough-2302.05190</loc><lastmod>2023-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/for-the-metatheory-of-type-theory-internal-sconing-is-enough-2302.05190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/for-the-metatheory-of-type-theory-internal-sconing-is-enough-2302.05190"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-automata-on-infinite-data-trees-from-ctl-z-ctl-z-to-decision-procedures-2302.05327</loc><lastmod>2025-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-automata-on-infinite-data-trees-from-ctl-z-ctl-z-to-decision-procedures-2302.05327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-automata-on-infinite-data-trees-from-ctl-z-ctl-z-to-decision-procedures-2302.05327"/></url>
<url><loc>https://scifaro.com/en/abs/languages-with-decidable-learning-a-meta-theorem-2302.05741</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/languages-with-decidable-learning-a-meta-theorem-2302.05741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/languages-with-decidable-learning-a-meta-theorem-2302.05741"/></url>
<url><loc>https://scifaro.com/en/abs/coherence-by-normalization-for-linear-multicategorical-structures-2302.05755</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherence-by-normalization-for-linear-multicategorical-structures-2302.05755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherence-by-normalization-for-linear-multicategorical-structures-2302.05755"/></url>
<url><loc>https://scifaro.com/en/abs/e-unification-for-second-order-abstract-syntax-2302.05815</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/e-unification-for-second-order-abstract-syntax-2302.05815"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/e-unification-for-second-order-abstract-syntax-2302.05815"/></url>
<url><loc>https://scifaro.com/en/abs/scl-fol-revisited-2302.05954</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scl-fol-revisited-2302.05954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scl-fol-revisited-2302.05954"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-possibly-divergent-probabilistic-programs-2302.06082</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-possibly-divergent-probabilistic-programs-2302.06082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-possibly-divergent-probabilistic-programs-2302.06082"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-veracity-2302.06164</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-veracity-2302.06164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-veracity-2302.06164"/></url>
<url><loc>https://scifaro.com/en/abs/from-polynomial-invariants-to-linear-loops-2302.06323</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-polynomial-invariants-to-linear-loops-2302.06323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-polynomial-invariants-to-linear-loops-2302.06323"/></url>
<url><loc>https://scifaro.com/en/abs/right-adjoints-for-datalog-programs-and-homomorphism-dualities-over-restricted-classes-2302.06366</loc><lastmod>2023-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/right-adjoints-for-datalog-programs-and-homomorphism-dualities-over-restricted-classes-2302.06366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/right-adjoints-for-datalog-programs-and-homomorphism-dualities-over-restricted-classes-2302.06366"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-disjoint-paths-logic-on-topological-minor-free-graph-classes-2302.07033</loc><lastmod>2026-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-disjoint-paths-logic-on-topological-minor-free-graph-classes-2302.07033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-disjoint-paths-logic-on-topological-minor-free-graph-classes-2302.07033"/></url>
<url><loc>https://scifaro.com/en/abs/from-atl-to-stit-2302.07332</loc><lastmod>2023-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-atl-to-stit-2302.07332"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-atl-to-stit-2302.07332"/></url>
<url><loc>https://scifaro.com/en/abs/automated-reasoning-for-physical-quantities-units-and-measurements-in-isabelle-hol-2302.07629</loc><lastmod>2023-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-reasoning-for-physical-quantities-units-and-measurements-in-isabelle-hol-2302.07629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-reasoning-for-physical-quantities-units-and-measurements-in-isabelle-hol-2302.07629"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-nondeterministic-quantum-programs-2302.07973</loc><lastmod>2023-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-nondeterministic-quantum-programs-2302.07973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-nondeterministic-quantum-programs-2302.07973"/></url>
<url><loc>https://scifaro.com/en/abs/type-theoretic-signatures-for-algebraic-theories-and-inductive-types-2302.08837</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-theoretic-signatures-for-algebraic-theories-and-inductive-types-2302.08837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-theoretic-signatures-for-algebraic-theories-and-inductive-types-2302.08837"/></url>
<url><loc>https://scifaro.com/en/abs/an-overview-of-recent-developments-in-big-boolean-equations-2302.09118</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-overview-of-recent-developments-in-big-boolean-equations-2302.09118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-overview-of-recent-developments-in-big-boolean-equations-2302.09118"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-algorithm-for-multiplicative-linear-logic-2302.09169</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-algorithm-for-multiplicative-linear-logic-2302.09169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-algorithm-for-multiplicative-linear-logic-2302.09169"/></url>
<url><loc>https://scifaro.com/en/abs/switching-algebraic-calculation-of-banzhaf-voting-indices-2302.09367</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/switching-algebraic-calculation-of-banzhaf-voting-indices-2302.09367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/switching-algebraic-calculation-of-banzhaf-voting-indices-2302.09367"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-modulo-traced-comonoid-structure-2302.09631</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-modulo-traced-comonoid-structure-2302.09631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-modulo-traced-comonoid-structure-2302.09631"/></url>
<url><loc>https://scifaro.com/en/abs/ordinal-measures-of-the-set-of-finite-multisets-2302.09881</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordinal-measures-of-the-set-of-finite-multisets-2302.09881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordinal-measures-of-the-set-of-finite-multisets-2302.09881"/></url>
<url><loc>https://scifaro.com/en/abs/a-modest-proposal-explicit-support-for-foundational-pluralism-2302.10137</loc><lastmod>2023-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modest-proposal-explicit-support-for-foundational-pluralism-2302.10137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modest-proposal-explicit-support-for-foundational-pluralism-2302.10137"/></url>
<url><loc>https://scifaro.com/en/abs/a-deforestation-of-reducts-refocusing-2302.10455</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-deforestation-of-reducts-refocusing-2302.10455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-deforestation-of-reducts-refocusing-2302.10455"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-and-a-fast-interpreter-for-jq-2302.10576</loc><lastmod>2023-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-and-a-fast-interpreter-for-jq-2302.10576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-and-a-fast-interpreter-for-jq-2302.10576"/></url>
<url><loc>https://scifaro.com/en/abs/an-elementary-formal-proof-of-the-group-law-on-weierstrass-elliptic-curves-in-any-characteristic-2302.10640</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-elementary-formal-proof-of-the-group-law-on-weierstrass-elliptic-curves-in-any-characteristic-2302.10640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-elementary-formal-proof-of-the-group-law-on-weierstrass-elliptic-curves-in-any-characteristic-2302.10640"/></url>
<url><loc>https://scifaro.com/en/abs/a-curry-howard-correspondence-for-linear-reversible-computation-2302.11887</loc><lastmod>2025-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-curry-howard-correspondence-for-linear-reversible-computation-2302.11887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-curry-howard-correspondence-for-linear-reversible-computation-2302.11887"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-higher-order-polynomial-interpretations-2302.11892</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-higher-order-polynomial-interpretations-2302.11892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-higher-order-polynomial-interpretations-2302.11892"/></url>
<url><loc>https://scifaro.com/en/abs/arbitrary-partial-communication-2302.12090</loc><lastmod>2023-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arbitrary-partial-communication-2302.12090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arbitrary-partial-communication-2302.12090"/></url>
<url><loc>https://scifaro.com/en/abs/symmetries-of-structures-that-fail-to-interpret-something-finite-2302.12112</loc><lastmod>2023-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetries-of-structures-that-fail-to-interpret-something-finite-2302.12112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetries-of-structures-that-fail-to-interpret-something-finite-2302.12112"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-yoneda-ext-in-univalent-foundations-2302.12678</loc><lastmod>2023-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-yoneda-ext-in-univalent-foundations-2302.12678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-yoneda-ext-in-univalent-foundations-2302.12678"/></url>
<url><loc>https://scifaro.com/en/abs/constraint-optimization-over-semirings-2302.12937</loc><lastmod>2023-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constraint-optimization-over-semirings-2302.12937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constraint-optimization-over-semirings-2302.12937"/></url>
<url><loc>https://scifaro.com/en/abs/strategic-timed-computation-tree-logic-2302.13405</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategic-timed-computation-tree-logic-2302.13405"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategic-timed-computation-tree-logic-2302.13405"/></url>
<url><loc>https://scifaro.com/en/abs/pyreason-software-for-open-world-temporal-logic-2302.13482</loc><lastmod>2023-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pyreason-software-for-open-world-temporal-logic-2302.13482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pyreason-software-for-open-world-temporal-logic-2302.13482"/></url>
<url><loc>https://scifaro.com/en/abs/positivity-hardness-results-on-markov-decision-processes-2302.13675</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positivity-hardness-results-on-markov-decision-processes-2302.13675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positivity-hardness-results-on-markov-decision-processes-2302.13675"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-analysis-of-ranking-2302.13747</loc><lastmod>2023-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-analysis-of-ranking-2302.13747"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-analysis-of-ranking-2302.13747"/></url>
<url><loc>https://scifaro.com/en/abs/forward-ltlf-synthesis-dpll-at-work-2302.13825</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forward-ltlf-synthesis-dpll-at-work-2302.13825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forward-ltlf-synthesis-dpll-at-work-2302.13825"/></url>
<url><loc>https://scifaro.com/en/abs/relating-reversible-petri-nets-and-reversible-event-structures-categorically-2302.14195</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-reversible-petri-nets-and-reversible-event-structures-categorically-2302.14195"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-reversible-petri-nets-and-reversible-event-structures-categorically-2302.14195"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-logic-of-communicating-hybrid-programs-2302.14546</loc><lastmod>2023-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-logic-of-communicating-hybrid-programs-2302.14546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-logic-of-communicating-hybrid-programs-2302.14546"/></url>
<url><loc>https://scifaro.com/en/abs/now-it-compiles-certified-automatic-repair-of-uncompilable-protocols-2302.14622</loc><lastmod>2023-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/now-it-compiles-certified-automatic-repair-of-uncompilable-protocols-2302.14622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/now-it-compiles-certified-automatic-repair-of-uncompilable-protocols-2302.14622"/></url>
<url><loc>https://scifaro.com/en/abs/smpt-a-testbed-for-reachability-methods-in-generalized-petri-nets-2302.14741</loc><lastmod>2023-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smpt-a-testbed-for-reachability-methods-in-generalized-petri-nets-2302.14741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smpt-a-testbed-for-reachability-methods-in-generalized-petri-nets-2302.14741"/></url>
<url><loc>https://scifaro.com/en/abs/computational-expressivity-of-circular-proofs-with-fixed-points-2302.14825</loc><lastmod>2025-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-expressivity-of-circular-proofs-with-fixed-points-2302.14825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-expressivity-of-circular-proofs-with-fixed-points-2302.14825"/></url>
<url><loc>https://scifaro.com/en/abs/formal-and-executable-semantics-of-the-ethereum-virtual-machine-in-dafny-2303.00152</loc><lastmod>2023-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-and-executable-semantics-of-the-ethereum-virtual-machine-in-dafny-2303.00152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-and-executable-semantics-of-the-ethereum-virtual-machine-in-dafny-2303.00152"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-algebra-with-tests-for-weighted-programs-2303.00322</loc><lastmod>2023-03-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-algebra-with-tests-for-weighted-programs-2303.00322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-algebra-with-tests-for-weighted-programs-2303.00322"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-reconfiguration-of-component-based-systems-described-by-propositional-configuration-logic-2303.00794</loc><lastmod>2023-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-reconfiguration-of-component-based-systems-described-by-propositional-configuration-logic-2303.00794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-reconfiguration-of-component-based-systems-described-by-propositional-configuration-logic-2303.00794"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-monograph-transformations-2303.01137</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-monograph-transformations-2303.01137"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-monograph-transformations-2303.01137"/></url>
<url><loc>https://scifaro.com/en/abs/a-symbolic-algorithm-for-the-case-split-rule-in-solving-word-constraints-with-extensions-technical-report-2303.01142</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symbolic-algorithm-for-the-case-split-rule-in-solving-word-constraints-with-extensions-technical-report-2303.01142"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symbolic-algorithm-for-the-case-split-rule-in-solving-word-constraints-with-extensions-technical-report-2303.01142"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-decompositions-in-monadically-stable-and-bounded-shrubdepth-graph-classes-2303.01473</loc><lastmod>2023-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-decompositions-in-monadically-stable-and-bounded-shrubdepth-graph-classes-2303.01473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-decompositions-in-monadically-stable-and-bounded-shrubdepth-graph-classes-2303.01473"/></url>
<url><loc>https://scifaro.com/en/abs/adcl-acceleration-driven-clause-learning-for-constrained-horn-clauses-2303.01827</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adcl-acceleration-driven-clause-learning-for-constrained-horn-clauses-2303.01827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adcl-acceleration-driven-clause-learning-for-constrained-horn-clauses-2303.01827"/></url>
<url><loc>https://scifaro.com/en/abs/learning-permutation-invariant-embeddings-for-description-logic-concepts-2303.01844</loc><lastmod>2023-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-permutation-invariant-embeddings-for-description-logic-concepts-2303.01844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-permutation-invariant-embeddings-for-description-logic-concepts-2303.01844"/></url>
<url><loc>https://scifaro.com/en/abs/finite-based-contraction-and-expansion-via-models-2303.03034</loc><lastmod>2023-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-based-contraction-and-expansion-via-models-2303.03034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-based-contraction-and-expansion-via-models-2303.03034"/></url>
<url><loc>https://scifaro.com/en/abs/outcome-logic-a-unifying-foundation-for-correctness-and-incorrectness-reasoning-2303.03111</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outcome-logic-a-unifying-foundation-for-correctness-and-incorrectness-reasoning-2303.03111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outcome-logic-a-unifying-foundation-for-correctness-and-incorrectness-reasoning-2303.03111"/></url>
<url><loc>https://scifaro.com/en/abs/a-fibrational-tale-of-operational-logical-relations-pure-effectful-and-differential-2303.03271</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fibrational-tale-of-operational-logical-relations-pure-effectful-and-differential-2303.03271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fibrational-tale-of-operational-logical-relations-pure-effectful-and-differential-2303.03271"/></url>
<url><loc>https://scifaro.com/en/abs/fixpoint-operators-for-2-categorical-structures-2303.03440</loc><lastmod>2023-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixpoint-operators-for-2-categorical-structures-2303.03440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixpoint-operators-for-2-categorical-structures-2303.03440"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-logic-and-markov-kernels-2303.03725</loc><lastmod>2023-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-logic-and-markov-kernels-2303.03725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-logic-and-markov-kernels-2303.03725"/></url>
<url><loc>https://scifaro.com/en/abs/the-temporal-logic-synthesis-format-tlsf-v1-2-2303.03839</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-temporal-logic-synthesis-format-tlsf-v1-2-2303.03839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-temporal-logic-synthesis-format-tlsf-v1-2-2303.03839"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-confluence-criteria-2303.03906</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-confluence-criteria-2303.03906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-confluence-criteria-2303.03906"/></url>
<url><loc>https://scifaro.com/en/abs/aczel-mendler-bisimulations-in-a-regular-category-2303.04442</loc><lastmod>2025-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/aczel-mendler-bisimulations-in-a-regular-category-2303.04442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/aczel-mendler-bisimulations-in-a-regular-category-2303.04442"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-existence-of-interpolants-and-definitions-in-first-order-modal-logic-2303.04598</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-existence-of-interpolants-and-definitions-in-first-order-modal-logic-2303.04598"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-existence-of-interpolants-and-definitions-in-first-order-modal-logic-2303.04598"/></url>
<url><loc>https://scifaro.com/en/abs/the-descriptive-complexity-of-graph-neural-networks-2303.04613</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-descriptive-complexity-of-graph-neural-networks-2303.04613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-descriptive-complexity-of-graph-neural-networks-2303.04613"/></url>
<url><loc>https://scifaro.com/en/abs/descriptive-complexity-for-distributed-computing-with-circuits-2303.04735</loc><lastmod>2023-03-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/descriptive-complexity-for-distributed-computing-with-circuits-2303.04735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/descriptive-complexity-for-distributed-computing-with-circuits-2303.04735"/></url>
<url><loc>https://scifaro.com/en/abs/stabilized-profunctors-and-stable-species-of-structures-2303.04795</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stabilized-profunctors-and-stable-species-of-structures-2303.04795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stabilized-profunctors-and-stable-species-of-structures-2303.04795"/></url>
<url><loc>https://scifaro.com/en/abs/nl2spec-interactively-translating-unstructured-natural-language-to-temporal-logics-with-large-language-models-2303.04864</loc><lastmod>2023-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nl2spec-interactively-translating-unstructured-natural-language-to-temporal-logics-with-large-language-models-2303.04864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nl2spec-interactively-translating-unstructured-natural-language-to-temporal-logics-with-large-language-models-2303.04864"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-theorem-proving-components-for-educational-software-2303.05360</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-theorem-proving-components-for-educational-software-2303.05360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-11th-international-workshop-on-theorem-proving-components-for-educational-software-2303.05360"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-new-topologies-for-the-theory-of-clones-2303.05471</loc><lastmod>2024-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-new-topologies-for-the-theory-of-clones-2303.05471"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-new-topologies-for-the-theory-of-clones-2303.05471"/></url>
<url><loc>https://scifaro.com/en/abs/verus-verifying-rust-programs-using-linear-ghost-types-extended-version-2303.05491</loc><lastmod>2023-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verus-verifying-rust-programs-using-linear-ghost-types-extended-version-2303.05491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verus-verifying-rust-programs-using-linear-ghost-types-extended-version-2303.05491"/></url>
<url><loc>https://scifaro.com/en/abs/lemmas-generation-selection-application-2303.05854</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lemmas-generation-selection-application-2303.05854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lemmas-generation-selection-application-2303.05854"/></url>
<url><loc>https://scifaro.com/en/abs/anita-analytic-tableau-proof-assistant-2303.05864</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anita-analytic-tableau-proof-assistant-2303.05864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anita-analytic-tableau-proof-assistant-2303.05864"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-tree-builder-for-sequent-calculus-and-hoare-logic-2303.05865</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-tree-builder-for-sequent-calculus-and-hoare-logic-2303.05865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-tree-builder-for-sequent-calculus-and-hoare-logic-2303.05865"/></url>
<url><loc>https://scifaro.com/en/abs/on-exams-with-the-isabelle-proof-assistant-2303.05866</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-exams-with-the-isabelle-proof-assistant-2303.05866"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-exams-with-the-isabelle-proof-assistant-2303.05866"/></url>
<url><loc>https://scifaro.com/en/abs/automated-grading-of-automata-with-acl2s-2303.05867</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-grading-of-automata-with-acl2s-2303.05867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-grading-of-automata-with-acl2s-2303.05867"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-accessible-mathematics-working-environment-based-on-isabelle-vscode-2303.05868</loc><lastmod>2023-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-accessible-mathematics-working-environment-based-on-isabelle-vscode-2303.05868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-accessible-mathematics-working-environment-based-on-isabelle-vscode-2303.05868"/></url>
<url><loc>https://scifaro.com/en/abs/reproduction-report-for-sv-comp-2023-2303.06477</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reproduction-report-for-sv-comp-2023-2303.06477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reproduction-report-for-sv-comp-2023-2303.06477"/></url>
<url><loc>https://scifaro.com/en/abs/local-search-for-smt-on-linear-and-multilinear-real-arithmetic-2303.06676</loc><lastmod>2023-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-search-for-smt-on-linear-and-multilinear-real-arithmetic-2303.06676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-search-for-smt-on-linear-and-multilinear-real-arithmetic-2303.06676"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-coherent-differential-categories-2303.06952</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-coherent-differential-categories-2303.06952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-coherent-differential-categories-2303.06952"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-graph-transformation-systems-using-weighted-subgraph-counting-2303.07812</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-graph-transformation-systems-using-weighted-subgraph-counting-2303.07812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-graph-transformation-systems-using-weighted-subgraph-counting-2303.07812"/></url>
<url><loc>https://scifaro.com/en/abs/unified-foundations-of-team-semantics-via-semirings-2303.07926</loc><lastmod>2023-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unified-foundations-of-team-semantics-via-semirings-2303.07926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unified-foundations-of-team-semantics-via-semirings-2303.07926"/></url>
<url><loc>https://scifaro.com/en/abs/normal-form-bisimulations-by-value-2303.08161</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-form-bisimulations-by-value-2303.08161"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-form-bisimulations-by-value-2303.08161"/></url>
<url><loc>https://scifaro.com/en/abs/the-image-of-the-process-interpretation-of-regular-expressions-is-not-closed-under-bisimulation-collapse-2303.08553</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-image-of-the-process-interpretation-of-regular-expressions-is-not-closed-under-bisimulation-collapse-2303.08553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-image-of-the-process-interpretation-of-regular-expressions-is-not-closed-under-bisimulation-collapse-2303.08553"/></url>
<url><loc>https://scifaro.com/en/abs/solving-rehabilitation-scheduling-problems-via-a-two-phase-asp-approach-2303.08709</loc><lastmod>2023-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-rehabilitation-scheduling-problems-via-a-two-phase-asp-approach-2303.08709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-rehabilitation-scheduling-problems-via-a-two-phase-asp-approach-2303.08709"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-analysis-and-parameter-synthesis-for-time-petri-nets-using-maude-and-smt-solving-2303.08929</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-analysis-and-parameter-synthesis-for-time-petri-nets-using-maude-and-smt-solving-2303.08929"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-analysis-and-parameter-synthesis-for-time-petri-nets-using-maude-and-smt-solving-2303.08929"/></url>
<url><loc>https://scifaro.com/en/abs/local-search-for-solving-satisfiability-of-polynomial-formulas-2303.09072</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-search-for-solving-satisfiability-of-polynomial-formulas-2303.09072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-search-for-solving-satisfiability-of-polynomial-formulas-2303.09072"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verified-animation-for-robochart-using-interaction-trees-2303.09106</loc><lastmod>2024-01-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verified-animation-for-robochart-using-interaction-trees-2303.09106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verified-animation-for-robochart-using-interaction-trees-2303.09106"/></url>
<url><loc>https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-quadratic-parameters-2303.09204</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-quadratic-parameters-2303.09204"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-membership-problem-for-hypergeometric-sequences-with-quadratic-parameters-2303.09204"/></url>
<url><loc>https://scifaro.com/en/abs/semitopology-a-topological-approach-to-decentralised-collaborative-action-2303.09287</loc><lastmod>2026-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semitopology-a-topological-approach-to-decentralised-collaborative-action-2303.09287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semitopology-a-topological-approach-to-decentralised-collaborative-action-2303.09287"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantum-smt-solver-for-bit-vector-theory-2303.09353</loc><lastmod>2023-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantum-smt-solver-for-bit-vector-theory-2303.09353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantum-smt-solver-for-bit-vector-theory-2303.09353"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-unifying-relations-for-modelling-epistemic-and-aleatoric-uncertainty-semantics-and-automated-reasoning-with-theorem-proving-2303.09692</loc><lastmod>2024-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-unifying-relations-for-modelling-epistemic-and-aleatoric-uncertainty-semantics-and-automated-reasoning-with-theorem-proving-2303.09692"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-unifying-relations-for-modelling-epistemic-and-aleatoric-uncertainty-semantics-and-automated-reasoning-with-theorem-proving-2303.09692"/></url>
<url><loc>https://scifaro.com/en/abs/graded-differential-categories-and-graded-differential-linear-logic-2303.10586</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-differential-categories-and-graded-differential-linear-logic-2303.10586"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-differential-categories-and-graded-differential-linear-logic-2303.10586"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-complexity-conjecture-and-the-incompleteness-theorem-2303.10637</loc><lastmod>2026-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-complexity-conjecture-and-the-incompleteness-theorem-2303.10637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-complexity-conjecture-and-the-incompleteness-theorem-2303.10637"/></url>
<url><loc>https://scifaro.com/en/abs/logic-of-differentiable-logics-towards-a-uniform-semantics-of-dl-2303.10650</loc><lastmod>2023-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-of-differentiable-logics-towards-a-uniform-semantics-of-dl-2303.10650"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-of-differentiable-logics-towards-a-uniform-semantics-of-dl-2303.10650"/></url>
<url><loc>https://scifaro.com/en/abs/counting-homomorphisms-from-hypergraphs-of-bounded-generalised-hypertree-width-a-logical-characterisation-2303.10980</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-homomorphisms-from-hypergraphs-of-bounded-generalised-hypertree-width-a-logical-characterisation-2303.10980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-homomorphisms-from-hypergraphs-of-bounded-generalised-hypertree-width-a-logical-characterisation-2303.10980"/></url>
<url><loc>https://scifaro.com/en/abs/terminal-coalgebras-in-countably-many-steps-2303.11071</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/terminal-coalgebras-in-countably-many-steps-2303.11071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/terminal-coalgebras-in-countably-many-steps-2303.11071"/></url>
<url><loc>https://scifaro.com/en/abs/a-more-general-categorical-framework-for-congruence-of-applicative-bisimilarity-2303.11679</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-more-general-categorical-framework-for-congruence-of-applicative-bisimilarity-2303.11679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-more-general-categorical-framework-for-congruence-of-applicative-bisimilarity-2303.11679"/></url>
<url><loc>https://scifaro.com/en/abs/an-implicit-function-theorem-for-the-stream-calculus-2303.11876</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-implicit-function-theorem-for-the-stream-calculus-2303.11876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-implicit-function-theorem-for-the-stream-calculus-2303.11876"/></url>
<url><loc>https://scifaro.com/en/abs/expressivity-landscape-for-logics-with-probabilistic-interventionist-counterfactuals-2303.11993</loc><lastmod>2023-03-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressivity-landscape-for-logics-with-probabilistic-interventionist-counterfactuals-2303.11993"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressivity-landscape-for-logics-with-probabilistic-interventionist-counterfactuals-2303.11993"/></url>
<url><loc>https://scifaro.com/en/abs/locality-theorems-in-semiring-semantics-2303.12627</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/locality-theorems-in-semiring-semantics-2303.12627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/locality-theorems-in-semiring-semantics-2303.12627"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-logical-and-semantic-frameworks-with-applications-2303.12680</loc><lastmod>2023-03-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-logical-and-semantic-frameworks-with-applications-2303.12680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-17th-international-workshop-on-logical-and-semantic-frameworks-with-applications-2303.12680"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-sets-in-agda-a-fresh-and-immature-mechanization-2303.13252</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-sets-in-agda-a-fresh-and-immature-mechanization-2303.13252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-sets-in-agda-a-fresh-and-immature-mechanization-2303.13252"/></url>
<url><loc>https://scifaro.com/en/abs/paraconsistent-transition-systems-2303.13254</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paraconsistent-transition-systems-2303.13254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paraconsistent-transition-systems-2303.13254"/></url>
<url><loc>https://scifaro.com/en/abs/relo-a-dynamic-logic-to-reason-about-reo-circuits-2303.13255</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relo-a-dynamic-logic-to-reason-about-reo-circuits-2303.13255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relo-a-dynamic-logic-to-reason-about-reo-circuits-2303.13255"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-innermost-runtime-complexity-through-tuple-interpretations-2303.13256</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-innermost-runtime-complexity-through-tuple-interpretations-2303.13256"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-innermost-runtime-complexity-through-tuple-interpretations-2303.13256"/></url>
<url><loc>https://scifaro.com/en/abs/equational-theorem-proving-for-clauses-over-strings-2303.13257</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-theorem-proving-for-clauses-over-strings-2303.13257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-theorem-proving-for-clauses-over-strings-2303.13257"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-the-strong-normalization-theorem-for-system-t-in-agda-2303.13258</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-the-strong-normalization-theorem-for-system-t-in-agda-2303.13258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-the-strong-normalization-theorem-for-system-t-in-agda-2303.13258"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-decision-petri-nets-2303.13344</loc><lastmod>2023-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-decision-petri-nets-2303.13344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-decision-petri-nets-2303.13344"/></url>
<url><loc>https://scifaro.com/en/abs/partial-quantifier-elimination-and-property-generation-2303.13811</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-quantifier-elimination-and-property-generation-2303.13811"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-quantifier-elimination-and-property-generation-2303.13811"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-computing-with-terms-and-graphs-2303.14219</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-computing-with-terms-and-graphs-2303.14219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-computing-with-terms-and-graphs-2303.14219"/></url>
<url><loc>https://scifaro.com/en/abs/using-unit-propagation-with-universal-reduction-in-dqbf-preprocessing-2303.14446</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-unit-propagation-with-universal-reduction-in-dqbf-preprocessing-2303.14446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-unit-propagation-with-universal-reduction-in-dqbf-preprocessing-2303.14446"/></url>
<url><loc>https://scifaro.com/en/abs/automata-based-software-model-checking-of-hyperproperties-2303.14796</loc><lastmod>2023-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-based-software-model-checking-of-hyperproperties-2303.14796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-based-software-model-checking-of-hyperproperties-2303.14796"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-partial-quantifier-elimination-2303.14928</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-partial-quantifier-elimination-2303.14928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-partial-quantifier-elimination-2303.14928"/></url>
<url><loc>https://scifaro.com/en/abs/on-cnf-conversion-for-sat-and-smt-enumeration-2303.14971</loc><lastmod>2025-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-cnf-conversion-for-sat-and-smt-enumeration-2303.14971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-cnf-conversion-for-sat-and-smt-enumeration-2303.14971"/></url>
<url><loc>https://scifaro.com/en/abs/semi-simplicial-set-models-for-distributed-knowledge-2303.14976</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-simplicial-set-models-for-distributed-knowledge-2303.14976"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-simplicial-set-models-for-distributed-knowledge-2303.14976"/></url>
<url><loc>https://scifaro.com/en/abs/a-generalized-hybrid-hoare-logic-2303.15020</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-generalized-hybrid-hoare-logic-2303.15020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-generalized-hybrid-hoare-logic-2303.15020"/></url>
<url><loc>https://scifaro.com/en/abs/a-simplified-lower-bound-for-implicational-logic-2303.15090</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simplified-lower-bound-for-implicational-logic-2303.15090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simplified-lower-bound-for-implicational-logic-2303.15090"/></url>
<url><loc>https://scifaro.com/en/abs/graph-sequence-learning-for-premise-selection-2303.15642</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-sequence-learning-for-premise-selection-2303.15642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-sequence-learning-for-premise-selection-2303.15642"/></url>
<url><loc>https://scifaro.com/en/abs/on-causal-equivalence-by-tracing-in-string-rewriting-2303.15783</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-causal-equivalence-by-tracing-in-string-rewriting-2303.15783"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-causal-equivalence-by-tracing-in-string-rewriting-2303.15783"/></url>
<url><loc>https://scifaro.com/en/abs/from-double-pushout-grammars-to-hypergraph-lambek-grammars-with-and-without-exponential-modality-2303.15788</loc><lastmod>2023-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-double-pushout-grammars-to-hypergraph-lambek-grammars-with-and-without-exponential-modality-2303.15788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-double-pushout-grammars-to-hypergraph-lambek-grammars-with-and-without-exponential-modality-2303.15788"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-non-linear-transcendental-arithmetic-as-a-certificate-search-problem-2303.16582</loc><lastmod>2025-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-non-linear-transcendental-arithmetic-as-a-certificate-search-problem-2303.16582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-non-linear-transcendental-arithmetic-as-a-certificate-search-problem-2303.16582"/></url>
<url><loc>https://scifaro.com/en/abs/hyperltl-satisfiability-is-highly-undecidable-hyperctl-is-even-harder-2303.16699</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperltl-satisfiability-is-highly-undecidable-hyperctl-is-even-harder-2303.16699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperltl-satisfiability-is-highly-undecidable-hyperctl-is-even-harder-2303.16699"/></url>
<url><loc>https://scifaro.com/en/abs/two-algorithms-to-decide-quantifier-free-definability-in-finite-algebraic-structures-2303.17017</loc><lastmod>2023-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-algorithms-to-decide-quantifier-free-definability-in-finite-algebraic-structures-2303.17017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-algorithms-to-decide-quantifier-free-definability-in-finite-algebraic-structures-2303.17017"/></url>
<url><loc>https://scifaro.com/en/abs/effect-algebras-as-omega-categories-2303.17257</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effect-algebras-as-omega-categories-2303.17257"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effect-algebras-as-omega-categories-2303.17257"/></url>
<url><loc>https://scifaro.com/en/abs/pfl-a-probabilistic-logic-for-fault-trees-2303.17314</loc><lastmod>2025-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pfl-a-probabilistic-logic-for-fault-trees-2303.17314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pfl-a-probabilistic-logic-for-fault-trees-2303.17314"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-substitution-for-dynamic-logic-with-communicating-hybrid-programs-2303.17333</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-substitution-for-dynamic-logic-with-communicating-hybrid-programs-2303.17333"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-substitution-for-dynamic-logic-with-communicating-hybrid-programs-2303.17333"/></url>
<url><loc>https://scifaro.com/en/abs/pacti-scaling-assume-guarantee-reasoning-for-system-analysis-and-design-2303.17751</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pacti-scaling-assume-guarantee-reasoning-for-system-analysis-and-design-2303.17751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pacti-scaling-assume-guarantee-reasoning-for-system-analysis-and-design-2303.17751"/></url>
<url><loc>https://scifaro.com/en/abs/logic-is-algebra-2304.00358</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-is-algebra-2304.00358"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-is-algebra-2304.00358"/></url>
<url><loc>https://scifaro.com/en/abs/explanation-from-ethics-to-logic-2304.00821</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explanation-from-ethics-to-logic-2304.00821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explanation-from-ethics-to-logic-2304.00821"/></url>
<url><loc>https://scifaro.com/en/abs/uncertainty-based-knowing-how-logic-2304.01022</loc><lastmod>2023-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uncertainty-based-knowing-how-logic-2304.01022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uncertainty-based-knowing-how-logic-2304.01022"/></url>
<url><loc>https://scifaro.com/en/abs/belief-knowledge-and-evidence-2304.01283</loc><lastmod>2023-04-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-knowledge-and-evidence-2304.01283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-knowledge-and-evidence-2304.01283"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-v-equational-system-for-graded-lambda-calculus-2304.02082</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-v-equational-system-for-graded-lambda-calculus-2304.02082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-v-equational-system-for-graded-lambda-calculus-2304.02082"/></url>
<url><loc>https://scifaro.com/en/abs/strongly-complete-axiomatization-for-a-logic-with-probabilistic-interventionist-counterfactuals-2304.02964</loc><lastmod>2023-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strongly-complete-axiomatization-for-a-logic-with-probabilistic-interventionist-counterfactuals-2304.02964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strongly-complete-axiomatization-for-a-logic-with-probabilistic-interventionist-counterfactuals-2304.02964"/></url>
<url><loc>https://scifaro.com/en/abs/a-mathematical-benchmark-for-inductive-theorem-provers-2304.02986</loc><lastmod>2023-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mathematical-benchmark-for-inductive-theorem-provers-2304.02986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mathematical-benchmark-for-inductive-theorem-provers-2304.02986"/></url>
<url><loc>https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-and-connections-to-proximity-oblivious-testing-2304.03810</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-and-connections-to-proximity-oblivious-testing-2304.03810"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-testability-of-first-order-properties-in-bounded-degree-graphs-and-connections-to-proximity-oblivious-testing-2304.03810"/></url>
<url><loc>https://scifaro.com/en/abs/proof-generation-for-cdcl-solvers-using-gauss-jordan-elimination-2304.04292</loc><lastmod>2023-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-generation-for-cdcl-solvers-using-gauss-jordan-elimination-2304.04292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-generation-for-cdcl-solvers-using-gauss-jordan-elimination-2304.04292"/></url>
<url><loc>https://scifaro.com/en/abs/the-nature-of-concurrency-2304.04406</loc><lastmod>2023-08-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-nature-of-concurrency-2304.04406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-nature-of-concurrency-2304.04406"/></url>
<url><loc>https://scifaro.com/en/abs/execution-traces-and-reduction-sequences-2304.05039</loc><lastmod>2023-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/execution-traces-and-reduction-sequences-2304.05039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/execution-traces-and-reduction-sequences-2304.05039"/></url>
<url><loc>https://scifaro.com/en/abs/complementation-a-bridge-between-finite-and-infinite-proofs-2304.05085</loc><lastmod>2023-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complementation-a-bridge-between-finite-and-infinite-proofs-2304.05085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complementation-a-bridge-between-finite-and-infinite-proofs-2304.05085"/></url>
<url><loc>https://scifaro.com/en/abs/canonicity-of-proofs-in-constructive-modal-logic-2304.05465</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonicity-of-proofs-in-constructive-modal-logic-2304.05465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonicity-of-proofs-in-constructive-modal-logic-2304.05465"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-for-an-abstract-proof-theory-in-the-context-of-horn-rules-2304.05697</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-for-an-abstract-proof-theory-in-the-context-of-horn-rules-2304.05697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-for-an-abstract-proof-theory-in-the-context-of-horn-rules-2304.05697"/></url>
<url><loc>https://scifaro.com/en/abs/when-do-homomorphism-counts-help-in-query-algorithms-2304.06294</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-do-homomorphism-counts-help-in-query-algorithms-2304.06294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-do-homomorphism-counts-help-in-query-algorithms-2304.06294"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-querying-first-order-theories-via-countermodels-of-finite-width-2304.06348</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-querying-first-order-theories-via-countermodels-of-finite-width-2304.06348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-querying-first-order-theories-via-countermodels-of-finite-width-2304.06348"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-account-of-subtyping-for-session-types-2304.06398</loc><lastmod>2023-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-account-of-subtyping-for-session-types-2304.06398"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-account-of-subtyping-for-session-types-2304.06398"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2304.06646</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2304.06646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-modal-formulas-with-examples-2304.06646"/></url>
<url><loc>https://scifaro.com/en/abs/how-well-do-sota-legal-reasoning-models-support-abductive-reasoning-2304.06912</loc><lastmod>2023-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-well-do-sota-legal-reasoning-models-support-abductive-reasoning-2304.06912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-well-do-sota-legal-reasoning-models-support-abductive-reasoning-2304.06912"/></url>
<url><loc>https://scifaro.com/en/abs/operations-on-fixpoint-equation-systems-2304.07162</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operations-on-fixpoint-equation-systems-2304.07162"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operations-on-fixpoint-equation-systems-2304.07162"/></url>
<url><loc>https://scifaro.com/en/abs/causal-models-in-string-diagrams-2304.07638</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-models-in-string-diagrams-2304.07638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-models-in-string-diagrams-2304.07638"/></url>
<url><loc>https://scifaro.com/en/abs/the-principle-of-a-finite-density-of-information-2304.08064</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-principle-of-a-finite-density-of-information-2304.08064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-principle-of-a-finite-density-of-information-2304.08064"/></url>
<url><loc>https://scifaro.com/en/abs/a-theory-independent-curry-de-bruijn-howard-correspondence-2304.08068</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theory-independent-curry-de-bruijn-howard-correspondence-2304.08068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theory-independent-curry-de-bruijn-howard-correspondence-2304.08068"/></url>
<url><loc>https://scifaro.com/en/abs/doxastic-lukasiewicz-logic-with-public-announcement-2304.08077</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doxastic-lukasiewicz-logic-with-public-announcement-2304.08077"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doxastic-lukasiewicz-logic-with-public-announcement-2304.08077"/></url>
<url><loc>https://scifaro.com/en/abs/craig-interpolation-for-guarded-fragments-2304.08086</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/craig-interpolation-for-guarded-fragments-2304.08086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/craig-interpolation-for-guarded-fragments-2304.08086"/></url>
<url><loc>https://scifaro.com/en/abs/search-space-pruning-with-int-splits-for-faster-qbf-solving-2304.08308</loc><lastmod>2023-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/search-space-pruning-with-int-splits-for-faster-qbf-solving-2304.08308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/search-space-pruning-with-int-splits-for-faster-qbf-solving-2304.08308"/></url>
<url><loc>https://scifaro.com/en/abs/scenario-approach-for-parametric-markov-models-2304.08330</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scenario-approach-for-parametric-markov-models-2304.08330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scenario-approach-for-parametric-markov-models-2304.08330"/></url>
<url><loc>https://scifaro.com/en/abs/about-the-expressive-power-and-complexity-of-order-invariance-with-two-variables-2304.08410</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-the-expressive-power-and-complexity-of-order-invariance-with-two-variables-2304.08410"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-the-expressive-power-and-complexity-of-order-invariance-with-two-variables-2304.08410"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-rewrite-system-for-the-normalization-of-linear-temporal-logic-2304.08872</loc><lastmod>2023-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-rewrite-system-for-the-normalization-of-linear-temporal-logic-2304.08872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-rewrite-system-for-the-normalization-of-linear-temporal-logic-2304.08872"/></url>
<url><loc>https://scifaro.com/en/abs/embedded-finite-models-beyond-restricted-quantifier-collapse-2304.09231</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedded-finite-models-beyond-restricted-quantifier-collapse-2304.09231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedded-finite-models-beyond-restricted-quantifier-collapse-2304.09231"/></url>
<url><loc>https://scifaro.com/en/abs/the-transformation-logics-2304.09639</loc><lastmod>2024-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-transformation-logics-2304.09639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-transformation-logics-2304.09639"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-stone-v-c-ech-compactification-in-zfa-2304.09986</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-stone-v-c-ech-compactification-in-zfa-2304.09986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-stone-v-c-ech-compactification-in-zfa-2304.09986"/></url>
<url><loc>https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-2304.10166</loc><lastmod>2023-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-2304.10166"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-2304.10166"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-2304.10196</loc><lastmod>2023-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-2304.10196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-2304.10196"/></url>
<url><loc>https://scifaro.com/en/abs/counting-computations-with-formulae-logical-characterisations-of-counting-complexity-classes-2304.10334</loc><lastmod>2023-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-computations-with-formulae-logical-characterisations-of-counting-complexity-classes-2304.10334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-computations-with-formulae-logical-characterisations-of-counting-complexity-classes-2304.10334"/></url>
<url><loc>https://scifaro.com/en/abs/towards-coherence-theorems-for-equational-extensions-of-type-theories-2304.10343</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-coherence-theorems-for-equational-extensions-of-type-theories-2304.10343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-coherence-theorems-for-equational-extensions-of-type-theories-2304.10343"/></url>
<url><loc>https://scifaro.com/en/abs/pdl-on-steroids-on-expressive-extensions-of-pdl-with-intersection-and-converse-2304.10381</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pdl-on-steroids-on-expressive-extensions-of-pdl-with-intersection-and-converse-2304.10381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pdl-on-steroids-on-expressive-extensions-of-pdl-with-intersection-and-converse-2304.10381"/></url>
<url><loc>https://scifaro.com/en/abs/engel-s-theorem-in-mathlib-2304.10424</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/engel-s-theorem-in-mathlib-2304.10424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/engel-s-theorem-in-mathlib-2304.10424"/></url>
<url><loc>https://scifaro.com/en/abs/coprover-a-recommender-system-for-proof-construction-2304.10486</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coprover-a-recommender-system-for-proof-construction-2304.10486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coprover-a-recommender-system-for-proof-construction-2304.10486"/></url>
<url><loc>https://scifaro.com/en/abs/disjunctiveprogramming-jl-generalized-disjunctive-programming-models-and-algorithms-for-jump-2304.10492</loc><lastmod>2023-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjunctiveprogramming-jl-generalized-disjunctive-programming-models-and-algorithms-for-jump-2304.10492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjunctiveprogramming-jl-generalized-disjunctive-programming-models-and-algorithms-for-jump-2304.10492"/></url>
<url><loc>https://scifaro.com/en/abs/set-semantics-for-asynchronous-teamltl-expressivity-and-complexity-2304.10915</loc><lastmod>2023-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/set-semantics-for-asynchronous-teamltl-expressivity-and-complexity-2304.10915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/set-semantics-for-asynchronous-teamltl-expressivity-and-complexity-2304.10915"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-proof-that-super-consistency-implies-cut-elimination-2304.10975</loc><lastmod>2023-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-proof-that-super-consistency-implies-cut-elimination-2304.10975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-proof-that-super-consistency-implies-cut-elimination-2304.10975"/></url>
<url><loc>https://scifaro.com/en/abs/effectful-semantics-in-bicategories-strong-commutative-and-concurrent-pseudomonads-2304.11014</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectful-semantics-in-bicategories-strong-commutative-and-concurrent-pseudomonads-2304.11014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectful-semantics-in-bicategories-strong-commutative-and-concurrent-pseudomonads-2304.11014"/></url>
<url><loc>https://scifaro.com/en/abs/the-logic-of-prefixes-and-suffixes-is-elementary-under-homogeneity-2304.11483</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logic-of-prefixes-and-suffixes-is-elementary-under-homogeneity-2304.11483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logic-of-prefixes-and-suffixes-is-elementary-under-homogeneity-2304.11483"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-automating-recoverability-proofs-for-cyber-physical-systems-with-runtime-assurance-architectures-2304.11564</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-automating-recoverability-proofs-for-cyber-physical-systems-with-runtime-assurance-architectures-2304.11564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-automating-recoverability-proofs-for-cyber-physical-systems-with-runtime-assurance-architectures-2304.11564"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-over-trees-in-monadic-second-order-logic-2304.11613</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-over-trees-in-monadic-second-order-logic-2304.11613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-over-trees-in-monadic-second-order-logic-2304.11613"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-in-dependence-friendly-logic-2304.11652</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-in-dependence-friendly-logic-2304.11652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-in-dependence-friendly-logic-2304.11652"/></url>
<url><loc>https://scifaro.com/en/abs/how-can-we-prove-that-a-proof-search-method-is-not-an-instance-of-another-2304.11882</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-can-we-prove-that-a-proof-search-method-is-not-an-instance-of-another-2304.11882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-can-we-prove-that-a-proof-search-method-is-not-an-instance-of-another-2304.11882"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressive-power-of-schemes-2304.11892</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressive-power-of-schemes-2304.11892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressive-power-of-schemes-2304.11892"/></url>
<url><loc>https://scifaro.com/en/abs/existential-calculi-of-relations-with-transitive-closure-complexity-and-edge-saturations-2304.12079</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-calculi-of-relations-with-transitive-closure-complexity-and-edge-saturations-2304.12079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-calculi-of-relations-with-transitive-closure-complexity-and-edge-saturations-2304.12079"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-s4-is-decidable-2304.12094</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-s4-is-decidable-2304.12094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-s4-is-decidable-2304.12094"/></url>
<url><loc>https://scifaro.com/en/abs/pseudorandom-finite-models-2304.12109</loc><lastmod>2023-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pseudorandom-finite-models-2304.12109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pseudorandom-finite-models-2304.12109"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-computability-of-measures-of-regular-sets-of-infinite-trees-2304.12158</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-computability-of-measures-of-regular-sets-of-infinite-trees-2304.12158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-computability-of-measures-of-regular-sets-of-infinite-trees-2304.12158"/></url>
<url><loc>https://scifaro.com/en/abs/two-decreasing-measures-for-simply-typed-lambda-terms-extended-version-2304.12440</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-decreasing-measures-for-simply-typed-lambda-terms-extended-version-2304.12440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-decreasing-measures-for-simply-typed-lambda-terms-extended-version-2304.12440"/></url>
<url><loc>https://scifaro.com/en/abs/hyperproperty-verification-as-chc-satisfiability-2304.12588</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperproperty-verification-as-chc-satisfiability-2304.12588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperproperty-verification-as-chc-satisfiability-2304.12588"/></url>
<url><loc>https://scifaro.com/en/abs/finitely-accessible-arboreal-adjunctions-and-hintikka-formulae-2304.12709</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finitely-accessible-arboreal-adjunctions-and-hintikka-formulae-2304.12709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finitely-accessible-arboreal-adjunctions-and-hintikka-formulae-2304.12709"/></url>
<url><loc>https://scifaro.com/en/abs/investigations-into-proof-structures-2304.12827</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/investigations-into-proof-structures-2304.12827"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/investigations-into-proof-structures-2304.12827"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-logspace-recursion-with-logarithmic-quantifier-depth-2304.12948</loc><lastmod>2023-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-logspace-recursion-with-logarithmic-quantifier-depth-2304.12948"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-logspace-recursion-with-logarithmic-quantifier-depth-2304.12948"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-infinite-state-broadcast-networks-2304.13065</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-infinite-state-broadcast-networks-2304.13065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-coverability-in-infinite-state-broadcast-networks-2304.13065"/></url>
<url><loc>https://scifaro.com/en/abs/the-physical-church-thesis-and-the-sensitivity-to-initial-conditions-2304.13318</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-physical-church-thesis-and-the-sensitivity-to-initial-conditions-2304.13318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-physical-church-thesis-and-the-sensitivity-to-initial-conditions-2304.13318"/></url>
<url><loc>https://scifaro.com/en/abs/simple-type-theory-as-a-clausal-theory-2304.13319</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-type-theory-as-a-clausal-theory-2304.13319"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-type-theory-as-a-clausal-theory-2304.13319"/></url>
<url><loc>https://scifaro.com/en/abs/specifying-programs-with-propositions-and-with-congruences-2304.13321</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specifying-programs-with-propositions-and-with-congruences-2304.13321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specifying-programs-with-propositions-and-with-congruences-2304.13321"/></url>
<url><loc>https://scifaro.com/en/abs/the-logic-of-logic-programming-2304.13430</loc><lastmod>2023-04-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logic-of-logic-programming-2304.13430"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logic-of-logic-programming-2304.13430"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-decomposition-of-propositional-logic-programs-2304.13522</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-decomposition-of-propositional-logic-programs-2304.13522"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-decomposition-of-propositional-logic-programs-2304.13522"/></url>
<url><loc>https://scifaro.com/en/abs/cut-restriction-from-cuts-to-analytic-cuts-2304.13657</loc><lastmod>2023-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-restriction-from-cuts-to-analytic-cuts-2304.13657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-restriction-from-cuts-to-analytic-cuts-2304.13657"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-linear-temporal-specifications-of-constant-rate-multi-mode-systems-2304.13816</loc><lastmod>2023-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-linear-temporal-specifications-of-constant-rate-multi-mode-systems-2304.13816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-linear-temporal-specifications-of-constant-rate-multi-mode-systems-2304.13816"/></url>
<url><loc>https://scifaro.com/en/abs/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf-2304.13896</loc><lastmod>2023-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf-2304.13896"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-aware-lower-bounds-and-broadening-the-horizon-of-tractability-for-qbf-2304.13896"/></url>
<url><loc>https://scifaro.com/en/abs/universal-quantitative-algebra-for-fuzzy-relations-and-generalised-metric-spaces-2304.14361</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-quantitative-algebra-for-fuzzy-relations-and-generalised-metric-spaces-2304.14361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-quantitative-algebra-for-fuzzy-relations-and-generalised-metric-spaces-2304.14361"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-minimal-changes-in-the-zone-abstract-domain-2304.14550</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-minimal-changes-in-the-zone-abstract-domain-2304.14550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-minimal-changes-in-the-zone-abstract-domain-2304.14550"/></url>
<url><loc>https://scifaro.com/en/abs/the-logical-essence-of-compiling-with-continuations-2304.14752</loc><lastmod>2023-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logical-essence-of-compiling-with-continuations-2304.14752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logical-essence-of-compiling-with-continuations-2304.14752"/></url>
<url><loc>https://scifaro.com/en/abs/causal-modeling-semantics-for-counterfactuals-with-disjunctive-antecedents-2304.14817</loc><lastmod>2023-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/causal-modeling-semantics-for-counterfactuals-with-disjunctive-antecedents-2304.14817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/causal-modeling-semantics-for-counterfactuals-with-disjunctive-antecedents-2304.14817"/></url>
<url><loc>https://scifaro.com/en/abs/conditional-logic-as-a-short-circuit-logic-2304.14821</loc><lastmod>2025-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conditional-logic-as-a-short-circuit-logic-2304.14821"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conditional-logic-as-a-short-circuit-logic-2304.14821"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-tracing-a-graphical-language-for-rewriting-protocols-2304.14950</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-tracing-a-graphical-language-for-rewriting-protocols-2304.14950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-tracing-a-graphical-language-for-rewriting-protocols-2304.14950"/></url>
<url><loc>https://scifaro.com/en/abs/smt-solving-over-finite-field-arithmetic-2305.00028</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-solving-over-finite-field-arithmetic-2305.00028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-solving-over-finite-field-arithmetic-2305.00028"/></url>
<url><loc>https://scifaro.com/en/abs/hermesbdd-a-multi-core-and-multi-platform-binary-decision-diagram-package-2305.00039</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hermesbdd-a-multi-core-and-multi-platform-binary-decision-diagram-package-2305.00039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hermesbdd-a-multi-core-and-multi-platform-binary-decision-diagram-package-2305.00039"/></url>
<url><loc>https://scifaro.com/en/abs/logipedia-a-multi-system-encyclopedia-of-formal-proofs-2305.00064</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logipedia-a-multi-system-encyclopedia-of-formal-proofs-2305.00064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logipedia-a-multi-system-encyclopedia-of-formal-proofs-2305.00064"/></url>
<url><loc>https://scifaro.com/en/abs/logic-based-similarity-2305.00065</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-based-similarity-2305.00065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-based-similarity-2305.00065"/></url>
<url><loc>https://scifaro.com/en/abs/positionality-of-mean-payoff-games-on-infinite-graphs-2305.00347</loc><lastmod>2023-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positionality-of-mean-payoff-games-on-infinite-graphs-2305.00347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positionality-of-mean-payoff-games-on-infinite-graphs-2305.00347"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebraic-lambda-calculus-is-a-conservative-extension-of-the-ordinary-lambda-calculus-2305.01067</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebraic-lambda-calculus-is-a-conservative-extension-of-the-ordinary-lambda-calculus-2305.01067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebraic-lambda-calculus-is-a-conservative-extension-of-the-ordinary-lambda-calculus-2305.01067"/></url>
<url><loc>https://scifaro.com/en/abs/complex-logical-reasoning-over-knowledge-graphs-using-large-language-models-2305.01157</loc><lastmod>2024-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complex-logical-reasoning-over-knowledge-graphs-using-large-language-models-2305.01157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complex-logical-reasoning-over-knowledge-graphs-using-large-language-models-2305.01157"/></url>
<url><loc>https://scifaro.com/en/abs/chronosymbolic-learning-efficient-chc-solving-with-symbolic-reasoning-and-inductive-learning-2305.01206</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chronosymbolic-learning-efficient-chc-solving-with-symbolic-reasoning-and-inductive-learning-2305.01206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chronosymbolic-learning-efficient-chc-solving-with-symbolic-reasoning-and-inductive-learning-2305.01206"/></url>
<url><loc>https://scifaro.com/en/abs/reverse-engineering-of-temporal-queries-mediated-by-ltl-ontologies-2305.01248</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reverse-engineering-of-temporal-queries-mediated-by-ltl-ontologies-2305.01248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reverse-engineering-of-temporal-queries-mediated-by-ltl-ontologies-2305.01248"/></url>
<url><loc>https://scifaro.com/en/abs/the-physical-church-turing-thesis-and-non-deterministic-computation-over-the-real-numbers-2305.01432</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-physical-church-turing-thesis-and-non-deterministic-computation-over-the-real-numbers-2305.01432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-physical-church-turing-thesis-and-non-deterministic-computation-over-the-real-numbers-2305.01432"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-convergence-of-reduction-based-and-model-based-methods-in-proof-theory-2305.01439</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-convergence-of-reduction-based-and-model-based-methods-in-proof-theory-2305.01439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-convergence-of-reduction-based-and-model-based-methods-in-proof-theory-2305.01439"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-proofs-of-positive-formulae-2305.01440</loc><lastmod>2023-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-proofs-of-positive-formulae-2305.01440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-proofs-of-positive-formulae-2305.01440"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-guarded-kat-modulo-bisimilarity-completeness-and-complexity-2305.01755</loc><lastmod>2023-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-guarded-kat-modulo-bisimilarity-completeness-and-complexity-2305.01755"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-guarded-kat-modulo-bisimilarity-completeness-and-complexity-2305.01755"/></url>
<url><loc>https://scifaro.com/en/abs/allegories-of-symbolic-manipulations-2305.01772</loc><lastmod>2023-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/allegories-of-symbolic-manipulations-2305.01772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/allegories-of-symbolic-manipulations-2305.01772"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-ac-counting-with-parikh-and-muller-adding-presburger-arithmetic-to-monadic-second-order-logic-over-tree-interpretable-structures-2305.01962</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-ac-counting-with-parikh-and-muller-adding-presburger-arithmetic-to-monadic-second-order-logic-over-tree-interpretable-structures-2305.01962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-ac-counting-with-parikh-and-muller-adding-presburger-arithmetic-to-monadic-second-order-logic-over-tree-interpretable-structures-2305.01962"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-definability-in-constraint-languages-with-few-subpowers-2305.01984</loc><lastmod>2026-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-definability-in-constraint-languages-with-few-subpowers-2305.01984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-definability-in-constraint-languages-with-few-subpowers-2305.01984"/></url>
<url><loc>https://scifaro.com/en/abs/hierarchical-and-upstream-downstream-composition-of-stock-and-flow-models-2305.02136</loc><lastmod>2023-05-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hierarchical-and-upstream-downstream-composition-of-stock-and-flow-models-2305.02136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hierarchical-and-upstream-downstream-composition-of-stock-and-flow-models-2305.02136"/></url>
<url><loc>https://scifaro.com/en/abs/proof-in-the-time-of-machines-2305.02329</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-in-the-time-of-machines-2305.02329"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-in-the-time-of-machines-2305.02329"/></url>
<url><loc>https://scifaro.com/en/abs/combining-combination-properties-an-analysis-of-stable-infiniteness-convexity-and-politeness-2305.02384</loc><lastmod>2023-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-combination-properties-an-analysis-of-stable-infiniteness-convexity-and-politeness-2305.02384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-combination-properties-an-analysis-of-stable-infiniteness-convexity-and-politeness-2305.02384"/></url>
<url><loc>https://scifaro.com/en/abs/tackling-universal-properties-of-minimal-trap-spaces-of-boolean-networks-2305.02442</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tackling-universal-properties-of-minimal-trap-spaces-of-boolean-networks-2305.02442"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tackling-universal-properties-of-minimal-trap-spaces-of-boolean-networks-2305.02442"/></url>
<url><loc>https://scifaro.com/en/abs/multiteam-semantics-for-interventionist-counterfactuals-probabilities-and-causation-2305.02613</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiteam-semantics-for-interventionist-counterfactuals-probabilities-and-causation-2305.02613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiteam-semantics-for-interventionist-counterfactuals-probabilities-and-causation-2305.02613"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-play-the-accordion-uniformity-and-the-non-conservativity-of-the-linear-approximation-of-the-lambda-calculus-extended-version-2305.02785</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-play-the-accordion-uniformity-and-the-non-conservativity-of-the-linear-approximation-of-the-lambda-calculus-extended-version-2305.02785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-play-the-accordion-uniformity-and-the-non-conservativity-of-the-linear-approximation-of-the-lambda-calculus-extended-version-2305.02785"/></url>
<url><loc>https://scifaro.com/en/abs/a-monoidal-view-on-fixpoint-checks-2305.02957</loc><lastmod>2025-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-monoidal-view-on-fixpoint-checks-2305.02957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-monoidal-view-on-fixpoint-checks-2305.02957"/></url>
<url><loc>https://scifaro.com/en/abs/urgency-annotations-for-alternating-choices-2305.02967</loc><lastmod>2023-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/urgency-annotations-for-alternating-choices-2305.02967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/urgency-annotations-for-alternating-choices-2305.02967"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-presburger-arithmetic-with-power-or-powers-2305.03037</loc><lastmod>2026-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-presburger-arithmetic-with-power-or-powers-2305.03037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-presburger-arithmetic-with-power-or-powers-2305.03037"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-limits-of-decision-the-adjacent-fragment-of-first-order-logic-2305.03133</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-limits-of-decision-the-adjacent-fragment-of-first-order-logic-2305.03133"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-limits-of-decision-the-adjacent-fragment-of-first-order-logic-2305.03133"/></url>
<url><loc>https://scifaro.com/en/abs/skolemization-in-simple-type-theory-the-logical-and-the-theoretical-points-of-view-2305.03322</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolemization-in-simple-type-theory-the-logical-and-the-theoretical-points-of-view-2305.03322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolemization-in-simple-type-theory-the-logical-and-the-theoretical-points-of-view-2305.03322"/></url>
<url><loc>https://scifaro.com/en/abs/finding-the-right-way-to-rome-effect-oriented-graph-transformation-2305.03432</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finding-the-right-way-to-rome-effect-oriented-graph-transformation-2305.03432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finding-the-right-way-to-rome-effect-oriented-graph-transformation-2305.03432"/></url>
<url><loc>https://scifaro.com/en/abs/degrees-of-second-and-higher-order-polynomials-2305.03439</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/degrees-of-second-and-higher-order-polynomials-2305.03439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/degrees-of-second-and-higher-order-polynomials-2305.03439"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-2305.03606</loc><lastmod>2023-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-2305.03606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-of-array-traversing-programs-2305.03606"/></url>
<url><loc>https://scifaro.com/en/abs/specification-and-verification-of-a-linear-time-logic-for-graph-transformation-2305.03832</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/specification-and-verification-of-a-linear-time-logic-for-graph-transformation-2305.03832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/specification-and-verification-of-a-linear-time-logic-for-graph-transformation-2305.03832"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-ternary-logic-and-its-systematic-logic-composition-methodology-2305.04115</loc><lastmod>2023-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-ternary-logic-and-its-systematic-logic-composition-methodology-2305.04115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-ternary-logic-and-its-systematic-logic-composition-methodology-2305.04115"/></url>
<url><loc>https://scifaro.com/en/abs/branching-place-bisimilarity-2305.04222</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-place-bisimilarity-2305.04222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-place-bisimilarity-2305.04222"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-theorems-for-tarski-s-relation-algebra-2305.04656</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-theorems-for-tarski-s-relation-algebra-2305.04656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-theorems-for-tarski-s-relation-algebra-2305.04656"/></url>
<url><loc>https://scifaro.com/en/abs/outcome-separation-logic-local-reasoning-for-correctness-and-incorrectness-with-computational-effects-2305.04842</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outcome-separation-logic-local-reasoning-for-correctness-and-incorrectness-with-computational-effects-2305.04842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outcome-separation-logic-local-reasoning-for-correctness-and-incorrectness-with-computational-effects-2305.04842"/></url>
<url><loc>https://scifaro.com/en/abs/robust-positivity-problems-for-linear-recurrence-sequences-2305.04870</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-positivity-problems-for-linear-recurrence-sequences-2305.04870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-positivity-problems-for-linear-recurrence-sequences-2305.04870"/></url>
<url><loc>https://scifaro.com/en/abs/skolem-and-positivity-completeness-of-ergodic-markov-chains-2305.04881</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolem-and-positivity-completeness-of-ergodic-markov-chains-2305.04881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolem-and-positivity-completeness-of-ergodic-markov-chains-2305.04881"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-model-construction-for-saturated-constrained-horn-clauses-2305.05064</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-model-construction-for-saturated-constrained-horn-clauses-2305.05064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-model-construction-for-saturated-constrained-horn-clauses-2305.05064"/></url>
<url><loc>https://scifaro.com/en/abs/bilingual-analogical-proportions-via-hedges-2305.05614</loc><lastmod>2024-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bilingual-analogical-proportions-via-hedges-2305.05614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bilingual-analogical-proportions-via-hedges-2305.05614"/></url>
<url><loc>https://scifaro.com/en/abs/put-the-car-on-the-stand-smt-based-oracles-for-investigating-decisions-2305.05731</loc><lastmod>2024-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/put-the-car-on-the-stand-smt-based-oracles-for-investigating-decisions-2305.05731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/put-the-car-on-the-stand-smt-based-oracles-for-investigating-decisions-2305.05731"/></url>
<url><loc>https://scifaro.com/en/abs/graph-based-reductions-for-parametric-and-weighted-mdps-2305.05739</loc><lastmod>2023-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-based-reductions-for-parametric-and-weighted-mdps-2305.05739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-based-reductions-for-parametric-and-weighted-mdps-2305.05739"/></url>
<url><loc>https://scifaro.com/en/abs/dnn-verification-reachability-and-the-exponential-function-problem-2305.06064</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dnn-verification-reachability-and-the-exponential-function-problem-2305.06064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dnn-verification-reachability-and-the-exponential-function-problem-2305.06064"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-unification-modulo-sigma-alone-2305.06214</loc><lastmod>2023-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-unification-modulo-sigma-alone-2305.06214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-unification-modulo-sigma-alone-2305.06214"/></url>
<url><loc>https://scifaro.com/en/abs/layered-modal-type-theories-2305.06548</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/layered-modal-type-theories-2305.06548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/layered-modal-type-theories-2305.06548"/></url>
<url><loc>https://scifaro.com/en/abs/how-much-partiality-is-needed-for-a-theory-of-computability-2305.06982</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-much-partiality-is-needed-for-a-theory-of-computability-2305.06982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-much-partiality-is-needed-for-a-theory-of-computability-2305.06982"/></url>
<url><loc>https://scifaro.com/en/abs/shhh-the-logic-of-clandestine-operations-2305.07035</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shhh-the-logic-of-clandestine-operations-2305.07035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shhh-the-logic-of-clandestine-operations-2305.07035"/></url>
<url><loc>https://scifaro.com/en/abs/lattice-preserving-mathcal-alc-ontology-embeddings-with-saturation-2305.07163</loc><lastmod>2024-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lattice-preserving-mathcal-alc-ontology-embeddings-with-saturation-2305.07163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lattice-preserving-mathcal-alc-ontology-embeddings-with-saturation-2305.07163"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-verification-of-disjunctive-timed-networks-2305.07295</loc><lastmod>2024-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-verification-of-disjunctive-timed-networks-2305.07295"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-verification-of-disjunctive-timed-networks-2305.07295"/></url>
<url><loc>https://scifaro.com/en/abs/truth-values-algebras-and-proof-normalization-2305.07311</loc><lastmod>2023-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truth-values-algebras-and-proof-normalization-2305.07311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truth-values-algebras-and-proof-normalization-2305.07311"/></url>
<url><loc>https://scifaro.com/en/abs/eigenvariables-bracketing-and-the-decidability-of-positive-minimal-predicate-logic-2305.08416</loc><lastmod>2023-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eigenvariables-bracketing-and-the-decidability-of-positive-minimal-predicate-logic-2305.08416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eigenvariables-bracketing-and-the-decidability-of-positive-minimal-predicate-logic-2305.08416"/></url>
<url><loc>https://scifaro.com/en/abs/tractable-and-intractable-entailment-problems-in-separation-logic-with-inductively-defined-predicates-2305.08419</loc><lastmod>2025-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tractable-and-intractable-entailment-problems-in-separation-logic-with-inductively-defined-predicates-2305.08419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tractable-and-intractable-entailment-problems-in-separation-logic-with-inductively-defined-predicates-2305.08419"/></url>
<url><loc>https://scifaro.com/en/abs/rdf-surfaces-computer-says-no-2305.08476</loc><lastmod>2023-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rdf-surfaces-computer-says-no-2305.08476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rdf-surfaces-computer-says-no-2305.08476"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-taylor-expansion-2305.08489</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-taylor-expansion-2305.08489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-taylor-expansion-2305.08489"/></url>
<url><loc>https://scifaro.com/en/abs/depth-bounded-epistemic-logic-2305.08607</loc><lastmod>2023-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/depth-bounded-epistemic-logic-2305.08607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/depth-bounded-epistemic-logic-2305.08607"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-string-diagrams-for-computer-scientists-2305.08768</loc><lastmod>2023-11-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-string-diagrams-for-computer-scientists-2305.08768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-string-diagrams-for-computer-scientists-2305.08768"/></url>
<url><loc>https://scifaro.com/en/abs/slow-down-move-over-a-case-study-in-formal-verification-refinement-and-testing-of-the-responsibility-sensitive-safety-model-for-self-driving-cars-2305.08812</loc><lastmod>2023-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/slow-down-move-over-a-case-study-in-formal-verification-refinement-and-testing-of-the-responsibility-sensitive-safety-model-for-self-driving-cars-2305.08812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/slow-down-move-over-a-case-study-in-formal-verification-refinement-and-testing-of-the-responsibility-sensitive-safety-model-for-self-driving-cars-2305.08812"/></url>
<url><loc>https://scifaro.com/en/abs/fermat-s-last-theorem-for-regular-primes-2305.08955</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fermat-s-last-theorem-for-regular-primes-2305.08955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fermat-s-last-theorem-for-regular-primes-2305.08955"/></url>
<url><loc>https://scifaro.com/en/abs/what-do-we-know-when-we-know-that-a-theory-is-consistent-2305.10012</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-do-we-know-when-we-know-that-a-theory-is-consistent-2305.10012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-do-we-know-when-we-know-that-a-theory-is-consistent-2305.10012"/></url>
<url><loc>https://scifaro.com/en/abs/a-constructive-proof-of-skolem-theorem-for-constructive-logic-2305.10016</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constructive-proof-of-skolem-theorem-for-constructive-logic-2305.10016"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constructive-proof-of-skolem-theorem-for-constructive-logic-2305.10016"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-and-incremental-repair-for-speculative-information-leaks-2305.10092</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-and-incremental-repair-for-speculative-information-leaks-2305.10092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-and-incremental-repair-for-speculative-information-leaks-2305.10092"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-gaussian-elimination-2305.10125</loc><lastmod>2023-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-gaussian-elimination-2305.10125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-gaussian-elimination-2305.10125"/></url>
<url><loc>https://scifaro.com/en/abs/cool-2-a-generic-reasoner-for-modal-fixpoint-logics-2305.11015</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cool-2-a-generic-reasoner-for-modal-fixpoint-logics-2305.11015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cool-2-a-generic-reasoner-for-modal-fixpoint-logics-2305.11015"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-inner-structure-of-multirelations-2305.11342</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-inner-structure-of-multirelations-2305.11342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-inner-structure-of-multirelations-2305.11342"/></url>
<url><loc>https://scifaro.com/en/abs/determinism-of-multirelations-2305.11344</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/determinism-of-multirelations-2305.11344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/determinism-of-multirelations-2305.11344"/></url>
<url><loc>https://scifaro.com/en/abs/modal-algebra-of-multirelations-2305.11346</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-algebra-of-multirelations-2305.11346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-algebra-of-multirelations-2305.11346"/></url>
<url><loc>https://scifaro.com/en/abs/choose-your-colour-tree-interpolation-for-quantified-formulas-in-smt-2305.11667</loc><lastmod>2023-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choose-your-colour-tree-interpolation-for-quantified-formulas-in-smt-2305.11667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choose-your-colour-tree-interpolation-for-quantified-formulas-in-smt-2305.11667"/></url>
<url><loc>https://scifaro.com/en/abs/proving-almost-sure-innermost-termination-of-probabilistic-term-rewriting-using-dependency-pairs-2305.11741</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-almost-sure-innermost-termination-of-probabilistic-term-rewriting-using-dependency-pairs-2305.11741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-almost-sure-innermost-termination-of-probabilistic-term-rewriting-using-dependency-pairs-2305.11741"/></url>
<url><loc>https://scifaro.com/en/abs/making-textsf-ip-textsf-pspace-practical-efficient-interactive-protocols-for-bdd-algorithms-2305.11813</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/making-textsf-ip-textsf-pspace-practical-efficient-interactive-protocols-for-bdd-algorithms-2305.11813"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/making-textsf-ip-textsf-pspace-practical-efficient-interactive-protocols-for-bdd-algorithms-2305.11813"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-neural-network-training-and-etr-extensions-with-effectively-continuous-functions-2305.11833</loc><lastmod>2023-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-neural-network-training-and-etr-extensions-with-effectively-continuous-functions-2305.11833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-neural-network-training-and-etr-extensions-with-effectively-continuous-functions-2305.11833"/></url>
<url><loc>https://scifaro.com/en/abs/proving-termination-of-c-programs-with-lists-2305.12159</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-termination-of-c-programs-with-lists-2305.12159"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-termination-of-c-programs-with-lists-2305.12159"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-international-workshop-on-methodologies-for-translating-legal-norms-into-formal-representations-ln2fr-2022-in-association-with-35th-international-conference-on-legal-knowledge-and-information-systems-jurix-2022-2305.12203</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-international-workshop-on-methodologies-for-translating-legal-norms-into-formal-representations-ln2fr-2022-in-association-with-35th-international-conference-on-legal-knowledge-and-information-systems-jurix-2022-2305.12203"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-international-workshop-on-methodologies-for-translating-legal-norms-into-formal-representations-ln2fr-2022-in-association-with-35th-international-conference-on-legal-knowledge-and-information-systems-jurix-2022-2305.12203"/></url>
<url><loc>https://scifaro.com/en/abs/simply-typed-convertibility-is-tower-complete-even-for-safe-lambda-terms-2305.12601</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simply-typed-convertibility-is-tower-complete-even-for-safe-lambda-terms-2305.12601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simply-typed-convertibility-is-tower-complete-even-for-safe-lambda-terms-2305.12601"/></url>
<url><loc>https://scifaro.com/en/abs/scl-fol-can-simulate-non-redundant-superposition-clause-learning-2305.12926</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scl-fol-can-simulate-non-redundant-superposition-clause-learning-2305.12926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scl-fol-can-simulate-non-redundant-superposition-clause-learning-2305.12926"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-proof-theory-i-sequent-systems-on-undirected-graphs-2305.12975</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-proof-theory-i-sequent-systems-on-undirected-graphs-2305.12975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-proof-theory-i-sequent-systems-on-undirected-graphs-2305.12975"/></url>
<url><loc>https://scifaro.com/en/abs/an-asp-framework-for-the-refinement-of-authorization-and-obligation-policies-2305.13190</loc><lastmod>2023-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-asp-framework-for-the-refinement-of-authorization-and-obligation-policies-2305.13190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-asp-framework-for-the-refinement-of-authorization-and-obligation-policies-2305.13190"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-as-a-cut-elimination-property-2305.13790</loc><lastmod>2023-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-as-a-cut-elimination-property-2305.13790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-as-a-cut-elimination-property-2305.13790"/></url>
<url><loc>https://scifaro.com/en/abs/search-and-explore-symbiotic-policy-synthesis-in-pomdps-2305.14149</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/search-and-explore-symbiotic-policy-synthesis-in-pomdps-2305.14149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/search-and-explore-symbiotic-policy-synthesis-in-pomdps-2305.14149"/></url>
<url><loc>https://scifaro.com/en/abs/abstraction-of-nondeterministic-situation-calculus-action-theories-extended-version-2305.14222</loc><lastmod>2023-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstraction-of-nondeterministic-situation-calculus-action-theories-extended-version-2305.14222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstraction-of-nondeterministic-situation-calculus-action-theories-extended-version-2305.14222"/></url>
<url><loc>https://scifaro.com/en/abs/preliminary-investigations-on-induction-over-real-numbers-2305.14803</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preliminary-investigations-on-induction-over-real-numbers-2305.14803"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preliminary-investigations-on-induction-over-real-numbers-2305.14803"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-difference-logic-over-the-reals-with-uninterpreted-unary-predicates-2305.15059</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-difference-logic-over-the-reals-with-uninterpreted-unary-predicates-2305.15059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-difference-logic-over-the-reals-with-uninterpreted-unary-predicates-2305.15059"/></url>
<url><loc>https://scifaro.com/en/abs/benchmarking-optimization-solvers-and-symmetry-breakers-for-the-automated-deployment-of-component-based-applications-in-the-cloud-extended-abstract-2305.15231</loc><lastmod>2023-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/benchmarking-optimization-solvers-and-symmetry-breakers-for-the-automated-deployment-of-component-based-applications-in-the-cloud-extended-abstract-2305.15231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/benchmarking-optimization-solvers-and-symmetry-breakers-for-the-automated-deployment-of-component-based-applications-in-the-cloud-extended-abstract-2305.15231"/></url>
<url><loc>https://scifaro.com/en/abs/on-program-completion-with-an-application-to-the-sum-and-product-puzzle-2305.15360</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-program-completion-with-an-application-to-the-sum-and-product-puzzle-2305.15360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-program-completion-with-an-application-to-the-sum-and-product-puzzle-2305.15360"/></url>
<url><loc>https://scifaro.com/en/abs/theorem-proving-in-dependently-typed-higher-order-logic-extended-preprint-2305.15382</loc><lastmod>2023-05-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theorem-proving-in-dependently-typed-higher-order-logic-extended-preprint-2305.15382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theorem-proving-in-dependently-typed-higher-order-logic-extended-preprint-2305.15382"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-a-theory-2305.15780</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-a-theory-2305.15780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-a-theory-2305.15780"/></url>
<url><loc>https://scifaro.com/en/abs/binding-logic-proofs-and-models-2305.15782</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binding-logic-proofs-and-models-2305.15782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binding-logic-proofs-and-models-2305.15782"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-simply-typed-functional-machine-calculus-categorical-semantics-and-strong-normalisation-2305.16073</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-simply-typed-functional-machine-calculus-categorical-semantics-and-strong-normalisation-2305.16073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-simply-typed-functional-machine-calculus-categorical-semantics-and-strong-normalisation-2305.16073"/></url>
<url><loc>https://scifaro.com/en/abs/solving-infinite-state-games-via-acceleration-full-version-2305.16118</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-infinite-state-games-via-acceleration-full-version-2305.16118"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-infinite-state-games-via-acceleration-full-version-2305.16118"/></url>
<url><loc>https://scifaro.com/en/abs/minimally-comparing-relational-abstract-domains-2305.16212</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimally-comparing-relational-abstract-domains-2305.16212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimally-comparing-relational-abstract-domains-2305.16212"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-interpretation-of-asynchronous-multiparty-compatibility-2305.16240</loc><lastmod>2023-05-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-interpretation-of-asynchronous-multiparty-compatibility-2305.16240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-interpretation-of-asynchronous-multiparty-compatibility-2305.16240"/></url>
<url><loc>https://scifaro.com/en/abs/mdps-as-distribution-transformers-affine-invariant-synthesis-for-safety-objectives-2305.16796</loc><lastmod>2023-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mdps-as-distribution-transformers-affine-invariant-synthesis-for-safety-objectives-2305.16796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mdps-as-distribution-transformers-affine-invariant-synthesis-for-safety-objectives-2305.16796"/></url>
<url><loc>https://scifaro.com/en/abs/combining-global-and-local-merges-in-logic-based-entity-resolution-2305.16926</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-global-and-local-merges-in-logic-based-entity-resolution-2305.16926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-global-and-local-merges-in-logic-based-entity-resolution-2305.16926"/></url>
<url><loc>https://scifaro.com/en/abs/policy-synthesis-and-reinforcement-learning-for-discounted-ltl-2305.17115</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/policy-synthesis-and-reinforcement-learning-for-discounted-ltl-2305.17115"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/policy-synthesis-and-reinforcement-learning-for-discounted-ltl-2305.17115"/></url>
<url><loc>https://scifaro.com/en/abs/meta-metta-an-operational-semantics-for-metta-2305.17218</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meta-metta-an-operational-semantics-for-metta-2305.17218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meta-metta-an-operational-semantics-for-metta-2305.17218"/></url>
<url><loc>https://scifaro.com/en/abs/external-behavior-of-a-logic-program-and-verification-of-refactoring-2305.17485</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/external-behavior-of-a-logic-program-and-verification-of-refactoring-2305.17485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/external-behavior-of-a-logic-program-and-verification-of-refactoring-2305.17485"/></url>
<url><loc>https://scifaro.com/en/abs/closure-certificates-2305.17519</loc><lastmod>2024-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-certificates-2305.17519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-certificates-2305.17519"/></url>
<url><loc>https://scifaro.com/en/abs/context-aided-variable-elimination-for-requirement-engineering-2305.17596</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-aided-variable-elimination-for-requirement-engineering-2305.17596"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-aided-variable-elimination-for-requirement-engineering-2305.17596"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-branching-time-spectroscopy-accounting-for-silent-steps-2305.17671</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-branching-time-spectroscopy-accounting-for-silent-steps-2305.17671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-branching-time-spectroscopy-accounting-for-silent-steps-2305.17671"/></url>
<url><loc>https://scifaro.com/en/abs/second-order-hyperproperties-2305.17935</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/second-order-hyperproperties-2305.17935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/second-order-hyperproperties-2305.17935"/></url>
<url><loc>https://scifaro.com/en/abs/trace-models-of-concurrent-valuation-algebras-2305.18017</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trace-models-of-concurrent-valuation-algebras-2305.18017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trace-models-of-concurrent-valuation-algebras-2305.18017"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-of-mso-transductions-2305.18039</loc><lastmod>2023-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-of-mso-transductions-2305.18039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-of-mso-transductions-2305.18039"/></url>
<url><loc>https://scifaro.com/en/abs/on-complexity-bounds-and-confluence-of-parallel-term-rewriting-2305.18250</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-complexity-bounds-and-confluence-of-parallel-term-rewriting-2305.18250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-complexity-bounds-and-confluence-of-parallel-term-rewriting-2305.18250"/></url>
<url><loc>https://scifaro.com/en/abs/delbugv-delta-debugging-neural-network-verifiers-2305.18558</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delbugv-delta-debugging-neural-network-verifiers-2305.18558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delbugv-delta-debugging-neural-network-verifiers-2305.18558"/></url>
<url><loc>https://scifaro.com/en/abs/the-alternating-time-mu-calculus-with-disjunctive-explicit-strategies-2305.18795</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-alternating-time-mu-calculus-with-disjunctive-explicit-strategies-2305.18795"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-alternating-time-mu-calculus-with-disjunctive-explicit-strategies-2305.18795"/></url>
<url><loc>https://scifaro.com/en/abs/the-stratified-foundations-as-a-theory-modulo-2305.18837</loc><lastmod>2023-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stratified-foundations-as-a-theory-modulo-2305.18837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stratified-foundations-as-a-theory-modulo-2305.18837"/></url>
<url><loc>https://scifaro.com/en/abs/string-diagrams-for-lambda-calculi-and-functional-computation-2305.18945</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/string-diagrams-for-lambda-calculi-and-functional-computation-2305.18945"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/string-diagrams-for-lambda-calculi-and-functional-computation-2305.18945"/></url>
<url><loc>https://scifaro.com/en/abs/logics-with-probabilistic-team-semantics-and-the-boolean-negation-2306.00420</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-with-probabilistic-team-semantics-and-the-boolean-negation-2306.00420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-with-probabilistic-team-semantics-and-the-boolean-negation-2306.00420"/></url>
<url><loc>https://scifaro.com/en/abs/disjoint-partial-enumeration-without-blocking-clauses-2306.00461</loc><lastmod>2026-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjoint-partial-enumeration-without-blocking-clauses-2306.00461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjoint-partial-enumeration-without-blocking-clauses-2306.00461"/></url>
<url><loc>https://scifaro.com/en/abs/from-proof-theory-to-theories-theory-2306.00478</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-proof-theory-to-theories-theory-2306.00478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-proof-theory-to-theories-theory-2306.00478"/></url>
<url><loc>https://scifaro.com/en/abs/axioms-vs-rewrite-rules-from-completeness-to-cut-elimination-2306.00495</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axioms-vs-rewrite-rules-from-completeness-to-cut-elimination-2306.00495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axioms-vs-rewrite-rules-from-completeness-to-cut-elimination-2306.00495"/></url>
<url><loc>https://scifaro.com/en/abs/automated-theorem-proving-in-first-order-logic-modulo-on-the-difference-between-type-theory-and-set-theory-2306.00498</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-theorem-proving-in-first-order-logic-modulo-on-the-difference-between-type-theory-and-set-theory-2306.00498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-theorem-proving-in-first-order-logic-modulo-on-the-difference-between-type-theory-and-set-theory-2306.00498"/></url>
<url><loc>https://scifaro.com/en/abs/representation-theorems-obtained-by-miningacross-web-sources-for-hints-2306.00584</loc><lastmod>2023-06-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representation-theorems-obtained-by-miningacross-web-sources-for-hints-2306.00584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representation-theorems-obtained-by-miningacross-web-sources-for-hints-2306.00584"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-inheritance-hazards-in-dependently-typed-algebraic-hierarchies-2306.00617</loc><lastmod>2023-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-inheritance-hazards-in-dependently-typed-algebraic-hierarchies-2306.00617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-inheritance-hazards-in-dependently-typed-algebraic-hierarchies-2306.00617"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-motion-planning-of-arbitrarily-many-robots-gadgets-petri-nets-and-counter-machines-2306.01193</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-motion-planning-of-arbitrarily-many-robots-gadgets-petri-nets-and-counter-machines-2306.01193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-motion-planning-of-arbitrarily-many-robots-gadgets-petri-nets-and-counter-machines-2306.01193"/></url>
<url><loc>https://scifaro.com/en/abs/the-logic-of-temporal-domination-2306.01455</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-logic-of-temporal-domination-2306.01455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-logic-of-temporal-domination-2306.01455"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-proving-polyhedral-reductions-2306.01466</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-proving-polyhedral-reductions-2306.01466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-proving-polyhedral-reductions-2306.01466"/></url>
<url><loc>https://scifaro.com/en/abs/third-order-matching-is-decidable-2306.01473</loc><lastmod>2023-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/third-order-matching-is-decidable-2306.01473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/third-order-matching-is-decidable-2306.01473"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-graded-semantics-and-spectra-of-behavioural-metrics-2306.01487</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-graded-semantics-and-spectra-of-behavioural-metrics-2306.01487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-graded-semantics-and-spectra-of-behavioural-metrics-2306.01487"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-broadcast-networks-with-registers-from-np-to-the-frontiers-of-decidability-2306.01517</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-broadcast-networks-with-registers-from-np-to-the-frontiers-of-decidability-2306.01517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-broadcast-networks-with-registers-from-np-to-the-frontiers-of-decidability-2306.01517"/></url>
<url><loc>https://scifaro.com/en/abs/towards-efficient-controller-synthesis-techniques-for-logical-ltl-games-2306.02427</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-efficient-controller-synthesis-techniques-for-logical-ltl-games-2306.02427"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-efficient-controller-synthesis-techniques-for-logical-ltl-games-2306.02427"/></url>
<url><loc>https://scifaro.com/en/abs/connecting-proof-theory-and-knowledge-representation-sequent-calculi-and-the-chase-with-existential-rules-2306.02521</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connecting-proof-theory-and-knowledge-representation-sequent-calculi-and-the-chase-with-existential-rules-2306.02521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connecting-proof-theory-and-knowledge-representation-sequent-calculi-and-the-chase-with-existential-rules-2306.02521"/></url>
<url><loc>https://scifaro.com/en/abs/on-simple-expectations-and-observations-of-intelligent-agents-a-complexity-study-2306.02769</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-simple-expectations-and-observations-of-intelligent-agents-a-complexity-study-2306.02769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-simple-expectations-and-observations-of-intelligent-agents-a-complexity-study-2306.02769"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-autoepistemic-logic-semantics-complexity-and-applications-to-access-control-2306.02774</loc><lastmod>2023-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-autoepistemic-logic-semantics-complexity-and-applications-to-access-control-2306.02774"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-autoepistemic-logic-semantics-complexity-and-applications-to-access-control-2306.02774"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-distributed-protocols-by-enumeration-modulo-isomorphisms-2306.02967</loc><lastmod>2023-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-distributed-protocols-by-enumeration-modulo-isomorphisms-2306.02967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-distributed-protocols-by-enumeration-modulo-isomorphisms-2306.02967"/></url>
<url><loc>https://scifaro.com/en/abs/designing-equilibria-in-concurrent-games-with-social-welfare-and-temporal-logic-constraints-2306.03045</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/designing-equilibria-in-concurrent-games-with-social-welfare-and-temporal-logic-constraints-2306.03045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/designing-equilibria-in-concurrent-games-with-social-welfare-and-temporal-logic-constraints-2306.03045"/></url>
<url><loc>https://scifaro.com/en/abs/mathematical-foundations-for-joining-only-knowing-and-common-knowledge-extended-version-2306.03267</loc><lastmod>2023-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mathematical-foundations-for-joining-only-knowing-and-common-knowledge-extended-version-2306.03267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mathematical-foundations-for-joining-only-knowing-and-common-knowledge-extended-version-2306.03267"/></url>
<url><loc>https://scifaro.com/en/abs/range-restricted-interpolation-through-clausal-tableaux-2306.03572</loc><lastmod>2023-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/range-restricted-interpolation-through-clausal-tableaux-2306.03572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/range-restricted-interpolation-through-clausal-tableaux-2306.03572"/></url>
<url><loc>https://scifaro.com/en/abs/an-ecumenical-view-of-proof-theoretic-semantics-2306.03656</loc><lastmod>2025-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-ecumenical-view-of-proof-theoretic-semantics-2306.03656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-ecumenical-view-of-proof-theoretic-semantics-2306.03656"/></url>
<url><loc>https://scifaro.com/en/abs/fractals-from-regular-behaviours-2306.03894</loc><lastmod>2025-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fractals-from-regular-behaviours-2306.03894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fractals-from-regular-behaviours-2306.03894"/></url>
<url><loc>https://scifaro.com/en/abs/fully-automated-verification-of-linear-time-invariant-systems-against-signal-temporal-logic-specifications-via-reachability-analysis-2306.04089</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-automated-verification-of-linear-time-invariant-systems-against-signal-temporal-logic-specifications-via-reachability-analysis-2306.04089"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-automated-verification-of-linear-time-invariant-systems-against-signal-temporal-logic-specifications-via-reachability-analysis-2306.04089"/></url>
<url><loc>https://scifaro.com/en/abs/synthesising-recursive-functions-for-first-order-model-counting-challenges-progress-and-conjectures-2306.04189</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesising-recursive-functions-for-first-order-model-counting-challenges-progress-and-conjectures-2306.04189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesising-recursive-functions-for-first-order-model-counting-challenges-progress-and-conjectures-2306.04189"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-quantification-over-automata-2306.04210</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-quantification-over-automata-2306.04210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-quantification-over-automata-2306.04210"/></url>
<url><loc>https://scifaro.com/en/abs/anticipating-accidents-through-reasoned-simulation-2306.04499</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anticipating-accidents-through-reasoned-simulation-2306.04499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anticipating-accidents-through-reasoned-simulation-2306.04499"/></url>
<url><loc>https://scifaro.com/en/abs/rtaeval-a-framework-for-evaluating-runtime-assurance-logic-2306.04585</loc><lastmod>2023-06-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rtaeval-a-framework-for-evaluating-runtime-assurance-logic-2306.04585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rtaeval-a-framework-for-evaluating-runtime-assurance-logic-2306.04585"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theoretic-semantics-for-intuitionistic-multiplicative-linear-logic-extended-abstract-2306.05106</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theoretic-semantics-for-intuitionistic-multiplicative-linear-logic-extended-abstract-2306.05106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theoretic-semantics-for-intuitionistic-multiplicative-linear-logic-extended-abstract-2306.05106"/></url>
<url><loc>https://scifaro.com/en/abs/if-at-first-you-don-t-succeed-extended-monitorability-through-multiple-executions-2306.05229</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/if-at-first-you-don-t-succeed-extended-monitorability-through-multiple-executions-2306.05229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/if-at-first-you-don-t-succeed-extended-monitorability-through-multiple-executions-2306.05229"/></url>
<url><loc>https://scifaro.com/en/abs/robust-probabilistic-temporal-logics-2306.05806</loc><lastmod>2024-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-probabilistic-temporal-logics-2306.05806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-probabilistic-temporal-logics-2306.05806"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-proof-synthesis-method-for-the-cube-of-type-systems-2306.05835</loc><lastmod>2023-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-proof-synthesis-method-for-the-cube-of-type-systems-2306.05835"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-proof-synthesis-method-for-the-cube-of-type-systems-2306.05835"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-pattern-matching-in-calculi-where-primitive-recursive-functions-are-representable-2306.05876</loc><lastmod>2023-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-pattern-matching-in-calculi-where-primitive-recursive-functions-are-representable-2306.05876"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-pattern-matching-in-calculi-where-primitive-recursive-functions-are-representable-2306.05876"/></url>
<url><loc>https://scifaro.com/en/abs/process-algebra-with-imperfect-actions-2306.06356</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-algebra-with-imperfect-actions-2306.06356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-algebra-with-imperfect-actions-2306.06356"/></url>
<url><loc>https://scifaro.com/en/abs/enjoy-the-silence-analysis-of-stochastic-petri-nets-with-silent-transitions-2306.06376</loc><lastmod>2023-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enjoy-the-silence-analysis-of-stochastic-petri-nets-with-silent-transitions-2306.06376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enjoy-the-silence-analysis-of-stochastic-petri-nets-with-silent-transitions-2306.06376"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-for-intermediate-logics-the-case-of-g-odel-dummett-logics-2306.07550</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-for-intermediate-logics-the-case-of-g-odel-dummett-logics-2306.07550"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-for-intermediate-logics-the-case-of-g-odel-dummett-logics-2306.07550"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-typability-in-the-lambda-pi-calculus-2306.07599</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-typability-in-the-lambda-pi-calculus-2306.07599"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-typability-in-the-lambda-pi-calculus-2306.07599"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-model-semantics-of-datalog-with-metric-temporal-operators-2306.07625</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-model-semantics-of-datalog-with-metric-temporal-operators-2306.07625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-model-semantics-of-datalog-with-metric-temporal-operators-2306.07625"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-iterative-programs-with-distributed-data-collections-2306.07690</loc><lastmod>2023-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-iterative-programs-with-distributed-data-collections-2306.07690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-iterative-programs-with-distributed-data-collections-2306.07690"/></url>
<url><loc>https://scifaro.com/en/abs/counterfactuals-modulo-temporal-logics-2306.08916</loc><lastmod>2023-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterfactuals-modulo-temporal-logics-2306.08916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterfactuals-modulo-temporal-logics-2306.08916"/></url>
<url><loc>https://scifaro.com/en/abs/category-theory-in-isabelle-hol-as-a-basis-for-meta-logical-investigation-2306.09074</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/category-theory-in-isabelle-hol-as-a-basis-for-meta-logical-investigation-2306.09074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/category-theory-in-isabelle-hol-as-a-basis-for-meta-logical-investigation-2306.09074"/></url>
<url><loc>https://scifaro.com/en/abs/schematic-unification-2306.09152</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/schematic-unification-2306.09152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/schematic-unification-2306.09152"/></url>
<url><loc>https://scifaro.com/en/abs/complete-trigger-selection-in-satisfiability-modulo-first-order-theories-2306.09436</loc><lastmod>2023-06-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-trigger-selection-in-satisfiability-modulo-first-order-theories-2306.09436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-trigger-selection-in-satisfiability-modulo-first-order-theories-2306.09436"/></url>
<url><loc>https://scifaro.com/en/abs/streamlining-input-output-logics-with-sequent-calculi-2306.09496</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/streamlining-input-output-logics-with-sequent-calculi-2306.09496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/streamlining-input-output-logics-with-sequent-calculi-2306.09496"/></url>
<url><loc>https://scifaro.com/en/abs/a-connection-method-for-a-defeasible-extension-of-mathcal-alch-2306.09561</loc><lastmod>2023-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-connection-method-for-a-defeasible-extension-of-mathcal-alch-2306.09561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-connection-method-for-a-defeasible-extension-of-mathcal-alch-2306.09561"/></url>
<url><loc>https://scifaro.com/en/abs/fast-approximations-of-quantifier-elimination-2306.10009</loc><lastmod>2023-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-approximations-of-quantifier-elimination-2306.10009"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-approximations-of-quantifier-elimination-2306.10009"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-induction-principle-for-nested-data-types-2306.10124</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-induction-principle-for-nested-data-types-2306.10124"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-induction-principle-for-nested-data-types-2306.10124"/></url>
<url><loc>https://scifaro.com/en/abs/notes-on-bounds-on-bdd-based-bucket-elimination-2306.10337</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/notes-on-bounds-on-bdd-based-bucket-elimination-2306.10337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/notes-on-bounds-on-bdd-based-bucket-elimination-2306.10337"/></url>
<url><loc>https://scifaro.com/en/abs/universal-quantification-makes-automatic-structures-hard-to-decide-2306.10432</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/universal-quantification-makes-automatic-structures-hard-to-decide-2306.10432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/universal-quantification-makes-automatic-structures-hard-to-decide-2306.10432"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-formalisation-of-original-representation-theorems-2306.10558</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-formalisation-of-original-representation-theorems-2306.10558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-formalisation-of-original-representation-theorems-2306.10558"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-fly-unfolding-with-optimal-exploration-for-linear-temporal-logic-model-checking-of-concurrent-software-and-systems-2306.10707</loc><lastmod>2024-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-fly-unfolding-with-optimal-exploration-for-linear-temporal-logic-model-checking-of-concurrent-software-and-systems-2306.10707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-fly-unfolding-with-optimal-exploration-for-linear-temporal-logic-model-checking-of-concurrent-software-and-systems-2306.10707"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-probabilistic-routes-2306.10736</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-probabilistic-routes-2306.10736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-probabilistic-routes-2306.10736"/></url>
<url><loc>https://scifaro.com/en/abs/inc-a-scalable-incremental-weighted-sampler-2306.10824</loc><lastmod>2023-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inc-a-scalable-incremental-weighted-sampler-2306.10824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inc-a-scalable-incremental-weighted-sampler-2306.10824"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-logical-zonotope-a-set-representation-for-reachability-analysis-of-logical-systems-2306.12508</loc><lastmod>2024-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-logical-zonotope-a-set-representation-for-reachability-analysis-of-logical-systems-2306.12508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-logical-zonotope-a-set-representation-for-reachability-analysis-of-logical-systems-2306.12508"/></url>
<url><loc>https://scifaro.com/en/abs/decidable-exponentials-in-nonassociative-noncommutative-linear-logic-2306.12661</loc><lastmod>2023-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidable-exponentials-in-nonassociative-noncommutative-linear-logic-2306.12661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidable-exponentials-in-nonassociative-noncommutative-linear-logic-2306.12661"/></url>
<url><loc>https://scifaro.com/en/abs/a-fully-abstract-model-of-pcf-based-on-extended-addressing-machines-2306.13756</loc><lastmod>2025-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fully-abstract-model-of-pcf-based-on-extended-addressing-machines-2306.13756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fully-abstract-model-of-pcf-based-on-extended-addressing-machines-2306.13756"/></url>
<url><loc>https://scifaro.com/en/abs/sem-enov-arithmetic-affine-vass-and-string-constraints-2306.14593</loc><lastmod>2023-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sem-enov-arithmetic-affine-vass-and-string-constraints-2306.14593"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sem-enov-arithmetic-affine-vass-and-string-constraints-2306.14593"/></url>
<url><loc>https://scifaro.com/en/abs/g-odel-dummett-linear-temporal-logic-2306.15805</loc><lastmod>2023-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/g-odel-dummett-linear-temporal-logic-2306.15805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/g-odel-dummett-linear-temporal-logic-2306.15805"/></url>
<url><loc>https://scifaro.com/en/abs/cartesian-institutions-with-evidence-data-and-system-modelling-with-diagrammatic-constraints-and-generalized-sketches-2306.16284</loc><lastmod>2023-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cartesian-institutions-with-evidence-data-and-system-modelling-with-diagrammatic-constraints-and-generalized-sketches-2306.16284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cartesian-institutions-with-evidence-data-and-system-modelling-with-diagrammatic-constraints-and-generalized-sketches-2306.16284"/></url>
<url><loc>https://scifaro.com/en/abs/proving-confluence-in-the-confluence-framework-with-confident-2306.16330</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-confluence-in-the-confluence-framework-with-confident-2306.16330"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-confluence-in-the-confluence-framework-with-confident-2306.16330"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-core-spanner-inexpressibility-via-ehrenfeucht-fra-iss-e-games-for-fc-2306.16364</loc><lastmod>2023-06-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-core-spanner-inexpressibility-via-ehrenfeucht-fra-iss-e-games-for-fc-2306.16364"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-core-spanner-inexpressibility-via-ehrenfeucht-fra-iss-e-games-for-fc-2306.16364"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-predicate-logical-theories-of-real-valued-functions-2306.16505</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-predicate-logical-theories-of-real-valued-functions-2306.16505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-predicate-logical-theories-of-real-valued-functions-2306.16505"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-logic-programming-for-legal-reasoning-2306.16632</loc><lastmod>2023-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-logic-programming-for-legal-reasoning-2306.16632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-logic-programming-for-legal-reasoning-2306.16632"/></url>
<url><loc>https://scifaro.com/en/abs/free-dcpo-algebras-via-directed-spaces-2306.16806</loc><lastmod>2023-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/free-dcpo-algebras-via-directed-spaces-2306.16806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/free-dcpo-algebras-via-directed-spaces-2306.16806"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-results-for-modal-logic-with-recursion-via-translations-and-tableaux-2306.16881</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-results-for-modal-logic-with-recursion-via-translations-and-tableaux-2306.16881"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-results-for-modal-logic-with-recursion-via-translations-and-tableaux-2306.16881"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-norm-extensions-and-applications-to-number-theory-2306.17234</loc><lastmod>2023-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-norm-extensions-and-applications-to-number-theory-2306.17234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-norm-extensions-and-applications-to-number-theory-2306.17234"/></url>
<url><loc>https://scifaro.com/en/abs/speculative-sat-modulo-sat-2306.17765</loc><lastmod>2023-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/speculative-sat-modulo-sat-2306.17765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/speculative-sat-modulo-sat-2306.17765"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-satisfiability-checking-for-symbolic-finite-automata-2307.00151</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-checking-for-symbolic-finite-automata-2307.00151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-satisfiability-checking-for-symbolic-finite-automata-2307.00151"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-the-specification-decomposition-for-synthesis-based-on-ltl-solvers-2307.00540</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-the-specification-decomposition-for-synthesis-based-on-ltl-solvers-2307.00540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-the-specification-decomposition-for-synthesis-based-on-ltl-solvers-2307.00540"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-satisfiability-of-local-first-order-logics-with-data-2307.00831</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-satisfiability-of-local-first-order-logics-with-data-2307.00831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-satisfiability-of-local-first-order-logics-with-data-2307.00831"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-definition-of-the-eta-long-normal-form-in-type-systems-of-the-cube-2307.00854</loc><lastmod>2023-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-definition-of-the-eta-long-normal-form-in-type-systems-of-the-cube-2307.00854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-definition-of-the-eta-long-normal-form-in-type-systems-of-the-cube-2307.00854"/></url>
<url><loc>https://scifaro.com/en/abs/synthesising-full-information-protocols-2307.01063</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesising-full-information-protocols-2307.01063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesising-full-information-protocols-2307.01063"/></url>
<url><loc>https://scifaro.com/en/abs/meaning-and-identity-of-proofs-in-a-bilateralist-setting-a-two-sorted-typed-lambda-calculus-for-proofs-and-refutations-2307.01079</loc><lastmod>2024-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meaning-and-identity-of-proofs-in-a-bilateralist-setting-a-two-sorted-typed-lambda-calculus-for-proofs-and-refutations-2307.01079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meaning-and-identity-of-proofs-in-a-bilateralist-setting-a-two-sorted-typed-lambda-calculus-for-proofs-and-refutations-2307.01079"/></url>
<url><loc>https://scifaro.com/en/abs/twisted-cubes-and-their-applications-in-type-theory-2307.01327</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twisted-cubes-and-their-applications-in-type-theory-2307.01327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twisted-cubes-and-their-applications-in-type-theory-2307.01327"/></url>
<url><loc>https://scifaro.com/en/abs/focus-style-proofs-for-the-two-way-alternation-free-mu-calculus-2307.01773</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/focus-style-proofs-for-the-two-way-alternation-free-mu-calculus-2307.01773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/focus-style-proofs-for-the-two-way-alternation-free-mu-calculus-2307.01773"/></url>
<url><loc>https://scifaro.com/en/abs/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond-2307.01832</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond-2307.01832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond-2307.01832"/></url>
<url><loc>https://scifaro.com/en/abs/effective-auxiliary-variables-via-structured-reencoding-2307.01904</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-auxiliary-variables-via-structured-reencoding-2307.01904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-auxiliary-variables-via-structured-reencoding-2307.01904"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-formal-verification-of-the-lightning-network-with-tla-2307.02342</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-formal-verification-of-the-lightning-network-with-tla-2307.02342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-formal-verification-of-the-lightning-network-with-tla-2307.02342"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-results-for-an-inductive-logic-of-separated-relations-2307.02381</loc><lastmod>2023-07-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-results-for-an-inductive-logic-of-separated-relations-2307.02381"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-results-for-an-inductive-logic-of-separated-relations-2307.02381"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-way-to-negotiate-services-2307.02703</loc><lastmod>2023-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-way-to-negotiate-services-2307.02703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-way-to-negotiate-services-2307.02703"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-adjoints-in-property-directed-reachability-analysis-2307.02817</loc><lastmod>2023-07-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-adjoints-in-property-directed-reachability-analysis-2307.02817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-adjoints-in-property-directed-reachability-analysis-2307.02817"/></url>
<url><loc>https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-extended-version-2307.03059</loc><lastmod>2023-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-extended-version-2307.03059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-extended-version-2307.03059"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-ofworkflow-nets-with-tables-and-constraints-2307.03685</loc><lastmod>2023-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-ofworkflow-nets-with-tables-and-constraints-2307.03685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-ofworkflow-nets-with-tables-and-constraints-2307.03685"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-the-meaning-of-proofs-a-fregean-distinction-in-proof-theoretic-semantics-2307.03971</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-the-meaning-of-proofs-a-fregean-distinction-in-proof-theoretic-semantics-2307.03971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-the-meaning-of-proofs-a-fregean-distinction-in-proof-theoretic-semantics-2307.03971"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-nineteenth-conference-on-theoretical-aspects-of-rationality-and-knowledge-2307.04005</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-nineteenth-conference-on-theoretical-aspects-of-rationality-and-knowledge-2307.04005"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-nineteenth-conference-on-theoretical-aspects-of-rationality-and-knowledge-2307.04005"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-realizability-for-non-symmetric-closed-structures-2307.04119</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-realizability-for-non-symmetric-closed-structures-2307.04119"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-realizability-for-non-symmetric-closed-structures-2307.04119"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-finite-axiomatisation-of-the-equational-theory-of-common-meadows-2307.04270</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-finite-axiomatisation-of-the-equational-theory-of-common-meadows-2307.04270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-finite-axiomatisation-of-the-equational-theory-of-common-meadows-2307.04270"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-synthesis-for-data-words-revisited-2307.04499</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-synthesis-for-data-words-revisited-2307.04499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-synthesis-for-data-words-revisited-2307.04499"/></url>
<url><loc>https://scifaro.com/en/abs/deductive-controller-synthesis-for-probabilistic-hyperproperties-2307.04503</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deductive-controller-synthesis-for-probabilistic-hyperproperties-2307.04503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deductive-controller-synthesis-for-probabilistic-hyperproperties-2307.04503"/></url>
<url><loc>https://scifaro.com/en/abs/safety-analysis-of-parameterised-networks-with-non-blocking-rendez-vous-2307.04546</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-analysis-of-parameterised-networks-with-non-blocking-rendez-vous-2307.04546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-analysis-of-parameterised-networks-with-non-blocking-rendez-vous-2307.04546"/></url>
<url><loc>https://scifaro.com/en/abs/declarative-linearizability-proofs-for-descriptor-based-concurrent-helping-algorithms-2307.04653</loc><lastmod>2023-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/declarative-linearizability-proofs-for-descriptor-based-concurrent-helping-algorithms-2307.04653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/declarative-linearizability-proofs-for-descriptor-based-concurrent-helping-algorithms-2307.04653"/></url>
<url><loc>https://scifaro.com/en/abs/visibility-and-separability-for-a-declarative-linearizability-proof-of-the-timestamped-stack-extended-version-2307.04720</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visibility-and-separability-for-a-declarative-linearizability-proof-of-the-timestamped-stack-extended-version-2307.04720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visibility-and-separability-for-a-declarative-linearizability-proof-of-the-timestamped-stack-extended-version-2307.04720"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-parametric-lock-sharing-systems-against-regular-constraints-2307.04925</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-parametric-lock-sharing-systems-against-regular-constraints-2307.04925"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-parametric-lock-sharing-systems-against-regular-constraints-2307.04925"/></url>
<url><loc>https://scifaro.com/en/abs/simple-axioms-for-local-properties-2307.05040</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simple-axioms-for-local-properties-2307.05040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simple-axioms-for-local-properties-2307.05040"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-extended-abstract-2307.05041</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-extended-abstract-2307.05041"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-extended-abstract-2307.05041"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-finite-variable-occurrence-fragment-of-the-calculus-of-relations-with-bounded-dot-dagger-alternation-2307.05046</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-finite-variable-occurrence-fragment-of-the-calculus-of-relations-with-bounded-dot-dagger-alternation-2307.05046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-finite-variable-occurrence-fragment-of-the-calculus-of-relations-with-bounded-dot-dagger-alternation-2307.05046"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-look-at-awareness-models-and-their-dynamics-2307.05049</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-look-at-awareness-models-and-their-dynamics-2307.05049"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-look-at-awareness-models-and-their-dynamics-2307.05049"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-logics-of-structured-intensional-groups-2307.05056</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-logics-of-structured-intensional-groups-2307.05056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-logics-of-structured-intensional-groups-2307.05056"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-the-update-expressivity-of-communication-patterns-and-action-models-2307.05057</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-the-update-expressivity-of-communication-patterns-and-action-models-2307.05057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-the-update-expressivity-of-communication-patterns-and-action-models-2307.05057"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-of-arbitrary-public-announcement-logic-with-common-knowledge-is-sigma-1-1-hard-2307.05060</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-of-arbitrary-public-announcement-logic-with-common-knowledge-is-sigma-1-1-hard-2307.05060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-of-arbitrary-public-announcement-logic-with-common-knowledge-is-sigma-1-1-hard-2307.05060"/></url>
<url><loc>https://scifaro.com/en/abs/system-of-spheres-based-two-level-credibility-limited-revisions-2307.05062</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/system-of-spheres-based-two-level-credibility-limited-revisions-2307.05062"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/system-of-spheres-based-two-level-credibility-limited-revisions-2307.05062"/></url>
<url><loc>https://scifaro.com/en/abs/an-acceptance-semantics-for-stable-modal-knowledge-2307.05064</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-acceptance-semantics-for-stable-modal-knowledge-2307.05064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-acceptance-semantics-for-stable-modal-knowledge-2307.05064"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-the-logic-of-strategically-knowing-how-2307.05066</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-the-logic-of-strategically-knowing-how-2307.05066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-the-logic-of-strategically-knowing-how-2307.05066"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-asymmetry-in-logic-puzzles-using-zdds-for-symbolic-model-checking-dynamic-epistemic-logic-2307.05067</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-asymmetry-in-logic-puzzles-using-zdds-for-symbolic-model-checking-dynamic-epistemic-logic-2307.05067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-asymmetry-in-logic-puzzles-using-zdds-for-symbolic-model-checking-dynamic-epistemic-logic-2307.05067"/></url>
<url><loc>https://scifaro.com/en/abs/cognitive-bias-and-belief-revision-2307.05069</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cognitive-bias-and-belief-revision-2307.05069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cognitive-bias-and-belief-revision-2307.05069"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-based-analysis-of-responsibility-2307.05070</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-based-analysis-of-responsibility-2307.05070"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-based-analysis-of-responsibility-2307.05070"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-wh-and-false-belief-sensitivity-a-logical-study-an-extended-abstract-2307.05073</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-wh-and-false-belief-sensitivity-a-logical-study-an-extended-abstract-2307.05073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-wh-and-false-belief-sensitivity-a-logical-study-an-extended-abstract-2307.05073"/></url>
<url><loc>https://scifaro.com/en/abs/process-algebraic-models-of-multi-writer-multi-reader-non-atomic-registers-2307.05143</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/process-algebraic-models-of-multi-writer-multi-reader-non-atomic-registers-2307.05143"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/process-algebraic-models-of-multi-writer-multi-reader-non-atomic-registers-2307.05143"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-operational-correspondence-technical-report-2307.05218</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-operational-correspondence-technical-report-2307.05218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-operational-correspondence-technical-report-2307.05218"/></url>
<url><loc>https://scifaro.com/en/abs/computing-minimal-distinguishing-hennessy-milner-formulas-is-np-hard-but-variants-are-tractable-2307.05265</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computing-minimal-distinguishing-hennessy-milner-formulas-is-np-hard-but-variants-are-tractable-2307.05265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computing-minimal-distinguishing-hennessy-milner-formulas-is-np-hard-but-variants-are-tractable-2307.05265"/></url>
<url><loc>https://scifaro.com/en/abs/introducing-asynchronicity-to-probabilistic-hyperproperties-2307.05282</loc><lastmod>2023-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/introducing-asynchronicity-to-probabilistic-hyperproperties-2307.05282"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/introducing-asynchronicity-to-probabilistic-hyperproperties-2307.05282"/></url>
<url><loc>https://scifaro.com/en/abs/concerto-grosso-for-sessions-fair-termination-of-sessions-2307.05539</loc><lastmod>2023-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concerto-grosso-for-sessions-fair-termination-of-sessions-2307.05539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concerto-grosso-for-sessions-fair-termination-of-sessions-2307.05539"/></url>
<url><loc>https://scifaro.com/en/abs/some-preliminary-steps-towards-metaverse-logic-2307.05574</loc><lastmod>2023-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-preliminary-steps-towards-metaverse-logic-2307.05574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-preliminary-steps-towards-metaverse-logic-2307.05574"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-in-the-foundations-of-algorithmic-law-and-the-case-of-regulation-561-2307.05658</loc><lastmod>2023-07-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-in-the-foundations-of-algorithmic-law-and-the-case-of-regulation-561-2307.05658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-in-the-foundations-of-algorithmic-law-and-the-case-of-regulation-561-2307.05658"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-certified-proof-checker-for-deep-neural-network-verification-2307.06299</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-certified-proof-checker-for-deep-neural-network-verification-2307.06299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-certified-proof-checker-for-deep-neural-network-verification-2307.06299"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-shape-analysis-with-shared-abduction-and-biabductive-loop-acceleration-extended-version-2307.06346</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-shape-analysis-with-shared-abduction-and-biabductive-loop-acceleration-extended-version-2307.06346"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-shape-analysis-with-shared-abduction-and-biabductive-loop-acceleration-extended-version-2307.06346"/></url>
<url><loc>https://scifaro.com/en/abs/internal-parametricity-without-an-interval-2307.06448</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-parametricity-without-an-interval-2307.06448"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-parametricity-without-an-interval-2307.06448"/></url>
<url><loc>https://scifaro.com/en/abs/primal-logic-of-information-2307.06454</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/primal-logic-of-information-2307.06454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/primal-logic-of-information-2307.06454"/></url>
<url><loc>https://scifaro.com/en/abs/retroactive-parametrized-monitoring-2307.06763</loc><lastmod>2023-07-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retroactive-parametrized-monitoring-2307.06763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retroactive-parametrized-monitoring-2307.06763"/></url>
<url><loc>https://scifaro.com/en/abs/proof-systems-for-the-modal-mu-calculus-obtained-by-determinizing-automata-2307.06897</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-systems-for-the-modal-mu-calculus-obtained-by-determinizing-automata-2307.06897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-systems-for-the-modal-mu-calculus-obtained-by-determinizing-automata-2307.06897"/></url>
<url><loc>https://scifaro.com/en/abs/targeting-completeness-using-closed-forms-for-size-bounds-of-integer-programs-2307.06921</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/targeting-completeness-using-closed-forms-for-size-bounds-of-integer-programs-2307.06921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/targeting-completeness-using-closed-forms-for-size-bounds-of-integer-programs-2307.06921"/></url>
<url><loc>https://scifaro.com/en/abs/short-boolean-formulas-as-explanations-in-practice-2307.06971</loc><lastmod>2023-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/short-boolean-formulas-as-explanations-in-practice-2307.06971"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/short-boolean-formulas-as-explanations-in-practice-2307.06971"/></url>
<url><loc>https://scifaro.com/en/abs/real-equation-systems-with-alternating-fixed-points-full-version-with-proofs-2307.07455</loc><lastmod>2023-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/real-equation-systems-with-alternating-fixed-points-full-version-with-proofs-2307.07455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/real-equation-systems-with-alternating-fixed-points-full-version-with-proofs-2307.07455"/></url>
<url><loc>https://scifaro.com/en/abs/sequential-language-based-decisions-2307.07563</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sequential-language-based-decisions-2307.07563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sequential-language-based-decisions-2307.07563"/></url>
<url><loc>https://scifaro.com/en/abs/orthologic-with-axioms-2307.07569</loc><lastmod>2023-12-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/orthologic-with-axioms-2307.07569"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/orthologic-with-axioms-2307.07569"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-graph-transformation-systems-via-generalized-weighted-type-graphs-2307.07601</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-graph-transformation-systems-via-generalized-weighted-type-graphs-2307.07601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-graph-transformation-systems-via-generalized-weighted-type-graphs-2307.07601"/></url>
<url><loc>https://scifaro.com/en/abs/combining-finite-combination-properties-finite-models-and-busy-beavers-2307.07885</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-finite-combination-properties-finite-models-and-busy-beavers-2307.07885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-finite-combination-properties-finite-models-and-busy-beavers-2307.07885"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-solution-of-mean-payoff-games-by-string-diagrams-2307.08034</loc><lastmod>2023-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-solution-of-mean-payoff-games-by-string-diagrams-2307.08034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-solution-of-mean-payoff-games-by-string-diagrams-2307.08034"/></url>
<url><loc>https://scifaro.com/en/abs/derivation-graph-based-characterizations-of-decidable-existential-rule-sets-2307.08481</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivation-graph-based-characterizations-of-decidable-existential-rule-sets-2307.08481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivation-graph-based-characterizations-of-decidable-existential-rule-sets-2307.08481"/></url>
<url><loc>https://scifaro.com/en/abs/generic-bidirectional-typing-for-dependent-type-theories-2307.08523</loc><lastmod>2024-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-bidirectional-typing-for-dependent-type-theories-2307.08523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-bidirectional-typing-for-dependent-type-theories-2307.08523"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-probabilistic-model-checking-with-string-diagrams-of-mdps-2307.08765</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-probabilistic-model-checking-with-string-diagrams-of-mdps-2307.08765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-probabilistic-model-checking-with-string-diagrams-of-mdps-2307.08765"/></url>
<url><loc>https://scifaro.com/en/abs/discounted-sum-automata-with-multiple-discount-factors-2307.08780</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/discounted-sum-automata-with-multiple-discount-factors-2307.08780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/discounted-sum-automata-with-multiple-discount-factors-2307.08780"/></url>
<url><loc>https://scifaro.com/en/abs/on-p-interpolation-in-local-theory-extensions-and-applications-to-the-study-of-interpolation-in-the-description-logics-cal-el-cal-el-2307.08843</loc><lastmod>2023-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-p-interpolation-in-local-theory-extensions-and-applications-to-the-study-of-interpolation-in-the-description-logics-cal-el-cal-el-2307.08843"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-p-interpolation-in-local-theory-extensions-and-applications-to-the-study-of-interpolation-in-the-description-logics-cal-el-cal-el-2307.08843"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-time-and-dependent-types-2307.09145</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-time-and-dependent-types-2307.09145"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-time-and-dependent-types-2307.09145"/></url>
<url><loc>https://scifaro.com/en/abs/higher-catoids-higher-quantales-and-their-correspondences-2307.09253</loc><lastmod>2025-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-catoids-higher-quantales-and-their-correspondences-2307.09253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-catoids-higher-quantales-and-their-correspondences-2307.09253"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-geometry-for-syntax-2307.09497</loc><lastmod>2023-09-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-geometry-for-syntax-2307.09497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-geometry-for-syntax-2307.09497"/></url>
<url><loc>https://scifaro.com/en/abs/variable-independence-in-linear-real-arithmetic-2307.09499</loc><lastmod>2023-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-independence-in-linear-real-arithmetic-2307.09499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-independence-in-linear-real-arithmetic-2307.09499"/></url>
<url><loc>https://scifaro.com/en/abs/combining-dependency-grades-and-adjoint-logic-2307.09563</loc><lastmod>2023-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-dependency-grades-and-adjoint-logic-2307.09563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-dependency-grades-and-adjoint-logic-2307.09563"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logic-with-relations-over-paths-a-theoretical-development-through-comonadic-semantics-2307.09679</loc><lastmod>2024-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logic-with-relations-over-paths-a-theoretical-development-through-comonadic-semantics-2307.09679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logic-with-relations-over-paths-a-theoretical-development-through-comonadic-semantics-2307.09679"/></url>
<url><loc>https://scifaro.com/en/abs/full-ltl-synthesis-over-infinite-state-arenas-2307.09776</loc><lastmod>2025-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/full-ltl-synthesis-over-infinite-state-arenas-2307.09776"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/full-ltl-synthesis-over-infinite-state-arenas-2307.09776"/></url>
<url><loc>https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-short-wst-version-2307.09839</loc><lastmod>2023-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-short-wst-version-2307.09839"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-non-termination-by-acceleration-driven-clause-learning-short-wst-version-2307.09839"/></url>
<url><loc>https://scifaro.com/en/abs/exploring-non-regular-extensions-of-propositional-dynamic-logic-with-description-logics-features-2307.09913</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploring-non-regular-extensions-of-propositional-dynamic-logic-with-description-logics-features-2307.09913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploring-non-regular-extensions-of-propositional-dynamic-logic-with-description-logics-features-2307.09913"/></url>
<url><loc>https://scifaro.com/en/abs/dependency-tuples-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-short-wst-version-2307.10002</loc><lastmod>2023-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependency-tuples-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-short-wst-version-2307.10002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependency-tuples-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-short-wst-version-2307.10002"/></url>
<url><loc>https://scifaro.com/en/abs/alignment-complete-relational-hoare-logics-for-some-and-all-2307.10045</loc><lastmod>2025-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alignment-complete-relational-hoare-logics-for-some-and-all-2307.10045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alignment-complete-relational-hoare-logics-for-some-and-all-2307.10045"/></url>
<url><loc>https://scifaro.com/en/abs/automated-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-short-wst-version-2307.10061</loc><lastmod>2023-07-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-short-wst-version-2307.10061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-complexity-analysis-of-integer-programs-via-triangular-weakly-non-linear-loops-short-wst-version-2307.10061"/></url>
<url><loc>https://scifaro.com/en/abs/logic-and-theory-of-representation-2307.10629</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-and-theory-of-representation-2307.10629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-and-theory-of-representation-2307.10629"/></url>
<url><loc>https://scifaro.com/en/abs/robust-alternating-time-temporal-logic-2307.10885</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robust-alternating-time-temporal-logic-2307.10885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robust-alternating-time-temporal-logic-2307.10885"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-vs-semantic-linear-abstraction-and-refinement-of-neural-networks-2307.10891</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-vs-semantic-linear-abstraction-and-refinement-of-neural-networks-2307.10891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-vs-semantic-linear-abstraction-and-refinement-of-neural-networks-2307.10891"/></url>
<url><loc>https://scifaro.com/en/abs/automated-termination-proofs-for-c-programs-with-lists-short-wst-version-2307.11024</loc><lastmod>2023-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-termination-proofs-for-c-programs-with-lists-short-wst-version-2307.11024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-termination-proofs-for-c-programs-with-lists-short-wst-version-2307.11024"/></url>
<url><loc>https://scifaro.com/en/abs/binary-non-termination-in-term-rewriting-and-logic-programming-2307.11549</loc><lastmod>2023-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binary-non-termination-in-term-rewriting-and-logic-programming-2307.11549"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binary-non-termination-in-term-rewriting-and-logic-programming-2307.11549"/></url>
<url><loc>https://scifaro.com/en/abs/extensions-of-k5-proof-theory-and-uniform-lyndon-interpolation-2307.11727</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensions-of-k5-proof-theory-and-uniform-lyndon-interpolation-2307.11727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensions-of-k5-proof-theory-and-uniform-lyndon-interpolation-2307.11727"/></url>
<url><loc>https://scifaro.com/en/abs/even-shorter-proofs-without-new-variables-2307.12098</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/even-shorter-proofs-without-new-variables-2307.12098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/even-shorter-proofs-without-new-variables-2307.12098"/></url>
<url><loc>https://scifaro.com/en/abs/calculational-proofs-in-acl2s-2307.12224</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculational-proofs-in-acl2s-2307.12224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculational-proofs-in-acl2s-2307.12224"/></url>
<url><loc>https://scifaro.com/en/abs/non-normal-modal-description-logics-extended-version-2307.12265</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-normal-modal-description-logics-extended-version-2307.12265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-normal-modal-description-logics-extended-version-2307.12265"/></url>
<url><loc>https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2307.12454</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2307.12454"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extracting-total-amb-programs-from-proofs-2307.12454"/></url>
<url><loc>https://scifaro.com/en/abs/a-system-of-inference-based-on-proof-search-an-extended-abstract-2307.12704</loc><lastmod>2023-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-system-of-inference-based-on-proof-search-an-extended-abstract-2307.12704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-system-of-inference-based-on-proof-search-an-extended-abstract-2307.12704"/></url>
<url><loc>https://scifaro.com/en/abs/affine-disjunctive-invariant-generation-with-farkas-lemma-2307.13318</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/affine-disjunctive-invariant-generation-with-farkas-lemma-2307.13318"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/affine-disjunctive-invariant-generation-with-farkas-lemma-2307.13318"/></url>
<url><loc>https://scifaro.com/en/abs/an-axiomatic-theory-for-reversible-computation-2307.13360</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-axiomatic-theory-for-reversible-computation-2307.13360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-axiomatic-theory-for-reversible-computation-2307.13360"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-analysis-for-call-by-value-higher-order-rewriting-2307.13426</loc><lastmod>2023-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-analysis-for-call-by-value-higher-order-rewriting-2307.13426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-analysis-for-call-by-value-higher-order-rewriting-2307.13426"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-lctrss-and-their-termination-2307.13519</loc><lastmod>2023-07-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-lctrss-and-their-termination-2307.13519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-lctrss-and-their-termination-2307.13519"/></url>
<url><loc>https://scifaro.com/en/abs/structural-analysis-of-grafcet-control-specifications-2307.13703</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-analysis-of-grafcet-control-specifications-2307.13703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-analysis-of-grafcet-control-specifications-2307.13703"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-weighted-path-orders-2307.13973</loc><lastmod>2023-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-weighted-path-orders-2307.13973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-weighted-path-orders-2307.13973"/></url>
<url><loc>https://scifaro.com/en/abs/hydra-battles-and-ac-termination-2307.14036</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hydra-battles-and-ac-termination-2307.14036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hydra-battles-and-ac-termination-2307.14036"/></url>
<url><loc>https://scifaro.com/en/abs/on-singleton-self-loop-removal-for-termination-of-lctrss-with-bit-vector-arithmetic-2307.14094</loc><lastmod>2023-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-singleton-self-loop-removal-for-termination-of-lctrss-with-bit-vector-arithmetic-2307.14094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-singleton-self-loop-removal-for-termination-of-lctrss-with-bit-vector-arithmetic-2307.14094"/></url>
<url><loc>https://scifaro.com/en/abs/old-and-new-benchmarks-for-relative-termination-of-string-rewrite-systems-2307.14149</loc><lastmod>2023-07-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/old-and-new-benchmarks-for-relative-termination-of-string-rewrite-systems-2307.14149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/old-and-new-benchmarks-for-relative-termination-of-string-rewrite-systems-2307.14149"/></url>
<url><loc>https://scifaro.com/en/abs/text-tt-box-mathcal-c-a-family-of-extensional-type-theories-with-effectful-realizers-of-continuity-2307.14168</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/text-tt-box-mathcal-c-a-family-of-extensional-type-theories-with-effectful-realizers-of-continuity-2307.14168"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/text-tt-box-mathcal-c-a-family-of-extensional-type-theories-with-effectful-realizers-of-continuity-2307.14168"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-and-completeness-of-sum-over-paths-in-dyadic-fragments-of-quantum-computing-2307.14223</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-and-completeness-of-sum-over-paths-in-dyadic-fragments-of-quantum-computing-2307.14223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-and-completeness-of-sum-over-paths-in-dyadic-fragments-of-quantum-computing-2307.14223"/></url>
<url><loc>https://scifaro.com/en/abs/on-boolean-reliability-algebra-2307.14357</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-boolean-reliability-algebra-2307.14357"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-boolean-reliability-algebra-2307.14357"/></url>
<url><loc>https://scifaro.com/en/abs/a-verified-efficient-implementation-of-the-weighted-path-order-2307.14671</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-verified-efficient-implementation-of-the-weighted-path-order-2307.14671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-verified-efficient-implementation-of-the-weighted-path-order-2307.14671"/></url>
<url><loc>https://scifaro.com/en/abs/an-automata-theoretic-characterization-of-weighted-first-order-logic-2307.14707</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automata-theoretic-characterization-of-weighted-first-order-logic-2307.14707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automata-theoretic-characterization-of-weighted-first-order-logic-2307.14707"/></url>
<url><loc>https://scifaro.com/en/abs/linear-termination-over-n-is-undecidable-2307.14805</loc><lastmod>2023-07-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-termination-over-n-is-undecidable-2307.14805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-termination-over-n-is-undecidable-2307.14805"/></url>
<url><loc>https://scifaro.com/en/abs/graded-semantics-and-graded-logics-for-eilenberg-moore-coalgebras-2307.14826</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-semantics-and-graded-logics-for-eilenberg-moore-coalgebras-2307.14826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-semantics-and-graded-logics-for-eilenberg-moore-coalgebras-2307.14826"/></url>
<url><loc>https://scifaro.com/en/abs/optimal-alignment-of-temporal-knowledge-bases-2307.15439</loc><lastmod>2023-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimal-alignment-of-temporal-knowledge-bases-2307.15439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimal-alignment-of-temporal-knowledge-bases-2307.15439"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-fifth-international-conference-on-applied-category-theory-2307.15519</loc><lastmod>2023-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-fifth-international-conference-on-applied-category-theory-2307.15519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-fifth-international-conference-on-applied-category-theory-2307.15519"/></url>
<url><loc>https://scifaro.com/en/abs/oracle-computability-and-turing-reducibility-in-the-calculus-of-inductive-constructions-2307.15543</loc><lastmod>2023-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/oracle-computability-and-turing-reducibility-in-the-calculus-of-inductive-constructions-2307.15543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/oracle-computability-and-turing-reducibility-in-the-calculus-of-inductive-constructions-2307.15543"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-trade-off-between-efficiency-and-precision-of-neural-abstraction-2307.15546</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-trade-off-between-efficiency-and-precision-of-neural-abstraction-2307.15546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-trade-off-between-efficiency-and-precision-of-neural-abstraction-2307.15546"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-verification-in-rewriting-logic-2307.16537</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-verification-in-rewriting-logic-2307.16537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-verification-in-rewriting-logic-2307.16537"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-gradings-of-monads-2307.16558</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-gradings-of-monads-2307.16558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-gradings-of-monads-2307.16558"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-semantics-of-proofs-in-classical-sequent-calculus-2307.16594</loc><lastmod>2023-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-semantics-of-proofs-in-classical-sequent-calculus-2307.16594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-semantics-of-proofs-in-classical-sequent-calculus-2307.16594"/></url>
<url><loc>https://scifaro.com/en/abs/towards-univalent-reference-types-2307.16608</loc><lastmod>2023-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-univalent-reference-types-2307.16608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-univalent-reference-types-2307.16608"/></url>
<url><loc>https://scifaro.com/en/abs/decision-procedures-for-sequence-theories-technical-report-2308.00175</loc><lastmod>2023-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-procedures-for-sequence-theories-technical-report-2308.00175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-procedures-for-sequence-theories-technical-report-2308.00175"/></url>
<url><loc>https://scifaro.com/en/abs/syntactically-and-semantically-regular-languages-of-lambda-terms-coincide-through-logical-relations-2308.00198</loc><lastmod>2024-02-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactically-and-semantically-regular-languages-of-lambda-terms-coincide-through-logical-relations-2308.00198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactically-and-semantically-regular-languages-of-lambda-terms-coincide-through-logical-relations-2308.00198"/></url>
<url><loc>https://scifaro.com/en/abs/datapath-verification-via-word-level-e-graph-rewriting-2308.00431</loc><lastmod>2023-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/datapath-verification-via-word-level-e-graph-rewriting-2308.00431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/datapath-verification-via-word-level-e-graph-rewriting-2308.00431"/></url>
<url><loc>https://scifaro.com/en/abs/a-many-sorted-epistemic-logic-for-chromatic-hypergraphs-2308.00477</loc><lastmod>2023-08-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-many-sorted-epistemic-logic-for-chromatic-hypergraphs-2308.00477"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-many-sorted-epistemic-logic-for-chromatic-hypergraphs-2308.00477"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-metric-temporal-logic-for-continuous-stochastic-processes-2308.00984</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-metric-temporal-logic-for-continuous-stochastic-processes-2308.00984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-metric-temporal-logic-for-continuous-stochastic-processes-2308.00984"/></url>
<url><loc>https://scifaro.com/en/abs/termination-in-concurrency-revisited-2308.01165</loc><lastmod>2023-08-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-in-concurrency-revisited-2308.01165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-in-concurrency-revisited-2308.01165"/></url>
<url><loc>https://scifaro.com/en/abs/translating-three-variable-first-order-predicate-logic-to-relation-algebra-implemented-using-z3-2308.02513</loc><lastmod>2025-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-three-variable-first-order-predicate-logic-to-relation-algebra-implemented-using-z3-2308.02513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-three-variable-first-order-predicate-logic-to-relation-algebra-implemented-using-z3-2308.02513"/></url>
<url><loc>https://scifaro.com/en/abs/improving-probabilistic-bisimulation-for-mdps-using-machine-learning-2308.02519</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improving-probabilistic-bisimulation-for-mdps-using-machine-learning-2308.02519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improving-probabilistic-bisimulation-for-mdps-using-machine-learning-2308.02519"/></url>
<url><loc>https://scifaro.com/en/abs/top-down-automated-theorem-proving-notes-for-sir-timothy-2308.02540</loc><lastmod>2023-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/top-down-automated-theorem-proving-notes-for-sir-timothy-2308.02540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/top-down-automated-theorem-proving-notes-for-sir-timothy-2308.02540"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-time-window-temporal-logic-for-hyperproperties-2308.02554</loc><lastmod>2023-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-time-window-temporal-logic-for-hyperproperties-2308.02554"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-time-window-temporal-logic-for-hyperproperties-2308.02554"/></url>
<url><loc>https://scifaro.com/en/abs/decentralized-predicate-detection-over-partially-synchronous-continuous-time-signals-2308.02763</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decentralized-predicate-detection-over-partially-synchronous-continuous-time-signals-2308.02763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decentralized-predicate-detection-over-partially-synchronous-continuous-time-signals-2308.02763"/></url>
<url><loc>https://scifaro.com/en/abs/multi-agent-verification-and-control-with-probabilistic-model-checking-2308.02829</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-agent-verification-and-control-with-probabilistic-model-checking-2308.02829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-agent-verification-and-control-with-probabilistic-model-checking-2308.02829"/></url>
<url><loc>https://scifaro.com/en/abs/automodel-automatic-synthesis-of-models-from-communication-traces-of-soc-designs-2308.03523</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automodel-automatic-synthesis-of-models-from-communication-traces-of-soc-designs-2308.03523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automodel-automatic-synthesis-of-models-from-communication-traces-of-soc-designs-2308.03523"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-modalities-in-substructural-logics-applications-at-the-interfaces-of-logic-language-and-computation-2308.03679</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-modalities-in-substructural-logics-applications-at-the-interfaces-of-logic-language-and-computation-2308.03679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-modalities-in-substructural-logics-applications-at-the-interfaces-of-logic-language-and-computation-2308.03679"/></url>
<url><loc>https://scifaro.com/en/abs/quantifiers-closed-under-partial-polymorphisms-2308.03695</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifiers-closed-under-partial-polymorphisms-2308.03695"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifiers-closed-under-partial-polymorphisms-2308.03695"/></url>
<url><loc>https://scifaro.com/en/abs/combining-proofs-for-description-logic-and-concrete-domain-reasoning-technical-report-2308.03705</loc><lastmod>2023-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-proofs-for-description-logic-and-concrete-domain-reasoning-technical-report-2308.03705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-proofs-for-description-logic-and-concrete-domain-reasoning-technical-report-2308.03705"/></url>
<url><loc>https://scifaro.com/en/abs/a-kripke-semantics-for-hajek-s-bl-2308.04518</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kripke-semantics-for-hajek-s-bl-2308.04518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kripke-semantics-for-hajek-s-bl-2308.04518"/></url>
<url><loc>https://scifaro.com/en/abs/multimodality-in-the-hypergraph-lambek-calculus-2308.04520</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multimodality-in-the-hypergraph-lambek-calculus-2308.04520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multimodality-in-the-hypergraph-lambek-calculus-2308.04520"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-analysis-of-subexponential-modalities-in-distributive-non-commutative-linear-logic-2308.04521</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-analysis-of-subexponential-modalities-in-distributive-non-commutative-linear-logic-2308.04521"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-analysis-of-subexponential-modalities-in-distributive-non-commutative-linear-logic-2308.04521"/></url>
<url><loc>https://scifaro.com/en/abs/ehrenfeucht-fra-iss-e-games-in-semiring-semantics-2308.04910</loc><lastmod>2023-08-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ehrenfeucht-fra-iss-e-games-in-semiring-semantics-2308.04910"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ehrenfeucht-fra-iss-e-games-in-semiring-semantics-2308.04910"/></url>
<url><loc>https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-2308.05537</loc><lastmod>2023-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-2308.05537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explorations-in-subexponential-non-associative-non-commutative-linear-logic-2308.05537"/></url>
<url><loc>https://scifaro.com/en/abs/qtwtl-quality-aware-time-window-temporal-logic-for-performance-monitoring-2308.05644</loc><lastmod>2023-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/qtwtl-quality-aware-time-window-temporal-logic-for-performance-monitoring-2308.05644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/qtwtl-quality-aware-time-window-temporal-logic-for-performance-monitoring-2308.05644"/></url>
<url><loc>https://scifaro.com/en/abs/esbmc-v7-3-model-checking-c-programs-using-clang-ast-2308.05649</loc><lastmod>2023-08-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/esbmc-v7-3-model-checking-c-programs-using-clang-ast-2308.05649"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/esbmc-v7-3-model-checking-c-programs-using-clang-ast-2308.05649"/></url>
<url><loc>https://scifaro.com/en/abs/limitations-of-game-comonads-via-homomorphism-indistinguishability-2308.05693</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/limitations-of-game-comonads-via-homomorphism-indistinguishability-2308.05693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/limitations-of-game-comonads-via-homomorphism-indistinguishability-2308.05693"/></url>
<url><loc>https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2308.06044</loc><lastmod>2023-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2308.06044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2308.06044"/></url>
<url><loc>https://scifaro.com/en/abs/characterising-robust-instances-of-ultimate-positivity-for-linear-dynamical-systems-2308.06421</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterising-robust-instances-of-ultimate-positivity-for-linear-dynamical-systems-2308.06421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterising-robust-instances-of-ultimate-positivity-for-linear-dynamical-systems-2308.06421"/></url>
<url><loc>https://scifaro.com/en/abs/proofbuddy-a-proof-assistant-for-learning-and-monitoring-2308.06970</loc><lastmod>2023-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofbuddy-a-proof-assistant-for-learning-and-monitoring-2308.06970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofbuddy-a-proof-assistant-for-learning-and-monitoring-2308.06970"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-cut-elimination-for-non-wellfounded-parsimonious-linear-logic-2308.07789</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-cut-elimination-for-non-wellfounded-parsimonious-linear-logic-2308.07789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-cut-elimination-for-non-wellfounded-parsimonious-linear-logic-2308.07789"/></url>
<url><loc>https://scifaro.com/en/abs/description-logics-go-second-order-extending-el-with-universally-quantified-concepts-2308.08252</loc><lastmod>2023-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/description-logics-go-second-order-extending-el-with-universally-quantified-concepts-2308.08252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/description-logics-go-second-order-extending-el-with-universally-quantified-concepts-2308.08252"/></url>
<url><loc>https://scifaro.com/en/abs/a-topological-counterpart-of-well-founded-trees-in-dependent-type-theory-2308.08404</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-topological-counterpart-of-well-founded-trees-in-dependent-type-theory-2308.08404"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-topological-counterpart-of-well-founded-trees-in-dependent-type-theory-2308.08404"/></url>
<url><loc>https://scifaro.com/en/abs/non-rigid-designators-in-epistemic-and-temporal-free-description-logics-extended-version-2308.08640</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-rigid-designators-in-epistemic-and-temporal-free-description-logics-extended-version-2308.08640"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-rigid-designators-in-epistemic-and-temporal-free-description-logics-extended-version-2308.08640"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-semantics-of-finite-petri-nets-2308.08983</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-semantics-of-finite-petri-nets-2308.08983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-semantics-of-finite-petri-nets-2308.08983"/></url>
<url><loc>https://scifaro.com/en/abs/the-19th-international-workshop-on-termination-wst-2023-preface-invited-talk-abstract-and-tool-descriptions-2308.09536</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-19th-international-workshop-on-termination-wst-2023-preface-invited-talk-abstract-and-tool-descriptions-2308.09536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-19th-international-workshop-on-termination-wst-2023-preface-invited-talk-abstract-and-tool-descriptions-2308.09536"/></url>
<url><loc>https://scifaro.com/en/abs/canonicity-and-computability-in-homotopy-type-theory-2308.09621</loc><lastmod>2023-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonicity-and-computability-in-homotopy-type-theory-2308.09621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonicity-and-computability-in-homotopy-type-theory-2308.09621"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-sometimes-termination-of-lazy-bounded-declarative-distributed-systems-2308.10007</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-sometimes-termination-of-lazy-bounded-declarative-distributed-systems-2308.10007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-sometimes-termination-of-lazy-bounded-declarative-distributed-systems-2308.10007"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-about-network-communication-for-humans-and-machines-2308.10652</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-about-network-communication-for-humans-and-machines-2308.10652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-about-network-communication-for-humans-and-machines-2308.10652"/></url>
<url><loc>https://scifaro.com/en/abs/partially-typed-multiparty-sessions-2308.10653</loc><lastmod>2023-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partially-typed-multiparty-sessions-2308.10653"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partially-typed-multiparty-sessions-2308.10653"/></url>
<url><loc>https://scifaro.com/en/abs/normative-conditional-reasoning-as-a-fragment-of-hol-2308.10686</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normative-conditional-reasoning-as-a-fragment-of-hol-2308.10686"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normative-conditional-reasoning-as-a-fragment-of-hol-2308.10686"/></url>
<url><loc>https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2308.11385</loc><lastmod>2023-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2308.11385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2308.11385"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-of-valid-categorical-syllogisms-in-one-diagrammatic-and-two-symbolic-axiomatic-systems-2308.12973</loc><lastmod>2023-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-of-valid-categorical-syllogisms-in-one-diagrammatic-and-two-symbolic-axiomatic-systems-2308.12973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-of-valid-categorical-syllogisms-in-one-diagrammatic-and-two-symbolic-axiomatic-systems-2308.12973"/></url>
<url><loc>https://scifaro.com/en/abs/implementation-of-formal-semantics-and-the-potential-of-non-classical-logic-systems-for-the-enhancement-of-access-control-models-a-literature-review-2308.12983</loc><lastmod>2023-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implementation-of-formal-semantics-and-the-potential-of-non-classical-logic-systems-for-the-enhancement-of-access-control-models-a-literature-review-2308.12983"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implementation-of-formal-semantics-and-the-potential-of-non-classical-logic-systems-for-the-enhancement-of-access-control-models-a-literature-review-2308.12983"/></url>
<url><loc>https://scifaro.com/en/abs/octal-graph-representation-learning-for-ltl-model-checking-2308.13474</loc><lastmod>2023-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/octal-graph-representation-learning-for-ltl-model-checking-2308.13474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/octal-graph-representation-learning-for-ltl-model-checking-2308.13474"/></url>
<url><loc>https://scifaro.com/en/abs/integer-programming-with-gcd-constraints-2308.13609</loc><lastmod>2023-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-programming-with-gcd-constraints-2308.13609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-programming-with-gcd-constraints-2308.13609"/></url>
<url><loc>https://scifaro.com/en/abs/solving-the-insecurity-problem-for-assertions-2308.13773</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-the-insecurity-problem-for-assertions-2308.13773"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-the-insecurity-problem-for-assertions-2308.13773"/></url>
<url><loc>https://scifaro.com/en/abs/shielded-reinforcement-learning-for-hybrid-systems-2308.14424</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shielded-reinforcement-learning-for-hybrid-systems-2308.14424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shielded-reinforcement-learning-for-hybrid-systems-2308.14424"/></url>
<url><loc>https://scifaro.com/en/abs/many-valued-coalgebraic-logic-over-semi-primal-varieties-2308.14581</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-valued-coalgebraic-logic-over-semi-primal-varieties-2308.14581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-valued-coalgebraic-logic-over-semi-primal-varieties-2308.14581"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modelling-and-analysis-of-a-self-adaptive-robotic-system-2308.14663</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modelling-and-analysis-of-a-self-adaptive-robotic-system-2308.14663"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modelling-and-analysis-of-a-self-adaptive-robotic-system-2308.14663"/></url>
<url><loc>https://scifaro.com/en/abs/monus-semantics-in-vector-addition-systems-with-states-2308.14926</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monus-semantics-in-vector-addition-systems-with-states-2308.14926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monus-semantics-in-vector-addition-systems-with-states-2308.14926"/></url>
<url><loc>https://scifaro.com/en/abs/ltlf-synthesis-under-environment-specifications-for-reachability-and-safety-properties-2308.15184</loc><lastmod>2023-08-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltlf-synthesis-under-environment-specifications-for-reachability-and-safety-properties-2308.15184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltlf-synthesis-under-environment-specifications-for-reachability-and-safety-properties-2308.15184"/></url>
<url><loc>https://scifaro.com/en/abs/combining-swap-structures-the-case-of-paradefinite-ivlev-like-modal-logics-based-on-fde-2308.15426</loc><lastmod>2024-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-swap-structures-the-case-of-paradefinite-ivlev-like-modal-logics-based-on-fde-2308.15426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-swap-structures-the-case-of-paradefinite-ivlev-like-modal-logics-based-on-fde-2308.15426"/></url>
<url><loc>https://scifaro.com/en/abs/sharing-proofs-with-predicative-theories-through-universe-polymorphic-elaboration-2308.15465</loc><lastmod>2024-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharing-proofs-with-predicative-theories-through-universe-polymorphic-elaboration-2308.15465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharing-proofs-with-predicative-theories-through-universe-polymorphic-elaboration-2308.15465"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-ch2o-with-verifast-2308.15567</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-ch2o-with-verifast-2308.15567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-c-program-correctness-with-respect-to-ch2o-with-verifast-2308.15567"/></url>
<url><loc>https://scifaro.com/en/abs/bottom-up-stratified-probabilistic-logic-programming-with-fusemate-2308.15862</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottom-up-stratified-probabilistic-logic-programming-with-fusemate-2308.15862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottom-up-stratified-probabilistic-logic-programming-with-fusemate-2308.15862"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-independencies-hidden-in-the-structure-of-a-probabilistic-logic-program-2308.15865</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-independencies-hidden-in-the-structure-of-a-probabilistic-logic-program-2308.15865"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-independencies-hidden-in-the-structure-of-a-probabilistic-logic-program-2308.15865"/></url>
<url><loc>https://scifaro.com/en/abs/on-feasibility-of-declarative-diagnosis-2308.15867</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-feasibility-of-declarative-diagnosis-2308.15867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-feasibility-of-declarative-diagnosis-2308.15867"/></url>
<url><loc>https://scifaro.com/en/abs/deontic-paradoxes-in-asp-with-weak-constraints-2308.15870</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deontic-paradoxes-in-asp-with-weak-constraints-2308.15870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deontic-paradoxes-in-asp-with-weak-constraints-2308.15870"/></url>
<url><loc>https://scifaro.com/en/abs/a-dataflow-analysis-for-comparing-and-reordering-predicate-arguments-2308.15880</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dataflow-analysis-for-comparing-and-reordering-predicate-arguments-2308.15880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dataflow-analysis-for-comparing-and-reordering-predicate-arguments-2308.15880"/></url>
<url><loc>https://scifaro.com/en/abs/would-life-be-more-interesting-if-i-were-in-ai-answering-counterfactuals-based-on-probabilistic-inductive-logic-programming-2308.15883</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/would-life-be-more-interesting-if-i-were-in-ai-answering-counterfactuals-based-on-probabilistic-inductive-logic-programming-2308.15883"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/would-life-be-more-interesting-if-i-were-in-ai-answering-counterfactuals-based-on-probabilistic-inductive-logic-programming-2308.15883"/></url>
<url><loc>https://scifaro.com/en/abs/generalizing-level-ranking-constraints-for-monotone-and-convex-aggregates-2308.15888</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalizing-level-ranking-constraints-for-monotone-and-convex-aggregates-2308.15888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalizing-level-ranking-constraints-for-monotone-and-convex-aggregates-2308.15888"/></url>
<url><loc>https://scifaro.com/en/abs/sorting-strategies-for-interactive-conflict-resolution-in-asp-2308.15889</loc><lastmod>2023-08-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sorting-strategies-for-interactive-conflict-resolution-in-asp-2308.15889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sorting-strategies-for-interactive-conflict-resolution-in-asp-2308.15889"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-topological-and-mereological-foundations-of-existential-granules-2308.16157</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-topological-and-mereological-foundations-of-existential-granules-2308.16157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-topological-and-mereological-foundations-of-existential-granules-2308.16157"/></url>
<url><loc>https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2308.16350</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2308.16350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2308.16350"/></url>
<url><loc>https://scifaro.com/en/abs/moore-penrose-dagger-categories-2308.16497</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/moore-penrose-dagger-categories-2308.16497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/moore-penrose-dagger-categories-2308.16497"/></url>
<url><loc>https://scifaro.com/en/abs/on-model-checking-higher-order-effectful-programs-long-version-2308.16542</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-model-checking-higher-order-effectful-programs-long-version-2308.16542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-model-checking-higher-order-effectful-programs-long-version-2308.16542"/></url>
<url><loc>https://scifaro.com/en/abs/a-variation-of-reynolds-hurkens-paradox-2308.16726</loc><lastmod>2023-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-variation-of-reynolds-hurkens-paradox-2308.16726"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-variation-of-reynolds-hurkens-paradox-2308.16726"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-dependency-pair-framework-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-2309.00344</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-dependency-pair-framework-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-2309.00344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-dependency-pair-framework-for-almost-sure-innermost-termination-of-probabilistic-term-rewriting-2309.00344"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-checking-of-multi-variable-tptl-with-unilateral-intervals-is-pspace-complete-2309.00386</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-checking-of-multi-variable-tptl-with-unilateral-intervals-is-pspace-complete-2309.00386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-checking-of-multi-variable-tptl-with-unilateral-intervals-is-pspace-complete-2309.00386"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-calculus-for-intuitionistic-strong-l-ob-logic-strong-termination-and-cut-elimination-formalised-2309.00486</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-calculus-for-intuitionistic-strong-l-ob-logic-strong-termination-and-cut-elimination-formalised-2309.00486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-calculus-for-intuitionistic-strong-l-ob-logic-strong-termination-and-cut-elimination-formalised-2309.00486"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-g-odel-l-ob-logic-a-la-simpson-labelled-systems-and-birelational-semantics-2309.00532</loc><lastmod>2023-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-g-odel-l-ob-logic-a-la-simpson-labelled-systems-and-birelational-semantics-2309.00532"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-g-odel-l-ob-logic-a-la-simpson-labelled-systems-and-birelational-semantics-2309.00532"/></url>
<url><loc>https://scifaro.com/en/abs/multirole-logic-and-multiparty-channels-2309.01317</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multirole-logic-and-multiparty-channels-2309.01317"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multirole-logic-and-multiparty-channels-2309.01317"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-the-reasoning-level-in-generic-weak-memory-verification-extended-version-2309.01433</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-the-reasoning-level-in-generic-weak-memory-verification-extended-version-2309.01433"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-the-reasoning-level-in-generic-weak-memory-verification-extended-version-2309.01433"/></url>
<url><loc>https://scifaro.com/en/abs/incorporating-data-dependencies-and-properties-in-difference-verification-with-conditions-technical-report-2309.01585</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorporating-data-dependencies-and-properties-in-difference-verification-with-conditions-technical-report-2309.01585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorporating-data-dependencies-and-properties-in-difference-verification-with-conditions-technical-report-2309.01585"/></url>
<url><loc>https://scifaro.com/en/abs/the-index-and-core-of-a-relation-with-applications-to-the-axiomatics-of-relation-algebra-2309.02017</loc><lastmod>2025-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-index-and-core-of-a-relation-with-applications-to-the-axiomatics-of-relation-algebra-2309.02017"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-index-and-core-of-a-relation-with-applications-to-the-axiomatics-of-relation-algebra-2309.02017"/></url>
<url><loc>https://scifaro.com/en/abs/a-unification-algorithm-for-second-order-linear-terms-2309.02024</loc><lastmod>2023-09-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unification-algorithm-for-second-order-linear-terms-2309.02024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unification-algorithm-for-second-order-linear-terms-2309.02024"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-modal-logics-constructive-modal-logics-and-their-relations-2309.02367</loc><lastmod>2025-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-modal-logics-constructive-modal-logics-and-their-relations-2309.02367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-modal-logics-constructive-modal-logics-and-their-relations-2309.02367"/></url>
<url><loc>https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-complements-2309.02760</loc><lastmod>2023-09-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-complements-2309.02760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-complements-2309.02760"/></url>
<url><loc>https://scifaro.com/en/abs/grove-a-separation-logic-library-for-verifying-distributed-systems-extended-version-2309.03046</loc><lastmod>2023-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grove-a-separation-logic-library-for-verifying-distributed-systems-extended-version-2309.03046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grove-a-separation-logic-library-for-verifying-distributed-systems-extended-version-2309.03046"/></url>
<url><loc>https://scifaro.com/en/abs/on-statman-s-finite-completeness-theorem-2309.03602</loc><lastmod>2023-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-statman-s-finite-completeness-theorem-2309.03602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-statman-s-finite-completeness-theorem-2309.03602"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-chase-lev-deque-in-concurrent-separation-logic-2309.03642</loc><lastmod>2023-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-chase-lev-deque-in-concurrent-separation-logic-2309.03642"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-chase-lev-deque-in-concurrent-separation-logic-2309.03642"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-probabilistic-framework-in-imall-a-concrete-categorical-perspective-2309.04624</loc><lastmod>2024-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-probabilistic-framework-in-imall-a-concrete-categorical-perspective-2309.04624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-probabilistic-framework-in-imall-a-concrete-categorical-perspective-2309.04624"/></url>
<url><loc>https://scifaro.com/en/abs/leaf-modularity-for-temporary-sharing-in-separation-logic-extended-version-2309.04851</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leaf-modularity-for-temporary-sharing-in-separation-logic-extended-version-2309.04851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leaf-modularity-for-temporary-sharing-in-separation-logic-extended-version-2309.04851"/></url>
<url><loc>https://scifaro.com/en/abs/a-mechanized-theory-of-the-box-calculus-2309.05362</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mechanized-theory-of-the-box-calculus-2309.05362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mechanized-theory-of-the-box-calculus-2309.05362"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-and-completeness-of-a-model-checking-proof-system-for-ctl-2309.05389</loc><lastmod>2023-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-and-completeness-of-a-model-checking-proof-system-for-ctl-2309.05389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-and-completeness-of-a-model-checking-proof-system-for-ctl-2309.05389"/></url>
<url><loc>https://scifaro.com/en/abs/distributional-probabilistic-model-checking-2309.05584</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributional-probabilistic-model-checking-2309.05584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributional-probabilistic-model-checking-2309.05584"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-combined-30th-international-workshop-on-expressiveness-in-concurrency-and-20th-workshop-on-structural-operational-semantics-2309.05788</loc><lastmod>2023-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-combined-30th-international-workshop-on-expressiveness-in-concurrency-and-20th-workshop-on-structural-operational-semantics-2309.05788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-combined-30th-international-workshop-on-expressiveness-in-concurrency-and-20th-workshop-on-structural-operational-semantics-2309.05788"/></url>
<url><loc>https://scifaro.com/en/abs/a-natural-intuitionistic-modal-logic-axiomatization-and-bi-nested-calculus-2309.06309</loc><lastmod>2023-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-natural-intuitionistic-modal-logic-axiomatization-and-bi-nested-calculus-2309.06309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-natural-intuitionistic-modal-logic-axiomatization-and-bi-nested-calculus-2309.06309"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-separation-of-control-flow-and-data-flow-2309.06397</loc><lastmod>2026-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-separation-of-control-flow-and-data-flow-2309.06397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-separation-of-control-flow-and-data-flow-2309.06397"/></url>
<url><loc>https://scifaro.com/en/abs/games-and-argumentation-time-for-a-family-reunion-2309.06620</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-and-argumentation-time-for-a-family-reunion-2309.06620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-and-argumentation-time-for-a-family-reunion-2309.06620"/></url>
<url><loc>https://scifaro.com/en/abs/adding-an-implication-to-logics-of-perfect-paradefinite-algebras-2309.06764</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adding-an-implication-to-logics-of-perfect-paradefinite-algebras-2309.06764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adding-an-implication-to-logics-of-perfect-paradefinite-algebras-2309.06764"/></url>
<url><loc>https://scifaro.com/en/abs/regular-representations-of-uniform-tc-0-2309.06926</loc><lastmod>2023-09-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-representations-of-uniform-tc-0-2309.06926"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-representations-of-uniform-tc-0-2309.06926"/></url>
<url><loc>https://scifaro.com/en/abs/robustness-in-metric-spaces-over-continuous-quantales-and-the-hausdorff-smyth-monad-2309.06968</loc><lastmod>2023-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robustness-in-metric-spaces-over-continuous-quantales-and-the-hausdorff-smyth-monad-2309.06968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robustness-in-metric-spaces-over-continuous-quantales-and-the-hausdorff-smyth-monad-2309.06968"/></url>
<url><loc>https://scifaro.com/en/abs/pearl-s-and-jeffrey-s-update-as-modes-of-learning-in-probabilistic-programming-2309.07053</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pearl-s-and-jeffrey-s-update-as-modes-of-learning-in-probabilistic-programming-2309.07053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pearl-s-and-jeffrey-s-update-as-modes-of-learning-in-probabilistic-programming-2309.07053"/></url>
<url><loc>https://scifaro.com/en/abs/the-way-we-were-structural-operational-semantics-research-in-perspective-2309.07304</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-way-we-were-structural-operational-semantics-research-in-perspective-2309.07304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-way-we-were-structural-operational-semantics-research-in-perspective-2309.07304"/></url>
<url><loc>https://scifaro.com/en/abs/a-cancellation-law-for-probabilistic-processes-2309.07306</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cancellation-law-for-probabilistic-processes-2309.07306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cancellation-law-for-probabilistic-processes-2309.07306"/></url>
<url><loc>https://scifaro.com/en/abs/using-pi-calculus-names-as-locks-2309.07307</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-pi-calculus-names-as-locks-2309.07307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-pi-calculus-names-as-locks-2309.07307"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-pushdown-automata-and-commutative-context-free-grammars-in-bisimulation-semantics-extended-abstract-2309.07308</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-pushdown-automata-and-commutative-context-free-grammars-in-bisimulation-semantics-extended-abstract-2309.07308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-pushdown-automata-and-commutative-context-free-grammars-in-bisimulation-semantics-extended-abstract-2309.07308"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-masking-fault-tolerance-via-fair-stochastic-games-2309.07309</loc><lastmod>2023-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-masking-fault-tolerance-via-fair-stochastic-games-2309.07309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-masking-fault-tolerance-via-fair-stochastic-games-2309.07309"/></url>
<url><loc>https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2309.07933</loc><lastmod>2023-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2309.07933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lean-congruence-format-for-ep-bisimilarity-2309.07933"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-jl-satisfiability-modulo-theories-in-julia-2309.08778</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-jl-satisfiability-modulo-theories-in-julia-2309.08778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-jl-satisfiability-modulo-theories-in-julia-2309.08778"/></url>
<url><loc>https://scifaro.com/en/abs/some-algebraic-aspects-of-assume-guarantee-reasoning-2309.08875</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-algebraic-aspects-of-assume-guarantee-reasoning-2309.08875"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-algebraic-aspects-of-assume-guarantee-reasoning-2309.08875"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-separation-logic-2309.08962</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-separation-logic-2309.08962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-separation-logic-2309.08962"/></url>
<url><loc>https://scifaro.com/en/abs/btor2mlir-a-format-and-toolchain-for-hardware-verification-2309.09100</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/btor2mlir-a-format-and-toolchain-for-hardware-verification-2309.09100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/btor2mlir-a-format-and-toolchain-for-hardware-verification-2309.09100"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-two-level-type-theory-with-cofibrant-exo-nat-2309.09395</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-two-level-type-theory-with-cofibrant-exo-nat-2309.09395"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-two-level-type-theory-with-cofibrant-exo-nat-2309.09395"/></url>
<url><loc>https://scifaro.com/en/abs/fitchean-ignorance-and-first-order-ignorance-a-neighborhood-look-2309.09451</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fitchean-ignorance-and-first-order-ignorance-a-neighborhood-look-2309.09451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fitchean-ignorance-and-first-order-ignorance-a-neighborhood-look-2309.09451"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-unbounded-guarantees-via-bounded-proofs-extended-abstract-2309.09731</loc><lastmod>2023-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-unbounded-guarantees-via-bounded-proofs-extended-abstract-2309.09731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-thresholds-for-memory-safety-unbounded-guarantees-via-bounded-proofs-extended-abstract-2309.09731"/></url>
<url><loc>https://scifaro.com/en/abs/algebra-of-self-replication-2309.09931</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebra-of-self-replication-2309.09931"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebra-of-self-replication-2309.09931"/></url>
<url><loc>https://scifaro.com/en/abs/fixpoint-constructions-in-focused-orthogonality-models-of-linear-logic-2309.10084</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixpoint-constructions-in-focused-orthogonality-models-of-linear-logic-2309.10084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixpoint-constructions-in-focused-orthogonality-models-of-linear-logic-2309.10084"/></url>
<url><loc>https://scifaro.com/en/abs/lifting-star-autonomous-structures-2309.10422</loc><lastmod>2023-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lifting-star-autonomous-structures-2309.10422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lifting-star-autonomous-structures-2309.10422"/></url>
<url><loc>https://scifaro.com/en/abs/modular-analysis-of-distributed-hybrid-systems-using-post-regions-full-version-2309.10470</loc><lastmod>2023-09-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-analysis-of-distributed-hybrid-systems-using-post-regions-full-version-2309.10470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-analysis-of-distributed-hybrid-systems-using-post-regions-full-version-2309.10470"/></url>
<url><loc>https://scifaro.com/en/abs/the-parameterized-complexity-of-learning-monadic-second-order-logic-2309.10489</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-learning-monadic-second-order-logic-2309.10489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-parameterized-complexity-of-learning-monadic-second-order-logic-2309.10489"/></url>
<url><loc>https://scifaro.com/en/abs/cardinality-and-representation-of-stone-relation-algebras-2309.11676</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cardinality-and-representation-of-stone-relation-algebras-2309.11676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cardinality-and-representation-of-stone-relation-algebras-2309.11676"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-third-order-pattern-matching-in-calculi-with-dependent-types-or-type-constructors-2309.11819</loc><lastmod>2023-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-third-order-pattern-matching-in-calculi-with-dependent-types-or-type-constructors-2309.11819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-third-order-pattern-matching-in-calculi-with-dependent-types-or-type-constructors-2309.11819"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-criteria-for-logically-constrained-rewrite-systems-full-version-2309.12112</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-criteria-for-logically-constrained-rewrite-systems-full-version-2309.12112"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-criteria-for-logically-constrained-rewrite-systems-full-version-2309.12112"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-a-turing-complete-reversible-programming-language-with-inductive-types-2309.12151</loc><lastmod>2024-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-a-turing-complete-reversible-programming-language-with-inductive-types-2309.12151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-a-turing-complete-reversible-programming-language-with-inductive-types-2309.12151"/></url>
<url><loc>https://scifaro.com/en/abs/strong-call-by-value-and-multi-types-2309.12261</loc><lastmod>2023-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-call-by-value-and-multi-types-2309.12261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-call-by-value-and-multi-types-2309.12261"/></url>
<url><loc>https://scifaro.com/en/abs/a-diamond-machine-for-strong-evaluation-2309.12515</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-diamond-machine-for-strong-evaluation-2309.12515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-diamond-machine-for-strong-evaluation-2309.12515"/></url>
<url><loc>https://scifaro.com/en/abs/do-repeat-yourself-understanding-sufficient-conditions-for-restricted-chase-non-termination-2309.12710</loc><lastmod>2023-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/do-repeat-yourself-understanding-sufficient-conditions-for-restricted-chase-non-termination-2309.12710"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/do-repeat-yourself-understanding-sufficient-conditions-for-restricted-chase-non-termination-2309.12710"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-7th-symposium-on-working-formal-methods-2309.12959</loc><lastmod>2023-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-7th-symposium-on-working-formal-methods-2309.12959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-7th-symposium-on-working-formal-methods-2309.12959"/></url>
<url><loc>https://scifaro.com/en/abs/what-is-the-title-of-this-paper-solving-logic-puzzles-using-algorithms-2309.13044</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-is-the-title-of-this-paper-solving-logic-puzzles-using-algorithms-2309.13044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-is-the-title-of-this-paper-solving-logic-puzzles-using-algorithms-2309.13044"/></url>
<url><loc>https://scifaro.com/en/abs/using-z3-to-verify-inferences-in-fragments-of-linear-logic-2309.13796</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-z3-to-verify-inferences-in-fragments-of-linear-logic-2309.13796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-z3-to-verify-inferences-in-fragments-of-linear-logic-2309.13796"/></url>
<url><loc>https://scifaro.com/en/abs/matching-logic-based-understanding-of-polynomial-functors-and-their-initial-final-models-2309.13798</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/matching-logic-based-understanding-of-polynomial-functors-and-their-initial-final-models-2309.13798"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/matching-logic-based-understanding-of-polynomial-functors-and-their-initial-final-models-2309.13798"/></url>
<url><loc>https://scifaro.com/en/abs/a-parallel-dynamic-epistemic-perspective-over-muddy-children-puzzle-2309.13799</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parallel-dynamic-epistemic-perspective-over-muddy-children-puzzle-2309.13799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parallel-dynamic-epistemic-perspective-over-muddy-children-puzzle-2309.13799"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalized-extension-of-the-substitution-lemma-in-coq-2309.13801</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalized-extension-of-the-substitution-lemma-in-coq-2309.13801"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalized-extension-of-the-substitution-lemma-in-coq-2309.13801"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-muddy-children-puzzle-work-in-progress-2309.13808</loc><lastmod>2023-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-muddy-children-puzzle-work-in-progress-2309.13808"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-muddy-children-puzzle-work-in-progress-2309.13808"/></url>
<url><loc>https://scifaro.com/en/abs/a-truly-concurrent-semantics-for-reversible-ccs-2309.14011</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-truly-concurrent-semantics-for-reversible-ccs-2309.14011"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-truly-concurrent-semantics-for-reversible-ccs-2309.14011"/></url>
<url><loc>https://scifaro.com/en/abs/synchronous-agents-verification-and-blame-a-deontic-view-2309.14048</loc><lastmod>2023-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronous-agents-verification-and-blame-a-deontic-view-2309.14048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronous-agents-verification-and-blame-a-deontic-view-2309.14048"/></url>
<url><loc>https://scifaro.com/en/abs/two-tricks-to-trivialize-higher-indexed-families-2309.14187</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-tricks-to-trivialize-higher-indexed-families-2309.14187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-tricks-to-trivialize-higher-indexed-families-2309.14187"/></url>
<url><loc>https://scifaro.com/en/abs/leveraging-datapath-propagation-in-ic3-for-hardware-model-checking-2309.14834</loc><lastmod>2023-09-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leveraging-datapath-propagation-in-ic3-for-hardware-model-checking-2309.14834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leveraging-datapath-propagation-in-ic3-for-hardware-model-checking-2309.14834"/></url>
<url><loc>https://scifaro.com/en/abs/impossible-and-conflicting-obligations-in-justification-logic-2309.15763</loc><lastmod>2023-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/impossible-and-conflicting-obligations-in-justification-logic-2309.15763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/impossible-and-conflicting-obligations-in-justification-logic-2309.15763"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-proof-checking-and-proof-construction-by-tactics-2309.16224</loc><lastmod>2023-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-proof-checking-and-proof-construction-by-tactics-2309.16224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-proof-checking-and-proof-construction-by-tactics-2309.16224"/></url>
<url><loc>https://scifaro.com/en/abs/the-fork-and-its-role-in-unification-of-closure-algebras-2309.16824</loc><lastmod>2025-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fork-and-its-role-in-unification-of-closure-algebras-2309.16824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fork-and-its-role-in-unification-of-closure-algebras-2309.16824"/></url>
<url><loc>https://scifaro.com/en/abs/positionality-in-sigma-0-2-and-a-completeness-result-2309.17022</loc><lastmod>2026-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positionality-in-sigma-0-2-and-a-completeness-result-2309.17022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positionality-in-sigma-0-2-and-a-completeness-result-2309.17022"/></url>
<url><loc>https://scifaro.com/en/abs/how-easy-it-is-to-know-how-an-upper-bound-for-the-satisfiability-problem-2309.17094</loc><lastmod>2023-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-easy-it-is-to-know-how-an-upper-bound-for-the-satisfiability-problem-2309.17094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-easy-it-is-to-know-how-an-upper-bound-for-the-satisfiability-problem-2309.17094"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-logic-over-similarity-graphs-common-distributed-and-mutual-knowledge-2310.00264</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-logic-over-similarity-graphs-common-distributed-and-mutual-knowledge-2310.00264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-logic-over-similarity-graphs-common-distributed-and-mutual-knowledge-2310.00264"/></url>
<url><loc>https://scifaro.com/en/abs/describing-weighted-safety-with-weighted-ltl-over-product-omega-valuation-monoids-2310.00265</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/describing-weighted-safety-with-weighted-ltl-over-product-omega-valuation-monoids-2310.00265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/describing-weighted-safety-with-weighted-ltl-over-product-omega-valuation-monoids-2310.00265"/></url>
<url><loc>https://scifaro.com/en/abs/formal-probabilistic-methods-for-combinatorial-structures-using-the-lov-asz-local-lemma-2310.00513</loc><lastmod>2024-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-probabilistic-methods-for-combinatorial-structures-using-the-lov-asz-local-lemma-2310.00513"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-probabilistic-methods-for-combinatorial-structures-using-the-lov-asz-local-lemma-2310.00513"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-hyperproperties-2310.00705</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-hyperproperties-2310.00705"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-hyperproperties-2310.00705"/></url>
<url><loc>https://scifaro.com/en/abs/semiframes-the-algebra-of-semitopologies-and-actionable-coalitions-2310.00956</loc><lastmod>2026-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiframes-the-algebra-of-semitopologies-and-actionable-coalitions-2310.00956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiframes-the-algebra-of-semitopologies-and-actionable-coalitions-2310.00956"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-one-dimensional-fragment-with-alternation-of-quantifiers-2310.00994</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-one-dimensional-fragment-with-alternation-of-quantifiers-2310.00994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-one-dimensional-fragment-with-alternation-of-quantifiers-2310.00994"/></url>
<url><loc>https://scifaro.com/en/abs/handling-of-past-and-future-with-phenesthe-2310.00997</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/handling-of-past-and-future-with-phenesthe-2310.00997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/handling-of-past-and-future-with-phenesthe-2310.00997"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logic-characterizations-of-forward-reverse-and-forward-reverse-bisimilarities-2310.00998</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logic-characterizations-of-forward-reverse-and-forward-reverse-bisimilarities-2310.00998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logic-characterizations-of-forward-reverse-and-forward-reverse-bisimilarities-2310.00998"/></url>
<url><loc>https://scifaro.com/en/abs/cgaal-distributed-on-the-fly-atl-model-checker-with-heuristics-2310.00999</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cgaal-distributed-on-the-fly-atl-model-checker-with-heuristics-2310.00999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cgaal-distributed-on-the-fly-atl-model-checker-with-heuristics-2310.00999"/></url>
<url><loc>https://scifaro.com/en/abs/un-decidability-bounds-of-the-synthesis-problem-for-petri-games-2310.01000</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/un-decidability-bounds-of-the-synthesis-problem-for-petri-games-2310.01000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/un-decidability-bounds-of-the-synthesis-problem-for-petri-games-2310.01000"/></url>
<url><loc>https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2310.01001</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2310.01001"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterfactual-causality-for-reachability-and-safety-based-on-distance-functions-2310.01001"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-extended-abstract-2310.01007</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-extended-abstract-2310.01007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-groups-without-abelian-normal-subgroups-extended-abstract-2310.01007"/></url>
<url><loc>https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-parameterized-complexity-2310.01134</loc><lastmod>2023-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-parameterized-complexity-2310.01134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-second-order-logic-over-graphs-parameterized-complexity-2310.01134"/></url>
<url><loc>https://scifaro.com/en/abs/the-golden-path-to-guarded-monotone-strict-np-2310.01254</loc><lastmod>2026-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-golden-path-to-guarded-monotone-strict-np-2310.01254"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-golden-path-to-guarded-monotone-strict-np-2310.01254"/></url>
<url><loc>https://scifaro.com/en/abs/theory-of-chtw-systems-born-by-petri-nets-2310.01587</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/theory-of-chtw-systems-born-by-petri-nets-2310.01587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/theory-of-chtw-systems-born-by-petri-nets-2310.01587"/></url>
<url><loc>https://scifaro.com/en/abs/model-explanation-via-support-graphs-2310.01626</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-explanation-via-support-graphs-2310.01626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-explanation-via-support-graphs-2310.01626"/></url>
<url><loc>https://scifaro.com/en/abs/coherent-taylor-expansion-as-a-bimonad-2310.01907</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coherent-taylor-expansion-as-a-bimonad-2310.01907"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coherent-taylor-expansion-as-a-bimonad-2310.01907"/></url>
<url><loc>https://scifaro.com/en/abs/verified-completeness-in-henkin-style-for-intuitionistic-propositional-logic-2310.01916</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-completeness-in-henkin-style-for-intuitionistic-propositional-logic-2310.01916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-completeness-in-henkin-style-for-intuitionistic-propositional-logic-2310.01916"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-complete-discrete-valuation-rings-and-local-fields-2310.01998</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-complete-discrete-valuation-rings-and-local-fields-2310.01998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-complete-discrete-valuation-rings-and-local-fields-2310.01998"/></url>
<url><loc>https://scifaro.com/en/abs/synthetic-tait-computability-the-hard-way-2310.02051</loc><lastmod>2023-10-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthetic-tait-computability-the-hard-way-2310.02051"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthetic-tait-computability-the-hard-way-2310.02051"/></url>
<url><loc>https://scifaro.com/en/abs/strong-faithfulness-for-elh-ontology-embeddings-2310.02198</loc><lastmod>2024-10-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-faithfulness-for-elh-ontology-embeddings-2310.02198"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-faithfulness-for-elh-ontology-embeddings-2310.02198"/></url>
<url><loc>https://scifaro.com/en/abs/the-impact-of-strategies-and-information-in-model-checking-for-multi-agent-systems-2310.02342</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-impact-of-strategies-and-information-in-model-checking-for-multi-agent-systems-2310.02342"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-impact-of-strategies-and-information-in-model-checking-for-multi-agent-systems-2310.02342"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-intuitionistic-computation-tree-logic-2310.02355</loc><lastmod>2023-10-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-intuitionistic-computation-tree-logic-2310.02355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-intuitionistic-computation-tree-logic-2310.02355"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-model-checking-of-discrete-timed-networks-and-symmetric-broadcast-systems-2310.02466</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-model-checking-of-discrete-timed-networks-and-symmetric-broadcast-systems-2310.02466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-model-checking-of-discrete-timed-networks-and-symmetric-broadcast-systems-2310.02466"/></url>
<url><loc>https://scifaro.com/en/abs/note-on-a-translation-from-first-order-logic-into-the-calculus-of-relations-preserving-validity-and-finite-validity-2310.02845</loc><lastmod>2025-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/note-on-a-translation-from-first-order-logic-into-the-calculus-of-relations-preserving-validity-and-finite-validity-2310.02845"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/note-on-a-translation-from-first-order-logic-into-the-calculus-of-relations-preserving-validity-and-finite-validity-2310.02845"/></url>
<url><loc>https://scifaro.com/en/abs/belief-expansion-in-subset-models-2310.03627</loc><lastmod>2023-10-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/belief-expansion-in-subset-models-2310.03627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/belief-expansion-in-subset-models-2310.03627"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-synthesis-algorithm-for-a-mathematical-vernacular-in-the-calculus-of-constructions-2310.04090</loc><lastmod>2023-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-synthesis-algorithm-for-a-mathematical-vernacular-in-the-calculus-of-constructions-2310.04090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-synthesis-algorithm-for-a-mathematical-vernacular-in-the-calculus-of-constructions-2310.04090"/></url>
<url><loc>https://scifaro.com/en/abs/expressiveness-results-for-timed-modal-mu-calculi-2310.04100</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressiveness-results-for-timed-modal-mu-calculi-2310.04100"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressiveness-results-for-timed-modal-mu-calculi-2310.04100"/></url>
<url><loc>https://scifaro.com/en/abs/context-aware-trace-contracts-2310.04384</loc><lastmod>2023-10-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/context-aware-trace-contracts-2310.04384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/context-aware-trace-contracts-2310.04384"/></url>
<url><loc>https://scifaro.com/en/abs/invariant-relations-a-bridge-from-programs-to-equations-2310.04684</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariant-relations-a-bridge-from-programs-to-equations-2310.04684"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariant-relations-a-bridge-from-programs-to-equations-2310.04684"/></url>
<url><loc>https://scifaro.com/en/abs/congruence-closure-modulo-groups-2310.05014</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/congruence-closure-modulo-groups-2310.05014"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/congruence-closure-modulo-groups-2310.05014"/></url>
<url><loc>https://scifaro.com/en/abs/linear-loop-synthesis-for-quadratic-invariants-2310.05120</loc><lastmod>2024-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-loop-synthesis-for-quadratic-invariants-2310.05120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-loop-synthesis-for-quadratic-invariants-2310.05120"/></url>
<url><loc>https://scifaro.com/en/abs/expressive-quantale-valued-logics-for-coalgebras-an-adjunction-based-approach-2310.05711</loc><lastmod>2024-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressive-quantale-valued-logics-for-coalgebras-an-adjunction-based-approach-2310.05711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressive-quantale-valued-logics-for-coalgebras-an-adjunction-based-approach-2310.05711"/></url>
<url><loc>https://scifaro.com/en/abs/unknown-truths-and-unknowable-truths-2310.05777</loc><lastmod>2023-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unknown-truths-and-unknowable-truths-2310.05777"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unknown-truths-and-unknowable-truths-2310.05777"/></url>
<url><loc>https://scifaro.com/en/abs/on-matrix-rank-function-over-bounded-arithmetics-2310.05982</loc><lastmod>2025-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-matrix-rank-function-over-bounded-arithmetics-2310.05982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-matrix-rank-function-over-bounded-arithmetics-2310.05982"/></url>
<url><loc>https://scifaro.com/en/abs/from-innermost-to-full-almost-sure-termination-of-probabilistic-term-rewriting-2310.06121</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-innermost-to-full-almost-sure-termination-of-probabilistic-term-rewriting-2310.06121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-innermost-to-full-almost-sure-termination-of-probabilistic-term-rewriting-2310.06121"/></url>
<url><loc>https://scifaro.com/en/abs/from-realizability-modulo-theories-to-synthesis-modulo-theories-part-1-dynamic-approach-2310.07904</loc><lastmod>2023-10-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-realizability-modulo-theories-to-synthesis-modulo-theories-part-1-dynamic-approach-2310.07904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-realizability-modulo-theories-to-synthesis-modulo-theories-part-1-dynamic-approach-2310.07904"/></url>
<url><loc>https://scifaro.com/en/abs/z3-noodler-an-automata-based-string-solver-technical-report-2310.08327</loc><lastmod>2023-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/z3-noodler-an-automata-based-string-solver-technical-report-2310.08327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/z3-noodler-an-automata-based-string-solver-technical-report-2310.08327"/></url>
<url><loc>https://scifaro.com/en/abs/a-linear-proof-language-for-second-order-intuitionistic-linear-logic-2310.08517</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-linear-proof-language-for-second-order-intuitionistic-linear-logic-2310.08517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-linear-proof-language-for-second-order-intuitionistic-linear-logic-2310.08517"/></url>
<url><loc>https://scifaro.com/en/abs/craig-interpolation-for-decidable-first-order-fragments-2310.08689</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/craig-interpolation-for-decidable-first-order-fragments-2310.08689"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/craig-interpolation-for-decidable-first-order-fragments-2310.08689"/></url>
<url><loc>https://scifaro.com/en/abs/a-flexible-and-efficient-temporal-logic-tool-for-python-pytelo-2310.08714</loc><lastmod>2023-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-flexible-and-efficient-temporal-logic-tool-for-python-pytelo-2310.08714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-flexible-and-efficient-temporal-logic-tool-for-python-pytelo-2310.08714"/></url>
<url><loc>https://scifaro.com/en/abs/a-completeness-theorem-for-probabilistic-regular-expressions-2310.08779</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-completeness-theorem-for-probabilistic-regular-expressions-2310.08779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-completeness-theorem-for-probabilistic-regular-expressions-2310.08779"/></url>
<url><loc>https://scifaro.com/en/abs/an-example-of-goal-directed-calculational-proof-2310.08946</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-example-of-goal-directed-calculational-proof-2310.08946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-example-of-goal-directed-calculational-proof-2310.08946"/></url>
<url><loc>https://scifaro.com/en/abs/the-exponential-logic-of-sequentialization-2310.09038</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-exponential-logic-of-sequentialization-2310.09038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-exponential-logic-of-sequentialization-2310.09038"/></url>
<url><loc>https://scifaro.com/en/abs/dense-integer-complete-synthesis-for-bounded-parametric-timed-automata-2310.09109</loc><lastmod>2026-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dense-integer-complete-synthesis-for-bounded-parametric-timed-automata-2310.09109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dense-integer-complete-synthesis-for-bounded-parametric-timed-automata-2310.09109"/></url>
<url><loc>https://scifaro.com/en/abs/the-treewidth-boundedness-problem-for-an-inductive-separation-logic-of-relations-2310.09542</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-treewidth-boundedness-problem-for-an-inductive-separation-logic-of-relations-2310.09542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-treewidth-boundedness-problem-for-an-inductive-separation-logic-of-relations-2310.09542"/></url>
<url><loc>https://scifaro.com/en/abs/arithmetic-as-a-theory-modulo-2310.10326</loc><lastmod>2023-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arithmetic-as-a-theory-modulo-2310.10326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arithmetic-as-a-theory-modulo-2310.10326"/></url>
<url><loc>https://scifaro.com/en/abs/implicative-models-of-set-theory-2310.10576</loc><lastmod>2024-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicative-models-of-set-theory-2310.10576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicative-models-of-set-theory-2310.10576"/></url>
<url><loc>https://scifaro.com/en/abs/equational-anti-unification-over-absorption-theories-2310.11136</loc><lastmod>2025-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-anti-unification-over-absorption-theories-2310.11136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-anti-unification-over-absorption-theories-2310.11136"/></url>
<url><loc>https://scifaro.com/en/abs/enriching-diagrams-with-algebraic-operations-2310.11288</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enriching-diagrams-with-algebraic-operations-2310.11288"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enriching-diagrams-with-algebraic-operations-2310.11288"/></url>
<url><loc>https://scifaro.com/en/abs/a-kripke-lewis-semantics-for-belief-update-and-belief-revision-2310.11506</loc><lastmod>2023-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-kripke-lewis-semantics-for-belief-update-and-belief-revision-2310.11506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-kripke-lewis-semantics-for-belief-update-and-belief-revision-2310.11506"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-language-to-explain-decision-trees-2310.11636</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-language-to-explain-decision-trees-2310.11636"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-language-to-explain-decision-trees-2310.11636"/></url>
<url><loc>https://scifaro.com/en/abs/a-sample-driven-solving-procedure-for-the-repeated-reachability-of-quantum-ctmcs-2310.11882</loc><lastmod>2023-10-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sample-driven-solving-procedure-for-the-repeated-reachability-of-quantum-ctmcs-2310.11882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sample-driven-solving-procedure-for-the-repeated-reachability-of-quantum-ctmcs-2310.11882"/></url>
<url><loc>https://scifaro.com/en/abs/linear-time-verification-of-data-aware-processes-modulo-theories-via-covers-and-automata-extended-version-2310.12180</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-time-verification-of-data-aware-processes-modulo-theories-via-covers-and-automata-extended-version-2310.12180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-time-verification-of-data-aware-processes-modulo-theories-via-covers-and-automata-extended-version-2310.12180"/></url>
<url><loc>https://scifaro.com/en/abs/an-eager-satisfiability-modulo-theories-solver-for-algebraic-datatypes-2310.12234</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-eager-satisfiability-modulo-theories-solver-for-algebraic-datatypes-2310.12234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-eager-satisfiability-modulo-theories-solver-for-algebraic-datatypes-2310.12234"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-pure-type-systems-in-the-lambda-pi-calculus-modulo-2310.12540</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-pure-type-systems-in-the-lambda-pi-calculus-modulo-2310.12540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-pure-type-systems-in-the-lambda-pi-calculus-modulo-2310.12540"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-normalization-of-linear-temporal-logic-2310.12613</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-normalization-of-linear-temporal-logic-2310.12613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-normalization-of-linear-temporal-logic-2310.12613"/></url>
<url><loc>https://scifaro.com/en/abs/parity-games-on-temporal-graphs-2310.12701</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parity-games-on-temporal-graphs-2310.12701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parity-games-on-temporal-graphs-2310.12701"/></url>
<url><loc>https://scifaro.com/en/abs/liveness-properties-in-geometric-logic-for-domain-theoretic-streams-2310.12763</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/liveness-properties-in-geometric-logic-for-domain-theoretic-streams-2310.12763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/liveness-properties-in-geometric-logic-for-domain-theoretic-streams-2310.12763"/></url>
<url><loc>https://scifaro.com/en/abs/connected-components-and-disjunctive-existential-rules-2310.12884</loc><lastmod>2023-10-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/connected-components-and-disjunctive-existential-rules-2310.12884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/connected-components-and-disjunctive-existential-rules-2310.12884"/></url>
<url><loc>https://scifaro.com/en/abs/representing-sugihara-monoids-via-weakening-relations-2310.12935</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-sugihara-monoids-via-weakening-relations-2310.12935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-sugihara-monoids-via-weakening-relations-2310.12935"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-properties-in-computation-tree-logic-2310.13778</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-properties-in-computation-tree-logic-2310.13778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-properties-in-computation-tree-logic-2310.13778"/></url>
<url><loc>https://scifaro.com/en/abs/trocq-proof-transfer-for-free-with-or-without-univalence-2310.14022</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trocq-proof-transfer-for-free-with-or-without-univalence-2310.14022"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trocq-proof-transfer-for-free-with-or-without-univalence-2310.14022"/></url>
<url><loc>https://scifaro.com/en/abs/nft-formalised-2310.14600</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nft-formalised-2310.14600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nft-formalised-2310.14600"/></url>
<url><loc>https://scifaro.com/en/abs/a-reusable-machine-calculus-for-automated-resource-analyses-2310.14719</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reusable-machine-calculus-for-automated-resource-analyses-2310.14719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reusable-machine-calculus-for-automated-resource-analyses-2310.14719"/></url>
<url><loc>https://scifaro.com/en/abs/on-learning-polynomial-recursive-programs-2310.14725</loc><lastmod>2023-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-learning-polynomial-recursive-programs-2310.14725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-learning-polynomial-recursive-programs-2310.14725"/></url>
<url><loc>https://scifaro.com/en/abs/calculational-design-of-in-correctness-transformational-program-logics-by-abstract-interpretation-2310.15340</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculational-design-of-in-correctness-transformational-program-logics-by-abstract-interpretation-2310.15340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculational-design-of-in-correctness-transformational-program-logics-by-abstract-interpretation-2310.15340"/></url>
<url><loc>https://scifaro.com/en/abs/a-dpll-procedure-with-dichotomous-branching-for-propositional-product-logic-2310.15445</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dpll-procedure-with-dichotomous-branching-for-propositional-product-logic-2310.15445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dpll-procedure-with-dichotomous-branching-for-propositional-product-logic-2310.15445"/></url>
<url><loc>https://scifaro.com/en/abs/what-are-acceptable-reductions-perspectives-from-proof-theoretic-semantics-and-type-theory-2310.15446</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-are-acceptable-reductions-perspectives-from-proof-theoretic-semantics-and-type-theory-2310.15446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-are-acceptable-reductions-perspectives-from-proof-theoretic-semantics-and-type-theory-2310.15446"/></url>
<url><loc>https://scifaro.com/en/abs/towards-assume-guarantee-verification-of-strategic-ability-2310.15727</loc><lastmod>2023-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-assume-guarantee-verification-of-strategic-ability-2310.15727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-assume-guarantee-verification-of-strategic-ability-2310.15727"/></url>
<url><loc>https://scifaro.com/en/abs/semiring-provenance-for-lightweight-description-logics-2310.16472</loc><lastmod>2026-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semiring-provenance-for-lightweight-description-logics-2310.16472"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semiring-provenance-for-lightweight-description-logics-2310.16472"/></url>
<url><loc>https://scifaro.com/en/abs/msatl-a-tool-for-sat-based-atl-satisfiability-checking-2310.16519</loc><lastmod>2023-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/msatl-a-tool-for-sat-based-atl-satisfiability-checking-2310.16519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/msatl-a-tool-for-sat-based-atl-satisfiability-checking-2310.16519"/></url>
<url><loc>https://scifaro.com/en/abs/encoding-impredicative-hierarchy-of-type-universes-with-variables-2310.16595</loc><lastmod>2023-10-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/encoding-impredicative-hierarchy-of-type-universes-with-variables-2310.16595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/encoding-impredicative-hierarchy-of-type-universes-with-variables-2310.16595"/></url>
<url><loc>https://scifaro.com/en/abs/an-infinite-needle-in-a-finite-haystack-finding-infinite-counter-models-in-deductive-verification-2310.16762</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-infinite-needle-in-a-finite-haystack-finding-infinite-counter-models-in-deductive-verification-2310.16762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-infinite-needle-in-a-finite-haystack-finding-infinite-counter-models-in-deductive-verification-2310.16762"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-abstractions-for-realizability-modulo-theories-extended-version-2310.17292</loc><lastmod>2023-10-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-abstractions-for-realizability-modulo-theories-extended-version-2310.17292"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-abstractions-for-realizability-modulo-theories-extended-version-2310.17292"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-at-most-k-encoding-of-sat-for-soft-constraints-2310.17898</loc><lastmod>2023-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-at-most-k-encoding-of-sat-for-soft-constraints-2310.17898"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-at-most-k-encoding-of-sat-for-soft-constraints-2310.17898"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-verification-of-parametric-systems-2310.18069</loc><lastmod>2023-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-verification-of-parametric-systems-2310.18069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-verification-of-parametric-systems-2310.18069"/></url>
<url><loc>https://scifaro.com/en/abs/sufficient-incorrectness-logic-sil-and-separation-sil-2310.18156</loc><lastmod>2026-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sufficient-incorrectness-logic-sil-and-separation-sil-2310.18156"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sufficient-incorrectness-logic-sil-and-separation-sil-2310.18156"/></url>
<url><loc>https://scifaro.com/en/abs/borhan-a-novel-system-for-prioritized-default-logic-2310.18224</loc><lastmod>2023-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/borhan-a-novel-system-for-prioritized-default-logic-2310.18224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/borhan-a-novel-system-for-prioritized-default-logic-2310.18224"/></url>
<url><loc>https://scifaro.com/en/abs/stv-reductions-towards-practical-verification-of-strategic-ability-using-model-reductions-2310.18418</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stv-reductions-towards-practical-verification-of-strategic-ability-using-model-reductions-2310.18418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stv-reductions-towards-practical-verification-of-strategic-ability-using-model-reductions-2310.18418"/></url>
<url><loc>https://scifaro.com/en/abs/linear-realisability-and-cobordisms-2310.19339</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-realisability-and-cobordisms-2310.19339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-realisability-and-cobordisms-2310.19339"/></url>
<url><loc>https://scifaro.com/en/abs/a-navigation-logic-for-recursive-programs-with-dynamic-thread-creation-2310.19579</loc><lastmod>2023-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-navigation-logic-for-recursive-programs-with-dynamic-thread-creation-2310.19579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-navigation-logic-for-recursive-programs-with-dynamic-thread-creation-2310.19579"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-equivalence-properties-in-advanced-logic-programs-bachelor-thesis-2310.19806</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-equivalence-properties-in-advanced-logic-programs-bachelor-thesis-2310.19806"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-equivalence-properties-in-advanced-logic-programs-bachelor-thesis-2310.19806"/></url>
<url><loc>https://scifaro.com/en/abs/pihyflow-operational-semantics-2310.19818</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pihyflow-operational-semantics-2310.19818"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pihyflow-operational-semantics-2310.19818"/></url>
<url><loc>https://scifaro.com/en/abs/relative-normalization-2310.20248</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-normalization-2310.20248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-normalization-2310.20248"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-zermelo-set-theory-2310.20253</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-zermelo-set-theory-2310.20253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-zermelo-set-theory-2310.20253"/></url>
<url><loc>https://scifaro.com/en/abs/configuring-timing-parameters-to-ensure-execution-time-opacity-in-timed-automata-2310.20392</loc><lastmod>2023-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/configuring-timing-parameters-to-ensure-execution-time-opacity-in-timed-automata-2310.20392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/configuring-timing-parameters-to-ensure-execution-time-opacity-in-timed-automata-2310.20392"/></url>
<url><loc>https://scifaro.com/en/abs/formal-translation-from-reversing-petri-nets-to-coloured-petri-nets-2311.00629</loc><lastmod>2023-11-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-translation-from-reversing-petri-nets-to-coloured-petri-nets-2311.00629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-translation-from-reversing-petri-nets-to-coloured-petri-nets-2311.00629"/></url>
<url><loc>https://scifaro.com/en/abs/sat-solving-using-xor-or-and-normal-forms-2311.00733</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-solving-using-xor-or-and-normal-forms-2311.00733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-solving-using-xor-or-and-normal-forms-2311.00733"/></url>
<url><loc>https://scifaro.com/en/abs/a-feasible-and-unitary-quantum-programming-language-2311.01054</loc><lastmod>2024-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-feasible-and-unitary-quantum-programming-language-2311.01054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-feasible-and-unitary-quantum-programming-language-2311.01054"/></url>
<url><loc>https://scifaro.com/en/abs/image-reflection-on-process-graphs-a-novel-approach-for-the-completeness-of-an-axiomatization-of-1-free-regular-expressions-modulo-bisimilarity-2311.01222</loc><lastmod>2024-02-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/image-reflection-on-process-graphs-a-novel-approach-for-the-completeness-of-an-axiomatization-of-1-free-regular-expressions-modulo-bisimilarity-2311.01222"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/image-reflection-on-process-graphs-a-novel-approach-for-the-completeness-of-an-axiomatization-of-1-free-regular-expressions-modulo-bisimilarity-2311.01222"/></url>
<url><loc>https://scifaro.com/en/abs/generic-model-checking-for-modal-fixpoint-logics-in-cool-mc-2311.01315</loc><lastmod>2023-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generic-model-checking-for-modal-fixpoint-logics-in-cool-mc-2311.01315"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generic-model-checking-for-modal-fixpoint-logics-in-cool-mc-2311.01315"/></url>
<url><loc>https://scifaro.com/en/abs/simplicial-models-for-the-epistemic-logic-of-faulty-agents-2311.01351</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplicial-models-for-the-epistemic-logic-of-faulty-agents-2311.01351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplicial-models-for-the-epistemic-logic-of-faulty-agents-2311.01351"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-proof-of-euclid-s-algorithm-2311.01474</loc><lastmod>2023-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-proof-of-euclid-s-algorithm-2311.01474"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-proof-of-euclid-s-algorithm-2311.01474"/></url>
<url><loc>https://scifaro.com/en/abs/a-first-order-theory-of-diagram-chasing-2311.01790</loc><lastmod>2023-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-first-order-theory-of-diagram-chasing-2311.01790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-first-order-theory-of-diagram-chasing-2311.01790"/></url>
<url><loc>https://scifaro.com/en/abs/using-symmetries-to-lift-satisfiability-checking-2311.03424</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-symmetries-to-lift-satisfiability-checking-2311.03424"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-symmetries-to-lift-satisfiability-checking-2311.03424"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-2311.03608</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-2311.03608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-knowledge-in-unawareness-structures-2311.03608"/></url>
<url><loc>https://scifaro.com/en/abs/ramsey-quantifiers-in-linear-arithmetics-2311.04031</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ramsey-quantifiers-in-linear-arithmetics-2311.04031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ramsey-quantifiers-in-linear-arithmetics-2311.04031"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-model-for-retrosynthetic-reaction-analysis-2311.04085</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-model-for-retrosynthetic-reaction-analysis-2311.04085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-model-for-retrosynthetic-reaction-analysis-2311.04085"/></url>
<url><loc>https://scifaro.com/en/abs/polyregular-functions-on-unordered-trees-of-bounded-height-2311.04180</loc><lastmod>2023-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyregular-functions-on-unordered-trees-of-bounded-height-2311.04180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyregular-functions-on-unordered-trees-of-bounded-height-2311.04180"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-bayesian-networks-exactly-extended-version-2311.04651</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-bayesian-networks-exactly-extended-version-2311.04651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-bayesian-networks-exactly-extended-version-2311.04651"/></url>
<url><loc>https://scifaro.com/en/abs/the-monadic-theory-of-toric-words-2311.04895</loc><lastmod>2025-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-monadic-theory-of-toric-words-2311.04895"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-monadic-theory-of-toric-words-2311.04895"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-model-checking-of-temporal-interaction-dynamics-in-the-supreme-court-2311.05177</loc><lastmod>2023-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-model-checking-of-temporal-interaction-dynamics-in-the-supreme-court-2311.05177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-model-checking-of-temporal-interaction-dynamics-in-the-supreme-court-2311.05177"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-bisimilarity-via-barbs-and-contexts-curbing-the-power-of-non-deterministic-observers-2311.06116</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-bisimilarity-via-barbs-and-contexts-curbing-the-power-of-non-deterministic-observers-2311.06116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-bisimilarity-via-barbs-and-contexts-curbing-the-power-of-non-deterministic-observers-2311.06116"/></url>
<url><loc>https://scifaro.com/en/abs/a-formalization-of-martingales-in-isabelle-hol-2311.06188</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formalization-of-martingales-in-isabelle-hol-2311.06188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formalization-of-martingales-in-isabelle-hol-2311.06188"/></url>
<url><loc>https://scifaro.com/en/abs/nonnegativity-problems-for-matrix-semigroups-2311.06241</loc><lastmod>2023-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonnegativity-problems-for-matrix-semigroups-2311.06241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonnegativity-problems-for-matrix-semigroups-2311.06241"/></url>
<url><loc>https://scifaro.com/en/abs/combinatory-array-logic-with-sums-2311.06582</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combinatory-array-logic-with-sums-2311.06582"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combinatory-array-logic-with-sums-2311.06582"/></url>
<url><loc>https://scifaro.com/en/abs/programmatic-strategy-synthesis-resolving-nondeterminism-in-probabilistic-programs-2311.06889</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programmatic-strategy-synthesis-resolving-nondeterminism-in-probabilistic-programs-2311.06889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programmatic-strategy-synthesis-resolving-nondeterminism-in-probabilistic-programs-2311.06889"/></url>
<url><loc>https://scifaro.com/en/abs/kleene-algebra-with-dynamic-tests-completeness-and-complexity-2311.06937</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kleene-algebra-with-dynamic-tests-completeness-and-complexity-2311.06937"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kleene-algebra-with-dynamic-tests-completeness-and-complexity-2311.06937"/></url>
<url><loc>https://scifaro.com/en/abs/dedukti-a-logical-framework-based-on-the-lambda-pi-calculus-modulo-theory-2311.07185</loc><lastmod>2023-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dedukti-a-logical-framework-based-on-the-lambda-pi-calculus-modulo-theory-2311.07185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dedukti-a-logical-framework-based-on-the-lambda-pi-calculus-modulo-theory-2311.07185"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2311.08373</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2311.08373"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-the-acl2-theorem-prover-and-its-applications-2311.08373"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-19th-international-conference-on-quantum-physics-and-logic-2311.08375</loc><lastmod>2023-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-19th-international-conference-on-quantum-physics-and-logic-2311.08375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-19th-international-conference-on-quantum-physics-and-logic-2311.08375"/></url>
<url><loc>https://scifaro.com/en/abs/a-case-study-in-analytic-protocol-analysis-in-acl2-2311.08855</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-case-study-in-analytic-protocol-analysis-in-acl2-2311.08855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-case-study-in-analytic-protocol-analysis-in-acl2-2311.08855"/></url>
<url><loc>https://scifaro.com/en/abs/using-counterexample-generation-and-theory-exploration-to-suggest-missing-hypotheses-2311.08857</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-counterexample-generation-and-theory-exploration-to-suggest-missing-hypotheses-2311.08857"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-counterexample-generation-and-theory-exploration-to-suggest-missing-hypotheses-2311.08857"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-zero-knowledge-circuits-2311.08858</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-zero-knowledge-circuits-2311.08858"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-zero-knowledge-circuits-2311.08858"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-gossipsub-in-acl2s-2311.08859</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-gossipsub-in-acl2s-2311.08859"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-gossipsub-in-acl2s-2311.08859"/></url>
<url><loc>https://scifaro.com/en/abs/proving-calculational-proofs-correct-2311.08860</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-calculational-proofs-correct-2311.08860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-calculational-proofs-correct-2311.08860"/></url>
<url><loc>https://scifaro.com/en/abs/acl2-proofs-of-nonlinear-inequalities-with-imandra-2311.08861</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/acl2-proofs-of-nonlinear-inequalities-with-imandra-2311.08861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/acl2-proofs-of-nonlinear-inequalities-with-imandra-2311.08861"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-a-rust-implementation-of-knuth-s-dancing-links-using-acl2-2311.08862</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-a-rust-implementation-of-knuth-s-dancing-links-using-acl2-2311.08862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-a-rust-implementation-of-knuth-s-dancing-links-using-acl2-2311.08862"/></url>
<url><loc>https://scifaro.com/en/abs/identification-of-causal-influences-in-quantum-processes-2311.08882</loc><lastmod>2023-11-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identification-of-causal-influences-in-quantum-processes-2311.08882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identification-of-causal-influences-in-quantum-processes-2311.08882"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-for-closed-loop-robot-reactive-planning-2311.09780</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-for-closed-loop-robot-reactive-planning-2311.09780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-for-closed-loop-robot-reactive-planning-2311.09780"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-generation-of-scenarios-for-system-level-simulation-based-verification-of-autonomous-driving-systems-2311.09784</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-generation-of-scenarios-for-system-level-simulation-based-verification-of-autonomous-driving-systems-2311.09784"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-generation-of-scenarios-for-system-level-simulation-based-verification-of-autonomous-driving-systems-2311.09784"/></url>
<url><loc>https://scifaro.com/en/abs/enforcing-timing-properties-in-motorway-traffic-2311.09785</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enforcing-timing-properties-in-motorway-traffic-2311.09785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enforcing-timing-properties-in-motorway-traffic-2311.09785"/></url>
<url><loc>https://scifaro.com/en/abs/towards-proved-formal-specification-and-verification-of-stl-operators-as-synchronous-observers-2311.09788</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-proved-formal-specification-and-verification-of-stl-operators-as-synchronous-observers-2311.09788"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-proved-formal-specification-and-verification-of-stl-operators-as-synchronous-observers-2311.09788"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-systems-a-research-preview-2311.09809</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-systems-a-research-preview-2311.09809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-systems-a-research-preview-2311.09809"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2311.09918</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2311.09918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-18th-international-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2311.09918"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-sequential-optimization-under-observability-don-t-cares-2311.09967</loc><lastmod>2023-11-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-sequential-optimization-under-observability-don-t-cares-2311.09967"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-sequential-optimization-under-observability-don-t-cares-2311.09967"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-efficiently-compilable-constraint-languages-2311.10040</loc><lastmod>2024-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-efficiently-compilable-constraint-languages-2311.10040"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-efficiently-compilable-constraint-languages-2311.10040"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-verification-of-natural-deduction-proof-graphs-2311.10440</loc><lastmod>2023-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-verification-of-natural-deduction-proof-graphs-2311.10440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-verification-of-natural-deduction-proof-graphs-2311.10440"/></url>
<url><loc>https://scifaro.com/en/abs/an-interpretation-of-e-ha-w-inside-ha-w-2311.10578</loc><lastmod>2023-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-interpretation-of-e-ha-w-inside-ha-w-2311.10578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-interpretation-of-e-ha-w-inside-ha-w-2311.10578"/></url>
<url><loc>https://scifaro.com/en/abs/nearest-neighbors-you-can-rely-on-formally-verified-k-d-tree-construction-and-search-in-coq-2311.10965</loc><lastmod>2023-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nearest-neighbors-you-can-rely-on-formally-verified-k-d-tree-construction-and-search-in-coq-2311.10965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nearest-neighbors-you-can-rely-on-formally-verified-k-d-tree-construction-and-search-in-coq-2311.10965"/></url>
<url><loc>https://scifaro.com/en/abs/taking-complete-finite-prefixes-to-high-level-symbolically-2311.11443</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taking-complete-finite-prefixes-to-high-level-symbolically-2311.11443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taking-complete-finite-prefixes-to-high-level-symbolically-2311.11443"/></url>
<url><loc>https://scifaro.com/en/abs/crash-stop-failures-in-asynchronous-multiparty-session-types-2311.11851</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/crash-stop-failures-in-asynchronous-multiparty-session-types-2311.11851"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/crash-stop-failures-in-asynchronous-multiparty-session-types-2311.11851"/></url>
<url><loc>https://scifaro.com/en/abs/promise-algebra-an-algebraic-model-of-non-deterministic-computations-2311.12312</loc><lastmod>2023-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/promise-algebra-an-algebraic-model-of-non-deterministic-computations-2311.12312"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/promise-algebra-an-algebraic-model-of-non-deterministic-computations-2311.12312"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-tempering-for-logic-synthesis-2311.12394</loc><lastmod>2023-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-tempering-for-logic-synthesis-2311.12394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-tempering-for-logic-synthesis-2311.12394"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-calculus-of-quantum-programs-with-projective-assertions-2311.14215</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-calculus-of-quantum-programs-with-projective-assertions-2311.14215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-calculus-of-quantum-programs-with-projective-assertions-2311.14215"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-proofs-in-rust-using-ghost-locks-2311.14452</loc><lastmod>2023-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-proofs-in-rust-using-ghost-locks-2311.14452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-proofs-in-rust-using-ghost-locks-2311.14452"/></url>
<url><loc>https://scifaro.com/en/abs/enumerating-error-bounded-polytime-algorithms-through-arithmetical-theories-2311.15003</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/enumerating-error-bounded-polytime-algorithms-through-arithmetical-theories-2311.15003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/enumerating-error-bounded-polytime-algorithms-through-arithmetical-theories-2311.15003"/></url>
<url><loc>https://scifaro.com/en/abs/using-rely-guarantee-to-pinpoint-assumptions-underlying-security-protocols-2311.15189</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-rely-guarantee-to-pinpoint-assumptions-underlying-security-protocols-2311.15189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-rely-guarantee-to-pinpoint-assumptions-underlying-security-protocols-2311.15189"/></url>
<url><loc>https://scifaro.com/en/abs/rely-guarantee-refinement-and-the-aba-problem-part-1-2311.15250</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rely-guarantee-refinement-and-the-aba-problem-part-1-2311.15250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rely-guarantee-refinement-and-the-aba-problem-part-1-2311.15250"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-validity-of-a-generalized-kreisel-putnam-rule-2311.15376</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-validity-of-a-generalized-kreisel-putnam-rule-2311.15376"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-validity-of-a-generalized-kreisel-putnam-rule-2311.15376"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-second-order-hyperltl-2311.15675</loc><lastmod>2026-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-second-order-hyperltl-2311.15675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-second-order-hyperltl-2311.15675"/></url>
<url><loc>https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-i-metric-and-differential-analysis-of-effectful-programs-2311.15704</loc><lastmod>2023-11-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-i-metric-and-differential-analysis-of-effectful-programs-2311.15704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-i-metric-and-differential-analysis-of-effectful-programs-2311.15704"/></url>
<url><loc>https://scifaro.com/en/abs/from-quantifier-depth-to-quantifier-number-separating-structures-with-k-variables-2311.15885</loc><lastmod>2024-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-quantifier-depth-to-quantifier-number-separating-structures-with-k-variables-2311.15885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-quantifier-depth-to-quantifier-number-separating-structures-with-k-variables-2311.15885"/></url>
<url><loc>https://scifaro.com/en/abs/what-monads-can-and-cannot-do-with-a-few-extra-pages-2311.15919</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/what-monads-can-and-cannot-do-with-a-few-extra-pages-2311.15919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/what-monads-can-and-cannot-do-with-a-few-extra-pages-2311.15919"/></url>
<url><loc>https://scifaro.com/en/abs/extending-the-wmso-u-logic-with-quantification-over-tuples-2311.16607</loc><lastmod>2023-11-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extending-the-wmso-u-logic-with-quantification-over-tuples-2311.16607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extending-the-wmso-u-logic-with-quantification-over-tuples-2311.16607"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theoretic-semantics-for-the-logic-of-bunched-implications-2311.16719</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theoretic-semantics-for-the-logic-of-bunched-implications-2311.16719"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theoretic-semantics-for-the-logic-of-bunched-implications-2311.16719"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-verification-of-the-correctness-of-a-subgraph-construction-algorithm-2311.17860</loc><lastmod>2023-11-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-verification-of-the-correctness-of-a-subgraph-construction-algorithm-2311.17860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-verification-of-the-correctness-of-a-subgraph-construction-algorithm-2311.17860"/></url>
<url><loc>https://scifaro.com/en/abs/composition-of-nondeterministic-and-stochastic-services-for-ltlf-task-specifications-2311.18114</loc><lastmod>2023-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/composition-of-nondeterministic-and-stochastic-services-for-ltlf-task-specifications-2311.18114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/composition-of-nondeterministic-and-stochastic-services-for-ltlf-task-specifications-2311.18114"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-bound-and-multi-types-revisited-2311.18233</loc><lastmod>2023-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-bound-and-multi-types-revisited-2311.18233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-bound-and-multi-types-revisited-2311.18233"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-model-checking-on-monadically-stable-graph-classes-2311.18740</loc><lastmod>2023-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-model-checking-on-monadically-stable-graph-classes-2311.18740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-model-checking-on-monadically-stable-graph-classes-2311.18740"/></url>
<url><loc>https://scifaro.com/en/abs/on-multi-step-fuzzy-inference-in-goedel-logic-2312.00320</loc><lastmod>2023-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-multi-step-fuzzy-inference-in-goedel-logic-2312.00320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-multi-step-fuzzy-inference-in-goedel-logic-2312.00320"/></url>
<url><loc>https://scifaro.com/en/abs/a-semi-tensor-product-based-circuit-simulation-for-sat-sweeping-2312.00421</loc><lastmod>2023-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-semi-tensor-product-based-circuit-simulation-for-sat-sweeping-2312.00421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-semi-tensor-product-based-circuit-simulation-for-sat-sweeping-2312.00421"/></url>
<url><loc>https://scifaro.com/en/abs/a-relation-algebra-for-term-rewriting-a-differential-approach-to-sequential-reduction-revised-version-2312.02996</loc><lastmod>2023-12-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-relation-algebra-for-term-rewriting-a-differential-approach-to-sequential-reduction-revised-version-2312.02996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-relation-algebra-for-term-rewriting-a-differential-approach-to-sequential-reduction-revised-version-2312.02996"/></url>
<url><loc>https://scifaro.com/en/abs/internal-and-external-calculi-ordering-the-jungle-without-being-lost-in-translations-2312.03426</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-and-external-calculi-ordering-the-jungle-without-being-lost-in-translations-2312.03426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-and-external-calculi-ordering-the-jungle-without-being-lost-in-translations-2312.03426"/></url>
<url><loc>https://scifaro.com/en/abs/the-implication-problem-for-functional-dependencies-and-variants-of-marginal-distribution-equivalences-2312.03579</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-implication-problem-for-functional-dependencies-and-variants-of-marginal-distribution-equivalences-2312.03579"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-implication-problem-for-functional-dependencies-and-variants-of-marginal-distribution-equivalences-2312.03579"/></url>
<url><loc>https://scifaro.com/en/abs/monoid-theory-in-alonzo-a-little-theories-formalization-in-simple-type-theory-2312.05658</loc><lastmod>2025-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monoid-theory-in-alonzo-a-little-theories-formalization-in-simple-type-theory-2312.05658"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monoid-theory-in-alonzo-a-little-theories-formalization-in-simple-type-theory-2312.05658"/></url>
<url><loc>https://scifaro.com/en/abs/hyperresolution-for-multi-step-fuzzy-inference-in-goedel-logic-2312.05750</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hyperresolution-for-multi-step-fuzzy-inference-in-goedel-logic-2312.05750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hyperresolution-for-multi-step-fuzzy-inference-in-goedel-logic-2312.05750"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-framework-with-infinitary-terms-2312.05919</loc><lastmod>2023-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-framework-with-infinitary-terms-2312.05919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-framework-with-infinitary-terms-2312.05919"/></url>
<url><loc>https://scifaro.com/en/abs/a-practical-formalization-of-monadic-equational-reasoning-in-dependent-type-theory-2312.06103</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-practical-formalization-of-monadic-equational-reasoning-in-dependent-type-theory-2312.06103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-practical-formalization-of-monadic-equational-reasoning-in-dependent-type-theory-2312.06103"/></url>
<url><loc>https://scifaro.com/en/abs/the-directed-van-kampen-theorem-in-lean-2312.06506</loc><lastmod>2025-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-directed-van-kampen-theorem-in-lean-2312.06506"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-directed-van-kampen-theorem-in-lean-2312.06506"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-logic-of-interventionist-counterfactuals-under-indeterministic-causal-laws-2312.07223</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-logic-of-interventionist-counterfactuals-under-indeterministic-causal-laws-2312.07223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-logic-of-interventionist-counterfactuals-under-indeterministic-causal-laws-2312.07223"/></url>
<url><loc>https://scifaro.com/en/abs/a-saturation-based-unification-algorithm-for-higher-order-rational-patterns-2312.07263</loc><lastmod>2025-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-saturation-based-unification-algorithm-for-higher-order-rational-patterns-2312.07263"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-saturation-based-unification-algorithm-for-higher-order-rational-patterns-2312.07263"/></url>
<url><loc>https://scifaro.com/en/abs/memory-simulations-security-and-optimization-in-a-verified-compiler-2312.08117</loc><lastmod>2023-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memory-simulations-security-and-optimization-in-a-verified-compiler-2312.08117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memory-simulations-security-and-optimization-in-a-verified-compiler-2312.08117"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-sixth-international-conference-on-applied-category-theory-2023-2312.08138</loc><lastmod>2023-12-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-international-conference-on-applied-category-theory-2023-2312.08138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-sixth-international-conference-on-applied-category-theory-2023-2312.08138"/></url>
<url><loc>https://scifaro.com/en/abs/an-encoding-of-abstract-dialectical-frameworks-into-higher-order-logic-2312.08375</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-encoding-of-abstract-dialectical-frameworks-into-higher-order-logic-2312.08375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-encoding-of-abstract-dialectical-frameworks-into-higher-order-logic-2312.08375"/></url>
<url><loc>https://scifaro.com/en/abs/object-centric-conformance-alignments-with-synchronization-extended-version-2312.08537</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/object-centric-conformance-alignments-with-synchronization-extended-version-2312.08537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/object-centric-conformance-alignments-with-synchronization-extended-version-2312.08537"/></url>
<url><loc>https://scifaro.com/en/abs/omega-regular-decision-processes-2312.08602</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/omega-regular-decision-processes-2312.08602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/omega-regular-decision-processes-2312.08602"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-reactive-synthesis-using-mode-decomposition-2312.08717</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-reactive-synthesis-using-mode-decomposition-2312.08717"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-reactive-synthesis-using-mode-decomposition-2312.08717"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-monads-for-the-working-formal-metatheorist-2312.08897</loc><lastmod>2023-12-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-monads-for-the-working-formal-metatheorist-2312.08897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-monads-for-the-working-formal-metatheorist-2312.08897"/></url>
<url><loc>https://scifaro.com/en/abs/hoare-like-triples-and-kleene-algebras-with-top-and-tests-towards-a-holistic-perspective-on-hoare-logic-incorrectness-logic-and-beyond-2312.09662</loc><lastmod>2023-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hoare-like-triples-and-kleene-algebras-with-top-and-tests-towards-a-holistic-perspective-on-hoare-logic-incorrectness-logic-and-beyond-2312.09662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hoare-like-triples-and-kleene-algebras-with-top-and-tests-towards-a-holistic-perspective-on-hoare-logic-incorrectness-logic-and-beyond-2312.09662"/></url>
<url><loc>https://scifaro.com/en/abs/submodel-enumeration-for-ctl-is-hard-2312.09868</loc><lastmod>2023-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submodel-enumeration-for-ctl-is-hard-2312.09868"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submodel-enumeration-for-ctl-is-hard-2312.09868"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-modulo-theories-for-verifying-milp-certificates-2312.10420</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-modulo-theories-for-verifying-milp-certificates-2312.10420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-modulo-theories-for-verifying-milp-certificates-2312.10420"/></url>
<url><loc>https://scifaro.com/en/abs/consistency-of-p-time-event-graphs-is-decidable-in-polynomial-time-extended-version-2312.10764</loc><lastmod>2026-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistency-of-p-time-event-graphs-is-decidable-in-polynomial-time-extended-version-2312.10764"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistency-of-p-time-event-graphs-is-decidable-in-polynomial-time-extended-version-2312.10764"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-inductive-invariant-based-verification-of-neural-network-controlled-systems-2312.10842</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-inductive-invariant-based-verification-of-neural-network-controlled-systems-2312.10842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-inductive-invariant-based-verification-of-neural-network-controlled-systems-2312.10842"/></url>
<url><loc>https://scifaro.com/en/abs/learning-temporal-properties-is-np-hard-2312.11403</loc><lastmod>2023-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-temporal-properties-is-np-hard-2312.11403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-temporal-properties-is-np-hard-2312.11403"/></url>
<url><loc>https://scifaro.com/en/abs/exact-asp-counting-with-compact-encodings-2312.11936</loc><lastmod>2023-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-asp-counting-with-compact-encodings-2312.11936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-asp-counting-with-compact-encodings-2312.11936"/></url>
<url><loc>https://scifaro.com/en/abs/an-approximate-skolem-function-counter-2312.12026</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-approximate-skolem-function-counter-2312.12026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-approximate-skolem-function-counter-2312.12026"/></url>
<url><loc>https://scifaro.com/en/abs/auditable-algorithms-for-approximate-model-counting-2312.12362</loc><lastmod>2023-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/auditable-algorithms-for-approximate-model-counting-2312.12362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/auditable-algorithms-for-approximate-model-counting-2312.12362"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-propositional-cyclic-proof-systems-with-fixed-point-operators-2312.12792</loc><lastmod>2024-10-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-propositional-cyclic-proof-systems-with-fixed-point-operators-2312.12792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-propositional-cyclic-proof-systems-with-fixed-point-operators-2312.12792"/></url>
<url><loc>https://scifaro.com/en/abs/milner-s-lambda-calculus-with-partial-substitutions-2312.13270</loc><lastmod>2023-12-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/milner-s-lambda-calculus-with-partial-substitutions-2312.13270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/milner-s-lambda-calculus-with-partial-substitutions-2312.13270"/></url>
<url><loc>https://scifaro.com/en/abs/subsumptions-of-algebraic-rewrite-rules-2312.13294</loc><lastmod>2023-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/subsumptions-of-algebraic-rewrite-rules-2312.13294"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/subsumptions-of-algebraic-rewrite-rules-2312.13294"/></url>
<url><loc>https://scifaro.com/en/abs/peano-arithmetic-and-mu-mall-2312.13634</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/peano-arithmetic-and-mu-mall-2312.13634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/peano-arithmetic-and-mu-mall-2312.13634"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-hardness-of-analyzing-quantum-programs-quantitatively-2312.13657</loc><lastmod>2023-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-hardness-of-analyzing-quantum-programs-quantitatively-2312.13657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-hardness-of-analyzing-quantum-programs-quantitatively-2312.13657"/></url>
<url><loc>https://scifaro.com/en/abs/non-termination-in-term-rewriting-and-logic-programming-2312.13949</loc><lastmod>2023-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-termination-in-term-rewriting-and-logic-programming-2312.13949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-termination-in-term-rewriting-and-logic-programming-2312.13949"/></url>
<url><loc>https://scifaro.com/en/abs/fault-diagnosability-analysis-of-multi-mode-systems-2312.14030</loc><lastmod>2023-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fault-diagnosability-analysis-of-multi-mode-systems-2312.14030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fault-diagnosability-analysis-of-multi-mode-systems-2312.14030"/></url>
<url><loc>https://scifaro.com/en/abs/measuring-well-quasi-ordered-finitary-powersets-2312.14587</loc><lastmod>2024-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/measuring-well-quasi-ordered-finitary-powersets-2312.14587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/measuring-well-quasi-ordered-finitary-powersets-2312.14587"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-models-of-subtyping-2312.14600</loc><lastmod>2023-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-models-of-subtyping-2312.14600"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-models-of-subtyping-2312.14600"/></url>
<url><loc>https://scifaro.com/en/abs/structure-guided-automated-reasoning-2312.14620</loc><lastmod>2025-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-guided-automated-reasoning-2312.14620"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-guided-automated-reasoning-2312.14620"/></url>
<url><loc>https://scifaro.com/en/abs/completions-of-kleene-s-second-model-2312.14656</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completions-of-kleene-s-second-model-2312.14656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completions-of-kleene-s-second-model-2312.14656"/></url>
<url><loc>https://scifaro.com/en/abs/asynchronous-composition-of-ltl-properties-over-infinite-and-finite-traces-2312.14831</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/asynchronous-composition-of-ltl-properties-over-infinite-and-finite-traces-2312.14831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/asynchronous-composition-of-ltl-properties-over-infinite-and-finite-traces-2312.14831"/></url>
<url><loc>https://scifaro.com/en/abs/effectful-semantics-in-2-dimensional-categories-premonoidal-and-freyd-bicategories-2312.14964</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectful-semantics-in-2-dimensional-categories-premonoidal-and-freyd-bicategories-2312.14964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectful-semantics-in-2-dimensional-categories-premonoidal-and-freyd-bicategories-2312.14964"/></url>
<url><loc>https://scifaro.com/en/abs/a-significance-based-account-of-ceteris-paribus-counterfactuals-2312.15209</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-significance-based-account-of-ceteris-paribus-counterfactuals-2312.15209"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-significance-based-account-of-ceteris-paribus-counterfactuals-2312.15209"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-double-pushout-approach-to-graph-transformation-2312.15641</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-double-pushout-approach-to-graph-transformation-2312.15641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-double-pushout-approach-to-graph-transformation-2312.15641"/></url>
<url><loc>https://scifaro.com/en/abs/permissive-nominal-terms-and-their-unification-an-infinite-co-infinite-approach-to-nominal-techniques-2312.15651</loc><lastmod>2023-12-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissive-nominal-terms-and-their-unification-an-infinite-co-infinite-approach-to-nominal-techniques-2312.15651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissive-nominal-terms-and-their-unification-an-infinite-co-infinite-approach-to-nominal-techniques-2312.15651"/></url>
<url><loc>https://scifaro.com/en/abs/pnl-to-hol-from-the-logic-of-nominal-sets-to-the-logic-of-higher-order-functions-2312.16239</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pnl-to-hol-from-the-logic-of-nominal-sets-to-the-logic-of-higher-order-functions-2312.16239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pnl-to-hol-from-the-logic-of-nominal-sets-to-the-logic-of-higher-order-functions-2312.16239"/></url>
<url><loc>https://scifaro.com/en/abs/duality-for-fitting-s-multi-valued-modal-logic-via-bitopology-and-bivietoris-coalgebra-2312.16276</loc><lastmod>2025-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-for-fitting-s-multi-valued-modal-logic-via-bitopology-and-bivietoris-coalgebra-2312.16276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-for-fitting-s-multi-valued-modal-logic-via-bitopology-and-bivietoris-coalgebra-2312.16276"/></url>
<url><loc>https://scifaro.com/en/abs/permissive-nominal-logic-journal-version-2312.16480</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissive-nominal-logic-journal-version-2312.16480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissive-nominal-logic-journal-version-2312.16480"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-semantics-for-predicate-logic-algebras-substitution-quantifiers-and-limits-2312.16487</loc><lastmod>2026-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-semantics-for-predicate-logic-algebras-substitution-quantifiers-and-limits-2312.16487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-semantics-for-predicate-logic-algebras-substitution-quantifiers-and-limits-2312.16487"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-for-languages-for-inference-semirings-monads-and-tensors-2312.16694</loc><lastmod>2023-12-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-for-languages-for-inference-semirings-monads-and-tensors-2312.16694"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-for-languages-for-inference-semirings-monads-and-tensors-2312.16694"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-pseudometrics-for-continuous-time-diffusions-2312.16729</loc><lastmod>2024-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-pseudometrics-for-continuous-time-diffusions-2312.16729"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-pseudometrics-for-continuous-time-diffusions-2312.16729"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-model-checking-in-isabelle-for-human-centric-infrastructure-security-2312.17555</loc><lastmod>2024-01-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-model-checking-in-isabelle-for-human-centric-infrastructure-security-2312.17555"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-model-checking-in-isabelle-for-human-centric-infrastructure-security-2312.17555"/></url>
<url><loc>https://scifaro.com/en/abs/solving-causal-stream-inclusions-2401.00164</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/solving-causal-stream-inclusions-2401.00164"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/solving-causal-stream-inclusions-2401.00164"/></url>
<url><loc>https://scifaro.com/en/abs/a-parametricity-based-formalization-of-semi-simplicial-and-semi-cubical-sets-2401.00512</loc><lastmod>2025-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-parametricity-based-formalization-of-semi-simplicial-and-semi-cubical-sets-2401.00512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-parametricity-based-formalization-of-semi-simplicial-and-semi-cubical-sets-2401.00512"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-logic-with-smt-based-formal-analysis-and-parameter-synthesis-framework-for-parametric-time-petri-nets-2401.01884</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-logic-with-smt-based-formal-analysis-and-parameter-synthesis-framework-for-parametric-time-petri-nets-2401.01884"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-logic-with-smt-based-formal-analysis-and-parameter-synthesis-framework-for-parametric-time-petri-nets-2401.01884"/></url>
<url><loc>https://scifaro.com/en/abs/negation-and-identity-in-a-modal-mode-theory-2401.01893</loc><lastmod>2024-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/negation-and-identity-in-a-modal-mode-theory-2401.01893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/negation-and-identity-in-a-modal-mode-theory-2401.01893"/></url>
<url><loc>https://scifaro.com/en/abs/termination-of-rewriting-on-reversible-boolean-circuits-as-a-free-3-category-problem-2401.02091</loc><lastmod>2024-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/termination-of-rewriting-on-reversible-boolean-circuits-as-a-free-3-category-problem-2401.02091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/termination-of-rewriting-on-reversible-boolean-circuits-as-a-free-3-category-problem-2401.02091"/></url>
<url><loc>https://scifaro.com/en/abs/a-decision-method-for-elementary-stream-calculus-2401.02239</loc><lastmod>2024-01-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-decision-method-for-elementary-stream-calculus-2401.02239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-decision-method-for-elementary-stream-calculus-2401.02239"/></url>
<url><loc>https://scifaro.com/en/abs/substitution-in-the-lambda-calculus-and-the-role-of-the-curry-school-2401.02745</loc><lastmod>2024-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/substitution-in-the-lambda-calculus-and-the-role-of-the-curry-school-2401.02745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/substitution-in-the-lambda-calculus-and-the-role-of-the-curry-school-2401.02745"/></url>
<url><loc>https://scifaro.com/en/abs/practical-reasoning-in-datalogmtl-2401.02869</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-reasoning-in-datalogmtl-2401.02869"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-reasoning-in-datalogmtl-2401.02869"/></url>
<url><loc>https://scifaro.com/en/abs/the-tactician-s-web-of-large-scale-formal-knowledge-2401.02950</loc><lastmod>2024-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-tactician-s-web-of-large-scale-formal-knowledge-2401.02950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-tactician-s-web-of-large-scale-formal-knowledge-2401.02950"/></url>
<url><loc>https://scifaro.com/en/abs/project-and-conquer-fast-quantifier-elimination-for-checking-petri-net-reachability-2401.03711</loc><lastmod>2024-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/project-and-conquer-fast-quantifier-elimination-for-checking-petri-net-reachability-2401.03711"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/project-and-conquer-fast-quantifier-elimination-for-checking-petri-net-reachability-2401.03711"/></url>
<url><loc>https://scifaro.com/en/abs/outcome-logic-a-unified-approach-to-the-metatheory-of-program-logics-with-branching-effects-2401.04594</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/outcome-logic-a-unified-approach-to-the-metatheory-of-program-logics-with-branching-effects-2401.04594"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/outcome-logic-a-unified-approach-to-the-metatheory-of-program-logics-with-branching-effects-2401.04594"/></url>
<url><loc>https://scifaro.com/en/abs/non-numerical-weakly-relational-domains-2401.05165</loc><lastmod>2024-01-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-numerical-weakly-relational-domains-2401.05165"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-numerical-weakly-relational-domains-2401.05165"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-time-bounded-resilience-2401.05585</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-time-bounded-resilience-2401.05585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-time-bounded-resilience-2401.05585"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-approach-to-dibi-models-2401.05842</loc><lastmod>2024-01-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-approach-to-dibi-models-2401.05842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-approach-to-dibi-models-2401.05842"/></url>
<url><loc>https://scifaro.com/en/abs/logical-predicates-in-higher-order-mathematical-operational-semantics-2401.05872</loc><lastmod>2024-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-predicates-in-higher-order-mathematical-operational-semantics-2401.05872"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-predicates-in-higher-order-mathematical-operational-semantics-2401.05872"/></url>
<url><loc>https://scifaro.com/en/abs/graded-modal-logic-and-counting-message-passing-automata-2401.06519</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-modal-logic-and-counting-message-passing-automata-2401.06519"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-modal-logic-and-counting-message-passing-automata-2401.06519"/></url>
<url><loc>https://scifaro.com/en/abs/ctmcs-with-imprecisely-timed-observations-2401.06574</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ctmcs-with-imprecisely-timed-observations-2401.06574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ctmcs-with-imprecisely-timed-observations-2401.06574"/></url>
<url><loc>https://scifaro.com/en/abs/diagrammatic-algebra-of-first-order-logic-2401.07055</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagrammatic-algebra-of-first-order-logic-2401.07055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagrammatic-algebra-of-first-order-logic-2401.07055"/></url>
<url><loc>https://scifaro.com/en/abs/choiceless-computation-and-symmetry-limitations-of-definability-2401.07147</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choiceless-computation-and-symmetry-limitations-of-definability-2401.07147"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choiceless-computation-and-symmetry-limitations-of-definability-2401.07147"/></url>
<url><loc>https://scifaro.com/en/abs/rabin-games-and-colourful-universal-trees-2401.07548</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rabin-games-and-colourful-universal-trees-2401.07548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rabin-games-and-colourful-universal-trees-2401.07548"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-strategy-controlled-systems-in-rewriting-logic-2401.07616</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-strategy-controlled-systems-in-rewriting-logic-2401.07616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-strategy-controlled-systems-in-rewriting-logic-2401.07616"/></url>
<url><loc>https://scifaro.com/en/abs/strategies-model-checking-and-branching-time-properties-in-maude-2401.07680</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategies-model-checking-and-branching-time-properties-in-maude-2401.07680"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategies-model-checking-and-branching-time-properties-in-maude-2401.07680"/></url>
<url><loc>https://scifaro.com/en/abs/simulating-and-model-checking-membrane-systems-using-strategies-in-maude-2401.07743</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simulating-and-model-checking-membrane-systems-using-strategies-in-maude-2401.07743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simulating-and-model-checking-membrane-systems-using-strategies-in-maude-2401.07743"/></url>
<url><loc>https://scifaro.com/en/abs/metalevel-transformation-of-strategies-2401.07749</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/metalevel-transformation-of-strategies-2401.07749"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/metalevel-transformation-of-strategies-2401.07749"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-symplectic-algebra-2401.07914</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-symplectic-algebra-2401.07914"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-symplectic-algebra-2401.07914"/></url>
<url><loc>https://scifaro.com/en/abs/pareto-curves-for-compositionally-model-checking-string-diagrams-of-mdps-2401.08377</loc><lastmod>2024-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pareto-curves-for-compositionally-model-checking-string-diagrams-of-mdps-2401.08377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pareto-curves-for-compositionally-model-checking-string-diagrams-of-mdps-2401.08377"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-reasoning-over-relational-structures-2401.08445</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-reasoning-over-relational-structures-2401.08445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-reasoning-over-relational-structures-2401.08445"/></url>
<url><loc>https://scifaro.com/en/abs/exact-real-search-formalised-optimisation-and-regression-in-constructive-univalent-mathematics-2401.09270</loc><lastmod>2024-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-real-search-formalised-optimisation-and-regression-in-constructive-univalent-mathematics-2401.09270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-real-search-formalised-optimisation-and-regression-in-constructive-univalent-mathematics-2401.09270"/></url>
<url><loc>https://scifaro.com/en/abs/a-classification-of-bisimilarities-for-general-markov-decision-processes-2401.09273</loc><lastmod>2024-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-classification-of-bisimilarities-for-general-markov-decision-processes-2401.09273"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-classification-of-bisimilarities-for-general-markov-decision-processes-2401.09273"/></url>
<url><loc>https://scifaro.com/en/abs/an-introduction-to-different-approaches-to-initial-semantics-2401.09366</loc><lastmod>2024-01-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-introduction-to-different-approaches-to-initial-semantics-2401.09366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-introduction-to-different-approaches-to-initial-semantics-2401.09366"/></url>
<url><loc>https://scifaro.com/en/abs/succinctness-of-cosafety-fragments-of-ltl-via-combinatorial-proof-systems-extended-version-2401.09860</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/succinctness-of-cosafety-fragments-of-ltl-via-combinatorial-proof-systems-extended-version-2401.09860"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/succinctness-of-cosafety-fragments-of-ltl-via-combinatorial-proof-systems-extended-version-2401.09860"/></url>
<url><loc>https://scifaro.com/en/abs/integrating-loop-acceleration-into-bounded-model-checking-2401.09973</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integrating-loop-acceleration-into-bounded-model-checking-2401.09973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integrating-loop-acceleration-into-bounded-model-checking-2401.09973"/></url>
<url><loc>https://scifaro.com/en/abs/single-set-cubical-categories-and-their-formalisation-with-a-proof-assistant-extended-version-2401.10553</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/single-set-cubical-categories-and-their-formalisation-with-a-proof-assistant-extended-version-2401.10553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/single-set-cubical-categories-and-their-formalisation-with-a-proof-assistant-extended-version-2401.10553"/></url>
<url><loc>https://scifaro.com/en/abs/accurately-computing-expected-visiting-times-and-stationary-distributions-in-markov-chains-2401.10638</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accurately-computing-expected-visiting-times-and-stationary-distributions-in-markov-chains-2401.10638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accurately-computing-expected-visiting-times-and-stationary-distributions-in-markov-chains-2401.10638"/></url>
<url><loc>https://scifaro.com/en/abs/drat-proofs-of-unsatisfiability-for-sat-modulo-monotonic-theories-2401.10703</loc><lastmod>2024-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drat-proofs-of-unsatisfiability-for-sat-modulo-monotonic-theories-2401.10703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drat-proofs-of-unsatisfiability-for-sat-modulo-monotonic-theories-2401.10703"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-14th-international-conference-on-automated-deduction-in-geometry-2401.10725</loc><lastmod>2024-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-14th-international-conference-on-automated-deduction-in-geometry-2401.10725"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-14th-international-conference-on-automated-deduction-in-geometry-2401.10725"/></url>
<url><loc>https://scifaro.com/en/abs/haliver-deductive-verification-and-scheduling-languages-join-forces-2401.10778</loc><lastmod>2024-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/haliver-deductive-verification-and-scheduling-languages-join-forces-2401.10778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/haliver-deductive-verification-and-scheduling-languages-join-forces-2401.10778"/></url>
<url><loc>https://scifaro.com/en/abs/timeout-asynchronous-session-types-safe-asynchronous-mixed-choice-for-timed-interactions-2401.11197</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timeout-asynchronous-session-types-safe-asynchronous-mixed-choice-for-timed-interactions-2401.11197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timeout-asynchronous-session-types-safe-asynchronous-mixed-choice-for-timed-interactions-2401.11197"/></url>
<url><loc>https://scifaro.com/en/abs/lower-bounds-for-set-blocked-clauses-proofs-2401.11266</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lower-bounds-for-set-blocked-clauses-proofs-2401.11266"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lower-bounds-for-set-blocked-clauses-proofs-2401.11266"/></url>
<url><loc>https://scifaro.com/en/abs/on-dependent-variables-in-reactive-synthesis-2401.11290</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-dependent-variables-in-reactive-synthesis-2401.11290"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-dependent-variables-in-reactive-synthesis-2401.11290"/></url>
<url><loc>https://scifaro.com/en/abs/univalent-enriched-categories-and-the-enriched-rezk-completion-2401.11752</loc><lastmod>2026-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/univalent-enriched-categories-and-the-enriched-rezk-completion-2401.11752"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/univalent-enriched-categories-and-the-enriched-rezk-completion-2401.11752"/></url>
<url><loc>https://scifaro.com/en/abs/a-fixed-parameter-study-on-propositional-dynamic-logic-2401.11861</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-fixed-parameter-study-on-propositional-dynamic-logic-2401.11861"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-fixed-parameter-study-on-propositional-dynamic-logic-2401.11861"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automatic-transformations-of-coq-proof-scripts-2401.11897</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automatic-transformations-of-coq-proof-scripts-2401.11897"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automatic-transformations-of-coq-proof-scripts-2401.11897"/></url>
<url><loc>https://scifaro.com/en/abs/towards-an-independent-version-of-tarski-s-system-of-geometry-2401.11904</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-an-independent-version-of-tarski-s-system-of-geometry-2401.11904"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-an-independent-version-of-tarski-s-system-of-geometry-2401.11904"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-automated-verification-for-cyber-physical-systems-in-isabelle-hol-2401.12061</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-automated-verification-for-cyber-physical-systems-in-isabelle-hol-2401.12061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-automated-verification-for-cyber-physical-systems-in-isabelle-hol-2401.12061"/></url>
<url><loc>https://scifaro.com/en/abs/a-concise-proof-of-commoner-s-theorem-2401.12067</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-concise-proof-of-commoner-s-theorem-2401.12067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-concise-proof-of-commoner-s-theorem-2401.12067"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-the-future-of-smart-contracts-2401.12093</loc><lastmod>2024-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-the-future-of-smart-contracts-2401.12093"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-the-future-of-smart-contracts-2401.12093"/></url>
<url><loc>https://scifaro.com/en/abs/neurosynt-a-neuro-symbolic-portfolio-solver-for-reactive-synthesis-2401.12131</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neurosynt-a-neuro-symbolic-portfolio-solver-for-reactive-synthesis-2401.12131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neurosynt-a-neuro-symbolic-portfolio-solver-for-reactive-synthesis-2401.12131"/></url>
<url><loc>https://scifaro.com/en/abs/natural-strategic-ability-in-stochastic-multi-agent-systems-2401.12170</loc><lastmod>2025-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-strategic-ability-in-stochastic-multi-agent-systems-2401.12170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-strategic-ability-in-stochastic-multi-agent-systems-2401.12170"/></url>
<url><loc>https://scifaro.com/en/abs/genericity-through-stratification-2401.12212</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/genericity-through-stratification-2401.12212"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/genericity-through-stratification-2401.12212"/></url>
<url><loc>https://scifaro.com/en/abs/a-characterization-of-basic-feasible-functionals-through-higher-order-rewriting-and-tuple-interpretations-2401.12385</loc><lastmod>2025-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-characterization-of-basic-feasible-functionals-through-higher-order-rewriting-and-tuple-interpretations-2401.12385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-characterization-of-basic-feasible-functionals-through-higher-order-rewriting-and-tuple-interpretations-2401.12385"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-axioms-of-mathcal-m-mathcal-n-adhesive-categories-2401.12638</loc><lastmod>2025-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-axioms-of-mathcal-m-mathcal-n-adhesive-categories-2401.12638"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-axioms-of-mathcal-m-mathcal-n-adhesive-categories-2401.12638"/></url>
<url><loc>https://scifaro.com/en/abs/small-test-suites-for-active-automata-learning-2401.12703</loc><lastmod>2024-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-test-suites-for-active-automata-learning-2401.12703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-test-suites-for-active-automata-learning-2401.12703"/></url>
<url><loc>https://scifaro.com/en/abs/rank-decreasing-transductions-2401.13328</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rank-decreasing-transductions-2401.13328"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rank-decreasing-transductions-2401.13328"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-epistemic-logic-of-resource-bounded-information-mining-agents-2401.13369</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-of-resource-bounded-information-mining-agents-2401.13369"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-epistemic-logic-of-resource-bounded-information-mining-agents-2401.13369"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theory-of-right-linear-omega-grammars-via-cyclic-proofs-2401.13382</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theory-of-right-linear-omega-grammars-via-cyclic-proofs-2401.13382"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theory-of-right-linear-omega-grammars-via-cyclic-proofs-2401.13382"/></url>
<url><loc>https://scifaro.com/en/abs/memoryless-strategies-in-stochastic-reachability-games-2401.13390</loc><lastmod>2024-01-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/memoryless-strategies-in-stochastic-reachability-games-2401.13390"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/memoryless-strategies-in-stochastic-reachability-games-2401.13390"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automated-readable-proofs-of-ruler-and-compass-constructions-2401.13700</loc><lastmod>2024-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automated-readable-proofs-of-ruler-and-compass-constructions-2401.13700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automated-readable-proofs-of-ruler-and-compass-constructions-2401.13700"/></url>
<url><loc>https://scifaro.com/en/abs/epimorphisms-and-acyclic-types-in-univalent-foundations-2401.14106</loc><lastmod>2025-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epimorphisms-and-acyclic-types-in-univalent-foundations-2401.14106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epimorphisms-and-acyclic-types-in-univalent-foundations-2401.14106"/></url>
<url><loc>https://scifaro.com/en/abs/an-indexed-linear-logic-for-idempotent-intersection-types-long-version-2401.14126</loc><lastmod>2024-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-indexed-linear-logic-for-idempotent-intersection-types-long-version-2401.14126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-indexed-linear-logic-for-idempotent-intersection-types-long-version-2401.14126"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-the-spell-a-dynamic-logic-analysis-of-misdirection-2401.14516</loc><lastmod>2025-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-the-spell-a-dynamic-logic-analysis-of-misdirection-2401.14516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-the-spell-a-dynamic-logic-analysis-of-misdirection-2401.14516"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-session-type-systems-derived-from-linear-logic-2401.14763</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-session-type-systems-derived-from-linear-logic-2401.14763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-session-type-systems-derived-from-linear-logic-2401.14763"/></url>
<url><loc>https://scifaro.com/en/abs/from-differential-linear-logic-to-coherent-differentiation-2401.14834</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-differential-linear-logic-to-coherent-differentiation-2401.14834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-differential-linear-logic-to-coherent-differentiation-2401.14834"/></url>
<url><loc>https://scifaro.com/en/abs/declassification-policy-for-program-complexity-analysis-2401.14957</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/declassification-policy-for-program-complexity-analysis-2401.14957"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/declassification-policy-for-program-complexity-analysis-2401.14957"/></url>
<url><loc>https://scifaro.com/en/abs/a-resolution-based-interactive-proof-system-for-unsat-2401.14996</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-resolution-based-interactive-proof-system-for-unsat-2401.14996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-resolution-based-interactive-proof-system-for-unsat-2401.14996"/></url>
<url><loc>https://scifaro.com/en/abs/on-symmetries-of-spheres-in-univalent-foundations-2401.15037</loc><lastmod>2024-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-symmetries-of-spheres-in-univalent-foundations-2401.15037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-symmetries-of-spheres-in-univalent-foundations-2401.15037"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-substructural-dependent-type-theory-2401.15258</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-substructural-dependent-type-theory-2401.15258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-substructural-dependent-type-theory-2401.15258"/></url>
<url><loc>https://scifaro.com/en/abs/querying-fault-and-attack-trees-property-specification-on-a-water-network-2401.16015</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/querying-fault-and-attack-trees-property-specification-on-a-water-network-2401.16015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/querying-fault-and-attack-trees-property-specification-on-a-water-network-2401.16015"/></url>
<url><loc>https://scifaro.com/en/abs/minimalistic-system-modelling-behaviours-interfaces-and-local-reasoning-2401.16109</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimalistic-system-modelling-behaviours-interfaces-and-local-reasoning-2401.16109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimalistic-system-modelling-behaviours-interfaces-and-local-reasoning-2401.16109"/></url>
<url><loc>https://scifaro.com/en/abs/elementary-first-order-model-checking-for-sparse-graphs-2401.16230</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/elementary-first-order-model-checking-for-sparse-graphs-2401.16230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/elementary-first-order-model-checking-for-sparse-graphs-2401.16230"/></url>
<url><loc>https://scifaro.com/en/abs/choiceless-polynomial-space-2401.16366</loc><lastmod>2024-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/choiceless-polynomial-space-2401.16366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/choiceless-polynomial-space-2401.16366"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-fragment-of-ltl-eb-2401.16838</loc><lastmod>2024-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-fragment-of-ltl-eb-2401.16838"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-fragment-of-ltl-eb-2401.16838"/></url>
<url><loc>https://scifaro.com/en/abs/the-thins-ordering-on-relations-2401.16888</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-thins-ordering-on-relations-2401.16888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-thins-ordering-on-relations-2401.16888"/></url>
<url><loc>https://scifaro.com/en/abs/diagonals-and-block-ordered-relations-2401.17130</loc><lastmod>2024-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/diagonals-and-block-ordered-relations-2401.17130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/diagonals-and-block-ordered-relations-2401.17130"/></url>
<url><loc>https://scifaro.com/en/abs/a-mixed-linear-and-graded-logic-proofs-terms-and-models-with-appendices-2401.17199</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-mixed-linear-and-graded-logic-proofs-terms-and-models-with-appendices-2401.17199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-mixed-linear-and-graded-logic-proofs-terms-and-models-with-appendices-2401.17199"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-problems-in-protocol-analysis-extending-the-notion-of-subterm-convergent-2401.17226</loc><lastmod>2026-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-problems-in-protocol-analysis-extending-the-notion-of-subterm-convergent-2401.17226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-problems-in-protocol-analysis-extending-the-notion-of-subterm-convergent-2401.17226"/></url>
<url><loc>https://scifaro.com/en/abs/an-analysis-of-symmetry-in-quantitative-semantics-2401.17483</loc><lastmod>2024-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-analysis-of-symmetry-in-quantitative-semantics-2401.17483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-analysis-of-symmetry-in-quantitative-semantics-2401.17483"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-subsumption-resolution-2401.17832</loc><lastmod>2024-02-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-subsumption-resolution-2401.17832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-subsumption-resolution-2401.17832"/></url>
<url><loc>https://scifaro.com/en/abs/the-maude-strategy-language-2402.00275</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-maude-strategy-language-2402.00275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-maude-strategy-language-2402.00275"/></url>
<url><loc>https://scifaro.com/en/abs/a-hoare-logic-for-domain-specification-full-version-2402.00452</loc><lastmod>2024-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-hoare-logic-for-domain-specification-full-version-2402.00452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-hoare-logic-for-domain-specification-full-version-2402.00452"/></url>
<url><loc>https://scifaro.com/en/abs/bialgebraic-reasoning-on-higher-order-program-equivalence-2402.00625</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bialgebraic-reasoning-on-higher-order-program-equivalence-2402.00625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bialgebraic-reasoning-on-higher-order-program-equivalence-2402.00625"/></url>
<url><loc>https://scifaro.com/en/abs/reflection-and-preservation-of-properties-in-coalgebraic-bi-simulations-2402.00958</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflection-and-preservation-of-properties-in-coalgebraic-bi-simulations-2402.00958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflection-and-preservation-of-properties-in-coalgebraic-bi-simulations-2402.00958"/></url>
<url><loc>https://scifaro.com/en/abs/multiset-bisimulations-as-a-common-framework-for-ordinary-and-probabilistic-bisimulations-2402.00962</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiset-bisimulations-as-a-common-framework-for-ordinary-and-probabilistic-bisimulations-2402.00962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiset-bisimulations-as-a-common-framework-for-ordinary-and-probabilistic-bisimulations-2402.00962"/></url>
<url><loc>https://scifaro.com/en/abs/non-strongly-stable-orders-also-define-interesting-simulation-relations-2402.00963</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-strongly-stable-orders-also-define-interesting-simulation-relations-2402.00963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-strongly-stable-orders-also-define-interesting-simulation-relations-2402.00963"/></url>
<url><loc>https://scifaro.com/en/abs/logics-for-contravariant-simulations-2402.00964</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-for-contravariant-simulations-2402.00964"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-for-contravariant-simulations-2402.00964"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-specification-of-modal-systems-a-comparison-of-three-frameworks-2402.00966</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-specification-of-modal-systems-a-comparison-of-three-frameworks-2402.00966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-specification-of-modal-systems-a-comparison-of-three-frameworks-2402.00966"/></url>
<url><loc>https://scifaro.com/en/abs/when-are-prime-formulae-characteristic-2402.00970</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-are-prime-formulae-characteristic-2402.00970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-are-prime-formulae-characteristic-2402.00970"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterisations-rule-formats-and-compositionality-for-input-output-conformance-simulation-2402.00973</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterisations-rule-formats-and-compositionality-for-input-output-conformance-simulation-2402.00973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterisations-rule-formats-and-compositionality-for-input-output-conformance-simulation-2402.00973"/></url>
<url><loc>https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-2402.00982</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-2402.00982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rule-formats-for-nominal-process-calculi-2402.00982"/></url>
<url><loc>https://scifaro.com/en/abs/quantifying-analogy-of-concepts-via-ologs-and-wiring-diagrams-2402.01020</loc><lastmod>2025-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantifying-analogy-of-concepts-via-ologs-and-wiring-diagrams-2402.01020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantifying-analogy-of-concepts-via-ologs-and-wiring-diagrams-2402.01020"/></url>
<url><loc>https://scifaro.com/en/abs/life-span-of-sat-techniques-2402.01202</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/life-span-of-sat-techniques-2402.01202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/life-span-of-sat-techniques-2402.01202"/></url>
<url><loc>https://scifaro.com/en/abs/compiling-high-level-neural-network-specifications-into-vnn-lib-queries-2402.01353</loc><lastmod>2026-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compiling-high-level-neural-network-specifications-into-vnn-lib-queries-2402.01353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compiling-high-level-neural-network-specifications-into-vnn-lib-queries-2402.01353"/></url>
<url><loc>https://scifaro.com/en/abs/adjoint-natural-deduction-extended-version-2402.01428</loc><lastmod>2024-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adjoint-natural-deduction-extended-version-2402.01428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adjoint-natural-deduction-extended-version-2402.01428"/></url>
<url><loc>https://scifaro.com/en/abs/satisfiability-modulo-exponential-integer-arithmetic-2402.01501</loc><lastmod>2025-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/satisfiability-modulo-exponential-integer-arithmetic-2402.01501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/satisfiability-modulo-exponential-integer-arithmetic-2402.01501"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulations-and-logics-for-higher-dimensional-automata-2402.01589</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulations-and-logics-for-higher-dimensional-automata-2402.01589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulations-and-logics-for-higher-dimensional-automata-2402.01589"/></url>
<url><loc>https://scifaro.com/en/abs/ruitenburg-s-theorem-mechanized-and-contextualized-2402.01840</loc><lastmod>2025-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ruitenburg-s-theorem-mechanized-and-contextualized-2402.01840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ruitenburg-s-theorem-mechanized-and-contextualized-2402.01840"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-semantics-for-intuitionistic-linear-logic-2402.01982</loc><lastmod>2025-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-semantics-for-intuitionistic-linear-logic-2402.01982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-semantics-for-intuitionistic-linear-logic-2402.01982"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-complexity-of-finite-random-structures-2402.02567</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-complexity-of-finite-random-structures-2402.02567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-complexity-of-finite-random-structures-2402.02567"/></url>
<url><loc>https://scifaro.com/en/abs/models-of-high-level-computation-2402.02602</loc><lastmod>2025-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/models-of-high-level-computation-2402.02602"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/models-of-high-level-computation-2402.02602"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-completeness-of-interpolation-algorithms-2402.02829</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-completeness-of-interpolation-algorithms-2402.02829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-completeness-of-interpolation-algorithms-2402.02829"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-rule-format-for-bounded-nondeterminism-in-sos-with-terms-as-labels-2402.02847</loc><lastmod>2024-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-rule-format-for-bounded-nondeterminism-in-sos-with-terms-as-labels-2402.02847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-rule-format-for-bounded-nondeterminism-in-sos-with-terms-as-labels-2402.02847"/></url>
<url><loc>https://scifaro.com/en/abs/the-patch-topology-in-univalent-foundations-2402.03134</loc><lastmod>2025-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-patch-topology-in-univalent-foundations-2402.03134"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-patch-topology-in-univalent-foundations-2402.03134"/></url>
<url><loc>https://scifaro.com/en/abs/proof-theory-and-decision-procedures-for-deontic-stit-logics-2402.03148</loc><lastmod>2024-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-theory-and-decision-procedures-for-deontic-stit-logics-2402.03148"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-theory-and-decision-procedures-for-deontic-stit-logics-2402.03148"/></url>
<url><loc>https://scifaro.com/en/abs/semitopology-distributed-collaborative-action-via-topology-algebra-and-logic-2402.03253</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semitopology-distributed-collaborative-action-via-topology-algebra-and-logic-2402.03253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semitopology-distributed-collaborative-action-via-topology-algebra-and-logic-2402.03253"/></url>
<url><loc>https://scifaro.com/en/abs/redex-coq-towards-a-theory-of-decidability-of-redex-s-reduction-semantics-2402.03488</loc><lastmod>2024-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/redex-coq-towards-a-theory-of-decidability-of-redex-s-reduction-semantics-2402.03488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/redex-coq-towards-a-theory-of-decidability-of-redex-s-reduction-semantics-2402.03488"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-lawvere-logic-2402.03543</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-lawvere-logic-2402.03543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-lawvere-logic-2402.03543"/></url>
<url><loc>https://scifaro.com/en/abs/control-flow-refinement-for-complexity-analysis-of-probabilistic-programs-in-koat-2402.03891</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/control-flow-refinement-for-complexity-analysis-of-probabilistic-programs-in-koat-2402.03891"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/control-flow-refinement-for-complexity-analysis-of-probabilistic-programs-in-koat-2402.03891"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-of-iterative-sets-in-homotopy-type-theory-and-univalent-foundations-2402.04893</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-of-iterative-sets-in-homotopy-type-theory-and-univalent-foundations-2402.04893"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-of-iterative-sets-in-homotopy-type-theory-and-univalent-foundations-2402.04893"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-automated-market-makers-in-the-lean-4-theorem-prover-2402.06064</loc><lastmod>2024-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-automated-market-makers-in-the-lean-4-theorem-prover-2402.06064"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-automated-market-makers-in-the-lean-4-theorem-prover-2402.06064"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-learning-of-computation-tree-logic-2402.06366</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-learning-of-computation-tree-logic-2402.06366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-learning-of-computation-tree-logic-2402.06366"/></url>
<url><loc>https://scifaro.com/en/abs/principal-types-as-partial-involutions-2402.07230</loc><lastmod>2025-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/principal-types-as-partial-involutions-2402.07230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/principal-types-as-partial-involutions-2402.07230"/></url>
<url><loc>https://scifaro.com/en/abs/synthesizing-strongly-equivalent-logic-programs-beth-definability-for-answer-set-programs-via-craig-interpolation-in-first-order-logic-2402.07696</loc><lastmod>2024-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesizing-strongly-equivalent-logic-programs-beth-definability-for-answer-set-programs-via-craig-interpolation-in-first-order-logic-2402.07696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesizing-strongly-equivalent-logic-programs-beth-definability-for-answer-set-programs-via-craig-interpolation-in-first-order-logic-2402.07696"/></url>
<url><loc>https://scifaro.com/en/abs/an-algorithmic-meta-theorem-for-homomorphism-indistinguishability-2402.08989</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algorithmic-meta-theorem-for-homomorphism-indistinguishability-2402.08989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algorithmic-meta-theorem-for-homomorphism-indistinguishability-2402.08989"/></url>
<url><loc>https://scifaro.com/en/abs/unified-opinion-dynamic-modeling-as-concurrent-set-relations-in-rewriting-logic-2402.09021</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unified-opinion-dynamic-modeling-as-concurrent-set-relations-in-rewriting-logic-2402.09021"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unified-opinion-dynamic-modeling-as-concurrent-set-relations-in-rewriting-logic-2402.09021"/></url>
<url><loc>https://scifaro.com/en/abs/from-rewrite-rules-to-axioms-in-the-lambda-pi-calculus-modulo-theory-2402.09024</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-rewrite-rules-to-axioms-in-the-lambda-pi-calculus-modulo-theory-2402.09024"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-rewrite-rules-to-axioms-in-the-lambda-pi-calculus-modulo-theory-2402.09024"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-graded-linear-logic-and-differential-operators-2402.09138</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-graded-linear-logic-and-differential-operators-2402.09138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-graded-linear-logic-and-differential-operators-2402.09138"/></url>
<url><loc>https://scifaro.com/en/abs/identifying-tractable-quantified-temporal-constraints-within-ord-horn-2402.09187</loc><lastmod>2024-02-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identifying-tractable-quantified-temporal-constraints-within-ord-horn-2402.09187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identifying-tractable-quantified-temporal-constraints-within-ord-horn-2402.09187"/></url>
<url><loc>https://scifaro.com/en/abs/inferentialist-resource-semantics-2402.09217</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferentialist-resource-semantics-2402.09217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferentialist-resource-semantics-2402.09217"/></url>
<url><loc>https://scifaro.com/en/abs/correctly-communicating-software-distributed-asynchronous-and-beyond-extended-version-2402.09595</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correctly-communicating-software-distributed-asynchronous-and-beyond-extended-version-2402.09595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correctly-communicating-software-distributed-asynchronous-and-beyond-extended-version-2402.09595"/></url>
<url><loc>https://scifaro.com/en/abs/strict-width-for-constraint-satisfaction-problems-over-homogeneous-strucures-of-finite-duality-2402.09951</loc><lastmod>2024-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strict-width-for-constraint-satisfaction-problems-over-homogeneous-strucures-of-finite-duality-2402.09951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strict-width-for-constraint-satisfaction-problems-over-homogeneous-strucures-of-finite-duality-2402.09951"/></url>
<url><loc>https://scifaro.com/en/abs/overapproximation-of-non-linear-integer-arithmetic-for-smart-contract-verification-2402.10174</loc><lastmod>2024-02-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overapproximation-of-non-linear-integer-arithmetic-for-smart-contract-verification-2402.10174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overapproximation-of-non-linear-integer-arithmetic-for-smart-contract-verification-2402.10174"/></url>
<url><loc>https://scifaro.com/en/abs/parallel-play-saves-quantifiers-2402.10293</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parallel-play-saves-quantifiers-2402.10293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parallel-play-saves-quantifiers-2402.10293"/></url>
<url><loc>https://scifaro.com/en/abs/mechanised-uniform-interpolation-for-modal-logics-k-gl-and-isl-2402.10494</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanised-uniform-interpolation-for-modal-logics-k-gl-and-isl-2402.10494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanised-uniform-interpolation-for-modal-logics-k-gl-and-isl-2402.10494"/></url>
<url><loc>https://scifaro.com/en/abs/spanning-matrices-via-satisfiability-solving-2402.10610</loc><lastmod>2024-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/spanning-matrices-via-satisfiability-solving-2402.10610"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/spanning-matrices-via-satisfiability-solving-2402.10610"/></url>
<url><loc>https://scifaro.com/en/abs/towards-benchmarking-of-solidity-verification-tools-2402.10750</loc><lastmod>2024-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-benchmarking-of-solidity-verification-tools-2402.10750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-benchmarking-of-solidity-verification-tools-2402.10750"/></url>
<url><loc>https://scifaro.com/en/abs/type-isomorphisms-for-multiplicative-additive-linear-logic-2402.11987</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-isomorphisms-for-multiplicative-additive-linear-logic-2402.11987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-isomorphisms-for-multiplicative-additive-linear-logic-2402.11987"/></url>
<url><loc>https://scifaro.com/en/abs/mirroring-call-by-need-or-values-acting-silly-2402.12078</loc><lastmod>2026-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mirroring-call-by-need-or-values-acting-silly-2402.12078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mirroring-call-by-need-or-values-acting-silly-2402.12078"/></url>
<url><loc>https://scifaro.com/en/abs/automating-boundary-filling-in-cubical-type-theories-2402.12169</loc><lastmod>2026-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-boundary-filling-in-cubical-type-theories-2402.12169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-boundary-filling-in-cubical-type-theories-2402.12169"/></url>
<url><loc>https://scifaro.com/en/abs/assume-guarantee-contract-algebras-are-dp-algebras-2402.12514</loc><lastmod>2025-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/assume-guarantee-contract-algebras-are-dp-algebras-2402.12514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/assume-guarantee-contract-algebras-are-dp-algebras-2402.12514"/></url>
<url><loc>https://scifaro.com/en/abs/modular-assurance-of-complex-systems-using-contract-based-design-principles-2402.12804</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-assurance-of-complex-systems-using-contract-based-design-principles-2402.12804"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-assurance-of-complex-systems-using-contract-based-design-principles-2402.12804"/></url>
<url><loc>https://scifaro.com/en/abs/profinite-trees-through-lawvere-theories-and-the-lambda-calculus-2402.13086</loc><lastmod>2026-02-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/profinite-trees-through-lawvere-theories-and-the-lambda-calculus-2402.13086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/profinite-trees-through-lawvere-theories-and-the-lambda-calculus-2402.13086"/></url>
<url><loc>https://scifaro.com/en/abs/homotopy-io-a-proof-assistant-for-finitely-presented-globular-n-categories-2402.13179</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homotopy-io-a-proof-assistant-for-finitely-presented-globular-n-categories-2402.13179"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homotopy-io-a-proof-assistant-for-finitely-presented-globular-n-categories-2402.13179"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-pushdown-vass-in-one-dimension-are-easy-2402.13237</loc><lastmod>2024-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-pushdown-vass-in-one-dimension-are-easy-2402.13237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-pushdown-vass-in-one-dimension-are-easy-2402.13237"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-of-logically-constrained-rewrite-systems-revisited-2402.13552</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-of-logically-constrained-rewrite-systems-revisited-2402.13552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-of-logically-constrained-rewrite-systems-revisited-2402.13552"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-logical-actions-in-magic-tricks-2402.13802</loc><lastmod>2024-02-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-logical-actions-in-magic-tricks-2402.13802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-logical-actions-in-magic-tricks-2402.13802"/></url>
<url><loc>https://scifaro.com/en/abs/machine-checked-categorical-diagrammatic-reasoning-2402.14485</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/machine-checked-categorical-diagrammatic-reasoning-2402.14485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/machine-checked-categorical-diagrammatic-reasoning-2402.14485"/></url>
<url><loc>https://scifaro.com/en/abs/attractors-of-parikh-mapping-iterations-2402.14932</loc><lastmod>2024-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/attractors-of-parikh-mapping-iterations-2402.14932"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/attractors-of-parikh-mapping-iterations-2402.14932"/></url>
<url><loc>https://scifaro.com/en/abs/interpretation-of-inaccessible-sets-in-martin-l-of-type-theory-with-one-mahlo-universe-2402.15074</loc><lastmod>2025-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpretation-of-inaccessible-sets-in-martin-l-of-type-theory-with-one-mahlo-universe-2402.15074"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpretation-of-inaccessible-sets-in-martin-l-of-type-theory-with-one-mahlo-universe-2402.15074"/></url>
<url><loc>https://scifaro.com/en/abs/the-flower-calculus-2402.15174</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-flower-calculus-2402.15174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-flower-calculus-2402.15174"/></url>
<url><loc>https://scifaro.com/en/abs/regular-resolution-effectively-simulates-resolution-2402.15871</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-resolution-effectively-simulates-resolution-2402.15871"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-resolution-effectively-simulates-resolution-2402.15871"/></url>
<url><loc>https://scifaro.com/en/abs/effective-mso-definability-for-tree-width-bounded-models-of-an-inductive-separation-logic-of-relations-2402.16150</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-mso-definability-for-tree-width-bounded-models-of-an-inductive-separation-logic-of-relations-2402.16150"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-mso-definability-for-tree-width-bounded-models-of-an-inductive-separation-logic-of-relations-2402.16150"/></url>
<url><loc>https://scifaro.com/en/abs/how-to-avoid-the-commuting-conversions-of-ipc-2402.16171</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/how-to-avoid-the-commuting-conversions-of-ipc-2402.16171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/how-to-avoid-the-commuting-conversions-of-ipc-2402.16171"/></url>
<url><loc>https://scifaro.com/en/abs/equational-bit-vector-solving-via-strong-gr-obner-bases-2402.16314</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-bit-vector-solving-via-strong-gr-obner-bases-2402.16314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-bit-vector-solving-via-strong-gr-obner-bases-2402.16314"/></url>
<url><loc>https://scifaro.com/en/abs/quasi-directed-jonsson-operations-imply-bounded-width-for-fo-expansions-of-symmetric-binary-cores-with-free-amalgamation-2402.16540</loc><lastmod>2024-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quasi-directed-jonsson-operations-imply-bounded-width-for-fo-expansions-of-symmetric-binary-cores-with-free-amalgamation-2402.16540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quasi-directed-jonsson-operations-imply-bounded-width-for-fo-expansions-of-symmetric-binary-cores-with-free-amalgamation-2402.16540"/></url>
<url><loc>https://scifaro.com/en/abs/a-constraint-based-mathematical-modeling-library-in-prolog-with-answer-constraint-semantics-2402.17286</loc><lastmod>2024-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constraint-based-mathematical-modeling-library-in-prolog-with-answer-constraint-semantics-2402.17286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constraint-based-mathematical-modeling-library-in-prolog-with-answer-constraint-semantics-2402.17286"/></url>
<url><loc>https://scifaro.com/en/abs/equivariant-ideals-of-polynomials-2402.17604</loc><lastmod>2026-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivariant-ideals-of-polynomials-2402.17604"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivariant-ideals-of-polynomials-2402.17604"/></url>
<url><loc>https://scifaro.com/en/abs/mcsat-based-finite-field-reasoning-in-the-yices2-smt-solver-2402.17927</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcsat-based-finite-field-reasoning-in-the-yices2-smt-solver-2402.17927"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcsat-based-finite-field-reasoning-in-the-yices2-smt-solver-2402.17927"/></url>
<url><loc>https://scifaro.com/en/abs/similarity-based-analogical-proportions-2402.18360</loc><lastmod>2024-02-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/similarity-based-analogical-proportions-2402.18360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/similarity-based-analogical-proportions-2402.18360"/></url>
<url><loc>https://scifaro.com/en/abs/bluebell-an-alliance-of-relational-lifting-and-independence-for-probabilistic-reasoning-2402.18708</loc><lastmod>2024-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bluebell-an-alliance-of-relational-lifting-and-independence-for-probabilistic-reasoning-2402.18708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bluebell-an-alliance-of-relational-lifting-and-independence-for-probabilistic-reasoning-2402.18708"/></url>
<url><loc>https://scifaro.com/en/abs/getting-saturated-with-induction-2402.18954</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/getting-saturated-with-induction-2402.18954"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/getting-saturated-with-induction-2402.18954"/></url>
<url><loc>https://scifaro.com/en/abs/program-synthesis-in-saturation-2402.18962</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-synthesis-in-saturation-2402.18962"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-synthesis-in-saturation-2402.18962"/></url>
<url><loc>https://scifaro.com/en/abs/invariant-checking-for-smt-based-systems-with-quantifiers-2402.19028</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/invariant-checking-for-smt-based-systems-with-quantifiers-2402.19028"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/invariant-checking-for-smt-based-systems-with-quantifiers-2402.19028"/></url>
<url><loc>https://scifaro.com/en/abs/rewriting-and-inductive-reasoning-2402.19199</loc><lastmod>2024-03-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rewriting-and-inductive-reasoning-2402.19199"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rewriting-and-inductive-reasoning-2402.19199"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-verification-of-a-generic-interlocking-logic-dafny-meets-parameterized-model-checking-2403.00087</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-verification-of-a-generic-interlocking-logic-dafny-meets-parameterized-model-checking-2403.00087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-verification-of-a-generic-interlocking-logic-dafny-meets-parameterized-model-checking-2403.00087"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-assurance-and-synthesis-of-controllers-from-activity-diagrams-2403.00169</loc><lastmod>2024-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-assurance-and-synthesis-of-controllers-from-activity-diagrams-2403.00169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-assurance-and-synthesis-of-controllers-from-activity-diagrams-2403.00169"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-s4-modal-logics-with-the-finite-birelational-frame-property-2403.00201</loc><lastmod>2024-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-s4-modal-logics-with-the-finite-birelational-frame-property-2403.00201"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-s4-modal-logics-with-the-finite-birelational-frame-property-2403.00201"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-divergence-for-nondeterministic-probabilistic-models-2403.00491</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-divergence-for-nondeterministic-probabilistic-models-2403.00491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-divergence-for-nondeterministic-probabilistic-models-2403.00491"/></url>
<url><loc>https://scifaro.com/en/abs/representing-guardedness-in-call-by-value-and-guarded-parametrized-monads-2403.00704</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/representing-guardedness-in-call-by-value-and-guarded-parametrized-monads-2403.00704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/representing-guardedness-in-call-by-value-and-guarded-parametrized-monads-2403.00704"/></url>
<url><loc>https://scifaro.com/en/abs/semi-automated-modular-formal-verification-of-critical-software-liveness-and-completeness-thresholds-2403.00934</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-automated-modular-formal-verification-of-critical-software-liveness-and-completeness-thresholds-2403.00934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-automated-modular-formal-verification-of-critical-software-liveness-and-completeness-thresholds-2403.00934"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-separation-logic-with-pointer-arithmetic-and-inductive-definitions-2403.01867</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-separation-logic-with-pointer-arithmetic-and-inductive-definitions-2403.01867"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-separation-logic-with-pointer-arithmetic-and-inductive-definitions-2403.01867"/></url>
<url><loc>https://scifaro.com/en/abs/unknown-biases-and-timing-constraints-in-timed-automata-2403.02210</loc><lastmod>2024-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unknown-biases-and-timing-constraints-in-timed-automata-2403.02210"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unknown-biases-and-timing-constraints-in-timed-automata-2403.02210"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-quadratic-algebra-2403.02284</loc><lastmod>2025-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-quadratic-algebra-2403.02284"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-quadratic-algebra-2403.02284"/></url>
<url><loc>https://scifaro.com/en/abs/logic-programming-with-multiplicative-structures-2403.03032</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-programming-with-multiplicative-structures-2403.03032"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-programming-with-multiplicative-structures-2403.03032"/></url>
<url><loc>https://scifaro.com/en/abs/automated-software-verification-of-hyperliveness-2403.03323</loc><lastmod>2024-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-software-verification-of-hyperliveness-2403.03323"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-software-verification-of-hyperliveness-2403.03323"/></url>
<url><loc>https://scifaro.com/en/abs/saturating-sorting-without-sorts-2403.03712</loc><lastmod>2024-03-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/saturating-sorting-without-sorts-2403.03712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/saturating-sorting-without-sorts-2403.03712"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-treatment-of-open-linear-systems-2403.03934</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-treatment-of-open-linear-systems-2403.03934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-treatment-of-open-linear-systems-2403.03934"/></url>
<url><loc>https://scifaro.com/en/abs/bridging-computational-notions-of-depth-2403.04045</loc><lastmod>2024-03-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bridging-computational-notions-of-depth-2403.04045"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bridging-computational-notions-of-depth-2403.04045"/></url>
<url><loc>https://scifaro.com/en/abs/the-interdefinability-of-expansions-of-belnap-dunn-logic-2403.04641</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interdefinability-of-expansions-of-belnap-dunn-logic-2403.04641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interdefinability-of-expansions-of-belnap-dunn-logic-2403.04641"/></url>
<url><loc>https://scifaro.com/en/abs/superposition-with-delayed-unification-2403.04775</loc><lastmod>2024-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/superposition-with-delayed-unification-2403.04775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/superposition-with-delayed-unification-2403.04775"/></url>
<url><loc>https://scifaro.com/en/abs/realizability-in-semantics-guided-synthesis-done-eagerly-2403.05607</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizability-in-semantics-guided-synthesis-done-eagerly-2403.05607"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizability-in-semantics-guided-synthesis-done-eagerly-2403.05607"/></url>
<url><loc>https://scifaro.com/en/abs/structure-aware-computing-partial-quantifier-elimination-and-sat-2403.05928</loc><lastmod>2026-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structure-aware-computing-partial-quantifier-elimination-and-sat-2403.05928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structure-aware-computing-partial-quantifier-elimination-and-sat-2403.05928"/></url>
<url><loc>https://scifaro.com/en/abs/coalgebraic-modal-logic-for-dynamic-systems-with-uncertainty-2403.06177</loc><lastmod>2024-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coalgebraic-modal-logic-for-dynamic-systems-with-uncertainty-2403.06177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coalgebraic-modal-logic-for-dynamic-systems-with-uncertainty-2403.06177"/></url>
<url><loc>https://scifaro.com/en/abs/mpbn-a-simple-tool-for-efficient-edition-and-analysis-of-elementary-properties-of-boolean-networks-2403.06255</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mpbn-a-simple-tool-for-efficient-edition-and-analysis-of-elementary-properties-of-boolean-networks-2403.06255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mpbn-a-simple-tool-for-efficient-edition-and-analysis-of-elementary-properties-of-boolean-networks-2403.06255"/></url>
<url><loc>https://scifaro.com/en/abs/multiple-reachability-in-linear-dynamical-systems-2403.06515</loc><lastmod>2025-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiple-reachability-in-linear-dynamical-systems-2403.06515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiple-reachability-in-linear-dynamical-systems-2403.06515"/></url>
<url><loc>https://scifaro.com/en/abs/local-intuitionistic-modal-logics-and-their-calculi-2403.06772</loc><lastmod>2024-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/local-intuitionistic-modal-logics-and-their-calculi-2403.06772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/local-intuitionistic-modal-logics-and-their-calculi-2403.06772"/></url>
<url><loc>https://scifaro.com/en/abs/are-targeted-messages-more-effective-2403.06817</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/are-targeted-messages-more-effective-2403.06817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/are-targeted-messages-more-effective-2403.06817"/></url>
<url><loc>https://scifaro.com/en/abs/expiring-opacity-problems-in-parametric-timed-automata-2403.07647</loc><lastmod>2024-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expiring-opacity-problems-in-parametric-timed-automata-2403.07647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expiring-opacity-problems-in-parametric-timed-automata-2403.07647"/></url>
<url><loc>https://scifaro.com/en/abs/robocertprob-property-specification-for-probabilistic-robochart-models-2403.08136</loc><lastmod>2024-03-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/robocertprob-property-specification-for-probabilistic-robochart-models-2403.08136"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/robocertprob-property-specification-for-probabilistic-robochart-models-2403.08136"/></url>
<url><loc>https://scifaro.com/en/abs/a-bargain-for-mergesorts-how-to-prove-your-mergesort-correct-and-stable-almost-for-free-2403.08173</loc><lastmod>2025-08-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bargain-for-mergesorts-how-to-prove-your-mergesort-correct-and-stable-almost-for-free-2403.08173"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bargain-for-mergesorts-how-to-prove-your-mergesort-correct-and-stable-almost-for-free-2403.08173"/></url>
<url><loc>https://scifaro.com/en/abs/timed-strategies-for-real-time-rewrite-theories-2403.08920</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timed-strategies-for-real-time-rewrite-theories-2403.08920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timed-strategies-for-real-time-rewrite-theories-2403.08920"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-logic-for-causal-consistency-2403.09297</loc><lastmod>2024-03-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-logic-for-causal-consistency-2403.09297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-logic-for-causal-consistency-2403.09297"/></url>
<url><loc>https://scifaro.com/en/abs/a-conjecture-for-atp-research-2403.10334</loc><lastmod>2024-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-conjecture-for-atp-research-2403.10334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-conjecture-for-atp-research-2403.10334"/></url>
<url><loc>https://scifaro.com/en/abs/complete-equational-theories-for-classical-and-quantum-gaussian-relations-2403.10479</loc><lastmod>2024-04-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-equational-theories-for-classical-and-quantum-gaussian-relations-2403.10479"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-equational-theories-for-classical-and-quantum-gaussian-relations-2403.10479"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-the-practice-of-logical-inferentialism-2403.10546</loc><lastmod>2024-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-the-practice-of-logical-inferentialism-2403.10546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-the-practice-of-logical-inferentialism-2403.10546"/></url>
<url><loc>https://scifaro.com/en/abs/the-interpolant-existence-problem-for-weak-k4-and-difference-logic-2403.11255</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-interpolant-existence-problem-for-weak-k4-and-difference-logic-2403.11255"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-interpolant-existence-problem-for-weak-k4-and-difference-logic-2403.11255"/></url>
<url><loc>https://scifaro.com/en/abs/answer-set-programming-for-flexible-payroll-management-2403.12823</loc><lastmod>2024-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/answer-set-programming-for-flexible-payroll-management-2403.12823"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/answer-set-programming-for-flexible-payroll-management-2403.12823"/></url>
<url><loc>https://scifaro.com/en/abs/mechanized-hol-reasoning-in-set-theory-2403.13403</loc><lastmod>2024-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mechanized-hol-reasoning-in-set-theory-2403.13403"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mechanized-hol-reasoning-in-set-theory-2403.13403"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-distributive-laws-in-a-concurrent-refinement-algebra-2403.13425</loc><lastmod>2024-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-distributive-laws-in-a-concurrent-refinement-algebra-2403.13425"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-distributive-laws-in-a-concurrent-refinement-algebra-2403.13425"/></url>
<url><loc>https://scifaro.com/en/abs/taming-differentiable-logics-with-coq-formalisation-2403.13700</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taming-differentiable-logics-with-coq-formalisation-2403.13700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taming-differentiable-logics-with-coq-formalisation-2403.13700"/></url>
<url><loc>https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-multiplication-2403.13975</loc><lastmod>2024-09-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-multiplication-2403.13975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-multiplication-2403.13975"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-the-model-checking-problem-for-inquisitive-propositional-and-modal-logic-2403.14260</loc><lastmod>2024-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-the-model-checking-problem-for-inquisitive-propositional-and-modal-logic-2403.14260"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-the-model-checking-problem-for-inquisitive-propositional-and-modal-logic-2403.14260"/></url>
<url><loc>https://scifaro.com/en/abs/fully-evaluated-left-sequential-logics-2403.14576</loc><lastmod>2026-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fully-evaluated-left-sequential-logics-2403.14576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fully-evaluated-left-sequential-logics-2403.14576"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimal-coalition-logic-2403.14704</loc><lastmod>2025-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimal-coalition-logic-2403.14704"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimal-coalition-logic-2403.14704"/></url>
<url><loc>https://scifaro.com/en/abs/pecr-a-formal-system-based-on-computability-logic-2403.14880</loc><lastmod>2024-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pecr-a-formal-system-based-on-computability-logic-2403.14880"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pecr-a-formal-system-based-on-computability-logic-2403.14880"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-statistical-probabilistic-lazy-lambda-calculus-2403.15570</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-statistical-probabilistic-lazy-lambda-calculus-2403.15570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-statistical-probabilistic-lazy-lambda-calculus-2403.15570"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verifying-the-safety-of-pipelined-moonshot-consensus-protocol-2403.16637</loc><lastmod>2024-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verifying-the-safety-of-pipelined-moonshot-consensus-protocol-2403.16637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verifying-the-safety-of-pipelined-moonshot-consensus-protocol-2403.16637"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-workshop-on-models-for-formal-analysis-of-real-systems-2403.17862</loc><lastmod>2024-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-models-for-formal-analysis-of-real-systems-2403.17862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-workshop-on-models-for-formal-analysis-of-real-systems-2403.17862"/></url>
<url><loc>https://scifaro.com/en/abs/a-comprehensive-overview-of-the-lebesgue-differentiation-theorem-in-coq-2403.18229</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comprehensive-overview-of-the-lebesgue-differentiation-theorem-in-coq-2403.18229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comprehensive-overview-of-the-lebesgue-differentiation-theorem-in-coq-2403.18229"/></url>
<url><loc>https://scifaro.com/en/abs/on-propositional-dynamic-logic-and-concurrency-2403.18508</loc><lastmod>2026-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-propositional-dynamic-logic-and-concurrency-2403.18508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-propositional-dynamic-logic-and-concurrency-2403.18508"/></url>
<url><loc>https://scifaro.com/en/abs/safety-verification-of-wait-only-non-blocking-broadcast-protocols-2403.18591</loc><lastmod>2026-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-verification-of-wait-only-non-blocking-broadcast-protocols-2403.18591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-verification-of-wait-only-non-blocking-broadcast-protocols-2403.18591"/></url>
<url><loc>https://scifaro.com/en/abs/synergistic-knowledge-2403.18646</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synergistic-knowledge-2403.18646"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synergistic-knowledge-2403.18646"/></url>
<url><loc>https://scifaro.com/en/abs/formally-modelling-the-rijkswaterstaat-tunnel-control-systems-in-a-constrained-industrial-environment-2403.18722</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-modelling-the-rijkswaterstaat-tunnel-control-systems-in-a-constrained-industrial-environment-2403.18722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-modelling-the-rijkswaterstaat-tunnel-control-systems-in-a-constrained-industrial-environment-2403.18722"/></url>
<url><loc>https://scifaro.com/en/abs/four-formal-models-of-ieee-1394-link-layer-2403.18723</loc><lastmod>2024-03-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-formal-models-of-ieee-1394-link-layer-2403.18723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-formal-models-of-ieee-1394-link-layer-2403.18723"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-the-raft-distributed-consensus-protocol-in-mcrl2-2403.18916</loc><lastmod>2024-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-the-raft-distributed-consensus-protocol-in-mcrl2-2403.18916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-the-raft-distributed-consensus-protocol-in-mcrl2-2403.18916"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-reasoning-meets-automata-in-solving-linear-integer-arithmetic-technical-report-2403.18995</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-reasoning-meets-automata-in-solving-linear-integer-arithmetic-technical-report-2403.18995"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-reasoning-meets-automata-in-solving-linear-integer-arithmetic-technical-report-2403.18995"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-boolean-separation-logic-via-small-models-technical-report-2403.18999</loc><lastmod>2024-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-boolean-separation-logic-via-small-models-technical-report-2403.18999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-boolean-separation-logic-via-small-models-technical-report-2403.18999"/></url>
<url><loc>https://scifaro.com/en/abs/logic-optimization-meets-sat-a-novel-framework-for-circuit-sat-solving-2403.19446</loc><lastmod>2025-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-optimization-meets-sat-a-novel-framework-for-circuit-sat-solving-2403.19446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-optimization-meets-sat-a-novel-framework-for-circuit-sat-solving-2403.19446"/></url>
<url><loc>https://scifaro.com/en/abs/linear-programming-in-isabelle-hol-2403.19639</loc><lastmod>2024-03-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-programming-in-isabelle-hol-2403.19639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-programming-in-isabelle-hol-2403.19639"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-specification-of-the-jq-language-2403.20132</loc><lastmod>2024-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-specification-of-the-jq-language-2403.20132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-specification-of-the-jq-language-2403.20132"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-semantic-characterisation-of-global-type-well-formedness-2404.00446</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-semantic-characterisation-of-global-type-well-formedness-2404.00446"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-semantic-characterisation-of-global-type-well-formedness-2404.00446"/></url>
<url><loc>https://scifaro.com/en/abs/correspondence-between-composite-theories-and-distributive-laws-2404.00581</loc><lastmod>2024-04-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correspondence-between-composite-theories-and-distributive-laws-2404.00581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correspondence-between-composite-theories-and-distributive-laws-2404.00581"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-proof-of-r-4-5-25-2404.01761</loc><lastmod>2024-06-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-proof-of-r-4-5-25-2404.01761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-proof-of-r-4-5-25-2404.01761"/></url>
<url><loc>https://scifaro.com/en/abs/commutative-n-polyregular-functions-2404.02232</loc><lastmod>2025-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/commutative-n-polyregular-functions-2404.02232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/commutative-n-polyregular-functions-2404.02232"/></url>
<url><loc>https://scifaro.com/en/abs/interpolant-existence-is-undecidable-for-two-variable-first-order-logic-with-two-equivalence-relations-2404.02683</loc><lastmod>2024-04-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interpolant-existence-is-undecidable-for-two-variable-first-order-logic-with-two-equivalence-relations-2404.02683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interpolant-existence-is-undecidable-for-two-variable-first-order-logic-with-two-equivalence-relations-2404.02683"/></url>
<url><loc>https://scifaro.com/en/abs/non-wellfounded-parsimonious-proofs-and-non-uniform-complexity-2404.03311</loc><lastmod>2025-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-wellfounded-parsimonious-proofs-and-non-uniform-complexity-2404.03311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-wellfounded-parsimonious-proofs-and-non-uniform-complexity-2404.03311"/></url>
<url><loc>https://scifaro.com/en/abs/alternating-quantifiers-in-uniform-one-dimensional-fragments-with-an-excursion-into-three-variable-logic-2404.03377</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/alternating-quantifiers-in-uniform-one-dimensional-fragments-with-an-excursion-into-three-variable-logic-2404.03377"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/alternating-quantifiers-in-uniform-one-dimensional-fragments-with-an-excursion-into-three-variable-logic-2404.03377"/></url>
<url><loc>https://scifaro.com/en/abs/permissible-knowledge-pooling-2404.03418</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/permissible-knowledge-pooling-2404.03418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/permissible-knowledge-pooling-2404.03418"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-probabilistic-operator-precedence-automata-2404.03515</loc><lastmod>2025-02-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-probabilistic-operator-precedence-automata-2404.03515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-probabilistic-operator-precedence-automata-2404.03515"/></url>
<url><loc>https://scifaro.com/en/abs/bringing-memory-to-boolean-networks-a-unifying-framework-2404.03553</loc><lastmod>2026-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bringing-memory-to-boolean-networks-a-unifying-framework-2404.03553"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bringing-memory-to-boolean-networks-a-unifying-framework-2404.03553"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-12th-international-workshop-on-theorem-proving-components-for-educational-software-2404.03709</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-12th-international-workshop-on-theorem-proving-components-for-educational-software-2404.03709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-12th-international-workshop-on-theorem-proving-components-for-educational-software-2404.03709"/></url>
<url><loc>https://scifaro.com/en/abs/a-reinforcement-learning-based-reset-policy-for-cdcl-sat-solvers-2404.03753</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reinforcement-learning-based-reset-policy-for-cdcl-sat-solvers-2404.03753"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reinforcement-learning-based-reset-policy-for-cdcl-sat-solvers-2404.03753"/></url>
<url><loc>https://scifaro.com/en/abs/parametricity-via-cohesion-2404.03825</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parametricity-via-cohesion-2404.03825"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parametricity-via-cohesion-2404.03825"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-automata-in-lambda-calculi-iii-affine-planar-string-to-string-functions-2404.03985</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-automata-in-lambda-calculi-iii-affine-planar-string-to-string-functions-2404.03985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-automata-in-lambda-calculi-iii-affine-planar-string-to-string-functions-2404.03985"/></url>
<url><loc>https://scifaro.com/en/abs/refutability-as-recursive-as-provability-2404.04038</loc><lastmod>2024-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refutability-as-recursive-as-provability-2404.04038"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refutability-as-recursive-as-provability-2404.04038"/></url>
<url><loc>https://scifaro.com/en/abs/counting-like-transformers-compiling-temporal-counting-logic-into-softmax-transformers-2404.04393</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counting-like-transformers-compiling-temporal-counting-logic-into-softmax-transformers-2404.04393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counting-like-transformers-compiling-temporal-counting-logic-into-softmax-transformers-2404.04393"/></url>
<url><loc>https://scifaro.com/en/abs/the-church-synthesis-problem-over-continuous-time-2404.04782</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-church-synthesis-problem-over-continuous-time-2404.04782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-church-synthesis-problem-over-continuous-time-2404.04782"/></url>
<url><loc>https://scifaro.com/en/abs/gatlab-modeling-and-programming-with-generalized-algebraic-theories-2404.04837</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gatlab-modeling-and-programming-with-generalized-algebraic-theories-2404.04837"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gatlab-modeling-and-programming-with-generalized-algebraic-theories-2404.04837"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-weakest-hyper-pre-unifying-correctness-and-incorrectness-hyperproperties-via-predicate-transformers-2404.05097</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-weakest-hyper-pre-unifying-correctness-and-incorrectness-hyperproperties-via-predicate-transformers-2404.05097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-weakest-hyper-pre-unifying-correctness-and-incorrectness-hyperproperties-via-predicate-transformers-2404.05097"/></url>
<url><loc>https://scifaro.com/en/abs/function-spaces-for-orbit-finite-sets-2404.05265</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/function-spaces-for-orbit-finite-sets-2404.05265"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/function-spaces-for-orbit-finite-sets-2404.05265"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-normalization-for-the-planar-lambda-calculus-2404.05276</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-normalization-for-the-planar-lambda-calculus-2404.05276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-normalization-for-the-planar-lambda-calculus-2404.05276"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-higher-order-logic-using-isabelle-2404.05458</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-higher-order-logic-using-isabelle-2404.05458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-higher-order-logic-using-isabelle-2404.05458"/></url>
<url><loc>https://scifaro.com/en/abs/linear-contextual-metaprogramming-and-session-types-2404.05475</loc><lastmod>2024-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-contextual-metaprogramming-and-session-types-2404.05475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-contextual-metaprogramming-and-session-types-2404.05475"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-ranking-function-based-termination-analysis-with-bi-directional-feedback-2404.05951</loc><lastmod>2025-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-ranking-function-based-termination-analysis-with-bi-directional-feedback-2404.05951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-ranking-function-based-termination-analysis-with-bi-directional-feedback-2404.05951"/></url>
<url><loc>https://scifaro.com/en/abs/weak-simplicial-bisimilarity-for-polyhedral-models-and-slcs-eta-extended-version-2404.06131</loc><lastmod>2024-04-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-simplicial-bisimilarity-for-polyhedral-models-and-slcs-eta-extended-version-2404.06131"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-simplicial-bisimilarity-for-polyhedral-models-and-slcs-eta-extended-version-2404.06131"/></url>
<url><loc>https://scifaro.com/en/abs/a-semantic-proof-of-generalised-cut-elimination-for-deep-inference-2404.06233</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-semantic-proof-of-generalised-cut-elimination-for-deep-inference-2404.06233"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-semantic-proof-of-generalised-cut-elimination-for-deep-inference-2404.06233"/></url>
<url><loc>https://scifaro.com/en/abs/meaningfulness-and-genericity-in-a-subsuming-framework-2404.06361</loc><lastmod>2024-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/meaningfulness-and-genericity-in-a-subsuming-framework-2404.06361"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/meaningfulness-and-genericity-in-a-subsuming-framework-2404.06361"/></url>
<url><loc>https://scifaro.com/en/abs/reflexive-graph-lenses-in-univalent-foundations-2404.07854</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reflexive-graph-lenses-in-univalent-foundations-2404.07854"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reflexive-graph-lenses-in-univalent-foundations-2404.07854"/></url>
<url><loc>https://scifaro.com/en/abs/composing-codensity-bisimulations-2404.08308</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/composing-codensity-bisimulations-2404.08308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/composing-codensity-bisimulations-2404.08308"/></url>
<url><loc>https://scifaro.com/en/abs/almost-sure-termination-by-guarded-refinement-2404.08494</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/almost-sure-termination-by-guarded-refinement-2404.08494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/almost-sure-termination-by-guarded-refinement-2404.08494"/></url>
<url><loc>https://scifaro.com/en/abs/computable-domains-of-a-halting-function-2404.09484</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-domains-of-a-halting-function-2404.09484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-domains-of-a-halting-function-2404.09484"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-second-order-hyperproperties-2404.09652</loc><lastmod>2024-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-second-order-hyperproperties-2404.09652"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-second-order-hyperproperties-2404.09652"/></url>
<url><loc>https://scifaro.com/en/abs/complete-game-logic-with-sabotage-2404.09873</loc><lastmod>2024-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-game-logic-with-sabotage-2404.09873"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-game-logic-with-sabotage-2404.09873"/></url>
<url><loc>https://scifaro.com/en/abs/one-is-all-you-need-second-order-unification-without-first-order-variables-2404.10616</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-is-all-you-need-second-order-unification-without-first-order-variables-2404.10616"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-is-all-you-need-second-order-unification-without-first-order-variables-2404.10616"/></url>
<url><loc>https://scifaro.com/en/abs/on-homomorphism-indistinguishability-and-hypertree-depth-2404.10637</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-homomorphism-indistinguishability-and-hypertree-depth-2404.10637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-homomorphism-indistinguishability-and-hypertree-depth-2404.10637"/></url>
<url><loc>https://scifaro.com/en/abs/the-general-and-finite-satisfiability-problems-for-pctl-are-undecidable-2404.10648</loc><lastmod>2024-04-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-general-and-finite-satisfiability-problems-for-pctl-are-undecidable-2404.10648"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-general-and-finite-satisfiability-problems-for-pctl-are-undecidable-2404.10648"/></url>
<url><loc>https://scifaro.com/en/abs/multi-modalities-and-non-commutativity-associativity-in-functorial-linear-logic-a-case-study-2404.11445</loc><lastmod>2024-04-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multi-modalities-and-non-commutativity-associativity-in-functorial-linear-logic-a-case-study-2404.11445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multi-modalities-and-non-commutativity-associativity-in-functorial-linear-logic-a-case-study-2404.11445"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-unprovability-of-circuit-size-bounds-in-intuitionistic-mathsf-s-1-2-2404.11841</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-unprovability-of-circuit-size-bounds-in-intuitionistic-mathsf-s-1-2-2404.11841"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-unprovability-of-circuit-size-bounds-in-intuitionistic-mathsf-s-1-2-2404.11841"/></url>
<url><loc>https://scifaro.com/en/abs/symbolic-computation-for-all-the-fun-2404.12048</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symbolic-computation-for-all-the-fun-2404.12048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symbolic-computation-for-all-the-fun-2404.12048"/></url>
<url><loc>https://scifaro.com/en/abs/a-minimal-base-or-a-direct-base-that-is-the-question-2404.12229</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-minimal-base-or-a-direct-base-that-is-the-question-2404.12229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-minimal-base-or-a-direct-base-that-is-the-question-2404.12229"/></url>
<url><loc>https://scifaro.com/en/abs/teaching-divisibility-and-binomials-with-coq-2404.12676</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/teaching-divisibility-and-binomials-with-coq-2404.12676"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/teaching-divisibility-and-binomials-with-coq-2404.12676"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-weighted-first-order-model-counting-in-the-two-variable-fragment-with-counting-quantifiers-a-bound-to-beat-2404.12905</loc><lastmod>2024-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-weighted-first-order-model-counting-in-the-two-variable-fragment-with-counting-quantifiers-a-bound-to-beat-2404.12905"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-weighted-first-order-model-counting-in-the-two-variable-fragment-with-counting-quantifiers-a-bound-to-beat-2404.12905"/></url>
<url><loc>https://scifaro.com/en/abs/the-benefits-of-diligence-2404.12951</loc><lastmod>2024-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-benefits-of-diligence-2404.12951"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-benefits-of-diligence-2404.12951"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-quantitative-axiomatisation-of-behavioural-distance-of-regular-expressions-2404.13352</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-quantitative-axiomatisation-of-behavioural-distance-of-regular-expressions-2404.13352"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-quantitative-axiomatisation-of-behavioural-distance-of-regular-expressions-2404.13352"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-logical-and-semantic-frameworks-with-applications-and-10th-workshop-on-horn-clauses-for-verification-and-synthesis-2404.13672</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-logical-and-semantic-frameworks-with-applications-and-10th-workshop-on-horn-clauses-for-verification-and-synthesis-2404.13672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-logical-and-semantic-frameworks-with-applications-and-10th-workshop-on-horn-clauses-for-verification-and-synthesis-2404.13672"/></url>
<url><loc>https://scifaro.com/en/abs/the-characterization-of-abstract-truth-and-its-factorization-2404.13782</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-characterization-of-abstract-truth-and-its-factorization-2404.13782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-characterization-of-abstract-truth-and-its-factorization-2404.13782"/></url>
<url><loc>https://scifaro.com/en/abs/error-credits-resourceful-reasoning-about-error-bounds-for-higher-order-probabilistic-programs-2404.14223</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/error-credits-resourceful-reasoning-about-error-bounds-for-higher-order-probabilistic-programs-2404.14223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/error-credits-resourceful-reasoning-about-error-bounds-for-higher-order-probabilistic-programs-2404.14223"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-intersection-types-for-pcf-extended-version-2404.14340</loc><lastmod>2024-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-intersection-types-for-pcf-extended-version-2404.14340"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-intersection-types-for-pcf-extended-version-2404.14340"/></url>
<url><loc>https://scifaro.com/en/abs/truth-factors-2404.14470</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/truth-factors-2404.14470"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/truth-factors-2404.14470"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-for-prefix-first-order-logic-on-data-words-2404.14517</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-for-prefix-first-order-logic-on-data-words-2404.14517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-for-prefix-first-order-logic-on-data-words-2404.14517"/></url>
<url><loc>https://scifaro.com/en/abs/improved-algorithm-for-reachability-in-d-vass-2404.14781</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/improved-algorithm-for-reachability-in-d-vass-2404.14781"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/improved-algorithm-for-reachability-in-d-vass-2404.14781"/></url>
<url><loc>https://scifaro.com/en/abs/stalnaker-s-epistemic-logic-in-isabelle-hol-2404.14919</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stalnaker-s-epistemic-logic-in-isabelle-hol-2404.14919"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stalnaker-s-epistemic-logic-in-isabelle-hol-2404.14919"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-factorization-on-euclidean-domains-and-abstract-euclidean-algorithms-2404.14920</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-factorization-on-euclidean-domains-and-abstract-euclidean-algorithms-2404.14920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-factorization-on-euclidean-domains-and-abstract-euclidean-algorithms-2404.14920"/></url>
<url><loc>https://scifaro.com/en/abs/more-church-rosser-proofs-in-beluga-2404.14921</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/more-church-rosser-proofs-in-beluga-2404.14921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/more-church-rosser-proofs-in-beluga-2404.14921"/></url>
<url><loc>https://scifaro.com/en/abs/semi-substructural-logics-with-additives-2404.14922</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semi-substructural-logics-with-additives-2404.14922"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semi-substructural-logics-with-additives-2404.14922"/></url>
<url><loc>https://scifaro.com/en/abs/chc-comp-2023-competition-report-2404.14923</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chc-comp-2023-competition-report-2404.14923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chc-comp-2023-competition-report-2404.14923"/></url>
<url><loc>https://scifaro.com/en/abs/an-encoding-for-clp-problems-in-smt-lib-2404.14924</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-encoding-for-clp-problems-in-smt-lib-2404.14924"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-encoding-for-clp-problems-in-smt-lib-2404.14924"/></url>
<url><loc>https://scifaro.com/en/abs/embedding-differential-dynamic-logic-in-pvs-2404.15214</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/embedding-differential-dynamic-logic-in-pvs-2404.15214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/embedding-differential-dynamic-logic-in-pvs-2404.15214"/></url>
<url><loc>https://scifaro.com/en/abs/bottoms-up-for-chcs-novel-transformation-of-linear-constrained-horn-clauses-to-software-verification-2404.15215</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bottoms-up-for-chcs-novel-transformation-of-linear-constrained-horn-clauses-to-software-verification-2404.15215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bottoms-up-for-chcs-novel-transformation-of-linear-constrained-horn-clauses-to-software-verification-2404.15215"/></url>
<url><loc>https://scifaro.com/en/abs/the-architecture-of-truth-2404.15221</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-architecture-of-truth-2404.15221"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-architecture-of-truth-2404.15221"/></url>
<url><loc>https://scifaro.com/en/abs/a-dependency-pair-framework-for-relative-termination-of-term-rewriting-2404.15248</loc><lastmod>2024-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dependency-pair-framework-for-relative-termination-of-term-rewriting-2404.15248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dependency-pair-framework-for-relative-termination-of-term-rewriting-2404.15248"/></url>
<url><loc>https://scifaro.com/en/abs/lov-asz-theorems-for-modal-languages-2404.15421</loc><lastmod>2025-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lov-asz-theorems-for-modal-languages-2404.15421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lov-asz-theorems-for-modal-languages-2404.15421"/></url>
<url><loc>https://scifaro.com/en/abs/polimon-checking-temporal-properties-over-out-of-order-streams-at-runtime-2404.15723</loc><lastmod>2024-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polimon-checking-temporal-properties-over-out-of-order-streams-at-runtime-2404.15723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polimon-checking-temporal-properties-over-out-of-order-streams-at-runtime-2404.15723"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-interpolation-and-concept-based-beth-definability-for-description-logics-via-sequents-2404.15840</loc><lastmod>2024-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-interpolation-and-concept-based-beth-definability-for-description-logics-via-sequents-2404.15840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-interpolation-and-concept-based-beth-definability-for-description-logics-via-sequents-2404.15840"/></url>
<url><loc>https://scifaro.com/en/abs/taking-bi-intuitionistic-logic-first-order-a-proof-theoretic-investigation-via-polytree-sequents-2404.15855</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/taking-bi-intuitionistic-logic-first-order-a-proof-theoretic-investigation-via-polytree-sequents-2404.15855"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/taking-bi-intuitionistic-logic-first-order-a-proof-theoretic-investigation-via-polytree-sequents-2404.15855"/></url>
<url><loc>https://scifaro.com/en/abs/implications-of-computer-science-theory-for-the-simulation-hypothesis-2404.16050</loc><lastmod>2026-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implications-of-computer-science-theory-for-the-simulation-hypothesis-2404.16050"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implications-of-computer-science-theory-for-the-simulation-hypothesis-2404.16050"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-many-valued-logic-systems-in-theoretical-economics-2404.16061</loc><lastmod>2024-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-many-valued-logic-systems-in-theoretical-economics-2404.16061"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-many-valued-logic-systems-in-theoretical-economics-2404.16061"/></url>
<url><loc>https://scifaro.com/en/abs/forcing-transition-algebras-and-calculi-2404.16111</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forcing-transition-algebras-and-calculi-2404.16111"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forcing-transition-algebras-and-calculi-2404.16111"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-optimization-modulo-theories-2404.16122</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-optimization-modulo-theories-2404.16122"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-optimization-modulo-theories-2404.16122"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theory-of-omega-context-free-languages-via-non-wellfounded-proofs-2404.16231</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theory-of-omega-context-free-languages-via-non-wellfounded-proofs-2404.16231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theory-of-omega-context-free-languages-via-non-wellfounded-proofs-2404.16231"/></url>
<url><loc>https://scifaro.com/en/abs/murelbench-microbenchmarks-for-zonotope-domains-2404.16243</loc><lastmod>2025-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/murelbench-microbenchmarks-for-zonotope-domains-2404.16243"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/murelbench-microbenchmarks-for-zonotope-domains-2404.16243"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-restarts-of-cdcl-should-the-search-information-be-preserved-2404.16387</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-restarts-of-cdcl-should-the-search-information-be-preserved-2404.16387"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-restarts-of-cdcl-should-the-search-information-be-preserved-2404.16387"/></url>
<url><loc>https://scifaro.com/en/abs/regular-typed-unification-2404.16406</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-typed-unification-2404.16406"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-typed-unification-2404.16406"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-decision-diagrams-modulo-theories-2404.16455</loc><lastmod>2025-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-decision-diagrams-modulo-theories-2404.16455"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-decision-diagrams-modulo-theories-2404.16455"/></url>
<url><loc>https://scifaro.com/en/abs/proving-behavioural-apartness-2404.16588</loc><lastmod>2024-04-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-behavioural-apartness-2404.16588"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-behavioural-apartness-2404.16588"/></url>
<url><loc>https://scifaro.com/en/abs/derandomization-with-pseudorandomness-2404.16614</loc><lastmod>2025-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derandomization-with-pseudorandomness-2404.16614"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derandomization-with-pseudorandomness-2404.16614"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-substitution-for-differential-refinement-logic-2404.16734</loc><lastmod>2024-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-substitution-for-differential-refinement-logic-2404.16734"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-substitution-for-differential-refinement-logic-2404.16734"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-asynchronous-logics-for-hyperproperties-2404.16778</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-asynchronous-logics-for-hyperproperties-2404.16778"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-asynchronous-logics-for-hyperproperties-2404.16778"/></url>
<url><loc>https://scifaro.com/en/abs/delam-a-dependent-layered-modal-type-theory-for-meta-programming-2404.17065</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delam-a-dependent-layered-modal-type-theory-for-meta-programming-2404.17065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delam-a-dependent-layered-modal-type-theory-for-meta-programming-2404.17065"/></url>
<url><loc>https://scifaro.com/en/abs/tiup-effective-processor-verification-with-tautology-induced-universal-properties-2404.17094</loc><lastmod>2024-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tiup-effective-processor-verification-with-tautology-induced-universal-properties-2404.17094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tiup-effective-processor-verification-with-tautology-induced-universal-properties-2404.17094"/></url>
<url><loc>https://scifaro.com/en/abs/automata-theoretic-characterisations-of-branching-time-temporal-logics-2404.17421</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-theoretic-characterisations-of-branching-time-temporal-logics-2404.17421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-theoretic-characterisations-of-branching-time-temporal-logics-2404.17421"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-reactive-synthesis-2404.17834</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-reactive-synthesis-2404.17834"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-reactive-synthesis-2404.17834"/></url>
<url><loc>https://scifaro.com/en/abs/practical-deductive-verification-of-ocaml-programs-extended-version-2404.17901</loc><lastmod>2024-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-deductive-verification-of-ocaml-programs-extended-version-2404.17901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-deductive-verification-of-ocaml-programs-extended-version-2404.17901"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-model-to-prove-instantiation-termination-for-e-matching-based-axiomatisations-extended-version-2404.18007</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-model-to-prove-instantiation-termination-for-e-matching-based-axiomatisations-extended-version-2404.18007"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-model-to-prove-instantiation-termination-for-e-matching-based-axiomatisations-extended-version-2404.18007"/></url>
<url><loc>https://scifaro.com/en/abs/type-inference-for-isabelle2cpp-2404.18067</loc><lastmod>2024-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/type-inference-for-isabelle2cpp-2404.18067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/type-inference-for-isabelle2cpp-2404.18067"/></url>
<url><loc>https://scifaro.com/en/abs/parameterized-dynamic-logic-towards-a-cyclic-logical-framework-for-general-program-specification-and-verification-2404.18098</loc><lastmod>2025-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterized-dynamic-logic-towards-a-cyclic-logical-framework-for-general-program-specification-and-verification-2404.18098"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterized-dynamic-logic-towards-a-cyclic-logical-framework-for-general-program-specification-and-verification-2404.18098"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-graph-neural-networks-via-logical-characterizations-2404.18151</loc><lastmod>2025-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-graph-neural-networks-via-logical-characterizations-2404.18151"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-graph-neural-networks-via-logical-characterizations-2404.18151"/></url>
<url><loc>https://scifaro.com/en/abs/lego-like-small-model-constructions-for-aa-qvist-s-logics-2404.18205</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lego-like-small-model-constructions-for-aa-qvist-s-logics-2404.18205"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lego-like-small-model-constructions-for-aa-qvist-s-logics-2404.18205"/></url>
<url><loc>https://scifaro.com/en/abs/tracy-traces-and-transducers-computable-counterexamples-and-explanations-for-hyperltl-model-checking-2404.18280</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tracy-traces-and-transducers-computable-counterexamples-and-explanations-for-hyperltl-model-checking-2404.18280"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tracy-traces-and-transducers-computable-counterexamples-and-explanations-for-hyperltl-model-checking-2404.18280"/></url>
<url><loc>https://scifaro.com/en/abs/useful-evaluation-syntax-and-semantics-technical-report-2404.18874</loc><lastmod>2025-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/useful-evaluation-syntax-and-semantics-technical-report-2404.18874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/useful-evaluation-syntax-and-semantics-technical-report-2404.18874"/></url>
<url><loc>https://scifaro.com/en/abs/kuroda-s-translation-for-higher-order-logic-2404.19503</loc><lastmod>2026-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kuroda-s-translation-for-higher-order-logic-2404.19503"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kuroda-s-translation-for-higher-order-logic-2404.19503"/></url>
<url><loc>https://scifaro.com/en/abs/trac-a-tool-for-data-aware-coordination-with-an-application-to-smart-contracts-2404.19523</loc><lastmod>2024-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trac-a-tool-for-data-aware-coordination-with-an-application-to-smart-contracts-2404.19523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trac-a-tool-for-data-aware-coordination-with-an-application-to-smart-contracts-2404.19523"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-metrics-compositionality-of-the-kantorovich-lifting-and-an-application-to-up-to-techniques-2404.19632</loc><lastmod>2024-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-metrics-compositionality-of-the-kantorovich-lifting-and-an-application-to-up-to-techniques-2404.19632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-metrics-compositionality-of-the-kantorovich-lifting-and-an-application-to-up-to-techniques-2404.19632"/></url>
<url><loc>https://scifaro.com/en/abs/sound-and-complete-proof-rules-for-probabilistic-termination-2404.19724</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-and-complete-proof-rules-for-probabilistic-termination-2404.19724"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-and-complete-proof-rules-for-probabilistic-termination-2404.19724"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-approach-to-coalgebraic-fixpoint-logic-2405.00237</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-approach-to-coalgebraic-fixpoint-logic-2405.00237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-approach-to-coalgebraic-fixpoint-logic-2405.00237"/></url>
<url><loc>https://scifaro.com/en/abs/intersection-types-via-finite-set-declarations-2405.00440</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intersection-types-via-finite-set-declarations-2405.00440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intersection-types-via-finite-set-declarations-2405.00440"/></url>
<url><loc>https://scifaro.com/en/abs/better-bounded-bisimulation-contractions-preprint-2405.00480</loc><lastmod>2024-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/better-bounded-bisimulation-contractions-preprint-2405.00480"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/better-bounded-bisimulation-contractions-preprint-2405.00480"/></url>
<url><loc>https://scifaro.com/en/abs/about-enveloping-algebras-of-direct-sums-2405.01092</loc><lastmod>2024-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/about-enveloping-algebras-of-direct-sums-2405.01092"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/about-enveloping-algebras-of-direct-sums-2405.01092"/></url>
<url><loc>https://scifaro.com/en/abs/equational-theories-and-validity-for-logically-constrained-term-rewriting-full-version-2405.01174</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-theories-and-validity-for-logically-constrained-term-rewriting-full-version-2405.01174"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-theories-and-validity-for-logically-constrained-term-rewriting-full-version-2405.01174"/></url>
<url><loc>https://scifaro.com/en/abs/an-efficient-quantifier-elimination-procedure-for-presburger-arithmetic-2405.01183</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-efficient-quantifier-elimination-procedure-for-presburger-arithmetic-2405.01183"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-efficient-quantifier-elimination-procedure-for-presburger-arithmetic-2405.01183"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-group-polarization-from-semantic-games-to-sequent-systems-2405.01322</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-group-polarization-from-semantic-games-to-sequent-systems-2405.01322"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-group-polarization-from-semantic-games-to-sequent-systems-2405.01322"/></url>
<url><loc>https://scifaro.com/en/abs/skolemisation-for-intuitionistic-linear-logic-2405.01375</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolemisation-for-intuitionistic-linear-logic-2405.01375"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolemisation-for-intuitionistic-linear-logic-2405.01375"/></url>
<url><loc>https://scifaro.com/en/abs/combining-combination-properties-minimal-models-2405.01478</loc><lastmod>2024-05-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/combining-combination-properties-minimal-models-2405.01478"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/combining-combination-properties-minimal-models-2405.01478"/></url>
<url><loc>https://scifaro.com/en/abs/clones-closed-categories-and-combinatory-logic-2405.01675</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/clones-closed-categories-and-combinatory-logic-2405.01675"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/clones-closed-categories-and-combinatory-logic-2405.01675"/></url>
<url><loc>https://scifaro.com/en/abs/rings-with-common-division-common-meadows-and-their-conditional-equational-theories-2405.01733</loc><lastmod>2024-12-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rings-with-common-division-common-meadows-and-their-conditional-equational-theories-2405.01733"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rings-with-common-division-common-meadows-and-their-conditional-equational-theories-2405.01733"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-pick-s-theorem-in-isabelle-hol-2405.01793</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-pick-s-theorem-in-isabelle-hol-2405.01793"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-pick-s-theorem-in-isabelle-hol-2405.01793"/></url>
<url><loc>https://scifaro.com/en/abs/cut-elimination-for-cyclic-proofs-a-case-study-in-temporal-logic-2405.01935</loc><lastmod>2025-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cut-elimination-for-cyclic-proofs-a-case-study-in-temporal-logic-2405.01935"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cut-elimination-for-cyclic-proofs-a-case-study-in-temporal-logic-2405.01935"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-quantum-hoare-logic-2405.01940</loc><lastmod>2024-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-quantum-hoare-logic-2405.01940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-quantum-hoare-logic-2405.01940"/></url>
<url><loc>https://scifaro.com/en/abs/inductive-reasoning-with-equality-predicates-contextual-rewriting-and-variant-based-simplification-2405.02420</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inductive-reasoning-with-equality-predicates-contextual-rewriting-and-variant-based-simplification-2405.02420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inductive-reasoning-with-equality-predicates-contextual-rewriting-and-variant-based-simplification-2405.02420"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-sql-queries-using-theories-of-tables-and-relations-2405.03057</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-sql-queries-using-theories-of-tables-and-relations-2405.03057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-sql-queries-using-theories-of-tables-and-relations-2405.03057"/></url>
<url><loc>https://scifaro.com/en/abs/delooping-presented-groups-in-homotopy-type-theory-2405.03264</loc><lastmod>2026-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delooping-presented-groups-in-homotopy-type-theory-2405.03264"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delooping-presented-groups-in-homotopy-type-theory-2405.03264"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-in-completeness-of-destructive-equality-resolution-in-the-superposition-calculus-2405.03367</loc><lastmod>2024-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-in-completeness-of-destructive-equality-resolution-in-the-superposition-calculus-2405.03367"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-in-completeness-of-destructive-equality-resolution-in-the-superposition-calculus-2405.03367"/></url>
<url><loc>https://scifaro.com/en/abs/extensional-and-non-extensional-functions-as-processes-2405.03536</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extensional-and-non-extensional-functions-as-processes-2405.03536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extensional-and-non-extensional-functions-as-processes-2405.03536"/></url>
<url><loc>https://scifaro.com/en/abs/imell-cut-elimination-with-linear-overhead-2405.03669</loc><lastmod>2024-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/imell-cut-elimination-with-linear-overhead-2405.03669"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/imell-cut-elimination-with-linear-overhead-2405.03669"/></url>
<url><loc>https://scifaro.com/en/abs/two-dimensional-kripke-semantics-i-presheaves-2405.04157</loc><lastmod>2024-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-dimensional-kripke-semantics-i-presheaves-2405.04157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-dimensional-kripke-semantics-i-presheaves-2405.04157"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-approximate-exclusion-2405.04998</loc><lastmod>2024-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-approximate-exclusion-2405.04998"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-approximate-exclusion-2405.04998"/></url>
<url><loc>https://scifaro.com/en/abs/data-reification-in-a-concurrent-rely-guarantee-algebra-2405.05546</loc><lastmod>2024-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-reification-in-a-concurrent-rely-guarantee-algebra-2405.05546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-reification-in-a-concurrent-rely-guarantee-algebra-2405.05546"/></url>
<url><loc>https://scifaro.com/en/abs/between-proof-construction-and-sat-solving-2405.05670</loc><lastmod>2024-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/between-proof-construction-and-sat-solving-2405.05670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/between-proof-construction-and-sat-solving-2405.05670"/></url>
<url><loc>https://scifaro.com/en/abs/restructuring-a-concurrent-refinement-algebra-2405.05690</loc><lastmod>2024-05-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/restructuring-a-concurrent-refinement-algebra-2405.05690"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/restructuring-a-concurrent-refinement-algebra-2405.05690"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-synthesizing-lowest-cost-rewrite-rules-for-instruction-selection-2405.06127</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-synthesizing-lowest-cost-rewrite-rules-for-instruction-selection-2405.06127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-synthesizing-lowest-cost-rewrite-rules-for-instruction-selection-2405.06127"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-an-inferentialist-approach-to-resource-semantics-2405.06491</loc><lastmod>2024-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-an-inferentialist-approach-to-resource-semantics-2405.06491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-an-inferentialist-approach-to-resource-semantics-2405.06491"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-extended-version-2405.06664</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-extended-version-2405.06664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-account-of-composition-methods-in-logic-extended-version-2405.06664"/></url>
<url><loc>https://scifaro.com/en/abs/tlinet-differentiable-neural-network-temporal-logic-inference-2405.06670</loc><lastmod>2024-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tlinet-differentiable-neural-network-temporal-logic-inference-2405.06670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tlinet-differentiable-neural-network-temporal-logic-inference-2405.06670"/></url>
<url><loc>https://scifaro.com/en/abs/a-cyclic-proof-system-for-guarded-kleene-algebra-with-tests-full-version-2405.07505</loc><lastmod>2024-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cyclic-proof-system-for-guarded-kleene-algebra-with-tests-full-version-2405.07505"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cyclic-proof-system-for-guarded-kleene-algebra-with-tests-full-version-2405.07505"/></url>
<url><loc>https://scifaro.com/en/abs/non-rigid-designators-in-modal-and-temporal-free-description-logics-extended-version-2405.07656</loc><lastmod>2024-09-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-rigid-designators-in-modal-and-temporal-free-description-logics-extended-version-2405.07656"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-rigid-designators-in-modal-and-temporal-free-description-logics-extended-version-2405.07656"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-synthesis-of-symbolic-distributed-protocols-by-sketching-2405.07807</loc><lastmod>2024-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-synthesis-of-symbolic-distributed-protocols-by-sketching-2405.07807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-synthesis-of-symbolic-distributed-protocols-by-sketching-2405.07807"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-of-monadic-theories-of-arithmetic-predicates-2405.07953</loc><lastmod>2026-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-of-monadic-theories-of-arithmetic-predicates-2405.07953"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-of-monadic-theories-of-arithmetic-predicates-2405.07953"/></url>
<url><loc>https://scifaro.com/en/abs/separation-and-encodability-in-mixed-choice-multiparty-sessions-technical-report-2405.08104</loc><lastmod>2024-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-and-encodability-in-mixed-choice-multiparty-sessions-technical-report-2405.08104"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-and-encodability-in-mixed-choice-multiparty-sessions-technical-report-2405.08104"/></url>
<url><loc>https://scifaro.com/en/abs/output-decomposed-learning-of-mealy-machines-2405.08647</loc><lastmod>2024-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/output-decomposed-learning-of-mealy-machines-2405.08647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/output-decomposed-learning-of-mealy-machines-2405.08647"/></url>
<url><loc>https://scifaro.com/en/abs/localized-attractor-computations-for-infinite-state-games-full-version-2405.09281</loc><lastmod>2024-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localized-attractor-computations-for-infinite-state-games-full-version-2405.09281"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localized-attractor-computations-for-infinite-state-games-full-version-2405.09281"/></url>
<url><loc>https://scifaro.com/en/abs/initial-algebras-unchained-a-novel-initial-algebra-construction-formalized-in-agda-2405.09504</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-algebras-unchained-a-novel-initial-algebra-construction-formalized-in-agda-2405.09504"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-algebras-unchained-a-novel-initial-algebra-construction-formalized-in-agda-2405.09504"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-logical-structure-of-some-maximality-and-well-foundedness-principles-equivalent-to-choice-principles-2405.09946</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-logical-structure-of-some-maximality-and-well-foundedness-principles-equivalent-to-choice-principles-2405.09946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-logical-structure-of-some-maximality-and-well-foundedness-principles-equivalent-to-choice-principles-2405.09946"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-of-quasi-dense-modal-logics-2405.10094</loc><lastmod>2024-06-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-of-quasi-dense-modal-logics-2405.10094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-of-quasi-dense-modal-logics-2405.10094"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-value-iteration-with-pareto-caching-2405.10099</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-value-iteration-with-pareto-caching-2405.10099"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-value-iteration-with-pareto-caching-2405.10099"/></url>
<url><loc>https://scifaro.com/en/abs/delooping-cyclic-groups-with-lens-spaces-in-homotopy-type-theory-2405.10149</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delooping-cyclic-groups-with-lens-spaces-in-homotopy-type-theory-2405.10149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delooping-cyclic-groups-with-lens-spaces-in-homotopy-type-theory-2405.10149"/></url>
<url><loc>https://scifaro.com/en/abs/braids-twists-trace-and-duality-in-combinatory-algebras-2405.10152</loc><lastmod>2024-05-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/braids-twists-trace-and-duality-in-combinatory-algebras-2405.10152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/braids-twists-trace-and-duality-in-combinatory-algebras-2405.10152"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-implementation-of-an-abstract-domain-of-quantified-first-order-formulas-2405.10308</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-implementation-of-an-abstract-domain-of-quantified-first-order-formulas-2405.10308"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-implementation-of-an-abstract-domain-of-quantified-first-order-formulas-2405.10308"/></url>
<url><loc>https://scifaro.com/en/abs/a-certified-proof-checker-for-deep-neural-network-verification-in-imandra-2405.10611</loc><lastmod>2025-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-certified-proof-checker-for-deep-neural-network-verification-in-imandra-2405.10611"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-certified-proof-checker-for-deep-neural-network-verification-in-imandra-2405.10611"/></url>
<url><loc>https://scifaro.com/en/abs/preservation-theorems-on-sparse-classes-revisited-2405.10887</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/preservation-theorems-on-sparse-classes-revisited-2405.10887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/preservation-theorems-on-sparse-classes-revisited-2405.10887"/></url>
<url><loc>https://scifaro.com/en/abs/labelled-well-quasi-ordered-classes-of-bounded-linear-clique-width-2405.10894</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/labelled-well-quasi-ordered-classes-of-bounded-linear-clique-width-2405.10894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/labelled-well-quasi-ordered-classes-of-bounded-linear-clique-width-2405.10894"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-temporal-causality-2405.10912</loc><lastmod>2025-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-temporal-causality-2405.10912"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-temporal-causality-2405.10912"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-and-conditional-independence-in-atomic-sheaf-logic-2405.11073</loc><lastmod>2026-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-and-conditional-independence-in-atomic-sheaf-logic-2405.11073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-and-conditional-independence-in-atomic-sheaf-logic-2405.11073"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-and-complexity-of-decision-problems-for-affine-continuous-vass-2405.11085</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-and-complexity-of-decision-problems-for-affine-continuous-vass-2405.11085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-and-complexity-of-decision-problems-for-affine-continuous-vass-2405.11085"/></url>
<url><loc>https://scifaro.com/en/abs/concurrent-games-over-relational-structures-the-origin-of-game-comonads-2405.11267</loc><lastmod>2025-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concurrent-games-over-relational-structures-the-origin-of-game-comonads-2405.11267"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concurrent-games-over-relational-structures-the-origin-of-game-comonads-2405.11267"/></url>
<url><loc>https://scifaro.com/en/abs/smt-based-symbolic-model-checking-for-operator-precedence-languages-2405.11327</loc><lastmod>2024-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-based-symbolic-model-checking-for-operator-precedence-languages-2405.11327"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-based-symbolic-model-checking-for-operator-precedence-languages-2405.11327"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-two-fragments-of-a-logic-for-conditional-strategic-reasoning-2405.11418</loc><lastmod>2025-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-two-fragments-of-a-logic-for-conditional-strategic-reasoning-2405.11418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-two-fragments-of-a-logic-for-conditional-strategic-reasoning-2405.11418"/></url>
<url><loc>https://scifaro.com/en/abs/inferring-message-flows-from-system-communication-traces-2405.12426</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inferring-message-flows-from-system-communication-traces-2405.12426"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inferring-message-flows-from-system-communication-traces-2405.12426"/></url>
<url><loc>https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-1-2405.12551</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-1-2405.12551"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-1-2405.12551"/></url>
<url><loc>https://scifaro.com/en/abs/getting-wiser-from-multiple-data-probabilistic-updating-according-to-jeffrey-and-pearl-2405.12700</loc><lastmod>2024-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/getting-wiser-from-multiple-data-probabilistic-updating-according-to-jeffrey-and-pearl-2405.12700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/getting-wiser-from-multiple-data-probabilistic-updating-according-to-jeffrey-and-pearl-2405.12700"/></url>
<url><loc>https://scifaro.com/en/abs/centralized-vs-decentralized-monitors-for-hyperproperties-2405.12882</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/centralized-vs-decentralized-monitors-for-hyperproperties-2405.12882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/centralized-vs-decentralized-monitors-for-hyperproperties-2405.12882"/></url>
<url><loc>https://scifaro.com/en/abs/the-2-dimensional-constraint-loop-problem-is-decidable-2405.12992</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-2-dimensional-constraint-loop-problem-is-decidable-2405.12992"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-2-dimensional-constraint-loop-problem-is-decidable-2405.12992"/></url>
<url><loc>https://scifaro.com/en/abs/co-condition-hits-the-path-2405.12994</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/co-condition-hits-the-path-2405.12994"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/co-condition-hits-the-path-2405.12994"/></url>
<url><loc>https://scifaro.com/en/abs/source-level-reasoning-for-quantitative-information-flow-2405.13416</loc><lastmod>2025-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/source-level-reasoning-for-quantitative-information-flow-2405.13416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/source-level-reasoning-for-quantitative-information-flow-2405.13416"/></url>
<url><loc>https://scifaro.com/en/abs/a-coherence-construction-for-the-propositional-universe-2405.13435</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coherence-construction-for-the-propositional-universe-2405.13435"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coherence-construction-for-the-propositional-universe-2405.13435"/></url>
<url><loc>https://scifaro.com/en/abs/analogical-proportions-ii-2405.13461</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analogical-proportions-ii-2405.13461"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analogical-proportions-ii-2405.13461"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-planning-for-hyperproperty-verification-2405.13488</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-planning-for-hyperproperty-verification-2405.13488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-planning-for-hyperproperty-verification-2405.13488"/></url>
<url><loc>https://scifaro.com/en/abs/tools-at-the-frontiers-of-quantitative-verification-2405.13583</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tools-at-the-frontiers-of-quantitative-verification-2405.13583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tools-at-the-frontiers-of-quantitative-verification-2405.13583"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-deciding-characteristic-formulae-in-van-glabbeek-s-branching-time-spectrum-2405.13697</loc><lastmod>2024-11-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-deciding-characteristic-formulae-in-van-glabbeek-s-branching-time-spectrum-2405.13697"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-deciding-characteristic-formulae-in-van-glabbeek-s-branching-time-spectrum-2405.13697"/></url>
<url><loc>https://scifaro.com/en/abs/traffic-scenario-logic-a-spatial-temporal-logic-for-modeling-and-reasoning-of-urban-traffic-scenarios-2405.13715</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/traffic-scenario-logic-a-spatial-temporal-logic-for-modeling-and-reasoning-of-urban-traffic-scenarios-2405.13715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/traffic-scenario-logic-a-spatial-temporal-logic-for-modeling-and-reasoning-of-urban-traffic-scenarios-2405.13715"/></url>
<url><loc>https://scifaro.com/en/abs/towards-counting-markov-equivalence-classes-with-logical-constraints-2405.13736</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-counting-markov-equivalence-classes-with-logical-constraints-2405.13736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-counting-markov-equivalence-classes-with-logical-constraints-2405.13736"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-global-two-safety-properties-in-neural-networks-with-confidence-2405.14400</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-global-two-safety-properties-in-neural-networks-with-confidence-2405.14400"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-global-two-safety-properties-in-neural-networks-with-confidence-2405.14400"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-judgmental-existence-and-its-relation-to-proof-irrelevance-2405.14481</loc><lastmod>2024-05-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-judgmental-existence-and-its-relation-to-proof-irrelevance-2405.14481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-judgmental-existence-and-its-relation-to-proof-irrelevance-2405.14481"/></url>
<url><loc>https://scifaro.com/en/abs/logical-characterizations-of-recurrent-graph-neural-networks-with-reals-and-floats-2405.14606</loc><lastmod>2025-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-characterizations-of-recurrent-graph-neural-networks-with-reals-and-floats-2405.14606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-characterizations-of-recurrent-graph-neural-networks-with-reals-and-floats-2405.14606"/></url>
<url><loc>https://scifaro.com/en/abs/logic-for-conditional-strong-historical-necessity-in-branching-time-and-analyses-of-an-argument-for-future-determinism-2405.15248</loc><lastmod>2024-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-for-conditional-strong-historical-necessity-in-branching-time-and-analyses-of-an-argument-for-future-determinism-2405.15248"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-for-conditional-strong-historical-necessity-in-branching-time-and-analyses-of-an-argument-for-future-determinism-2405.15248"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-knowledge-and-justifications-with-an-application-to-computational-trust-2405.15647</loc><lastmod>2025-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-knowledge-and-justifications-with-an-application-to-computational-trust-2405.15647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-knowledge-and-justifications-with-an-application-to-computational-trust-2405.15647"/></url>
<url><loc>https://scifaro.com/en/abs/the-undecidability-of-quantified-announcements-2405.15671</loc><lastmod>2024-06-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-undecidability-of-quantified-announcements-2405.15671"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-undecidability-of-quantified-announcements-2405.15671"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-learning-2405.15723</loc><lastmod>2024-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-learning-2405.15723"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-learning-2405.15723"/></url>
<url><loc>https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-2-preliminary-test-2405.16613</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-2-preliminary-test-2405.16613"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ra-a-machine-based-rational-agent-part-2-preliminary-test-2405.16613"/></url>
<url><loc>https://scifaro.com/en/abs/conjunctive-categorial-grammars-and-lambek-grammars-with-additives-2405.16662</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conjunctive-categorial-grammars-and-lambek-grammars-with-additives-2405.16662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conjunctive-categorial-grammars-and-lambek-grammars-with-additives-2405.16662"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-bialgebraic-semantics-2405.16708</loc><lastmod>2026-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-bialgebraic-semantics-2405.16708"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-bialgebraic-semantics-2405.16708"/></url>
<url><loc>https://scifaro.com/en/abs/laurel-unblocking-automated-verification-with-large-language-models-2405.16792</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/laurel-unblocking-automated-verification-with-large-language-models-2405.16792"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/laurel-unblocking-automated-verification-with-large-language-models-2405.16792"/></url>
<url><loc>https://scifaro.com/en/abs/program-synthesis-is-sigma-3-0-complete-2405.16997</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/program-synthesis-is-sigma-3-0-complete-2405.16997"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/program-synthesis-is-sigma-3-0-complete-2405.16997"/></url>
<url><loc>https://scifaro.com/en/abs/a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-2405.17072</loc><lastmod>2025-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-2405.17072"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-2405.17072"/></url>
<url><loc>https://scifaro.com/en/abs/left-linear-completion-with-ac-axioms-2405.17109</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/left-linear-completion-with-ac-axioms-2405.17109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/left-linear-completion-with-ac-axioms-2405.17109"/></url>
<url><loc>https://scifaro.com/en/abs/stochastic-omega-regular-verification-and-control-with-supermartingales-2405.17304</loc><lastmod>2024-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stochastic-omega-regular-verification-and-control-with-supermartingales-2405.17304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stochastic-omega-regular-verification-and-control-with-supermartingales-2405.17304"/></url>
<url><loc>https://scifaro.com/en/abs/element-free-probability-distributions-and-random-partitions-2405.17595</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/element-free-probability-distributions-and-random-partitions-2405.17595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/element-free-probability-distributions-and-random-partitions-2405.17595"/></url>
<url><loc>https://scifaro.com/en/abs/drawing-with-distance-2405.18182</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drawing-with-distance-2405.18182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drawing-with-distance-2405.18182"/></url>
<url><loc>https://scifaro.com/en/abs/natural-numbers-from-integers-2405.18388</loc><lastmod>2024-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/natural-numbers-from-integers-2405.18388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/natural-numbers-from-integers-2405.18388"/></url>
<url><loc>https://scifaro.com/en/abs/transformer-encoder-satisfiability-complexity-and-impact-on-formal-reasoning-2405.18548</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transformer-encoder-satisfiability-complexity-and-impact-on-formal-reasoning-2405.18548"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transformer-encoder-satisfiability-complexity-and-impact-on-formal-reasoning-2405.18548"/></url>
<url><loc>https://scifaro.com/en/abs/verifiably-robust-conformal-prediction-2405.18942</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifiably-robust-conformal-prediction-2405.18942"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifiably-robust-conformal-prediction-2405.18942"/></url>
<url><loc>https://scifaro.com/en/abs/groupoidal-realizability-for-intensional-type-theory-2405.19095</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/groupoidal-realizability-for-intensional-type-theory-2405.19095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/groupoidal-realizability-for-intensional-type-theory-2405.19095"/></url>
<url><loc>https://scifaro.com/en/abs/the-precise-complexity-of-reasoning-in-mathcal-alc-with-omega-admissible-concrete-domains-extended-version-2405.19096</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-precise-complexity-of-reasoning-in-mathcal-alc-with-omega-admissible-concrete-domains-extended-version-2405.19096"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-precise-complexity-of-reasoning-in-mathcal-alc-with-omega-admissible-concrete-domains-extended-version-2405.19096"/></url>
<url><loc>https://scifaro.com/en/abs/which-are-the-true-defeasible-logics-2405.19157</loc><lastmod>2024-05-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/which-are-the-true-defeasible-logics-2405.19157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/which-are-the-true-defeasible-logics-2405.19157"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-the-local-compactness-of-the-adele-ring-2405.19270</loc><lastmod>2025-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-the-local-compactness-of-the-adele-ring-2405.19270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-the-local-compactness-of-the-adele-ring-2405.19270"/></url>
<url><loc>https://scifaro.com/en/abs/a-dynamic-logic-for-information-evaluation-in-intelligence-2405.19968</loc><lastmod>2024-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dynamic-logic-for-information-evaluation-in-intelligence-2405.19968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dynamic-logic-for-information-evaluation-in-intelligence-2405.19968"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-automata-model-for-first-order-temporal-logics-extended-version-2405.20057</loc><lastmod>2024-05-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-automata-model-for-first-order-temporal-logics-extended-version-2405.20057"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-automata-model-for-first-order-temporal-logics-extended-version-2405.20057"/></url>
<url><loc>https://scifaro.com/en/abs/tachis-higher-order-separation-logic-with-credits-for-expected-costs-2405.20083</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tachis-higher-order-separation-logic-with-credits-for-expected-costs-2405.20083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tachis-higher-order-separation-logic-with-credits-for-expected-costs-2405.20083"/></url>
<url><loc>https://scifaro.com/en/abs/practical-modelling-with-bigraphs-2405.20745</loc><lastmod>2024-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-modelling-with-bigraphs-2405.20745"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-modelling-with-bigraphs-2405.20745"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-reversible-computation-2405.20842</loc><lastmod>2024-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-reversible-computation-2405.20842"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-reversible-computation-2405.20842"/></url>
<url><loc>https://scifaro.com/en/abs/a-lazy-abstraction-algorithm-for-markov-decision-processes-theory-and-initial-evaluation-2406.00824</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-lazy-abstraction-algorithm-for-markov-decision-processes-theory-and-initial-evaluation-2406.00824"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-lazy-abstraction-algorithm-for-markov-decision-processes-theory-and-initial-evaluation-2406.00824"/></url>
<url><loc>https://scifaro.com/en/abs/on-efficient-algorithms-for-partial-quantifier-elimination-2406.01307</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-efficient-algorithms-for-partial-quantifier-elimination-2406.01307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-efficient-algorithms-for-partial-quantifier-elimination-2406.01307"/></url>
<url><loc>https://scifaro.com/en/abs/modal-separability-of-fixpoint-formulae-2406.01497</loc><lastmod>2024-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-separability-of-fixpoint-formulae-2406.01497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-separability-of-fixpoint-formulae-2406.01497"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-logic-programming-in-hybrid-dynamic-quantum-logic-2406.02085</loc><lastmod>2024-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-logic-programming-in-hybrid-dynamic-quantum-logic-2406.02085"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-logic-programming-in-hybrid-dynamic-quantum-logic-2406.02085"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-dynamic-ehrenfeucht-fraisse-games-2406.02094</loc><lastmod>2025-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-dynamic-ehrenfeucht-fraisse-games-2406.02094"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-dynamic-ehrenfeucht-fraisse-games-2406.02094"/></url>
<url><loc>https://scifaro.com/en/abs/two-dimensional-kripke-semantics-ii-stability-and-completeness-2406.03578</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-dimensional-kripke-semantics-ii-stability-and-completeness-2406.03578"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-dimensional-kripke-semantics-ii-stability-and-completeness-2406.03578"/></url>
<url><loc>https://scifaro.com/en/abs/shield-synthesis-for-ltl-modulo-theories-2406.04184</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shield-synthesis-for-ltl-modulo-theories-2406.04184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shield-synthesis-for-ltl-modulo-theories-2406.04184"/></url>
<url><loc>https://scifaro.com/en/abs/polysat-word-level-bit-vector-reasoning-in-z3-2406.04696</loc><lastmod>2024-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polysat-word-level-bit-vector-reasoning-in-z3-2406.04696"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polysat-word-level-bit-vector-reasoning-in-z3-2406.04696"/></url>
<url><loc>https://scifaro.com/en/abs/logic-synthesis-with-generative-deep-neural-networks-2406.04699</loc><lastmod>2024-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-synthesis-with-generative-deep-neural-networks-2406.04699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-synthesis-with-generative-deep-neural-networks-2406.04699"/></url>
<url><loc>https://scifaro.com/en/abs/a-remark-on-the-expressivity-of-asynchronous-teamltl-and-hyperltl-2406.04833</loc><lastmod>2024-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-remark-on-the-expressivity-of-asynchronous-teamltl-and-hyperltl-2406.04833"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-remark-on-the-expressivity-of-asynchronous-teamltl-and-hyperltl-2406.04833"/></url>
<url><loc>https://scifaro.com/en/abs/a-propositional-cirquent-calculus-for-computability-logic-2406.05879</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-propositional-cirquent-calculus-for-computability-logic-2406.05879"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-propositional-cirquent-calculus-for-computability-logic-2406.05879"/></url>
<url><loc>https://scifaro.com/en/abs/the-new-tptp-format-for-interpretations-2406.06108</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-new-tptp-format-for-interpretations-2406.06108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-new-tptp-format-for-interpretations-2406.06108"/></url>
<url><loc>https://scifaro.com/en/abs/practical-boolean-decomposition-for-delay-driven-lut-mapping-2406.06241</loc><lastmod>2024-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-boolean-decomposition-for-delay-driven-lut-mapping-2406.06241"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-boolean-decomposition-for-delay-driven-lut-mapping-2406.06241"/></url>
<url><loc>https://scifaro.com/en/abs/data-complexity-in-expressive-description-logics-with-path-expressions-2406.07095</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-complexity-in-expressive-description-logics-with-path-expressions-2406.07095"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-complexity-in-expressive-description-logics-with-path-expressions-2406.07095"/></url>
<url><loc>https://scifaro.com/en/abs/the-semantics-of-effects-centrality-quantum-control-and-reversible-recursion-2406.07216</loc><lastmod>2024-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-semantics-of-effects-centrality-quantum-control-and-reversible-recursion-2406.07216"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-semantics-of-effects-centrality-quantum-control-and-reversible-recursion-2406.07216"/></url>
<url><loc>https://scifaro.com/en/abs/certificates-and-witnesses-for-multi-objective-queries-in-markov-decision-processes-2406.08175</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certificates-and-witnesses-for-multi-objective-queries-in-markov-decision-processes-2406.08175"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certificates-and-witnesses-for-multi-objective-queries-in-markov-decision-processes-2406.08175"/></url>
<url><loc>https://scifaro.com/en/abs/dyadic-obligations-proofs-and-countermodels-via-hypersequents-2406.09088</loc><lastmod>2024-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dyadic-obligations-proofs-and-countermodels-via-hypersequents-2406.09088"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dyadic-obligations-proofs-and-countermodels-via-hypersequents-2406.09088"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequents-for-quasi-transitive-modal-logics-2406.09300</loc><lastmod>2024-06-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequents-for-quasi-transitive-modal-logics-2406.09300"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequents-for-quasi-transitive-modal-logics-2406.09300"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-planning-via-interval-logic-satisfiability-for-autonomous-systems-2406.09661</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-planning-via-interval-logic-satisfiability-for-autonomous-systems-2406.09661"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-planning-via-interval-logic-satisfiability-for-autonomous-systems-2406.09661"/></url>
<url><loc>https://scifaro.com/en/abs/consistent-update-synthesis-via-privatized-beliefs-2406.10010</loc><lastmod>2024-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/consistent-update-synthesis-via-privatized-beliefs-2406.10010"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/consistent-update-synthesis-via-privatized-beliefs-2406.10010"/></url>
<url><loc>https://scifaro.com/en/abs/property-based-testing-by-elaborating-proof-outlines-2406.10053</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/property-based-testing-by-elaborating-proof-outlines-2406.10053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/property-based-testing-by-elaborating-proof-outlines-2406.10053"/></url>
<url><loc>https://scifaro.com/en/abs/rdf-surfaces-enabling-classical-negation-on-the-semantic-web-2406.10659</loc><lastmod>2024-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rdf-surfaces-enabling-classical-negation-on-the-semantic-web-2406.10659"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rdf-surfaces-enabling-classical-negation-on-the-semantic-web-2406.10659"/></url>
<url><loc>https://scifaro.com/en/abs/formally-certified-approximate-model-counting-2406.11414</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-certified-approximate-model-counting-2406.11414"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-certified-approximate-model-counting-2406.11414"/></url>
<url><loc>https://scifaro.com/en/abs/neural-logic-programs-and-neural-nets-2406.11888</loc><lastmod>2024-06-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-logic-programs-and-neural-nets-2406.11888"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-logic-programs-and-neural-nets-2406.11888"/></url>
<url><loc>https://scifaro.com/en/abs/data-aware-hybrid-tableaux-2406.12090</loc><lastmod>2025-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-aware-hybrid-tableaux-2406.12090"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-aware-hybrid-tableaux-2406.12090"/></url>
<url><loc>https://scifaro.com/en/abs/a-behavioral-theory-for-distributed-systems-with-weak-recovery-2406.12574</loc><lastmod>2025-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-behavioral-theory-for-distributed-systems-with-weak-recovery-2406.12574"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-behavioral-theory-for-distributed-systems-with-weak-recovery-2406.12574"/></url>
<url><loc>https://scifaro.com/en/abs/birkhoff-style-proof-systems-for-hybrid-dynamic-quantum-logic-2406.13360</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/birkhoff-style-proof-systems-for-hybrid-dynamic-quantum-logic-2406.13360"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/birkhoff-style-proof-systems-for-hybrid-dynamic-quantum-logic-2406.13360"/></url>
<url><loc>https://scifaro.com/en/abs/a-sound-and-complete-substitution-algorithm-for-multimode-type-theory-technical-report-2406.13622</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sound-and-complete-substitution-algorithm-for-multimode-type-theory-technical-report-2406.13622"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sound-and-complete-substitution-algorithm-for-multimode-type-theory-technical-report-2406.13622"/></url>
<url><loc>https://scifaro.com/en/abs/the-strength-of-the-dominance-rule-2406.13657</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-strength-of-the-dominance-rule-2406.13657"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-strength-of-the-dominance-rule-2406.13657"/></url>
<url><loc>https://scifaro.com/en/abs/extended-resolution-clause-learning-via-dual-implication-points-2406.14190</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-resolution-clause-learning-via-dual-implication-points-2406.14190"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-resolution-clause-learning-via-dual-implication-points-2406.14190"/></url>
<url><loc>https://scifaro.com/en/abs/disproving-termination-of-non-erasing-sole-combinatory-calculus-with-tree-automata-full-version-2406.14305</loc><lastmod>2024-06-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disproving-termination-of-non-erasing-sole-combinatory-calculus-with-tree-automata-full-version-2406.14305"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disproving-termination-of-non-erasing-sole-combinatory-calculus-with-tree-automata-full-version-2406.14305"/></url>
<url><loc>https://scifaro.com/en/abs/logic-based-analogical-proportions-2406.14402</loc><lastmod>2025-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-based-analogical-proportions-2406.14402"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-based-analogical-proportions-2406.14402"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-markov-chains-as-distribution-transformers-2406.15087</loc><lastmod>2024-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-markov-chains-as-distribution-transformers-2406.15087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-markov-chains-as-distribution-transformers-2406.15087"/></url>
<url><loc>https://scifaro.com/en/abs/phase-bounded-broadcast-networks-over-topologies-of-communication-2406.15202</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/phase-bounded-broadcast-networks-over-topologies-of-communication-2406.15202"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/phase-bounded-broadcast-networks-over-topologies-of-communication-2406.15202"/></url>
<url><loc>https://scifaro.com/en/abs/grants4companies-applying-declarative-methods-for-recommending-and-reasoning-about-business-grants-in-the-austrian-public-administration-system-description-2406.15293</loc><lastmod>2024-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/grants4companies-applying-declarative-methods-for-recommending-and-reasoning-about-business-grants-in-the-austrian-public-administration-system-description-2406.15293"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/grants4companies-applying-declarative-methods-for-recommending-and-reasoning-about-business-grants-in-the-austrian-public-administration-system-description-2406.15293"/></url>
<url><loc>https://scifaro.com/en/abs/deducibility-in-the-full-lambek-calculus-with-weakening-is-hack-complete-2406.15626</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deducibility-in-the-full-lambek-calculus-with-weakening-is-hack-complete-2406.15626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deducibility-in-the-full-lambek-calculus-with-weakening-is-hack-complete-2406.15626"/></url>
<url><loc>https://scifaro.com/en/abs/equivalence-hypergraphs-dpo-rewriting-for-monoidal-e-graphs-2406.15882</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equivalence-hypergraphs-dpo-rewriting-for-monoidal-e-graphs-2406.15882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equivalence-hypergraphs-dpo-rewriting-for-monoidal-e-graphs-2406.15882"/></url>
<url><loc>https://scifaro.com/en/abs/drag-rewriting-2406.16046</loc><lastmod>2024-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/drag-rewriting-2406.16046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/drag-rewriting-2406.16046"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-probabilistic-hoare-logic-with-while-loop-2406.16054</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-probabilistic-hoare-logic-with-while-loop-2406.16054"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-relative-completeness-of-satisfaction-based-probabilistic-hoare-logic-with-while-loop-2406.16054"/></url>
<url><loc>https://scifaro.com/en/abs/logics-of-polyhedral-reachability-2406.16056</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-of-polyhedral-reachability-2406.16056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-of-polyhedral-reachability-2406.16056"/></url>
<url><loc>https://scifaro.com/en/abs/transient-evaluation-of-non-markovian-models-by-stochastic-state-classes-and-simulation-2406.16447</loc><lastmod>2024-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transient-evaluation-of-non-markovian-models-by-stochastic-state-classes-and-simulation-2406.16447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transient-evaluation-of-non-markovian-models-by-stochastic-state-classes-and-simulation-2406.16447"/></url>
<url><loc>https://scifaro.com/en/abs/dynamic-probability-logic-decidability-computability-2406.16720</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dynamic-probability-logic-decidability-computability-2406.16720"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dynamic-probability-logic-decidability-computability-2406.16720"/></url>
<url><loc>https://scifaro.com/en/abs/bisimulation-for-impure-simplicial-complexes-2406.16785</loc><lastmod>2024-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisimulation-for-impure-simplicial-complexes-2406.16785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisimulation-for-impure-simplicial-complexes-2406.16785"/></url>
<url><loc>https://scifaro.com/en/abs/a-strongly-normalising-system-of-dependent-types-for-transparent-and-opaque-probabilistic-computation-2406.17082</loc><lastmod>2026-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-strongly-normalising-system-of-dependent-types-for-transparent-and-opaque-probabilistic-computation-2406.17082"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-strongly-normalising-system-of-dependent-types-for-transparent-and-opaque-probabilistic-computation-2406.17082"/></url>
<url><loc>https://scifaro.com/en/abs/pareto-fronts-for-compositionally-solving-string-diagrams-of-parity-games-2406.17240</loc><lastmod>2025-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pareto-fronts-for-compositionally-solving-string-diagrams-of-parity-games-2406.17240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pareto-fronts-for-compositionally-solving-string-diagrams-of-parity-games-2406.17240"/></url>
<url><loc>https://scifaro.com/en/abs/positive-and-monotone-fragments-of-fo-and-ltl-2406.17693</loc><lastmod>2024-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-and-monotone-fragments-of-fo-and-ltl-2406.17693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-and-monotone-fragments-of-fo-and-ltl-2406.17693"/></url>
<url><loc>https://scifaro.com/en/abs/esbmc-v7-6-enhanced-model-checking-of-c-programs-with-clang-ast-2406.17862</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/esbmc-v7-6-enhanced-model-checking-of-c-programs-with-clang-ast-2406.17862"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/esbmc-v7-6-enhanced-model-checking-of-c-programs-with-clang-ast-2406.17862"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-descriptive-complexity-of-vertex-deletion-problems-2406.18299</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-vertex-deletion-problems-2406.18299"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-descriptive-complexity-of-vertex-deletion-problems-2406.18299"/></url>
<url><loc>https://scifaro.com/en/abs/parameterizing-the-quantification-of-cmso-model-checking-on-minor-closed-graph-classes-2406.18465</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parameterizing-the-quantification-of-cmso-model-checking-on-minor-closed-graph-classes-2406.18465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parameterizing-the-quantification-of-cmso-model-checking-on-minor-closed-graph-classes-2406.18465"/></url>
<url><loc>https://scifaro.com/en/abs/a-weakly-monotonic-logically-constrained-horpo-variant-2406.18493</loc><lastmod>2024-06-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-weakly-monotonic-logically-constrained-horpo-variant-2406.18493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-weakly-monotonic-logically-constrained-horpo-variant-2406.18493"/></url>
<url><loc>https://scifaro.com/en/abs/demonic-variance-and-a-non-determinism-score-for-markov-decision-processes-2406.18727</loc><lastmod>2024-06-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/demonic-variance-and-a-non-determinism-score-for-markov-decision-processes-2406.18727"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/demonic-variance-and-a-non-determinism-score-for-markov-decision-processes-2406.18727"/></url>
<url><loc>https://scifaro.com/en/abs/higher-order-constrained-dependency-pairs-for-universal-computability-2406.19379</loc><lastmod>2024-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/higher-order-constrained-dependency-pairs-for-universal-computability-2406.19379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/higher-order-constrained-dependency-pairs-for-universal-computability-2406.19379"/></url>
<url><loc>https://scifaro.com/en/abs/state-matching-and-multiple-references-in-adaptive-active-automata-learning-2406.19714</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/state-matching-and-multiple-references-in-adaptive-active-automata-learning-2406.19714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/state-matching-and-multiple-references-in-adaptive-active-automata-learning-2406.19714"/></url>
<url><loc>https://scifaro.com/en/abs/realizing-the-maximal-analytic-display-fragment-of-labeled-sequent-calculi-for-tense-logics-2406.19882</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/realizing-the-maximal-analytic-display-fragment-of-labeled-sequent-calculi-for-tense-logics-2406.19882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/realizing-the-maximal-analytic-display-fragment-of-labeled-sequent-calculi-for-tense-logics-2406.19882"/></url>
<url><loc>https://scifaro.com/en/abs/learning-branching-time-properties-in-ctl-and-atl-via-constraint-solving-2406.19890</loc><lastmod>2024-07-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-branching-time-properties-in-ctl-and-atl-via-constraint-solving-2406.19890"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-branching-time-properties-in-ctl-and-atl-via-constraint-solving-2406.19890"/></url>
<url><loc>https://scifaro.com/en/abs/a-reflection-principle-for-potential-infinite-models-of-type-theory-2407.00220</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-reflection-principle-for-potential-infinite-models-of-type-theory-2407.00220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-reflection-principle-for-potential-infinite-models-of-type-theory-2407.00220"/></url>
<url><loc>https://scifaro.com/en/abs/learning-closed-signal-flow-graphs-2407.00245</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-closed-signal-flow-graphs-2407.00245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-closed-signal-flow-graphs-2407.00245"/></url>
<url><loc>https://scifaro.com/en/abs/an-invitation-to-game-comonads-2407.00606</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-invitation-to-game-comonads-2407.00606"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-invitation-to-game-comonads-2407.00606"/></url>
<url><loc>https://scifaro.com/en/abs/nonlinear-craig-interpolant-generation-over-unbounded-domains-by-separating-semialgebraic-sets-2407.00625</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nonlinear-craig-interpolant-generation-over-unbounded-domains-by-separating-semialgebraic-sets-2407.00625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nonlinear-craig-interpolant-generation-over-unbounded-domains-by-separating-semialgebraic-sets-2407.00625"/></url>
<url><loc>https://scifaro.com/en/abs/field-knowledge-as-a-dual-to-distributed-knowledge-a-characterization-by-weighted-modal-logic-2407.00687</loc><lastmod>2024-07-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/field-knowledge-as-a-dual-to-distributed-knowledge-a-characterization-by-weighted-modal-logic-2407.00687"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/field-knowledge-as-a-dual-to-distributed-knowledge-a-characterization-by-weighted-modal-logic-2407.00687"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-number-of-quantifiers-needed-to-define-boolean-functions-2407.00688</loc><lastmod>2025-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-number-of-quantifiers-needed-to-define-boolean-functions-2407.00688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-number-of-quantifiers-needed-to-define-boolean-functions-2407.00688"/></url>
<url><loc>https://scifaro.com/en/abs/reusable-formal-verification-of-dag-based-consensus-protocols-2407.02167</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reusable-formal-verification-of-dag-based-consensus-protocols-2407.02167"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reusable-formal-verification-of-dag-based-consensus-protocols-2407.02167"/></url>
<url><loc>https://scifaro.com/en/abs/information-flow-control-in-cyclic-process-networks-2407.02304</loc><lastmod>2024-07-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-flow-control-in-cyclic-process-networks-2407.02304"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-flow-control-in-cyclic-process-networks-2407.02304"/></url>
<url><loc>https://scifaro.com/en/abs/logic-lm-multi-step-refinement-for-symbolic-formulations-2407.02514</loc><lastmod>2024-08-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-lm-multi-step-refinement-for-symbolic-formulations-2407.02514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-lm-multi-step-refinement-for-symbolic-formulations-2407.02514"/></url>
<url><loc>https://scifaro.com/en/abs/functional-variant-of-polynomial-analogue-of-gandy-s-fixed-point-theorem-2407.02515</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/functional-variant-of-polynomial-analogue-of-gandy-s-fixed-point-theorem-2407.02515"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/functional-variant-of-polynomial-analogue-of-gandy-s-fixed-point-theorem-2407.02515"/></url>
<url><loc>https://scifaro.com/en/abs/automated-verification-of-higher-order-probabilistic-programs-via-a-dependent-refinement-type-system-2407.02975</loc><lastmod>2024-07-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-verification-of-higher-order-probabilistic-programs-via-a-dependent-refinement-type-system-2407.02975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-verification-of-higher-order-probabilistic-programs-via-a-dependent-refinement-type-system-2407.02975"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-data-free-nfer-2407.03155</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-data-free-nfer-2407.03155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-data-free-nfer-2407.03155"/></url>
<url><loc>https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-with-logical-constraints-2407.03847</loc><lastmod>2025-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-with-logical-constraints-2407.03847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comparing-differentiable-logics-for-learning-with-logical-constraints-2407.03847"/></url>
<url><loc>https://scifaro.com/en/abs/ultraproducts-in-abstract-categorical-logic-2407.04116</loc><lastmod>2024-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ultraproducts-in-abstract-categorical-logic-2407.04116"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ultraproducts-in-abstract-categorical-logic-2407.04116"/></url>
<url><loc>https://scifaro.com/en/abs/characterisation-of-lawvere-tierney-topologies-on-simplicial-sets-bicolored-graphs-and-fuzzy-sets-2407.04535</loc><lastmod>2024-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterisation-of-lawvere-tierney-topologies-on-simplicial-sets-bicolored-graphs-and-fuzzy-sets-2407.04535"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterisation-of-lawvere-tierney-topologies-on-simplicial-sets-bicolored-graphs-and-fuzzy-sets-2407.04535"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-decidability-of-presburger-arithmetic-expanded-with-powers-2407.05191</loc><lastmod>2025-07-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-decidability-of-presburger-arithmetic-expanded-with-powers-2407.05191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-decidability-of-presburger-arithmetic-expanded-with-powers-2407.05191"/></url>
<url><loc>https://scifaro.com/en/abs/a-higher-order-vampire-short-paper-2407.05208</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-higher-order-vampire-short-paper-2407.05208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-higher-order-vampire-short-paper-2407.05208"/></url>
<url><loc>https://scifaro.com/en/abs/the-size-change-principle-for-mixed-inductive-and-coinductive-types-2407.05715</loc><lastmod>2025-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-size-change-principle-for-mixed-inductive-and-coinductive-types-2407.05715"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-size-change-principle-for-mixed-inductive-and-coinductive-types-2407.05715"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2407.05822</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2407.05822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-workshop-on-logical-frameworks-and-meta-languages-theory-and-practice-2407.05822"/></url>
<url><loc>https://scifaro.com/en/abs/bridging-abstract-dialectical-argumentation-and-boolean-gene-regulation-2407.06106</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bridging-abstract-dialectical-argumentation-and-boolean-gene-regulation-2407.06106"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bridging-abstract-dialectical-argumentation-and-boolean-gene-regulation-2407.06106"/></url>
<url><loc>https://scifaro.com/en/abs/left-linear-rewriting-in-adhesive-categories-2407.06181</loc><lastmod>2024-07-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/left-linear-rewriting-in-adhesive-categories-2407.06181"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/left-linear-rewriting-in-adhesive-categories-2407.06181"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-successor-a-novel-temporal-logic-2407.06214</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-successor-a-novel-temporal-logic-2407.06214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-successor-a-novel-temporal-logic-2407.06214"/></url>
<url><loc>https://scifaro.com/en/abs/around-classical-and-intuitionistic-linear-processes-2407.06391</loc><lastmod>2024-07-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/around-classical-and-intuitionistic-linear-processes-2407.06391"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/around-classical-and-intuitionistic-linear-processes-2407.06391"/></url>
<url><loc>https://scifaro.com/en/abs/geospatial-trajectory-generation-via-efficient-abduction-deployment-for-independent-testing-2407.06447</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/geospatial-trajectory-generation-via-efficient-abduction-deployment-for-independent-testing-2407.06447"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/geospatial-trajectory-generation-via-efficient-abduction-deployment-for-independent-testing-2407.06447"/></url>
<url><loc>https://scifaro.com/en/abs/a-beluga-formalization-of-the-harmony-lemma-in-the-pi-calculus-2407.06624</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-beluga-formalization-of-the-harmony-lemma-in-the-pi-calculus-2407.06624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-beluga-formalization-of-the-harmony-lemma-in-the-pi-calculus-2407.06624"/></url>
<url><loc>https://scifaro.com/en/abs/binding-contexts-as-partitionable-multisets-in-abella-2407.06625</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/binding-contexts-as-partitionable-multisets-in-abella-2407.06625"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/binding-contexts-as-partitionable-multisets-in-abella-2407.06625"/></url>
<url><loc>https://scifaro.com/en/abs/kuroda-s-translation-for-the-lambda-pi-calculus-modulo-theory-and-dedukti-2407.06626</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kuroda-s-translation-for-the-lambda-pi-calculus-modulo-theory-and-dedukti-2407.06626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kuroda-s-translation-for-the-lambda-pi-calculus-modulo-theory-and-dedukti-2407.06626"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-for-free-in-the-lambda-pi-calculus-modulo-theory-2407.06627</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-for-free-in-the-lambda-pi-calculus-modulo-theory-2407.06627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-for-free-in-the-lambda-pi-calculus-modulo-theory-2407.06627"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modelling-and-analysis-of-slot-machines-2407.06809</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modelling-and-analysis-of-slot-machines-2407.06809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modelling-and-analysis-of-slot-machines-2407.06809"/></url>
<url><loc>https://scifaro.com/en/abs/coinductive-techniques-for-checking-satisfiability-of-generalized-nested-conditions-2407.06864</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coinductive-techniques-for-checking-satisfiability-of-generalized-nested-conditions-2407.06864"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coinductive-techniques-for-checking-satisfiability-of-generalized-nested-conditions-2407.06864"/></url>
<url><loc>https://scifaro.com/en/abs/risk-averse-optimization-of-total-rewards-in-markovian-models-using-deviation-measures-2407.06887</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/risk-averse-optimization-of-total-rewards-in-markovian-models-using-deviation-measures-2407.06887"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/risk-averse-optimization-of-total-rewards-in-markovian-models-using-deviation-measures-2407.06887"/></url>
<url><loc>https://scifaro.com/en/abs/domain-theory-in-univalent-foundations-i-directed-complete-posets-and-scott-s-d-infty-2407.06952</loc><lastmod>2024-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domain-theory-in-univalent-foundations-i-directed-complete-posets-and-scott-s-d-infty-2407.06952"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domain-theory-in-univalent-foundations-i-directed-complete-posets-and-scott-s-d-infty-2407.06952"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-and-algebraic-domains-in-univalent-foundations-2407.06956</loc><lastmod>2025-09-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-and-algebraic-domains-in-univalent-foundations-2407.06956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-and-algebraic-domains-in-univalent-foundations-2407.06956"/></url>
<url><loc>https://scifaro.com/en/abs/an-automata-based-approach-for-synchronizable-mailbox-communication-2407.06968</loc><lastmod>2026-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-automata-based-approach-for-synchronizable-mailbox-communication-2407.06968"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-automata-based-approach-for-synchronizable-mailbox-communication-2407.06968"/></url>
<url><loc>https://scifaro.com/en/abs/a-pspace-algorithm-for-almost-sure-rabin-objectives-in-multi-environment-mdps-2407.07006</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-pspace-algorithm-for-almost-sure-rabin-objectives-in-multi-environment-mdps-2407.07006"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-pspace-algorithm-for-almost-sure-rabin-objectives-in-multi-environment-mdps-2407.07006"/></url>
<url><loc>https://scifaro.com/en/abs/integer-linear-exponential-programming-in-np-by-quantifier-elimination-2407.07083</loc><lastmod>2024-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/integer-linear-exponential-programming-in-np-by-quantifier-elimination-2407.07083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/integer-linear-exponential-programming-in-np-by-quantifier-elimination-2407.07083"/></url>
<url><loc>https://scifaro.com/en/abs/completeness-of-finitely-weighted-kleene-algebra-with-tests-2407.07570</loc><lastmod>2024-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/completeness-of-finitely-weighted-kleene-algebra-with-tests-2407.07570"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/completeness-of-finitely-weighted-kleene-algebra-with-tests-2407.07570"/></url>
<url><loc>https://scifaro.com/en/abs/a-spectrum-of-approximate-probabilistic-bisimulations-2407.07584</loc><lastmod>2024-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-spectrum-of-approximate-probabilistic-bisimulations-2407.07584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-spectrum-of-approximate-probabilistic-bisimulations-2407.07584"/></url>
<url><loc>https://scifaro.com/en/abs/validity-of-contextual-formulas-extended-version-2407.07759</loc><lastmod>2024-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/validity-of-contextual-formulas-extended-version-2407.07759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/validity-of-contextual-formulas-extended-version-2407.07759"/></url>
<url><loc>https://scifaro.com/en/abs/progress-justness-and-fairness-in-modal-mu-calculus-formulae-2407.08060</loc><lastmod>2024-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/progress-justness-and-fairness-in-modal-mu-calculus-formulae-2407.08060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/progress-justness-and-fairness-in-modal-mu-calculus-formulae-2407.08060"/></url>
<url><loc>https://scifaro.com/en/abs/pragmatics-of-formally-verified-yet-efficient-static-analysis-in-particular-for-formally-verified-compilers-2407.08258</loc><lastmod>2024-07-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pragmatics-of-formally-verified-yet-efficient-static-analysis-in-particular-for-formally-verified-compilers-2407.08258"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pragmatics-of-formally-verified-yet-efficient-static-analysis-in-particular-for-formally-verified-compilers-2407.08258"/></url>
<url><loc>https://scifaro.com/en/abs/a-unifying-categorical-view-of-nondeterministic-iteration-and-tests-2407.08688</loc><lastmod>2024-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unifying-categorical-view-of-nondeterministic-iteration-and-tests-2407.08688"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unifying-categorical-view-of-nondeterministic-iteration-and-tests-2407.08688"/></url>
<url><loc>https://scifaro.com/en/abs/hhlpar-automated-theorem-prover-for-parallel-hybrid-communicating-sequential-processes-2407.08936</loc><lastmod>2025-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hhlpar-automated-theorem-prover-for-parallel-hybrid-communicating-sequential-processes-2407.08936"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hhlpar-automated-theorem-prover-for-parallel-hybrid-communicating-sequential-processes-2407.08936"/></url>
<url><loc>https://scifaro.com/en/abs/static-analysis-of-logic-programs-via-boolean-networks-2407.09015</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-analysis-of-logic-programs-via-boolean-networks-2407.09015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-analysis-of-logic-programs-via-boolean-networks-2407.09015"/></url>
<url><loc>https://scifaro.com/en/abs/directed-univalence-in-simplicial-homotopy-type-theory-2407.09146</loc><lastmod>2026-01-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/directed-univalence-in-simplicial-homotopy-type-theory-2407.09146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/directed-univalence-in-simplicial-homotopy-type-theory-2407.09146"/></url>
<url><loc>https://scifaro.com/en/abs/predictable-and-performant-reactive-synthesis-modulo-theories-via-functional-synthesis-2407.09348</loc><lastmod>2024-07-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/predictable-and-performant-reactive-synthesis-modulo-theories-via-functional-synthesis-2407.09348"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/predictable-and-performant-reactive-synthesis-modulo-theories-via-functional-synthesis-2407.09348"/></url>
<url><loc>https://scifaro.com/en/abs/on-lower-bounding-minimal-model-count-2407.09744</loc><lastmod>2024-07-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-lower-bounding-minimal-model-count-2407.09744"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-lower-bounding-minimal-model-count-2407.09744"/></url>
<url><loc>https://scifaro.com/en/abs/the-significance-of-symbolic-logic-for-scientific-education-2407.09959</loc><lastmod>2024-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-significance-of-symbolic-logic-for-scientific-education-2407.09959"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-significance-of-symbolic-logic-for-scientific-education-2407.09959"/></url>
<url><loc>https://scifaro.com/en/abs/a-unifying-approach-to-product-constructions-for-quantitative-temporal-inference-2407.10465</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unifying-approach-to-product-constructions-for-quantitative-temporal-inference-2407.10465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unifying-approach-to-product-constructions-for-quantitative-temporal-inference-2407.10465"/></url>
<url><loc>https://scifaro.com/en/abs/strategic-dominance-a-new-preorder-for-nondeterministic-processes-2407.10473</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strategic-dominance-a-new-preorder-for-nondeterministic-processes-2407.10473"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strategic-dominance-a-new-preorder-for-nondeterministic-processes-2407.10473"/></url>
<url><loc>https://scifaro.com/en/abs/wadge-degrees-of-delta-0-2-omega-powers-2407.10520</loc><lastmod>2024-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/wadge-degrees-of-delta-0-2-omega-powers-2407.10520"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/wadge-degrees-of-delta-0-2-omega-powers-2407.10520"/></url>
<url><loc>https://scifaro.com/en/abs/bridging-weighted-first-order-model-counting-and-graph-polynomials-2407.11877</loc><lastmod>2025-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bridging-weighted-first-order-model-counting-and-graph-polynomials-2407.11877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bridging-weighted-first-order-model-counting-and-graph-polynomials-2407.11877"/></url>
<url><loc>https://scifaro.com/en/abs/information-flow-guided-synthesis-with-unbounded-communication-2407.12298</loc><lastmod>2024-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/information-flow-guided-synthesis-with-unbounded-communication-2407.12298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/information-flow-guided-synthesis-with-unbounded-communication-2407.12298"/></url>
<url><loc>https://scifaro.com/en/abs/policies-grow-on-trees-model-checking-families-of-mdps-2407.12552</loc><lastmod>2024-07-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/policies-grow-on-trees-model-checking-families-of-mdps-2407.12552"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/policies-grow-on-trees-model-checking-families-of-mdps-2407.12552"/></url>
<url><loc>https://scifaro.com/en/abs/tree-algebras-and-bisimulation-invariant-mso-on-finite-graphs-2407.12677</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-algebras-and-bisimulation-invariant-mso-on-finite-graphs-2407.12677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-algebras-and-bisimulation-invariant-mso-on-finite-graphs-2407.12677"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-complexity-of-maslov-s-class-overline-text-k-2407.13339</loc><lastmod>2024-07-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-complexity-of-maslov-s-class-overline-text-k-2407.13339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-complexity-of-maslov-s-class-overline-text-k-2407.13339"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-type-safety-of-pure-subtype-systems-full-version-2407.13882</loc><lastmod>2025-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-type-safety-of-pure-subtype-systems-full-version-2407.13882"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-type-safety-of-pure-subtype-systems-full-version-2407.13882"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-relational-reasoning-for-higher-order-probabilistic-programs-2407.14107</loc><lastmod>2024-12-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-relational-reasoning-for-higher-order-probabilistic-programs-2407.14107"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-relational-reasoning-for-higher-order-probabilistic-programs-2407.14107"/></url>
<url><loc>https://scifaro.com/en/abs/strong-nominal-semantics-for-fixed-point-constraints-2407.14253</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-nominal-semantics-for-fixed-point-constraints-2407.14253"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-nominal-semantics-for-fixed-point-constraints-2407.14253"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-veracity-development-and-implementation-2407.16117</loc><lastmod>2024-07-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-veracity-development-and-implementation-2407.16117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-veracity-development-and-implementation-2407.16117"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-discovery-of-actual-causality-using-abstraction-refinement-2407.16629</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-discovery-of-actual-causality-using-abstraction-refinement-2407.16629"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-discovery-of-actual-causality-using-abstraction-refinement-2407.16629"/></url>
<url><loc>https://scifaro.com/en/abs/goedel-logics-prenex-fragments-2407.16683</loc><lastmod>2024-07-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/goedel-logics-prenex-fragments-2407.16683"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/goedel-logics-prenex-fragments-2407.16683"/></url>
<url><loc>https://scifaro.com/en/abs/a-quantitative-probabilistic-relational-hoare-logic-2407.17127</loc><lastmod>2025-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quantitative-probabilistic-relational-hoare-logic-2407.17127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quantitative-probabilistic-relational-hoare-logic-2407.17127"/></url>
<url><loc>https://scifaro.com/en/abs/static-and-dynamic-verification-of-ocaml-programs-the-gospel-ecosystem-extended-version-2407.17289</loc><lastmod>2024-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/static-and-dynamic-verification-of-ocaml-programs-the-gospel-ecosystem-extended-version-2407.17289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/static-and-dynamic-verification-of-ocaml-programs-the-gospel-ecosystem-extended-version-2407.17289"/></url>
<url><loc>https://scifaro.com/en/abs/supercritical-size-width-tree-like-resolution-trade-offs-for-graph-isomorphism-2407.17947</loc><lastmod>2025-07-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supercritical-size-width-tree-like-resolution-trade-offs-for-graph-isomorphism-2407.17947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supercritical-size-width-tree-like-resolution-trade-offs-for-graph-isomorphism-2407.17947"/></url>
<url><loc>https://scifaro.com/en/abs/text-c-2-text-p-featuring-large-language-models-with-causal-reasoning-2407.18069</loc><lastmod>2025-11-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/text-c-2-text-p-featuring-large-language-models-with-causal-reasoning-2407.18069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/text-c-2-text-p-featuring-large-language-models-with-causal-reasoning-2407.18069"/></url>
<url><loc>https://scifaro.com/en/abs/on-polynomial-time-decidability-of-k-negations-fragments-of-first-order-theories-2407.18420</loc><lastmod>2026-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-polynomial-time-decidability-of-k-negations-fragments-of-first-order-theories-2407.18420"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-polynomial-time-decidability-of-k-negations-fragments-of-first-order-theories-2407.18420"/></url>
<url><loc>https://scifaro.com/en/abs/a-construction-of-the-lie-algebra-of-a-lie-group-in-isabelle-hol-2407.19211</loc><lastmod>2024-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-construction-of-the-lie-algebra-of-a-lie-group-in-isabelle-hol-2407.19211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-construction-of-the-lie-algebra-of-a-lie-group-in-isabelle-hol-2407.19211"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-shield-synthesis-via-state-space-transformation-2407.19911</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-shield-synthesis-via-state-space-transformation-2407.19911"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-shield-synthesis-via-state-space-transformation-2407.19911"/></url>
<url><loc>https://scifaro.com/en/abs/query-maintenance-under-batch-changes-with-small-depth-circuits-2407.20031</loc><lastmod>2024-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-maintenance-under-batch-changes-with-small-depth-circuits-2407.20031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-maintenance-under-batch-changes-with-small-depth-circuits-2407.20031"/></url>
<url><loc>https://scifaro.com/en/abs/practical-rely-guarantee-verification-of-an-efficient-lock-for-sel4-on-multicore-architectures-2407.20559</loc><lastmod>2024-07-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/practical-rely-guarantee-verification-of-an-efficient-lock-for-sel4-on-multicore-architectures-2407.20559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/practical-rely-guarantee-verification-of-an-efficient-lock-for-sel4-on-multicore-architectures-2407.20559"/></url>
<url><loc>https://scifaro.com/en/abs/cost-based-semantics-for-querying-inconsistent-weighted-knowledge-bases-2407.20754</loc><lastmod>2024-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cost-based-semantics-for-querying-inconsistent-weighted-knowledge-bases-2407.20754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cost-based-semantics-for-querying-inconsistent-weighted-knowledge-bases-2407.20754"/></url>
<url><loc>https://scifaro.com/en/abs/data-driven-abstractions-via-binary-tree-gaussian-processes-for-formal-verification-2407.21029</loc><lastmod>2024-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-driven-abstractions-via-binary-tree-gaussian-processes-for-formal-verification-2407.21029"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-driven-abstractions-via-binary-tree-gaussian-processes-for-formal-verification-2407.21029"/></url>
<url><loc>https://scifaro.com/en/abs/an-smt-lib-theory-of-finite-fields-2407.21169</loc><lastmod>2024-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-smt-lib-theory-of-finite-fields-2407.21169"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-smt-lib-theory-of-finite-fields-2407.21169"/></url>
<url><loc>https://scifaro.com/en/abs/semantical-analysis-of-intuitionistic-modal-logics-between-ck-and-ik-2408.00262</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantical-analysis-of-intuitionistic-modal-logics-between-ck-and-ik-2408.00262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantical-analysis-of-intuitionistic-modal-logics-between-ck-and-ik-2408.00262"/></url>
<url><loc>https://scifaro.com/en/abs/characterizing-data-dependencies-then-and-now-2408.01109</loc><lastmod>2024-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterizing-data-dependencies-then-and-now-2408.01109"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterizing-data-dependencies-then-and-now-2408.01109"/></url>
<url><loc>https://scifaro.com/en/abs/chtw-systems-with-resource-depended-parameters-chtw-r-systems-2408.01245</loc><lastmod>2024-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/chtw-systems-with-resource-depended-parameters-chtw-r-systems-2408.01245"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/chtw-systems-with-resource-depended-parameters-chtw-r-systems-2408.01245"/></url>
<url><loc>https://scifaro.com/en/abs/extension-preservation-on-dense-graph-classes-2408.02388</loc><lastmod>2024-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extension-preservation-on-dense-graph-classes-2408.02388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extension-preservation-on-dense-graph-classes-2408.02388"/></url>
<url><loc>https://scifaro.com/en/abs/fast-robust-monitoring-for-signal-temporal-logic-with-value-freezing-operators-stl-2408.02460</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fast-robust-monitoring-for-signal-temporal-logic-with-value-freezing-operators-stl-2408.02460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fast-robust-monitoring-for-signal-temporal-logic-with-value-freezing-operators-stl-2408.02460"/></url>
<url><loc>https://scifaro.com/en/abs/modular-assurance-of-an-autonomous-ferry-using-contract-based-design-and-simulation-based-verification-principles-2408.03244</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-assurance-of-an-autonomous-ferry-using-contract-based-design-and-simulation-based-verification-principles-2408.03244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-assurance-of-an-autonomous-ferry-using-contract-based-design-and-simulation-based-verification-principles-2408.03244"/></url>
<url><loc>https://scifaro.com/en/abs/unconventional-universal-computation-in-babbage-s-analytical-engine-2408.03334</loc><lastmod>2024-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unconventional-universal-computation-in-babbage-s-analytical-engine-2408.03334"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unconventional-universal-computation-in-babbage-s-analytical-engine-2408.03334"/></url>
<url><loc>https://scifaro.com/en/abs/polyqent-a-polynomial-quantified-entailment-solver-2408.03796</loc><lastmod>2025-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polyqent-a-polynomial-quantified-entailment-solver-2408.03796"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polyqent-a-polynomial-quantified-entailment-solver-2408.03796"/></url>
<url><loc>https://scifaro.com/en/abs/computational-modelling-for-combinatorial-game-strategies-2408.03955</loc><lastmod>2025-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-modelling-for-combinatorial-game-strategies-2408.03955"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-modelling-for-combinatorial-game-strategies-2408.03955"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-learning-temporal-properties-2408.04486</loc><lastmod>2024-08-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-learning-temporal-properties-2408.04486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-learning-temporal-properties-2408.04486"/></url>
<url><loc>https://scifaro.com/en/abs/algorithms-for-markov-binomial-chains-2408.04902</loc><lastmod>2025-06-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithms-for-markov-binomial-chains-2408.04902"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithms-for-markov-binomial-chains-2408.04902"/></url>
<url><loc>https://scifaro.com/en/abs/complete-dynamic-logic-of-communicating-hybrid-programs-2408.05012</loc><lastmod>2025-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-dynamic-logic-of-communicating-hybrid-programs-2408.05012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-dynamic-logic-of-communicating-hybrid-programs-2408.05012"/></url>
<url><loc>https://scifaro.com/en/abs/approximate-distributed-monitoring-under-partial-synchrony-balancing-speed-and-accuracy-2408.05033</loc><lastmod>2024-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximate-distributed-monitoring-under-partial-synchrony-balancing-speed-and-accuracy-2408.05033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximate-distributed-monitoring-under-partial-synchrony-balancing-speed-and-accuracy-2408.05033"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-guided-automated-program-repair-for-hyperproperties-2408.06035</loc><lastmod>2024-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-guided-automated-program-repair-for-hyperproperties-2408.06035"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-guided-automated-program-repair-for-hyperproperties-2408.06035"/></url>
<url><loc>https://scifaro.com/en/abs/on-categories-of-nested-conditions-2408.06196</loc><lastmod>2024-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-categories-of-nested-conditions-2408.06196"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-categories-of-nested-conditions-2408.06196"/></url>
<url><loc>https://scifaro.com/en/abs/annotated-dependency-pairs-for-full-almost-sure-termination-of-probabilistic-term-rewriting-2408.06768</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/annotated-dependency-pairs-for-full-almost-sure-termination-of-probabilistic-term-rewriting-2408.06768"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/annotated-dependency-pairs-for-full-almost-sure-termination-of-probabilistic-term-rewriting-2408.06768"/></url>
<url><loc>https://scifaro.com/en/abs/catamorphic-abstractions-for-constrained-horn-clause-satisfiability-2408.06988</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/catamorphic-abstractions-for-constrained-horn-clause-satisfiability-2408.06988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/catamorphic-abstractions-for-constrained-horn-clause-satisfiability-2408.06988"/></url>
<url><loc>https://scifaro.com/en/abs/model-counting-in-the-wild-2408.07059</loc><lastmod>2024-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-counting-in-the-wild-2408.07059"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-counting-in-the-wild-2408.07059"/></url>
<url><loc>https://scifaro.com/en/abs/queries-with-exact-truth-values-in-paraconsistent-description-logics-2408.07283</loc><lastmod>2025-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/queries-with-exact-truth-values-in-paraconsistent-description-logics-2408.07283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/queries-with-exact-truth-values-in-paraconsistent-description-logics-2408.07283"/></url>
<url><loc>https://scifaro.com/en/abs/abductive-reasoning-in-a-paraconsistent-framework-2408.07287</loc><lastmod>2025-07-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abductive-reasoning-in-a-paraconsistent-framework-2408.07287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abductive-reasoning-in-a-paraconsistent-framework-2408.07287"/></url>
<url><loc>https://scifaro.com/en/abs/physically-aware-synthesis-revisited-guiding-technology-mapping-with-primitive-logic-gate-placement-2408.07886</loc><lastmod>2024-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/physically-aware-synthesis-revisited-guiding-technology-mapping-with-primitive-logic-gate-placement-2408.07886"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/physically-aware-synthesis-revisited-guiding-technology-mapping-with-primitive-logic-gate-placement-2408.07886"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-expressivity-of-typed-concurrent-calculi-2408.07915</loc><lastmod>2024-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-expressivity-of-typed-concurrent-calculi-2408.07915"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-expressivity-of-typed-concurrent-calculi-2408.07915"/></url>
<url><loc>https://scifaro.com/en/abs/efficiently-grounding-fol-using-bit-vectors-2408.07980</loc><lastmod>2024-08-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficiently-grounding-fol-using-bit-vectors-2408.07980"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficiently-grounding-fol-using-bit-vectors-2408.07980"/></url>
<url><loc>https://scifaro.com/en/abs/derivatives-on-graphs-for-the-positive-calculus-of-relations-with-transitive-closure-2408.08236</loc><lastmod>2026-03-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/derivatives-on-graphs-for-the-positive-calculus-of-relations-with-transitive-closure-2408.08236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/derivatives-on-graphs-for-the-positive-calculus-of-relations-with-transitive-closure-2408.08236"/></url>
<url><loc>https://scifaro.com/en/abs/computational-complexity-of-standpoint-ltl-2408.08557</loc><lastmod>2024-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computational-complexity-of-standpoint-ltl-2408.08557"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computational-complexity-of-standpoint-ltl-2408.08557"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-automata-theoretic-approach-to-ltlf-modulo-theories-extended-version-2408.08817</loc><lastmod>2024-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-automata-theoretic-approach-to-ltlf-modulo-theories-extended-version-2408.08817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-automata-theoretic-approach-to-ltlf-modulo-theories-extended-version-2408.08817"/></url>
<url><loc>https://scifaro.com/en/abs/message-complexity-for-unary-multiautomata-systems-2408.09002</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/message-complexity-for-unary-multiautomata-systems-2408.09002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/message-complexity-for-unary-multiautomata-systems-2408.09002"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-for-policy-based-resource-exchanges-in-multiagent-systems-2408.09516</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-for-policy-based-resource-exchanges-in-multiagent-systems-2408.09516"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-for-policy-based-resource-exchanges-in-multiagent-systems-2408.09516"/></url>
<url><loc>https://scifaro.com/en/abs/l-ob-safe-logics-for-reflective-agents-2408.09590</loc><lastmod>2024-08-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/l-ob-safe-logics-for-reflective-agents-2408.09590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/l-ob-safe-logics-for-reflective-agents-2408.09590"/></url>
<url><loc>https://scifaro.com/en/abs/early-validation-of-high-level-system-requirements-with-event-calculus-and-answer-set-programming-2408.09909</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/early-validation-of-high-level-system-requirements-with-event-calculus-and-answer-set-programming-2408.09909"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/early-validation-of-high-level-system-requirements-with-event-calculus-and-answer-set-programming-2408.09909"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimilarity-for-processes-with-time-outs-2408.10117</loc><lastmod>2024-08-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimilarity-for-processes-with-time-outs-2408.10117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimilarity-for-processes-with-time-outs-2408.10117"/></url>
<url><loc>https://scifaro.com/en/abs/g-odel-incompleteness-theorem-for-pac-learnable-theory-from-the-view-of-complexity-measurement-2408.10211</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/g-odel-incompleteness-theorem-for-pac-learnable-theory-from-the-view-of-complexity-measurement-2408.10211"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/g-odel-incompleteness-theorem-for-pac-learnable-theory-from-the-view-of-complexity-measurement-2408.10211"/></url>
<url><loc>https://scifaro.com/en/abs/the-stable-model-semantics-for-higher-order-logic-programming-2408.10563</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-stable-model-semantics-for-higher-order-logic-programming-2408.10563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-stable-model-semantics-for-higher-order-logic-programming-2408.10563"/></url>
<url><loc>https://scifaro.com/en/abs/variations-on-distributed-belief-2408.10637</loc><lastmod>2024-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variations-on-distributed-belief-2408.10637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variations-on-distributed-belief-2408.10637"/></url>
<url><loc>https://scifaro.com/en/abs/proving-cutoff-bounds-for-safety-properties-in-first-order-logic-2408.10685</loc><lastmod>2024-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proving-cutoff-bounds-for-safety-properties-in-first-order-logic-2408.10685"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proving-cutoff-bounds-for-safety-properties-in-first-order-logic-2408.10685"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-equivalences-without-tears-2408.11501</loc><lastmod>2025-09-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-equivalences-without-tears-2408.11501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-equivalences-without-tears-2408.11501"/></url>
<url><loc>https://scifaro.com/en/abs/ctl-verification-and-synthesis-using-existential-horn-clauses-2408.11502</loc><lastmod>2026-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ctl-verification-and-synthesis-using-existential-horn-clauses-2408.11502"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ctl-verification-and-synthesis-using-existential-horn-clauses-2408.11502"/></url>
<url><loc>https://scifaro.com/en/abs/scalable-knowledge-refactoring-using-constrained-optimisation-2408.11530</loc><lastmod>2025-06-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/scalable-knowledge-refactoring-using-constrained-optimisation-2408.11530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/scalable-knowledge-refactoring-using-constrained-optimisation-2408.11530"/></url>
<url><loc>https://scifaro.com/en/abs/boolean-basis-formula-size-and-number-of-modal-operators-2408.11651</loc><lastmod>2025-07-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boolean-basis-formula-size-and-number-of-modal-operators-2408.11651"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boolean-basis-formula-size-and-number-of-modal-operators-2408.11651"/></url>
<url><loc>https://scifaro.com/en/abs/automating-semantic-analysis-of-system-assurance-cases-using-goal-directed-asp-2408.11699</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automating-semantic-analysis-of-system-assurance-cases-using-goal-directed-asp-2408.11699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automating-semantic-analysis-of-system-assurance-cases-using-goal-directed-asp-2408.11699"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-theoretic-perspective-on-higher-order-approximation-fixpoint-theory-2408.11712</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-theoretic-perspective-on-higher-order-approximation-fixpoint-theory-2408.11712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-theoretic-perspective-on-higher-order-approximation-fixpoint-theory-2408.11712"/></url>
<url><loc>https://scifaro.com/en/abs/the-bright-side-of-timed-opacity-2408.12240</loc><lastmod>2026-03-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-bright-side-of-timed-opacity-2408.12240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-bright-side-of-timed-opacity-2408.12240"/></url>
<url><loc>https://scifaro.com/en/abs/on-woolhouse-s-cotton-spinning-problem-2408.12623</loc><lastmod>2024-08-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-woolhouse-s-cotton-spinning-problem-2408.12623"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-woolhouse-s-cotton-spinning-problem-2408.12623"/></url>
<url><loc>https://scifaro.com/en/abs/input-based-three-valued-abstraction-refinement-2408.12668</loc><lastmod>2025-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/input-based-three-valued-abstraction-refinement-2408.12668"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/input-based-three-valued-abstraction-refinement-2408.12668"/></url>
<url><loc>https://scifaro.com/en/abs/an-overview-and-comparison-of-axiomatization-structures-regarding-inconsistency-indices-properties-in-pairwise-comparisons-methods-2408.13297</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-overview-and-comparison-of-axiomatization-structures-regarding-inconsistency-indices-properties-in-pairwise-comparisons-methods-2408.13297"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-overview-and-comparison-of-axiomatization-structures-regarding-inconsistency-indices-properties-in-pairwise-comparisons-methods-2408.13297"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automatic-linearization-via-smt-solving-2408.13487</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automatic-linearization-via-smt-solving-2408.13487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automatic-linearization-via-smt-solving-2408.13487"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-positive-equality-free-logic-on-a-fixed-structure-direttissima-2408.13840</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-positive-equality-free-logic-on-a-fixed-structure-direttissima-2408.13840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-positive-equality-free-logic-on-a-fixed-structure-direttissima-2408.13840"/></url>
<url><loc>https://scifaro.com/en/abs/logic-interpretations-of-ann-partition-cells-2408.14314</loc><lastmod>2024-08-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-interpretations-of-ann-partition-cells-2408.14314"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-interpretations-of-ann-partition-cells-2408.14314"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-ensemble-logic-2408.14443</loc><lastmod>2024-09-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-ensemble-logic-2408.14443"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-ensemble-logic-2408.14443"/></url>
<url><loc>https://scifaro.com/en/abs/non-deterministic-probabilistic-and-quantum-effects-through-the-lens-of-event-structures-technical-report-2408.14563</loc><lastmod>2025-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-deterministic-probabilistic-and-quantum-effects-through-the-lens-of-event-structures-technical-report-2408.14563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-deterministic-probabilistic-and-quantum-effects-through-the-lens-of-event-structures-technical-report-2408.14563"/></url>
<url><loc>https://scifaro.com/en/abs/instrumenting-transaction-trace-properties-in-smart-contracts-extending-the-evm-for-real-time-security-2408.14621</loc><lastmod>2024-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/instrumenting-transaction-trace-properties-in-smart-contracts-extending-the-evm-for-real-time-security-2408.14621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/instrumenting-transaction-trace-properties-in-smart-contracts-extending-the-evm-for-real-time-security-2408.14621"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatisation-of-equivalence-for-discrete-probabilistic-programming-2408.14701</loc><lastmod>2024-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatisation-of-equivalence-for-discrete-probabilistic-programming-2408.14701"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatisation-of-equivalence-for-discrete-probabilistic-programming-2408.14701"/></url>
<url><loc>https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-iterated-composition-2408.14999</loc><lastmod>2025-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-iterated-composition-2408.14999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-equational-theory-of-the-weihrauch-lattice-with-iterated-composition-2408.14999"/></url>
<url><loc>https://scifaro.com/en/abs/quantum-bisimilarity-is-a-congruence-under-physically-admissible-schedulers-2408.15087</loc><lastmod>2024-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantum-bisimilarity-is-a-congruence-under-physically-admissible-schedulers-2408.15087"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantum-bisimilarity-is-a-congruence-under-physically-admissible-schedulers-2408.15087"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-mason-stothers-theorem-and-its-corollaries-in-lean-4-2408.15180</loc><lastmod>2025-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-mason-stothers-theorem-and-its-corollaries-in-lean-4-2408.15180"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-mason-stothers-theorem-and-its-corollaries-in-lean-4-2408.15180"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-model-execution-and-deductive-verification-with-interaction-trees-in-isabelle-hol-2408.15817</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-model-execution-and-deductive-verification-with-interaction-trees-in-isabelle-hol-2408.15817"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-model-execution-and-deductive-verification-with-interaction-trees-in-isabelle-hol-2408.15817"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-monads-and-biproducts-a-uniform-interpretation-of-parallelism-in-intuitionistic-logic-2408.16102</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-monads-and-biproducts-a-uniform-interpretation-of-parallelism-in-intuitionistic-logic-2408.16102"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-monads-and-biproducts-a-uniform-interpretation-of-parallelism-in-intuitionistic-logic-2408.16102"/></url>
<url><loc>https://scifaro.com/en/abs/support-belief-decision-trust-2409.00666</loc><lastmod>2025-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/support-belief-decision-trust-2409.00666"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/support-belief-decision-trust-2409.00666"/></url>
<url><loc>https://scifaro.com/en/abs/the-adjacent-fragment-and-quine-s-limits-of-decision-2409.01231</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-adjacent-fragment-and-quine-s-limits-of-decision-2409.01231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-adjacent-fragment-and-quine-s-limits-of-decision-2409.01231"/></url>
<url><loc>https://scifaro.com/en/abs/the-category-of-well-filtered-dcpos-is-not-gamma-faithful-2409.01546</loc><lastmod>2024-09-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-category-of-well-filtered-dcpos-is-not-gamma-faithful-2409.01546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-category-of-well-filtered-dcpos-is-not-gamma-faithful-2409.01546"/></url>
<url><loc>https://scifaro.com/en/abs/query-answering-in-lattice-based-description-logic-2409.02289</loc><lastmod>2025-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/query-answering-in-lattice-based-description-logic-2409.02289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/query-answering-in-lattice-based-description-logic-2409.02289"/></url>
<url><loc>https://scifaro.com/en/abs/computation-and-concurrency-2409.02595</loc><lastmod>2026-04-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-and-concurrency-2409.02595"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-and-concurrency-2409.02595"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-inductive-and-coinductive-containers-2409.02603</loc><lastmod>2025-07-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-inductive-and-coinductive-containers-2409.02603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-inductive-and-coinductive-containers-2409.02603"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-the-synthesis-problem-for-hybrid-games-through-bisimulation-2409.05498</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-the-synthesis-problem-for-hybrid-games-through-bisimulation-2409.05498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-the-synthesis-problem-for-hybrid-games-through-bisimulation-2409.05498"/></url>
<url><loc>https://scifaro.com/en/abs/parf-adaptive-parameter-refining-for-abstract-interpretation-2409.05794</loc><lastmod>2024-09-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/parf-adaptive-parameter-refining-for-abstract-interpretation-2409.05794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/parf-adaptive-parameter-refining-for-abstract-interpretation-2409.05794"/></url>
<url><loc>https://scifaro.com/en/abs/delay-optimum-adder-circuits-with-linear-size-2409.06634</loc><lastmod>2024-09-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/delay-optimum-adder-circuits-with-linear-size-2409.06634"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/delay-optimum-adder-circuits-with-linear-size-2409.06634"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-expression-evaluation-under-interference-2409.07741</loc><lastmod>2025-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-expression-evaluation-under-interference-2409.07741"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-expression-evaluation-under-interference-2409.07741"/></url>
<url><loc>https://scifaro.com/en/abs/a-subset-sum-characterisation-of-the-a-hierarchy-2409.07996</loc><lastmod>2024-09-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-subset-sum-characterisation-of-the-a-hierarchy-2409.07996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-subset-sum-characterisation-of-the-a-hierarchy-2409.07996"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-many-valued-conditional-logics-a-preliminary-report-2409.09069</loc><lastmod>2024-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-many-valued-conditional-logics-a-preliminary-report-2409.09069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-many-valued-conditional-logics-a-preliminary-report-2409.09069"/></url>
<url><loc>https://scifaro.com/en/abs/effective-agm-belief-contraction-a-journey-beyond-the-finitary-realm-technical-report-2409.09171</loc><lastmod>2025-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effective-agm-belief-contraction-a-journey-beyond-the-finitary-realm-technical-report-2409.09171"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effective-agm-belief-contraction-a-journey-beyond-the-finitary-realm-technical-report-2409.09171"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-model-counting-via-knowledge-compilation-2409.10170</loc><lastmod>2024-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-model-counting-via-knowledge-compilation-2409.10170"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-model-counting-via-knowledge-compilation-2409.10170"/></url>
<url><loc>https://scifaro.com/en/abs/computation-and-complexity-of-preference-inference-based-on-hierarchical-models-2409.11044</loc><lastmod>2024-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computation-and-complexity-of-preference-inference-based-on-hierarchical-models-2409.11044"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computation-and-complexity-of-preference-inference-based-on-hierarchical-models-2409.11044"/></url>
<url><loc>https://scifaro.com/en/abs/denotational-semantics-driven-simplicial-homology-2409.11566</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/denotational-semantics-driven-simplicial-homology-2409.11566"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/denotational-semantics-driven-simplicial-homology-2409.11566"/></url>
<url><loc>https://scifaro.com/en/abs/stability-property-for-the-call-by-value-lambda-calculus-through-taylor-expansion-2409.11572</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stability-property-for-the-call-by-value-lambda-calculus-through-taylor-expansion-2409.11572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stability-property-for-the-call-by-value-lambda-calculus-through-taylor-expansion-2409.11572"/></url>
<url><loc>https://scifaro.com/en/abs/resource-approximation-for-the-lambda-mu-calculus-2409.11587</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/resource-approximation-for-the-lambda-mu-calculus-2409.11587"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/resource-approximation-for-the-lambda-mu-calculus-2409.11587"/></url>
<url><loc>https://scifaro.com/en/abs/an-imperative-language-for-verified-exact-real-number-computation-2409.11946</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-imperative-language-for-verified-exact-real-number-computation-2409.11946"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-imperative-language-for-verified-exact-real-number-computation-2409.11946"/></url>
<url><loc>https://scifaro.com/en/abs/on-randomized-computational-models-and-complexity-classes-a-historical-overview-2409.11999</loc><lastmod>2024-09-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-randomized-computational-models-and-complexity-classes-a-historical-overview-2409.11999"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-randomized-computational-models-and-complexity-classes-a-historical-overview-2409.11999"/></url>
<url><loc>https://scifaro.com/en/abs/toward-a-formalization-of-artifacts-in-gfo-2409.13452</loc><lastmod>2024-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/toward-a-formalization-of-artifacts-in-gfo-2409.13452"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/toward-a-formalization-of-artifacts-in-gfo-2409.13452"/></url>
<url><loc>https://scifaro.com/en/abs/non-cartesian-guarded-recursion-with-daggers-2409.14591</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-cartesian-guarded-recursion-with-daggers-2409.14591"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-cartesian-guarded-recursion-with-daggers-2409.14591"/></url>
<url><loc>https://scifaro.com/en/abs/syntax-and-semantics-of-multi-adjoint-normal-logic-programming-2409.14901</loc><lastmod>2024-09-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntax-and-semantics-of-multi-adjoint-normal-logic-programming-2409.14901"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntax-and-semantics-of-multi-adjoint-normal-logic-programming-2409.14901"/></url>
<url><loc>https://scifaro.com/en/abs/space-time-process-algebra-with-asynchronous-communication-2409.15120</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/space-time-process-algebra-with-asynchronous-communication-2409.15120"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/space-time-process-algebra-with-asynchronous-communication-2409.15120"/></url>
<url><loc>https://scifaro.com/en/abs/an-adequacy-theorem-between-mixed-powerdomains-and-probabilistic-concurrency-extended-version-2409.15920</loc><lastmod>2025-09-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-adequacy-theorem-between-mixed-powerdomains-and-probabilistic-concurrency-extended-version-2409.15920"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-adequacy-theorem-between-mixed-powerdomains-and-probabilistic-concurrency-extended-version-2409.15920"/></url>
<url><loc>https://scifaro.com/en/abs/comodule-representations-of-second-order-functionals-2409.17664</loc><lastmod>2025-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/comodule-representations-of-second-order-functionals-2409.17664"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/comodule-representations-of-second-order-functionals-2409.17664"/></url>
<url><loc>https://scifaro.com/en/abs/from-innermost-to-full-probabilistic-term-rewriting-almost-sure-termination-complexity-and-modularity-2409.17714</loc><lastmod>2025-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-innermost-to-full-probabilistic-term-rewriting-almost-sure-termination-complexity-and-modularity-2409.17714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-innermost-to-full-probabilistic-term-rewriting-almost-sure-termination-complexity-and-modularity-2409.17714"/></url>
<url><loc>https://scifaro.com/en/abs/certifying-rings-of-integers-in-number-fields-2409.18030</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certifying-rings-of-integers-in-number-fields-2409.18030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certifying-rings-of-integers-in-number-fields-2409.18030"/></url>
<url><loc>https://scifaro.com/en/abs/synchronous-team-semantics-for-temporal-logics-2409.18667</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synchronous-team-semantics-for-temporal-logics-2409.18667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synchronous-team-semantics-for-temporal-logics-2409.18667"/></url>
<url><loc>https://scifaro.com/en/abs/beyond-decisiveness-of-infinite-markov-chains-2409.18670</loc><lastmod>2024-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/beyond-decisiveness-of-infinite-markov-chains-2409.18670"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/beyond-decisiveness-of-infinite-markov-chains-2409.18670"/></url>
<url><loc>https://scifaro.com/en/abs/interaction-equivalence-2409.18709</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/interaction-equivalence-2409.18709"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/interaction-equivalence-2409.18709"/></url>
<url><loc>https://scifaro.com/en/abs/polynomial-universes-in-homotopy-type-theory-2409.19176</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polynomial-universes-in-homotopy-type-theory-2409.19176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polynomial-universes-in-homotopy-type-theory-2409.19176"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-developments-in-computational-models-2409.19298</loc><lastmod>2024-10-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-developments-in-computational-models-2409.19298"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-13th-international-workshop-on-developments-in-computational-models-2409.19298"/></url>
<url><loc>https://scifaro.com/en/abs/the-vanilla-sequent-calculus-is-call-by-value-fresh-perspective-2409.19722</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-vanilla-sequent-calculus-is-call-by-value-fresh-perspective-2409.19722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-vanilla-sequent-calculus-is-call-by-value-fresh-perspective-2409.19722"/></url>
<url><loc>https://scifaro.com/en/abs/conway-normal-form-bridging-approaches-for-comprehensive-formalization-of-surreal-numbers-2410.00065</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conway-normal-form-bridging-approaches-for-comprehensive-formalization-of-surreal-numbers-2410.00065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conway-normal-form-bridging-approaches-for-comprehensive-formalization-of-surreal-numbers-2410.00065"/></url>
<url><loc>https://scifaro.com/en/abs/partial-typing-for-asynchronous-multiparty-sessions-2410.00537</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-typing-for-asynchronous-multiparty-sessions-2410.00537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-typing-for-asynchronous-multiparty-sessions-2410.00537"/></url>
<url><loc>https://scifaro.com/en/abs/from-compactifying-lambda-letrec-terms-to-recognizing-regular-expression-processes-2410.00538</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-compactifying-lambda-letrec-terms-to-recognizing-regular-expression-processes-2410.00538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-compactifying-lambda-letrec-terms-to-recognizing-regular-expression-processes-2410.00538"/></url>
<url><loc>https://scifaro.com/en/abs/when-do-you-start-counting-revisiting-counting-and-pnueli-modalities-in-timed-logics-2410.00539</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-do-you-start-counting-revisiting-counting-and-pnueli-modalities-in-timed-logics-2410.00539"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-do-you-start-counting-revisiting-counting-and-pnueli-modalities-in-timed-logics-2410.00539"/></url>
<url><loc>https://scifaro.com/en/abs/random-graph-generation-in-context-free-graph-languages-2410.00541</loc><lastmod>2024-10-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-graph-generation-in-context-free-graph-languages-2410.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-graph-generation-in-context-free-graph-languages-2410.00541"/></url>
<url><loc>https://scifaro.com/en/abs/disconnection-rules-are-complete-for-chemical-reactions-2410.01421</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disconnection-rules-are-complete-for-chemical-reactions-2410.01421"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disconnection-rules-are-complete-for-chemical-reactions-2410.01421"/></url>
<url><loc>https://scifaro.com/en/abs/finite-element-method-detailed-proofs-to-be-formalized-in-coq-2410.01538</loc><lastmod>2024-10-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-element-method-detailed-proofs-to-be-formalized-in-coq-2410.01538"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-element-method-detailed-proofs-to-be-formalized-in-coq-2410.01538"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-mltl-formula-progression-in-isabelle-hol-2410.03465</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-mltl-formula-progression-in-isabelle-hol-2410.03465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-mltl-formula-progression-in-isabelle-hol-2410.03465"/></url>
<url><loc>https://scifaro.com/en/abs/a-diagrammatic-algebra-for-program-logics-2410.03561</loc><lastmod>2024-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-diagrammatic-algebra-for-program-logics-2410.03561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-diagrammatic-algebra-for-program-logics-2410.03561"/></url>
<url><loc>https://scifaro.com/en/abs/non-monotonic-extensions-to-formal-concept-analysis-via-object-preferences-2410.04184</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-monotonic-extensions-to-formal-concept-analysis-via-object-preferences-2410.04184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-monotonic-extensions-to-formal-concept-analysis-via-object-preferences-2410.04184"/></url>
<url><loc>https://scifaro.com/en/abs/extended-multi-adjoint-logic-programming-2410.04794</loc><lastmod>2024-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/extended-multi-adjoint-logic-programming-2410.04794"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/extended-multi-adjoint-logic-programming-2410.04794"/></url>
<url><loc>https://scifaro.com/en/abs/deciding-subspace-reachability-problems-with-application-to-skolem-s-problem-2410.06528</loc><lastmod>2025-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deciding-subspace-reachability-problems-with-application-to-skolem-s-problem-2410.06528"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deciding-subspace-reachability-problems-with-application-to-skolem-s-problem-2410.06528"/></url>
<url><loc>https://scifaro.com/en/abs/unary-counting-quantifiers-do-not-increase-the-expressive-power-of-presburger-aritmetic-an-alternative-shorter-proof-2410.06822</loc><lastmod>2024-10-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unary-counting-quantifiers-do-not-increase-the-expressive-power-of-presburger-aritmetic-an-alternative-shorter-proof-2410.06822"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unary-counting-quantifiers-do-not-increase-the-expressive-power-of-presburger-aritmetic-an-alternative-shorter-proof-2410.06822"/></url>
<url><loc>https://scifaro.com/en/abs/experiments-with-choice-in-dependently-typed-higher-order-logic-2410.08874</loc><lastmod>2024-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/experiments-with-choice-in-dependently-typed-higher-order-logic-2410.08874"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/experiments-with-choice-in-dependently-typed-higher-order-logic-2410.08874"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-monoidal-algebra-axiomatising-distance-with-string-diagrams-2410.09229</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-monoidal-algebra-axiomatising-distance-with-string-diagrams-2410.09229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-monoidal-algebra-axiomatising-distance-with-string-diagrams-2410.09229"/></url>
<url><loc>https://scifaro.com/en/abs/hybrid-modal-operators-for-definite-descriptions-2410.10439</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/hybrid-modal-operators-for-definite-descriptions-2410.10439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/hybrid-modal-operators-for-definite-descriptions-2410.10439"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-shielding-and-reinforcement-learning-for-multi-agent-systems-2410.10460</loc><lastmod>2025-06-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-shielding-and-reinforcement-learning-for-multi-agent-systems-2410.10460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-shielding-and-reinforcement-learning-for-multi-agent-systems-2410.10460"/></url>
<url><loc>https://scifaro.com/en/abs/effectful-mealy-machines-2410.10627</loc><lastmod>2025-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/effectful-mealy-machines-2410.10627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/effectful-mealy-machines-2410.10627"/></url>
<url><loc>https://scifaro.com/en/abs/a-simple-formal-language-for-probabilistic-decision-problems-2410.10643</loc><lastmod>2025-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-simple-formal-language-for-probabilistic-decision-problems-2410.10643"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-simple-formal-language-for-probabilistic-decision-problems-2410.10643"/></url>
<url><loc>https://scifaro.com/en/abs/exact-exploration-2410.10706</loc><lastmod>2024-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exact-exploration-2410.10706"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exact-exploration-2410.10706"/></url>
<url><loc>https://scifaro.com/en/abs/the-qualitative-collapse-of-concurrent-games-2410.11389</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-qualitative-collapse-of-concurrent-games-2410.11389"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-qualitative-collapse-of-concurrent-games-2410.11389"/></url>
<url><loc>https://scifaro.com/en/abs/normalisation-for-negative-free-logics-without-and-with-definite-descriptions-2410.11445</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normalisation-for-negative-free-logics-without-and-with-definite-descriptions-2410.11445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normalisation-for-negative-free-logics-without-and-with-definite-descriptions-2410.11445"/></url>
<url><loc>https://scifaro.com/en/abs/temporal-hyperproperties-for-population-protocols-2410.11572</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/temporal-hyperproperties-for-population-protocols-2410.11572"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/temporal-hyperproperties-for-population-protocols-2410.11572"/></url>
<url><loc>https://scifaro.com/en/abs/complementation-of-emerson-lei-automata-technical-report-2410.11644</loc><lastmod>2024-10-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complementation-of-emerson-lei-automata-technical-report-2410.11644"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complementation-of-emerson-lei-automata-technical-report-2410.11644"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-aristotelian-diagrams-2410.11740</loc><lastmod>2025-07-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-aristotelian-diagrams-2410.11740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-aristotelian-diagrams-2410.11740"/></url>
<url><loc>https://scifaro.com/en/abs/random-expansions-of-trees-with-bounded-height-2410.11775</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/random-expansions-of-trees-with-bounded-height-2410.11775"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/random-expansions-of-trees-with-bounded-height-2410.11775"/></url>
<url><loc>https://scifaro.com/en/abs/sound-conflict-analysis-for-timed-contract-automata-2410.12585</loc><lastmod>2024-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-conflict-analysis-for-timed-contract-automata-2410.12585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-conflict-analysis-for-timed-contract-automata-2410.12585"/></url>
<url><loc>https://scifaro.com/en/abs/verification-of-linear-dynamical-systems-via-o-minimality-of-the-real-numbers-2410.13053</loc><lastmod>2025-12-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-of-linear-dynamical-systems-via-o-minimality-of-the-real-numbers-2410.13053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-of-linear-dynamical-systems-via-o-minimality-of-the-real-numbers-2410.13053"/></url>
<url><loc>https://scifaro.com/en/abs/on-quantum-programming-languages-2410.13337</loc><lastmod>2024-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-quantum-programming-languages-2410.13337"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-quantum-programming-languages-2410.13337"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-hyperspaces-and-operations-on-subsets-of-polish-spaces-over-abstract-exact-real-numbers-2410.13508</loc><lastmod>2024-10-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-hyperspaces-and-operations-on-subsets-of-polish-spaces-over-abstract-exact-real-numbers-2410.13508"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-hyperspaces-and-operations-on-subsets-of-polish-spaces-over-abstract-exact-real-numbers-2410.13508"/></url>
<url><loc>https://scifaro.com/en/abs/axiomatization-of-compact-initial-value-problems-open-properties-2410.13836</loc><lastmod>2025-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/axiomatization-of-compact-initial-value-problems-open-properties-2410.13836"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/axiomatization-of-compact-initial-value-problems-open-properties-2410.13836"/></url>
<url><loc>https://scifaro.com/en/abs/tableaux-for-automated-reasoning-in-dependently-typed-higher-order-logic-extended-version-2410.14232</loc><lastmod>2024-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tableaux-for-automated-reasoning-in-dependently-typed-higher-order-logic-extended-version-2410.14232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tableaux-for-automated-reasoning-in-dependently-typed-higher-order-logic-extended-version-2410.14232"/></url>
<url><loc>https://scifaro.com/en/abs/identity-preserving-lax-extensions-and-where-to-find-them-2410.14440</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/identity-preserving-lax-extensions-and-where-to-find-them-2410.14440"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/identity-preserving-lax-extensions-and-where-to-find-them-2410.14440"/></url>
<url><loc>https://scifaro.com/en/abs/relational-connectors-and-heterogeneous-bisimulations-2410.14460</loc><lastmod>2025-02-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relational-connectors-and-heterogeneous-bisimulations-2410.14460"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relational-connectors-and-heterogeneous-bisimulations-2410.14460"/></url>
<url><loc>https://scifaro.com/en/abs/dependence-and-independence-for-reversible-process-calculi-2410.14699</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dependence-and-independence-for-reversible-process-calculi-2410.14699"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dependence-and-independence-for-reversible-process-calculi-2410.14699"/></url>
<url><loc>https://scifaro.com/en/abs/abstracting-situation-calculus-action-theories-2410.14712</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abstracting-situation-calculus-action-theories-2410.14712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abstracting-situation-calculus-action-theories-2410.14712"/></url>
<url><loc>https://scifaro.com/en/abs/brownian-motion-in-isabelle-hol-2410.14718</loc><lastmod>2024-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/brownian-motion-in-isabelle-hol-2410.14718"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/brownian-motion-in-isabelle-hol-2410.14718"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-differential-privacy-in-isabelle-hol-2410.15386</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-differential-privacy-in-isabelle-hol-2410.15386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-differential-privacy-in-isabelle-hol-2410.15386"/></url>
<url><loc>https://scifaro.com/en/abs/symmetries-of-dependency-quantified-boolean-formulas-2410.15848</loc><lastmod>2025-08-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetries-of-dependency-quantified-boolean-formulas-2410.15848"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetries-of-dependency-quantified-boolean-formulas-2410.15848"/></url>
<url><loc>https://scifaro.com/en/abs/pantograph-a-machine-to-machine-interaction-interface-for-advanced-theorem-proving-high-level-reasoning-and-data-extraction-in-lean-4-2410.16429</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pantograph-a-machine-to-machine-interaction-interface-for-advanced-theorem-proving-high-level-reasoning-and-data-extraction-in-lean-4-2410.16429"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pantograph-a-machine-to-machine-interaction-interface-for-advanced-theorem-proving-high-level-reasoning-and-data-extraction-in-lean-4-2410.16429"/></url>
<url><loc>https://scifaro.com/en/abs/the-decision-problem-for-regular-first-order-theories-2410.17185</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-decision-problem-for-regular-first-order-theories-2410.17185"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-decision-problem-for-regular-first-order-theories-2410.17185"/></url>
<url><loc>https://scifaro.com/en/abs/simply-typed-constant-domain-modal-lambda-calculus-i-distanced-beta-reduction-and-combinatory-logic-2410.17463</loc><lastmod>2025-10-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simply-typed-constant-domain-modal-lambda-calculus-i-distanced-beta-reduction-and-combinatory-logic-2410.17463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simply-typed-constant-domain-modal-lambda-calculus-i-distanced-beta-reduction-and-combinatory-logic-2410.17463"/></url>
<url><loc>https://scifaro.com/en/abs/internship-report-coherent-differentiation-in-models-of-linear-logic-2410.17743</loc><lastmod>2024-10-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internship-report-coherent-differentiation-in-models-of-linear-logic-2410.17743"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internship-report-coherent-differentiation-in-models-of-linear-logic-2410.17743"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-quantum-circuits-with-level-synchronized-tree-automata-technical-report-2410.18540</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-quantum-circuits-with-level-synchronized-tree-automata-technical-report-2410.18540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-quantum-circuits-with-level-synchronized-tree-automata-technical-report-2410.18540"/></url>
<url><loc>https://scifaro.com/en/abs/disjoint-projected-enumeration-for-sat-and-smt-without-blocking-clauses-2410.18707</loc><lastmod>2026-05-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/disjoint-projected-enumeration-for-sat-and-smt-without-blocking-clauses-2410.18707"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/disjoint-projected-enumeration-for-sat-and-smt-without-blocking-clauses-2410.18707"/></url>
<url><loc>https://scifaro.com/en/abs/double-auctions-formalization-and-automated-checkers-2410.18751</loc><lastmod>2024-10-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/double-auctions-formalization-and-automated-checkers-2410.18751"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/double-auctions-formalization-and-automated-checkers-2410.18751"/></url>
<url><loc>https://scifaro.com/en/abs/arbitrary-arity-tree-automata-and-qctl-2410.18799</loc><lastmod>2026-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/arbitrary-arity-tree-automata-and-qctl-2410.18799"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/arbitrary-arity-tree-automata-and-qctl-2410.18799"/></url>
<url><loc>https://scifaro.com/en/abs/cobblestone-a-divide-and-conquer-approach-for-automating-formal-verification-2410.19940</loc><lastmod>2026-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cobblestone-a-divide-and-conquer-approach-for-automating-formal-verification-2410.19940"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cobblestone-a-divide-and-conquer-approach-for-automating-formal-verification-2410.19940"/></url>
<url><loc>https://scifaro.com/en/abs/soundness-correction-of-data-petri-nets-2410.21188</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/soundness-correction-of-data-petri-nets-2410.21188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/soundness-correction-of-data-petri-nets-2410.21188"/></url>
<url><loc>https://scifaro.com/en/abs/policies-for-fair-exchanges-of-resources-2410.21214</loc><lastmod>2026-02-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/policies-for-fair-exchanges-of-resources-2410.21214"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/policies-for-fair-exchanges-of-resources-2410.21214"/></url>
<url><loc>https://scifaro.com/en/abs/proto-quipper-with-reversing-and-control-2410.22261</loc><lastmod>2025-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proto-quipper-with-reversing-and-control-2410.22261"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proto-quipper-with-reversing-and-control-2410.22261"/></url>
<url><loc>https://scifaro.com/en/abs/towards-smt-solver-stability-via-input-normalization-2410.22419</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-smt-solver-stability-via-input-normalization-2410.22419"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-smt-solver-stability-via-input-normalization-2410.22419"/></url>
<url><loc>https://scifaro.com/en/abs/a-demonic-outcome-logic-for-randomized-nondeterminism-2410.22540</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-demonic-outcome-logic-for-randomized-nondeterminism-2410.22540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-demonic-outcome-logic-for-randomized-nondeterminism-2410.22540"/></url>
<url><loc>https://scifaro.com/en/abs/reactive-synthesis-for-expected-impacts-2410.22760</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reactive-synthesis-for-expected-impacts-2410.22760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reactive-synthesis-for-expected-impacts-2410.22760"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-skills-logical-dynamics-of-knowing-and-forgetting-2410.22763</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-skills-logical-dynamics-of-knowing-and-forgetting-2410.22763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-skills-logical-dynamics-of-knowing-and-forgetting-2410.22763"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-eighth-symposium-on-working-formal-methods-2410.23020</loc><lastmod>2024-10-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-eighth-symposium-on-working-formal-methods-2410.23020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-eighth-symposium-on-working-formal-methods-2410.23020"/></url>
<url><loc>https://scifaro.com/en/abs/converting-bpmn-diagrams-to-privacy-calculus-2410.23759</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/converting-bpmn-diagrams-to-privacy-calculus-2410.23759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/converting-bpmn-diagrams-to-privacy-calculus-2410.23759"/></url>
<url><loc>https://scifaro.com/en/abs/unification-in-matching-logic-revisited-2410.23760</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unification-in-matching-logic-revisited-2410.23760"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unification-in-matching-logic-revisited-2410.23760"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-propositional-logic-in-lean-2410.23765</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-propositional-logic-in-lean-2410.23765"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-propositional-logic-in-lean-2410.23765"/></url>
<url><loc>https://scifaro.com/en/abs/leveraging-slither-and-interval-analysis-to-build-a-static-analysis-tool-2410.23766</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/leveraging-slither-and-interval-analysis-to-build-a-static-analysis-tool-2410.23766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/leveraging-slither-and-interval-analysis-to-build-a-static-analysis-tool-2410.23766"/></url>
<url><loc>https://scifaro.com/en/abs/neural-model-checking-2410.23790</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/neural-model-checking-2410.23790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/neural-model-checking-2410.23790"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-inference-and-computation-of-optimal-alternatives-for-preference-languages-based-on-lexicographic-models-2410.23913</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-inference-and-computation-of-optimal-alternatives-for-preference-languages-based-on-lexicographic-models-2410.23913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-inference-and-computation-of-optimal-alternatives-for-preference-languages-based-on-lexicographic-models-2410.23913"/></url>
<url><loc>https://scifaro.com/en/abs/towards-fast-algorithms-for-the-preference-consistency-problem-based-on-hierarchical-models-2410.23934</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-fast-algorithms-for-the-preference-consistency-problem-based-on-hierarchical-models-2410.23934"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-fast-algorithms-for-the-preference-consistency-problem-based-on-hierarchical-models-2410.23934"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-system-for-data-flow-and-alias-analysis-in-rescript-2410.23984</loc><lastmod>2024-11-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-system-for-data-flow-and-alias-analysis-in-rescript-2410.23984"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-system-for-data-flow-and-alias-analysis-in-rescript-2410.23984"/></url>
<url><loc>https://scifaro.com/en/abs/unifying-sequent-systems-for-g-odel-l-ob-provability-logic-via-syntactic-transformations-2410.24053</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unifying-sequent-systems-for-g-odel-l-ob-provability-logic-via-syntactic-transformations-2410.24053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unifying-sequent-systems-for-g-odel-l-ob-provability-logic-via-syntactic-transformations-2410.24053"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-obstruction-temporal-logic-a-probabilistic-logic-to-reason-about-dynamic-models-2411.00025</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-obstruction-temporal-logic-a-probabilistic-logic-to-reason-about-dynamic-models-2411.00025"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-obstruction-temporal-logic-a-probabilistic-logic-to-reason-about-dynamic-models-2411.00025"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-assumptions-ordering-in-car-based-model-checking-2411.00026</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-assumptions-ordering-in-car-based-model-checking-2411.00026"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-assumptions-ordering-in-car-based-model-checking-2411.00026"/></url>
<url><loc>https://scifaro.com/en/abs/a-theoretical-review-on-solving-algebra-problems-2411.00031</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-theoretical-review-on-solving-algebra-problems-2411.00031"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-theoretical-review-on-solving-algebra-problems-2411.00031"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2411.00048</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2411.00048"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2411.00048"/></url>
<url><loc>https://scifaro.com/en/abs/openness-and-partial-adjacency-in-one-variable-tptl-2411.00117</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/openness-and-partial-adjacency-in-one-variable-tptl-2411.00117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/openness-and-partial-adjacency-in-one-variable-tptl-2411.00117"/></url>
<url><loc>https://scifaro.com/en/abs/a-symbolic-representation-of-object-nets-extended-version-2411.00149</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-symbolic-representation-of-object-nets-extended-version-2411.00149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-symbolic-representation-of-object-nets-extended-version-2411.00149"/></url>
<url><loc>https://scifaro.com/en/abs/total-outcome-logic-unified-reasoning-for-a-taxonomy-of-program-logics-2411.00197</loc><lastmod>2025-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/total-outcome-logic-unified-reasoning-for-a-taxonomy-of-program-logics-2411.00197"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/total-outcome-logic-unified-reasoning-for-a-taxonomy-of-program-logics-2411.00197"/></url>
<url><loc>https://scifaro.com/en/abs/sound-statistical-model-checking-for-probabilities-and-expected-rewards-extended-version-2411.00559</loc><lastmod>2025-09-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-statistical-model-checking-for-probabilities-and-expected-rewards-extended-version-2411.00559"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-statistical-model-checking-for-probabilities-and-expected-rewards-extended-version-2411.00559"/></url>
<url><loc>https://scifaro.com/en/abs/early-announcement-parametricity-for-gadts-2411.00589</loc><lastmod>2024-11-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/early-announcement-parametricity-for-gadts-2411.00589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/early-announcement-parametricity-for-gadts-2411.00589"/></url>
<url><loc>https://scifaro.com/en/abs/reachability-and-safety-games-under-tso-semantics-2411.00847</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reachability-and-safety-games-under-tso-semantics-2411.00847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reachability-and-safety-games-under-tso-semantics-2411.00847"/></url>
<url><loc>https://scifaro.com/en/abs/learning-rules-explaining-interactive-theorem-proving-tactic-prediction-2411.01188</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-rules-explaining-interactive-theorem-proving-tactic-prediction-2411.01188"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-rules-explaining-interactive-theorem-proving-tactic-prediction-2411.01188"/></url>
<url><loc>https://scifaro.com/en/abs/thoughts-on-sub-turing-interactive-computability-2411.01393</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/thoughts-on-sub-turing-interactive-computability-2411.01393"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/thoughts-on-sub-turing-interactive-computability-2411.01393"/></url>
<url><loc>https://scifaro.com/en/abs/on-smt-theory-design-the-case-of-sequences-2411.01961</loc><lastmod>2024-11-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-smt-theory-design-the-case-of-sequences-2411.01961"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-smt-theory-design-the-case-of-sequences-2411.01961"/></url>
<url><loc>https://scifaro.com/en/abs/relating-apartness-and-branching-bisimulation-games-2411.02977</loc><lastmod>2024-11-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-apartness-and-branching-bisimulation-games-2411.02977"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-apartness-and-branching-bisimulation-games-2411.02977"/></url>
<url><loc>https://scifaro.com/en/abs/conformance-games-for-graded-semantics-2411.03069</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/conformance-games-for-graded-semantics-2411.03069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/conformance-games-for-graded-semantics-2411.03069"/></url>
<url><loc>https://scifaro.com/en/abs/learning-aggregate-queries-defined-by-first-order-logic-with-counting-2411.04003</loc><lastmod>2024-11-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/learning-aggregate-queries-defined-by-first-order-logic-with-counting-2411.04003"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/learning-aggregate-queries-defined-by-first-order-logic-with-counting-2411.04003"/></url>
<url><loc>https://scifaro.com/en/abs/the-functional-machine-calculus-iii-choice-early-announcement-2411.04615</loc><lastmod>2024-11-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-functional-machine-calculus-iii-choice-early-announcement-2411.04615"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-functional-machine-calculus-iii-choice-early-announcement-2411.04615"/></url>
<url><loc>https://scifaro.com/en/abs/on-decidable-and-undecidable-extensions-of-simply-typed-lambda-calculus-2411.06086</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-decidable-and-undecidable-extensions-of-simply-typed-lambda-calculus-2411.06086"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-decidable-and-undecidable-extensions-of-simply-typed-lambda-calculus-2411.06086"/></url>
<url><loc>https://scifaro.com/en/abs/automated-strategy-invention-for-confluence-of-term-rewrite-systems-2411.06409</loc><lastmod>2025-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-strategy-invention-for-confluence-of-term-rewrite-systems-2411.06409"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-strategy-invention-for-confluence-of-term-rewrite-systems-2411.06409"/></url>
<url><loc>https://scifaro.com/en/abs/finite-variable-counting-logics-with-restricted-requantification-2411.06944</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/finite-variable-counting-logics-with-restricted-requantification-2411.06944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/finite-variable-counting-logics-with-restricted-requantification-2411.06944"/></url>
<url><loc>https://scifaro.com/en/abs/translation-of-temporal-logic-for-efficient-infinite-state-reactive-synthesis-full-version-2411.07078</loc><lastmod>2024-11-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translation-of-temporal-logic-for-efficient-infinite-state-reactive-synthesis-full-version-2411.07078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translation-of-temporal-logic-for-efficient-infinite-state-reactive-synthesis-full-version-2411.07078"/></url>
<url><loc>https://scifaro.com/en/abs/continuous-domains-for-function-spaces-using-spectral-compactification-2411.07431</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/continuous-domains-for-function-spaces-using-spectral-compactification-2411.07431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/continuous-domains-for-function-spaces-using-spectral-compactification-2411.07431"/></url>
<url><loc>https://scifaro.com/en/abs/an-smt-theory-for-n-indexed-sequences-2411.07665</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-smt-theory-for-n-indexed-sequences-2411.07665"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-smt-theory-for-n-indexed-sequences-2411.07665"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-physics-index-notation-in-lean-4-2411.07667</loc><lastmod>2024-11-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-physics-index-notation-in-lean-4-2411.07667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-physics-index-notation-in-lean-4-2411.07667"/></url>
<url><loc>https://scifaro.com/en/abs/typed-non-determinism-in-concurrent-calculi-the-eager-way-2411.07714</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/typed-non-determinism-in-concurrent-calculi-the-eager-way-2411.07714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/typed-non-determinism-in-concurrent-calculi-the-eager-way-2411.07714"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-with-privacy-against-an-observer-2411.08635</loc><lastmod>2025-08-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-with-privacy-against-an-observer-2411.08635"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-with-privacy-against-an-observer-2411.08635"/></url>
<url><loc>https://scifaro.com/en/abs/on-kleisli-liftings-and-decorated-trace-semantics-2411.08770</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-kleisli-liftings-and-decorated-trace-semantics-2411.08770"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-kleisli-liftings-and-decorated-trace-semantics-2411.08770"/></url>
<url><loc>https://scifaro.com/en/abs/proofs-as-execution-trees-for-the-pi-calculus-2411.08847</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofs-as-execution-trees-for-the-pi-calculus-2411.08847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofs-as-execution-trees-for-the-pi-calculus-2411.08847"/></url>
<url><loc>https://scifaro.com/en/abs/autoq-2-0-from-verification-of-quantum-circuits-to-verification-of-quantum-programs-technical-report-2411.09121</loc><lastmod>2026-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autoq-2-0-from-verification-of-quantum-circuits-to-verification-of-quantum-programs-technical-report-2411.09121"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autoq-2-0-from-verification-of-quantum-circuits-to-verification-of-quantum-programs-technical-report-2411.09121"/></url>
<url><loc>https://scifaro.com/en/abs/ltlf-and-ppltl-extending-ltlf-and-ppltl-to-infinite-traces-2411.09366</loc><lastmod>2024-11-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltlf-and-ppltl-extending-ltlf-and-ppltl-to-infinite-traces-2411.09366"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltlf-and-ppltl-extending-ltlf-and-ppltl-to-infinite-traces-2411.09366"/></url>
<url><loc>https://scifaro.com/en/abs/positive-focusing-is-directly-useful-2411.09489</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-focusing-is-directly-useful-2411.09489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-focusing-is-directly-useful-2411.09489"/></url>
<url><loc>https://scifaro.com/en/abs/mcac-a-model-counting-algorithm-for-exact-computation-of-error-metrics-of-approximate-circuits-2411.10037</loc><lastmod>2026-05-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/mcac-a-model-counting-algorithm-for-exact-computation-of-error-metrics-of-approximate-circuits-2411.10037"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/mcac-a-model-counting-algorithm-for-exact-computation-of-error-metrics-of-approximate-circuits-2411.10037"/></url>
<url><loc>https://scifaro.com/en/abs/optimally-rewriting-formulas-and-database-queries-a-confluence-of-term-rewriting-structural-decomposition-and-complexity-2411.10229</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/optimally-rewriting-formulas-and-database-queries-a-confluence-of-term-rewriting-structural-decomposition-and-complexity-2411.10229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/optimally-rewriting-formulas-and-database-queries-a-confluence-of-term-rewriting-structural-decomposition-and-complexity-2411.10229"/></url>
<url><loc>https://scifaro.com/en/abs/weak-permission-is-not-well-founded-grounded-and-stable-2411.10624</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-permission-is-not-well-founded-grounded-and-stable-2411.10624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-permission-is-not-well-founded-grounded-and-stable-2411.10624"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-nets-within-nets-2411.10826</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-nets-within-nets-2411.10826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-nets-within-nets-2411.10826"/></url>
<url><loc>https://scifaro.com/en/abs/calculational-design-of-hyperlogics-by-abstract-interpretation-2411.11113</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/calculational-design-of-hyperlogics-by-abstract-interpretation-2411.11113"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/calculational-design-of-hyperlogics-by-abstract-interpretation-2411.11113"/></url>
<url><loc>https://scifaro.com/en/abs/weak-simplicial-bisimilarity-and-minimisation-for-polyhedral-model-checking-2411.11428</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weak-simplicial-bisimilarity-and-minimisation-for-polyhedral-model-checking-2411.11428"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weak-simplicial-bisimilarity-and-minimisation-for-polyhedral-model-checking-2411.11428"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-concurrent-reasoning-in-outcome-logic-independence-conditioning-and-invariants-2411.11662</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-concurrent-reasoning-in-outcome-logic-independence-conditioning-and-invariants-2411.11662"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-concurrent-reasoning-in-outcome-logic-independence-conditioning-and-invariants-2411.11662"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-los-s-theorem-for-kripke-joyal-semantics-2411.11766</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-los-s-theorem-for-kripke-joyal-semantics-2411.11766"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-los-s-theorem-for-kripke-joyal-semantics-2411.11766"/></url>
<url><loc>https://scifaro.com/en/abs/the-lambda-calculus-is-quantifiable-2411.11809</loc><lastmod>2024-11-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-lambda-calculus-is-quantifiable-2411.11809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-lambda-calculus-is-quantifiable-2411.11809"/></url>
<url><loc>https://scifaro.com/en/abs/smt-layout-a-maxsmt-based-approach-supporting-real-time-interaction-of-real-world-gui-layout-2411.12271</loc><lastmod>2024-11-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-layout-a-maxsmt-based-approach-supporting-real-time-interaction-of-real-world-gui-layout-2411.12271"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-layout-a-maxsmt-based-approach-supporting-real-time-interaction-of-real-world-gui-layout-2411.12271"/></url>
<url><loc>https://scifaro.com/en/abs/towards-automated-verification-of-logarithmic-arithmetic-2411.12923</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-automated-verification-of-logarithmic-arithmetic-2411.12923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-automated-verification-of-logarithmic-arithmetic-2411.12923"/></url>
<url><loc>https://scifaro.com/en/abs/an-expressive-trace-logic-for-recursive-programs-2411.13125</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expressive-trace-logic-for-recursive-programs-2411.13125"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expressive-trace-logic-for-recursive-programs-2411.13125"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-formal-methods-for-autonomous-systems-2411.13215</loc><lastmod>2024-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-formal-methods-for-autonomous-systems-2411.13215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-sixth-international-workshop-on-formal-methods-for-autonomous-systems-2411.13215"/></url>
<url><loc>https://scifaro.com/en/abs/isomorphism-theorems-between-models-of-mixed-choice-revised-2411.13500</loc><lastmod>2025-06-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isomorphism-theorems-between-models-of-mixed-choice-revised-2411.13500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isomorphism-theorems-between-models-of-mixed-choice-revised-2411.13500"/></url>
<url><loc>https://scifaro.com/en/abs/computable-approximations-of-semicomputable-graphs-2411.13672</loc><lastmod>2026-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computable-approximations-of-semicomputable-graphs-2411.13672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computable-approximations-of-semicomputable-graphs-2411.13672"/></url>
<url><loc>https://scifaro.com/en/abs/a-quadratic-lower-bound-for-simulation-2411.14067</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-quadratic-lower-bound-for-simulation-2411.14067"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-quadratic-lower-bound-for-simulation-2411.14067"/></url>
<url><loc>https://scifaro.com/en/abs/creating-a-formally-verified-neural-network-for-autonomous-navigation-an-experience-report-2411.14163</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/creating-a-formally-verified-neural-network-for-autonomous-navigation-an-experience-report-2411.14163"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/creating-a-formally-verified-neural-network-for-autonomous-navigation-an-experience-report-2411.14163"/></url>
<url><loc>https://scifaro.com/en/abs/using-formal-models-safety-shields-and-certified-control-to-validate-ai-based-train-systems-2411.14374</loc><lastmod>2024-11-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/using-formal-models-safety-shields-and-certified-control-to-validate-ai-based-train-systems-2411.14374"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/using-formal-models-safety-shields-and-certified-control-to-validate-ai-based-train-systems-2411.14374"/></url>
<url><loc>https://scifaro.com/en/abs/semantics-for-linear-time-temporal-logic-with-finite-observations-2411.14581</loc><lastmod>2024-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantics-for-linear-time-temporal-logic-with-finite-observations-2411.14581"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantics-for-linear-time-temporal-logic-with-finite-observations-2411.14581"/></url>
<url><loc>https://scifaro.com/en/abs/expansion-laws-for-forward-reverse-forward-and-reverse-bisimilarities-via-proved-encodings-2411.14583</loc><lastmod>2024-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expansion-laws-for-forward-reverse-forward-and-reverse-bisimilarities-via-proved-encodings-2411.14583"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expansion-laws-for-forward-reverse-forward-and-reverse-bisimilarities-via-proved-encodings-2411.14583"/></url>
<url><loc>https://scifaro.com/en/abs/one-energy-game-for-the-spectrum-between-branching-bisimilarity-and-weak-trace-semantics-2411.14584</loc><lastmod>2024-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/one-energy-game-for-the-spectrum-between-branching-bisimilarity-and-weak-trace-semantics-2411.14584"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/one-energy-game-for-the-spectrum-between-branching-bisimilarity-and-weak-trace-semantics-2411.14584"/></url>
<url><loc>https://scifaro.com/en/abs/a-rewriting-theory-for-quantum-lambda-calculus-2411.14856</loc><lastmod>2025-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-rewriting-theory-for-quantum-lambda-calculus-2411.14856"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-rewriting-theory-for-quantum-lambda-calculus-2411.14856"/></url>
<url><loc>https://scifaro.com/en/abs/application-of-ai-to-formal-methods-an-analysis-of-current-trends-2411.14870</loc><lastmod>2025-08-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/application-of-ai-to-formal-methods-an-analysis-of-current-trends-2411.14870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/application-of-ai-to-formal-methods-an-analysis-of-current-trends-2411.14870"/></url>
<url><loc>https://scifaro.com/en/abs/coslice-colimits-in-homotopy-type-theory-2411.15103</loc><lastmod>2026-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coslice-colimits-in-homotopy-type-theory-2411.15103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coslice-colimits-in-homotopy-type-theory-2411.15103"/></url>
<url><loc>https://scifaro.com/en/abs/advances-in-algorithmic-meta-theorems-2411.15365</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/advances-in-algorithmic-meta-theorems-2411.15365"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/advances-in-algorithmic-meta-theorems-2411.15365"/></url>
<url><loc>https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-and-constant-complements-2411.16397</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-and-constant-complements-2411.16397"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/words-to-letters-valuations-for-language-kleene-algebras-with-variable-and-constant-complements-2411.16397"/></url>
<url><loc>https://scifaro.com/en/abs/j-p-mdp-fp-pp-characterizing-total-expected-rewards-in-markov-decision-processes-as-least-fixed-points-with-an-application-to-operational-semantics-of-probabilistic-programs-technical-report-2411.16564</loc><lastmod>2024-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/j-p-mdp-fp-pp-characterizing-total-expected-rewards-in-markov-decision-processes-as-least-fixed-points-with-an-application-to-operational-semantics-of-probabilistic-programs-technical-report-2411.16564"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/j-p-mdp-fp-pp-characterizing-total-expected-rewards-in-markov-decision-processes-as-least-fixed-points-with-an-application-to-operational-semantics-of-probabilistic-programs-technical-report-2411.16564"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-stateful-partial-order-reduction-2411.16921</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-stateful-partial-order-reduction-2411.16921"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-stateful-partial-order-reduction-2411.16921"/></url>
<url><loc>https://scifaro.com/en/abs/weakly-acyclic-diagrams-a-data-structure-for-infinite-state-symbolic-verification-2411.17250</loc><lastmod>2025-02-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weakly-acyclic-diagrams-a-data-structure-for-infinite-state-symbolic-verification-2411.17250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weakly-acyclic-diagrams-a-data-structure-for-infinite-state-symbolic-verification-2411.17250"/></url>
<url><loc>https://scifaro.com/en/abs/linear-realisability-over-nets-multiplicatives-long-version-2411.17486</loc><lastmod>2024-11-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-realisability-over-nets-multiplicatives-long-version-2411.17486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-realisability-over-nets-multiplicatives-long-version-2411.17486"/></url>
<url><loc>https://scifaro.com/en/abs/a-finite-presentation-of-graphs-of-treewidth-at-most-three-2411.18176</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-finite-presentation-of-graphs-of-treewidth-at-most-three-2411.18176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-finite-presentation-of-graphs-of-treewidth-at-most-three-2411.18176"/></url>
<url><loc>https://scifaro.com/en/abs/on-homogeneous-model-of-fluted-languages-2411.19084</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-homogeneous-model-of-fluted-languages-2411.19084"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-homogeneous-model-of-fluted-languages-2411.19084"/></url>
<url><loc>https://scifaro.com/en/abs/bounds-for-quantum-circuits-using-logic-based-analysis-2411.19177</loc><lastmod>2024-12-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bounds-for-quantum-circuits-using-logic-based-analysis-2411.19177"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bounds-for-quantum-circuits-using-logic-based-analysis-2411.19177"/></url>
<url><loc>https://scifaro.com/en/abs/gradual-exact-logic-unifying-hoare-logic-and-incorrectness-logic-via-gradual-verification-2412.00339</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gradual-exact-logic-unifying-hoare-logic-and-incorrectness-logic-via-gradual-verification-2412.00339"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gradual-exact-logic-unifying-hoare-logic-and-incorrectness-logic-via-gradual-verification-2412.00339"/></url>
<url><loc>https://scifaro.com/en/abs/vagueness-and-the-connectives-2412.00356</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vagueness-and-the-connectives-2412.00356"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vagueness-and-the-connectives-2412.00356"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-proof-system-for-probabilistic-dynamic-logic-2412.00906</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-proof-system-for-probabilistic-dynamic-logic-2412.00906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-proof-system-for-probabilistic-dynamic-logic-2412.00906"/></url>
<url><loc>https://scifaro.com/en/abs/definite-descriptions-and-hybrid-tense-logic-2412.01484</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/definite-descriptions-and-hybrid-tense-logic-2412.01484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/definite-descriptions-and-hybrid-tense-logic-2412.01484"/></url>
<url><loc>https://scifaro.com/en/abs/generating-higher-identity-proofs-in-homotopy-type-theory-2412.01667</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-higher-identity-proofs-in-homotopy-type-theory-2412.01667"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-higher-identity-proofs-in-homotopy-type-theory-2412.01667"/></url>
<url><loc>https://scifaro.com/en/abs/uniform-cut-free-bisequent-calculi-for-three-valued-logics-2412.01700</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/uniform-cut-free-bisequent-calculi-for-three-valued-logics-2412.01700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/uniform-cut-free-bisequent-calculi-for-three-valued-logics-2412.01700"/></url>
<url><loc>https://scifaro.com/en/abs/bisequent-calculi-for-neutral-free-logic-with-definite-descriptions-2412.01712</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bisequent-calculi-for-neutral-free-logic-with-definite-descriptions-2412.01712"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bisequent-calculi-for-neutral-free-logic-with-definite-descriptions-2412.01712"/></url>
<url><loc>https://scifaro.com/en/abs/correspondence-and-inverse-correspondence-for-input-output-logic-and-region-based-theories-of-space-2412.01722</loc><lastmod>2024-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/correspondence-and-inverse-correspondence-for-input-output-logic-and-region-based-theories-of-space-2412.01722"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/correspondence-and-inverse-correspondence-for-input-output-logic-and-region-based-theories-of-space-2412.01722"/></url>
<url><loc>https://scifaro.com/en/abs/targeting-completeness-automated-complexity-analysis-of-integer-programs-2412.01832</loc><lastmod>2025-08-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/targeting-completeness-automated-complexity-analysis-of-integer-programs-2412.01832"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/targeting-completeness-automated-complexity-analysis-of-integer-programs-2412.01832"/></url>
<url><loc>https://scifaro.com/en/abs/a-cut-free-sound-and-complete-russellian-theory-of-definite-descriptions-2412.03251</loc><lastmod>2024-12-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-cut-free-sound-and-complete-russellian-theory-of-definite-descriptions-2412.03251"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-cut-free-sound-and-complete-russellian-theory-of-definite-descriptions-2412.03251"/></url>
<url><loc>https://scifaro.com/en/abs/on-explicit-solutions-to-fixed-point-equations-in-propositional-dynamic-logic-2412.04012</loc><lastmod>2024-12-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-explicit-solutions-to-fixed-point-equations-in-propositional-dynamic-logic-2412.04012"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-explicit-solutions-to-fixed-point-equations-in-propositional-dynamic-logic-2412.04012"/></url>
<url><loc>https://scifaro.com/en/abs/cmso-transducing-tree-like-graph-decompositions-2412.04970</loc><lastmod>2026-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cmso-transducing-tree-like-graph-decompositions-2412.04970"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cmso-transducing-tree-like-graph-decompositions-2412.04970"/></url>
<url><loc>https://scifaro.com/en/abs/small-term-reachability-and-related-problems-for-terminating-term-rewriting-systems-2412.06047</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-term-reachability-and-related-problems-for-terminating-term-rewriting-systems-2412.06047"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-term-reachability-and-related-problems-for-terminating-term-rewriting-systems-2412.06047"/></url>
<url><loc>https://scifaro.com/en/abs/paraconsistent-belief-revision-a-replacement-enriched-lfi-for-epistemic-entrenchment-2412.06117</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/paraconsistent-belief-revision-a-replacement-enriched-lfi-for-epistemic-entrenchment-2412.06117"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/paraconsistent-belief-revision-a-replacement-enriched-lfi-for-epistemic-entrenchment-2412.06117"/></url>
<url><loc>https://scifaro.com/en/abs/normal-nested-answer-set-programs-syntactics-semantics-and-logical-calculi-2412.06407</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/normal-nested-answer-set-programs-syntactics-semantics-and-logical-calculi-2412.06407"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/normal-nested-answer-set-programs-syntactics-semantics-and-logical-calculi-2412.06407"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-instrumentation-framework-for-automatic-verification-2412.06431</loc><lastmod>2024-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-instrumentation-framework-for-automatic-verification-2412.06431"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-instrumentation-framework-for-automatic-verification-2412.06431"/></url>
<url><loc>https://scifaro.com/en/abs/reasoning-about-strategic-abilities-in-stochastic-multi-agent-systems-2412.06509</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reasoning-about-strategic-abilities-in-stochastic-multi-agent-systems-2412.06509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reasoning-about-strategic-abilities-in-stochastic-multi-agent-systems-2412.06509"/></url>
<url><loc>https://scifaro.com/en/abs/probability-and-angelic-nondeterminism-with-multiset-semantics-2412.06754</loc><lastmod>2025-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probability-and-angelic-nondeterminism-with-multiset-semantics-2412.06754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probability-and-angelic-nondeterminism-with-multiset-semantics-2412.06754"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-hyperqptl-2412.07341</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-hyperqptl-2412.07341"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-hyperqptl-2412.07341"/></url>
<url><loc>https://scifaro.com/en/abs/an-abstract-account-of-up-to-techniques-for-inductive-behavioural-relations-2412.07351</loc><lastmod>2024-12-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-abstract-account-of-up-to-techniques-for-inductive-behavioural-relations-2412.07351"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-abstract-account-of-up-to-techniques-for-inductive-behavioural-relations-2412.07351"/></url>
<url><loc>https://scifaro.com/en/abs/provenance-analysis-and-semiring-semantics-for-first-order-logic-2412.07986</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provenance-analysis-and-semiring-semantics-for-first-order-logic-2412.07986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provenance-analysis-and-semiring-semantics-for-first-order-logic-2412.07986"/></url>
<url><loc>https://scifaro.com/en/abs/safe-composition-of-systems-of-communicating-finite-state-machines-2412.08234</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safe-composition-of-systems-of-communicating-finite-state-machines-2412.08234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safe-composition-of-systems-of-communicating-finite-state-machines-2412.08234"/></url>
<url><loc>https://scifaro.com/en/abs/intrinsically-correct-sorting-in-cubical-agda-2412.08362</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intrinsically-correct-sorting-in-cubical-agda-2412.08362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intrinsically-correct-sorting-in-cubical-agda-2412.08362"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-and-verified-continuous-double-auctions-2412.08624</loc><lastmod>2024-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-and-verified-continuous-double-auctions-2412.08624"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-and-verified-continuous-double-auctions-2412.08624"/></url>
<url><loc>https://scifaro.com/en/abs/vel-a-formally-verified-reasoner-for-owl2-el-profile-2412.08739</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vel-a-formally-verified-reasoner-for-owl2-el-profile-2412.08739"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vel-a-formally-verified-reasoner-for-owl2-el-profile-2412.08739"/></url>
<url><loc>https://scifaro.com/en/abs/branch-sequentialization-in-quantum-polytime-2412.09153</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branch-sequentialization-in-quantum-polytime-2412.09153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branch-sequentialization-in-quantum-polytime-2412.09153"/></url>
<url><loc>https://scifaro.com/en/abs/cssdh-an-ontology-for-social-determinants-of-health-to-operational-continuity-of-care-data-interoperability-2412.09223</loc><lastmod>2024-12-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cssdh-an-ontology-for-social-determinants-of-health-to-operational-continuity-of-care-data-interoperability-2412.09223"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cssdh-an-ontology-for-social-determinants-of-health-to-operational-continuity-of-care-data-interoperability-2412.09223"/></url>
<url><loc>https://scifaro.com/en/abs/non-ground-congruence-closure-2412.10066</loc><lastmod>2025-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-ground-congruence-closure-2412.10066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-ground-congruence-closure-2412.10066"/></url>
<url><loc>https://scifaro.com/en/abs/direct-encoding-of-declare-constraints-in-asp-2412.10152</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/direct-encoding-of-declare-constraints-in-asp-2412.10152"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/direct-encoding-of-declare-constraints-in-asp-2412.10152"/></url>
<url><loc>https://scifaro.com/en/abs/strong-structural-bounds-for-maxsat-the-fine-details-of-using-neuromorphic-and-quantum-hardware-accelerators-2412.10289</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-structural-bounds-for-maxsat-the-fine-details-of-using-neuromorphic-and-quantum-hardware-accelerators-2412.10289"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-structural-bounds-for-maxsat-the-fine-details-of-using-neuromorphic-and-quantum-hardware-accelerators-2412.10289"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-square-free-sequences-and-anti-unification-type-2412.10307</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-square-free-sequences-and-anti-unification-type-2412.10307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-square-free-sequences-and-anti-unification-type-2412.10307"/></url>
<url><loc>https://scifaro.com/en/abs/counterfactual-explanations-for-mitl-violations-2412.10386</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterfactual-explanations-for-mitl-violations-2412.10386"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterfactual-explanations-for-mitl-violations-2412.10386"/></url>
<url><loc>https://scifaro.com/en/abs/a-syntactic-approach-to-computing-complete-and-sound-abstraction-in-the-situation-calculus-2412.11217</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-syntactic-approach-to-computing-complete-and-sound-abstraction-in-the-situation-calculus-2412.11217"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-syntactic-approach-to-computing-complete-and-sound-abstraction-in-the-situation-calculus-2412.11217"/></url>
<url><loc>https://scifaro.com/en/abs/dung-s-argumentation-framework-unveiling-the-expressive-power-with-inconsistent-databases-2412.11617</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/dung-s-argumentation-framework-unveiling-the-expressive-power-with-inconsistent-databases-2412.11617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/dung-s-argumentation-framework-unveiling-the-expressive-power-with-inconsistent-databases-2412.11617"/></url>
<url><loc>https://scifaro.com/en/abs/formal-quality-measures-for-predictors-in-markov-decision-processes-2412.11754</loc><lastmod>2024-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-quality-measures-for-predictors-in-markov-decision-processes-2412.11754"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-quality-measures-for-predictors-in-markov-decision-processes-2412.11754"/></url>
<url><loc>https://scifaro.com/en/abs/isabelle-as-systems-platform-managing-automated-and-quasi-interactive-builds-2412.13083</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/isabelle-as-systems-platform-managing-automated-and-quasi-interactive-builds-2412.13083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/isabelle-as-systems-platform-managing-automated-and-quasi-interactive-builds-2412.13083"/></url>
<url><loc>https://scifaro.com/en/abs/contract-based-design-and-verification-of-multi-agent-systems-with-quantitative-temporal-requirements-2412.13114</loc><lastmod>2024-12-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/contract-based-design-and-verification-of-multi-agent-systems-with-quantitative-temporal-requirements-2412.13114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/contract-based-design-and-verification-of-multi-agent-systems-with-quantitative-temporal-requirements-2412.13114"/></url>
<url><loc>https://scifaro.com/en/abs/localized-rete-for-incremental-graph-queries-with-nested-graph-conditions-2412.13918</loc><lastmod>2026-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/localized-rete-for-incremental-graph-queries-with-nested-graph-conditions-2412.13918"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/localized-rete-for-incremental-graph-queries-with-nested-graph-conditions-2412.13918"/></url>
<url><loc>https://scifaro.com/en/abs/implicit-rankings-for-verifying-liveness-properties-in-first-order-logic-2412.13996</loc><lastmod>2024-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/implicit-rankings-for-verifying-liveness-properties-in-first-order-logic-2412.13996"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/implicit-rankings-for-verifying-liveness-properties-in-first-order-logic-2412.13996"/></url>
<url><loc>https://scifaro.com/en/abs/a-computationally-grounded-framework-for-cognitive-attitudes-extended-version-2412.14073</loc><lastmod>2024-12-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-computationally-grounded-framework-for-cognitive-attitudes-extended-version-2412.14073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-computationally-grounded-framework-for-cognitive-attitudes-extended-version-2412.14073"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-foundations-of-reductive-reasoning-2412.14758</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-foundations-of-reductive-reasoning-2412.14758"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-foundations-of-reductive-reasoning-2412.14758"/></url>
<url><loc>https://scifaro.com/en/abs/le-chameau-et-le-serpent-rentrent-dans-un-bar-v-erification-quasi-automatique-de-code-ocaml-en-logique-de-s-eparation-2412.14894</loc><lastmod>2024-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/le-chameau-et-le-serpent-rentrent-dans-un-bar-v-erification-quasi-automatique-de-code-ocaml-en-logique-de-s-eparation-2412.14894"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/le-chameau-et-le-serpent-rentrent-dans-un-bar-v-erification-quasi-automatique-de-code-ocaml-en-logique-de-s-eparation-2412.14894"/></url>
<url><loc>https://scifaro.com/en/abs/cirbo-a-new-tool-for-boolean-circuit-analysis-and-synthesis-2412.14933</loc><lastmod>2024-12-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cirbo-a-new-tool-for-boolean-circuit-analysis-and-synthesis-2412.14933"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cirbo-a-new-tool-for-boolean-circuit-analysis-and-synthesis-2412.14933"/></url>
<url><loc>https://scifaro.com/en/abs/expressivity-of-audala-turing-completeness-and-possible-extensions-2412.14938</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expressivity-of-audala-turing-completeness-and-possible-extensions-2412.14938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expressivity-of-audala-turing-completeness-and-possible-extensions-2412.14938"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-free-normal-modal-logics-2412.15736</loc><lastmod>2025-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-free-normal-modal-logics-2412.15736"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-free-normal-modal-logics-2412.15736"/></url>
<url><loc>https://scifaro.com/en/abs/submassive-resolving-subclass-cycles-in-very-large-knowledge-graphs-2412.15829</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/submassive-resolving-subclass-cycles-in-very-large-knowledge-graphs-2412.15829"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/submassive-resolving-subclass-cycles-in-very-large-knowledge-graphs-2412.15829"/></url>
<url><loc>https://scifaro.com/en/abs/sat-solving-for-variants-of-first-order-subsumption-2412.16058</loc><lastmod>2024-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-solving-for-variants-of-first-order-subsumption-2412.16058"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-solving-for-variants-of-first-order-subsumption-2412.16058"/></url>
<url><loc>https://scifaro.com/en/abs/decision-algorithms-for-fragments-of-real-analysis-ii-a-theory-of-differentiable-functions-with-convexity-and-concavity-predicates-2412.16091</loc><lastmod>2025-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decision-algorithms-for-fragments-of-real-analysis-ii-a-theory-of-differentiable-functions-with-convexity-and-concavity-predicates-2412.16091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decision-algorithms-for-fragments-of-real-analysis-ii-a-theory-of-differentiable-functions-with-convexity-and-concavity-predicates-2412.16091"/></url>
<url><loc>https://scifaro.com/en/abs/formal-modeling-and-verification-of-publisher-subscriber-paradigm-in-ros-2-2412.16186</loc><lastmod>2025-01-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-modeling-and-verification-of-publisher-subscriber-paradigm-in-ros-2-2412.16186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-modeling-and-verification-of-publisher-subscriber-paradigm-in-ros-2-2412.16186"/></url>
<url><loc>https://scifaro.com/en/abs/quantified-linear-and-polynomial-arithmetic-satisfiability-via-template-based-skolemization-2412.16226</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantified-linear-and-polynomial-arithmetic-satisfiability-via-template-based-skolemization-2412.16226"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantified-linear-and-polynomial-arithmetic-satisfiability-via-template-based-skolemization-2412.16226"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-power-and-limitations-of-examples-for-description-logic-concepts-2412.17345</loc><lastmod>2024-12-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-power-and-limitations-of-examples-for-description-logic-concepts-2412.17345"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-power-and-limitations-of-examples-for-description-logic-concepts-2412.17345"/></url>
<url><loc>https://scifaro.com/en/abs/concrete-branching-bisimilarity-for-processes-with-time-outs-2412.19805</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/concrete-branching-bisimilarity-for-processes-with-time-outs-2412.19805"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/concrete-branching-bisimilarity-for-processes-with-time-outs-2412.19805"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-eleventh-international-conference-on-non-classical-logics-theory-and-applications-2412.20053</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-eleventh-international-conference-on-non-classical-logics-theory-and-applications-2412.20053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-eleventh-international-conference-on-non-classical-logics-theory-and-applications-2412.20053"/></url>
<url><loc>https://scifaro.com/en/abs/the-annotated-dependency-pair-framework-for-almost-sure-termination-of-probabilistic-term-rewriting-2412.20220</loc><lastmod>2025-06-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-annotated-dependency-pair-framework-for-almost-sure-termination-of-probabilistic-term-rewriting-2412.20220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-annotated-dependency-pair-framework-for-almost-sure-termination-of-probabilistic-term-rewriting-2412.20220"/></url>
<url><loc>https://scifaro.com/en/abs/relative-constructibility-via-generalised-sequential-algorithms-2412.20432</loc><lastmod>2025-09-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relative-constructibility-via-generalised-sequential-algorithms-2412.20432"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relative-constructibility-via-generalised-sequential-algorithms-2412.20432"/></url>
<url><loc>https://scifaro.com/en/abs/bayesian-networks-and-proof-nets-a-proof-theoretical-account-of-bayesian-inference-2412.20540</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bayesian-networks-and-proof-nets-a-proof-theoretical-account-of-bayesian-inference-2412.20540"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bayesian-networks-and-proof-nets-a-proof-theoretical-account-of-bayesian-inference-2412.20540"/></url>
<url><loc>https://scifaro.com/en/abs/a-formal-correctness-proof-of-edmonds-blossom-shrinking-algorithm-2412.20878</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formal-correctness-proof-of-edmonds-blossom-shrinking-algorithm-2412.20878"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formal-correctness-proof-of-edmonds-blossom-shrinking-algorithm-2412.20878"/></url>
<url><loc>https://scifaro.com/en/abs/proofcloud-a-proof-retrieval-engine-for-verified-proofs-in-higher-order-logic-2412.20947</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proofcloud-a-proof-retrieval-engine-for-verified-proofs-in-higher-order-logic-2412.20947"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proofcloud-a-proof-retrieval-engine-for-verified-proofs-in-higher-order-logic-2412.20947"/></url>
<url><loc>https://scifaro.com/en/abs/a-qualitative-analysis-of-kernel-extension-for-higher-order-proof-checking-2412.20973</loc><lastmod>2024-12-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-qualitative-analysis-of-kernel-extension-for-higher-order-proof-checking-2412.20973"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-qualitative-analysis-of-kernel-extension-for-higher-order-proof-checking-2412.20973"/></url>
<url><loc>https://scifaro.com/en/abs/computability-of-initial-value-problems-2501.00451</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/computability-of-initial-value-problems-2501.00451"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/computability-of-initial-value-problems-2501.00451"/></url>
<url><loc>https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-nelsonian-free-logic-2501.00481</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-nelsonian-free-logic-2501.00481"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-binary-quantifier-for-definite-descriptions-in-nelsonian-free-logic-2501.00481"/></url>
<url><loc>https://scifaro.com/en/abs/twist-sequent-calculi-for-s4-and-its-neighbors-2501.00483</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/twist-sequent-calculi-for-s4-and-its-neighbors-2501.00483"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/twist-sequent-calculi-for-s4-and-its-neighbors-2501.00483"/></url>
<url><loc>https://scifaro.com/en/abs/nested-sequent-calculus-for-modal-logic-mb-2501.00484</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nested-sequent-calculus-for-modal-logic-mb-2501.00484"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nested-sequent-calculus-for-modal-logic-mb-2501.00484"/></url>
<url><loc>https://scifaro.com/en/abs/two-cases-of-deduction-with-non-referring-descriptions-2501.00485</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/two-cases-of-deduction-with-non-referring-descriptions-2501.00485"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/two-cases-of-deduction-with-non-referring-descriptions-2501.00485"/></url>
<url><loc>https://scifaro.com/en/abs/semantic-incompleteness-of-liberman-et-al-2020-s-hilbert-style-system-for-term-modal-logic-k-with-equality-and-non-rigid-terms-2501.00486</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/semantic-incompleteness-of-liberman-et-al-2020-s-hilbert-style-system-for-term-modal-logic-k-with-equality-and-non-rigid-terms-2501.00486"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/semantic-incompleteness-of-liberman-et-al-2020-s-hilbert-style-system-for-term-modal-logic-k-with-equality-and-non-rigid-terms-2501.00486"/></url>
<url><loc>https://scifaro.com/en/abs/syntactic-cut-elimination-for-provability-logic-gl-via-nested-sequents-2501.00487</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/syntactic-cut-elimination-for-provability-logic-gl-via-nested-sequents-2501.00487"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/syntactic-cut-elimination-for-provability-logic-gl-via-nested-sequents-2501.00487"/></url>
<url><loc>https://scifaro.com/en/abs/incomplete-descriptions-and-qualified-definiteness-2501.00488</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incomplete-descriptions-and-qualified-definiteness-2501.00488"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incomplete-descriptions-and-qualified-definiteness-2501.00488"/></url>
<url><loc>https://scifaro.com/en/abs/many-valued-modal-logic-2501.00489</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/many-valued-modal-logic-2501.00489"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/many-valued-modal-logic-2501.00489"/></url>
<url><loc>https://scifaro.com/en/abs/modal-logics-rnmatrices-vs-nmatrices-2501.00492</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modal-logics-rnmatrices-vs-nmatrices-2501.00492"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modal-logics-rnmatrices-vs-nmatrices-2501.00492"/></url>
<url><loc>https://scifaro.com/en/abs/complexity-of-nonassociative-lambek-calculus-with-classical-logic-2501.00493</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexity-of-nonassociative-lambek-calculus-with-classical-logic-2501.00493"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexity-of-nonassociative-lambek-calculus-with-classical-logic-2501.00493"/></url>
<url><loc>https://scifaro.com/en/abs/a-unified-gentzen-style-framework-for-until-free-ltl-2501.00494</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-unified-gentzen-style-framework-for-until-free-ltl-2501.00494"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-unified-gentzen-style-framework-for-until-free-ltl-2501.00494"/></url>
<url><loc>https://scifaro.com/en/abs/kamide-is-in-america-moisil-and-leitgeb-are-in-australia-2501.00495</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kamide-is-in-america-moisil-and-leitgeb-are-in-australia-2501.00495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kamide-is-in-america-moisil-and-leitgeb-are-in-australia-2501.00495"/></url>
<url><loc>https://scifaro.com/en/abs/unified-gentzen-approach-to-connexive-logics-over-wansing-s-c-2501.00498</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/unified-gentzen-approach-to-connexive-logics-over-wansing-s-c-2501.00498"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/unified-gentzen-approach-to-connexive-logics-over-wansing-s-c-2501.00498"/></url>
<url><loc>https://scifaro.com/en/abs/the-power-of-generalized-clemens-semantics-2501.00499</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-power-of-generalized-clemens-semantics-2501.00499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-power-of-generalized-clemens-semantics-2501.00499"/></url>
<url><loc>https://scifaro.com/en/abs/a-note-on-grigoriev-and-zaitsev-s-system-cnl-2-4-2501.00500</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-note-on-grigoriev-and-zaitsev-s-system-cnl-2-4-2501.00500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-note-on-grigoriev-and-zaitsev-s-system-cnl-2-4-2501.00500"/></url>
<url><loc>https://scifaro.com/en/abs/the-disjunction-free-fragment-of-d2-is-three-valued-2501.00501</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-disjunction-free-fragment-of-d2-is-three-valued-2501.00501"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-disjunction-free-fragment-of-d2-is-three-valued-2501.00501"/></url>
<url><loc>https://scifaro.com/en/abs/formalization-of-biological-circuit-block-diagrams-for-formally-analyzing-biomedical-control-systems-in-phri-applications-2501.00541</loc><lastmod>2025-01-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalization-of-biological-circuit-block-diagrams-for-formally-analyzing-biomedical-control-systems-in-phri-applications-2501.00541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalization-of-biological-circuit-block-diagrams-for-formally-analyzing-biomedical-control-systems-in-phri-applications-2501.00541"/></url>
<url><loc>https://scifaro.com/en/abs/algorithmic-problems-for-computation-trees-2501.01812</loc><lastmod>2025-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algorithmic-problems-for-computation-trees-2501.01812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algorithmic-problems-for-computation-trees-2501.01812"/></url>
<url><loc>https://scifaro.com/en/abs/programs-versus-finite-tree-programs-2501.01820</loc><lastmod>2025-01-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programs-versus-finite-tree-programs-2501.01820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programs-versus-finite-tree-programs-2501.01820"/></url>
<url><loc>https://scifaro.com/en/abs/revisiting-drup-based-interpolants-with-cadical-2-0-2501.02608</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/revisiting-drup-based-interpolants-with-cadical-2-0-2501.02608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/revisiting-drup-based-interpolants-with-cadical-2-0-2501.02608"/></url>
<url><loc>https://scifaro.com/en/abs/retrieval-augmented-tlaps-proof-generation-with-large-language-models-2501.03073</loc><lastmod>2025-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/retrieval-augmented-tlaps-proof-generation-with-large-language-models-2501.03073"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/retrieval-augmented-tlaps-proof-generation-with-large-language-models-2501.03073"/></url>
<url><loc>https://scifaro.com/en/abs/timelinekgqa-a-comprehensive-question-answer-pair-generator-for-temporal-knowledge-graphs-2501.04343</loc><lastmod>2025-01-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/timelinekgqa-a-comprehensive-question-answer-pair-generator-for-temporal-knowledge-graphs-2501.04343"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/timelinekgqa-a-comprehensive-question-answer-pair-generator-for-temporal-knowledge-graphs-2501.04343"/></url>
<url><loc>https://scifaro.com/en/abs/automated-analysis-of-logically-constrained-rewrite-systems-using-crest-2501.05240</loc><lastmod>2025-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-analysis-of-logically-constrained-rewrite-systems-using-crest-2501.05240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-analysis-of-logically-constrained-rewrite-systems-using-crest-2501.05240"/></url>
<url><loc>https://scifaro.com/en/abs/a-dichotomy-theorem-for-ordinal-ranks-in-mso-2501.05385</loc><lastmod>2025-12-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-dichotomy-theorem-for-ordinal-ranks-in-mso-2501.05385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-dichotomy-theorem-for-ordinal-ranks-in-mso-2501.05385"/></url>
<url><loc>https://scifaro.com/en/abs/proof-recommendation-system-for-the-hol4-theorem-prover-2501.05463</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-recommendation-system-for-the-hol4-theorem-prover-2501.05463"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-recommendation-system-for-the-hol4-theorem-prover-2501.05463"/></url>
<url><loc>https://scifaro.com/en/abs/seven-kinds-of-equivalent-models-for-generalized-coalition-logics-2501.05466</loc><lastmod>2025-12-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/seven-kinds-of-equivalent-models-for-generalized-coalition-logics-2501.05466"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/seven-kinds-of-equivalent-models-for-generalized-coalition-logics-2501.05466"/></url>
<url><loc>https://scifaro.com/en/abs/a-survey-of-interactive-verifiable-computing-utilizing-low-degree-polynomials-2501.05500</loc><lastmod>2025-01-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-survey-of-interactive-verifiable-computing-utilizing-low-degree-polynomials-2501.05500"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-survey-of-interactive-verifiable-computing-utilizing-low-degree-polynomials-2501.05500"/></url>
<url><loc>https://scifaro.com/en/abs/lazy-reimplication-in-chronological-backtracking-2501.07457</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lazy-reimplication-in-chronological-backtracking-2501.07457"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lazy-reimplication-in-chronological-backtracking-2501.07457"/></url>
<url><loc>https://scifaro.com/en/abs/3d-grids-are-not-transducible-from-planar-graphs-2501.07558</loc><lastmod>2025-01-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/3d-grids-are-not-transducible-from-planar-graphs-2501.07558"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/3d-grids-are-not-transducible-from-planar-graphs-2501.07558"/></url>
<url><loc>https://scifaro.com/en/abs/technical-report-exploring-automatic-model-checking-of-the-ethereum-specification-2501.07958</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/technical-report-exploring-automatic-model-checking-of-the-ethereum-specification-2501.07958"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/technical-report-exploring-automatic-model-checking-of-the-ethereum-specification-2501.07958"/></url>
<url><loc>https://scifaro.com/en/abs/logics-and-algorithms-for-hyperproperties-2501.08063</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logics-and-algorithms-for-hyperproperties-2501.08063"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logics-and-algorithms-for-hyperproperties-2501.08063"/></url>
<url><loc>https://scifaro.com/en/abs/cube-based-isomorph-free-finite-model-finding-2501.08157</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cube-based-isomorph-free-finite-model-finding-2501.08157"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cube-based-isomorph-free-finite-model-finding-2501.08157"/></url>
<url><loc>https://scifaro.com/en/abs/sat-based-techniques-for-lexicographically-smallest-finite-models-2501.08206</loc><lastmod>2025-01-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-based-techniques-for-lexicographically-smallest-finite-models-2501.08206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-based-techniques-for-lexicographically-smallest-finite-models-2501.08206"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-infinite-state-systems-2501.08713</loc><lastmod>2026-05-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-infinite-state-systems-2501.08713"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-infinite-state-systems-2501.08713"/></url>
<url><loc>https://scifaro.com/en/abs/formulas-as-processes-deadlock-freedom-as-choreographies-extended-version-2501.08928</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formulas-as-processes-deadlock-freedom-as-choreographies-extended-version-2501.08928"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formulas-as-processes-deadlock-freedom-as-choreographies-extended-version-2501.08928"/></url>
<url><loc>https://scifaro.com/en/abs/approximating-fixpoints-of-approximated-functions-2501.08950</loc><lastmod>2025-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/approximating-fixpoints-of-approximated-functions-2501.08950"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/approximating-fixpoints-of-approximated-functions-2501.08950"/></url>
<url><loc>https://scifaro.com/en/abs/provenance-guided-rollback-suggestions-2501.09225</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/provenance-guided-rollback-suggestions-2501.09225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/provenance-guided-rollback-suggestions-2501.09225"/></url>
<url><loc>https://scifaro.com/en/abs/graded-courrent-pdl-2501.09285</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graded-courrent-pdl-2501.09285"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graded-courrent-pdl-2501.09285"/></url>
<url><loc>https://scifaro.com/en/abs/first-experiments-with-neural-cvc5-2501.09379</loc><lastmod>2025-01-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-experiments-with-neural-cvc5-2501.09379"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-experiments-with-neural-cvc5-2501.09379"/></url>
<url><loc>https://scifaro.com/en/abs/verified-and-optimized-implementation-of-orthologic-proof-search-2501.09418</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-and-optimized-implementation-of-orthologic-proof-search-2501.09418"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-and-optimized-implementation-of-orthologic-proof-search-2501.09418"/></url>
<url><loc>https://scifaro.com/en/abs/classifying-the-groups-of-order-p-q-in-lean-2501.09769</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classifying-the-groups-of-order-p-q-in-lean-2501.09769"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classifying-the-groups-of-order-p-q-in-lean-2501.09769"/></url>
<url><loc>https://scifaro.com/en/abs/small-decision-trees-for-mdps-with-deductive-synthesis-2501.10126</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/small-decision-trees-for-mdps-with-deductive-synthesis-2501.10126"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/small-decision-trees-for-mdps-with-deductive-synthesis-2501.10126"/></url>
<url><loc>https://scifaro.com/en/abs/a-formally-verified-ieee-754-floating-point-implementation-of-interval-iteration-for-mdps-2501.10127</loc><lastmod>2025-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-formally-verified-ieee-754-floating-point-implementation-of-interval-iteration-for-mdps-2501.10127"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-formally-verified-ieee-754-floating-point-implementation-of-interval-iteration-for-mdps-2501.10127"/></url>
<url><loc>https://scifaro.com/en/abs/visualizing-game-based-certificates-for-hyperproperty-verification-2501.10184</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/visualizing-game-based-certificates-for-hyperproperty-verification-2501.10184"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/visualizing-game-based-certificates-for-hyperproperty-verification-2501.10184"/></url>
<url><loc>https://scifaro.com/en/abs/fc-datalog-as-a-framework-for-efficient-string-querying-2501.10344</loc><lastmod>2025-01-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fc-datalog-as-a-framework-for-efficient-string-querying-2501.10344"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fc-datalog-as-a-framework-for-efficient-string-querying-2501.10344"/></url>
<url><loc>https://scifaro.com/en/abs/logical-relations-for-formally-verified-authenticated-data-structures-2501.10802</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-relations-for-formally-verified-authenticated-data-structures-2501.10802"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-relations-for-formally-verified-authenticated-data-structures-2501.10802"/></url>
<url><loc>https://scifaro.com/en/abs/formalising-new-mathematics-in-isabelle-diagonal-ramsey-2501.10852</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalising-new-mathematics-in-isabelle-diagonal-ramsey-2501.10852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalising-new-mathematics-in-isabelle-diagonal-ramsey-2501.10852"/></url>
<url><loc>https://scifaro.com/en/abs/autodeduct-a-tool-for-automated-deductive-verification-of-c-code-2501.10889</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autodeduct-a-tool-for-automated-deductive-verification-of-c-code-2501.10889"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autodeduct-a-tool-for-automated-deductive-verification-of-c-code-2501.10889"/></url>
<url><loc>https://scifaro.com/en/abs/fixed-point-certificates-for-reachability-and-expected-rewards-in-mdps-2501.11467</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fixed-point-certificates-for-reachability-and-expected-rewards-in-mdps-2501.11467"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fixed-point-certificates-for-reachability-and-expected-rewards-in-mdps-2501.11467"/></url>
<url><loc>https://scifaro.com/en/abs/a-common-ancestor-of-pdl-conjunctive-queries-and-unary-negation-first-order-2501.11641</loc><lastmod>2026-04-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-common-ancestor-of-pdl-conjunctive-queries-and-unary-negation-first-order-2501.11641"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-common-ancestor-of-pdl-conjunctive-queries-and-unary-negation-first-order-2501.11641"/></url>
<url><loc>https://scifaro.com/en/abs/the-termination-of-nielsen-transformations-applied-to-word-equations-with-length-constraints-2501.11789</loc><lastmod>2025-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-termination-of-nielsen-transformations-applied-to-word-equations-with-length-constraints-2501.11789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-termination-of-nielsen-transformations-applied-to-word-equations-with-length-constraints-2501.11789"/></url>
<url><loc>https://scifaro.com/en/abs/certified-knowledge-compilation-with-application-to-formally-verified-model-counting-2501.12906</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/certified-knowledge-compilation-with-application-to-formally-verified-model-counting-2501.12906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/certified-knowledge-compilation-with-application-to-formally-verified-model-counting-2501.12906"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-characterisations-of-the-must-preorder-for-asynchrony-2501.13002</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-characterisations-of-the-must-preorder-for-asynchrony-2501.13002"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-characterisations-of-the-must-preorder-for-asynchrony-2501.13002"/></url>
<url><loc>https://scifaro.com/en/abs/a-behavioural-pseudometric-for-continuous-time-markov-processes-2501.13008</loc><lastmod>2025-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-behavioural-pseudometric-for-continuous-time-markov-processes-2501.13008"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-behavioural-pseudometric-for-continuous-time-markov-processes-2501.13008"/></url>
<url><loc>https://scifaro.com/en/abs/the-yoneda-embedding-in-simplicial-type-theory-2501.13229</loc><lastmod>2025-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-yoneda-embedding-in-simplicial-type-theory-2501.13229"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-yoneda-embedding-in-simplicial-type-theory-2501.13229"/></url>
<url><loc>https://scifaro.com/en/abs/overview-and-roadmap-of-team-automata-2501.13589</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/overview-and-roadmap-of-team-automata-2501.13589"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/overview-and-roadmap-of-team-automata-2501.13589"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-graph-algorithms-in-separation-logic-a-case-for-an-algebraic-approach-extended-version-2501.13603</loc><lastmod>2025-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-graph-algorithms-in-separation-logic-a-case-for-an-algebraic-approach-extended-version-2501.13603"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-graph-algorithms-in-separation-logic-a-case-for-an-algebraic-approach-extended-version-2501.13603"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-and-algorithmic-synergies-between-promise-and-infinite-domain-csps-2501.13740</loc><lastmod>2025-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-and-algorithmic-synergies-between-promise-and-infinite-domain-csps-2501.13740"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-and-algorithmic-synergies-between-promise-and-infinite-domain-csps-2501.13740"/></url>
<url><loc>https://scifaro.com/en/abs/forbidden-induced-subgraphs-for-bounded-shrub-depth-and-the-expressive-power-of-mso-2501.13903</loc><lastmod>2025-01-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-for-bounded-shrub-depth-and-the-expressive-power-of-mso-2501.13903"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/forbidden-induced-subgraphs-for-bounded-shrub-depth-and-the-expressive-power-of-mso-2501.13903"/></url>
<url><loc>https://scifaro.com/en/abs/incremental-sat-based-enumeration-of-solutions-to-the-yang-baxter-equation-2501.14363</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incremental-sat-based-enumeration-of-solutions-to-the-yang-baxter-equation-2501.14363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incremental-sat-based-enumeration-of-solutions-to-the-yang-baxter-equation-2501.14363"/></url>
<url><loc>https://scifaro.com/en/abs/constructive-ordinal-exponentiation-2501.14542</loc><lastmod>2025-10-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructive-ordinal-exponentiation-2501.14542"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructive-ordinal-exponentiation-2501.14542"/></url>
<url><loc>https://scifaro.com/en/abs/accelerating-protocol-synthesis-and-detecting-unrealizability-with-interpretation-reduction-2501.14585</loc><lastmod>2025-01-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/accelerating-protocol-synthesis-and-detecting-unrealizability-with-interpretation-reduction-2501.14585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/accelerating-protocol-synthesis-and-detecting-unrealizability-with-interpretation-reduction-2501.14585"/></url>
<url><loc>https://scifaro.com/en/abs/complete-quantum-relational-hoare-logics-from-optimal-transport-duality-2501.15238</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-quantum-relational-hoare-logics-from-optimal-transport-duality-2501.15238"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-quantum-relational-hoare-logics-from-optimal-transport-duality-2501.15238"/></url>
<url><loc>https://scifaro.com/en/abs/guarded-negation-transitive-closure-logic-2501.15303</loc><lastmod>2026-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/guarded-negation-transitive-closure-logic-2501.15303"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/guarded-negation-transitive-closure-logic-2501.15303"/></url>
<url><loc>https://scifaro.com/en/abs/a-general-completeness-theorem-for-skip-free-star-algebras-2501.15325</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-general-completeness-theorem-for-skip-free-star-algebras-2501.15325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-general-completeness-theorem-for-skip-free-star-algebras-2501.15325"/></url>
<url><loc>https://scifaro.com/en/abs/variable-elimination-as-rewriting-in-a-linear-lambda-calculus-2501.15439</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/variable-elimination-as-rewriting-in-a-linear-lambda-calculus-2501.15439"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/variable-elimination-as-rewriting-in-a-linear-lambda-calculus-2501.15439"/></url>
<url><loc>https://scifaro.com/en/abs/skolemization-in-intermediate-logics-2501.15507</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/skolemization-in-intermediate-logics-2501.15507"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/skolemization-in-intermediate-logics-2501.15507"/></url>
<url><loc>https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-ii-tropical-geometry-of-probabilistic-programming-languages-2501.15637</loc><lastmod>2025-11-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-ii-tropical-geometry-of-probabilistic-programming-languages-2501.15637"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tropical-mathematics-and-the-lambda-calculus-ii-tropical-geometry-of-probabilistic-programming-languages-2501.15637"/></url>
<url><loc>https://scifaro.com/en/abs/a-tutorial-on-stream-based-monitoring-2501.15913</loc><lastmod>2025-01-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-tutorial-on-stream-based-monitoring-2501.15913"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-tutorial-on-stream-based-monitoring-2501.15913"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-evidence-generation-for-modal-mu-calculus-model-checking-extended-version-2501.15938</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-evidence-generation-for-modal-mu-calculus-model-checking-extended-version-2501.15938"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-evidence-generation-for-modal-mu-calculus-model-checking-extended-version-2501.15938"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-algorithmic-structure-of-dialectica-realisers-2501.16208</loc><lastmod>2025-12-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-algorithmic-structure-of-dialectica-realisers-2501.16208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-algorithmic-structure-of-dialectica-realisers-2501.16208"/></url>
<url><loc>https://scifaro.com/en/abs/codd-s-theorem-for-databases-over-semirings-2501.16543</loc><lastmod>2025-04-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/codd-s-theorem-for-databases-over-semirings-2501.16543"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/codd-s-theorem-for-databases-over-semirings-2501.16543"/></url>
<url><loc>https://scifaro.com/en/abs/sharing-and-linear-logic-with-restricted-access-extended-version-2501.16576</loc><lastmod>2025-01-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sharing-and-linear-logic-with-restricted-access-extended-version-2501.16576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sharing-and-linear-logic-with-restricted-access-extended-version-2501.16576"/></url>
<url><loc>https://scifaro.com/en/abs/the-sorrows-of-a-smooth-digraph-the-first-hardness-criterion-for-infinite-directed-graph-colouring-problems-2501.17060</loc><lastmod>2026-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-sorrows-of-a-smooth-digraph-the-first-hardness-criterion-for-infinite-directed-graph-colouring-problems-2501.17060"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-sorrows-of-a-smooth-digraph-the-first-hardness-criterion-for-infinite-directed-graph-colouring-problems-2501.17060"/></url>
<url><loc>https://scifaro.com/en/abs/weihrauch-problems-as-containers-2501.17250</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weihrauch-problems-as-containers-2501.17250"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weihrauch-problems-as-containers-2501.17250"/></url>
<url><loc>https://scifaro.com/en/abs/formally-verifying-a-transformation-from-mltl-formulas-to-regular-expressions-2501.17444</loc><lastmod>2025-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formally-verifying-a-transformation-from-mltl-formulas-to-regular-expressions-2501.17444"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formally-verifying-a-transformation-from-mltl-formulas-to-regular-expressions-2501.17444"/></url>
<url><loc>https://scifaro.com/en/abs/trees-in-graphs-of-large-linear-cliquewidth-2501.17556</loc><lastmod>2026-04-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-in-graphs-of-large-linear-cliquewidth-2501.17556"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-in-graphs-of-large-linear-cliquewidth-2501.17556"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-real-time-systems-revisiting-the-alternating-automaton-route-2501.17576</loc><lastmod>2026-01-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-real-time-systems-revisiting-the-alternating-automaton-route-2501.17576"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-real-time-systems-revisiting-the-alternating-automaton-route-2501.17576"/></url>
<url><loc>https://scifaro.com/en/abs/algebraic-proof-theory-for-infinitary-action-logic-2501.18231</loc><lastmod>2025-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/algebraic-proof-theory-for-infinitary-action-logic-2501.18231"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/algebraic-proof-theory-for-infinitary-action-logic-2501.18231"/></url>
<url><loc>https://scifaro.com/en/abs/induction-and-recursion-principles-in-a-higher-order-quantitative-logic-for-probability-2501.18275</loc><lastmod>2026-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/induction-and-recursion-principles-in-a-higher-order-quantitative-logic-for-probability-2501.18275"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/induction-and-recursion-principles-in-a-higher-order-quantitative-logic-for-probability-2501.18275"/></url>
<url><loc>https://scifaro.com/en/abs/knowledge-in-multi-robot-systems-an-interplay-of-dynamics-computation-and-communication-2501.18309</loc><lastmod>2025-09-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/knowledge-in-multi-robot-systems-an-interplay-of-dynamics-computation-and-communication-2501.18309"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/knowledge-in-multi-robot-systems-an-interplay-of-dynamics-computation-and-communication-2501.18309"/></url>
<url><loc>https://scifaro.com/en/abs/transductions-of-graph-classes-admitting-product-structure-2501.18326</loc><lastmod>2025-06-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/transductions-of-graph-classes-admitting-product-structure-2501.18326"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/transductions-of-graph-classes-admitting-product-structure-2501.18326"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-of-universal-safety-controllers-2501.18445</loc><lastmod>2025-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-of-universal-safety-controllers-2501.18445"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-of-universal-safety-controllers-2501.18445"/></url>
<url><loc>https://scifaro.com/en/abs/the-algebra-of-parity-games-2501.18499</loc><lastmod>2025-01-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-algebra-of-parity-games-2501.18499"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-algebra-of-parity-games-2501.18499"/></url>
<url><loc>https://scifaro.com/en/abs/stable-andrews-curtis-trivialization-of-ak-3-revisited-a-case-study-using-automated-deduction-2501.18601</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stable-andrews-curtis-trivialization-of-ak-3-revisited-a-case-study-using-automated-deduction-2501.18601"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stable-andrews-curtis-trivialization-of-ak-3-revisited-a-case-study-using-automated-deduction-2501.18601"/></url>
<url><loc>https://scifaro.com/en/abs/rtamt-runtime-robustness-monitors-with-application-to-cps-and-robotics-2501.18608</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rtamt-runtime-robustness-monitors-with-application-to-cps-and-robotics-2501.18608"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rtamt-runtime-robustness-monitors-with-application-to-cps-and-robotics-2501.18608"/></url>
<url><loc>https://scifaro.com/en/abs/deeply-optimizing-the-sat-solver-for-the-ic3-algorithm-2501.18612</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deeply-optimizing-the-sat-solver-for-the-ic3-algorithm-2501.18612"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deeply-optimizing-the-sat-solver-for-the-ic3-algorithm-2501.18612"/></url>
<url><loc>https://scifaro.com/en/abs/a-comprehensive-survey-of-the-lean-4-theorem-prover-architecture-applications-and-advances-2501.18639</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-comprehensive-survey-of-the-lean-4-theorem-prover-architecture-applications-and-advances-2501.18639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-comprehensive-survey-of-the-lean-4-theorem-prover-architecture-applications-and-advances-2501.18639"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-fragments-of-second-order-hyperltl-2501.19046</loc><lastmod>2025-09-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-fragments-of-second-order-hyperltl-2501.19046"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-fragments-of-second-order-hyperltl-2501.19046"/></url>
<url><loc>https://scifaro.com/en/abs/projective-presentations-of-lex-modalities-2501.19187</loc><lastmod>2025-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/projective-presentations-of-lex-modalities-2501.19187"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/projective-presentations-of-lex-modalities-2501.19187"/></url>
<url><loc>https://scifaro.com/en/abs/justact-a-framework-for-auditable-multi-agent-systems-regulated-by-inter-organisational-policies-2502.00138</loc><lastmod>2025-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/justact-a-framework-for-auditable-multi-agent-systems-regulated-by-inter-organisational-policies-2502.00138"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/justact-a-framework-for-auditable-multi-agent-systems-regulated-by-inter-organisational-policies-2502.00138"/></url>
<url><loc>https://scifaro.com/en/abs/behavioural-conformances-based-on-lax-couplings-2502.00224</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/behavioural-conformances-based-on-lax-couplings-2502.00224"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/behavioural-conformances-based-on-lax-couplings-2502.00224"/></url>
<url><loc>https://scifaro.com/en/abs/a-declarative-approach-to-specifying-distributed-algorithms-using-three-valued-modal-logic-2502.00892</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-declarative-approach-to-specifying-distributed-algorithms-using-three-valued-modal-logic-2502.00892"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-declarative-approach-to-specifying-distributed-algorithms-using-three-valued-modal-logic-2502.00892"/></url>
<url><loc>https://scifaro.com/en/abs/a-domain-theoretic-framework-for-conditional-probability-and-bayesian-updating-in-programming-2502.00949</loc><lastmod>2025-02-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-domain-theoretic-framework-for-conditional-probability-and-bayesian-updating-in-programming-2502.00949"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-domain-theoretic-framework-for-conditional-probability-and-bayesian-updating-in-programming-2502.00949"/></url>
<url><loc>https://scifaro.com/en/abs/relators-and-notions-of-simulation-revisited-2502.01790</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relators-and-notions-of-simulation-revisited-2502.01790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relators-and-notions-of-simulation-revisited-2502.01790"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-existential-theory-of-the-reals-enriched-with-integer-powers-of-a-computable-number-2502.02220</loc><lastmod>2025-10-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-existential-theory-of-the-reals-enriched-with-integer-powers-of-a-computable-number-2502.02220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-existential-theory-of-the-reals-enriched-with-integer-powers-of-a-computable-number-2502.02220"/></url>
<url><loc>https://scifaro.com/en/abs/petri-nets-and-higher-dimensional-automata-2502.02354</loc><lastmod>2025-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/petri-nets-and-higher-dimensional-automata-2502.02354"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/petri-nets-and-higher-dimensional-automata-2502.02354"/></url>
<url><loc>https://scifaro.com/en/abs/issy-a-comprehensive-tool-for-specification-and-synthesis-of-infinite-state-reactive-systems-2502.03013</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/issy-a-comprehensive-tool-for-specification-and-synthesis-of-infinite-state-reactive-systems-2502.03013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/issy-a-comprehensive-tool-for-specification-and-synthesis-of-infinite-state-reactive-systems-2502.03013"/></url>
<url><loc>https://scifaro.com/en/abs/complementing-an-imperative-process-algebra-with-a-rely-guarantee-logic-2502.03320</loc><lastmod>2025-09-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complementing-an-imperative-process-algebra-with-a-rely-guarantee-logic-2502.03320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complementing-an-imperative-process-algebra-with-a-rely-guarantee-logic-2502.03320"/></url>
<url><loc>https://scifaro.com/en/abs/simplifying-formal-proof-generating-models-with-chatgpt-and-basic-searching-techniques-2502.03321</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplifying-formal-proof-generating-models-with-chatgpt-and-basic-searching-techniques-2502.03321"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplifying-formal-proof-generating-models-with-chatgpt-and-basic-searching-techniques-2502.03321"/></url>
<url><loc>https://scifaro.com/en/abs/popacheck-a-model-checker-for-probabilistic-pushdown-automata-2502.03956</loc><lastmod>2025-06-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/popacheck-a-model-checker-for-probabilistic-pushdown-automata-2502.03956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/popacheck-a-model-checker-for-probabilistic-pushdown-automata-2502.03956"/></url>
<url><loc>https://scifaro.com/en/abs/infinite-state-model-checking-by-learning-transitive-relations-2502.04761</loc><lastmod>2026-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinite-state-model-checking-by-learning-transitive-relations-2502.04761"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinite-state-model-checking-by-learning-transitive-relations-2502.04761"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-axiomatization-of-branching-bisimilarity-for-a-simple-process-language-with-probabilistic-choice-2502.05631</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-axiomatization-of-branching-bisimilarity-for-a-simple-process-language-with-probabilistic-choice-2502.05631"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-axiomatization-of-branching-bisimilarity-for-a-simple-process-language-with-probabilistic-choice-2502.05631"/></url>
<url><loc>https://scifaro.com/en/abs/the-memory-of-omega-regular-and-bc-sigma-2-0-objectives-2502.05840</loc><lastmod>2025-10-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-memory-of-omega-regular-and-bc-sigma-2-0-objectives-2502.05840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-memory-of-omega-regular-and-bc-sigma-2-0-objectives-2502.05840"/></url>
<url><loc>https://scifaro.com/en/abs/verified-certificates-via-sat-and-computer-algebra-systems-for-the-ramsey-r-3-8-and-r-3-9-problems-2502.06055</loc><lastmod>2025-10-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verified-certificates-via-sat-and-computer-algebra-systems-for-the-ramsey-r-3-8-and-r-3-9-problems-2502.06055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verified-certificates-via-sat-and-computer-algebra-systems-for-the-ramsey-r-3-8-and-r-3-9-problems-2502.06055"/></url>
<url><loc>https://scifaro.com/en/abs/complete-compositional-syntax-for-finite-transducers-on-finite-and-bi-infinite-words-2502.06450</loc><lastmod>2025-02-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-compositional-syntax-for-finite-transducers-on-finite-and-bi-infinite-words-2502.06450"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-compositional-syntax-for-finite-transducers-on-finite-and-bi-infinite-words-2502.06450"/></url>
<url><loc>https://scifaro.com/en/abs/stronger-validity-criteria-for-encoding-synchrony-2502.08307</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/stronger-validity-criteria-for-encoding-synchrony-2502.08307"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/stronger-validity-criteria-for-encoding-synchrony-2502.08307"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-40th-international-conference-on-logic-programming-2502.08453</loc><lastmod>2025-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-40th-international-conference-on-logic-programming-2502.08453"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-40th-international-conference-on-logic-programming-2502.08453"/></url>
<url><loc>https://scifaro.com/en/abs/low-rank-mso-2502.08476</loc><lastmod>2025-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/low-rank-mso-2502.08476"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/low-rank-mso-2502.08476"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-of-digital-circuits-denotation-operational-and-algebraic-semantics-2502.08497</loc><lastmod>2025-02-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-of-digital-circuits-denotation-operational-and-algebraic-semantics-2502.08497"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-of-digital-circuits-denotation-operational-and-algebraic-semantics-2502.08497"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-taylor-expansion-in-cartesian-differential-categories-2502.09066</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-taylor-expansion-in-cartesian-differential-categories-2502.09066"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-taylor-expansion-in-cartesian-differential-categories-2502.09066"/></url>
<url><loc>https://scifaro.com/en/abs/data-structures-for-finite-downsets-of-natural-vectors-theory-and-practice-2502.09189</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data-structures-for-finite-downsets-of-natural-vectors-theory-and-practice-2502.09189"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data-structures-for-finite-downsets-of-natural-vectors-theory-and-practice-2502.09189"/></url>
<url><loc>https://scifaro.com/en/abs/efficient-owl2ql-meta-reasoning-using-asp-based-hybrid-knowledge-bases-2502.09206</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/efficient-owl2ql-meta-reasoning-using-asp-based-hybrid-knowledge-bases-2502.09206"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/efficient-owl2ql-meta-reasoning-using-asp-based-hybrid-knowledge-bases-2502.09206"/></url>
<url><loc>https://scifaro.com/en/abs/autonomous-task-completion-based-on-goal-directed-answer-set-programming-2502.09208</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/autonomous-task-completion-based-on-goal-directed-answer-set-programming-2502.09208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/autonomous-task-completion-based-on-goal-directed-answer-set-programming-2502.09208"/></url>
<url><loc>https://scifaro.com/en/abs/architecture-for-simulating-behavior-mode-changes-in-norm-aware-autonomous-agents-2502.09215</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/architecture-for-simulating-behavior-mode-changes-in-norm-aware-autonomous-agents-2502.09215"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/architecture-for-simulating-behavior-mode-changes-in-norm-aware-autonomous-agents-2502.09215"/></url>
<url><loc>https://scifaro.com/en/abs/data2concept2text-an-explainable-multilingual-framework-for-data-analysis-narration-2502.09218</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/data2concept2text-an-explainable-multilingual-framework-for-data-analysis-narration-2502.09218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/data2concept2text-an-explainable-multilingual-framework-for-data-analysis-narration-2502.09218"/></url>
<url><loc>https://scifaro.com/en/abs/abduction-of-domain-relationships-from-data-for-vqa-2502.09219</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/abduction-of-domain-relationships-from-data-for-vqa-2502.09219"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/abduction-of-domain-relationships-from-data-for-vqa-2502.09219"/></url>
<url><loc>https://scifaro.com/en/abs/graphical-conditions-for-the-existence-unicity-and-number-of-regular-models-2502.09220</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graphical-conditions-for-the-existence-unicity-and-number-of-regular-models-2502.09220"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graphical-conditions-for-the-existence-unicity-and-number-of-regular-models-2502.09220"/></url>
<url><loc>https://scifaro.com/en/abs/a-coq-formalization-of-unification-modulo-exclusive-or-2502.09225</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-coq-formalization-of-unification-modulo-exclusive-or-2502.09225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-coq-formalization-of-unification-modulo-exclusive-or-2502.09225"/></url>
<url><loc>https://scifaro.com/en/abs/bridging-logic-programming-and-deep-learning-for-explainability-through-ilasp-2502.09227</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bridging-logic-programming-and-deep-learning-for-explainability-through-ilasp-2502.09227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bridging-logic-programming-and-deep-learning-for-explainability-through-ilasp-2502.09227"/></url>
<url><loc>https://scifaro.com/en/abs/relating-answer-set-programming-and-many-sorted-logics-for-formal-verification-2502.09230</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/relating-answer-set-programming-and-many-sorted-logics-for-formal-verification-2502.09230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/relating-answer-set-programming-and-many-sorted-logics-for-formal-verification-2502.09230"/></url>
<url><loc>https://scifaro.com/en/abs/logical-foundations-of-smart-contracts-2502.09232</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-foundations-of-smart-contracts-2502.09232"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-foundations-of-smart-contracts-2502.09232"/></url>
<url><loc>https://scifaro.com/en/abs/a-category-theoretic-perspective-on-approximation-fixpoint-theory-2502.09234</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-category-theoretic-perspective-on-approximation-fixpoint-theory-2502.09234"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-category-theoretic-perspective-on-approximation-fixpoint-theory-2502.09234"/></url>
<url><loc>https://scifaro.com/en/abs/early-validation-of-high-level-requirements-on-cyber-physical-systems-2502.09236</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/early-validation-of-high-level-requirements-on-cyber-physical-systems-2502.09236"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/early-validation-of-high-level-requirements-on-cyber-physical-systems-2502.09236"/></url>
<url><loc>https://scifaro.com/en/abs/reliable-conversational-agents-under-asp-control-that-understand-natural-language-2502.09237</loc><lastmod>2025-02-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reliable-conversational-agents-under-asp-control-that-understand-natural-language-2502.09237"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reliable-conversational-agents-under-asp-control-that-understand-natural-language-2502.09237"/></url>
<url><loc>https://scifaro.com/en/abs/a-logical-formalisation-of-a-hypothesis-in-weighted-abduction-towards-user-feedback-dialogues-2502.09989</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logical-formalisation-of-a-hypothesis-in-weighted-abduction-towards-user-feedback-dialogues-2502.09989"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logical-formalisation-of-a-hypothesis-in-weighted-abduction-towards-user-feedback-dialogues-2502.09989"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-symmetries-from-a-set-covering-perspective-2502.10056</loc><lastmod>2026-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-symmetries-from-a-set-covering-perspective-2502.10056"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-symmetries-from-a-set-covering-perspective-2502.10056"/></url>
<url><loc>https://scifaro.com/en/abs/complete-symmetry-breaking-for-finite-models-2502.10155</loc><lastmod>2025-02-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-symmetry-breaking-for-finite-models-2502.10155"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-symmetry-breaking-for-finite-models-2502.10155"/></url>
<url><loc>https://scifaro.com/en/abs/a-program-logic-for-under-approximating-worst-case-resource-usage-2502.11091</loc><lastmod>2026-01-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-program-logic-for-under-approximating-worst-case-resource-usage-2502.11091"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-program-logic-for-under-approximating-worst-case-resource-usage-2502.11091"/></url>
<url><loc>https://scifaro.com/en/abs/changing-the-rules-of-the-game-reasoning-about-dynamic-phenomena-in-multi-agent-systems-2502.11785</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/changing-the-rules-of-the-game-reasoning-about-dynamic-phenomena-in-multi-agent-systems-2502.11785"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/changing-the-rules-of-the-game-reasoning-about-dynamic-phenomena-in-multi-agent-systems-2502.11785"/></url>
<url><loc>https://scifaro.com/en/abs/infinitary-refinement-types-for-temporal-properties-in-scott-domains-2502.11917</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/infinitary-refinement-types-for-temporal-properties-in-scott-domains-2502.11917"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/infinitary-refinement-types-for-temporal-properties-in-scott-domains-2502.11917"/></url>
<url><loc>https://scifaro.com/en/abs/towards-practical-first-order-model-counting-2502.12278</loc><lastmod>2025-06-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-practical-first-order-model-counting-2502.12278"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-practical-first-order-model-counting-2502.12278"/></url>
<url><loc>https://scifaro.com/en/abs/rational-capability-in-concurrent-games-2502.12286</loc><lastmod>2025-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/rational-capability-in-concurrent-games-2502.12286"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/rational-capability-in-concurrent-games-2502.12286"/></url>
<url><loc>https://scifaro.com/en/abs/logic-and-computation-through-the-lens-of-semirings-2502.12939</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logic-and-computation-through-the-lens-of-semirings-2502.12939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logic-and-computation-through-the-lens-of-semirings-2502.12939"/></url>
<url><loc>https://scifaro.com/en/abs/classical-notions-of-computation-and-the-hasegawa-thielecke-theorem-extended-version-2502.13033</loc><lastmod>2025-12-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/classical-notions-of-computation-and-the-hasegawa-thielecke-theorem-extended-version-2502.13033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/classical-notions-of-computation-and-the-hasegawa-thielecke-theorem-extended-version-2502.13033"/></url>
<url><loc>https://scifaro.com/en/abs/on-qualitative-preference-in-alternating-time-temporal-logic-with-strategy-contexts-2502.13436</loc><lastmod>2026-02-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-qualitative-preference-in-alternating-time-temporal-logic-with-strategy-contexts-2502.13436"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-qualitative-preference-in-alternating-time-temporal-logic-with-strategy-contexts-2502.13436"/></url>
<url><loc>https://scifaro.com/en/abs/decentralized-planning-using-probabilistic-hyperproperties-2502.13621</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decentralized-planning-using-probabilistic-hyperproperties-2502.13621"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decentralized-planning-using-probabilistic-hyperproperties-2502.13621"/></url>
<url><loc>https://scifaro.com/en/abs/deontic-action-logics-a-modular-algebraic-perspective-2502.13756</loc><lastmod>2025-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/deontic-action-logics-a-modular-algebraic-perspective-2502.13756"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/deontic-action-logics-a-modular-algebraic-perspective-2502.13756"/></url>
<url><loc>https://scifaro.com/en/abs/fracterm-calculus-for-partial-meadows-2502.13812</loc><lastmod>2026-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fracterm-calculus-for-partial-meadows-2502.13812"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fracterm-calculus-for-partial-meadows-2502.13812"/></url>
<url><loc>https://scifaro.com/en/abs/filo-automated-unification-in-mathcal-fl-0-2502.14130</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/filo-automated-unification-in-mathcal-fl-0-2502.14130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/filo-automated-unification-in-mathcal-fl-0-2502.14130"/></url>
<url><loc>https://scifaro.com/en/abs/a-modal-logic-translation-of-the-agm-axioms-for-belief-revision-2502.14176</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modal-logic-translation-of-the-agm-axioms-for-belief-revision-2502.14176"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modal-logic-translation-of-the-agm-axioms-for-belief-revision-2502.14176"/></url>
<url><loc>https://scifaro.com/en/abs/coverage-types-for-resource-based-policies-2502.14465</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/coverage-types-for-resource-based-policies-2502.14465"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/coverage-types-for-resource-based-policies-2502.14465"/></url>
<url><loc>https://scifaro.com/en/abs/partial-incorrectness-logic-2502.14626</loc><lastmod>2025-02-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/partial-incorrectness-logic-2502.14626"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/partial-incorrectness-logic-2502.14626"/></url>
<url><loc>https://scifaro.com/en/abs/breaking-symmetries-in-quantified-graph-search-a-comparative-study-2502.15078</loc><lastmod>2025-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/breaking-symmetries-in-quantified-graph-search-a-comparative-study-2502.15078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/breaking-symmetries-in-quantified-graph-search-a-comparative-study-2502.15078"/></url>
<url><loc>https://scifaro.com/en/abs/automata-for-enriched-trees-and-applications-2502.15316</loc><lastmod>2025-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automata-for-enriched-trees-and-applications-2502.15316"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automata-for-enriched-trees-and-applications-2502.15316"/></url>
<url><loc>https://scifaro.com/en/abs/a-modular-risk-concept-for-complex-systems-2502.15482</loc><lastmod>2025-08-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-modular-risk-concept-for-complex-systems-2502.15482"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-modular-risk-concept-for-complex-systems-2502.15482"/></url>
<url><loc>https://scifaro.com/en/abs/polytopal-stochastic-games-2502.16208</loc><lastmod>2025-02-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/polytopal-stochastic-games-2502.16208"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/polytopal-stochastic-games-2502.16208"/></url>
<url><loc>https://scifaro.com/en/abs/verifying-quantized-graph-neural-networks-is-pspace-complete-2502.16244</loc><lastmod>2025-08-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verifying-quantized-graph-neural-networks-is-pspace-complete-2502.16244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verifying-quantized-graph-neural-networks-is-pspace-complete-2502.16244"/></url>
<url><loc>https://scifaro.com/en/abs/a-type-theoretic-approach-to-semistrict-higher-categories-2502.17068</loc><lastmod>2025-02-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-semistrict-higher-categories-2502.17068"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-type-theoretic-approach-to-semistrict-higher-categories-2502.17068"/></url>
<url><loc>https://scifaro.com/en/abs/compositional-verification-of-concurrency-using-past-time-temporal-epistemic-logic-2502.18885</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/compositional-verification-of-concurrency-using-past-time-temporal-epistemic-logic-2502.18885"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/compositional-verification-of-concurrency-using-past-time-temporal-epistemic-logic-2502.18885"/></url>
<url><loc>https://scifaro.com/en/abs/distributed-transition-system-with-tags-and-value-wise-metric-for-privacy-analysis-2502.18974</loc><lastmod>2025-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributed-transition-system-with-tags-and-value-wise-metric-for-privacy-analysis-2502.18974"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributed-transition-system-with-tags-and-value-wise-metric-for-privacy-analysis-2502.18974"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-introduction-rule-for-disjunction-2502.19172</loc><lastmod>2025-10-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-introduction-rule-for-disjunction-2502.19172"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-introduction-rule-for-disjunction-2502.19172"/></url>
<url><loc>https://scifaro.com/en/abs/equational-reasoning-modulo-commutativity-in-languages-with-binders-extended-version-2502.19287</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/equational-reasoning-modulo-commutativity-in-languages-with-binders-extended-version-2502.19287"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/equational-reasoning-modulo-commutativity-in-languages-with-binders-extended-version-2502.19287"/></url>
<url><loc>https://scifaro.com/en/abs/generalization-problems-with-atom-variables-in-languages-with-binders-and-equational-theories-2502.19306</loc><lastmod>2025-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalization-problems-with-atom-variables-in-languages-with-binders-and-equational-theories-2502.19306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalization-problems-with-atom-variables-in-languages-with-binders-and-equational-theories-2502.19306"/></url>
<url><loc>https://scifaro.com/en/abs/faithful-logic-embeddings-in-hol-deep-and-shallow-2502.19311</loc><lastmod>2025-06-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/faithful-logic-embeddings-in-hol-deep-and-shallow-2502.19311"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/faithful-logic-embeddings-in-hol-deep-and-shallow-2502.19311"/></url>
<url><loc>https://scifaro.com/en/abs/foundations-for-deductive-verification-of-continuous-probabilistic-programs-from-lebesgue-to-riemann-and-back-2502.19388</loc><lastmod>2025-02-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/foundations-for-deductive-verification-of-continuous-probabilistic-programs-from-lebesgue-to-riemann-and-back-2502.19388"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/foundations-for-deductive-verification-of-continuous-probabilistic-programs-from-lebesgue-to-riemann-and-back-2502.19388"/></url>
<url><loc>https://scifaro.com/en/abs/exploiting-partial-assignment-enumeration-in-optimization-modulo-theories-2502.19963</loc><lastmod>2025-05-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/exploiting-partial-assignment-enumeration-in-optimization-modulo-theories-2502.19963"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/exploiting-partial-assignment-enumeration-in-optimization-modulo-theories-2502.19963"/></url>
<url><loc>https://scifaro.com/en/abs/model-checking-linear-temporal-logic-with-standpoint-modalities-2502.20193</loc><lastmod>2025-02-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/model-checking-linear-temporal-logic-with-standpoint-modalities-2502.20193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/model-checking-linear-temporal-logic-with-standpoint-modalities-2502.20193"/></url>
<url><loc>https://scifaro.com/en/abs/domains-information-frames-rough-sets-an-equivalence-of-categories-2502.20991</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-information-frames-rough-sets-an-equivalence-of-categories-2502.20991"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-information-frames-rough-sets-an-equivalence-of-categories-2502.20991"/></url>
<url><loc>https://scifaro.com/en/abs/proof-systems-for-partial-incorrectness-logic-partial-reverse-hoare-logic-2502.21053</loc><lastmod>2025-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-systems-for-partial-incorrectness-logic-partial-reverse-hoare-logic-2502.21053"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-systems-for-partial-incorrectness-logic-partial-reverse-hoare-logic-2502.21053"/></url>
<url><loc>https://scifaro.com/en/abs/incorrectness-separation-logic-with-arrays-and-pointer-arithmetic-2503.00809</loc><lastmod>2025-03-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/incorrectness-separation-logic-with-arrays-and-pointer-arithmetic-2503.00809"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/incorrectness-separation-logic-with-arrays-and-pointer-arithmetic-2503.00809"/></url>
<url><loc>https://scifaro.com/en/abs/existential-and-positive-games-a-comonadic-and-axiomatic-view-2503.01247</loc><lastmod>2025-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/existential-and-positive-games-a-comonadic-and-axiomatic-view-2503.01247"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/existential-and-positive-games-a-comonadic-and-axiomatic-view-2503.01247"/></url>
<url><loc>https://scifaro.com/en/abs/entailment-vs-verification-for-partial-assignment-satisfiability-and-enumeration-2503.01536</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/entailment-vs-verification-for-partial-assignment-satisfiability-and-enumeration-2503.01536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/entailment-vs-verification-for-partial-assignment-satisfiability-and-enumeration-2503.01536"/></url>
<url><loc>https://scifaro.com/en/abs/boosting-mcsat-modulo-nonlinear-integer-arithmetic-via-local-search-2503.01627</loc><lastmod>2025-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/boosting-mcsat-modulo-nonlinear-integer-arithmetic-via-local-search-2503.01627"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/boosting-mcsat-modulo-nonlinear-integer-arithmetic-via-local-search-2503.01627"/></url>
<url><loc>https://scifaro.com/en/abs/ltl-verification-of-memoryful-neural-agents-2503.02512</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ltl-verification-of-memoryful-neural-agents-2503.02512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ltl-verification-of-memoryful-neural-agents-2503.02512"/></url>
<url><loc>https://scifaro.com/en/abs/on-describing-trees-and-quasi-trees-from-their-leaves-2503.02672</loc><lastmod>2025-03-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-describing-trees-and-quasi-trees-from-their-leaves-2503.02672"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-describing-trees-and-quasi-trees-from-their-leaves-2503.02672"/></url>
<url><loc>https://scifaro.com/en/abs/proof-producing-translation-of-functional-programs-into-a-time-space-reasonable-model-2503.02975</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-producing-translation-of-functional-programs-into-a-time-space-reasonable-model-2503.02975"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-producing-translation-of-functional-programs-into-a-time-space-reasonable-model-2503.02975"/></url>
<url><loc>https://scifaro.com/en/abs/substructural-parametricity-2503.03153</loc><lastmod>2025-03-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/substructural-parametricity-2503.03153"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/substructural-parametricity-2503.03153"/></url>
<url><loc>https://scifaro.com/en/abs/linearization-via-rewriting-long-version-2503.04408</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linearization-via-rewriting-long-version-2503.04408"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linearization-via-rewriting-long-version-2503.04408"/></url>
<url><loc>https://scifaro.com/en/abs/modular-reasoning-about-error-bounds-for-concurrent-probabilistic-programs-extended-version-2503.04512</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modular-reasoning-about-error-bounds-for-concurrent-probabilistic-programs-extended-version-2503.04512"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modular-reasoning-about-error-bounds-for-concurrent-probabilistic-programs-extended-version-2503.04512"/></url>
<url><loc>https://scifaro.com/en/abs/epistemic-logic-programs-non-ground-and-counting-complexity-2503.04731</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/epistemic-logic-programs-non-ground-and-counting-complexity-2503.04731"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/epistemic-logic-programs-non-ground-and-counting-complexity-2503.04731"/></url>
<url><loc>https://scifaro.com/en/abs/games-with-omega-automatic-preference-relations-2503.04759</loc><lastmod>2026-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-with-omega-automatic-preference-relations-2503.04759"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-with-omega-automatic-preference-relations-2503.04759"/></url>
<url><loc>https://scifaro.com/en/abs/safety-verification-of-stochastic-systems-under-signal-temporal-logic-specifications-2503.04762</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/safety-verification-of-stochastic-systems-under-signal-temporal-logic-specifications-2503.04762"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/safety-verification-of-stochastic-systems-under-signal-temporal-logic-specifications-2503.04762"/></url>
<url><loc>https://scifaro.com/en/abs/minif2f-in-rocq-automatic-translation-between-proof-assistants-a-case-study-2503.04763</loc><lastmod>2025-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minif2f-in-rocq-automatic-translation-between-proof-assistants-a-case-study-2503.04763"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minif2f-in-rocq-automatic-translation-between-proof-assistants-a-case-study-2503.04763"/></url>
<url><loc>https://scifaro.com/en/abs/generating-millions-of-lean-theorems-with-proofs-by-exploring-state-transition-graphs-2503.04772</loc><lastmod>2025-03-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generating-millions-of-lean-theorems-with-proofs-by-exploring-state-transition-graphs-2503.04772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generating-millions-of-lean-theorems-with-proofs-by-exploring-state-transition-graphs-2503.04772"/></url>
<url><loc>https://scifaro.com/en/abs/smt-lia-sampling-with-high-diversity-2503.04782</loc><lastmod>2025-09-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-lia-sampling-with-high-diversity-2503.04782"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-lia-sampling-with-high-diversity-2503.04782"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-logical-content-of-knowledge-bases-2503.05355</loc><lastmod>2025-12-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-logical-content-of-knowledge-bases-2503.05355"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-logical-content-of-knowledge-bases-2503.05355"/></url>
<url><loc>https://scifaro.com/en/abs/homomorphic-encryption-of-intuitionistic-logic-proofs-and-functional-programs-a-categorical-approach-inspired-by-composite-order-bilinear-groups-2503.05779</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homomorphic-encryption-of-intuitionistic-logic-proofs-and-functional-programs-a-categorical-approach-inspired-by-composite-order-bilinear-groups-2503.05779"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homomorphic-encryption-of-intuitionistic-logic-proofs-and-functional-programs-a-categorical-approach-inspired-by-composite-order-bilinear-groups-2503.05779"/></url>
<url><loc>https://scifaro.com/en/abs/2-coherent-internal-models-of-homotopical-type-theory-2503.05790</loc><lastmod>2025-08-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/2-coherent-internal-models-of-homotopical-type-theory-2503.05790"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/2-coherent-internal-models-of-homotopical-type-theory-2503.05790"/></url>
<url><loc>https://scifaro.com/en/abs/the-fertile-steppe-computability-logic-and-the-decidability-of-one-of-its-fragments-2503.05826</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-fertile-steppe-computability-logic-and-the-decidability-of-one-of-its-fragments-2503.05826"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-fertile-steppe-computability-logic-and-the-decidability-of-one-of-its-fragments-2503.05826"/></url>
<url><loc>https://scifaro.com/en/abs/some-consistent-power-constructions-2503.06036</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/some-consistent-power-constructions-2503.06036"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/some-consistent-power-constructions-2503.06036"/></url>
<url><loc>https://scifaro.com/en/abs/observation-algebras-heyting-algebra-over-coherence-spaces-2503.07130</loc><lastmod>2025-03-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/observation-algebras-heyting-algebra-over-coherence-spaces-2503.07130"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/observation-algebras-heyting-algebra-over-coherence-spaces-2503.07130"/></url>
<url><loc>https://scifaro.com/en/abs/a-probabilistic-choreography-language-for-prism-2503.08530</loc><lastmod>2026-03-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-probabilistic-choreography-language-for-prism-2503.08530"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-probabilistic-choreography-language-for-prism-2503.08530"/></url>
<url><loc>https://scifaro.com/en/abs/strong-normalization-through-idempotent-intersection-types-a-new-syntactical-approach-2503.09831</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/strong-normalization-through-idempotent-intersection-types-a-new-syntactical-approach-2503.09831"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/strong-normalization-through-idempotent-intersection-types-a-new-syntactical-approach-2503.09831"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-perspective-on-constraint-satisfaction-the-wonderland-of-adjunctions-2503.10353</loc><lastmod>2026-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-perspective-on-constraint-satisfaction-the-wonderland-of-adjunctions-2503.10353"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-perspective-on-constraint-satisfaction-the-wonderland-of-adjunctions-2503.10353"/></url>
<url><loc>https://scifaro.com/en/abs/synthesis-with-guided-environments-2503.10819</loc><lastmod>2025-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesis-with-guided-environments-2503.10819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesis-with-guided-environments-2503.10819"/></url>
<url><loc>https://scifaro.com/en/abs/research-vision-multi-agent-path-planning-for-cops-and-robbers-via-reactive-synthesis-2503.11475</loc><lastmod>2025-03-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/research-vision-multi-agent-path-planning-for-cops-and-robbers-via-reactive-synthesis-2503.11475"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/research-vision-multi-agent-path-planning-for-cops-and-robbers-via-reactive-synthesis-2503.11475"/></url>
<url><loc>https://scifaro.com/en/abs/structural-liveness-of-conservative-petri-nets-2503.11590</loc><lastmod>2026-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/structural-liveness-of-conservative-petri-nets-2503.11590"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/structural-liveness-of-conservative-petri-nets-2503.11590"/></url>
<url><loc>https://scifaro.com/en/abs/picid-proof-driven-clause-learning-in-neural-network-verification-2503.12083</loc><lastmod>2026-02-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/picid-proof-driven-clause-learning-in-neural-network-verification-2503.12083"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/picid-proof-driven-clause-learning-in-neural-network-verification-2503.12083"/></url>
<url><loc>https://scifaro.com/en/abs/distribution-free-modal-logics-sahlqvist-van-benthem-correspondence-2503.12523</loc><lastmod>2025-11-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distribution-free-modal-logics-sahlqvist-van-benthem-correspondence-2503.12523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distribution-free-modal-logics-sahlqvist-van-benthem-correspondence-2503.12523"/></url>
<url><loc>https://scifaro.com/en/abs/propositional-dynamic-logic-has-craig-interpolation-a-tableau-based-proof-2503.13276</loc><lastmod>2025-03-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/propositional-dynamic-logic-has-craig-interpolation-a-tableau-based-proof-2503.13276"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/propositional-dynamic-logic-has-craig-interpolation-a-tableau-based-proof-2503.13276"/></url>
<url><loc>https://scifaro.com/en/abs/eggs-are-adhesive-2503.13678</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/eggs-are-adhesive-2503.13678"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/eggs-are-adhesive-2503.13678"/></url>
<url><loc>https://scifaro.com/en/abs/shock-with-confidence-formal-proofs-of-correctness-for-hyperbolic-partial-differential-equation-solvers-2503.13877</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/shock-with-confidence-formal-proofs-of-correctness-for-hyperbolic-partial-differential-equation-solvers-2503.13877"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/shock-with-confidence-formal-proofs-of-correctness-for-hyperbolic-partial-differential-equation-solvers-2503.13877"/></url>
<url><loc>https://scifaro.com/en/abs/testing-uniform-random-samplers-methods-datasets-and-protocols-2503.14079</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/testing-uniform-random-samplers-methods-datasets-and-protocols-2503.14079"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/testing-uniform-random-samplers-methods-datasets-and-protocols-2503.14079"/></url>
<url><loc>https://scifaro.com/en/abs/trustworthy-verification-of-risc-v-binaries-using-symbolic-execution-in-holba-2503.14135</loc><lastmod>2025-03-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trustworthy-verification-of-risc-v-binaries-using-symbolic-execution-in-holba-2503.14135"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trustworthy-verification-of-risc-v-binaries-using-symbolic-execution-in-holba-2503.14135"/></url>
<url><loc>https://scifaro.com/en/abs/case-study-verified-vampire-proofs-in-the-lambdapi-calculus-modulo-2503.15541</loc><lastmod>2025-09-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/case-study-verified-vampire-proofs-in-the-lambdapi-calculus-modulo-2503.15541"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/case-study-verified-vampire-proofs-in-the-lambdapi-calculus-modulo-2503.15541"/></url>
<url><loc>https://scifaro.com/en/abs/a-logic-of-uncertain-interpretation-2503.15544</loc><lastmod>2025-03-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-logic-of-uncertain-interpretation-2503.15544"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-logic-of-uncertain-interpretation-2503.15544"/></url>
<url><loc>https://scifaro.com/en/abs/trees-in-coalgebra-from-generalized-reachability-2503.15585</loc><lastmod>2026-01-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/trees-in-coalgebra-from-generalized-reachability-2503.15585"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/trees-in-coalgebra-from-generalized-reachability-2503.15585"/></url>
<url><loc>https://scifaro.com/en/abs/automatic-generation-of-safety-compliant-linear-temporal-logic-via-large-language-model-a-self-supervised-framework-2503.15840</loc><lastmod>2026-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automatic-generation-of-safety-compliant-linear-temporal-logic-via-large-language-model-a-self-supervised-framework-2503.15840"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automatic-generation-of-safety-compliant-linear-temporal-logic-via-large-language-model-a-self-supervised-framework-2503.15840"/></url>
<url><loc>https://scifaro.com/en/abs/verification-and-external-parameter-inference-for-stochastic-world-models-2503.16034</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/verification-and-external-parameter-inference-for-stochastic-world-models-2503.16034"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/verification-and-external-parameter-inference-for-stochastic-world-models-2503.16034"/></url>
<url><loc>https://scifaro.com/en/abs/towards-learning-infinite-smt-models-work-in-progress-2503.16982</loc><lastmod>2025-03-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-learning-infinite-smt-models-work-in-progress-2503.16982"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-learning-infinite-smt-models-work-in-progress-2503.16982"/></url>
<url><loc>https://scifaro.com/en/abs/distributive-laws-of-monadic-containers-2503.17191</loc><lastmod>2025-06-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/distributive-laws-of-monadic-containers-2503.17191"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/distributive-laws-of-monadic-containers-2503.17191"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-parameterized-systems-based-on-induction-2503.18030</loc><lastmod>2025-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-parameterized-systems-based-on-induction-2503.18030"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-parameterized-systems-based-on-induction-2503.18030"/></url>
<url><loc>https://scifaro.com/en/abs/intuitionistic-modal-logics-new-and-simpler-decidability-proofs-for-fik-and-lik-2503.18714</loc><lastmod>2025-03-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/intuitionistic-modal-logics-new-and-simpler-decidability-proofs-for-fik-and-lik-2503.18714"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/intuitionistic-modal-logics-new-and-simpler-decidability-proofs-for-fik-and-lik-2503.18714"/></url>
<url><loc>https://scifaro.com/en/abs/simplifier-a-new-tool-for-boolean-circuit-simplification-2503.19103</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplifier-a-new-tool-for-boolean-circuit-simplification-2503.19103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplifier-a-new-tool-for-boolean-circuit-simplification-2503.19103"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-of-the-fourteenth-and-fifteenth-international-workshop-on-graph-computation-models-2503.19632</loc><lastmod>2025-03-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-of-the-fourteenth-and-fifteenth-international-workshop-on-graph-computation-models-2503.19632"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-of-the-fourteenth-and-fifteenth-international-workshop-on-graph-computation-models-2503.19632"/></url>
<url><loc>https://scifaro.com/en/abs/translating-workflow-nets-into-the-partially-ordered-workflow-language-2503.20363</loc><lastmod>2025-09-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/translating-workflow-nets-into-the-partially-ordered-workflow-language-2503.20363"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/translating-workflow-nets-into-the-partially-ordered-workflow-language-2503.20363"/></url>
<url><loc>https://scifaro.com/en/abs/zippy-generic-white-box-proof-search-with-zippers-2503.20413</loc><lastmod>2025-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/zippy-generic-white-box-proof-search-with-zippers-2503.20413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/zippy-generic-white-box-proof-search-with-zippers-2503.20413"/></url>
<url><loc>https://scifaro.com/en/abs/inclusion-with-repetitions-and-boolean-constants-implication-problems-revisited-2503.20647</loc><lastmod>2025-05-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inclusion-with-repetitions-and-boolean-constants-implication-problems-revisited-2503.20647"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inclusion-with-repetitions-and-boolean-constants-implication-problems-revisited-2503.20647"/></url>
<url><loc>https://scifaro.com/en/abs/four-imprints-of-belnap-s-useful-four-valued-logic-in-computer-science-2503.20679</loc><lastmod>2025-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/four-imprints-of-belnap-s-useful-four-valued-logic-in-computer-science-2503.20679"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/four-imprints-of-belnap-s-useful-four-valued-logic-in-computer-science-2503.20679"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-approach-to-weighted-answer-set-programming-2503.20849</loc><lastmod>2025-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-approach-to-weighted-answer-set-programming-2503.20849"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-approach-to-weighted-answer-set-programming-2503.20849"/></url>
<url><loc>https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2503.21852</loc><lastmod>2026-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2503.21852"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-the-usage-of-window-counting-constraints-in-the-synthesis-of-reactive-systems-to-reduce-state-space-explosion-2503.21852"/></url>
<url><loc>https://scifaro.com/en/abs/monitoring-spatially-distributed-cyber-physical-systems-with-alternating-finite-automata-2503.21906</loc><lastmod>2025-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/monitoring-spatially-distributed-cyber-physical-systems-with-alternating-finite-automata-2503.21906"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/monitoring-spatially-distributed-cyber-physical-systems-with-alternating-finite-automata-2503.21906"/></url>
<url><loc>https://scifaro.com/en/abs/tape-diagrams-for-monoidal-monads-2503.22819</loc><lastmod>2025-04-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tape-diagrams-for-monoidal-monads-2503.22819"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tape-diagrams-for-monoidal-monads-2503.22819"/></url>
<url><loc>https://scifaro.com/en/abs/a-sat-centered-xai-method-for-deep-learning-based-video-understanding-2503.23870</loc><lastmod>2025-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sat-centered-xai-method-for-deep-learning-based-video-understanding-2503.23870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sat-centered-xai-method-for-deep-learning-based-video-understanding-2503.23870"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-mental-temporal-logic-for-intelligent-agent-2503.24078</loc><lastmod>2025-06-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-mental-temporal-logic-for-intelligent-agent-2503.24078"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-mental-temporal-logic-for-intelligent-agent-2503.24078"/></url>
<url><loc>https://scifaro.com/en/abs/from-learnable-objects-to-learnable-random-objects-2504.00847</loc><lastmod>2025-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-learnable-objects-to-learnable-random-objects-2504.00847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-learnable-objects-to-learnable-random-objects-2504.00847"/></url>
<url><loc>https://scifaro.com/en/abs/confluence-of-conditional-rewriting-modulo-2504.01847</loc><lastmod>2026-02-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/confluence-of-conditional-rewriting-modulo-2504.01847"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/confluence-of-conditional-rewriting-modulo-2504.01847"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-modal-logic-via-logical-categories-2504.02985</loc><lastmod>2025-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-modal-logic-via-logical-categories-2504.02985"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-modal-logic-via-logical-categories-2504.02985"/></url>
<url><loc>https://scifaro.com/en/abs/fuzzy-implicative-rules-a-unified-approach-2504.03000</loc><lastmod>2025-10-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/fuzzy-implicative-rules-a-unified-approach-2504.03000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/fuzzy-implicative-rules-a-unified-approach-2504.03000"/></url>
<url><loc>https://scifaro.com/en/abs/linear-decomposition-of-the-majority-boolean-function-using-the-ones-on-smaller-variables-2504.03262</loc><lastmod>2025-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/linear-decomposition-of-the-majority-boolean-function-using-the-ones-on-smaller-variables-2504.03262"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/linear-decomposition-of-the-majority-boolean-function-using-the-ones-on-smaller-variables-2504.03262"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-consistency-of-stronger-lower-bounds-for-nexp-2504.03320</loc><lastmod>2025-11-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-consistency-of-stronger-lower-bounds-for-nexp-2504.03320"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-consistency-of-stronger-lower-bounds-for-nexp-2504.03320"/></url>
<url><loc>https://scifaro.com/en/abs/complete-first-order-game-logic-2504.03495</loc><lastmod>2025-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complete-first-order-game-logic-2504.03495"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complete-first-order-game-logic-2504.03495"/></url>
<url><loc>https://scifaro.com/en/abs/a-framework-for-computing-upper-bounds-in-passive-learning-settings-2504.03517</loc><lastmod>2025-06-04</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-framework-for-computing-upper-bounds-in-passive-learning-settings-2504.03517"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-framework-for-computing-upper-bounds-in-passive-learning-settings-2504.03517"/></url>
<url><loc>https://scifaro.com/en/abs/undefinability-of-approximation-of-2-to-2-games-2504.03523</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undefinability-of-approximation-of-2-to-2-games-2504.03523"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undefinability-of-approximation-of-2-to-2-games-2504.03523"/></url>
<url><loc>https://scifaro.com/en/abs/supermartingales-for-unique-fixed-points-a-unified-approach-to-lower-bound-verification-2504.04132</loc><lastmod>2026-04-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/supermartingales-for-unique-fixed-points-a-unified-approach-to-lower-bound-verification-2504.04132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/supermartingales-for-unique-fixed-points-a-unified-approach-to-lower-bound-verification-2504.04132"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-foundation-of-rough-sets-2504.04218</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-foundation-of-rough-sets-2504.04218"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-foundation-of-rough-sets-2504.04218"/></url>
<url><loc>https://scifaro.com/en/abs/pvass-reachability-is-decidable-2504.05015</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/pvass-reachability-is-decidable-2504.05015"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/pvass-reachability-is-decidable-2504.05015"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-supermartingale-certificates-2504.05065</loc><lastmod>2025-04-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-supermartingale-certificates-2504.05065"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-supermartingale-certificates-2504.05065"/></url>
<url><loc>https://scifaro.com/en/abs/from-sound-workflow-nets-to-ltlf-declarative-specifications-by-casting-three-spells-2504.05114</loc><lastmod>2026-02-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/from-sound-workflow-nets-to-ltlf-declarative-specifications-by-casting-three-spells-2504.05114"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/from-sound-workflow-nets-to-ltlf-declarative-specifications-by-casting-three-spells-2504.05114"/></url>
<url><loc>https://scifaro.com/en/abs/generalized-parameter-lifting-finer-abstractions-for-parametric-markov-chains-2504.05965</loc><lastmod>2025-08-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/generalized-parameter-lifting-finer-abstractions-for-parametric-markov-chains-2504.05965"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/generalized-parameter-lifting-finer-abstractions-for-parametric-markov-chains-2504.05965"/></url>
<url><loc>https://scifaro.com/en/abs/canonical-for-automated-theorem-proving-in-lean-2504.06239</loc><lastmod>2025-09-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/canonical-for-automated-theorem-proving-in-lean-2504.06239"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/canonical-for-automated-theorem-proving-in-lean-2504.06239"/></url>
<url><loc>https://scifaro.com/en/abs/a-no-go-theorem-for-coalgebraic-product-construction-2504.06592</loc><lastmod>2026-02-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-no-go-theorem-for-coalgebraic-product-construction-2504.06592"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-no-go-theorem-for-coalgebraic-product-construction-2504.06592"/></url>
<url><loc>https://scifaro.com/en/abs/when-is-the-partial-map-classifier-a-sierpi-nski-cone-2504.06789</loc><lastmod>2025-05-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/when-is-the-partial-map-classifier-a-sierpi-nski-cone-2504.06789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/when-is-the-partial-map-classifier-a-sierpi-nski-cone-2504.06789"/></url>
<url><loc>https://scifaro.com/en/abs/a-uniform-framework-for-handling-position-constraints-in-string-solving-technical-report-2504.07033</loc><lastmod>2025-04-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-uniform-framework-for-handling-position-constraints-in-string-solving-technical-report-2504.07033"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-uniform-framework-for-handling-position-constraints-in-string-solving-technical-report-2504.07033"/></url>
<url><loc>https://scifaro.com/en/abs/formalizing-representation-theorems-for-a-logical-framework-with-rewriting-2504.07537</loc><lastmod>2026-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formalizing-representation-theorems-for-a-logical-framework-with-rewriting-2504.07537"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formalizing-representation-theorems-for-a-logical-framework-with-rewriting-2504.07537"/></url>
<url><loc>https://scifaro.com/en/abs/towards-a-computational-quantum-logic-an-overview-of-an-ongoing-research-program-2504.07609</loc><lastmod>2025-06-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/towards-a-computational-quantum-logic-an-overview-of-an-ongoing-research-program-2504.07609"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/towards-a-computational-quantum-logic-an-overview-of-an-ongoing-research-program-2504.07609"/></url>
<url><loc>https://scifaro.com/en/abs/programs-as-singularities-2504.08075</loc><lastmod>2025-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/programs-as-singularities-2504.08075"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/programs-as-singularities-2504.08075"/></url>
<url><loc>https://scifaro.com/en/abs/a-proof-theoretic-approach-to-the-semantics-of-classical-linear-logic-2504.08349</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-proof-theoretic-approach-to-the-semantics-of-classical-linear-logic-2504.08349"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-proof-theoretic-approach-to-the-semantics-of-classical-linear-logic-2504.08349"/></url>
<url><loc>https://scifaro.com/en/abs/the-complexity-of-generalized-hyperltl-with-stuttering-and-contexts-2504.08509</loc><lastmod>2025-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-complexity-of-generalized-hyperltl-with-stuttering-and-contexts-2504.08509"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-complexity-of-generalized-hyperltl-with-stuttering-and-contexts-2504.08509"/></url>
<url><loc>https://scifaro.com/en/abs/a-complete-formal-specification-and-verification-of-the-besw-software-control-system-of-the-maeslant-storm-surge-barrier-2504.08518</loc><lastmod>2025-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-complete-formal-specification-and-verification-of-the-besw-software-control-system-of-the-maeslant-storm-surge-barrier-2504.08518"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-complete-formal-specification-and-verification-of-the-besw-software-control-system-of-the-maeslant-storm-surge-barrier-2504.08518"/></url>
<url><loc>https://scifaro.com/en/abs/prophecies-all-the-way-game-based-model-checking-for-hyperqptl-beyond-forall-exists-2504.08575</loc><lastmod>2025-08-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/prophecies-all-the-way-game-based-model-checking-for-hyperqptl-beyond-forall-exists-2504.08575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/prophecies-all-the-way-game-based-model-checking-for-hyperqptl-beyond-forall-exists-2504.08575"/></url>
<url><loc>https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-generalized-graph-transformation-systems-full-version-2504.08617</loc><lastmod>2025-04-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-generalized-graph-transformation-systems-full-version-2504.08617"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/counterexample-guided-abstraction-refinement-for-generalized-graph-transformation-systems-full-version-2504.08617"/></url>
<url><loc>https://scifaro.com/en/abs/constructing-witnesses-for-lower-bounds-on-behavioural-distances-2504.08639</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/constructing-witnesses-for-lower-bounds-on-behavioural-distances-2504.08639"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/constructing-witnesses-for-lower-bounds-on-behavioural-distances-2504.08639"/></url>
<url><loc>https://scifaro.com/en/abs/a-convergence-law-for-continuous-logic-and-continuous-structures-with-finite-domains-2504.08923</loc><lastmod>2026-05-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-convergence-law-for-continuous-logic-and-continuous-structures-with-finite-domains-2504.08923"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-convergence-law-for-continuous-logic-and-continuous-structures-with-finite-domains-2504.08923"/></url>
<url><loc>https://scifaro.com/en/abs/probabilistic-strategies-definability-and-the-tensor-completeness-problem-2504.09392</loc><lastmod>2025-08-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/probabilistic-strategies-definability-and-the-tensor-completeness-problem-2504.09392"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/probabilistic-strategies-definability-and-the-tensor-completeness-problem-2504.09392"/></url>
<url><loc>https://scifaro.com/en/abs/simplified-and-verified-a-second-look-at-a-proof-producing-union-find-algorithm-2504.10246</loc><lastmod>2025-08-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/simplified-and-verified-a-second-look-at-a-proof-producing-union-find-algorithm-2504.10246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/simplified-and-verified-a-second-look-at-a-proof-producing-union-find-algorithm-2504.10246"/></url>
<url><loc>https://scifaro.com/en/abs/cumulative-time-signal-temporal-logic-2504.10325</loc><lastmod>2025-04-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cumulative-time-signal-temporal-logic-2504.10325"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cumulative-time-signal-temporal-logic-2504.10325"/></url>
<url><loc>https://scifaro.com/en/abs/doctrinal-semantics-of-directed-first-order-logic-2504.11225</loc><lastmod>2026-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/doctrinal-semantics-of-directed-first-order-logic-2504.11225"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/doctrinal-semantics-of-directed-first-order-logic-2504.11225"/></url>
<url><loc>https://scifaro.com/en/abs/an-algebraic-extension-of-intuitionistic-linear-logic-the-l-s-calculus-and-its-categorical-model-2504.12128</loc><lastmod>2025-12-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-algebraic-extension-of-intuitionistic-linear-logic-the-l-s-calculus-and-its-categorical-model-2504.12128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-algebraic-extension-of-intuitionistic-linear-logic-the-l-s-calculus-and-its-categorical-model-2504.12128"/></url>
<url><loc>https://scifaro.com/en/abs/domains-information-frames-and-their-logic-2504.12182</loc><lastmod>2025-07-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/domains-information-frames-and-their-logic-2504.12182"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/domains-information-frames-and-their-logic-2504.12182"/></url>
<url><loc>https://scifaro.com/en/abs/branching-bisimulation-learning-2504.12246</loc><lastmod>2025-05-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/branching-bisimulation-learning-2504.12246"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/branching-bisimulation-learning-2504.12246"/></url>
<url><loc>https://scifaro.com/en/abs/anonymous-public-announcements-2504.12546</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/anonymous-public-announcements-2504.12546"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/anonymous-public-announcements-2504.12546"/></url>
<url><loc>https://scifaro.com/en/abs/refinement-orders-for-quantum-programs-2504.14158</loc><lastmod>2026-02-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/refinement-orders-for-quantum-programs-2504.14158"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/refinement-orders-for-quantum-programs-2504.14158"/></url>
<url><loc>https://scifaro.com/en/abs/ordered-completion-for-non-locally-tight-mini-gringo-programs-2504.14252</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ordered-completion-for-non-locally-tight-mini-gringo-programs-2504.14252"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ordered-completion-for-non-locally-tight-mini-gringo-programs-2504.14252"/></url>
<url><loc>https://scifaro.com/en/abs/convergence-laws-for-extensions-of-first-order-logic-with-averaging-2504.14270</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/convergence-laws-for-extensions-of-first-order-logic-with-averaging-2504.14270"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/convergence-laws-for-extensions-of-first-order-logic-with-averaging-2504.14270"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-proofs-in-hoare-logic-and-its-reverse-2504.14283</loc><lastmod>2026-03-03</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-proofs-in-hoare-logic-and-its-reverse-2504.14283"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-proofs-in-hoare-logic-and-its-reverse-2504.14283"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-p-adic-skolem-problem-2504.14413</loc><lastmod>2026-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-p-adic-skolem-problem-2504.14413"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-p-adic-skolem-problem-2504.14413"/></url>
<url><loc>https://scifaro.com/en/abs/proof-scores-a-survey-full-version-2504.14561</loc><lastmod>2025-04-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proof-scores-a-survey-full-version-2504.14561"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proof-scores-a-survey-full-version-2504.14561"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-boolean-network-theory-of-datalog-neg-2504.15417</loc><lastmod>2025-05-21</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-boolean-network-theory-of-datalog-neg-2504.15417"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-boolean-network-theory-of-datalog-neg-2504.15417"/></url>
<url><loc>https://scifaro.com/en/abs/potential-for-polynomial-solution-for-np-complete-problems-using-quantum-computation-2504.15529</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/potential-for-polynomial-solution-for-np-complete-problems-using-quantum-computation-2504.15529"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/potential-for-polynomial-solution-for-np-complete-problems-using-quantum-computation-2504.15529"/></url>
<url><loc>https://scifaro.com/en/abs/smt-and-functional-equation-solving-over-the-reals-challenges-from-the-imo-2504.15645</loc><lastmod>2025-07-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/smt-and-functional-equation-solving-over-the-reals-challenges-from-the-imo-2504.15645"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/smt-and-functional-equation-solving-over-the-reals-challenges-from-the-imo-2504.15645"/></url>
<url><loc>https://scifaro.com/en/abs/sound-and-complete-invariant-based-heap-encodings-technical-report-2504.15844</loc><lastmod>2026-03-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sound-and-complete-invariant-based-heap-encodings-technical-report-2504.15844"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sound-and-complete-invariant-based-heap-encodings-technical-report-2504.15844"/></url>
<url><loc>https://scifaro.com/en/abs/the-value-problem-for-multiple-environment-mdps-with-parity-objective-2504.15960</loc><lastmod>2025-04-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-value-problem-for-multiple-environment-mdps-with-parity-objective-2504.15960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-value-problem-for-multiple-environment-mdps-with-parity-objective-2504.15960"/></url>
<url><loc>https://scifaro.com/en/abs/synthesiz3-this-an-smt-based-approach-for-synthesis-with-uncomputable-symbols-2504.16536</loc><lastmod>2025-08-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/synthesiz3-this-an-smt-based-approach-for-synthesis-with-uncomputable-symbols-2504.16536"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/synthesiz3-this-an-smt-based-approach-for-synthesis-with-uncomputable-symbols-2504.16536"/></url>
<url><loc>https://scifaro.com/en/abs/adaptive-query-algorithms-for-relational-structures-based-on-homomorphism-counts-2504.16567</loc><lastmod>2025-11-11</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/adaptive-query-algorithms-for-relational-structures-based-on-homomorphism-counts-2504.16567"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/adaptive-query-algorithms-for-relational-structures-based-on-homomorphism-counts-2504.16567"/></url>
<url><loc>https://scifaro.com/en/abs/decidability-problems-for-micro-stipula-2504.16703</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/decidability-problems-for-micro-stipula-2504.16703"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/decidability-problems-for-micro-stipula-2504.16703"/></url>
<url><loc>https://scifaro.com/en/abs/an-expressive-coalgebraic-modal-logic-for-cellular-automata-2504.16735</loc><lastmod>2025-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-expressive-coalgebraic-modal-logic-for-cellular-automata-2504.16735"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-expressive-coalgebraic-modal-logic-for-cellular-automata-2504.16735"/></url>
<url><loc>https://scifaro.com/en/abs/symmetric-proofs-in-the-ideal-proof-system-2504.16820</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/symmetric-proofs-in-the-ideal-proof-system-2504.16820"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/symmetric-proofs-in-the-ideal-proof-system-2504.16820"/></url>
<url><loc>https://scifaro.com/en/abs/formal-verification-of-blockchain-nonforking-in-dag-based-bft-consensus-with-dynamic-stake-2504.16853</loc><lastmod>2025-04-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-verification-of-blockchain-nonforking-in-dag-based-bft-consensus-with-dynamic-stake-2504.16853"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-verification-of-blockchain-nonforking-in-dag-based-bft-consensus-with-dynamic-stake-2504.16853"/></url>
<url><loc>https://scifaro.com/en/abs/analyzing-value-functions-of-states-in-parametric-markov-chains-2504.17020</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/analyzing-value-functions-of-states-in-parametric-markov-chains-2504.17020"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/analyzing-value-functions-of-states-in-parametric-markov-chains-2504.17020"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-store-and-visibility-in-name-passing-calculi-2504.17350</loc><lastmod>2025-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-store-and-visibility-in-name-passing-calculi-2504.17350"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-store-and-visibility-in-name-passing-calculi-2504.17350"/></url>
<url><loc>https://scifaro.com/en/abs/a-constraint-opinion-model-2504.17605</loc><lastmod>2025-04-25</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-constraint-opinion-model-2504.17605"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-constraint-opinion-model-2504.17605"/></url>
<url><loc>https://scifaro.com/en/abs/categorical-generalization-of-spectral-decomposition-2504.17956</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/categorical-generalization-of-spectral-decomposition-2504.17956"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/categorical-generalization-of-spectral-decomposition-2504.17956"/></url>
<url><loc>https://scifaro.com/en/abs/tutte-s-theorem-as-an-educational-formalization-project-2504.18146</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tutte-s-theorem-as-an-educational-formalization-project-2504.18146"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tutte-s-theorem-as-an-educational-formalization-project-2504.18146"/></url>
<url><loc>https://scifaro.com/en/abs/games-mobile-processes-and-functionss-alternating-concurrent-and-well-bracketed-semantics-2504.18227</loc><lastmod>2026-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/games-mobile-processes-and-functionss-alternating-concurrent-and-well-bracketed-semantics-2504.18227"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/games-mobile-processes-and-functionss-alternating-concurrent-and-well-bracketed-semantics-2504.18227"/></url>
<url><loc>https://scifaro.com/en/abs/tree-rewriting-calculi-for-strictly-positive-logics-2504.18240</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/tree-rewriting-calculi-for-strictly-positive-logics-2504.18240"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/tree-rewriting-calculi-for-strictly-positive-logics-2504.18240"/></url>
<url><loc>https://scifaro.com/en/abs/multiplicative-rewards-in-markovian-models-2504.18277</loc><lastmod>2025-06-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/multiplicative-rewards-in-markovian-models-2504.18277"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/multiplicative-rewards-in-markovian-models-2504.18277"/></url>
<url><loc>https://scifaro.com/en/abs/automated-consistency-analysis-for-legal-contracts-2504.18422</loc><lastmod>2025-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/automated-consistency-analysis-for-legal-contracts-2504.18422"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/automated-consistency-analysis-for-legal-contracts-2504.18422"/></url>
<url><loc>https://scifaro.com/en/abs/expectation-based-analysis-of-higher-order-quantum-programs-2504.18441</loc><lastmod>2026-01-26</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/expectation-based-analysis-of-higher-order-quantum-programs-2504.18441"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/expectation-based-analysis-of-higher-order-quantum-programs-2504.18441"/></url>
<url><loc>https://scifaro.com/en/abs/cubing-for-tuning-2504.19039</loc><lastmod>2025-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cubing-for-tuning-2504.19039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cubing-for-tuning-2504.19039"/></url>
<url><loc>https://scifaro.com/en/abs/detecting-speculative-data-flow-vulnerabilities-using-weakest-precondition-reasoning-2504.19128</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/detecting-speculative-data-flow-vulnerabilities-using-weakest-precondition-reasoning-2504.19128"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/detecting-speculative-data-flow-vulnerabilities-using-weakest-precondition-reasoning-2504.19128"/></url>
<url><loc>https://scifaro.com/en/abs/the-satisfiability-and-validity-problems-for-probabilistic-computational-tree-logic-are-highly-undecidable-2504.19207</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-satisfiability-and-validity-problems-for-probabilistic-computational-tree-logic-are-highly-undecidable-2504.19207"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-satisfiability-and-validity-problems-for-probabilistic-computational-tree-logic-are-highly-undecidable-2504.19207"/></url>
<url><loc>https://scifaro.com/en/abs/positive-almost-sure-termination-of-polynomial-random-walks-2504.19575</loc><lastmod>2025-06-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/positive-almost-sure-termination-of-polynomial-random-walks-2504.19575"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/positive-almost-sure-termination-of-polynomial-random-walks-2504.19575"/></url>
<url><loc>https://scifaro.com/en/abs/high-level-message-sequence-charts-satisfiability-and-realizability-revisited-2504.19814</loc><lastmod>2025-04-29</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/high-level-message-sequence-charts-satisfiability-and-realizability-revisited-2504.19814"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/high-level-message-sequence-charts-satisfiability-and-realizability-revisited-2504.19814"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-gkat-completeness-and-complexity-2504.20385</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-gkat-completeness-and-complexity-2504.20385"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-gkat-completeness-and-complexity-2504.20385"/></url>
<url><loc>https://scifaro.com/en/abs/undecidability-of-the-emptiness-problem-of-deterministic-propositional-while-programs-with-graph-loop-hypothesis-elimination-using-loops-2504.20415</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/undecidability-of-the-emptiness-problem-of-deterministic-propositional-while-programs-with-graph-loop-hypothesis-elimination-using-loops-2504.20415"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/undecidability-of-the-emptiness-problem-of-deterministic-propositional-while-programs-with-graph-loop-hypothesis-elimination-using-loops-2504.20415"/></url>
<url><loc>https://scifaro.com/en/abs/separation-and-definability-in-fragments-of-two-variable-first-order-logic-with-counting-2504.20491</loc><lastmod>2025-08-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/separation-and-definability-in-fragments-of-two-variable-first-order-logic-with-counting-2504.20491"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/separation-and-definability-in-fragments-of-two-variable-first-order-logic-with-counting-2504.20491"/></url>
<url><loc>https://scifaro.com/en/abs/turing-machines-deciders-part-i-2504.20563</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/turing-machines-deciders-part-i-2504.20563"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/turing-machines-deciders-part-i-2504.20563"/></url>
<url><loc>https://scifaro.com/en/abs/bayesian-inference-in-quantum-programs-2504.20732</loc><lastmod>2025-04-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/bayesian-inference-in-quantum-programs-2504.20732"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/bayesian-inference-in-quantum-programs-2504.20732"/></url>
<url><loc>https://scifaro.com/en/abs/nominal-anti-unification-2504.21097</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/nominal-anti-unification-2504.21097"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/nominal-anti-unification-2504.21097"/></url>
<url><loc>https://scifaro.com/en/abs/on-asynchronous-multiparty-session-types-for-federated-learning-2504.21108</loc><lastmod>2026-03-27</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-asynchronous-multiparty-session-types-for-federated-learning-2504.21108"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-asynchronous-multiparty-session-types-for-federated-learning-2504.21108"/></url>
<url><loc>https://scifaro.com/en/abs/kimina-lean-server-a-high-performance-lean-server-for-large-scale-verification-2504.21230</loc><lastmod>2025-12-17</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/kimina-lean-server-a-high-performance-lean-server-for-large-scale-verification-2504.21230"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/kimina-lean-server-a-high-performance-lean-server-for-large-scale-verification-2504.21230"/></url>
<url><loc>https://scifaro.com/en/abs/logical-modelling-in-cs-education-bridging-the-natural-language-gap-2504.21384</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/logical-modelling-in-cs-education-bridging-the-natural-language-gap-2504.21384"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/logical-modelling-in-cs-education-bridging-the-natural-language-gap-2504.21384"/></url>
<url><loc>https://scifaro.com/en/abs/an-intermediate-program-representation-for-optimizing-stream-based-languages-2504.21458</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/an-intermediate-program-representation-for-optimizing-stream-based-languages-2504.21458"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/an-intermediate-program-representation-for-optimizing-stream-based-languages-2504.21458"/></url>
<url><loc>https://scifaro.com/en/abs/complexities-of-well-quasi-ordered-substructural-logics-2504.21674</loc><lastmod>2025-05-01</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/complexities-of-well-quasi-ordered-substructural-logics-2504.21674"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/complexities-of-well-quasi-ordered-substructural-logics-2504.21674"/></url>
<url><loc>https://scifaro.com/en/abs/reducing-student-distraction-through-fuzzy-logic-based-seating-arrangements-2505.00545</loc><lastmod>2025-05-02</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/reducing-student-distraction-through-fuzzy-logic-based-seating-arrangements-2505.00545"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/reducing-student-distraction-through-fuzzy-logic-based-seating-arrangements-2505.00545"/></url>
<url><loc>https://scifaro.com/en/abs/e-graphs-with-bindings-2505.00807</loc><lastmod>2025-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/e-graphs-with-bindings-2505.00807"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/e-graphs-with-bindings-2505.00807"/></url>
<url><loc>https://scifaro.com/en/abs/on-the-metric-nature-of-differential-logical-relations-2505.00939</loc><lastmod>2025-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-the-metric-nature-of-differential-logical-relations-2505.00939"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-the-metric-nature-of-differential-logical-relations-2505.00939"/></url>
<url><loc>https://scifaro.com/en/abs/regular-expressions-over-countable-words-2505.01039</loc><lastmod>2025-05-05</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/regular-expressions-over-countable-words-2505.01039"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/regular-expressions-over-countable-words-2505.01039"/></url>
<url><loc>https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2505.01193</loc><lastmod>2026-04-28</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2505.01193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/going-deep-and-going-wide-counting-logic-and-homomorphism-indistinguishability-over-graphs-of-bounded-treedepth-and-treewidth-2505.01193"/></url>
<url><loc>https://scifaro.com/en/abs/explainability-by-design-an-experimental-analysis-of-the-legal-coding-process-2505.01944</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/explainability-by-design-an-experimental-analysis-of-the-legal-coding-process-2505.01944"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/explainability-by-design-an-experimental-analysis-of-the-legal-coding-process-2505.01944"/></url>
<url><loc>https://scifaro.com/en/abs/vecsr-virtually-embodied-common-sense-reasoning-system-2505.02144</loc><lastmod>2026-01-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/vecsr-virtually-embodied-common-sense-reasoning-system-2505.02144"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/vecsr-virtually-embodied-common-sense-reasoning-system-2505.02144"/></url>
<url><loc>https://scifaro.com/en/abs/courcelle-s-theorem-without-logic-2505.02771</loc><lastmod>2025-05-06</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/courcelle-s-theorem-without-logic-2505.02771"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/courcelle-s-theorem-without-logic-2505.02771"/></url>
<url><loc>https://scifaro.com/en/abs/a-sequent-calculus-for-trace-formula-implication-2505.03693</loc><lastmod>2025-11-18</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-sequent-calculus-for-trace-formula-implication-2505.03693"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-sequent-calculus-for-trace-formula-implication-2505.03693"/></url>
<url><loc>https://scifaro.com/en/abs/sat-solving-the-poset-cover-problem-2505.04013</loc><lastmod>2025-05-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/sat-solving-the-poset-cover-problem-2505.04013"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/sat-solving-the-poset-cover-problem-2505.04013"/></url>
<url><loc>https://scifaro.com/en/abs/proceedings-the-13th-international-workshop-on-theorem-proving-components-for-educational-software-2505.04677</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/proceedings-the-13th-international-workshop-on-theorem-proving-components-for-educational-software-2505.04677"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/proceedings-the-13th-international-workshop-on-theorem-proving-components-for-educational-software-2505.04677"/></url>
<url><loc>https://scifaro.com/en/abs/being-polite-is-not-enough-and-other-limits-of-theory-combination-2505.04870</loc><lastmod>2025-05-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/being-polite-is-not-enough-and-other-limits-of-theory-combination-2505.04870"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/being-polite-is-not-enough-and-other-limits-of-theory-combination-2505.04870"/></url>
<url><loc>https://scifaro.com/en/abs/the-calculus-of-neo-peircean-relations-2505.05306</loc><lastmod>2026-04-10</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-calculus-of-neo-peircean-relations-2505.05306"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-calculus-of-neo-peircean-relations-2505.05306"/></url>
<url><loc>https://scifaro.com/en/abs/modelling-and-verifying-neuronal-archetypes-in-coq-2505.05362</loc><lastmod>2025-05-09</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/modelling-and-verifying-neuronal-archetypes-in-coq-2505.05362"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/modelling-and-verifying-neuronal-archetypes-in-coq-2505.05362"/></url>
<url><loc>https://scifaro.com/en/abs/gnu-aris-a-web-application-for-students-2505.05986</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/gnu-aris-a-web-application-for-students-2505.05986"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/gnu-aris-a-web-application-for-students-2505.05986"/></url>
<url><loc>https://scifaro.com/en/abs/onlineprover-experience-with-a-visualisation-tool-for-teaching-formal-proofs-2505.05987</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/onlineprover-experience-with-a-visualisation-tool-for-teaching-formal-proofs-2505.05987"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/onlineprover-experience-with-a-visualisation-tool-for-teaching-formal-proofs-2505.05987"/></url>
<url><loc>https://scifaro.com/en/abs/minimal-sequent-calculus-for-teaching-first-order-logic-lessons-learned-2505.05988</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/minimal-sequent-calculus-for-teaching-first-order-logic-lessons-learned-2505.05988"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/minimal-sequent-calculus-for-teaching-first-order-logic-lessons-learned-2505.05988"/></url>
<url><loc>https://scifaro.com/en/abs/maths-with-coq-in-l1-a-pedagogical-experiment-2505.05990</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/maths-with-coq-in-l1-a-pedagogical-experiment-2505.05990"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/maths-with-coq-in-l1-a-pedagogical-experiment-2505.05990"/></url>
<url><loc>https://scifaro.com/en/abs/operator-spaces-linear-logic-and-the-heisenberg-schr-odinger-duality-of-quantum-theory-2505.06069</loc><lastmod>2025-05-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/operator-spaces-linear-logic-and-the-heisenberg-schr-odinger-duality-of-quantum-theory-2505.06069"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/operator-spaces-linear-logic-and-the-heisenberg-schr-odinger-duality-of-quantum-theory-2505.06069"/></url>
<url><loc>https://scifaro.com/en/abs/ohana-trees-linear-approximation-and-multi-types-for-the-lambda-i-calculus-no-variable-gets-left-behind-or-forgotten-2505.06193</loc><lastmod>2026-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/ohana-trees-linear-approximation-and-multi-types-for-the-lambda-i-calculus-no-variable-gets-left-behind-or-forgotten-2505.06193"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/ohana-trees-linear-approximation-and-multi-types-for-the-lambda-i-calculus-no-variable-gets-left-behind-or-forgotten-2505.06193"/></url>
<url><loc>https://scifaro.com/en/abs/varieties-of-distributed-knowledge-2505.06619</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/varieties-of-distributed-knowledge-2505.06619"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/varieties-of-distributed-knowledge-2505.06619"/></url>
<url><loc>https://scifaro.com/en/abs/lprl-an-asynchronous-linear-time-hyper-logic-2505.06750</loc><lastmod>2026-01-22</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/lprl-an-asynchronous-linear-time-hyper-logic-2505.06750"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/lprl-an-asynchronous-linear-time-hyper-logic-2505.06750"/></url>
<url><loc>https://scifaro.com/en/abs/first-order-coalition-logic-2505.06960</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/first-order-coalition-logic-2505.06960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/first-order-coalition-logic-2505.06960"/></url>
<url><loc>https://scifaro.com/en/abs/the-k-infty-homotopy-lambda-model-2505.07103</loc><lastmod>2026-04-07</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-k-infty-homotopy-lambda-model-2505.07103"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-k-infty-homotopy-lambda-model-2505.07103"/></url>
<url><loc>https://scifaro.com/en/abs/formal-p-category-theory-and-normalization-by-evaluation-in-rocq-2505.07780</loc><lastmod>2025-05-13</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formal-p-category-theory-and-normalization-by-evaluation-in-rocq-2505.07780"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formal-p-category-theory-and-normalization-by-evaluation-in-rocq-2505.07780"/></url>
<url><loc>https://scifaro.com/en/abs/duality-theory-and-representations-for-distributive-quasi-relation-algebras-and-dinfl-algebras-2505.07789</loc><lastmod>2026-01-30</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/duality-theory-and-representations-for-distributive-quasi-relation-algebras-and-dinfl-algebras-2505.07789"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/duality-theory-and-representations-for-distributive-quasi-relation-algebras-and-dinfl-algebras-2505.07789"/></url>
<url><loc>https://scifaro.com/en/abs/graph-neural-networks-and-mso-2505.07816</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/graph-neural-networks-and-mso-2505.07816"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/graph-neural-networks-and-mso-2505.07816"/></url>
<url><loc>https://scifaro.com/en/abs/formula-size-game-and-model-checking-for-modal-substitution-calculus-2505.07966</loc><lastmod>2025-12-12</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/formula-size-game-and-model-checking-for-modal-substitution-calculus-2505.07966"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/formula-size-game-and-model-checking-for-modal-substitution-calculus-2505.07966"/></url>
<url><loc>https://scifaro.com/en/abs/a-bi-nested-calculus-for-intuitionistic-k-proofs-and-countermodels-2505.08347</loc><lastmod>2025-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-bi-nested-calculus-for-intuitionistic-k-proofs-and-countermodels-2505.08347"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-bi-nested-calculus-for-intuitionistic-k-proofs-and-countermodels-2505.08347"/></url>
<url><loc>https://scifaro.com/en/abs/weighted-rewriting-semiring-semantics-for-abstract-reduction-systems-2505.08496</loc><lastmod>2025-05-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/weighted-rewriting-semiring-semantics-for-abstract-reduction-systems-2505.08496"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/weighted-rewriting-semiring-semantics-for-abstract-reduction-systems-2505.08496"/></url>
<url><loc>https://scifaro.com/en/abs/a-new-tractable-description-logic-under-categorical-semantics-2505.08916</loc><lastmod>2026-03-20</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-new-tractable-description-logic-under-categorical-semantics-2505.08916"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-new-tractable-description-logic-under-categorical-semantics-2505.08916"/></url>
<url><loc>https://scifaro.com/en/abs/cyclic-system-for-an-algebraic-theory-of-alternating-parity-automata-2505.09000</loc><lastmod>2025-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/cyclic-system-for-an-algebraic-theory-of-alternating-parity-automata-2505.09000"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/cyclic-system-for-an-algebraic-theory-of-alternating-parity-automata-2505.09000"/></url>
<url><loc>https://scifaro.com/en/abs/initial-algebra-correspondence-under-reachability-conditions-2505.09132</loc><lastmod>2025-09-08</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/initial-algebra-correspondence-under-reachability-conditions-2505.09132"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/initial-algebra-correspondence-under-reachability-conditions-2505.09132"/></url>
<url><loc>https://scifaro.com/en/abs/the-cost-of-skeletal-call-by-need-smoothly-2505.09242</loc><lastmod>2025-09-24</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/the-cost-of-skeletal-call-by-need-smoothly-2505.09242"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/the-cost-of-skeletal-call-by-need-smoothly-2505.09242"/></url>
<url><loc>https://scifaro.com/en/abs/on-verification-and-constraint-generation-for-families-of-similar-hybrid-automata-2505.09244</loc><lastmod>2025-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/on-verification-and-constraint-generation-for-families-of-similar-hybrid-automata-2505.09244"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/on-verification-and-constraint-generation-for-families-of-similar-hybrid-automata-2505.09244"/></url>
<url><loc>https://scifaro.com/en/abs/non-expansive-fuzzy-alc-2505.09416</loc><lastmod>2025-10-14</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/non-expansive-fuzzy-alc-2505.09416"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/non-expansive-fuzzy-alc-2505.09416"/></url>
<url><loc>https://scifaro.com/en/abs/risk-aware-markov-decision-processes-using-cumulative-prospect-theory-2505.09514</loc><lastmod>2025-05-15</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/risk-aware-markov-decision-processes-using-cumulative-prospect-theory-2505.09514"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/risk-aware-markov-decision-processes-using-cumulative-prospect-theory-2505.09514"/></url>
<url><loc>https://scifaro.com/en/abs/characterization-and-decidability-of-fc-definable-regular-languages-2505.09772</loc><lastmod>2025-12-23</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/characterization-and-decidability-of-fc-definable-regular-languages-2505.09772"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/characterization-and-decidability-of-fc-definable-regular-languages-2505.09772"/></url>
<url><loc>https://scifaro.com/en/abs/quantitative-types-for-the-functional-machine-calculus-2505.09960</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/quantitative-types-for-the-functional-machine-calculus-2505.09960"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/quantitative-types-for-the-functional-machine-calculus-2505.09960"/></url>
<url><loc>https://scifaro.com/en/abs/a-categorical-and-logical-framework-for-iterated-protocols-2505.10071</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/a-categorical-and-logical-framework-for-iterated-protocols-2505.10071"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/a-categorical-and-logical-framework-for-iterated-protocols-2505.10071"/></url>
<url><loc>https://scifaro.com/en/abs/homological-invariants-of-higher-order-equational-theories-2505.10149</loc><lastmod>2026-03-31</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/homological-invariants-of-higher-order-equational-theories-2505.10149"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/homological-invariants-of-higher-order-equational-theories-2505.10149"/></url>
<url><loc>https://scifaro.com/en/abs/closure-and-complexity-of-temporal-causality-2505.10186</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/closure-and-complexity-of-temporal-causality-2505.10186"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/closure-and-complexity-of-temporal-causality-2505.10186"/></url>
<url><loc>https://scifaro.com/en/abs/inconsistency-handling-in-datalogmtl-2505.10394</loc><lastmod>2025-05-16</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inconsistency-handling-in-datalogmtl-2505.10394"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inconsistency-handling-in-datalogmtl-2505.10394"/></url>
<url><loc>https://scifaro.com/en/abs/inquisitive-team-semantics-of-ltl-2505.10700</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/inquisitive-team-semantics-of-ltl-2505.10700"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/inquisitive-team-semantics-of-ltl-2505.10700"/></url>
<url><loc>https://scifaro.com/en/abs/internal-effectful-forcing-in-system-t-2505.11055</loc><lastmod>2025-05-19</lastmod><xhtml:link rel="alternate" hreflang="en" href="https://scifaro.com/en/abs/internal-effectful-forcing-in-system-t-2505.11055"/><xhtml:link rel="alternate" hreflang="x-default" href="https://scifaro.com/en/abs/internal-effectful-forcing-in-system-t-2505.11055"/></url>
</urlset>