An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations

Author： Gori R.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.290, Iss.1, 2003-01, pp. : 863-936

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

Finite acceptance of infinite words

By Litovsky I. Staiger L.

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 1-21

Elsevier

Access to resources Recommend Favorite

Non-stochastic infinite and finite sequences

By V'yugin V.V.

Theoretical Computer Science, Vol. 207, Iss. 2, 1998-11 ,pp. : 363-382

Elsevier

Access to resources Recommend Favorite

Complexity for finite factors of infinite sequences

By Ferenczi S. Kasa Z.

Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. : 177-195

Elsevier

Access to resources Recommend Favorite

Finite and infinite pseudorandom binary words

By Mauduit C.

Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. : 249-261

Elsevier

Access to resources Recommend Favorite

Unified framework for finite element assembly

By Alnaes M.S. Logg A. Mardal K-A. Skavhaug O. Langtangen H.P.

International Journal of Computational Science and Engineering, Vol. 4, Iss. 4, 2009-11 ,pp. : 231-244

Inderscience Publishers

Access to resources Recommend Favorite