scholarly journals AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS

2011 ◽  
Vol 22 (04) ◽  
pp. 761-782 ◽  
Author(s):  
PAROSH AZIZ ABDULLA ◽  
GIORGIO DELZANNO ◽  
AHMED REZINE
Keyword(s):  
Arbitrary Number ◽  
Symbolic Representation ◽  
Reachability Analysis ◽  
Automatic Verification ◽  
Client Server ◽  
Verification Method ◽  
Graph Transformations ◽  
Access Rights ◽  
Graph Constraints ◽  
Symbolic Verification

We propose a symbolic verification method for directory-based consistency protocols working for an arbitrary number of controlled resources and competing processes. We use a graph-based language to specify in a uniform way both client/server interaction schemes and manipulation of directories that contain the access rights of individual clients. Graph transformations model the dynamics of a given protocol. Universally quantified conditions defined on the labels of edges incident to a given node are used to model inspection of directories, invalidation loops and integrity conditions. Our verification procedure computes an approximated backward reachability analysis by using a symbolic representation of sets of configurations. Termination is ensured by using the theory of well-quasi orderings.

scholarly journals Parametric Verification of a Group Membership Algorithm

2006 ◽  
Vol 6 (3) ◽  
pp. 321-353 ◽  
Author(s):  
AHMED BOUAJJANI ◽  
AGATHE MERCERON
Keyword(s):  
Arbitrary Number ◽  
Group Membership ◽  
Automatic Verification ◽  
Verification Method

We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial ‘non-clique’ property: it is impossible to have two or more disjoint groups of stations communicating exclusively with stations in their own group. In this paper, we propose an automatic verification method for an arbitrary number of stations $N$ and a given number of faults $k$. We give an abstraction that allows to model the algorithm by means of unbounded (parametric) counter automata. We have checked the non-clique property on this model in the case of one fault, using the ALV tool as well as the LASH tool.

scholarly journals On Formal and Automatic Security Verification of WSN Transport Protocols

2014 ◽  
Vol 2014 ◽  
pp. 1-20 ◽  
Author(s):  
Vinh Thong Ta ◽  
Levente Buttyán ◽  
Amit Dvir
Keyword(s):  
Wireless Sensor Networks ◽  
Real Time ◽  
Formal Language ◽  
Process Analysis ◽  
Automatic Verification ◽  
Wireless Sensor ◽  
Behavioral Characteristics ◽  
Transport Protocols ◽  
Verification Method ◽  
Security Verification

We address the problem of formal and automated security verification of transport protocols for wireless sensor networks (WSN) that may perform cryptographic operations. The verification of this class of protocols is difficult because they typically consist of complex behavioral characteristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem, we propose a probabilistic timed calculus for cryptographic protocols and demonstrate how to use this formal language for proving security or vulnerability of protocols. The main advantage of the proposed language is that it supports an expressive syntax and semantics, allowing for studying real-time, probabilistic, and cryptographic issues at the same time. Hence, it can be used to verify systems that involve these three properties in a convenient way. In addition, we propose an automatic verification method, based on the well-known PAT process analysis toolkit, for this class of protocols. For demonstration purposes, we apply the proposed manual and automatic proof methods for verifying the security of DTSN and SDTP, which are two of the recently proposed WSN transport protocols.

Automatic verification method of ATC command repetition based on Siamese network

2021 ◽  
Author(s):  
ZhiHong Wang ◽  
NianSheng Chen ◽  
YiPing Ma ◽  
Lei Rao ◽  
GuangYu Fan
Keyword(s):  
Automatic Verification ◽  
Verification Method ◽  
Siamese Network

scholarly journals A Model Based Security Testing Method for Protocol Implementation

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yu Long Fu ◽  
Xiao Long Xin
Keyword(s):  
Security Protocol ◽  
Automatic Verification ◽  
Test Cases ◽  
Extended Model ◽  
Security Testing ◽  
Penetration Testing ◽  
Protocol Implementation ◽  
Verification Method ◽  
Testing Method ◽  
Specific Protocol

The security of protocol implementation is important and hard to be verified. Since the penetration testing is usually based on the experience of the security tester and the specific protocol specifications, a formal and automatic verification method is always required. In this paper, we propose an extended model of IOLTS to describe the legal roles and intruders of security protocol implementations, and then combine them together to generate the suitable test cases to verify the security of protocol implementation.

scholarly journals REMOTE REGISTRY EDITOR

2016 ◽  
Vol 2 (1) ◽  
Author(s):  
Bambang Kelana Simpony
Keyword(s):  
Operating System ◽  
Computer Network ◽  
Receiver Function ◽  
Visual Basic ◽  
System Configuration ◽  
Client Server ◽  
Application Programming ◽  
Access Rights ◽  
Server Application ◽  
Visual Basic 6.0

