Filters








23 Hits in 3.4 sec

Performance Analysis of ARQ Protocols using a Theorem Prover

Osman Hasan, Sofiene Tahar
2008 ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software  
To overcome these limitations, we propose to conduct the performance analysis of ARQ protocols in the environment of a higher-order-logic theorem prover (HOL).  ...  The behavior of an ARQ protocol largely depends on a number of network parameters and traditionally simulation is used for their performance analysis.  ...  In this paper, we show how the performance analysis of ARQ protocols can be mechanically performed using the HOL theorem prover, providing a superior approach to validation by simulation.  ... 
doi:10.1109/ispass.2008.4510741 dblp:conf/ispass/HasanT08 fatcat:c4ybn5g4szbydnmgqt3qndtb54

Probabilistic Analysis of Wireless Systems Using Theorem Proving

Osman Hasan, Sofiène Tahar
2009 Electronical Notes in Theoretical Computer Science  
To overcome these limitations, we propose to use a higher-order-logic theorem prover (HOL) for the analysis of wireless systems.  ...  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  ...  The third step for conducting probabilistic analysis in a theorem prover is to formally verify the higher-order-logic theorems developed in the previous step using a theorem prover.  ... 
doi:10.1016/j.entcs.2009.06.022 fatcat:b4vone4zjjdxnmfie6skiaqg6i

Formal Verification of Cyber-Physical Systems using Theorem Proving (Invited Paper) [article]

Adnan Rashid, Umair Siddique, Sofiene Tahar
2020 arXiv   pre-print
In particular, we survey recent developments in the use of theorem proving, a formal method, for the modeling, analysis and verification of CPS, and overview some real world CPS case studies from the automotive  ...  In fact, a CPS shall adhere to strict safety, reliability, performance and security requirements, where one needs to capture both physical and random aspects of the various CPS modules and then analyze  ...  Hasan et al. also used their probability theory in HOL4 for conducting the performance analysis of Automatic-repeat-request (ARQ) protocols, i.e., Stop-and-Wait, Go-Back-N and Selective-Repeat protocols  ... 
arXiv:2003.03729v1 fatcat:v57i7srws5afdlixnbype3fztu

Performance Analysis of Go-Back-N ARQ Protocol Used In Data Transmission Over Noisy Channels

Fayza Ahmed Nada
2020 Advances in Science, Technology and Engineering Systems  
This paper presents a new mathematical model to analyze performance of Go-Back-N ARQ protocol over noisy channels. Many performance measures of Go-Back-N ARQ protocols are discussed.  ...  The analysis uses Stochastic Process and a two-dimensional Markov Chain to present the proposed model.  ...  While [2] : "proposes to analyze the performance of ARQ protocols with applying a Higher Order Logic theorem prover (HOL).  ... 
doi:10.25046/aj050472 fatcat:mciajppb4vghdghflef7gfebxa

Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL

Osman Hasan, Sofiène Tahar
2008 Journal of automated reasoning  
This formal specification can then be used in a HOL theorem prover to reason about both functional and performance related properties of the given realtime system.  ...  In this paper, we propose to use higher-order-logic (HOL) theorem proving for the performance analysis of real-time systems.  ...  In order to illustrate the practical effectiveness of our approach, we utilized it to conduct the functional verification and performance analysis of a Stop-and-Wait protocol using the HOL theorem prover  ... 
doi:10.1007/s10817-008-9105-6 fatcat:ko6u6ntqnjgonfulaqtcptm3lm

Distance-Bounding Based Defense Against Relay Attacks in Wireless Networks

Caimu Tang, Dapeng Wu
2007 IEEE Transactions on Wireless Communications  
We propose to use the order statistic for the detection of relay attackers. We show that it is optimal in terms of minimum variance.  ...  In this paper, a non-interactive zero-knowledge proof scheme is proposed for secure identification in wireless networks, and it uses a timed oblivious transfer technique to enable a single verifier to  ...  Under this approach, the prover uses the OT protocol to send messages to the verifier in multiple rounds; in each round, the prover uses a different OT public key to "encrypt" the messages.  ... 
doi:10.1109/twc.2007.060183 fatcat:7j4ilb553bfb5f65cajh2deof4

Formal Probabilistic Analysis of a Wireless Sensor Network for Forest Fire Detection

Maissa Elleuch, Osman Hasan, Sofiène Tahar, Mohamed Abid
2013 Electronic Proceedings in Theoretical Computer Science  
In this paper, we propose to overcome this limitation by applying formal probabilistic analysis using theorem proving to verify scheduling performance of a real-world WSN for forest fire detection using  ...  The performance analysis of these random scheduling approaches is traditionally done by paper-and-pencil proof methods or simulation.  ...  In particular, we perform a probabilistic analysis using theorem proving to verify performance characteristics of a WSN deployed for forest fire detection.  ... 
doi:10.4204/eptcs.122.1 fatcat:cnedatymwzfetjrrvk5o34ghoe

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built  ...  For example, while verifying a communication protocol, we can use automated theorem provers, model checking and theorem proving.  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks [chapter]

