Filters








10,273 Hits in 1.7 sec

Trace Abstraction Modulo Probability [article]

Calvin Smith, Justin Hsu, Aws Albarghouthi
<span title="2018-10-29">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose trace abstraction modulo probability, a proof technique for verifying high-probability accuracy guarantees of probabilistic programs.  ...  Our proofs overapproximate the set of program traces using failure automata, finite-state automata that upper bound the probability of failing to satisfy a target specification.  ...  However, their common foundation leads to An Overview of Our Approach Trace Abstraction Modulo Probability.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.12396v1">arXiv:1810.12396v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pxsmnb52w5bgnpjrnf5mxrmgtq">fatcat:pxsmnb52w5bgnpjrnf5mxrmgtq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826093141/https://arxiv.org/pdf/1810.12396v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0b/ae/0bae1bcc945043f996cf04bd513469856596faff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.12396v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A Random Testing Approach Using Pushdown Automata [chapter]

Pierre-Cyrille Héam, Catherine Masson
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Since finite automata are in general strong abstractions of systems, many test cases which are automata traces generated uniformly at random, may be un-concretizable.  ...  Using combinatorial techniques guarantees the uniformity of generated traces.  ...  This step makes it possible both the computation of the probability pr(q) and the random generation of NPDA-traces of A modulo visiting q.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21768-5_10">doi:10.1007/978-3-642-21768-5_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sxnfkyds55hulbyfdgtuhwt4ke">fatcat:sxnfkyds55hulbyfdgtuhwt4ke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811131619/http://members.femto-st.fr/sites/femto-st.fr.pierre-cyrille-heam/files/content/Revues/TestAleaPDA.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/ae/22ae627e92fca67d1e3b9f967b450b068f3bd6e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21768-5_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A random testing approach using pushdown automata

Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko, Catherine Masson
<span title="2014-05-14">2014</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qrohejli3ngofb53dnkhpougdm" style="color: black;">Software testing, verification &amp; reliability</a> </i> &nbsp;
Since finite automata are in general strong abstractions of systems, many test cases which are automata traces generated uniformly at random, may be un-concretizable.  ...  Using combinatorial techniques guarantees the uniformity of generated traces.  ...  This step makes it possible both the computation of the probability pr(q) and the random generation of NPDA-traces of A modulo visiting q.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/stvr.1526">doi:10.1002/stvr.1526</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6v4pklqpebfabdn6lpdyt2jcfi">fatcat:6v4pklqpebfabdn6lpdyt2jcfi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190318020210/https://core.ac.uk/download/pdf/54033212.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/64/27/6427cd2a4c30a45768c43db5d7b9fbc7fd94c7b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/stvr.1526"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Exploiting Constraints in Transformation-Based Verification [chapter]

Hari Mony, Jason Baumgartner, Adnan Aziz
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
C-slow abstraction operates by transforming all but a single color of registers into buffers, thereby reducing register count and temporally folding traces modulo-c.  ...  modulo a time skew.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560548_21">doi:10.1007/11560548_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rayyzcphdnhzpfocbsnnk7da34">fatcat:rayyzcphdnhzpfocbsnnk7da34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726161830/https://link.springer.com/content/pdf/10.1007%2F11560548_21.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/2b/6e2b59ff61ecc206fcb12cee07d51b894fa89f32.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560548_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics

Julien Henry, Mihail Asavoae, David Monniaux, Claire Maïza
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6dcohyzfhveypik7x4entpurlu" style="color: black;">Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems - LCTES &#39;14</a> </i> &nbsp;
Optimization modulo theory extends satisfiability modulo theory (SMT) to maximization problems.  ...  Better performance could probably be obtained by slicing away such irrelevant statements.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2597809.2597817">doi:10.1145/2597809.2597817</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lctrts/HenryAMM14.html">dblp:conf/lctrts/HenryAMM14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ai265vopxzfxhcx5mt3jxdtldq">fatcat:ai265vopxzfxhcx5mt3jxdtldq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140708025451/http://hal.archives-ouvertes.fr/docs/00/99/81/38/PDF/Henry_et_al_LCTES2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/10/ef100925ebdcb31f41d2f04ea81308d4ae37fa6a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2597809.2597817"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics

