AbstractWe give a calculus for nondeterministic flowchart schemes similar to the calculus of polynomials. It uses a formal representation of flowchart schemes and a natural equivalence on these formal representations. The algebraic structure involved is a matrix theory endowed with an axiomatized repetition
In this paper we give new characterizations for the flowchartability of recursive functionals. Here ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
A “while program” [Z. Manna, “Introduction to Mathematical Theory of Computations,” to appear] is a ...
AbstractWe give a calculus for nondeterministic flowchart schemes similar to the calculus of polynom...
AbstractWe give a calculus for the classes of deterministic flowchart schemes with respect to the st...
AbstractAn abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart ...
AbstractIn this paper, we study some aspects of the semantics of nondeterministic flowchart programs...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
AbstractThe paper concerns the relationship between graph theoretic and algebraic properties of stru...
AbstractIn the second part of this work, we formulate a new inductive assertion method applying to t...
Based on the algebraic characterization of reducible graphical flowcharts, recursive flowchart schem...
The ability of flow-chart programs to define relations and functions nondefinable by open first-orde...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
AbstractThe syntax of a systolic system is given by a systolic flowchart scheme. Systolic schemes di...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
In this paper we give new characterizations for the flowchartability of recursive functionals. Here ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
A “while program” [Z. Manna, “Introduction to Mathematical Theory of Computations,” to appear] is a ...
AbstractWe give a calculus for nondeterministic flowchart schemes similar to the calculus of polynom...
AbstractWe give a calculus for the classes of deterministic flowchart schemes with respect to the st...
AbstractAn abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart ...
AbstractIn this paper, we study some aspects of the semantics of nondeterministic flowchart programs...
AbstractReducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized...
AbstractThe paper concerns the relationship between graph theoretic and algebraic properties of stru...
AbstractIn the second part of this work, we formulate a new inductive assertion method applying to t...
Based on the algebraic characterization of reducible graphical flowcharts, recursive flowchart schem...
The ability of flow-chart programs to define relations and functions nondefinable by open first-orde...
AbstractA “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its...
AbstractThe syntax of a systolic system is given by a systolic flowchart scheme. Systolic schemes di...
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nonde...
In this paper we give new characterizations for the flowchartability of recursive functionals. Here ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
A “while program” [Z. Manna, “Introduction to Mathematical Theory of Computations,” to appear] is a ...
DOI
Add to ORKG