On the public citation graph

Verification by Augmented Abstraction: The Automata–Theoretic View

0 signed · 51 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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1006/inco.2000.3000openalex-snapshot
Verification by Augmented Finitary Abstraction
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-15648-8_7openalex-snapshot
Automata, tableaux, and temporal logics
inferredcites →https://doi.org/10.1007/3-540-17162-2openalex-snapshot
Category Theory and Computer Programming
inferredcites →https://doi.org/10.1007/3-540-17162-2_130openalex-snapshot
Galois connections and computer science applications
inferredcites →https://doi.org/10.1007/3-540-48168-0_11openalex-snapshot
Verifying Liveness by Augmented Abstraction
inferredcites →https://doi.org/10.1007/3-540-49253-4_5openalex-snapshot
Visual Abstractions for Temporal Verification
inferredcites →https://doi.org/10.1007/3-540-57887-0openalex-snapshot
Theoretical Aspects of Computer Software
inferredcites →https://doi.org/10.1007/3-540-57887-0_123openalex-snapshot
Temporal verification diagrams
inferredcites →https://doi.org/10.1007/3-540-58179-0_72openalex-snapshot
Another look at LTL model checking
inferredcites →https://doi.org/10.1007/3-540-60692-0_69openalex-snapshot
Generalized temporal verification diagrams
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0055036openalex-snapshot
Algorithmic verification of linear temporal logic specifications
inferredcites →https://doi.org/10.1016/0020-0190(89)90063-xopenalex-snapshot
On verifying that a concurrent program satisfies a nondeterministic specification
inferredcites →https://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1016/0890-5401(89)90004-7openalex-snapshot
The μ-calculus as an assertion-language for fairness arguments
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0022-0000(74)80051-6openalex-snapshot
Theories of automata on ω-tapes: A simplified approach
inferredcites →https://doi.org/10.1016/s0304-3975(96)00191-0openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1023/a:1008615614281openalex-snapshot
Another Look at LTL Model Checking
inferredcites →https://doi.org/10.1023/a:1008791913551openalex-snapshot
Deductive Model Checking
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1145/186025.186051openalex-snapshot
Model checking and abstraction
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11783565_3openalex-snapshot
Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_15openalex-snapshot
Verifying Temporal Heap Properties Specified via Evolution Logic
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_12openalex-snapshot
An Algebraic Framework for Abstract Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_21openalex-snapshot
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_4openalex-snapshot
Abstraction in Software Model Checking: Principles and Practice
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_24openalex-snapshot
Unit Checking: Symbolic Model Checking for a Unit of Code
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_23openalex-snapshot
Verification by Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_29openalex-snapshot
Abstraction for Branching Time Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_17openalex-snapshot
On-the-fly Emptiness Check of Transition-Based Streett Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_21openalex-snapshot
Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems
inferred← citeshttps://doi.org/10.1007/s00165-004-0040-yopenalex-snapshot
A generalized semantics of PROMELA for abstract model checking
inferred← citeshttps://doi.org/10.1007/s00165-005-0059-8openalex-snapshot
Model checking, testing and verification working together
inferred← citeshttps://doi.org/10.1007/s10703-011-0117-1openalex-snapshot
On the refinement of liveness properties of distributed systems
inferred← citeshttps://doi.org/10.1093/jigpal/jzl009openalex-snapshot
Verifying Temporal Heap Properties Specified via Evolution Logic
inferred← citeshttps://doi.org/10.1109/lics.2004.1319628openalex-snapshot
The existence of finite abstractions for branching time model checking
inferred← citeshttps://doi.org/10.1109/lics.2004.42openalex-snapshot
The existence of finite abstractions for branching time model checking
inferred← citeshttps://doi.org/10.1142/s0129054107004553openalex-snapshot
MODULAR RANKING ABSTRACTION
inferred← citeshttps://doi.org/10.1145/1040305.1040317openalex-snapshot
Transition predicate abstraction and fair termination
inferred← citeshttps://doi.org/10.22028/d291-25890openalex-snapshot
Temporal verification with transition invariants
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.