Filters








311,078 Hits in 6.3 sec

On the Complexity of Bounded Context Switching [article]

Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan
<span title="2017-04-24">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We also present a lower bound for BCS of the form m^o(cs / log(cs)), based on the exponential time hypothesis.  ...  The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory (m) in O*(m^(cs)2^(cs)).  ...  B.2 Lower Bounds Lower Bound for Bounded Context Switching Proof of Theorem 6.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.09728v2">arXiv:1609.09728v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tdamef5gczegxilnaealmrcnmm">fatcat:tdamef5gczegxilnaealmrcnmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827102748/https://arxiv.org/pdf/1609.09728v2.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/dc/86dc59bc41bc3f1ecfc626a8722f4e83eee88239.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.09728v2" 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>

The Complexity of Bounded Context Switching with Dynamic Thread Creation

Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche, Emanuela Merelli, Artur Czumaj, Anuj Dawar
<span title="2020-06-29">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pf6v2q6ji5h7birkbrtpdc2uhy" style="color: black;">International Colloquium on Automata, Languages and Programming</a> </i> &nbsp;
of context switches.  ...  In this paper, we close the gap by showing that state reachability is 2EXPSPACE-hard already with only one context switch.  ...  Acknowledgements We would like to thank Ranko Lazić, who made us aware of "counter systems with chained counters" from [3] after submission of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2020.111">doi:10.4230/lipics.icalp.2020.111</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icalp/BaumannMTZ20.html">dblp:conf/icalp/BaumannMTZ20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/52oxgb3tkffh3gmqhbred7uzni">fatcat:52oxgb3tkffh3gmqhbred7uzni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201212091950/https://drops.dagstuhl.de/opus/volltexte/2020/12518/pdf/LIPIcs-ICALP-2020-111.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/cd/32/cd328ed8564e69590c7791770e4071b2883a747f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2020.111"> <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>

On the Complexity of Bounded Context Switching *

Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan
<span class="release-stage">unpublished</span>
We also present a lower bound for BCS of the form m o(cs/ log(cs)) , based on the exponential time hypothesis.  ...  The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory (m) in O * (m cs · 2 cs).  ...  The reachability problem on a shared-memory concurrent program in full generality is PSPACE-complete.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wy65cg2yxffytegapnkbecquji">fatcat:wy65cg2yxffytegapnkbecquji</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180508084441/http://drops.dagstuhl.de/opus/volltexte/2017/7873/pdf/LIPIcs-ESA-2017-27.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/5a/22/5a22b73b80e85cf2688407628805fc827199cf6a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Incremental schedulability analysis of hierarchical real-time components

Arvind Easwaran, Insik Shin, Oleg Sokolsky, Insup Lee
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n36vommjbafnkaccvl2qvetye" style="color: black;">Proceedings of the 6th ACM &amp; IEEE International conference on Embedded software - EMSOFT &#39;06</a> </i> &nbsp;
Associative composition will facilitate analysis of systems in which components are modified on the fly.  ...  We also describe an interface composition algorithm which accounts for context switch overheads incurred by components and is associative.  ...  ACKNOWLEDGMENTS The authors would like to thank all the anonymous reviewers for their valuable inputs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1176887.1176927">doi:10.1145/1176887.1176927</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/emsoft/EaswaranSSL06.html">dblp:conf/emsoft/EaswaranSSL06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/djxflov34bf7fgjps55ekesmne">fatcat:djxflov34bf7fgjps55ekesmne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813214703/http://www.cecs.uci.edu/~papers/esweek06/emsoft/p272.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/df/30/df30029d8c3d1a63fa9c949d1359f4ca59d48f04.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1176887.1176927"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

STORM

