On the public citation graph

Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition

0 signed · 54 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1006/inco.1993.1021openalex-snapshot
Inference of Finite Automata Using Homing Sequences
inferredcites →https://doi.org/10.1007/11513988_52openalex-snapshot
Symbolic Compositional Verification by Learning Assumptions
inferredcites →https://doi.org/10.1007/11526841_34openalex-snapshot
Dynamic Component Substitutability Analysis
inferredcites →https://doi.org/10.1007/11537328_24openalex-snapshot
Learning-Based Assume-Guarantee Verification (Tool Paper)
inferredcites →https://doi.org/10.1007/3-540-16042-6_21openalex-snapshot
A proof technique for rely/guarantee properties
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_29openalex-snapshot
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-63166-6_6openalex-snapshot
A compositional rule for hardware design refinement
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/a:1008739929481openalex-snapshot
Reactive Modules
inferredcites →https://doi.org/10.1109/92.748202openalex-snapshot
Multilevel hypergraph partitioning: applications in VLSI domain
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tse.1984.5010248openalex-snapshot
Program Slicing
inferredcites →https://doi.org/10.1145/1146238.1146250openalex-snapshot
Breaking up is hard to do
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/203095.201069openalex-snapshot
Conjoining specifications
inferredcites →https://doi.org/10.1145/309847.309954openalex-snapshot
Multilevel k -way hypergraph partitioning

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_20openalex-snapshot
Polynomial Identification of $$\omega $$-Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_28openalex-snapshot
Compositional Model Checking with Incremental Counter-Example Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_7openalex-snapshot
A Weakness Measure for GR(1) Formulae
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_10openalex-snapshot
Assume-Guarantee Verification for Interface Automata
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-73368-3_8openalex-snapshot
SAT-Based Compositional Verification Using Lazy Learning
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-31759-0_7openalex-snapshot
A Compositional Minimization Approach for Large Asynchronous Design Verification
inferred← citeshttps://doi.org/10.1007/s00236-018-0317-xopenalex-snapshot
Verification of asynchronous systems with an unspecified component
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-0055-8openalex-snapshot
Automatic symbolic compositional verification by learning assumptions
inferred← citeshttps://doi.org/10.1109/access.2021.3081742openalex-snapshot
Handling State Space Explosion in Component-Based Software Verification: A Review
inferred← citeshttps://doi.org/10.1109/ase.2015.33openalex-snapshot
Interpolation Guided Compositional Verification (T)
inferred← citeshttps://doi.org/10.1109/ats.2015.42openalex-snapshot
A New Approach for Minimal Environment Construction for Modular Property Verification
inferred← citeshttps://doi.org/10.1109/compsac.2014.28openalex-snapshot
Counterexample-Guided Abstraction Refinement for Component-Based Systems
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351134openalex-snapshot
Data mining based decomposition for assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496663openalex-snapshot
An improvement in decomposed reachability analysis for symbolic model checking
inferred← citeshttps://doi.org/10.1109/hldvt.2010.5496666openalex-snapshot
State space reductions for scalable verification of asynchronous designs
inferred← citeshttps://doi.org/10.1109/isvlsi.2009.16openalex-snapshot
Synchronization-Based Abstraction Refinement for Modular Verification of Asynchronous Designs
inferred← citeshttps://doi.org/10.1109/jproc.2018.2834926openalex-snapshot
Layering Assume-Guarantee Contracts for Hierarchical System Design
inferred← citeshttps://doi.org/10.1109/tc.2009.187openalex-snapshot
Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement
inferred← citeshttps://doi.org/10.1109/tc.2010.94openalex-snapshot
Counterexample-Guided Assume-Guarantee Synthesis through Learning
inferred← citeshttps://doi.org/10.1109/tc.2014.2329701openalex-snapshot
Compositional Model Checking of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/tcad.2009.2012531openalex-snapshot
Automated Interface Refinement for Compositional Verification
inferred← citeshttps://doi.org/10.1109/tse.2013.57openalex-snapshot
Learning Assumptions for CompositionalVerification of Timed Systems
inferred← citeshttps://doi.org/10.1142/s0129054113500123openalex-snapshot
ASSUME-GUARANTEE REASONING WITH LOCAL SPECIFICATIONS
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:21)2019openalex-snapshot
Query learning of derived $\omega$-tree languages in polynomial time
inferred← citeshttps://doi.org/10.2514/6.2015-1868openalex-snapshot
Trusting Outsourced Components In Flight Critical Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d95openalex-snapshot
Polynomial Identification of $\omega$-Automata
inferred← citeshttps://doi.org/10.36001/phmconf.2014.v6i1.2389openalex-snapshot
Formal Verification of Complex Systems based on SysML Functional Requirements
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:10)2024openalex-snapshot
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1806.03600openalex-snapshot
ML + FV = $\heartsuit$? A Survey on the Application of Machine Learning to Formal Verification
inferred← citeshttps://doi.org/10.70675/d776add6z1077z4370zb245z8c88f0ecce30openalex-snapshot
Guaranteed control synthesis for switched space-time dynamical systems
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.