Simplification of boolean verification conditions

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.239, Iss.1, 2000-05, pp. : 165-185

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Verification conditions are code

By Gravell Andrew

Acta Informatica, Vol. 43, Iss. 6, 2007-01 ,pp. : 431-447

Springer Publishing Company

Access to resources Recommend Favorite

Approximated parameterized verification of infinite-state processes with global conditions

By Abdulla Parosh Delzanno Giorgio Rezine Ahmed

Formal Methods in System Design, Vol. 34, Iss. 2, 2009-04 ,pp. : 126-156

Springer Publishing Company

Access to resources Recommend Favorite

On boolean lowness and boolean highness

By Reith S. Wagner K.W.

Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. : 305-321

Elsevier

Access to resources Recommend Favorite

Situated simplification

By Podelski A. Smolka G.

Theoretical Computer Science, Vol. 173, Iss. 1, 1997-02 ,pp. : 235-252

Elsevier

Access to resources Recommend Favorite

E-Government for Simplification

SourceOECD Science & Information Technology, Vol. 2008, Iss. 9, 2008-12 ,pp. : 130-147

OECD Publishing

Access to resources Recommend Favorite