On the public citation graph
Formal description of programming concepts
0 signed · 182 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-08766-4_11openalex-snapshot
Denotational semantics of goto: An exit formulation and its relation to continuations
inferredcites →https://doi.org/10.1007/3-540-08766-4_12openalex-snapshot
A formal definition of ALGOL 60 as described in the 1975 modified report
inferredcites →https://doi.org/10.1007/3-540-08766-4_9openalex-snapshot
Programming in the meta-language: A tutorial
inferredcites →https://doi.org/10.1007/3-540-09981-6_22openalex-snapshot
Suggestions for composing and specifying program design decisions
inferredcites →https://doi.org/10.1007/3-540-10007-5_35openalex-snapshot
Foundations of denotational semantics
inferredcites →https://doi.org/10.1007/3-540-10007-5_36openalex-snapshot
Models of programming language concepts
inferredcites →https://doi.org/10.1007/3-540-10007-5_41openalex-snapshot
The semantics of clear, a specification language
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_24openalex-snapshot
Proof of Correctness of Data Representations
inferredcites →https://doi.org/10.1007/bf00264020openalex-snapshot
Constructing a theory of a data structure as an aid to program development
inferredcites →https://doi.org/10.1007/bf00264597openalex-snapshot
A synthesis of several sorting algorithms
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bfb0048942openalex-snapshot
A formal definition of a PL/I subset
inferredcites →https://doi.org/10.1007/bfb0059692openalex-snapshot
Formalization of storage properties
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359046.359057openalex-snapshot
Syntactic source to source transforms and program manipulation
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.25405/ncl.34123362openalex-snapshot
Software Development: A Rigorous Approach
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.934openalex-snapshot
A robust monitor construct with runtime fault detection
inferred← citeshttps://doi.org/10.1002/malq.19870330506openalex-snapshot
Sequential Calculus for a First Order Infinitary Temporal Logic
inferred← citeshttps://doi.org/10.1007/11877028_3openalex-snapshot
Program Transformation with Reflection and Aspect-Oriented Programming
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_92openalex-snapshot
The VDM principles of software specification & program design
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_15openalex-snapshot
Denotational semantics of concurrent programs with shared memory
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_8openalex-snapshot
Algebraic specification of exception handling and error recovery by means of declarations and equations
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_16openalex-snapshot
ASSPEGIQUE: An integrated environment for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_18openalex-snapshot
Denotational semantics of nets with nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_13openalex-snapshot
An implementation from a direct semantics definition
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_20openalex-snapshot
A fully abstract semantics for data flow nets
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-54345-7_45openalex-snapshot
Rewrite orderings and termination of rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_47openalex-snapshot
Towards a complete hierarchy of compositional dataflow models
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_9openalex-snapshot
Extraction of strong typing laws from action semantics definitions
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_40openalex-snapshot
Bounded implementation of algebraic specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_4openalex-snapshot
Actress: an Action Semantics Directed Compiler Generator
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_16openalex-snapshot
A Functional Programming Approach to the Specification and Verification of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_6openalex-snapshot
On the Orthogonality of Assignments and Procedures in Algol
inferred← citeshttps://doi.org/10.1007/978-1-4615-2413-7_9openalex-snapshot
Programming a Hierarchical Structure
inferred← citeshttps://doi.org/10.1007/978-1-4684-3384-5_4openalex-snapshot
Logic for Data Description
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_22openalex-snapshot
Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_7openalex-snapshot
A Functional Calculus for Specification and Verification of Nondeterministic Interactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_6openalex-snapshot
An Universal Resolving Algorithm for Inverse Computation of Lazy Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_26openalex-snapshot
Boolean Approximation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_20openalex-snapshot
Abstract Interpretation from a Topological Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_22openalex-snapshot
Exception Handling: Formal Specification and Systematic Program Construction Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-642-83248-2_17openalex-snapshot
Dataflow Architectures and Implicit Parallel Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_15openalex-snapshot
Asymptotic Speedups, Bisimulation and Distillation (Work in Progress)
inferred← citeshttps://doi.org/10.1007/978-3-663-07678-0_5openalex-snapshot
Performanzorientiertes Parsing und Grammatik-Design — das Parse Talk-System
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_6openalex-snapshot
Programming Concepts in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-015-9761-6_9openalex-snapshot
Free Logic in Program Specification and Verification
inferred← citeshttps://doi.org/10.1007/bf00264015openalex-snapshot
Formal derivation of strongly correct concurrent programs
inferred← citeshttps://doi.org/10.1007/bf00269810openalex-snapshot
Language design methods based on semantic principles: Algol 68, a Language Designed using Semantic Principles
inferred← citeshttps://doi.org/10.1007/bf00288541openalex-snapshot
Hierarchical program specification and verification ? a many-sorted logical approach
inferred← citeshttps://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferred← citeshttps://doi.org/10.1007/bf00302640openalex-snapshot
On the recursive decomposition ordering with lexicographical status and other related orderings
inferred← citeshttps://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
inferred← citeshttps://doi.org/10.1007/bf02943544openalex-snapshot
An algorithm for determining database consistency under the closed world assumption
inferred← citeshttps://doi.org/10.1007/bfb0012771openalex-snapshot
An operational semantics for pure dataflow
inferred← citeshttps://doi.org/10.1007/bfb0017210openalex-snapshot
NREVERSAL of fortune — The thermodynamics of garbage collection
inferred← citeshttps://doi.org/10.1007/bfb0017486openalex-snapshot
On the first-order equivalence of call-by-name and call-by-value
inferred← citeshttps://doi.org/10.1007/bfb0022472openalex-snapshot
Modeling a solution for a control problem in distributed systems by restrictions
inferred← citeshttps://doi.org/10.1007/bfb0026096openalex-snapshot
Parameter-reduction of higher level grammars
inferred← citeshttps://doi.org/10.1007/bfb0031998openalex-snapshot
Problems, promises and performance: some questions for real-time system specification
inferred← citeshttps://doi.org/10.1016/0010-4655(85)90135-3openalex-snapshot
The Manchester dataflow machine
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90132-7openalex-snapshot
Aliasing among pointers in EUCLID
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90009-5openalex-snapshot
Transformational semantics for concurrent programs
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90051-4openalex-snapshot
A formal system for parallel programs in discrete time and space
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90073-8openalex-snapshot
An efficient interpreter for the lambda-calculus
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90026-2openalex-snapshot
Specification and top-down design of distributed systems
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90034-topenalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1016/0022-4049(80)90106-1openalex-snapshot
Varieties of chain-complete algebras
inferred← citeshttps://doi.org/10.1016/0045-7906(81)90034-3openalex-snapshot
Performance evaluation of asynchronous, modular systems
inferred← citeshttps://doi.org/10.1016/0096-0551(80)90049-1openalex-snapshot
Toward modular verifiable exception handling
inferred← citeshttps://doi.org/10.1016/0096-0551(86)90001-9openalex-snapshot
Structuring FP-style functional programs
inferred← citeshttps://doi.org/10.1016/0096-0551(89)90027-1openalex-snapshot
Creating efficient programs by exchanging data for procedures
inferred← citeshttps://doi.org/10.1016/0096-0551(90)90023-iopenalex-snapshot
Functional semantics of programs with exceptions
inferred← citeshttps://doi.org/10.1016/0096-0551(91)90002-qopenalex-snapshot
Black-box specification in Spec
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90016-9openalex-snapshot
A systematic approach to language constructs for concurrent programs
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90004-8openalex-snapshot
A language of specified programs
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90011-5openalex-snapshot
A method and a language for constructing iterative programs
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90004-3openalex-snapshot
Algebraic implementations preserve program correctness
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90030-xopenalex-snapshot
Termination of rewriting systems by polynomial interpretations and its implementation
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90001-9openalex-snapshot
Detecting stack-based environments in denotational definitions
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90016-0openalex-snapshot
Nondeterministic data flow programs: How to avoid the merge anomaly
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90003-8openalex-snapshot
Denotational engineering
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00018-2openalex-snapshot
Gate splitting in LOTOS specifications using abstract interpretation
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00021-2openalex-snapshot
Label algebras and exception handling
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00012-7openalex-snapshot
Lazy type inference and program analysis
inferred← citeshttps://doi.org/10.1016/0167-739x(85)90009-3openalex-snapshot
The Manchester dataflow machine
inferred← citeshttps://doi.org/10.1016/0167-739x(87)90033-1openalex-snapshot
Performance issues in dataflow machines
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90069-nopenalex-snapshot
Control structures for data-parallel SIMD languages: semantics and implementation
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90111-0openalex-snapshot
Modeling a solution for a control problem in distributed systems by restrictions
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90111-6openalex-snapshot
Mixed computation: potential applications and problems for study
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90017-8openalex-snapshot
Computing the behaviour of asynchronous processes
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90019-8openalex-snapshot
Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90051-4openalex-snapshot
Structured algebraic specifications: A Kernel language
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90089-2openalex-snapshot
Parameter-reduction of higher level grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90090-xopenalex-snapshot
Algebraic specification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90198-qopenalex-snapshot
Mixed computation and compilation: New approaches to old problems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90082-dopenalex-snapshot
An extensional fixed-point semantics for nondeterministic data flow
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90210-7openalex-snapshot
On the expressive power of finitely typed and universally polymorphic recursive procedures
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90011-5openalex-snapshot
Abstract interpretation based on oldt resolution
inferred← citeshttps://doi.org/10.1016/0743-7315(86)90018-3openalex-snapshot
Processor allocation in a multi-ring dataflow machine
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90015-vopenalex-snapshot
Well rewrite orderings and well quasi-orderings
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90043-fopenalex-snapshot
The expressive power of indeterminate dataflow primitives
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90076-ropenalex-snapshot
A lattice for abstract interpretation of dynamic (LISP-like) structures
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50020-0openalex-snapshot
Logic and Databases: A Deductive Approach
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50022-4openalex-snapshot
LOGIC FOR DATA DESCRIPTION
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.010openalex-snapshot
On the semantics of parsing actions
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.010openalex-snapshot
Reversible computing from a programming language perspective
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80010-9openalex-snapshot
Function definitions in term rewriting and applicative programming
inferred← citeshttps://doi.org/10.1016/s0020-0190(80)90084-8openalex-snapshot
On the generation of compilers from language definitions
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00156-4openalex-snapshot
Linear dynamic Kahn networks are deterministic
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80023-8openalex-snapshot
Path of subterms ordering and recursive decomposition ordering revisited
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80568-1openalex-snapshot
Adjunction Models For Call-By-Push-Value With Stacks
inferred← citeshttps://doi.org/10.1017/s0269888900000448openalex-snapshot
Logic Programming in the Fifth Generation
inferred← citeshttps://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferred← citeshttps://doi.org/10.1017/s0956796800000496openalex-snapshot
Abstract interpretation by dynamic partitioning
inferred← citeshttps://doi.org/10.1017/s0956796800000745openalex-snapshot
On the specialization of online program specializers
inferred← citeshttps://doi.org/10.1017/s0956796800001933openalex-snapshot
A syntactic theory of type generativity and sharing
inferred← citeshttps://doi.org/10.1017/s147106842510015xopenalex-snapshot
Hiord $^{{\kern2pt}\sharp}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs
inferred← citeshttps://doi.org/10.1080/00207169708804599openalex-snapshot
Network algebra for asynchronous dataflow∗
inferred← citeshttps://doi.org/10.1109/32.4624openalex-snapshot
Mathemtical model of composite objects and its application for organizing engineering databases
inferred← citeshttps://doi.org/10.1109/apdc.1997.574060openalex-snapshot
Automatic generation of parallel compiler-partial evaluation of parallel lambda language
inferred← citeshttps://doi.org/10.1109/ftdcs.1993.344208openalex-snapshot
Completeness of the equational semantics for Basic LOTOS
inferred← citeshttps://doi.org/10.1109/hicss.1992.183354openalex-snapshot
An object-based approach to the specification of applications for office support systems
inferred← citeshttps://doi.org/10.1109/icassp.1987.1169889openalex-snapshot
REMORA A software architecture for the collaboration of different knowledge sources in phonetic decoding of continuous speech
inferred← citeshttps://doi.org/10.1109/icci.1993.315401openalex-snapshot
Interpretive language implementation from a layered operational model
inferred← citeshttps://doi.org/10.1109/iccl.1988.13073openalex-snapshot
The design of software interfaces in Spec
inferred← citeshttps://doi.org/10.1109/iccl.1990.63760openalex-snapshot
A self-applicable partial evaluator for the lambda calculus
inferred← citeshttps://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferred← citeshttps://doi.org/10.1109/lics.1992.185554openalex-snapshot
Observable algorithms on concrete data structures
inferred← citeshttps://doi.org/10.1109/lics.1993.287573openalex-snapshot
The order types of termination orderings on monadic terms, strings and multisets
inferred← citeshttps://doi.org/10.1109/mc.1987.1663485openalex-snapshot
Modeling and Managing CAD Databases
inferred← citeshttps://doi.org/10.1109/sfcs.1980.2openalex-snapshot
A distributed abstract data type implemented by a probabilistic communication scheme
inferred← citeshttps://doi.org/10.1109/sfcs.1980.41openalex-snapshot
Structure and complexity of relational queries
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21954openalex-snapshot
Nonexpressibility of fairness and signaling
inferred← citeshttps://doi.org/10.1109/soac.1991.143911openalex-snapshot
Modelling messages as objects
inferred← citeshttps://doi.org/10.1142/s0218127422500201openalex-snapshot
Controlling Chaos for Multistep Iteration Process and Its Special Iterations in Discrete Dynamical Systems
inferred← citeshttps://doi.org/10.1145/1111037.1111065openalex-snapshot
Frame rules from answer types for code pointers
inferred← citeshttps://doi.org/10.1145/1480881.1480903openalex-snapshot
Lazy evaluation and delimited control
inferred← citeshttps://doi.org/10.1145/155090.155095openalex-snapshot
Abstract debugging of higher-order imperative languages
inferred← citeshttps://doi.org/10.1145/2002259.2002261openalex-snapshot
A general extension system for event processing languages
inferred← citeshttps://doi.org/10.1145/2661103.2661109openalex-snapshot
Hygienic quasiquotation in scheme
inferred← citeshttps://doi.org/10.1145/289121.289124openalex-snapshot
Program specialization vs. program composition
inferred← citeshttps://doi.org/10.1145/2972206.2972219openalex-snapshot
Deeply Reifying Running Code for Constructing a Domain-Specific Language
inferred← citeshttps://doi.org/10.1145/3487212.3487343openalex-snapshot
Translating structured sequential programs to dataflow graphs
inferred← citeshttps://doi.org/10.1145/3635800.3637445openalex-snapshot
The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/3635800.3637448openalex-snapshot
The 0'th PEPM Event: October 1987—and Andrei Petrovich Ershov: 1977–1988 (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/43908.43910openalex-snapshot
A bibliography on partial evaluation
inferred← citeshttps://doi.org/10.1145/69575.357227openalex-snapshot
Control Flow Aspects of Semantics-Directed Compiling
inferred← citeshttps://doi.org/10.1145/960126.806892openalex-snapshot
On the specification of behavioural constraints
inferred← citeshttps://doi.org/10.1145/960128.806892openalex-snapshot
On the specification of behavioural constraints
inferred← citeshttps://doi.org/10.1145/966873.806478openalex-snapshot
Extending the power of programming by examples
inferred← citeshttps://doi.org/10.2307/2275551openalex-snapshot
The order types of termination orderings on monadic terms, strings and multisets
inferred← citeshttps://doi.org/10.4204/eptcs.129.7openalex-snapshot
Abstract Interpretation as a Programming Language
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.