Maissa Elleuch, Osman Hasan, Sofiène Tahar, Mohamed Abid
2011 Lecture Notes in Computer Science  
Using the probabilistic framework developed in the HOL theorem prover, we formally reason about the expected values of coverage intensity, the upper bound on the total number of disjoint subsets, for a  ...  The performance of these algorithms is usually analyzed using simulation techniques, which do not offer 100% accurate results.  ...  The purpose of this paper was to provide a reliable analysis by using an accurate formal probabilistic reasoning based on the general purpose HOL theorem prover.  ... 
doi:10.1007/978-3-642-24559-6_27 fatcat:lvf7oqrpcfdexjqbe5xrk7hfju

A framework for modeling transfer protocols

Peter Herrmann, Heiko Krumm
2000 Computer Networks  
Moreover, it provides theorems to be used as building blocks of veri®cations.  ...  Moreover, the framework may be used for the formal modeling and analysis of those protocol con®gurations which are in the range of current dynamic communication system con®guration approaches like DaCapo  ...  We outlined the essential features of the transfer protocol framework and its application to the formal speci®cation and veri®cation of communication protocols with the help of a sliding window protocol  ... 
doi:10.1016/s1389-1286(00)00089-x fatcat:jn3bowfbsjdfrbbdnn5wg2mule

A SURVEY OF REPROGRAMMING SECURITY IN WIRELESS SENSOR NETWORK

Depeng Chen, Daojing He, Farooq Ahmad
2016 VFAST Transactions on Software Engineering  
Wireless sensor network is widely used around us, which makes a great contribution to our daily life.  ...  These protocols are often used to disseminate code image in wireless sensor network, and they contain some common techniques.  ...  For example, coq [53] and Isabelle [54] , we can use this interactive theorem prover to do some formal verification.  ... 
doi:10.21015/vtse.v9i1.406 fatcat:3dtblilbebha7iyc4w66wxb7ja

Check and simulate: a case for incorporating model checking in network simulation

A. Sobeih, M. Viswanathan, J.C. Hou
Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04.  
As a proof of concept, we have demonstrated use of the J-Sim model checker in locating errors in an automatic repeat request (ARQ) protocol.  ...  Existing network simulators perform reasonably well in evaluating the performance of network protocols, but lack the capability of verifying and validating the correctness of network protocols.  ...  Maude is extremely powerful and can be used to create executable specifications for a wide range of applications (e.g., other languages, theorem provers, concurrent systems).  ... 
doi:10.1109/memcod.2004.1459810 dblp:conf/memocode/SobeihVH04 fatcat:dmkgveeozbdmlh5agg2y4irz4a

Temporal Logic To Query Semantic Graphs Using The Model Checking Method

Mahdi Gueffaz, Sylvain Rampacek, Christophe Nicolle
2012 Journal of Software  
The processing of large semantic graphs is a limit to the use of semantics in current information systems.  ...  SPARQL (Simple Protocol and RDF query Language) query language is the standard for querying the Semantic Web, but it has a lot of limitations.  ...  These properties are proven with the highest possible precision using tools such as theorem provers and proof checkers. Theorems proofs are also called proof assistants.  ... 
doi:10.4304/jsw.7.7.1462-1472 fatcat:sblqu7ijknao7mx6mduspwawke

AN INTEGRATED FRAMEWORK UTILISING SOFTWARE AGENT REASONING AND ONTOLOGY MODELS FOR SENSOR BASED BUILDING MONITORING

Michael Dibley, Haijiang Li, Yacine Rezgui, John Miles
2015 Journal of Civil Engineering and Management  
Several different types of sensors were integrated with the ZigBee host devices to produce compact multi-functional sensor units.  ...  Conventional facility management (FM) software tools lack semantically rich components, and that limits the capability of supporting software for automatic information sharing, resource negotiation and  ...  for conventional systems. in such systems agents are typically theorem provers, where goals and beliefs etc. are derived from the logical representation of the specification.  ... 
doi:10.3846/13923730.2014.890645 fatcat:b25mqku2wbgzdgmufu2b6jmd2a

Next generation models for storage and representation of microbial biological annotation

Daniel J Quest, Miriam L Land, Thomas S Brettin, Robert W Cottingham
2010 BMC Bioinformatics  
The advent of Semantic Web standards such as Resource Description Framework (RDF) and OWL Web Ontology Language (OWL) enables us to construct systems that address these challenges in a new comprehensive  ...  The exponential growth of sequence data drives a growing need for increasingly higher quality and automatically generated annotation.  ...  All authors approved the final version of the manuscript.  ... 
doi:10.1186/1471-2105-11-s6-s15 pmid:20946598 pmcid:PMC3026362 fatcat:jlwn47faindwfklkfoa3yypwqy
« Previous Showing results 1 — 15 out of 23 results