244,523 research outputs found
Language-Based Verification Will Change The World
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We explain how language-based approaches based on so-called dependent types are already being adopted in functional programming languages, and why such methods will be successful for mainstream use, where traditional formal methods have failed
Overview on agent-based social modelling and the use of formal languages
Transdisciplinary Models and Applications investigates a variety of programming languages used in validating and verifying models in order to assist in their eventual implementation. This book will explore different methods of evaluating and formalizing simulation models, enabling computer and industrial engineers, mathematicians, and students working with computer simulations to thoroughly understand the progression from simulation to product, improving the overall effectiveness of modeling systems.Postprint (author's final draft
Two Reformulations of the Verificationist Thesis in Epistemic Temporal Logic that Avoid Fitch’s Paradox
1) We will begin by offering a short introduction to Epistemic Logic
and presenting Fitch’s paradox in an epistemic‑modal logic. (2) Then, we will
proceed to presenting three Epistemic Temporal logical frameworks creat‑
ed by Hoshi (2009) : TPAL (Temporal Public Announcement Logic), TAPAL
(Temporal Arbitrary Public Announcement Logic) and TPAL+P ! (Temporal
Public Announcement Logic with Labeled Past Operators). We will show how
Hoshi stated the Verificationist Thesis in the language of TAPAL and analyze
his argument on why this version of it is immune from paradox. (3) Edgington
(1985) offered an interpretation of the Verificationist Thesis that blocks Fitch’s
paradox and we will propose a way to formulate it in a TAPAL‑based lan‑
guage. The language we will use is a combination of TAPAL and TPAL+P ! with
an Indefinite (Unlabeled) Past Operator (TAPAL+P !+P). Using indexed satisfi‑
ability relations (as introduced in (Wang 2010 ; 2011)) we will offer a prospec ‑
tive semantics for this language. We will investigate whether the tentative re‑
formulation of Edgington’s Verificationist Thesis in TAPAL+P !+P is free from
paradox and adequate to Edgington’s ideas on how „all truths are knowable“
should be interpreted
Towards formal models and languages for verifiable Multi-Robot Systems
Incorrect operations of a Multi-Robot System (MRS) may not only lead to
unsatisfactory results, but can also cause economic losses and threats to
safety. These threats may not always be apparent, since they may arise as
unforeseen consequences of the interactions between elements of the system.
This call for tools and techniques that can help in providing guarantees about
MRSs behaviour. We think that, whenever possible, these guarantees should be
backed up by formal proofs to complement traditional approaches based on
testing and simulation.
We believe that tailored linguistic support to specify MRSs is a major step
towards this goal. In particular, reducing the gap between typical features of
an MRS and the level of abstraction of the linguistic primitives would simplify
both the specification of these systems and the verification of their
properties. In this work, we review different agent-oriented languages and
their features; we then consider a selection of case studies of interest and
implement them useing the surveyed languages. We also evaluate and compare
effectiveness of the proposed solution, considering, in particular, easiness of
expressing non-trivial behaviour.Comment: Changed formattin
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. 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 from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
- …