A symbolic semantics for abstract model checking

Francesca Levi
2001 Science of Computer Programming  
In this paper we present a symbolic semantics of value-passing concurrent processes where classical branching is replaced by separate relations of non-deterministic branch and alternative choice. The obtained symbolic graph is ÿnite for regular processes and can suitably be interpreted over abstract values to e ectively compute a safe abstract model for full -calculus model checking. The representation of non-determinism and alternative choice in symbolic transitions allows to achieve more precise approximations of the two dual next modalities.
doi:10.1016/s0167-6423(00)00015-0 fatcat:wrxa2fufpfhuxp7ahsun6bpy5u