2005/05/10 by Riccardo Pucella
Computer Science · #cs.LO
published as SIGACT News, 36(2), pp. 77-88, 2005 · 11 pages
arxiv created 2005/05/10 · arxiv updated 2009/12/01
This article examines two approaches to verification, one based on using a logic for expressing properties of a system, and one based on showing the system equivalent to a simpler system that obviously has whatever property is of interest. Using examples such as process calculi and regular programs, the relationship between these two approaches is explored.