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

Ran Chen 1 Martin Clochard 2, 3 Claude Marché 2
2 TOCCATA - Certified Programs, Certified Tools, Certified Floating-Point Computations
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

Contributor : Claude Marché <>
Submitted on : Thursday, November 30, 2017 - 7:39:14 AM
Last modification on : Thursday, April 5, 2018 - 12:30:22 PM


Files produced by the author(s)


  • HAL Id : hal-01652148, version 1


Ran Chen, Martin Clochard, Claude Marché. A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links. Journal of Formalized Reasoning, ASDD-AlmaDL, 2017, 10 (1). 〈hal-01652148〉



Record views


Files downloads