On the public citation graph

Recursive object types in a logic of object-oriented programs

https://doi.org/10.1007/bfb0053570
0 signed · 50 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-35358-6_26openalex-snapshot
Logical Foundations for Typed Object-Oriented Languages
inferredcites →https://doi.org/10.1007/978-1-4419-8598-9openalex-snapshot
A Theory of Objects
inferredcites →https://doi.org/10.1007/978-3-540-39910-0_2openalex-snapshot
A Logic of Object-Oriented Programs
inferredcites →https://doi.org/10.1007/bf01215408openalex-snapshot
Reasoning about dynamically evolving process structures
inferredcites →https://doi.org/10.1007/bfb0030634openalex-snapshot
A logic of object-oriented programs
inferredcites →https://doi.org/10.1007/bfb0053570openalex-snapshot
Recursive object types in a logic of object-oriented programs
inferredcites →https://doi.org/10.1145/155183.155231openalex-snapshot
Subtyping recursive types
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/567067.567073openalex-snapshot
Verifying reachability invariants of linked structures
inferredcites →https://doi.org/10.21236/ada209118openalex-snapshot
Verifying Object-Oriented Programs That Use Subtypes
inferredcites →https://doi.org/10.5555/227726.227772openalex-snapshot
Forcing behavioral subtyping through specification inheritance
inferredcites →https://doi.org/10.5860/choice.29-4565openalex-snapshot
Systems programming with Modula-3
inferredcites →https://doi.org/10.7907/z9cj8bh1openalex-snapshot
Towards Reliable Modular 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/cpe.2930openalex-snapshot
Specifying subtypes in Safety Critical Java programs
inferred← citeshttps://doi.org/10.1007/11532231_8openalex-snapshot
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44555-2_4openalex-snapshot
Formal Techniques for Java Programs
inferred← citeshttps://doi.org/10.1007/3-540-46589-8_6openalex-snapshot
Towards a Modular Denotational Semantics of Java
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_26openalex-snapshot
A weakest precondition semantics for an object-oriented language of refinement
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_13openalex-snapshot
Abstraction dependencies
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_11openalex-snapshot
First-Order Transitive Closure Axiomatization via Iterative Invariant Injections
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_3openalex-snapshot
A Program Logic for Resource Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_28openalex-snapshot
A Relational Model for Object-Oriented Designs
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_19openalex-snapshot
Denotational Semantics for Abadi and Leino’s Logic of Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_2openalex-snapshot
A Logic of Object-Oriented Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-45070-2_20openalex-snapshot
A Refinement Algebra for Object-Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_31openalex-snapshot
Integrating Theories and Techniques for Program Modelling, Design and Verification
inferred← citeshttps://doi.org/10.1007/978-981-10-2546-4_14openalex-snapshot
rCOS: A Refinement Calculus of Internetware Systems
inferred← citeshttps://doi.org/10.1007/bfb0053558openalex-snapshot
Programming languages and systems : 7th European Symposium on Programming, ESOP '98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS '98, Lisbon, Portugal, March 28-April 4, 1998 : proceedings
inferred← citeshttps://doi.org/10.1007/s00165-007-0067-yopenalex-snapshot
Graph transformations for object-oriented refinement
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.018openalex-snapshot
Unifying Views of UML
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.022openalex-snapshot
A Theory of Reactive Components
inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.003openalex-snapshot
Algebraic reasoning for object-oriented programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.030openalex-snapshot
Semantics and logic of object calculi
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.034openalex-snapshot
rCOS: A refinement calculus of object systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.003openalex-snapshot
A program logic for resources
inferred← citeshttps://doi.org/10.1017/s0960129506005214openalex-snapshot
Denotational semantics for a program logic of objects
inferred← citeshttps://doi.org/10.1037/0000114-016openalex-snapshot
Where are we now, and where do we go from here?
inferred← citeshttps://doi.org/10.1109/32.879810openalex-snapshot
A weakest precondition semantics for refinement of object-oriented programs
inferred← citeshttps://doi.org/10.1109/coginf.2002.1039284openalex-snapshot
Towards a refinement calculus for object systems
inferred← citeshttps://doi.org/10.1109/lics.2002.1029821openalex-snapshot
Semantics and logic of object calculi
inferred← citeshttps://doi.org/10.1109/sefm.2008.29openalex-snapshot
Laws of Object-Orientation with Reference Semantics
inferred← citeshttps://doi.org/10.1145/2043910.2043917openalex-snapshot
Specifying subtypes in SCJ programs
inferred← citeshttps://doi.org/10.1145/286936.286953openalex-snapshot
Data groups
inferred← citeshttps://doi.org/10.1145/570886.570888openalex-snapshot
Data abstraction and information hiding
inferred← citeshttps://doi.org/10.15514/syrcose-2014-8-7openalex-snapshot
Dynamically Allocated Memory Verification in Object-Oriented Programs using Prolog
inferred← citeshttps://doi.org/10.32603/2071-2340-2019-2-5-30openalex-snapshot
Сравнительный анализ статических методов верификации динамической памяти
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01667openalex-snapshot
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory
inferred← citeshttps://doi.org/10.5860/choice.43-4071aopenalex-snapshot
Software evolution with UML and XML
showing the first 35 of 36 · page through all 36
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.