On the public citation graph
Verifying systems with infinite but regular state spaces
0 signed · 156 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-57208-2_17openalex-snapshot
Partial-order methods for temporal verification
inferredcites →https://doi.org/10.1007/3-540-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
inferredcites →https://doi.org/10.1007/3-540-58179-0_50openalex-snapshot
An automata-theoretic approach to branching-time model checking (Extended abstract)
inferredcites →https://doi.org/10.1007/3-540-60360-3_30openalex-snapshot
An automata-theoretic approach to Presburger arithmetic constraints
inferredcites →https://doi.org/10.1007/3-540-61064-2_27openalex-snapshot
Diophantine equations, Presburger arithmetic and finite automata
inferredcites →https://doi.org/10.1007/3-540-61474-5_53openalex-snapshot
Symbolic verification of communication protocols with infinite state spaces using QDDs
inferredcites →https://doi.org/10.1007/3-540-63166-6_18openalex-snapshot
An improved reachability analysis method for strongly linear hybrid systems (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bf00967164openalex-snapshot
Presburgerness of predicates regular in two number systems
inferredcites →https://doi.org/10.1007/bf01746527openalex-snapshot
On the base-dependence of sets of numbers recognizable by finite automata
inferredcites →https://doi.org/10.1007/bfb0032741openalex-snapshot
The power of QDDs (extended abstract)
inferredcites →https://doi.org/10.1007/bfb0055049openalex-snapshot
On the expressiveness of real and integer arithmetic automata
inferredcites →https://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
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/s1571-0661(05)80426-8openalex-snapshot
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
inferredcites →https://doi.org/10.1023/a:1008719024240openalex-snapshot
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118459898.ch5openalex-snapshot
Symbolic Model Checking for Avionics
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/10722167_8openalex-snapshot
Automatic Verification of Parameterized Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1007/11548133_24openalex-snapshot
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing
inferred← citeshttps://doi.org/10.1007/11562948_35openalex-snapshot
Flat Acceleration in Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/11812128_29openalex-snapshot
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/11817949_7openalex-snapshot
Proving Liveness by Backwards Reachability
inferred← citeshttps://doi.org/10.1007/11823230_10openalex-snapshot
Combining Widening and Acceleration in Linear Relation Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_29openalex-snapshot
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_38openalex-snapshot
Counter Machines: Decidable Properties and Applications to Verification Problems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_15openalex-snapshot
Reachability Analysis for Some Models of Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_1openalex-snapshot
Channel Representations in Protocol Verification
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_32openalex-snapshot
Unavoidable Configurations of Parameterized Rings of Processes
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_14openalex-snapshot
Beyond Regular Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_1openalex-snapshot
Representing Arithmetic Constraints with Finite Automata: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_46openalex-snapshot
Extrapolating Tree Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_9openalex-snapshot
Regular Model Checking Made Simple and Effcient*
inferred← citeshttps://doi.org/10.1007/3-540-45739-9_19openalex-snapshot
Parametric Verification of a Group Membership Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_7openalex-snapshot
Constraint-Based Model Checking for Parameterized Synchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_16openalex-snapshot
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_26openalex-snapshot
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_9openalex-snapshot
On the Existence of Network Invariants for Verifying Parameterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_3openalex-snapshot
Languages, Rewriting Systems, and Verification of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_14openalex-snapshot
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_19openalex-snapshot
Regular Hedge Model Checking
inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_17openalex-snapshot
State Explosion and Parameterised Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_13openalex-snapshot
Regular Model Checking with Regular Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_14openalex-snapshot
Simplifying Alternating Automata for Emptiness Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_5openalex-snapshot
Regular Model Checking: Evolution and Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_6openalex-snapshot
Regular Model Checking Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_7openalex-snapshot
Mata: A Fast and Simple Finite Automata Library
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_9openalex-snapshot
Regular Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_10openalex-snapshot
$$\textsf{HornStr}$$: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-032-15700-3_4openalex-snapshot
Atomic Gliders and Cellular Automata as Language Generators
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-319-67089-8_7openalex-snapshot
Model Checking CTL over Restricted Classes of Automatic Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_30openalex-snapshot
View Abstraction for Systems with Component Identities
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_41openalex-snapshot
Omega-Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_13openalex-snapshot
Verification of Java Programs Using Symbolic Execution and Invariant Generation
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_27openalex-snapshot
Regular Model Checking for LTL(MSO)
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_29openalex-snapshot
Abstract Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_12openalex-snapshot
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_2openalex-snapshot
Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_35openalex-snapshot
On Computing Reachability Sets of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_25openalex-snapshot
Algorithmic Improvements in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_2openalex-snapshot
Model Checking as Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_4openalex-snapshot
A Transformational Approach for Generating Non-linear Invariants
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_33openalex-snapshot
Monotonic Abstraction for Programs with Dynamic Memory Heaps
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_52openalex-snapshot
T(O)RMC: A Tool for (ω)-Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_4openalex-snapshot
Quantitative Separation Logic and Programs with Lists
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_54openalex-snapshot
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_16openalex-snapshot
Systematic Acceleration in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_70openalex-snapshot
A Generalization of Cobham’s Theorem to Automata over Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_1openalex-snapshot
Rewriting Systems with Data
inferred← citeshttps://doi.org/10.1007/978-3-642-02949-3_11openalex-snapshot
Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_6openalex-snapshot
Towards Model-Checking Programs with Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_26openalex-snapshot
From Model-Checking to Temporal Logic Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6openalex-snapshot
Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_23openalex-snapshot
Fast Acceleration of Ultimately Periodic Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_17openalex-snapshot
Automatic Generation of Invariants for Circular Derivations in SUP(LA)
inferred← citeshttps://doi.org/10.1007/978-3-642-29834-9_2openalex-snapshot
Reliable Contracts for Unreliable Half-Duplex Communications
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_15openalex-snapshot
When the Decreasing Sequence Fails
inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_2openalex-snapshot
Regular Model Checking Using Solver Technologies and Automata Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_15openalex-snapshot
Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/b87738openalex-snapshot
Static analysis : 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 1, 2000 : proceedings
inferred← citeshttps://doi.org/10.1007/s007660200018openalex-snapshot
Toward Automation for Model-Checking Requirements Specifications with Numeric Constraints
inferred← citeshttps://doi.org/10.1007/s10009-003-0110-0openalex-snapshot
Covering sharing trees: a compact data structure for parameterized verification
inferred← citeshttps://doi.org/10.1007/s10009-004-0151-zopenalex-snapshot
Partial-order reduction and trail improvement in directed model checking
inferred← citeshttps://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferred← citeshttps://doi.org/10.1007/s10009-011-0205-yopenalex-snapshot
Abstract regular (tree) model checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0208-8openalex-snapshot
Widening techniques for regular tree model checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0209-7openalex-snapshot
Extrapolating (omega-)regular model checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0212-zopenalex-snapshot
Regular model checking for LTL(MSO)
inferred← citeshttps://doi.org/10.1007/s10009-022-00648-0openalex-snapshot
Parameterized verification of systems with component identities, using view abstraction
inferred← citeshttps://doi.org/10.1007/s100090100049openalex-snapshot
Constraint-based deductive model checking
inferred← citeshttps://doi.org/10.1007/s10703-008-0057-6openalex-snapshot
Don’t care words with an application to the automata-based approach for real addition
inferred← citeshttps://doi.org/10.1007/s10703-012-0168-yopenalex-snapshot
Computable fixpoints in well-structured symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10703-017-0310-yopenalex-snapshot
Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
inferred← citeshttps://doi.org/10.1007/s10817-010-9179-9openalex-snapshot
Quantitative Separation Logic and Programs with Lists
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.015openalex-snapshot
Abstract Regular Tree Model Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.018openalex-snapshot
Liveness Checking as Safety Checking for Infinite State Spaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.020openalex-snapshot
On the Use of Automata-based Techniques in Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.006openalex-snapshot
Verification of programs with half-duplex communication
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.007openalex-snapshot
Permutation rewriting and algorithmic verification
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.016openalex-snapshot
Abstract acceleration in linear relation analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.008openalex-snapshot
Complete symbolic reachability analysis using back-and-forth narrowing
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.051openalex-snapshot
A generalization of Cobham’s theorem to automata over real numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.005openalex-snapshot
A novel approach to verifying context free properties of programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00268-7openalex-snapshot
Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00187-2openalex-snapshot
Regular Model Checking using Widening Techniques
inferred← citeshttps://doi.org/10.1017/s1471068406002663openalex-snapshot
Parametric Verification of a Group Membership Algorithm
inferred← citeshttps://doi.org/10.1023/a:1016372507161openalex-snapshot
Specification, Validation, and Synthesis of Email Agent Controllers: A Case Study in Function Rich Reactive System Design
inferred← citeshttps://doi.org/10.1023/a:1026276129010openalex-snapshot
Constraint-Based Verification of Parameterized Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1051/ita:2007029openalex-snapshot
Efficiency of automata in semi-commutation verification techniques
inferred← citeshttps://doi.org/10.1109/dsn.2013.6575345openalex-snapshot
A logic for model-checking mean-field models
inferred← citeshttps://doi.org/10.1109/lics.2001.932515openalex-snapshot
Permutation rewriting and algorithmic verification
inferred← citeshttps://doi.org/10.1109/pdcat.2007.83openalex-snapshot
CBX-1 Switch: An Effective Load Balanced Switch
inferred← citeshttps://doi.org/10.1109/secpri.2001.924296openalex-snapshot
Intrusion detection via static analysis
inferred← citeshttps://doi.org/10.1145/1838552.1838554openalex-snapshot
On (Omega-)regular model checking
inferred← citeshttps://doi.org/10.1145/349360.351126openalex-snapshot
Specification, validation, and synthesis of email agent controllers
inferred← citeshttps://doi.org/10.1145/351268.351298openalex-snapshot
Solving coverability problems of petri nets by partial deduction
inferred← citeshttps://doi.org/10.1145/503209.503232openalex-snapshot
Automatic abstraction for model checking software systems with interrelated numeric constraints
inferred← citeshttps://doi.org/10.1145/503271.503232openalex-snapshot
Automatic abstraction for model checking software systems with interrelated numeric constraints
inferred← citeshttps://doi.org/10.14236/ewic/vecos2007.7openalex-snapshot
Computing Transitive Closures of Hedge Transformations
inferred← citeshttps://doi.org/10.1504/ijccbs.2012.045079openalex-snapshot
Computing transitive closures of hedge transformations
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(3)-21openalex-snapshot
On the model checking of finite state transducers over semigroups
inferred← citeshttps://doi.org/10.18255/1818-1015-2016-6-741-753openalex-snapshot
On the Minimization of Finite State Trans- ducers over Semigroups
inferred← citeshttps://doi.org/10.18255/1818-1015-2018-5-506-524openalex-snapshot
On the Expressive Power of Some Extensions of Linear Temporal Logic
inferred← citeshttps://doi.org/10.21236/ada275222openalex-snapshot
Basic Research in Computer Science
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:3)2009openalex-snapshot
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102244openalex-snapshot
Learning to prove safety over parameterised concurrent systems
inferred← citeshttps://doi.org/10.3103/s0146411617070240openalex-snapshot
On the Minimization of Finite State Transducers over Semigroups
inferred← citeshttps://doi.org/10.3103/s014641161907006xopenalex-snapshot
On the Expressive Power of Some Extensions of Linear Temporal Logic
inferred← citeshttps://doi.org/10.31144/si.2307-6410.2016.n7.p33-44openalex-snapshot
ON THE MINIMIZATION AND EQUIVALENCE CHECKING OF SEQUENTIAL REACTIVE SYSTEMS
inferred← citeshttps://doi.org/10.3166/tsi.25.289-315openalex-snapshot
Contrôle de systèmes symboliques, discrets ou hybrides
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/90openalex-snapshot
On the Limits and Practice of Automatically Designing Self-Stabilization
inferred← citeshttps://doi.org/10.3929/ethz-a-005170555openalex-snapshot
Liveness checking as safety checking to find shortest counterexamples to linear time properties
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1495openalex-snapshot
Tree Regular Model Checking for Lattice-Based Automata
inferred← citeshttps://doi.org/10.48550/arxiv.2005.00990openalex-snapshot
Regular Model Checking Revisited (Technical Report)
inferred← citeshttps://doi.org/10.70675/63a98cc3z9ff1z42cdz8719zda16ae0380c0openalex-snapshot
Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés
inferred← citeshttps://doi.org/10.70675/6c9d51cbze0efz4fdezb9b8z4ddc2f8fce0fopenalex-snapshot
Subwords : automata, embedding problems, and verification
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.