Filters








11,564 Hits in 9.7 sec

A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution

MICHAEL FISHER
<span title="">1997</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/crzmi3qeiramtlvcrfycib3qg4" style="color: black;">Journal of Logic and Computation</a> </i> &nbsp;
In this paper a normal form, called Separated Normal Form (SNF), for temporal logic formulae is described.  ...  This normal form not only provides a simple and concise representation for temporal formulae, but is also used as the basis for both a resolution proof method and an execution mechanism for this type of  ...  Acknowledgements The author wishes to thank Clare Dixon, Rajeev Goré, Rob Johnson, Brian Monahan, Philippe Noël, Richard Owens, Martin Peim, Mike Wooldridge and the two anonymous referees for their helpful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/7.4.429">doi:10.1093/logcom/7.4.429</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nsicehhgsndmrffuq475ivz7pq">fatcat:nsicehhgsndmrffuq475ivz7pq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809154009/http://cgi.csc.liv.ac.uk/~michael/snf-art.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/ee/6b/ee6bd96d6d44c486117484fbf3c93728ab84d148.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/7.4.429"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Software Reliability through Theorem Proving
English

S. Murthy, K. Sekharam
<span title="2009-05-25">2009</span> <i title="Defence Scientific Information and Documentation Centre"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sbz4qubtlrhx5a2wpmby2l2qfu" style="color: black;">Defence Science Journal</a> </i> &nbsp;
Theorem proving is a powerful formal verification technique that enhances the software reliability for missioncritical aerospace applications.  ...  using the conventional and internationally accepted methodologies, models, theorem proving techniques available in the tool without proposing a new model.  ...  Theorem proving is a technique, where the system to be proved and desired properties expressed in a mathematical form (i.e. first-order logic or temporal logic).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14429/dsj.59.1527">doi:10.14429/dsj.59.1527</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vneggdcluzf6botcb2mv3ve4ju">fatcat:vneggdcluzf6botcb2mv3ve4ju</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030043749/http://publications.drdo.gov.in/ojs/index.php/dsj/article/download/1527/656" 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/ba/94/ba9428f4b4e28b1ec246224c35e5bef51fd3549a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14429/dsj.59.1527"> <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>

Page 4934 of Mathematical Reviews Vol. , Issue 94i [page]

<span title="">1994</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;
This normal form, called first- order separated normal form (SNF;), forms the basis of both a temporal resolution method and a family of executable tempo- ral logics.  ...  Summary: “In this paper a normal form for formulae of a first- order temporal logic is described.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-09_94i/page/4934" 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_1994-09_94i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

RGITL: A temporal logic framework for compositional reasoning about interleaved programs

Gerhard Schellhorn, Bogdan Tofan, Gidon Ernst, Jörg Pfähler, Wolfgang Reif
<span title="2014-01-29">2014</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j2td7x4trvgx7pjoienrccryxq" style="color: black;">Annals of Mathematics and Artificial Intelligence</a> </i> &nbsp;
This paper gives a self-contained presentation of the temporal logic Rely-Guarantee Interval Temporal Logic (RGITL). The logic is based on interval temporal logic (ITL) and higher-order logic.  ...  Deduction is based on the principles of symbolic execution and induction, known from the verification of sequential programs, which are transferred to a concurrent setting with temporal logic.  ...  Acknowledgment We would like to thank Cliff Jones and Ben Moszkowski for thoroughly reading a preliminary version of this paper, and in addition Dimitar Guelev, Alexander Knapp and the anonymous referees  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-013-9389-z">doi:10.1007/s10472-013-9389-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ygihh7xrlzb73g4lynbyo3alze">fatcat:ygihh7xrlzb73g4lynbyo3alze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810182856/https://swt.informatik.uni-augsburg.de/swt/projects/RGITL/amai14-accepted.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/ad/30/ad30f615b48db7a7997cf05a16c3559082714b52.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-013-9389-z"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Logical Implementation of Uncertain Agents [chapter]

Nivea de C. Ferreira, Michael Fisher, Wiebe van der Hoek
<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;
We provide a description of the extended logic, the translation procedure for formulae in this extended logic to an executable normal form, and the execution algorithm for such formulae.  ...  We consider the representation and execution of agents specified using temporal logics.  ...  That is, the execution now uses temporal formulae in the normal form to build a temporal sequence of balloons.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11595014_53">doi:10.1007/11595014_53</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5cdbeyyyqbeezmev42qjriohmm">fatcat:5cdbeyyyqbeezmev42qjriohmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815105903/http://cgi.csc.liv.ac.uk/~michael/masta05.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/a2/1ca24cac768b7d0d60dbdb92e908fb236a7c68fe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11595014_53"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Constraint deduction in an interval-based temporal logic [chapter]

