On the public citation graph
Generating finite-state abstractions of reactive systems using decision procedures
0 signed · 112 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-58043-3_22openalex-snapshot
Temporal verification of simulation and refinement
inferredcites →https://doi.org/10.1007/3-540-60045-0_40openalex-snapshot
Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving
inferredcites →https://doi.org/10.1007/3-540-60045-0_66openalex-snapshot
Verification of real-time systems by successive over and under approximation
inferredcites →https://doi.org/10.1007/3-540-60973-3_113openalex-snapshot
Experiments in theorem proving and model checking for protocol verification
inferredcites →https://doi.org/10.1007/3-540-61474-5_92openalex-snapshot
STeP: Deductive-algorithmic verification of reactive and real-time systems
inferredcites →https://doi.org/10.1007/3-540-63104-6_13openalex-snapshot
A practical integration of first-order reasoning and decision procedures
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/3-540-63166-6_5openalex-snapshot
Automatic abstraction techniques for propositional μ-calculus model checking
inferredcites →https://doi.org/10.1007/978-1-4612-4222-2openalex-snapshot
Temporal Verification of Reactive Systems
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0035403openalex-snapshot
The bounded retransmission protocol must be on time!
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0304-3975(96)00191-0openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1142/9789812831583_0007openalex-snapshot
Approximations for verifying timing properties
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.6100/ir462072openalex-snapshot
Abstract interpretation and partition refinement for 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/10692867_13openalex-snapshot
Abstraction and Modular Verification of Infinite-State Reactive Systems
inferred← citeshttps://doi.org/10.1007/10720084_11openalex-snapshot
Combinations of Model Checking and Theorem Proving
inferred← citeshttps://doi.org/10.1007/10721959_6openalex-snapshot
A Framework for Cooperating Decision Procedures
inferred← citeshttps://doi.org/10.1007/10722167_33openalex-snapshot
Syntactic Program Transformations for Automatic Abstraction
inferred← citeshttps://doi.org/10.1007/10722468_12openalex-snapshot
Abstraction of Communication Channels in Promela: A Case Study
inferred← citeshttps://doi.org/10.1007/11537328_9openalex-snapshot
Symbolic Model Checking for Asynchronous Boolean Programs
inferred← citeshttps://doi.org/10.1007/11691372_16openalex-snapshot
Approximating Predicate Images for Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/11784180_13openalex-snapshot
State Space Reduction of Rewrite Theories Using Invisible Transitions
inferred← citeshttps://doi.org/10.1007/11817963_15openalex-snapshot
Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
inferred← citeshttps://doi.org/10.1007/11925040_7openalex-snapshot
Accurate Theorem Proving for Program Verification
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_2openalex-snapshot
Counter-Example Based Predicate Discovery in Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44518-8_16openalex-snapshot
Symbolic Analysis of Transition Systems?
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_1openalex-snapshot
Combining Theorem Proving and Model Checking through Symbolic Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44914-0_1openalex-snapshot
Partial Completeness of Abstract Fixpoint Checking
inferred← citeshttps://doi.org/10.1007/3-540-45139-0_3openalex-snapshot
Model-checking in finite state-space systems with fine-grained abstractions using SPIN
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_8openalex-snapshot
Incremental Verification by Abstraction
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-46017-9_4openalex-snapshot
Abstraction in Software Model Checking: Principles and Practice
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_16openalex-snapshot
Experience with Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_38openalex-snapshot
Abstract and Model Check while You Prove
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_13openalex-snapshot
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_5openalex-snapshot
Visual Abstractions for Temporal Verification
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_16openalex-snapshot
Automated verification using deduction, exploration, and abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4020-8052-4_7openalex-snapshot
Highlevel Verification of Control Intensive Systems Using Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4020-8157-6_23openalex-snapshot
Static Program Transformations for Efficient Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_30openalex-snapshot
Refining Approximations in Software Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-31959-7_8openalex-snapshot
Theoroidal Maps as Algebraic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_40openalex-snapshot
SATABS: SAT-Based Predicate Abstraction for ANSI-C
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_15openalex-snapshot
Semi-formal Verification of Memory Systems by Symbolic Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_4openalex-snapshot
Abstraction as the Key for Invariant Verification
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_14openalex-snapshot
Making Predicate Abstraction Efficient:
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_38openalex-snapshot
Strengthening Invariants by Symbolic Consistency Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_20openalex-snapshot
Model Checking Guided Abstraction and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-72912-9_5openalex-snapshot
Model Checking with Abstraction for Web Services
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_13openalex-snapshot
Constraint-Based Invariant Inference over Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_7openalex-snapshot
Abstract Model Checking without Computing the Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_16openalex-snapshot
Diagnosing Abstraction Failure for Separation Logic–Based Analyses
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_28openalex-snapshot
Termination Proofs for Linear Simple Loops
inferred← citeshttps://doi.org/10.1007/978-3-7091-6355-9_13openalex-snapshot
An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_9openalex-snapshot
Abstractions and Reductions in Model Checking
inferred← citeshttps://doi.org/10.1007/s10009-009-0106-5openalex-snapshot
Model checking C source code for embedded systems
inferred← citeshttps://doi.org/10.1007/s10009-011-0185-yopenalex-snapshot
An abstraction refinement approach combining precise and approximated techniques
inferred← citeshttps://doi.org/10.1007/s10009-013-0288-8openalex-snapshot
Termination proofs for linear simple loops
inferred← citeshttps://doi.org/10.1007/s10703-005-1490-4openalex-snapshot
Verifying Time Partitioning in the DEOS Scheduling Kernel
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/s11219-011-9161-8openalex-snapshot
B model slicing and predicate abstraction to generate tests
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.050openalex-snapshot
Verification of Boolean programs with unbounded thread creation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00088-8openalex-snapshot
Deductive verification of real-time systems using STeP
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80400-6openalex-snapshot
Predicate Abstraction and Refinement for Model Checking VHDL State Machines
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80004-0openalex-snapshot
Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach
inferred← citeshttps://doi.org/10.1023/a:1008700623084openalex-snapshot
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
inferred← citeshttps://doi.org/10.1023/a:1020883625495openalex-snapshot
Lightweight Reasoning about Program Correctness
inferred← citeshttps://doi.org/10.1023/a:1024480913162openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1023/b:form.0000040025.89719.f3openalex-snapshot
Predicate Abstraction of ANSI-C Programs Using SAT
inferred← citeshttps://doi.org/10.1023/b:form.0000040026.56959.91openalex-snapshot
Efficient Verification of Sequential and Concurrent C Programs
inferred← citeshttps://doi.org/10.1109/access.2021.3093211openalex-snapshot
Simulation-Based Invariant Verification Technique for the OTS/CafeOBJ Method
inferred← citeshttps://doi.org/10.1109/ase.1999.802128openalex-snapshot
Modular and incremental analysis of concurrent software systems
inferred← citeshttps://doi.org/10.1109/contel.2005.185971openalex-snapshot
Predicate abstraction in protocol verification
inferred← citeshttps://doi.org/10.1109/ecbs.2006.46openalex-snapshot
Model checking procedures for infinite state systems
inferred← citeshttps://doi.org/10.1109/fmcad.2006.2openalex-snapshot
A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification
inferred← citeshttps://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210089openalex-snapshot
High level verification of control intensive systems using predicate abstraction
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487900openalex-snapshot
Formal verification of SystemC by automatic hardware/software partitioning
inferred← citeshttps://doi.org/10.1145/1529282.1529404openalex-snapshot
The synergy of precise and fast abstractions for program verification
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.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferred← citeshttps://doi.org/10.1155/2018/3193974openalex-snapshot
An SAT‐Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20505openalex-snapshot
Linear-Time Verification of Data-Aware Dynamic Systems with Arithmetic
inferred← citeshttps://doi.org/10.21236/ada441311openalex-snapshot
SAT-Based Predicate Abstraction of Programs
inferred← citeshttps://doi.org/10.29007/npn7openalex-snapshot
Automated Invariant Generation for the Verification of Real-Time Systems
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3093openalex-snapshot
Program analysis : termination proofs for Linear Simple Loops
inferred← citeshttps://doi.org/10.4204/eptcs.10.3openalex-snapshot
Automated Predicate Abstraction for Real-Time Models
inferred← citeshttps://doi.org/10.4204/eptcs.28.3openalex-snapshot
Automatic Probabilistic Program Verification through Random Variable Abstraction
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.822638openalex-snapshot
Métodos formais algébricos para geração de invariantes
inferred← citeshttps://doi.org/10.5769/c2009001openalex-snapshot
Automated Malware Invariant Generation
inferred← citeshttps://doi.org/10.7146/brics.v7i38.20204openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs
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.