Julien Henry, Mihail Asavoae, David Monniaux, Claire Maïza
<span title="2014-05-05">2014</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
Optimization modulo theory extends satisfiability modulo theory (SMT) to maximization problems.  ...  Better performance could probably be obtained by slicing away such irrelevant statements.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2666357.2597817">doi:10.1145/2666357.2597817</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xaeddgjiorgqnnk3ojn37ixf2e">fatcat:xaeddgjiorgqnnk3ojn37ixf2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140708025451/http://hal.archives-ouvertes.fr/docs/00/99/81/38/PDF/Henry_et_al_LCTES2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/10/ef100925ebdcb31f41d2f04ea81308d4ae37fa6a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2666357.2597817"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics [article]

Julien Henry, David Monniaux
<span title="2014-05-30">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Optimization modulo theory extends satisfiability modulo theory (SMT) to maximization problems.  ...  We compute the WCET (or at least a close upper bound thereof) as the solution of an optimization modulo theory problem that takes into account the semantics of the program, in contrast to other methods  ...  Better performance could probably be obtained by slicing away such irrelevant statements.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.7962v1">arXiv:1405.7962v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/stbzfw7rera7ncbdy6mncxtgra">fatcat:stbzfw7rera7ncbdy6mncxtgra</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827002430/https://arxiv.org/pdf/1405.7962v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/77/86774fcbfde78c60c2780f033eb867f503948c08.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.7962v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Prime divisors of linear recurrences and Artin's primitive root conjecture for number fields

Hans Roskam
<span title="">2001</span> <i title="Cellule MathDoc/CEDRAM"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qrc6o5i3pvhfxjwmlbdqyg3xnm" style="color: black;">Journal de Théorie des Nombres de Bordeaux</a> </i> &nbsp;
Therefore, we assume that as p varies, the 'probability' that an element in the coset e(1i) has non-zero trace is 1 -p.  ...  The probability for a randomly chosen x EO/pO to have non-zero trace is 1-!. The elements in the coset e(1i) c are not randomly chosen p elements of 0/ pO.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5802/jtnb.323">doi:10.5802/jtnb.323</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y7ommq4axfcwna3fsx3wdtctcm">fatcat:y7ommq4axfcwna3fsx3wdtctcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430162918/http://archive.numdam.org/article/JTNB_2001__13_1_303_0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/25/8425e24f47664a265f375aff35beba30c08c81ef.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5802/jtnb.323"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A rewriting point of view on strategies

Hélène Kirchner
<span title="2013-03-01">2013</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
some probability.  ...  This calculus makes explicit and first-class all of its components: matching (possibly modulo given theories), abstraction, application and substitutions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.112.15">doi:10.4204/eptcs.112.15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/prh2dv6rhfa7tpnucuekwamyty">fatcat:prh2dv6rhfa7tpnucuekwamyty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190302192048/http://pdfs.semanticscholar.org/a847/6d0382fe2f067fbbf69daf952f1b3ab3b053.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/47/a8476d0382fe2f067fbbf69daf952f1b3ab3b053.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.112.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Hierarchical and Heterogenous Reactive Agents for Real-Time Applications

C. Niederberger, M. Gross
<span title="">2003</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p2lpq6bugfcqxk44anrm6yki4m" style="color: black;">Computer graphics forum (Print)</a> </i> &nbsp;
Additionally, the system allows for the simultaneous generation of hierarchical and semi-individual group organizations using specification and recursive or modulo-based patterns.  ...  We permit specialization within the abstract group by using simple rules, e.g. "individual #1 is the father", modulo-based rules, e.g.  ...  The thick black line indicates a preplanned path of the group instance, whereas the thin one represents its actual trace.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/1467-8659.00679">doi:10.1111/1467-8659.00679</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n5jodl7ytrebzcy4ni5vxxtlgi">fatcat:n5jodl7ytrebzcy4ni5vxxtlgi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050824072252/http://graphics.ethz.ch:80/Downloads/Publications/Papers/2003/nie03/p_Nie03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/09/7f09bbc9b35d0bf2b37b2bd2fd0919d59f01ee64.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/1467-8659.00679"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Approximate Data Dependence Profiling Based on Abstract Interval and Congruent Domains [chapter]

