✦ LIBER ✦

An algorithm for finding invariant relations in programs

✍ Scribed by S. L. Krivoi

Publisher: Springer US
Year: 1982
Tongue: English
Weight: 779 KB
Volume: 17
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068775

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithm to find invariant linear inequ

Algorithm to find invariant linear inequality constraints in programs

✍ S. G. Raksha 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 715 KB

An Algorithm for Finding Recurrence Rela

An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity

✍ Nobuki Takayama 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.

Generalizations of algorithms that find

Generalizations of algorithms that find invariant relationships in programs over algebra of terms

✍ S. L. Krivoi 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 644 KB

An algorithm for finding closed curves

✍ Ming Xie; Monique Thonnat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 900 KB

An algorithm for finding homogeneous pai

An algorithm for finding homogeneous pairs

✍ Hazel Everett; Sulamita Klein; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An algorithm for generalized fractional

An algorithm for generalized fractional programs

✍ J. P. Crouzeix; J. A. Ferland; S. Schaible 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 702 KB