On the public citation graph

Dynamic Component Substitutability Analysis

0 signed · 57 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.1993.1021openalex-snapshot
Inference of Finite Automata Using Homing Sequences
inferredcites →https://doi.org/10.1007/11513988_18openalex-snapshot
The ComFoRT Reasoning Framework
inferredcites →https://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferredcites →https://doi.org/10.1007/3-540-45657-0_35openalex-snapshot
Interface Compatibility Checking for Software Modules
inferredcites →https://doi.org/10.1007/3-540-46002-0_25openalex-snapshot
Adaptive Model Checking
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-540-24756-2_8openalex-snapshot
State/Event-Based Software Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-24851-4_20openalex-snapshot
Early Identification of Incompatibilities in Multi-component Upgrades
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1023/b:form.0000040026.56959.91openalex-snapshot
Efficient Verification of Sequential and Concurrent C Programs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ase.2002.1114984openalex-snapshot
Assumption generation for software component verification
inferredcites →https://doi.org/10.1145/1040305.1040314openalex-snapshot
Synthesis of interface specifications for Java classes
inferredcites →https://doi.org/10.1145/503209.503226openalex-snapshot
Interface automata

What points at this work

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

inferred← citeshttps://doi.org/10.1002/smr.1888openalex-snapshot
Of software and change
inferred← citeshttps://doi.org/10.1007/11513988_18openalex-snapshot
The ComFoRT Reasoning Framework
inferred← citeshttps://doi.org/10.1007/11804192_12openalex-snapshot
Program Compatibility Approaches
inferred← citeshttps://doi.org/10.1007/11901433_29openalex-snapshot
Assume-Guarantee Software Verification Based on Game Semantics
inferred← citeshttps://doi.org/10.1007/11901914_15openalex-snapshot
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_17openalex-snapshot
Learning-Based Assume-Guarantee Regression Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_32openalex-snapshot
Dealing with Incompleteness in Automata-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_23openalex-snapshot
Refining Interface Alphabets for Compositional Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_4openalex-snapshot
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_3openalex-snapshot
Learning Minimal Separating DFA’s for Compositional Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-00899-3_10openalex-snapshot
Deciding Substitutability of Services with Operating Guidelines
inferred← citeshttps://doi.org/10.1007/978-3-642-27207-3_4openalex-snapshot
Behavioral Subtyping Relations for Timed Components
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_45openalex-snapshot
Factorization for Component-Interaction Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_24openalex-snapshot
Function Summaries in Software Upgrade Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_21openalex-snapshot
eVolCheck: Incremental Upgrade Checker for C
inferred← citeshttps://doi.org/10.1007/s10009-015-0405-yopenalex-snapshot
Flexible SAT-based framework for incremental bounded upgrade checking
inferred← citeshttps://doi.org/10.1007/s10009-017-0460-7openalex-snapshot
Advances in verification presented in TACAS’13
inferred← citeshttps://doi.org/10.1007/s10703-008-0049-6openalex-snapshot
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1007/s10703-008-0053-xopenalex-snapshot
Verification of evolving software via component substitutability analysis
inferred← citeshttps://doi.org/10.1007/s10703-008-0054-9openalex-snapshot
Special issue on learning techniques for compositional reasoning
inferred← citeshttps://doi.org/10.1007/s10703-008-0055-8openalex-snapshot
Automatic symbolic compositional verification by learning assumptions
inferred← citeshttps://doi.org/10.1007/s11334-012-0190-7openalex-snapshot
Service substitutability analysis based on behavior automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.030openalex-snapshot
Component Substitutability via Equivalencies of Component-Interaction Automata
inferred← citeshttps://doi.org/10.1093/comjnl/bxn064openalex-snapshot
Multiparty Contracts: Agreeing and Implementing Interorganizational Processes
inferred← citeshttps://doi.org/10.1109/csie.2009.761openalex-snapshot
Formalism for Safe Component Upgrades
inferred← citeshttps://doi.org/10.1109/csmr.2013.72openalex-snapshot
PINCETTE - Validating Changes and Upgrades in Networked Software
inferred← citeshttps://doi.org/10.1109/depcos-relcomex.2006.13openalex-snapshot
Compatibility of Software Components - Modeling and Verification
inferred← citeshttps://doi.org/10.1109/fose.2007.6openalex-snapshot
Formal Software Analysis Emerging Trends in Software Model Checking
inferred← citeshttps://doi.org/10.1109/icdcs.workshops.2008.125openalex-snapshot
A Formalism for Recongurability Analysis in Distributed Non-Blocking Components
inferred← citeshttps://doi.org/10.1109/icws.2006.124openalex-snapshot
Static Verification of Control and Data inWeb Service Compositions
inferred← citeshttps://doi.org/10.1109/sew.2008.14openalex-snapshot
TBP: Code-Oriented Component Behavior Specification
inferred← citeshttps://doi.org/10.1109/snpd.2009.83openalex-snapshot
Research on Component Behavior Protocols Mismatch Detection and Limited Assembly
inferred← citeshttps://doi.org/10.1145/1453101.1453127openalex-snapshot
Modular verification of web services using efficient symbolic encoding and summarization
inferred← citeshttps://doi.org/10.1145/2591062.2591197openalex-snapshot
Incremental reachability checking of KernelC programs using matching logic
inferred← citeshttps://doi.org/10.1504/ijbpim.2007.015132openalex-snapshot
An SOA-based architecture framework
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.1451openalex-snapshot
On Optimization of Minimized Assumption Generation Method for Component-Based Software Verification
inferred← citeshttps://doi.org/10.21236/ada453372openalex-snapshot
Results of SEI Independent Research and Development Projects and Report on Emerging Technologies and Technology Trends
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.522openalex-snapshot
Static Analysis for Checking Data Format Compatibility of Programs
inferred← citeshttps://doi.org/10.5555/1775223.1775227openalex-snapshot
Formalizing compatibility and substitutability in communication protocols using I/O-constraint automata
inferred← citeshttps://doi.org/10.5555/1998496.1998548openalex-snapshot
PINCETTE: validating changes and upgrades in networked software
inferred← citeshttps://doi.org/10.6100/ir653260openalex-snapshot
Service substitution:a behavioral approach based on Petri Nets
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.