On the public citation graph

Theory of Program Structures: Schemes, Semantics, Verification

https://doi.org/10.1007/bfb0023017
0 signed · 148 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380200107openalex-snapshot
A case study comparison of four declarative programming languages
inferred← citeshttps://doi.org/10.1006/inco.1996.0012openalex-snapshot
On Schematological Equivalence of Dataflow Networks
inferred← citeshttps://doi.org/10.1006/inco.1997.2658openalex-snapshot
On Schematological Equivalence of Partially Interpreted Dataflow Networks
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_198openalex-snapshot
Schemes with recursion on higher types
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_43openalex-snapshot
On the definition of classes of interpretations
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_17openalex-snapshot
The complexity of equivalence and containment for free single variable program schemes
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_19openalex-snapshot
Semantics and correctness of nondeterministic flowchart programs with recursive procedures
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_1openalex-snapshot
Context-free sets of infinite words
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_33openalex-snapshot
The vienna development method (VDM)
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_64openalex-snapshot
Derivations et reductions dans les grammaires algebrioues
inferred← citeshttps://doi.org/10.1007/3-540-10693-6openalex-snapshot
The Programming Language Ada Reference Manual
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_29openalex-snapshot
Algebraically specified programming systems and Hoare's logic
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_96openalex-snapshot
Partial interpretations of program schemata
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_7openalex-snapshot
A survey of the logic of effective definitions
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_128openalex-snapshot
Economy of description for program schemes extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_360openalex-snapshot
Characterization of acceptable by algol-like programming languages
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_47openalex-snapshot
Optimal run time optimization proved by a new look at abstract interpretations
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_5openalex-snapshot
Die Korrektheit von Algorithmen
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_23openalex-snapshot
Verification of Data-Insensitive Circuits: An In-Order-Retirement Case Study
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_16openalex-snapshot
Algol-like languages with higher-order procedures and their expressive power
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_9openalex-snapshot
Space considerations in Prolog
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_51openalex-snapshot
On abstraction and the expressive power of programming languages
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_66openalex-snapshot
First order data types and first order logic
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_6openalex-snapshot
Theory of computation over stream algebras, and its applications
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_33openalex-snapshot
Space usage in functional query languages
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_15openalex-snapshot
On the power of recursion in dataflow Schemes
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_14openalex-snapshot
Principled strength reduction
inferred← citeshttps://doi.org/10.1007/978-1-4757-3573-4_12openalex-snapshot
A recovery model for cooperative computations
inferred← citeshttps://doi.org/10.1007/978-3-322-96753-4_3openalex-snapshot
Three Simple Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-322-96753-4_7openalex-snapshot
The Classical Methods of Floyd
inferred← citeshttps://doi.org/10.1007/978-3-642-27266-0_5openalex-snapshot
The Correctness of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-66635-3_4openalex-snapshot
Eigenschaften der Prädikatenlogik
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_1openalex-snapshot
Theory of Computation and Specification over Abstract Data Types, and its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_10openalex-snapshot
Computable Functions on Stream Algebras
inferred← citeshttps://doi.org/10.1007/978-3-7091-0794-2_11openalex-snapshot
Sound and Complete Verification Condition Generator for Functional Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-88-470-0580-8_18openalex-snapshot
Note bibliografiche
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bf00263196openalex-snapshot
On the complexity of some problems concerning the use of procedures. I.
inferred← citeshttps://doi.org/10.1007/bf00264163openalex-snapshot
Complexity theory and the operational structure of algebraic programming systems
inferred← citeshttps://doi.org/10.1007/bf00289071openalex-snapshot
Extended linear macro grammars, iteration grammars, and register programs
inferred← citeshttps://doi.org/10.1007/bf00289151openalex-snapshot
Ianov pushdown schemes are contained in boolean recursive schemes
inferred← citeshttps://doi.org/10.1007/bf01019943openalex-snapshot
Recursion from iteration
inferred← citeshttps://doi.org/10.1007/bf01085188openalex-snapshot
Methods and means of parallel processing of information
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01931229openalex-snapshot
An analysis of the effect of rounding errors on the flow of control in numerical processes
inferred← citeshttps://doi.org/10.1007/bfb0017486openalex-snapshot
On the first-order equivalence of call-by-name and call-by-value
inferred← citeshttps://doi.org/10.1007/bfb0022509openalex-snapshot
On and/or schemes
inferred← citeshttps://doi.org/10.1007/bfb0025772openalex-snapshot
The refinement of specifications and the stability of Hoare's Logic
inferred← citeshttps://doi.org/10.1007/bfb0025787openalex-snapshot
A note on equivalences among logics of programs
inferred← citeshttps://doi.org/10.1007/bfb0058023openalex-snapshot
Recursion versus iteration at higher-orders
inferred← citeshttps://doi.org/10.1007/s00224-016-9673-5openalex-snapshot
A Difference in Complexity Between Recursion and Tail Recursion
inferred← citeshttps://doi.org/10.1007/s00236-007-0040-5openalex-snapshot
Decision problems for pushdown threads
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90118-6openalex-snapshot
Deciding freeness for program schemes with a single unary function
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90095-3openalex-snapshot
Two theorems about the completeness of Hoare's logic
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90090-0openalex-snapshot
The unwind property for programs with bounded memory
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90131-1openalex-snapshot
On the detection of unstructuredness in flowgraphs
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90034-5openalex-snapshot
Monadic recursion schemes: The effect of constants
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90036-9openalex-snapshot
Modifications of the program scheme model
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90044-6openalex-snapshot
The equivalence of R.E. program schemes and data flow schemes
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90006-4openalex-snapshot
Recursion-closed algebraic theories
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90013-7openalex-snapshot
Expressiveness and the completeness of Hoare's logic
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90050-8openalex-snapshot
Deterministic and nondeterministic flowchart interpretations
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90027-8openalex-snapshot
Equivalences among logics of programs
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90008-0openalex-snapshot
Succinct representation of regular sets using gotos and boolean variables
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90011-0openalex-snapshot
On flowchart theories Part I. The deterministic case
inferred← citeshttps://doi.org/10.1016/0165-6074(90)90238-5openalex-snapshot
Towards the verification of optimizing transformations for imperative programs
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90004-9openalex-snapshot
On abstraction and the expressive power of programming languages
inferred← citeshttps://doi.org/10.1016/0167-8191(88)90095-6openalex-snapshot
The instruction systolic array and its relation to other models of parallel computers
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90039-6openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: semantics and correctness I
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90001-9openalex-snapshot
Floyd's principle, correctness theories and program equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90027-5openalex-snapshot
Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programs
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90071-8openalex-snapshot
Expressing program looping in regular dynamic logic
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90097-xopenalex-snapshot
The propositional dynamic logic of deterministic, well-structured programs
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90107-xopenalex-snapshot
Hoare's logic and Peano's arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90088-4openalex-snapshot
Expressive power of typed and type-free programming languages
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90125-8openalex-snapshot
Continuation semantics for flowgraph equations
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90088-0openalex-snapshot
Concurrent program schemes and their logics
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90002-8openalex-snapshot
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.08.003openalex-snapshot
Recursion versus tail recursion over F¯p
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.07.002openalex-snapshot
Normal design algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.08.001openalex-snapshot
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.009openalex-snapshot
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.001openalex-snapshot
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80020-0openalex-snapshot
Unbounded program memory adds to the expressive power of first-order programming logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71253-9openalex-snapshot
The Role of Finite Automata in the Development of Modern Computing Theory*
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73080-9openalex-snapshot
Descriptional Complexity for Classes of Ianov-Schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00374-2openalex-snapshot
Equivalence of conservative, free, linear program schemas is decidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(81)80001-1openalex-snapshot
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00168-5openalex-snapshot
Program schemata vs. automata for decidability of program logics
inferred← citeshttps://doi.org/10.1016/s0895-7177(97)00024-1openalex-snapshot
A formal specification of document processing
inferred← citeshttps://doi.org/10.1017/9781108234238openalex-snapshot
Abstract Recursion and Intrinsic Complexity
inferred← citeshttps://doi.org/10.1017/9781108234238.001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/9781108234238.002openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1017/9781108234238.003openalex-snapshot
Recursive (McCarthy) programs
inferred← citeshttps://doi.org/10.1017/9781108234238.004openalex-snapshot
Complexity theory for recursive programs
inferred← citeshttps://doi.org/10.1017/9781108234238.005openalex-snapshot
The homomorphism method
inferred← citeshttps://doi.org/10.1017/9781108234238.006openalex-snapshot
Lower bounds from Presburger primitives
inferred← citeshttps://doi.org/10.1017/9781108234238.007openalex-snapshot
Lower bounds from division with remainder
inferred← citeshttps://doi.org/10.1017/9781108234238.008openalex-snapshot
Lower bounds from division and multiplication
inferred← citeshttps://doi.org/10.1017/9781108234238.009openalex-snapshot
Non-uniform complexity in N
inferred← citeshttps://doi.org/10.1017/9781108234238.010openalex-snapshot
Polynomial nullity (0-testing)
inferred← citeshttps://doi.org/10.1017/9781108234238.011openalex-snapshot
Symbol index
inferred← citeshttps://doi.org/10.1017/9781108234238.012openalex-snapshot
General index
inferred← citeshttps://doi.org/10.1017/s0022481200041086openalex-snapshot
The formal language of recursion
inferred← citeshttps://doi.org/10.1017/s0960129511000223openalex-snapshot
On the computational complexity of dynamic slicing problems for program schemas
inferred← citeshttps://doi.org/10.1051/ita/1977110201331openalex-snapshot
Les tests et leur caractérisation syntaxique
inferred← citeshttps://doi.org/10.1051/ita/1981150100671openalex-snapshot
A theory of complexity of monadic recursion schemes
inferred← citeshttps://doi.org/10.1070/rm1989v044n01abeh002007openalex-snapshot
Some open questions in the theory of program schemes and dynamic logics
inferred← citeshttps://doi.org/10.1080/00207168908803717openalex-snapshot
Controlled bidirectional grammars
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198759591.003.0002openalex-snapshot
Algorithms and the Mathematical Foundations of Computer Science
inferred← citeshttps://doi.org/10.1093/comjnl/bxh121openalex-snapshot
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas
inferred← citeshttps://doi.org/10.1109/32.58784openalex-snapshot
A formal model of program dependences and its implications for software testing, debugging, and maintenance
inferred← citeshttps://doi.org/10.1109/dac.1985.1585984openalex-snapshot
Synthesis Techniques for Digital Systems Design
inferred← citeshttps://doi.org/10.1109/ftdcs.1995.525003openalex-snapshot
How to commit concurrent, non-isolated computations
inferred← citeshttps://doi.org/10.1109/sfcs.1979.38openalex-snapshot
Semantics of probabilistic programs
inferred← citeshttps://doi.org/10.1109/sfcs.1980.45openalex-snapshot
The complexity of recursion schemes and recursive programming languages
inferred← citeshttps://doi.org/10.1109/sfcs.1981.49openalex-snapshot
The prepositional dynamic logic of deterministic, well-structured programs
inferred← citeshttps://doi.org/10.1109/tse.1978.231499openalex-snapshot
The Logic of Computer Programming
inferred← citeshttps://doi.org/10.1137/0208047openalex-snapshot
Translatability and Decidability Questions for Restricted Classes of Program Schemas
inferred← citeshttps://doi.org/10.1137/0215059openalex-snapshot
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
inferred← citeshttps://doi.org/10.1145/1008902.1008904openalex-snapshot
On teaching theoretical foundations of Computer Science
inferred← citeshttps://doi.org/10.1145/2159531.2159537openalex-snapshot
Complexity of Data Dependence Problems for Program Schemas with Concurrency
inferred← citeshttps://doi.org/10.1145/2187671.2187674openalex-snapshot
A vocabulary of program slicing-based techniques
inferred← citeshttps://doi.org/10.1145/2543581.2543588openalex-snapshot
Synchronous digital circuits as functional programs
inferred← citeshttps://doi.org/10.1145/298514.298538openalex-snapshot
Method schemas
inferred← citeshttps://doi.org/10.1145/322290.322304openalex-snapshot
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
inferred← citeshttps://doi.org/10.1145/328690.328700openalex-snapshot
From recursion to iteration
inferred← citeshttps://doi.org/10.1145/328691.328700openalex-snapshot
From recursion to iteration
inferred← citeshttps://doi.org/10.1145/358886.358892openalex-snapshot
On folk theorems
inferred← citeshttps://doi.org/10.1145/512760.512779openalex-snapshot
Almost control-free (indeterministic) parallel computation on permit schemes
inferred← citeshttps://doi.org/10.1145/567446.567453openalex-snapshot
Synchronous schemes and their decision problems
inferred← citeshttps://doi.org/10.1145/62.2737openalex-snapshot
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
inferred← citeshttps://doi.org/10.1145/75308.75328openalex-snapshot
The implications of program dependencies for software testing, debugging, and maintenance
inferred← citeshttps://doi.org/10.1145/76359.76366openalex-snapshot
Passes, sweeps, and visits in attribute grammars
inferred← citeshttps://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferred← citeshttps://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferred← citeshttps://doi.org/10.18255/1818-1015-2018-5-549-560openalex-snapshot
Etude on Recursion Elimination
inferred← citeshttps://doi.org/10.2478/lf-2018-0005openalex-snapshot
Representational Systems in Zoosemiotics and Anthroposemiotics Part I
inferred← citeshttps://doi.org/10.31144/bncc.cs.2542-1972.2012.n34.p135-155openalex-snapshot
UNIFYING DYNAMIC PROGRAMMING DESIGN PATTERNS
inferred← citeshttps://doi.org/10.3990/1.9789090036205openalex-snapshot
Controlled bidirectional grammars
inferred← citeshttps://doi.org/10.4204/eptcs.320.5openalex-snapshot
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
inferred← citeshttps://doi.org/10.48550/arxiv.1912.11281openalex-snapshot
Aggressive Aggregation: a New Paradigm for Program Optimization
inferred← citeshttps://doi.org/10.5555/317825.317931openalex-snapshot
Synthesis Techniques for Digital Systems Design
inferred← citeshttps://doi.org/10.7282/t34m9501openalex-snapshot
What algorithms could not be
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.