Mostafa Abbas, Rasha Omar, Ahmed El-Mahdy, Erven Rohou
<span title="">2020</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper considers employing a simple abstract single-trace analysis method using simple interval and congruent modulo domains to track dependencies at lower time and memory costs.  ...  The method gathers and abstracts the set of all memory reference addresses for each static memory access instruction.  ...  In other words, the main aim is to generate an abstract single-trace semantics, from the current execution trace.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-52794-5_1">doi:10.1007/978-3-030-52794-5_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u324562zqja5fls23ujlitypcq">fatcat:u324562zqja5fls23ujlitypcq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200904210431/https://link.springer.com/content/pdf/10.1007%2F978-3-030-52794-5_1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/59/3659fd4fbd3d1fe541172f6722b6f5854fe5e568.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-52794-5_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Anonymity in Probabilistic and Nondeterministic Systems

Catuscia Palamidessi
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
in one possible computation, then there must be alternative computations in which each other anonymous user can give rise to the same observable trace (modulo the identity of the anonymous users).  ...  This abstract is based on the papers [1] , [2] and [4] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.12.094">doi:10.1016/j.entcs.2005.12.094</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oge3djkmszgqxmatnedgale7cq">fatcat:oge3djkmszgqxmatnedgale7cq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061130092437/http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Bertinoro/paper.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ca/a6/caa623930a2653208de3f8ff966e728bb9f5996b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.12.094"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Process Algebra with Recursive Operations [chapter]

Jan A. Bergstra, Wan Fokkink, Alban Ponse
<span title="">2001</span> <i title="Elsevier"> Handbook of Process Algebra </i> &nbsp;
We assume that the probability of tossing heads is larger than 0. Thus we exclude the infinite trace that alternately executes throw and tail.  ...  Table 6 : 6 Axiomatisation for the algebra A p Table 7 : 7 Axioms for trace equivalence (A = {a}) Table 8 : 8 Axioms for BKS with encapsulation and abstraction.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-044482830-9/50023-0">doi:10.1016/b978-044482830-9/50023-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/loreoiq5zbdxzbhqc4ys32b3fq">fatcat:loreoiq5zbdxzbhqc4ys32b3fq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809074616/http://www.few.vu.nl/~wanf/pubs/handbook.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/c0/e2c04a3cb858d4d1b58ef1a25a325d239b9006b6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-044482830-9/50023-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

All-Solution Satisfiability Modulo Theories: Applications, Algorithms and Benchmarks

Quoc-Sang Phan, Pasquale Malacaria
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6esmd4ad3namzfggdse6okxdte" style="color: black;">2015 10th International Conference on Availability, Reliability and Security</a> </i> &nbsp;
Satisfiability Modulo Theories (SMT) is a decision problem for logical formulas over one or more first-order theories.  ...  Also in the context of predicate abstraction, Lahiri et al.  ...  A trace σ e that contains one or more error states is called an error trace.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ares.2015.14">doi:10.1109/ares.2015.14</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/IEEEares/PhanM15.html">dblp:conf/IEEEares/PhanM15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3far5acohnbofhpr6sxq23lytq">fatcat:3far5acohnbofhpr6sxq23lytq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180820145740/http://qsphan.github.io:80/papers/ares15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8e/db/8edbd03105973219780122cb3d2f0ccdc96e153d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ares.2015.14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Modeling Terms by Graphs with Structure Constraints (Two Illustrations)

Clemens Grabmayer
<span title="2019-02-05">2019</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
In this extended abstract I describe the underlying problems, give references, provide examples, indicate the chosen approaches, and compare the initial situations as well as the results that have been  ...  In doing so we distinguish it from a λ -higher-order term graph with an abstraction prefix function, where scopes of abstraction vertices are recorded per vertex v via the stack of those abstraction vertices  ...  incompleteness modulo ↔ by a structural graph property.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.288.1">doi:10.4204/eptcs.288.1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yiy2b7k6fvfztcschsstmvrrlq">fatcat:yiy2b7k6fvfztcschsstmvrrlq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913101933/https://arxiv.org/pdf/1902.02010v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/07/b307a4bea644e1535ccbeee42b44cd33be84c3a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.288.1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 10,273 results