Arrow Research search
Back to TCS

TCS 1982

Expressing program looping in regular dynamic logic

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Order Dynamic Logic with or without array assignment instructions in the programs. The expressive power of quantifier-free Dynamic Logic increases when nondeterminism is introduced in the programs that are part of formulae of Dynamic Logic. Allowing assignments of random values to variables also increases expressive power.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
427351471554217260
v2026.09.13