Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, declarative networking serves as an important step towards an extensible, evolvable network architecture that can support flexible, secure and efficient deployment of new network protocols. This book provides an introduction to basic issues in declarative networking, including language design, optimization and dataflow execution. The methodology behind declarative programming of networks is presented, including roots in Datalog, extensions for networked environments, and the semantics of long-running queries over network state. The book focuses on a representative declarative networking language called Network Datalog (NDlog), which is based on extensions to the Datalog recursive query language. An overview of declarative network protocols written in NDlog is provided, and its usage is illustrated using examples from routing protocols and overlay networks. This book also describes the implementation of a declarative networking engine and NDlog execution strategies that provide eventual consistency semantics with significant flexibility in execution. Two representative declarative networking systems (P2 and its successor RapidNet) are presented. Finally, the book highlights recent advances in declarative networking, and new declarative approaches to related problems. Table of Contents: Introduction / Declarative Networking Language / Declarative Networking Overview / Distributed Recursive Query Processing / Declarative Routing / Declarative Overlays / Optimization of NDlog / Recent Advances in Declarative Networking / Conclusion

This Festschrift was published in honor of Andre Scedrov on the occasion of his 65th birthday. The 11 technical papers and 3 short papers included in this volume show the many transformative discoveries made by Andre Scedrov in the areas of linear logic and structural proof theory; formal reasoning for networked systems; and foundations of information security emphasizing cryptographic protocols. These papers are authored by researchers around the world, including North America, Russia, Europe, and Japan, that have been directly or indirectly impacted by Andre Scedrov. The chapter "A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems" is available open access under a CC BY 4.0 license at link.springer.com.

In recent years, we have witnessed a revival of the use of recursive queries in a variety of emerging application domains such as data integration and exchange, information extraction, networking, and program analysis. A popular language used for expressing these queries is Datalog. Datalog and Recursive Query Processing surveys for a general audience the Datalog language, recursive query processing, and optimization techniques. It differs from prior surveys written in the eighties and nineties in its comprehensiveness of topics, its coverage of recent developments and applications, and its emphasis on features and techniques beyond ""classical"" Datalog which are vital for practical applications. Specifically, the topics covered include the core Datalog language and various extensions, semantics, query optimizations, magic-sets optimizations, incremental view maintenance, aggregates, negation, and types. It concludes with a survey of recent systems and applications that use Datalog and recursive queries. Datalog and Recursive Query Processing provides an accessible and gentle introduction to Datalog and recursive query processing to readers with some basic background in databases (in particular, SQL and the relational model).