Jana Koehler, Ralf Treinen
<span title="">1995</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;
We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop.  ...  We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning system PHI which uses LLP as underlying formalism.  ...  Acknowledgements We would like to thank Susanne Biundo, Hans-Jürgen Bürckert, Dietmar Dengler, Hans-Jürgen Ohlbach and Gert Smolka for their interest and for fruitful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58976-7_7">doi:10.1007/3-540-58976-7_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/loa4rzzrs5djpdhbjm6pjra5oi">fatcat:loa4rzzrs5djpdhbjm6pjra5oi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829210156/http://www.ps.uni-saarland.de/Publications/documents/ConstraintInterval-i.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/99/b9/99b9269060ec353d1c38b4160e048fc0cb8f5026.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58976-7_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formal methods for verification of clinical practice guidelines

Arjen Hommersom, Perry Groot, Michael Balser, Peter Lucas
<span title="">2008</span> <i title="IOS Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ju2ftoebbcvrjj6lqnnbh42wq" style="color: black;">Studies in Health Technology and Informatics</a> </i> &nbsp;
In recent years, there has been a growing interest to apply these methods in the area of medical guidelines and protocols.  ...  Formal methods play an important role in the development of software and hardware systems.  ...  In linear temporal logics (e.g., Linear Temporal Logic (LTL) [45] ), models form a linear trace, while in branching logics models typically (e.g., Computation Tree Logic (CTL) [8, 14, 21] ) form a tree  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/18806321">pmid:18806321</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w3u4dmj7w5fitjeqmosymg4rum">fatcat:w3u4dmj7w5fitjeqmosymg4rum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120912112831/http://www.cs.ru.nl/~perry/publications/2008/Book/fm.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/40/14/40141a559161aa6d13bc4dfc27b689707ce29c49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

An Axiomatization for Cylinder Computation Model [chapter]

Nan Zhang, Zhenhua Duan, Cong Tian
<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;
In addition, the soundness and completeness of the system are proved.  ...  To model and verify multi-core parallel programs, the paper proposes an axiom system for Propositional Projection Temporal Logic with Cylinder Computation Model (CCM-PPTL).  ...  Conclusion We introduce a Cylinder Computation Model into Propositional Projection Temporal Logic and propose an axiom system for CCM-PPTL, which can be employed to model and verify many-core computation  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08783-2_7">doi:10.1007/978-3-319-08783-2_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ny5srglrtrfofatrvyv2acresu">fatcat:ny5srglrtrfofatrvyv2acresu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226214242/http://pdfs.semanticscholar.org/7308/23eff102f87a34c410c7b7533bfdc0630cd9.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/73/08/730823eff102f87a34c410c7b7533bfdc0630cd9.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-08783-2_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Implementing Temporal Logics: Tools for Execution and Proof [chapter]

Michael Fisher
<span title="">2006</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;
I thank them all for their endeavours. Summary We have overviewed a selection of tools for execution and proof within temporal logic.  ...  Although these tools are generally prototypes, they are increasingly used in realistic scenarios, and more sophisticated versions appear likely to have a significant impact in both Computer Science and  ...  In our case, both of these use temporal formulae within a specific normal form, called Separated Normal Form (SNF) [16] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11750734_8">doi:10.1007/11750734_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dnerita2qfcevnmo3ah62kf24m">fatcat:dnerita2qfcevnmo3ah62kf24m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120701215621/http://www.clip.dia.fi.upm.es/Conferences/Colognet/ITCLS-2002/PAPERS/Fisher.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/da/36/da3678efc9a97dea99fd8d65ed394cbcf69647f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11750734_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the Relational Translation Method for Propositional Modal Logics [article]

Jian Zhang
<span title="2021-12-29">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Using a state-of-the-art theorem prover for first-order predicate logic, we proved many benchmark theorems available from the modal logic literature.  ...  One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers.  ...  However, since the prover is not so good at proving "if-and-only-if" theorems [12] , we broke each theorem of the form A ↔ B into two cases A → B and B → A.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.14605v1">arXiv:2112.14605v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vguv4m55lncobephupx236qwfe">fatcat:vguv4m55lncobephupx236qwfe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220105224859/https://arxiv.org/pdf/2112.14605v1.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/34/dc/34dc9b434a72b1172024d67d822c7cd1678b1d15.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.14605v1" 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>

Page 27 of Mathematical Reviews Vol. , Issue 99a [page]

