Author： Codish M. Mashevitzky G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.165, Iss.1, 1996-09, pp. : 57-74
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Proving linearizability with temporal logic
Formal Aspects of Computing, Vol. 23, Iss. 1, 2011-01 ,pp. :
Theorem proving by chain resolution
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :
By Dowek Gilles Hardin Thérèse Kirchner Claude
Journal of Automated Reasoning, Vol. 31, Iss. 1, 2003-09 ,pp. :
Proving nonreachability by modulo-invariants
By Desel J. Neuendorf K.-P. Radola M.-D.
Theoretical Computer Science, Vol. 153, Iss. 1, 1996-01 ,pp. :