Abstract - Permissions setting on a computer is necessary. This is an effort that is not easy to change the system configuration or settings changed by the user. With a network of computers, of course, permissions setting do not need to be done one by one manually. Because in a computer network course there are many collection of computers connected together. Permissions setting so that the system can use the client-server applications that access restrictions can be done effectively. As the implementation of client-server applications can be created using Visual Basic 6.0. This language has been able to access the socket on the Windows operating system, named Winsock API that supports TCP / IP. This protocol is widely used because of the reliability of client-server application programming. The application is divided into two main applications, namely the client and server program name with the name of the Receiver Sender program. Receiver function receives instructions restriction of access rights Sender and send reports to the Sender process execution. While Sender function to send instructions restrictions permissions via the Registry to the Receiver. And after the test, the application can block important features available in the Windows operating system. So it is expected that these applications can help in permissions setting on a computer network. Keywords: Registry, Winsock API, TCP/IP, Socket, Protocol, Networking Abstrak - Pengaturan hak akses di suatu komputer sangat diperlukan. Hal ini merupakan salah satu upaya agar konfigurasi sistem tidak mudah dirubah atau diganti pengaturannya oleh pengguna. Dengan adanya jaringan komputer, tentunya pengaturan hak akses tidak perlu dilakukan satu-satu secara manual. Karena dalam suatu jaringan komputer pastinya terdapat banyak kumpulan komputer yang saling terhubung. Sehingga pengaturan hak akses bisa menggunakan sistem aplikasi client-server agar pembatasan hak akses bisa dilakukan dengan efektif. Sebagai implementasi aplikasi client-server dapat dibuat dengan menggunakan bahasa pemrograman Visual Basic 6.0. Bahasa ini sudah bisa mengakses socket pada sistem operasi Windows yang diberi nama Winsock API yang sudah mendukung protokol TCP/IP. Protokol ini banyak dipakai karena kehandalannya dalam pemrograman aplikasi client-server. Aplikasi ini terbagi menjadi dua aplikasi utama, yaitu client dengan nama program Receiver dan Server dengan nama program Sender. Receiver berfungsi menerima instruksi pembatasan hak akses dari Sender dan mengirimkan laporan hasil proses eksekusinya ke Sender. Sedangkan Sender berfungsi untuk mengirim instruksi pembatasan hak akses melalui Registry ke Receiver. Dan setelah di uji, aplikasi ini dapat memblok fitur-fitur penting yang ada di sistem operasi Windows. Sehingga diharapkan dengan adanya aplikasi ini dapat membantu dalam pengaturan hak akses di suatu jaringan komputer. Kata Kunci : Registry, Winsock API, TCP/IP, Soket, Protokol, Jaringan

scholarly journals The 1-way on-line coupled atmospheric chemistry model system MECO(n) – Part 2: On-line coupling with the Multi-Model-Driver (MMD)

2012 ◽  
Vol 5 (1) ◽  
pp. 111-128 ◽  
Author(s):  
A. Kerkweg ◽  
P. Jöckel
Keyword(s):  
Arbitrary Number ◽  
General Circulation ◽  
Message Passing Interface ◽  
Model System ◽  
Limited Area ◽  
Grid Data ◽  
Client Server ◽  
Limited Area Model ◽  
Area Model ◽  
On Line

Abstract. A new, highly flexible model system for the seamless dynamical down-scaling of meteorological and chemical processes from the global to the meso-γ scale is presented. A global model and a cascade of an arbitrary number of limited-area model instances run concurrently in the same parallel environment, in which the coarser grained instances provide the boundary data for the finer grained instances. Thus, disk-space intensive and time consuming intermediate and pre-processing steps are entirely avoided and the time interpolation errors of common off-line nesting approaches are minimised. More specifically, the regional model COSMO of the German Weather Service (DWD) is nested on-line into the atmospheric general circulation model ECHAM5 within the Modular Earth Submodel System (MESSy) framework. ECHAM5 and COSMO have previously been equipped with the MESSy infrastructure, implying that the same process formulations (MESSy submodels) are available for both models. This guarantees the highest degree of achievable consistency, between both, the meteorological and chemical conditions at the domain boundaries of the nested limited-area model, and between the process formulations on all scales. The on-line nesting of the different models is established by a client-server approach with the newly developed Multi-Model-Driver (MMD), an additional component of the MESSy infrastructure. With MMD an arbitrary number of model instances can be run concurrently within the same message passing interface (MPI) environment, the respective coarser model (either global or regional) is the server for the nested finer (regional) client model, i.e. it provides the data required to calculate the initial and boundary fields to the client model. On-line nesting means that the coupled (client-server) models exchange their data via the computer memory, in contrast to the data exchange via files on disk in common off-line nesting approaches. MMD consists of a library (Fortran95 and some parts in C) which is based on the MPI standard and two new MESSy submodels, MMDSERV and MMDCLNT (both Fortran95) for the server and client models, respectively. MMDCLNT contains a further sub-submodel, INT2COSMO, for the interpolation of the coarse grid data provided by the server models (either ECHAM5/MESSy or COSMO/MESSy) to the grid of the respective client model (COSMO/MESSy). INT2COSMO is based on the off-line pre-processing tool INT2LM provided by the DWD. The new achievements allow the setup of model cascades for zooming (down-scaling) from the global scale to the lower edge of the meso-γ scale (≈1 km) with a very high degree of consistency between the different models and between the chemical and meteorological boundary conditions.

scholarly journals Client-server sessions in linear logic

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-31 ◽  
Author(s):  
Zesen Qian ◽  
G. A. Kavvos ◽  
Lars Birkedal
Keyword(s):  
Programming Language ◽  
Functional Programming ◽  
Arbitrary Number ◽  
Single Channel ◽  
Linear Logic ◽  
Client Server ◽  
Structural Rules ◽  
Session Types ◽  
Functional Programming Language

We introduce coexponentials, a new set of modalities for Classical Linear Logic. As duals to exponentials, the coexponentials codify a distributed form of the structural rules of weakening and contraction. This makes them a suitable logical device for encapsulating the pattern of a server receiving requests from an arbitrary number of clients on a single channel. Guided by this intuition we formulate a system of session types based on Classical Linear Logic with coexponentials, which is suited to modelling client-server interactions. We also present a session-typed functional programming language for client-server programming, which we translate to our system of coexponentials.

Sign in / Sign up

Export Citation Format

Share Document