On the public citation graph

Data refinement by calculation

https://doi.org/10.1007/bf00277386
0 signed · 62 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/stvr.223openalex-snapshot
Teaching formal methods lite via testing
inferred← citeshttps://doi.org/10.1007/11813040_20openalex-snapshot
Type-Safe Two-Level Data Transformation
inferred← citeshttps://doi.org/10.1007/11955757_4openalex-snapshot
Interpreting Invariant Composition in the B Method Using the Spec# Ownership Relation: A Way to Explain and Relax B Restrictions
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_26openalex-snapshot
Refinement in Circus
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_27openalex-snapshot
Forward Simulation for Data Refinement of Classes
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_24openalex-snapshot
On the Semantics of Refinement Calculi
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_36openalex-snapshot
Temporal preconditions of recursive procedures
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_92openalex-snapshot
Comparing approaches to data reification
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_18openalex-snapshot
Angelic termination in Dijkstra's calculus
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_88openalex-snapshot
Data reification without explicit abstraction functions
inferred← citeshttps://doi.org/10.1007/3-540-68383-6_32openalex-snapshot
Structural Views, Structural Evolution, and Product Families
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_14openalex-snapshot
An extension of the program derivation format
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_14openalex-snapshot
A Tactic Driven Refinement Tool
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_8openalex-snapshot
Software Reification using the SETS Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_19openalex-snapshot
The Varieties of Refinement
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_3openalex-snapshot
Whither Specifications as Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_21openalex-snapshot
An Abstract Semantics of Speculative Execution for Reasoning About Security Vulnerabilities
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_4openalex-snapshot
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-15940-9_6openalex-snapshot
Spreadsheet Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-56841-6_4openalex-snapshot
Java in the Safety-Critical Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-11447-2_1openalex-snapshot
Relaxing Restrictions on Invariant Composition in the B Method by Ownership Control a la Spec#
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_19openalex-snapshot
Generic Point-free Lenses
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_14openalex-snapshot
Type-Safe Evolution of Spreadsheets
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_11openalex-snapshot
Lectures on Data Refinement
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_4openalex-snapshot
Data Refinement and the Transform
inferred← citeshttps://doi.org/10.1007/bf01192157openalex-snapshot
The lattice of data refinement
inferred← citeshttps://doi.org/10.1007/bf01209623openalex-snapshot
Program refinement in fair transition systems
inferred← citeshttps://doi.org/10.1007/bfb0053575openalex-snapshot
Systematic change of data representation: Program manipulations and a case study
inferred← citeshttps://doi.org/10.1007/bfb0055150openalex-snapshot
A tool for data refinement
inferred← citeshttps://doi.org/10.1007/s001650070008openalex-snapshot
Encoding, Decoding and Data Refinement
inferred← citeshttps://doi.org/10.1007/s001659970002openalex-snapshot
Predicate Transformers for Recursive Procedures with Local Variables
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00016-kopenalex-snapshot
Nondeterminacy and recursion via stacks and games
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90174-eopenalex-snapshot
Processes and formalisms for unbounded choice
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00211-zopenalex-snapshot
Algebraic proofs of consistency and completeness
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00247-gopenalex-snapshot
Predicate transformers and higher-order programs
inferred← citeshttps://doi.org/10.1016/0950-5849(94)90007-8openalex-snapshot
Viewpoint specification and Z
inferred← citeshttps://doi.org/10.1016/0950-5849(95)90931-jopenalex-snapshot
Deriving distributed processes from concurrent processes
inferred← citeshttps://doi.org/10.1016/0950-5849(95)98300-5openalex-snapshot
Transformational data refinement and VDM
inferred← citeshttps://doi.org/10.1016/0950-5849(96)81744-7openalex-snapshot
A case study of a difficult refinement: a fast dictionary for a spell-checking program
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.024openalex-snapshot
Angelic Nondeterminism and Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.019openalex-snapshot
Strongly Typed Rewriting For Coupled Software Transformation
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.016openalex-snapshot
Trace-based Derivation of a Lock-Free Queue Algorithm
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.090openalex-snapshot
Coupled Transformation of Schemas, Documents, Queries, and Constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.010openalex-snapshot
ArcAngelC: a Refinement Tactic Language for
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.11.008openalex-snapshot
Constraint-aware Schema Transformation
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.012openalex-snapshot
A tactic language for refinement of state-rich concurrent specifications
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.016openalex-snapshot
Alternating states for dual nondeterminism in imperative programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.008openalex-snapshot
Angelic processes for CSP via the UTP
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00206-4openalex-snapshot
Model-based specification
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00339-xopenalex-snapshot
Soundness of data refinement for a higher-order imperative language
inferred← citeshttps://doi.org/10.1016/s1383-7621(96)00028-8openalex-snapshot
Towards a framework for cost-based transformation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80489-xopenalex-snapshot
Refinement of Actions in Circus,
inferred← citeshttps://doi.org/10.1017/s0956796814000045openalex-snapshot
Work it, wrap it, fix it, fold it
inferred← citeshttps://doi.org/10.1017/s1471068407003043openalex-snapshot
Calculating modules in contextual logic program refinement
inferred← citeshttps://doi.org/10.1108/eb035253openalex-snapshot
The Queen's University of Belfast
inferred← citeshttps://doi.org/10.1109/csfw.1991.151573openalex-snapshot
The basic integrity theorem
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347533openalex-snapshot
Heuristics for refinement relations
inferred← citeshttps://doi.org/10.1109/tse.2014.2361141openalex-snapshot
Embedding, Evolution, and Validation of Model-Driven Spreadsheets
inferred← citeshttps://doi.org/10.1109/vlhcc.2011.6070396openalex-snapshot
Embedding and evolution of spreadsheet models in spreadsheet systems
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.5220/0002394401960204openalex-snapshot
REFINEMENT PROPAGATION - Towards Automated Construction of Visual Specifications
inferred← citeshttps://doi.org/10.70675/14b92255zafc9z4dcczb918z9b027d3ef2dfopenalex-snapshot
A formal framework for heterogeneous systems semantics
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.