Filters








44,452 Hits in 5.4 sec

Mechanical verification of distributed algorithms in higher-order logic

C.-T. Chou
1995 Computer journal  
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  ...  The Computer Journal, Vol. 36, No. 5, 1993 Mechanical Verification of Distributed Algorithms in Higher-Order Logic  ... 
doi:10.1093/comjnl/38.2.152 fatcat:e36lngtxofdo3dam5lfd5ohxde

Page 6044 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Francis Tang, Imple- menting a program logic of objects in a higher-order logic theorem prover (268-282); M.  ...  - Cog (356-371); Linas Laibinis and Joakim von Wright, Functional procedures in higher-order logic (372-387).  ... 

Page 6958 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
{For the entire collection see MR 95j:68019.} 95k:68139 68Q60 03B15 03B35 68T15 Chou, Ching-Tsun (1-UCLA-C; Los Angeles, CA) Mechanical verification of distributed algorithms in higher-order logic.  ...  The chief aim of this paper is to show, via a simple but typical example, how such proofs can be constructed and checked using HOL—a mechanical theorem-proving system for higher-order logic.  ... 

Page 6201 of Mathematical Reviews Vol. , Issue 95j [page]

1995 Mathematical Reviews  
Roche, Towards a HOL theory of memory (49-64); Ching-Tsun Chou, A formal the- ory of undirected graphs in higher-order logic (144-157); Ching- Tsun Chou, Mechanical verification of distributed algorithms  ...  Prasetya, Towards a mechanically supported and compositional calculus to design distributed algorithms (362-377); J. von Wright, Representing higher-order logic proofs in HOL (456-470).  ... 

Time Synchronization Algorithm for Distributed Digital Product Collaborative Simulation in Multi-core Environment

2017 Revista Técnica de la Facultad de Ingeniería Universidad del Zulia  
In order to improve the efficiency of simulation verification and the self-adaptability of time management for digital prototype products in multi-core cluster environment, a method to automatically adjust  ...  the time advance strategy is proposed, which dynamically adjusts the time synchronization mechanism according to the performance of the prototype in the simulation verification, to monitor the load imbalance  ...  Basic Research Plan in Shaanxi Province of China (2016KJXX-62).Thanks for the help.  ... 
doi:10.21311/001.39.10.21 fatcat:jpmjtz2j3rgrhgau5ceaidprue

Probabilistic Guarded Commands Mechanized in HOL

