![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
A Lightweight Mutual Authentication Protocol for the IoT
The Internet of Things enables the interconnection of smart physical and virtual objects, managed by highly developed technologies. WSN, is an essential part of this paradigm. The WSN uses smart, autonomous an...
-
Chapter
Mobility Support and Service Discovery for Industrial Process Monitoring
A service-oriented architecture designed for the use of wireless sensors networks (WSN) in industrial applications such as the operation and maintenance of industrial installations is presented in this chapter...
-
Chapter and Conference Paper
Routing in OPC-UA with Rosa Overlay Network
We present a new Transport mechanism for the OPC-UA middleware. This mechanism, based on an overlay network, allows to find a new route for OPC-UA packets in case of routing failure.
-
Article
Advances in information and knowledge systems
-
Chapter and Conference Paper
Towards the World-Wide Quantum Network
QKD networks are of much interest due to their capacity of providing extremely high security keys to network participants. Most QKD network studies so far focus on trusted models where all the network nodes ar...
-
Chapter
On the security of quantum networks: a proposal framework and its capacity
In large Quantum Key Distribution (QKD)-based networks, intermediate nodes are necessary because of the short length of QKD links. They have tendency to be used more than classical networks. A realistic assump...
-
Chapter and Conference Paper
Logical Synthesis of Imperative O.O. Programs
The Ω logic, is designed to specify, to reason about and to synthesize imperative programs in an object oriented language, namely C++. There exists a lot of systems where computing-by-proof is possible but the...
-
Chapter and Conference Paper
Functions and relations: The graal system
-
Chapter and Conference Paper
Uniformly applicative structures, a theory of computability and polyadic functions
This article describes a Computability theory developed from the theory of URS described by E.G. Wagner and H.R. Strong and a Combinatory theory named TGE presented by the authors. Its main contribution is tha...
-
Chapter and Conference Paper
A theory for natural modelisation and implementation of functions with variable arity
The aim of this article is to provide a new theorical framework based on combinators for the study and implementation of applicative programming languages. This formal theory can be viewed as a Computability t...
-
Chapter and Conference Paper
Graal : A Functional Programming system with uncurryfied combinators and its reduction machine
This work presents a new programming language issued from Functional Programming systems of J.W. Backus. GRAAL is a functional programming language without variables. The basic tools provided for expressing fu...
-
Chapter and Conference Paper
High order programming in extended FP
-
Chapter and Conference Paper
Semantiques comparees des systemes de programmation fonctionnelle FP et FFP de J.W. Backus