Search results for "Checking"

showing 10 items of 53 documents

Fact checking during COVID-19: a comparative analysis of the verification of false contents in Spain and Italy

2021

With the spread of COVID-19 around the world, a large number of hoaxes or false and out of context news are also spreading. In the moment, the studies that have been carried out regarding the topic have mainly focused on single-territory research. For this reason, we consider it pertinent to widen the spectrum and observe the behaviour of more than just one country. More specifically, the present study compiles a comparative analysis between Spain and Italy regarding fake contents and the diverse elements that have come into play in the media during the first months of the new type of coronavirus in Europe. To do this, we have used the fact checking platforms Maldita.es and Open. Once the i…

HistoryCoronavirus disease 2019 (COVID-19)HoaxCommunicationFact checkingLibrary scienceContext (language use)Sample (statistics)Period (music)
researchProduct

IVANOVA, una possibile metodologia per la Information Literacy

Information litarcy internet web bolla di filtraggio fact checking post-truth
researchProduct

Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol

2012

Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implem…

Internet Protocol Control Protocolcomputer.internet_protocolComputer scienceVDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422Distributed computingAutomatic repeat requestGeneral Inter-ORB ProtocolData_CODINGANDINFORMATIONTHEORYInternet protocol suitefinite model-checkingComputer Science::Networking and Internet ArchitecturePROMELAComputer Science::Information Theorybusiness.industryNode (networking)Link Control ProtocolComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKScooperative communicationsCooperative diversityprotocol verificationHardware and ArchitecturebusinessLawcomputerSoftwareReverse Address Resolution ProtocolComputer networkComputer Standards & Interfaces
researchProduct

Safety Assurance of a High Voltage Controller for an Industrial Robotic System

2020

Abstract Due to the risk of discharge sparks and ignition, there are strict rules concerning the safety of high voltage electrostatic systems used in industrial painting robots. In order to assure that the system fulfils its safety requirements, formal verification is an important tool to supplement traditional testing and quality assurance procedures. The work in this paper presents formal verification of the most important safety functions of a high voltage controller. The controller has been modelled as a finite state machine, which was formally verified using two different model checking software tools; Simulink Design Verifier and RoboTool. Five safety critical properties were specifie…

Model checking0209 industrial biotechnologyFinite-state machinebusiness.industryComputer science020207 software engineering02 engineering and technologyReliability engineering020901 industrial engineering & automationSoftwareControl theoryVoltage controllerSafety assurance0202 electrical engineering electronic engineering information engineeringbusinessFormal verificationQuality assurance
researchProduct

Formal Analysis and Model Checking of a Group Authentication Protocol by Scyther

2016

Scyther [1] is designed to check the security and vulnerabilities of security protocols. In this paper, we use Scyther to analyze two discrete logarithm problem (DLP) based group authentication protocols proposed in [2]. These two protocols are claimed to satisfy several security requirements, but only part of them have been checked because of the properties and limitations of Scyther. Some positive results have been gained and show that the protocols provide mutual authentication and implicit key authentication and are secure against impersonation attack. An important innovation in this paper is that we have extended the expressing ability of Scyther by giving some reasonable assumption du…

Model checkingAuthenticationTheoretical computer scienceComputer sciencebusiness.industry020206 networking & telecommunicationsCryptography02 engineering and technologyMutual authenticationCryptographic protocolComputer securitycomputer.software_genreKey authenticationDiscrete logarithmAuthentication protocol0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingbusinesscomputer2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)
researchProduct

Building a new CTL model checker using Web services

2013

This Computation Tree Logic (CTL) is widely used to capture compositions of reactive systems. Model checking is particularly well-suited for the automated verification of finite-state systems, both for software and for hardware. A CTL model checker tool allows designers to automatically verify that systems satisfy specifications expressed in the language of CTL logic. In this paper we present a new CTL model checker implemented in client-server paradigm. CTL Designer, the client tool, allows an interactive construction of the CTL models as state-transition graphs. Java and C# APIs are provided for programmatic construction of large models. The server part of our tool embeds the core of the …

Model checkingComputation tree logicbusiness.industryComputer scienceProgramming languagecomputer.software_genreCTL*TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESSoftwareTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSScalabilityWeb servicebusinessFormal verificationcomputerReactive system2013 21st International Conference on Software, Telecommunications and Computer Networks - (SoftCOM 2013)
researchProduct

Verification of JADE Agents Using ATL Model Checking

2015

It is widely accepted that the key to successfully developing a system is to produce a thorough system specification and design. This task requires an appropriate formal method and a suitable tool to determine whether or not an implementation conforms to the specifications. In this paper we present an advanced technique to analyse, design and debug JADE software agents, using Alternating-time Temporal Logic (ATL) which is interpreted over concurrent game structures, considered as natural models for compositions of open systems. In development of the proposed solution, we will use our original ATL model checker. In contrast to previous approaches, our tool permits an interactive or programma…

Model checkingComputer Networks and Communicationsbusiness.industryComputer scienceProgramming languagemedia_common.quotation_subjectJADE (programming language)System requirements specificationFormal methodscomputer.software_genreComputer Science ApplicationsComputational Theory and MathematicsDebuggingSoftware agentEmbedded systemTemporal logicWeb servicebusinesscomputermedia_commoncomputer.programming_languageInternational Journal of Computers Communications & Control
researchProduct

Towards a Formal Analysis of MQtt Protocol in the Context of Communicating Vehicles

2017

International audience; The paper presents a formal approach to model, analyze, and verify a variant of Message Queue Telemetry Transport protocol (MQtt), dedicated to communicating vehicles (MQtt-CV) that send collected data to automotive infrastructures(subscribers). Our formal approach is based on Promela language and its system verification tool, the model checker SPIN. We propose a slight modification of MQtt protocol to reduce the big volume of data collected and sent by vehicles to infrastructures. Indeed, in the original version of MQtt protocol, when a broker receives data from publishers, it sends them directly to its subscribers without any filtration. As consequence, subscribers…

Model checkingComputer scienceDistributed computingAutomotive industryContext (language use)02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]0202 electrical engineering electronic engineering information engineeringProtocol (object-oriented programming)computer.programming_languageMQTTbusiness.industryVolume (computing)020206 networking & telecommunications020207 software engineering[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationPromela[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA][INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessMessage queuecomputerComputer network
researchProduct

Deciding properties of integral relational automata

1994

This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.

Model checkingDiscrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer scienceComputer Science::Software EngineeringDecidabilityUndecidable problemComputer Science::Multiagent SystemsCTL*TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRelational calculusTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceAutomata theoryTime complexityComputer Science::Formal Languages and Automata Theory
researchProduct

Domain specific language for securities settlement systems

2012

Actual problems during design, implementation and maintenance of securities settlement systems software are achieving complementarity of several different, connected, asynchronously communicating settlement systems and verification of this complementarity. The aim of this paper is to create domain specific language for modeling of settlement systems and their interactions. Then use models to calculate settlement systems behavior. Specific of settlement systems requires that they perform accordingly to business rules in any situation. This makes use of model checking a very desirable step in development process of settlement systems. Defining a domain specific language and creating editor su…

Model checkingDomain-specific languageBusiness rulebusiness.industryComputer scienceBasis path testingComputingMilieux_LEGALASPECTSOFCOMPUTINGcomputer.software_genreComplementarity (physics)SoftwareTest caseData miningSoftware engineeringbusinessFormal verificationcomputer2012 Second International Conference on Digital Information Processing and Communications (ICDIPC)
researchProduct