On the public citation graph
Application of modal logic to programming
0 signed · 81 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.1002/malq.19630090502openalex-snapshot
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
inferredcites →https://doi.org/10.1007/3-540-08342-1_22openalex-snapshot
On the proper treatment or referencing, dereferencing and assignment
inferredcites →https://doi.org/10.1007/3-540-08353-7openalex-snapshot
Mathematical Foundations of Computer Science 1977
inferredcites →https://doi.org/10.1007/3-540-08353-7_149openalex-snapshot
The expressive power of intensional logic in the semantics of programming languages
inferredcites →https://doi.org/10.1007/3-540-08921-7_52openalex-snapshot
The connection between modal logic and algorithmic logics
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/tse.1975.6312858openalex-snapshot
Strong verification of programs
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/359636.359715openalex-snapshot
Lucid, a nonprocedural language with iteration
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferredcites →https://doi.org/10.1145/800105.803416openalex-snapshot
Computability and completeness in logics of programs (Preliminary Report)
inferredcites →https://doi.org/10.1145/800105.803417openalex-snapshot
On the theory of programming logics
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.1145/800113.803635openalex-snapshot
A new incompleteness result for Hoare's system
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferredcites →https://doi.org/10.2307/2273958openalex-snapshot
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs.…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19840303102openalex-snapshot
STRUCTURED NONSTANDARD DYNAMIC LOGIC
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_82openalex-snapshot
A characterization of Floyd-provable programs
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_18openalex-snapshot
Programming languages and logics of programs
inferred← citeshttps://doi.org/10.1007/978-3-031-08597-0_1openalex-snapshot
Epistemic Proceduralism Stated
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_28openalex-snapshot
Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_1openalex-snapshot
Model Construction for Modal Clauses
inferred← citeshttps://doi.org/10.1007/978-3-319-58507-9_5openalex-snapshot
A Logic for Human Actions
inferred← citeshttps://doi.org/10.1007/978-3-540-88625-9_27openalex-snapshot
Specification of Electronic Voting Protocol Properties Using ADM Logic: FOO Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_51openalex-snapshot
Does Treewidth Help in Modal Satisfiability?
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_8openalex-snapshot
Some Lectures on Modal Logic
inferred← citeshttps://doi.org/10.1007/bf00136122openalex-snapshot
Towards an exact philosophy of action
inferred← citeshttps://doi.org/10.1007/bf00370685openalex-snapshot
Dynamic algebras: Examples, constructions, applications
inferred← citeshttps://doi.org/10.1007/bf00935602openalex-snapshot
Kripke semantics for knowledge representation logics
inferred← citeshttps://doi.org/10.1007/bf01028968openalex-snapshot
Getting started: Beginnings in the logic of action
inferred← citeshttps://doi.org/10.1007/bf02576358openalex-snapshot
Hierarchical development of programming languages
inferred← citeshttps://doi.org/10.1007/bfb0031922openalex-snapshot
Actions with preconditions and postconditions
inferred← citeshttps://doi.org/10.1007/s10817-018-09503-xopenalex-snapshot
A Resolution-Based Theorem Prover for $${\textsf {K}}_{n}^{}$$Kn: Architecture, Refinements, Strategies and Experiments
inferred← citeshttps://doi.org/10.1007/s10992-014-9333-7openalex-snapshot
On Qualitative Route Descriptions
inferred← citeshttps://doi.org/10.1007/s11225-012-9416-9openalex-snapshot
Dual Choice and Iteration in an Abstract Algebra of Action
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00060-popenalex-snapshot
3-SAT = SAT for a class of normal modal logics
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90059-bopenalex-snapshot
Constructive modal logics I
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90126-0openalex-snapshot
Determinism and looping in combinatory PDL
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1453-5.50026-xopenalex-snapshot
Belief Revision in a Changing World
inferred← citeshttps://doi.org/10.1016/j.apal.2004.12.001openalex-snapshot
Tableaux for constructive concurrent dynamic logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.026openalex-snapshot
Epistemic Verification of Anonymity
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.002openalex-snapshot
Multimodal Separation Logic for Reasoning About Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.05.001openalex-snapshot
Logics for Actor Networks: A two-stage constrained-hybridisation approach
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80033-6openalex-snapshot
The gamut of dynamic logics
inferred← citeshttps://doi.org/10.1023/a:1005235713913openalex-snapshot
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I
inferred← citeshttps://doi.org/10.1023/a:1021871106406openalex-snapshot
Old Foundations for the Logic of Agency and Action
inferred← citeshttps://doi.org/10.1023/a:1026499402531openalex-snapshot
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510844openalex-snapshot
Uniform and non uniform strategies for tableaux calculi for modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzag001openalex-snapshot
K and KT: an analytic non-deterministic view
inferred← citeshttps://doi.org/10.1109/ares.2009.54openalex-snapshot
Specification of Anonymity as a Secrecy Property in the ADM Logic - Homomorphic-Based Voting Protocols
inferred← citeshttps://doi.org/10.1109/icse-nier52604.2021.00026openalex-snapshot
Towards Modal Software Engineering
inferred← citeshttps://doi.org/10.1109/tencon.1989.176957openalex-snapshot
Concurrent program development and correctness: S2S game strategies and constructive dynamic logic
inferred← citeshttps://doi.org/10.1142/9789814343886_0011openalex-snapshot
SOUNDNESS AND COMPLETENESS
inferred← citeshttps://doi.org/10.1142/9789814719971_0007openalex-snapshot
SOUNDNESS AND COMPLETENESS
inferred← citeshttps://doi.org/10.1142/9789814719971_0012openalex-snapshot
SOUNDNESS AND COMPLETENESS
inferred← citeshttps://doi.org/10.1145/2499937.2499939openalex-snapshot
Does Treewidth Help in Modal Satisfiability?
inferred← citeshttps://doi.org/10.1145/3561320.3561329openalex-snapshot
A Sound Deep Embedding of Arbitrary Normal Modal Logics in Coq
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870820openalex-snapshot
The decision problem for linear temporal logic.
inferred← citeshttps://doi.org/10.2307/2108182openalex-snapshot
Backwards and Forwards in the Modal Logic of Agency
inferred← citeshttps://doi.org/10.24963/ijcai.2017/694openalex-snapshot
KSP: A Resolution-based Prover for Multimodal K, Abridged Report
inferred← citeshttps://doi.org/10.4204/eptcs.415.6openalex-snapshot
Twist Sequent Calculi for S4 and its Neighbors
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2222openalex-snapshot
Side Effects in Steering Fragments
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.