Filters








6,661 Hits in 5.7 sec

Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time [chapter]

Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
<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 investigate the feasibility of bounded model checking and bounded satisfiability checking when dealing with bi-infinite automata and logics.  ...  Model checking techniques traditionally deal with temporal logic languages and automata interpreted over ω-words, i.e., where time is infinite in the future but finite in the past.  ...  First, the above outlined method of satisfiability checking is generalized by permitting, also for the case of a bi-infinite time, the more customary operation of bounded model checking, where the system  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-85762-4_20">doi:10.1007/978-3-540-85762-4_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7tc3hayfsfbabpa3yzj3ccvvni">fatcat:7tc3hayfsfbabpa3yzj3ccvvni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090709161623/http://home.dei.polimi.it/pradella/papers/ictac08PMS.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/28/4c/284c69ba4807bdf13a6f83ed5ff07ad4ca7c04b7.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-85762-4_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Solver for Modal Fixpoint Logics

Oliver Friedmann, Martin Lange
<span title="">2010</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;
The underlying technique is based on characterisations of satisfiability through infinite (cyclic) tableaux in which branches have an inner thread structure mirroring the regeneration of least and greatest  ...  MLSolver then uses a parity game solver in order to decide satisfiability and derives example models from the winning strategies in the parity game.  ...  depend on the formula in CTL * model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2010.04.008">doi:10.1016/j.entcs.2010.04.008</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lkcg5djjnzc3rjf6xdp4t3tfli">fatcat:lkcg5djjnzc3rjf6xdp4t3tfli</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190412125111/https://core.ac.uk/download/pdf/82633309.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/a0/be/a0be202636ffe4c63994ea1757f0b700c58dc3ce.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.2010.04.008"> <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>

Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking

Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hj24pr6lvba3dfi5muhp4mz5tm" style="color: black;">2008 23rd IEEE/ACM International Conference on Automated Software Engineering</a> </i> &nbsp;
Bounded Satisfiability Checking (BSC) adopts a similar approach, but both the system and the properties are modeled with temporal logic formulae, without an underlying operational model.  ...  We also propose a method to check whether an operational model is a correct implementation (refinement) of a temporal logic model, and assess its effectiveness on the same set of case studies.  ...  ACKNOWLEDGEMENTS We thank Paolo Lischetti for developing the operational version of the Real-time Allocator. Work partially supported by FME Small Project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.22">doi:10.1109/ase.2008.22</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kbse/PradellaMP08.html">dblp:conf/kbse/PradellaMP08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f6vc7rcikvbb3p3r23nk4tn4u4">fatcat:f6vc7rcikvbb3p3r23nk4tn4u4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090709194600/http://home.dei.polimi.it/pradella/papers/pms-ase08.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/49/66/496654409a262fd71fdeccc5486874958c9fbb42.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ase.2008.22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Metric Encoding for Bounded Model Checking [chapter]

Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
<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;
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver.  ...  We report and comment on the new encoding technique and on an extensive set of experiments carried out to assess its feasibility and effectiveness.  ...  Acknowledgements: We thank Davide Casiraghi for his valuable work on Zot's metric plugins.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-05089-3_47">doi:10.1007/978-3-642-05089-3_47</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tckx63euqjfhdbqbq5okgc46pm">fatcat:tckx63euqjfhdbqbq5okgc46pm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808133209/http://home.deib.polimi.it/pradella/papers/fm09.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/07/90/0790fb4cb5d9b6113e92aed90cb4d3ecb1e5bd4b.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-05089-3_47"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs [chapter]

Vojtěch Forejt, Daniel Kroening, Ganesh Narayanaswamy, Subodh Sharma
<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;
The encoding is based on modelling executions with partial orders, and implemented in a tool called MOPPER.  ...  The tool executes an MPI program, collects the trace, builds a formula from the trace using the propositional encoding scheme, and checks its satisfiability.  ...  Acknowledgements The authors would like to thank Martin Brain, Alex Horn and Saurabh Joshi for helpful discussions on the topic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-06410-9_19">doi:10.1007/978-3-319-06410-9_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f3krjrmjejhchkrpttdtrnwl5a">fatcat:f3krjrmjejhchkrpttdtrnwl5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808032415/http://www.kroening.com/papers/fm2014.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/6d/df6da1f62f87f72616758b559426eca6f03d5c45.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-06410-9_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Symbolic optimization with SMT solvers

