On the public citation graph
An efficient and unified approach to the decidability of equivalence of propositional programs
0 signed · 29 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12689-9_104openalex-snapshot
Propositional dynamic logic of flowcharts
inferredcites →https://doi.org/10.1007/3-540-63165-8_221openalex-snapshot
The equivalence problem for deterministic pushdown automata is decidable
inferredcites →https://doi.org/10.1007/978-1-4615-9050-7_1openalex-snapshot
Theory of Algorithms and Discrete Processors
inferredcites →https://doi.org/10.1016/0304-3975(90)90201-ropenalex-snapshot
An algorithm deciding functional equivalence in a new class of program schemes
inferredcites →https://doi.org/10.1016/0304-3975(91)90356-7openalex-snapshot
The equivalence problem of multitape finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(74)90839-0openalex-snapshot
The equivalence problem for deterministic finite-turn pushdown automata
inferredcites →https://doi.org/10.1016/s0022-0000(70)80022-8openalex-snapshot
On formalised computer programs
inferredcites →https://doi.org/10.1016/s0022-0000(75)80005-5openalex-snapshot
Deterministic one-counter automata
inferredcites →https://doi.org/10.1145/3149.3157openalex-snapshot
Decidable problems for powerful programs
inferredcites →https://doi.org/10.1145/321765.321780openalex-snapshot
Decidable Properties of Monadic Functional Schemas
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.1145/322261.322270openalex-snapshot
The Complexity of the Equivalence Problem for Simple Programs
inferredcites →https://doi.org/10.1145/800235.807074openalex-snapshot
Decision problems in computational models
inferredcites →https://doi.org/10.1145/942578.807074openalex-snapshot
Decision problems in computational models
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.82444/warw.33595291openalex-snapshot
Decision procedures for families of deterministic pushdown automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_8openalex-snapshot
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_2openalex-snapshot
A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_19openalex-snapshot
Equivalence Checking Problem for Finite State Transducers over Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_27openalex-snapshot
On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata
inferred← citeshttps://doi.org/10.1007/s10559-010-9232-zopenalex-snapshot
Program equivalence checking by two-tape automata
inferred← citeshttps://doi.org/10.1007/s10958-011-0216-yopenalex-snapshot
Using algebraic models of programs for detecting metamorphic malwares
inferred← citeshttps://doi.org/10.1023/a:1009954232570openalex-snapshot
On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs
inferred← citeshttps://doi.org/10.1134/s036176881604006xopenalex-snapshot
Program schemata technique for propositional program logics: A 30-year history
inferred← citeshttps://doi.org/10.15514/ispras-2014-26(3)-8openalex-snapshot
A polynomial algorithm for checking the equivalence in models of programs with commutation and vast operators
inferred← citeshttps://doi.org/10.3233/fi-2016-1410openalex-snapshot
An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
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.