Zvonimir Rakamarić
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wvv27s77dvd5flktsj246kcxwu" style="color: black;">Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - ICSE &#39;10</a> </i> &nbsp;
STORM has been applied on a number of real-world Windows device drivers, and the tool found a previously undiscovered concurrency bug in a driver from Microsoft's Driver Development Kit.  ...  This paper describes a scalable, automatic, and precise approach to static unit checking of concurrent programs implemented in a tool called STORM.  ...  Many subsequent approaches have relied on bounding the number of contexts to tackle the complexity and scalability issues of concurrent program analysis.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1810295.1810460">doi:10.1145/1810295.1810460</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icse/Rakamaric10.html">dblp:conf/icse/Rakamaric10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/juzvojv4wfehdgt2n4hxy5fkxm">fatcat:juzvojv4wfehdgt2n4hxy5fkxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809085655/http://soarlab.org/publications/icse2010-r.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/79/fd/79fd3b8afa87a04e53184573b986eb90b29ccb6f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1810295.1810460"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers [chapter]

Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamarić
<span title="">2009</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;
Bounding the number of contexts executed per thread not only reduces the asymptotic complexity, but also the complexity increases gradually from checking a purely sequential program.  ...  Context-bounded analysis is an attractive approach to verification of concurrent programs.  ...  Many subsequent approaches have relied on bounding the number of contexts to tackle the complexity and scalability issues of concurrent program analysis [18, 19, 16, 20, 14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02658-4_38">doi:10.1007/978-3-642-02658-4_38</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gycp3e34anfbnaacb5knvc5uvu">fatcat:gycp3e34anfbnaacb5knvc5uvu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110602122035/http://www.zvonimir.info/publications/cav2009-lqr.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/38/90/38900bb863b9899fe52d295fe415fe54cebc5988.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-02658-4_38"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Dynamics of Relative Agreement in Multiple Social Contexts [chapter]

Davide Nunes, Luis Antunes, Frederic Amblard
<span title="">2013</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;
The paper builds on previous work about social space design with multiple contexts and context switching, to determine the influence of such complex social structures in a process such as opinion formation  ...  We discuss the influence of complex social network topologies where actors interact in multiple relations simultaneously.  ...  The switching probability also introduces a way to model interaction temporal dynamics by allowing the modelling of time agents dedicate to different social contexts and how this affects the formation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-40669-0_39">doi:10.1007/978-3-642-40669-0_39</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uriz4ilxfzfa3a6zqnipxnsloa">fatcat:uriz4ilxfzfa3a6zqnipxnsloa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719011012/https://hal.archives-ouvertes.fr/hal-01226477/file/nunes_12688.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/98/11/98111a63771b34c6c0ffcc968a70c9e1302b7dd7.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-40669-0_39"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Compositional Schedulability Analysis of Hierarchical Real-Time Systems

Arvind Easwaran, Insup Lee, Insik Shin, Oleg Sokolsky
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/icax7kbgefdxhgco4lvborrsqe" style="color: black;">10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC&#39;07)</a> </i> &nbsp;
We also account for context switch overhead of components in these extended interfaces. We then describe an associative composition technique for such interfaces, that supports incremental analysis.  ...  We also account for context switch overhead of components in these extended interfaces. We then describe an associative composition technique for such interfaces, that supports incremental analysis.  ...  Context switch overhead for a component depends on the period of the resource model that will be used to schedule it. A smaller period will, in general, result in a larger number of context switches.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isorc.2007.25">doi:10.1109/isorc.2007.25</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isorc/EaswaranLSS07.html">dblp:conf/isorc/EaswaranLSS07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/t3t3ypcnrzeqdc3xwzddo6c2bi">fatcat:t3t3ypcnrzeqdc3xwzddo6c2bi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720063411/https://repository.upenn.edu/cgi/viewcontent.cgi?article=1380&amp;context=cis_papers" 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/23/b0/23b035494712db05d140d215bd75f817077febe4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isorc.2007.25"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

MPass: An Efficient Tool for the Analysis of Message-Passing Programs [chapter]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg, Subham Modi, Othmane Rezine, Gaurav Saini
<span title="">2015</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;
processes communicating via shared variablesThe idea([Qadeer et al., 05]]): Analysis techniques based on bounding the number of context switches (interleaving) between threads A Lossy Channel System  ...  Context-bounded algorithm is suitable for the analysis of concurrent programs communicating via shared variables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-15317-9_13">doi:10.1007/978-3-319-15317-9_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nfblmgi4znbxnnsrdwtzqfpeza">fatcat:nfblmgi4znbxnnsrdwtzqfpeza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830050910/http://user.it.uu.se/~othre279/presentations/facs14slides.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/32/7f/327fb6da7480ca2c48b0f25ad0c630ea5d1b3239.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-319-15317-9_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Context-Bounded Translations for Concurrent Software: An Empirical Evaluation [chapter]

Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamarić
<span title="">2010</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;
In practice, CBA has proven its ability to detect hard concurrency bugs in real software, and many approaches rely on context-bounding to tackle the complexity of concurrent software (e.g., [26, 27, 24  ...  of introducing multiple non-deterministic symbolic variables to guess the values of the shared global variables at context switches.  ...  The size of the symbol is proportional to the context bound K.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16164-3_17">doi:10.1007/978-3-642-16164-3_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4aei3iv3ard67j445fmapyu3km">fatcat:4aei3iv3ard67j445fmapyu3km</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810194558/http://soarlab.org/publications/spin2010-ghr.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/1c/46/1c46514c0bc51a08834129c4f3028a59e4ea936f.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-16164-3_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore's Law and Novel (Semiconductor) Devices [chapter]

Krishna V. Palem
<span title="">2003</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;
The notions of "energy complexity" characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on the thermodynamics and thus independent  ...  Our formulations of energy complexity characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on thermodynamics and thus independent  ...  The notions of "energy complexity" characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on the thermodynamics and thus independent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24596-4_23">doi:10.1007/978-3-540-24596-4_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wqrwugx6tfg6remknkcsoeyei4">fatcat:wqrwugx6tfg6remknkcsoeyei4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101226144006/http://www.cs.rice.edu/~kvp1/pubs/palem-ea.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/a1/e2a147501c42bda823a410af8cf01cf6d023708d.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-540-24596-4_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Energy aware algorithm design via probabilistic computing

Krishna V. Palem
<span title="">2003</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h3qjmo5xyfe6fcrh4fogxmkkiq" style="color: black;">Proceedings of the international conference on Compilers, architectures and synthesis for embedded systems - CASES &#39;03</a> </i> &nbsp;
The notions of "energy complexity" characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on the thermodynamics and thus independent  ...  Our formulations of energy complexity characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on thermodynamics and thus independent  ...  The notions of "energy complexity" characterizing the energy consumed in the context of the RaBRAM and a network of switches, respectively, are dependent only on the thermodynamics and thus independent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/951710.951712">doi:10.1145/951710.951712</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cases/Palem03.html">dblp:conf/cases/Palem03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ykpf3pwukjhaba6xexa5lvoap4">fatcat:ykpf3pwukjhaba6xexa5lvoap4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101226144006/http://www.cs.rice.edu/~kvp1/pubs/palem-ea.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/a1/e2a147501c42bda823a410af8cf01cf6d023708d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/951710.951712"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Context-Switch-Directed Verification in DIVINE [chapter]

Vladimír Štill, Petr Ročkai, Jiří Barnat
<span title="">2014</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;
Furthermore, we allow to limit the number of context switches used in state-space exploration if desired.  ...  The new algorithm is implemented in the DIVINE model checker and enables both unbounded and bounded context-switch-directed exploration for models given in LLVM bitcode, which efficiently allows for verification  ...  More recent results include reports on experience of introducing context switch bounded mode of verification into the SPIN model checker [10] and a report on context-switch bounded model checking on  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-14896-0_12">doi:10.1007/978-3-319-14896-0_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ch2djevycbht3i6fk2ctrqrys4">fatcat:ch2djevycbht3i6fk2ctrqrys4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222080759/http://pdfs.semanticscholar.org/35c5/04e6ed1c0f3703fa252d3cf7ec3739c8dea6.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/35/c5/35c504e6ed1c0f3703fa252d3cf7ec3739c8dea6.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-319-14896-0_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the Length of Medial-Switch-Mix Derivations [chapter]

Paola Bruscoli, Lutz Straßburger
<span title="">2017</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;
In this paper we show that the maximal length of a derivation using only the inference rules for switch, medial, and mix, modulo associativity and commutativity of the two binary connectives involved,  ...  is quadratic in the size of the formula at the conclusion of the derivation.  ...  This research is also supported by ANR Project FISP -"The Fine Structure of Formal Proof Systems and their Computational Interpretations."  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-55386-2_5">doi:10.1007/978-3-662-55386-2_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zssd6ed3qbfutfkgcsb4rvcyqy">fatcat:zssd6ed3qbfutfkgcsb4rvcyqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190220170539/http://pdfs.semanticscholar.org/2b45/e5ab9f4787f49b4bc43f8b2f6ee2a3f38270.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/2b/45/2b45e5ab9f4787f49b4bc43f8b2f6ee2a3f38270.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-662-55386-2_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 1459 of Mathematical Reviews Vol. 46, Issue 5 [page]

<span title="">1973</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The author introduces a function p,(n) of the density of a context-free grammar I" based on the deductive tree of the given grammar.  ...  Ja. 8471 On the question of the existence of switching sets of multidimensional memory or decoding devices. (Russian) Izv. Vyss. Uéebn. Zaved. Radiofizika 12 (1969), 1740- 1745.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1973-11_46_5/page/1459" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1973-11_46_5/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 311,078 results