Non-Deterministic Program Schemata and Their Relation to Dynamic Logic

V. A. Nepomniaschy and N. V. Shilov
Additional contact information
V. A. Nepomniaschy: Siberian Division of USSR Academy of Sciences, Computing Center
N. V. Shilov: Siberian Division of USSR Academy of Sciences, Computing Center

A chapter in Mathematical Logic and Its Applications, 1987, pp 137-147 from Springer

Abstract: Abstract Program schemata [1,2] theory is a branch of theoretical computer science which deals with properties of programs with non-interpreted functional and predicate symbols. Because of decidability of main properties (equivalence, halting and so on), a special place in this theory belongs to so-called Janov schemes [1], e.g., a complete system of equivalent transformations for Janov schemes in Algol-like syntax was developed by A. P. Ershov [2].

Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().