On the public citation graph

Program proving: Coroutines

0 signed · 95 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-1-4612-6315-9_10openalex-snapshot

Proof of a Program: FIND

inferredcites →https://doi.org/10.1007/978-1-4899-3514-4_2openalex-snapshot

Doctoral Dissertation

inferredcites →https://doi.org/10.1007/bf00288686openalex-snapshot

Program proving: Jumps and functions

inferredcites →https://doi.org/10.1007/bf01939412openalex-snapshot

Coroutine sequencing in a block structured environment

inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot

Procedures and parameters: An axiomatic approach

inferredcites →https://doi.org/10.1093/comjnl/14.4.391openalex-snapshot

Proof of a recursive program: Quicksort

inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot

An axiomatic basis for computer programming

inferredcites →https://doi.org/10.1145/362452.362489openalex-snapshot

Proof of a program

inferredcites →https://doi.org/10.1145/365813.365819openalex-snapshot

SIMULA: an ALGOL-based simulation language

inferredcites →https://doi.org/10.1145/366663.366704openalex-snapshot

Design of a separable transition-diagram compiler

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380140803openalex-snapshot

The use of ghost variables and virtual programming in the documentation and verification of programs

inferred← citeshttps://doi.org/10.1007/3-540-07162-8_678openalex-snapshot

An approach to correctness proofs of semicoroutines

inferred← citeshttps://doi.org/10.1007/3-540-07389-2_235openalex-snapshot

Proving properties of programs by means of predicate logic

inferred← citeshttps://doi.org/10.1007/3-540-07994-7_47openalex-snapshot

Parallel programming: An axiomatic approach

inferred← citeshttps://doi.org/10.1007/3-540-08353-7_167openalex-snapshot

Semantics and proof rules for coroutine hierarchies in block-structured programming languages

inferred← citeshttps://doi.org/10.1007/3-540-08921-7_67openalex-snapshot

Semantics of nondeterminism, concurrency and communication

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_65openalex-snapshot

Semantic analysis of communicating sequential processes

inferred← citeshttps://doi.org/10.1007/3-540-10256-6_7openalex-snapshot

Conclusions and further research

inferred← citeshttps://doi.org/10.1007/3-540-58179-0_53openalex-snapshot

Methodology and system for practical formal verification of reactive hardware

inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_6openalex-snapshot

Connecting Different Proof Styles

inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_8openalex-snapshot

A Specification-Verification Framework for Distributed Applications Software

inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_2openalex-snapshot

Derivation of Sequential, Real-Time, Process-Control Programs

inferred← citeshttps://doi.org/10.1007/978-1-4757-2714-2_4openalex-snapshot

Disjoint Parallel Programs

inferred← citeshttps://doi.org/10.1007/978-1-4757-4376-0_5openalex-snapshot

Disjoint Parallel Programs

inferred← citeshttps://doi.org/10.1007/978-3-030-58768-0_11openalex-snapshot

Hoare-Style Logic for Unstructured Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_16openalex-snapshot

Effectively Eliminating Auxiliaries

inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_5openalex-snapshot

Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables

inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_11openalex-snapshot

Efficient Coroutine Generation of Constrained Gray Sequences

inferred← citeshttps://doi.org/10.1007/978-3-540-89897-9_10openalex-snapshot

Milestones: Mythical Signals in UML to Analyze and Monitor Progress

inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_15openalex-snapshot

Formal Verification of Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_11openalex-snapshot

A Proof System for Brinch Hansen’s Distributed Processes

inferred← citeshttps://doi.org/10.1007/bf00263992openalex-snapshot

Proving correctness of coroutines without history variables

inferred← citeshttps://doi.org/10.1007/bf00264565openalex-snapshot

A closer look at termination

inferred← citeshttps://doi.org/10.1007/bf00268134openalex-snapshot

An axiomatic proof technique for parallel programs I

inferred← citeshttps://doi.org/10.1007/bf00276182openalex-snapshot

Proof of termination within a weak logic of programs

inferred← citeshttps://doi.org/10.1007/bf00289468openalex-snapshot

Axiomatic approach to side effects and general jumps

inferred← citeshttps://doi.org/10.1007/bf00289587openalex-snapshot

On the use of history variables

inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot

Current methods for proving program correctness

inferred← citeshttps://doi.org/10.1007/bf01933226openalex-snapshot

A note on the assignment of measurement points for frequency counts in structured programs

inferred← citeshttps://doi.org/10.1007/bf02252958openalex-snapshot

A complete axiomatic semantics of spawning

inferred← citeshttps://doi.org/10.1007/bfb0002777openalex-snapshot

Synchronising asynchronous communications

inferred← citeshttps://doi.org/10.1007/bfb0022437openalex-snapshot

Pseudo read-modify-write operations: Bounded wait-free implementations

inferred← citeshttps://doi.org/10.1007/bfb0027049openalex-snapshot

Concepts for concurrent programming

inferred← citeshttps://doi.org/10.1007/bfb0084792openalex-snapshot

Sometimes ‘some’ is as good as ‘all’

inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot

Fifty years of Hoare’s logic

inferred← citeshttps://doi.org/10.1007/s00236-007-0052-1openalex-snapshot

Distributed Consensus, revisited

inferred← citeshttps://doi.org/10.1007/s002360200080openalex-snapshot

An assertional criterion for atomicity

inferred← citeshttps://doi.org/10.1007/s10703-010-0092-yopenalex-snapshot

Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols

inferred← citeshttps://doi.org/10.1007/s10817-008-9098-1openalex-snapshot

A Mechanical Analysis of Program Verification Strategies