Yi Li, Aws Albarghouthi, Zachary Kincaid, Arie Gurfinkel, Marsha Chechik
<span title="">2014</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL &#39;14</a> </i> &nbsp;
We have implemented SYMBA and evaluated it on a large number of optimization benchmarks drawn from program analysis tasks.  ...  We are often interested in finding not just an arbitrary satisfying assignment, but one that optimizes (minimizes/maximizes) certain criteria.  ...  benchmark, each time with a different objective.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2535838.2535857">doi:10.1145/2535838.2535857</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/LiAKGC14.html">dblp:conf/popl/LiAKGC14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dvjcvoc2frfy5nadgtfyaijin4">fatcat:dvjcvoc2frfy5nadgtfyaijin4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813185519/http://www.cs.toronto.edu/~liyi/host/files/popl14.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/e4/1a/e41ae89c59bfa344cde2084a78ccaa8f0f49cfb4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2535838.2535857"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Symbolic Register Automata [chapter]

Loris D'Antoni, Tiago Ferreira, Matteo Sammartino, Alexandra Silva
<span title="">2019</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;
These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right.  ...  In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach.  ...  We will reduce the problem of checking (bi)similarity of S 1 and S 2 to that of checking symbolic (bi)similarity on N(S 1 ) and N(S 2 ), with minor modifications to the definition.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-25540-4_1">doi:10.1007/978-3-030-25540-4_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5guyxkqwdvce7cdbesttym6ofi">fatcat:5guyxkqwdvce7cdbesttym6ofi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200310153855/https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_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/71/66/7166fb9b3530f0d4740b61a7d9f1d4f72930cae8.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-25540-4_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Proving Non-termination by Program Reversal [article]

Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Đorđe Žikelić
<span title="2021-04-02">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition  ...  The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving  ...  Acknowledgements This research was partially supported by the ERC CoG 863818 (ForM-SMArt) and the Czech Science Foundation grant No. GJ19-15134Y.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.01189v1">arXiv:2104.01189v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qyjbd3vs4zgstgqmx7q266qsle">fatcat:qyjbd3vs4zgstgqmx7q266qsle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210407002122/https://arxiv.org/pdf/2104.01189v1.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/b7/bb/b7bb249d562e730e7f95bdd38bda7c9c6959d0be.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2104.01189v1" 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>

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report [article]

Lars Luthmann
<span title="2020-09-16">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We further present experimental results gained from applying our tool to a collection of community benchmarks, providing insights into trade-offs between precision and efficiency, depending on the bound  ...  Our tool TimBrCheck is, to the best of our knowledge, the only currently available tool for effectively checking timed bisimilarity and even supports non-deterministic TA with silent moves.  ...  timed (bi-)similarity checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.08992v3">arXiv:1910.08992v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3az3uans3naddjxnyglbwo4n7a">fatcat:3az3uans3naddjxnyglbwo4n7a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201012134348/https://arxiv.org/pdf/1910.08992v3.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.08992v3" 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>

More Scalable LTL Model Checking via Discovering Design-Space Dependencies ($$D^{3}$$D3) [chapter]

Rohit Dureja, Kristin Yvonne Rozier
<span title="">2018</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;
Our algorithm, D 3 , preprocesses the design space and checks fewer model-checking instances, e.g., using nuXmv.  ...  It automatically prunes the search space by reducing both the number of models to check, and the number of LTL properties that need to be checked for each model in order to provide the complete model-checking  ...  Scripts: Python scripts to run D 3 on the two benchmarks This is why we do not consider CTL; CTL satisfiability is EXPTIME-complete and cannot be accomplished via linear time CTL model checking.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-89960-2_17">doi:10.1007/978-3-319-89960-2_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pk4wtvp3jfeqhewya2gaj2ajym">fatcat:pk4wtvp3jfeqhewya2gaj2ajym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725051652/https://link.springer.com/content/pdf/10.1007%2F978-3-319-89960-2_17.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/66/59/6659a564655306c66a499e4c4f6a13fc423af386.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-89960-2_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Rapid Recovery for Systems with Scarce Faults

