On the public citation graph
Computing abstractions of infinite state systems compositionally and automatically
0 signed · 143 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-56922-7_39openalex-snapshot
Generation of reduced models for checking fragments of CTL
inferredcites →https://doi.org/10.1007/3-540-56922-7_7openalex-snapshot
A tool for symbolic program verification and abstraction
inferredcites →https://doi.org/10.1007/3-540-58085-9_75openalex-snapshot
Proof-checking a data link protocol
inferredcites →https://doi.org/10.1007/3-540-58179-0_75openalex-snapshot
Model checking using adaptive state and data abstraction
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-60630-0_1openalex-snapshot
Combining model checking and deduction for I/O- automata
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-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
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/bfb0031822openalex-snapshot
Automatic generation of invariants in processor verification
inferredcites →https://doi.org/10.1007/s004460050059openalex-snapshot
Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1016/s0304-3975(96)00191-0openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1017/cbo9780511721625openalex-snapshot
Algebraic Specification of Communication Protocols
inferredcites →https://doi.org/10.1023/a:1008744030390openalex-snapshot
Automatic Generation of Invariants
inferredcites →https://doi.org/10.1109/32.345827openalex-snapshot
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
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/9780470611012.ch10openalex-snapshot
Modeling and Verification of Real‐Time Systems using the IF Toolset
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/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/10722167_25openalex-snapshot
Induction in Compositional Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_33openalex-snapshot
Syntactic Program Transformations for Automatic Abstraction
inferred← citeshttps://doi.org/10.1007/10722167_38openalex-snapshot
Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification
inferred← citeshttps://doi.org/10.1007/10722167_41openalex-snapshot
IF: A Validation Environment for Timed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/10722468_10openalex-snapshot
Correctness by Construction: Towards Verification in Hierarchical System Development
inferred← citeshttps://doi.org/10.1007/10722468_12openalex-snapshot
Abstraction of Communication Channels in Promela: A Case Study
inferred← citeshttps://doi.org/10.1007/10722468_15openalex-snapshot
Using Runtime Analysis to Guide Model Checking of Java Programs
inferred← citeshttps://doi.org/10.1007/11415787_2openalex-snapshot
Visualising Larger State Spaces in Pro B
inferred← citeshttps://doi.org/10.1007/11768869_5openalex-snapshot
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
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/11901914_27openalex-snapshot
Predicate Abstraction of Programs with Non-linear Computation
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_9openalex-snapshot
Foundations of the Bandera Abstraction Tools
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_14openalex-snapshot
Construction of Finite Labelled Transition Systems from B Abstract Systems
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_20openalex-snapshot
An Approach to Symbolic Test Generation
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_22openalex-snapshot
Predicate Diagrams for the Verification of Reactive Systems
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-44585-4_14openalex-snapshot
Model Checking with Formula-Dependent Abstract Models
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-44618-4_15openalex-snapshot
Reachability Analysis for Some Models of Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_29openalex-snapshot
Abstraction-Based Model Checking Using Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_3openalex-snapshot
Using Decision Procedures with a Higher-Order Logic
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_8openalex-snapshot
Verification experiments on the MASCARA protocol
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_20openalex-snapshot
Finding Feasible Counter-examples when Model Checking Abstracted Java Programs
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_8openalex-snapshot
Incremental Verification by Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_9openalex-snapshot
A Technique for Invariant Generation
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_2openalex-snapshot
Theorem Proving for Verification
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_28openalex-snapshot
Refinement of LTL Formulas for Abstract Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_29openalex-snapshot
Making Abstract Model Checking Strongly Preserving
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-46419-0_15openalex-snapshot
FMona: A Tool for Expressing Validation Techniques over Infinite State Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_19openalex-snapshot
If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-48234-2_1openalex-snapshot
Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_11openalex-snapshot
State Space Reduction Based on Live Variables Analysis
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_15openalex-snapshot
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
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-49059-0_15openalex-snapshot
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot
The Need for Compositional Proof Systems: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_25openalex-snapshot
Formally Verifying Data and Control with Weak Reachability Invariants
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-0-387-35533-7_23openalex-snapshot
From Refutation to Verification
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-1-4615-4493-7_3openalex-snapshot
Symbolic Abstractions of Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-56157-8_12openalex-snapshot
A Pre-processing Tool for Z2SAL to Broaden Support for Model Checking Z Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_15openalex-snapshot
Certifying Temporal Properties for Compiled C Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_8openalex-snapshot
State/Event-Based Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_24openalex-snapshot
Forward Reachability Analysis of Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_25openalex-snapshot
Lazy Approximation for Dense Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39878-3_13openalex-snapshot
Developing High Assurance Systems: On the Role of Software Tools
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_15openalex-snapshot
Incremental Derivation of Abstraction Relations for Data Refinement
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-45236-2_31openalex-snapshot
Computing Meta-transitions for Linear Transition Systems with Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_82openalex-snapshot
Formula-Dependent Abstraction for CTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_7openalex-snapshot
Compositional Verification for Component-Based Systems and Application
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_16openalex-snapshot
Smaller Abstractions for ∀CTL* without Next
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/bfb0028771openalex-snapshot
InVeSt : A tool for the verification of invariants
inferred← citeshttps://doi.org/10.1007/bfb0055332openalex-snapshot
On the need for practical formal methods
inferred← citeshttps://doi.org/10.1007/bfb0098007openalex-snapshot
Mechanical verification of a garbage collector
inferred← citeshttps://doi.org/10.1007/s00165-004-0040-yopenalex-snapshot
A generalized semantics of PROMELA for abstract model checking
inferred← citeshttps://doi.org/10.1007/s10009-002-0091-4openalex-snapshot
A symbolic manipulator for automated verification of reactive systems with heterogeneous data types
inferred← citeshttps://doi.org/10.1007/s10009-011-0205-yopenalex-snapshot
Abstract regular (tree) model checking
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/b978-044450228-5/50028-xopenalex-snapshot
IF: An Intermediate Representation for SDL and its Applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.009openalex-snapshot
Towards the hierarchical verification of reactive systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00188-4openalex-snapshot
Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00263-4openalex-snapshot
Automated validation of distributed software using the IF environment
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(04)80478-xopenalex-snapshot
Predicate Abstraction for Dense Real-Time Systems1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096 and by NASA Langley Research Center under contract B09060051 and Cooperative Agreement NCC-1-399 with Honeywell Minneapolis. Most of this…
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: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/32.940728openalex-snapshot
Formal analysis of a space-craft controller using SPIN
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/compsac.2014.28openalex-snapshot
Counterexample-Guided Abstraction Refinement for Component-Based Systems
inferred← citeshttps://doi.org/10.1109/contel.2005.185971openalex-snapshot
Predicate abstraction in protocol verification
inferred← citeshttps://doi.org/10.1109/dasc.1999.822091openalex-snapshot
Abstracting formal specifications to generate software tests via model checking
inferred← citeshttps://doi.org/10.1109/dasc.2000.886892openalex-snapshot
Analysis of real-time code by model checking
inferred← citeshttps://doi.org/10.1109/ecbs.2006.46openalex-snapshot
Model checking procedures for infinite state systems
inferred← citeshttps://doi.org/10.1109/icicos48119.2019.8982426openalex-snapshot
Verification of a Rule-Based Expert System by Using SAL Model Checker
inferred← citeshttps://doi.org/10.1109/icse.2001.919092openalex-snapshot
Tool-supported program abstraction for finite-state verification
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213432openalex-snapshot
Verification of real-time systems by abstraction of time constraints
inferred← citeshttps://doi.org/10.1109/iri.2016.38openalex-snapshot
Support for Model Checking Z Specifications
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.2003.1210091openalex-snapshot
Combining ACL2 and a /spl nu/-calculus model-checker to verify system-level designs
inferred← citeshttps://doi.org/10.1109/nca.2001.962542openalex-snapshot
Automated validation of distributed software using the IF environment
inferred← citeshttps://doi.org/10.1109/tase.2010.27openalex-snapshot
Compositional Abstraction Refinement for Timed Systems
inferred← citeshttps://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferred← citeshttps://doi.org/10.1155/2014/703098openalex-snapshot
Compositional Abstraction Refinement for Component-Based Systems
inferred← citeshttps://doi.org/10.1186/s40411-016-0027-4openalex-snapshot
Distinguishing extended finite state machine configurations using predicate abstraction
inferred← citeshttps://doi.org/10.15388/informatica.2007.178openalex-snapshot
Formal Verification for C Program
inferred← citeshttps://doi.org/10.21236/ada441311openalex-snapshot
SAT-Based Predicate Abstraction of Programs
inferred← citeshttps://doi.org/10.31274/etd-180810-2213openalex-snapshot
Dynamic abstraction model checking
inferred← citeshttps://doi.org/10.4108/infoscale.2007.906openalex-snapshot
A Compositional Symbolic Verification Framework for Concurrent Software
inferred← citeshttps://doi.org/10.4204/eptcs.40.3openalex-snapshot
An Abstraction Theory for Qualitative Models of Biological Systems
inferred← citeshttps://doi.org/10.5555/1366804.1366905openalex-snapshot
A compositional symbolic verification framework for concurrent software
inferred← citeshttps://doi.org/10.6028/nist.ir.6405openalex-snapshot
Abstracting formal specifications to generate software tests via model checking
inferred← citeshttps://doi.org/10.6028/nist.ir.6777openalex-snapshot
Model checkers in software testing
inferred← citeshttps://doi.org/10.7146/brics.v7i38.20204openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs
inferred← citeshttps://doi.org/10.7146/brics.v8i44.21704openalex-snapshot
Predicate Abstraction for Dense Real-Time 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.