<span title="">1991</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;
.| (4-MNMT-C; Manchester) A normal form for temporal logics and its applications in theorem-proving and execution. (English summary) J. Logic Comput. 7 (1997), no. 4, 429-456.  ...  The paper provides a description of separated normal form (SNF), a normal form for temporal logic formulae.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-01_99a/page/27" 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_1991-01_99a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Temporal Annotated Constraint Logic Programming

THOM FRÜHWIRTH
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ezljl2d3lzga5efenbxdvvfcpa" style="color: black;">Journal of symbolic computation</a> </i> &nbsp;
Given a logic in this framework, there is a systematic way to make a clausal fragment executable as a constraint logic program.  ...  We show this for the generic case and for the specific case of temporal annotated logic.  ...  Last but not least thanks to my wife Andrea and my daughter Anna for their patience.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jsco.1996.0066">doi:10.1006/jsco.1996.0066</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/66yg4mnus5ezvnqjxnbq3r3t7m">fatcat:66yg4mnus5ezvnqjxnbq3r3t7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170929220549/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/823/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDc0NzcxNzE5NjkwMDY2OA%3D%3D.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/b5/f5/b5f5792d32349c515928e5bb000e84603bc88a46.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jsco.1996.0066"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Mark-Oliver Stehr
<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;
The fairly general setting for this paper is a formal development of a UNITY-style temporal logic for labeled transition systems in the calculus of inductive constructions which has been conducted using  ...  It relies on a notion of compositional proofs, which in turn is closely related to classical work on interference-free proofs for parallel programs.  ...  Acknowledgement I am grateful for a meeting with Jayadev Misra during his visit at UIUC in 2003, and I appreciate his suggestion to prepare a paper on the unconventional approach to compositionality in  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.12.073">doi:10.1016/j.entcs.2005.12.073</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q6x7oiw4ijbsfi4iucefu6faeq">fatcat:q6x7oiw4ijbsfi4iucefu6faeq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171005032343/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/eb9/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMTU3MTA2NjEwNjAwMjg3OA%3D%3D.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/a6/15/a61527d65fd2eb5dc2a5aa8b3c9fe5a7e8e77d50.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.073"> <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>

Mechanical verification of distributed algorithms in higher-order logic

C.-T. Chou
<span title="1995-02-01">1995</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bf4qaipmsrghrjyxonrsmqevie" style="color: black;">Computer journal</a> </i> &nbsp;
In this paper we explain how to do so using HOL|an interactive proof assistant for higher-order logic developed by Gordon and others.  ...  First, we describe how to build an infrastructure in HOL that supports reasoning about distributed algorithms, including formal theories of predicates, temporal logic, labeled transition systems, simulation  ...  , Konrad Slind, Joakim von Wright, and the anonymous referees for their helpful comments, and to HOL users around the world for sustaining a lively and friendly user community.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comjnl/38.2.152">doi:10.1093/comjnl/38.2.152</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e36lngtxofdo3dam5lfd5ohxde">fatcat:e36lngtxofdo3dam5lfd5ohxde</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130701233239/http://csep.hpcc.nectec.or.th/Journals/oup/smj/journals/ed/titles/computer_journal/Volume_38/Issue_02/38.2.pdf/chou.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/d6/4d/d64dba2ab9ee217798e120925bd9fc6f507bb2fb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comjnl/38.2.152"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

A spatio-temporal specification language and its completeness & decidability

Tengfei Li, Jing Liu, Haiying Sun, Xiang Chen, Lipeng Zhang, Junfeng Sun
<span title="2020-11-25">2020</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5xopidd6nfk7cgyceba77n2xe" style="color: black;">Journal of Cloud Computing: Advances, Systems and Applications</a> </i> &nbsp;
We provide a Hilbert-style axiomatization for the proposed STSL PC and prove the soundness and completeness by the spatio-temporal extension of maximal consistent set and canonical model.  ...  In this paper, we present a spatio-temporal specification language, STSL PC, by combining Signal Temporal Logic (STL) with a spatial logic S4 u, to characterize spatio-temporal dynamic behaviors of cyber-physical  ...  Authors' information Availability of data and materials Not applicable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13677-020-00209-3">doi:10.1186/s13677-020-00209-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7furkjr4nzdvllolt3ta33znha">fatcat:7furkjr4nzdvllolt3ta33znha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201129015129/https://journalofcloudcomputing.springeropen.com/track/pdf/10.1186/s13677-020-00209-3.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/9b/75/9b75e8ca6b2cf8e1963a33d3393eb2655c5d8324.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s13677-020-00209-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 11,564 results