How to verify Hamilton-Path in log-space?

Given an undirected graph $ G$ and an undirected path $ p$ , Is it possible to verify $ p$ is a Hamilton path in graph $ G$ using logarithmic space? How is it possible to verify the path goes through all vertices without somehow save which one had been already checked?