On the public citation graph

Formal validation of pattern matching code

0 signed · 37 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/3-540-36579-6_5openalex-snapshot
A Pattern Matching Compiler for Multiple Target Languages
inferredcites →https://doi.org/10.1007/3-540-55602-8_181openalex-snapshot
Automated correctness proofs of machine code programs for a commercial microprocessor
inferredcites →https://doi.org/10.1007/3-540-62599-2_49openalex-snapshot
On extending Java
inferredcites →https://doi.org/10.1007/bf01128408openalex-snapshot
The VLISP verified PreScheme compiler
inferredcites →https://doi.org/10.1007/bfb0054170openalex-snapshot
Translation validation
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1017/s0956796800003907openalex-snapshot
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
inferredcites →https://doi.org/10.1023/a:1027357912519openalex-snapshot
Theorem Proving Modulo
inferredcites →https://doi.org/10.1049/ip-sen:20041181openalex-snapshot
Generator of efficient strongly typed abstract syntax trees in Java
inferredcites →https://doi.org/10.1090/psapm/019/0242403openalex-snapshot
Correctness of a compiler for arithmetic expressions
inferredcites →https://doi.org/10.1109/icsr.1998.685739openalex-snapshot
JTS: tools for implementing domain-specific languages
inferredcites →https://doi.org/10.1145/263699.263712openalex-snapshot
Proof-carrying code
inferredcites →https://doi.org/10.1145/277650.277752openalex-snapshot
The design and implementation of a certifying compiler
inferredcites →https://doi.org/10.1145/41625.41653openalex-snapshot
Views: a way for pattern matching to cohabit with data abstraction
inferredcites →https://doi.org/10.1145/503272.503299openalex-snapshot
Proving correctness of compiler optimizations by temporal logic
inferredcites →https://doi.org/10.1145/507635.507641openalex-snapshot
Optimizing pattern matching
inferredcites →https://doi.org/10.1145/512927.512941openalex-snapshot
Advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1145/888251.888276openalex-snapshot
Foundational proof checkers with small witnesses
inferredcites →https://doi.org/10.1145/964001.964002openalex-snapshot
Symbolic transfer function-based approaches to certified compilation
inferredcites →https://doi.org/10.1145/964001.964030openalex-snapshot
Global value numbering using random interpretation
inferredcites →https://doi.org/10.1145/989393.989454openalex-snapshot
The design and implementation of a certifying compiler
inferredcites →https://doi.org/10.5555/968486.968488openalex-snapshot
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11780274openalex-snapshot
Algebra, Meaning, and Computation
inferred← citeshttps://doi.org/10.1007/11780274_11openalex-snapshot
Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application
inferred← citeshttps://doi.org/10.1007/11784180_7openalex-snapshot
Formal Islands
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_9openalex-snapshot
Anti-pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-72952-5_7openalex-snapshot
On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_5openalex-snapshot
Tom: Piggybacking Rewriting on Java
inferred← citeshttps://doi.org/10.1007/s10270-007-0068-6openalex-snapshot
Redesign of UML class diagrams: a formal approach
inferred← citeshttps://doi.org/10.1007/s10990-007-9004-2openalex-snapshot
A ρ-calculus of explicit constraint application
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.029openalex-snapshot
A ρ-Calculus of Explicit Constraint Application
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.051openalex-snapshot
Anchoring Modularity in HTML
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.06.014openalex-snapshot
Canonical Abstract Syntax Trees
inferred← citeshttps://doi.org/10.1145/1314436.1314446openalex-snapshot
Weaving rewrite-based access control policies
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.3.33openalex-snapshot
Optimizing Pattern Matching Compilation by Program Transformation
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3899openalex-snapshot
Object-oriented pattern matching
inferred← citeshttps://doi.org/10.70675/33551aa7z7e96z4b24zbaa1zbe39a011a93dopenalex-snapshot
Rewriting and modularity for security policies
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.