Joe Hurd, Annabelle McIver, Carroll Morgan
2005 Electronical Notes in Theoretical Computer Science  
Proofs about pGCL programs are based on an underlying logic of real-(rather than boolean-) valued functions, and in this paper we present a mechanization of pGCL using the HOL theorem prover [5] .  ...  This theory was constructed as a definitional extension of higher-order logic, and includes a direct proof that all pGCL commands are healthy, for which the principal condition is sublinearity (the generalization  ...  In this paper we present the following significant novelties: a mechanization of pGCL programs (with weakest precondition semantics) in higher-order logic, using the HOL4 theorem prover; an automatic proof  ... 
doi:10.1016/j.entcs.2004.01.021 fatcat:ycxm2ydppjfrheagqfgdiz5gb4

Probabilistic Analysis of Wireless Systems Using Theorem Proving

Osman Hasan, Sofiène Tahar
2009 Electronical Notes in Theoretical Computer Science  
The paper presents a concise description of the formal foundations required to conduct the analysis of a wireless system in a theorem prover, such as, the higher-order-logic modeling of random variables  ...  To overcome these limitations, we propose to use a higher-order-logic theorem prover (HOL) for the analysis of wireless systems.  ...  The paper provides a formalization of the ARQ mechanism at the LLC layer of the GPRS standard in higher-order-logic and the formal verification of a couple of probabilistic properties related to the number  ... 
doi:10.1016/j.entcs.2009.06.022 fatcat:b4vone4zjjdxnmfie6skiaqg6i

Page 1061 of Mathematical Reviews Vol. , Issue 95b [page]

1995 Mathematical Reviews  
Pettersson, Program verification using HOL-UNITY (1-15); Kim Dam Pe- tersen, Graph model of LAMBDA in higher order logic (progress report) (16-28); Cui Zhang et al., Mechanizing a programming logic for  ...  Carrefio, Verifica- tion in higher order logic of mutual exclusion algorithm (501-513); Sara Kalvala, Using Isabelle to prove simple theorems (514-517).  ... 

An Improved Proof-of-Trust Consensus Algorithm for Credible Crowdsourcing Blockchain Services

Xiaoyu Zhu, Yi Li, Li Fang, Ping Chen
2020 IEEE Access  
Firstly, this PoT consensus selects nodes with high credibility using subjective logic reputation algorithm.  ...  With this mechanism, candidate nodes prefer to give honest verification results rather than engage in collusion with malicious nodes.  ...  In order to ensure mutual check, the verification nodes verify the local data blocks, then signs the verification results and broadcasts them in a distributed manner.  ... 
doi:10.1109/access.2020.2998803 fatcat:mxtfo3auozhv5bp4wijkquh3qm

Probabilistic guarded commands mechanized in HOL

Joe Hurd, Annabelle McIver, Carroll Morgan
2005 Theoretical Computer Science  
set of verification conditions.  ...  This is employed to verify the partial correctness of the probabilistic voting stage in Rabin's mutual-exclusion algorithm.  ...  Acknowledgements This work was completed while Hurd was on leave from the Computer Laboratory at Cambridge, visiting McIver with the support of a Fellowship at Macquarie University in Sydney.  ... 
doi:10.1016/j.tcs.2005.08.005 fatcat:zfxxxgq4pvgklpq35cm6gznncm

On The Integration of Decision Diagrams in High Order Logic Based Theorem Provers:a Survey

Sa'ed Abed, Otmane Ait Mohamed, Ghiath Al Sammane
2007 Journal of Computer Science  
This survey discuss approaches that integrate Decision Diagrams inside High Order Logic based Theorem provers.  ...  The approaches can be divided in two kinds, one is based on building a translation between model checker and theorem prover, the second is based on embedding the model checker algorithms inside the theorem  ...  It provides an open proof architecture for the integration of different verification tools in a uniform higher-order logic environment.  ... 
doi:10.3844/jcssp.2007.810.817 fatcat:gu5y5qe4azbpblxoebifj6ys5a

Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables

Osman Hasan, Sofiène Tahar
2008 Journal of automated reasoning  
In order to demonstrate the practical effectiveness of the formalization presented in this paper, we also present the probabilistic analysis of the Coupon Collector's problem in HOL.  ...  Building upon this definition, we formalize the mathematical concept of variance and verify some classical properties of expectation and variance in HOL.  ...  higher-order logic.  ... 
doi:10.1007/s10817-008-9113-6 fatcat:yxf33czchja4rft7u4gwgfq6mu

Computer Assisted Reasoning

Richard Boulton, Joe Hurd, Konrad Slind
2009 Journal of automated reasoning  
This evolved into TPHOLs (Theorem Proving in Higher Order Logics), which provides a venue for research on any aspect of theorem proving with a flavour of higher order logic.  ...  Mike abandoned LCF LSM in favour of higher order logic (HOL) following discussions with Ben Moszkowski; the benefits of higher-order functions for hardware are discussed in [19] .  ... 
doi:10.1007/s10817-009-9144-7 fatcat:rd5iyn6gw5canbyhgz4gfxt2yi

Page 7095 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
Loewenstein, Formal verification of counterflow pipeline architecture (261-276); Ralf Reetz, Deep em- bedding VHDL (277-292); Franz Regensburger, HOLCF: higher order logic of computable functions (293-  ...  {Most of the papers are being reviewed individually. } 68 COMPUTER SCIENCE 97k:68008 97k:68007 68-06 03-06 03B15 03B35 68TIS5 * Higher order logic theorem proving and its applications.  ... 

Computer-Aided Verification for Mechanism Design [chapter]

Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, Pierre-Yves Strub
2016 Lecture Notes in Computer Science  
This mechanism presents new challenges for formal verification, including essential use of randomness from both the execution of the mechanism and from the prior type distributions.  ...  To demonstrate, we present the verification of a sophisticated mechanism: the generic reduction from Bayesian incentive compatible mechanism design to algorithm design given by Hartline, Kleinberg, and  ...  We especially thank Ran Shorrer for pointing out empirical evidence that agents may manipulate their reports even when the mechanism is truthful.  ... 
doi:10.1007/978-3-662-54110-4_20 fatcat:7vgkp6ov2je6zlgn6wq352gl4y
« Previous Showing results 1 — 15 out of 44,452 results