On the public citation graph
Verification, Model Checking, and Abstract Interpretation
0 signed · 61 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.1007/3-540-58027-1_27openalex-snapshot
Ultimately periodic words of rational ω-languages
inferredcites →https://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferredcites →https://doi.org/10.1007/978-1-4612-0171-7openalex-snapshot
Automata Theory and its Applications
inferredcites →https://doi.org/10.1007/978-3-030-17462-0_23openalex-snapshot
ROLL 1.0: $$\omega $$ -Regular Language Learning Library
inferredcites →https://doi.org/10.1007/978-3-030-24886-4_15openalex-snapshot
Coinductive Algorithms for Büchi Automata
inferredcites →https://doi.org/10.1007/978-3-030-32304-2_8openalex-snapshot
Language Inclusion Algorithms as Complete Abstract Interpretations
inferredcites →https://doi.org/10.1007/978-3-030-59152-6_26openalex-snapshot
Proving Non-inclusion of Büchi Automata Based on Monte Carlo Sampling
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_4openalex-snapshot
Automata Theory and Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-46520-3_8openalex-snapshot
Spot 2.0 — A Framework for LTL and $$\omega $$ -Automata Manipulation
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_30openalex-snapshot
Ultimate Automizer and the Search for Perfect Interpolants
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_17openalex-snapshot
Efficient Büchi Universality Checking
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_14openalex-snapshot
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing
inferredcites →https://doi.org/10.1007/978-3-642-23217-6_13openalex-snapshot
Advanced Ramsey-Based Büchi Automata Inclusion Testing
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_2openalex-snapshot
Software Model Checking for People Who Love Automata
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_62openalex-snapshot
GOAL for Games, Omega-Automata, and Logics
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferredcites →https://doi.org/10.1016/j.ic.2020.104678openalex-snapshot
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
inferredcites →https://doi.org/10.1016/s0079-8169(04)x8001-6openalex-snapshot
Infinite Words - Automata, Semigroups, Logic and Games
inferredcites →https://doi.org/10.1145/2429069.2429124openalex-snapshot
Checking NFA equivalence with bisimulations up to congruence
inferredcites →https://doi.org/10.1145/2603088.2603127openalex-snapshot
Abstract interpretation from Büchi automata
inferredcites →https://doi.org/10.1145/2713167openalex-snapshot
Hacking nondeterminism with induction and coinduction
inferredcites →https://doi.org/10.1145/3462673openalex-snapshot
Complete Abstractions for Checking Language Inclusion
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.2168/lmcs-10(4:13)2014openalex-snapshot
State of B\"uchi Complementation
inferredcites →https://doi.org/10.23638/lmcs-15(1:12)2019openalex-snapshot
Efficient reduction of nondeterministic automata with application to language inclusion testing
inferredcites →https://doi.org/10.3233/fi-2012-744openalex-snapshot
An Improved Construction of Deterministic Omega-automaton Using Derivatives
inferredcites →https://doi.org/10.46298/lmcs-20(3:12)2024openalex-snapshot
Decidability for Sturmian words
inferredcites →https://doi.org/10.48550/arxiv.2102.01727openalex-snapshot
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi 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/rob.21695openalex-snapshot
Experimental Evaluation and Formal Analysis of High‐Level Tasks with Dynamic Obstacle Anticipation on a Full‐Sized Autonomous Vehicle
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/s10009-010-0141-2openalex-snapshot
An embeddable virtual machine for state space generation
inferred← citeshttps://doi.org/10.1007/s10990-009-9046-8openalex-snapshot
A minimalistic look at widening operators
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2022.03.004openalex-snapshot
Secure-by-construction synthesis of cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.008openalex-snapshot
Parameterised verification for multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.10.019openalex-snapshot
Distributed Verification of Multi-threaded C++ Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.010openalex-snapshot
A Note on the Inversion Join for Polyhedral Analysis
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.059openalex-snapshot
Formal Synthesis of Safe Stop Tactical Planners for an Automated Vehicle
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106504openalex-snapshot
Context-Oriented Behavioral Programming
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100906openalex-snapshot
On algebraic array theories
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.100978openalex-snapshot
Succinct ordering and aggregation constraints in algebraic array theories
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.07.009openalex-snapshot
A vertex centric parallel algorithm for linear temporal logic model checking in Pregel
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.049openalex-snapshot
Tropical linear-fractional programming and parametric mean payoff games
inferred← citeshttps://doi.org/10.1016/j.robot.2023.104404openalex-snapshot
Correct and efficient UAV missions based on temporal planning and in-flight hybrid simulations
inferred← citeshttps://doi.org/10.1016/j.scico.2010.07.004openalex-snapshot
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103116openalex-snapshot
Synthesizing LTL contracts from component libraries using rich counterexamples
inferred← citeshttps://doi.org/10.1049/iet-cta.2014.0611openalex-snapshot
Concurrent multi‐agent systems with temporal logic objectives: game theoretic analysis and planning through negotiation
inferred← citeshttps://doi.org/10.1109/access.2013.2295764openalex-snapshot
A Contract-Based Methodology for Aircraft Electric Power System Design
inferred← citeshttps://doi.org/10.1109/ssrr56537.2022.10018728openalex-snapshot
Leveraging Heterogeneous Capabilities in Multi-Agent Systems for Environmental Conflict Resolution
inferred← citeshttps://doi.org/10.1109/tro.2012.2214558openalex-snapshot
Explaining Impossible High-Level Robot Behaviors
inferred← citeshttps://doi.org/10.1145/3158098openalex-snapshot
Foundations for natural proofs and quantifier instantiation
inferred← citeshttps://doi.org/10.1145/3558003openalex-snapshot
BullsEye : Scalable and Accurate Approximation Framework for Cache Miss Calculation
inferred← citeshttps://doi.org/10.1145/3566054openalex-snapshot
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration
inferred← citeshttps://doi.org/10.1186/1471-2105-13-s17-s15openalex-snapshot
Improved statistical model checking methods for pathway analysis
inferred← citeshttps://doi.org/10.15607/rss.2018.xiv.031openalex-snapshot
Improving Multi-Robot Behavior Using Learning-Based Receding Horizon Task Allocation
inferred← citeshttps://doi.org/10.1561/2600000029openalex-snapshot
Formal Methods for Autonomous Systems
inferred← citeshttps://doi.org/10.2514/6.2011-6667openalex-snapshot
Formal Modeling, Design, and Verification Techniques for a Complex, Cooperative UAV Monitoring Task
inferred← citeshttps://doi.org/10.3233/fi-2020-1993openalex-snapshot
Selective Unification in (Constraint) Logic Programming*
inferred← citeshttps://doi.org/10.3390/drones9050353openalex-snapshot
Unified Monitor and Controller Synthesis for Securing Complex Unmanned Aircraft 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.