inferred← citeshttps://doi.org/10.1016/0020-0190(76)90082-xopenalex-snapshot

A proof rule for multiple coroutine systems

inferred← citeshttps://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot

Semantics of nondeterminism, concurrency, and communication

inferred← citeshttps://doi.org/10.1016/0096-0551(75)90014-4openalex-snapshot

Parallel programming: An axiomatic approach

inferred← citeshttps://doi.org/10.1016/0096-0551(84)90018-3openalex-snapshot

An outline of the programming language SIMULA

inferred← citeshttps://doi.org/10.1016/0164-1212(93)90023-qopenalex-snapshot

Tracing the execution of distributed programs

inferred← citeshttps://doi.org/10.1016/0167-6423(92)90036-bopenalex-snapshot

Beyond atomic registers: bounded wait-free implementations of nontrivial objects

inferred← citeshttps://doi.org/10.1016/0304-3975(79)90058-6openalex-snapshot

Recursive assertions are not enough - or are they?

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot

Proving partial order properties

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot

Methods and Logics for Proving Programs

inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101099openalex-snapshot

Hoare-style logic for unstructured programs

inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.004openalex-snapshot

Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control

inferred← citeshttps://doi.org/10.1016/j.scico.2017.03.009openalex-snapshot

A study of mutable checkpointing and related algorithms

inferred← citeshttps://doi.org/10.1080/10637199808947391openalex-snapshot

AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗

inferred← citeshttps://doi.org/10.1109/ase.2006.60openalex-snapshot

Security Analysis of Crypto-based Java Programs using Automated Theorem Provers

inferred← citeshttps://doi.org/10.1109/hldvt.2007.4392796openalex-snapshot

Hierarchical cache coherence protocol verification one level at a time through assume guarantee

inferred← citeshttps://doi.org/10.1109/pccc.1995.472466openalex-snapshot

Establishing PCI compliance using formal verification: a case study

inferred← citeshttps://doi.org/10.1109/tc.1976.1674703openalex-snapshot

The Use of Higher Order Logic in Program Verification

inferred← citeshttps://doi.org/10.1109/tse.1981.230844openalex-snapshot

Proofs of Networks of Processes

inferred← citeshttps://doi.org/10.1137/0205037openalex-snapshot

Data Types as Lattices

inferred← citeshttps://doi.org/10.1145/1041474.1041476openalex-snapshot

On proof rules for monitors

inferred← citeshttps://doi.org/10.1145/1042038.1042044openalex-snapshot

Eternity variables to prove simulation of specifications

inferred← citeshttps://doi.org/10.1145/1411798.1411809openalex-snapshot

Iterative interpretation of tail-recursive LISP procedures

inferred← citeshttps://doi.org/10.1145/322108.322121openalex-snapshot

Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

inferred← citeshttps://doi.org/10.1145/357139.357143openalex-snapshot

Referencing and Retention in Block-Structured Coroutines

inferred← citeshttps://doi.org/10.1145/357146.357150openalex-snapshot

Ten Years of Hoare's Logic: A Survey—Part I

inferred← citeshttps://doi.org/10.1145/360051.360079openalex-snapshot

Proving monitors

inferred← citeshttps://doi.org/10.1145/390016.808435openalex-snapshot

A methodology for verifying programs

inferred← citeshttps://doi.org/10.1145/503643.503680openalex-snapshot

Proving the correctness of coroutines without history variables

inferred← citeshttps://doi.org/10.1145/512950.512952openalex-snapshot

Programming language constructs for which it is impossible to obtain good hoare-like axiom systems

inferred← citeshttps://doi.org/10.1145/579.583openalex-snapshot

Using message passing for distributed programming: proof rules and disciplines

inferred← citeshttps://doi.org/10.1145/800022.808306openalex-snapshot

Gypsy

inferred← citeshttps://doi.org/10.1145/800177.810051openalex-snapshot

Assertional checking and symbolic execution

inferred← citeshttps://doi.org/10.1145/800220.806691openalex-snapshot

Understanding and using asynchronous message passing (Preliminary Version)

inferred← citeshttps://doi.org/10.1145/987335.987341openalex-snapshot

An experiment with the extensibility of SIMULA

inferred← citeshttps://doi.org/10.14236/ewic/fa1997.17openalex-snapshot

Communication Traces in the Verification of Distributed Programs

inferred← citeshttps://doi.org/10.14279/depositonce-3974openalex-snapshot

Modeling and verification of distributed algorithms in theorem proving environments

inferred← citeshttps://doi.org/10.17863/cam.11791openalex-snapshot

Concurrent verification for sequential programs

inferred← citeshttps://doi.org/10.21236/ada238877openalex-snapshot

Derivation of Sequential, Real-Time, Process-Control Programs

inferred← citeshttps://doi.org/10.2139/ssrn.5046959openalex-snapshot

Hoare-Style Logic for Unstructured Programs

inferred← citeshttps://doi.org/10.26021/2692openalex-snapshot

The Semantics, Formal Correctness and Implementation of History Variables in an Imperative Programming Language.

inferred← citeshttps://doi.org/10.4204/eptcs.212.1openalex-snapshot

A verified abstract machine for functional coroutines

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.5075/epfl-thesis-3980openalex-snapshot

A formal approach to fault tolerant distributed consensus

inferred← citeshttps://doi.org/10.5555/800091.802949openalex-snapshot

Hierarchical coroutines a mechanism for improved program structure

inferred← citeshttps://doi.org/10.59471/raia202357openalex-snapshot

Verificación de Programas Paralelos

inferred← citeshttps://doi.org/10.71548/18425openalex-snapshot

A Unifying Theory of Multi-Exit Programs

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.