A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Formalized Reasoning Year : 2017

A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links

Abstract

In the context of file systems like those of Unix, path resolution is the operation that given a character string denoting an access path, determines the target object (a file, a directory, etc.) designated by this path. This operation is not trivial because of the presence of symbolic links. Indeed, the presence of such links may induce infinite loops in the resolution process. We consider a path resolution algorithm that always terminates, detecting if it enters an infinite loop and reports a resolution failure in such a case. We propose a formal specification of path resolution and we formally prove that our algorithm terminates on any input, and is correct and complete with respect to our formal specification.
Fichier principal
Vignette du fichier
jfr7213.pdf (305.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01652148 , version 1 (30-11-2017)

Identifiers

  • HAL Id : hal-01652148 , version 1

Cite

Ran Chen, Martin Clochard, Claude Marché. A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links. Journal of Formalized Reasoning, 2017, 10 (1). ⟨hal-01652148⟩
168 View
122 Download

Share

Gmail Facebook X LinkedIn More