Using induction and rewriting to verify and complete parameterized specifications

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.170, Iss.1, 1996-12, pp. : 245-276

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

Model Checking Complete Requirements Specifications Using Abstraction

By Bharadwaj R.

Automated Software Engineering, Vol. 6, Iss. 1, 1999-01 ,pp. : 37-68

Springer Publishing Company

Access to resources Recommend Favorite

A Formal Model for SDL Specifications Based on Timed Rewriting Logic

By Steggles L.J.

Automated Software Engineering, Vol. 7, Iss. 1, 2000-03 ,pp. : 61-90

Springer Publishing Company

Access to resources Recommend Favorite

On interreduction of semi-complete term rewriting systems

By Gramlich

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 435-451

Elsevier

Access to resources Recommend Favorite

Rewriting Union Queries Using Views

By Wang J. Topor R. Maher M.

Constraints, Vol. 10, Iss. 3, 2005-07 ,pp. : 219-251

Springer Publishing Company

Access to resources Recommend Favorite

Using Isabelle/HOL to Verify First-Order Relativity Theory

By Stannett Mike Németi István

Journal of Automated Reasoning, Vol. 52, Iss. 4, 2014-04 ,pp. : 361-378

Springer Publishing Company

Access to resources Recommend Favorite