Chung-Hao Huang, Doron Peled, Sven Schewe, Farn Wang
<span title="2012-10-07">2012</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 order to be k-resilient, a system needs to be able to rapidly recover from a small number, up to k, of local faults infinitely many times, provided that blocks of up to k faults are separated by short  ...  We show that the computational complexity of constructing optimal control with respect to resilience is low and demonstrate the feasibility through an implementation and experimental results.  ...  Our implementation is based on symbolic on-the-fly model-checking techniques and built on the simulation/model-checking library of REDLIB in http://sourceforge.net/projects/redlib/ for fast implementation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.96.2">doi:10.4204/eptcs.96.2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uumguitwvnecbm3ptgyhoa5gu4">fatcat:uumguitwvnecbm3ptgyhoa5gu4</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1210.2449/1210.2449.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> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.96.2"> <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>

Automata-Based Model Counting for String Constraints [chapter]

Abdulbaki Aydin, Lucas Bang, Tevfik Bultan
<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;
For quantitative and probabilistic program analyses, checking the satisfiability of a constraint is not sufficient, and it is necessary to count the number of solutions.  ...  Our approach relies on the observation that, using an automata-based constraint representation, model counting reduces to path counting, which can be solved precisely.  ...  Our experiments on thousands of constraints extracted from real-world web applications demonstrates the effectiveness and efficiency of the proposed approach.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21690-4_15">doi:10.1007/978-3-319-21690-4_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5tgzlhb4affarm5obclkwhazzq">fatcat:5tgzlhb4affarm5obclkwhazzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810154557/http://www.cs.ucsb.edu/~bultan/publications/model-counting.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/e5/30/e5302ca7e92a7bdac5628d5ec827db83a9b0a34b.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-21690-4_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Verification of indefinite-horizon POMDPs [article]

Alexander Bork, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann
<span title="2020-06-30">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This verification problem is often overly pessimistic, as the policies it considers may depend on the complete system state.  ...  This paper considers the verification problem for partially observable MDPs, in which the policies make their decisions based on (the history of) the observations emitted by the system.  ...  The column 'MDP' shows the model checking result on the underlying, fully-observable MDP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.00102v1">arXiv:2007.00102v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b67bczofojfxnade4qjmstpgky">fatcat:b67bczofojfxnade4qjmstpgky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200721215451/https://arxiv.org/pdf/2007.00102v1.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/6a/a2/6aa240ec1afcc9b65e457a1498736fc131c14d2f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.00102v1" 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>

Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction [chapter]

Jun Sun, Yang Liu, Jin Song Dong, Xian Zhang
<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;
The abstract machine weakly bi-simulates the model and, therefore, LTL model checking or trace-refinement checking are sound and complete.  ...  We enhance our home-grown PAT model checker with the technique and show its usability via the verification of benchmark systems.  ...  PAT is remotely related to the Spin model checker (on automata-based LTL model checking) [17] and the FDR refinement checker (on refinement checking) [28] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-10373-5_30">doi:10.1007/978-3-642-10373-5_30</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a5uqd53wzzhtvgsilpobprsfde">fatcat:a5uqd53wzzhtvgsilpobprsfde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808052423/http://pat.comp.nus.edu.sg/wp-source/resources/publications/pdf/ICFEM09a.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/51/c9/51c970fa43b0c0686477a58a78c317e3e81ffc32.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-10373-5_30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A circuit approach to LTL model checking

Koen Claessen, Niklas Een, Baruch Sterin
<span title="">2013</span> <i title="IEEE"> 2013 Formal Methods in Computer-Aided Design </i> &nbsp;
This paper presents a method for translating formulas written in assertion languages such as LTL into a monitor circuit suitable for model checking.  ...  checking tools.  ...  model checking tools.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fmcad.2013.6679391">doi:10.1109/fmcad.2013.6679391</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a5nb7ufaxfa2pd2hhu625u74eu">fatcat:a5nb7ufaxfa2pd2hhu625u74eu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151221152811/http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD13/papers/99-Circuit-Approach-LTL.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/d0/b7/d0b7cc474dd466e3bdb7abd2e86e037e7c09c71b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fmcad.2013.6679391"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 6,661 results