Cyber & formal methods publications

Details of the Advanced Riometer Components (ARCOM) component-based software architecture are presented.

This article is a retrospective of concepts and people who have contributed significantly to the IEEE Symposium on Security and Privacy over the past 30 years.

A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed.

In this paper we analyze the special case of context unification where the use of at most one context variable is allowed and show that it is in NP.

We use a mechanically checked proof of the Knaster–Tarski theorem to illustrate several features of the Prototype Verification System (PVS).

We pursue a declarative approach to provide an abstraction from the high complexity of NCPS and avoid error-prone and time-consuming low-level programming.

In this paper, we present the formal verification of the compression function which is a core element of the clock synchronization service of TTEthernet.

In this paper we introduce a method to compute all pathways in a signalling network that satisfy a simple property constraining initial, final and intermediate states.

We are developing a completely decentralized system with each computer maintaining the authoritative repository of the provenance gathered on it.

The principle underlying the card trick can be proved in a number of ways. We present the argument as a series of transformations that demystify the trick and describe its…

In this paper, we discuss the evolution of user space file systems with an emphasis on FUSE, and measure its performance using a variety of test cases.

We describe Mendel, a protocol with a three-pronged strategy that combines eager signature verification, lazy trust establishment, and cryptographic ordering witnesses to yield fast lineage verification in distributed multi-domain environments.