On the public citation graph

A proof method for cyclic programs

0 signed · 68 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-4615-9050-7_2openalex-snapshot

Programming Languages

inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot

Cooperating Sequential Processes

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

An axiomatic proof technique for parallel programs I

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

Proving properties of interacting processes

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

Hierarchical ordering of sequential processes

inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot

Processes: A Mathematical Model of Computing Agents

inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot

Assigning meanings to programs

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

Is “sometime” sometimes better than “always”?

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

Interference between communicating parallel processes

inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot

Mathematical Theory of Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-15199-0_3openalex-snapshot

The role of proof obligations in software design

inferred← citeshttps://doi.org/10.1007/3-540-16761-7_90openalex-snapshot

A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language

inferred← citeshttps://doi.org/10.1007/3-540-48119-2_25openalex-snapshot

Compositional Symmetric Sharing in B

inferred← citeshttps://doi.org/10.1007/3-540-49213-5_17openalex-snapshot

Compositional Reasoning using Interval Temporal Logic and Tempura

inferred← citeshttps://doi.org/10.1007/3-540-52559-9_81openalex-snapshot

Some comments on the assumption-commitment framework for compositional verification of distributed programs

inferred← citeshttps://doi.org/10.1007/3-540-54430-5_110openalex-snapshot

A method for the development of totally correct shared-state parallel programs

inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_1openalex-snapshot

Wanted: a compositional approach to concurrency

inferred← citeshttps://doi.org/10.1007/978-1-4471-3540-1_5openalex-snapshot

Interference Revisited

inferred← citeshttps://doi.org/10.1007/978-3-540-32008-1_18openalex-snapshot

A. Common Notation

inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_9openalex-snapshot

Decomposition for Compositional Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_15openalex-snapshot

Assume-Guarantee Reasoning with Local Specifications

inferred← citeshttps://doi.org/10.1007/978-3-642-67881-3_7openalex-snapshot

Correctness of Software — An Overview

inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot

In Transition From Global to Modular Temporal Reasoning about Programs

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

Formal derivation of strongly correct concurrent programs

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

Time-dependent distributed systems: proving safety, liveness and real-time properties

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

P — A logic — a compositional proof system for distributed programs

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

On-the-fly garbage collection: New algorithms inspired by program proofs

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

The temporal semantics of concurrent programs

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

Reasoning about interference in an object-based design method

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

A formalism for reasoning about fair termination

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

Timesets

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

Assumption-commitment in automata

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

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

inferred← citeshttps://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot

Decomposition of distributed programs into communication-closed layers

inferred← citeshttps://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot

The temporal semantics of concurrent programs

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/s0019-9958(85)80014-0openalex-snapshot

A proof rule for fair termination of guarded commands

inferred← citeshttps://doi.org/10.1109/acc.2016.7525009openalex-snapshot

Symbolic construction of GR(1) contracts for systems with full information

inferred← citeshttps://doi.org/10.1109/aihas.1990.93916openalex-snapshot

A new technique for proving real-time properties

inferred← citeshttps://doi.org/10.1109/cca.2016.7587949openalex-snapshot

Control design for hybrid systems with TuLiP: The Temporal Logic Planning toolbox

inferred← citeshttps://doi.org/10.1109/csd.1998.657556openalex-snapshot

A presentation of regular languages in the assumption-commitment framework

inferred← citeshttps://doi.org/10.1109/iceccs.1995.479336openalex-snapshot

Compositional reasoning about projected and infinite time

inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot

Layering Assume-Guarantee Contracts for Hierarchical System Design

inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot

The early search for tractable ways of reasoning about programs

inferred← citeshttps://doi.org/10.1109/reldis.2003.1238069openalex-snapshot

A systematic approach to the development of event based applications

inferred← citeshttps://doi.org/10.1109/sfcs.1977.32openalex-snapshot

The temporal logic of programs

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

The Logic of Computer Programming

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

An Approach to Formal Specification of Control Modules

inferred← citeshttps://doi.org/10.1142/s0129054113500123openalex-snapshot

ASSUME-GUARANTEE REASONING WITH LOCAL SPECIFICATIONS

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

Workshop on formal verification

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

From process logic to program logic

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

Verification of safety properties for concurrent assembly code

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

From process logic to program logic

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

Verification of safety properties for concurrent assembly code

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

Proving real-time properties of programs with temporal logic

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

Elephant 2000

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

A Proof System for Communicating Sequential Processes

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

Proving Liveness Properties of Concurrent Programs

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

Is “sometime” sometimes better than “always”?

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

Specification and verification of liveness properties of cyclic, concurrent processes

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

Algorithms for on-the-fly garbage collection

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

Tentative steps toward a development method for interfering programs

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

Proving real-time properties of programs with temporal logic

inferred← citeshttps://doi.org/10.14236/ewic/rw1996.11openalex-snapshot

Using Temporal Fixpoints to Compositionally Reason about Liveness

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

Verification of Safety Properties for Concurrent Assembly Code

inferred← citeshttps://doi.org/10.32473/flairs.v35i.130551openalex-snapshot

Automatic verification of multi-agent systems security properties specified with LTL

inferred← citeshttps://doi.org/10.3990/1.9789036544399openalex-snapshot

Specification and verification of synchronisation classes in Java : a practical approach

inferred← citeshttps://doi.org/10.5075/epfl-thesis-2588openalex-snapshot

Specifying reactive system behavior

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.