On the public citation graph
InVeSt : A tool for the verification of invariants
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-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-59293-8_237openalex-snapshot
STeP: The Stanford Temporal Prover
inferredcites →https://doi.org/10.1007/3-540-60692-0_43openalex-snapshot
Verifying part of the ACCESS.bus protocol using PVS
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_80openalex-snapshot
Powerful techniques for the automatic generation of invariants
inferredcites →https://doi.org/10.1007/3-540-61474-5_91openalex-snapshot
PVS: Combining specification, proof checking, and 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/bfb0028755openalex-snapshot
Computing abstractions of infinite state systems compositionally and automatically
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.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/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
inferredcites →https://doi.org/10.21236/ada324036openalex-snapshot
STeP: The Stanford Temporal Prover,
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.1007/11513988_19openalex-snapshot
Formal Verification of Pentium ® 4 Components with Symbolic Simulation and Inductive Invariants
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-44585-4_34openalex-snapshot
TReX: A Tool for Reachability Analysis of Complex Systems
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_8openalex-snapshot
Incremental Verification by Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_2openalex-snapshot
Theorem Proving for Verification
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_16openalex-snapshot
PROSPER An Investigation into Software Architecture for Embedded Proof Engines
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-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-48683-6_15openalex-snapshot
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
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/978-0-387-35533-7_23openalex-snapshot
From Refutation to Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_11openalex-snapshot
Model-Checking Systems with Unbounded Variables without Abstraction
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-45069-6_29openalex-snapshot
Abstraction for Branching Time Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6openalex-snapshot
Automated Technology for Verification and Analysis
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-34026-0_24openalex-snapshot
A Unified Approach for Static and Runtime Verification: Framework and Applications
inferred← citeshttps://doi.org/10.1007/bfb0098007openalex-snapshot
Mechanical verification of a garbage collector
inferred← citeshttps://doi.org/10.1007/s00165-012-0223-xopenalex-snapshot
Automatic verification of reduction techniques in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/s10462-024-10824-0openalex-snapshot
A survey of safety and trustworthiness of large language models through the lens of verification and validation
inferred← citeshttps://doi.org/10.1007/s11334-011-0149-0openalex-snapshot
A monadic approach to automated reasoning for Bluespec SystemVerilog
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.005openalex-snapshot
Convincing Proofs for Program Certification
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80006-4openalex-snapshot
Automatically Verifying Concurrent Queue Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008744030390openalex-snapshot
Automatic Generation of Invariants
inferred← citeshttps://doi.org/10.1023/b:form.0000033962.51898.1aopenalex-snapshot
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
inferred← citeshttps://doi.org/10.1049/ic:19980529openalex-snapshot
Modelling and analysis of broadcasting embedded control systems
inferred← citeshttps://doi.org/10.1109/32.940728openalex-snapshot
Formal analysis of a space-craft controller using SPIN
inferred← citeshttps://doi.org/10.1109/compsac.2014.28openalex-snapshot
Counterexample-Guided Abstraction Refinement for Component-Based Systems
inferred← citeshttps://doi.org/10.1109/hldvt.2005.1568830openalex-snapshot
Formal verification of high-level conformance with symbolic simulation
inferred← citeshttps://doi.org/10.1109/icfem.1998.730581openalex-snapshot
Ubiquitous abstraction: a new approach for mechanized formal verification
inferred← citeshttps://doi.org/10.1109/ismvl.2010.12openalex-snapshot
MDGs Reduction Technique Based on the HOL Theorem Prover
inferred← citeshttps://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
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.1145/1592434.1592437openalex-snapshot
Automated deduction for verification
inferred← citeshttps://doi.org/10.1145/1745312.1745315openalex-snapshot
Verifying safety properties of concurrent heap-manipulating programs
inferred← citeshttps://doi.org/10.1155/2014/703098openalex-snapshot
Compositional Abstraction Refinement for Component-Based Systems
inferred← citeshttps://doi.org/10.14236/ewic/vecos2008.2openalex-snapshot
Multiway Decision Graphs Reduction Approach based on the HOL Theorem Prover
inferred← citeshttps://doi.org/10.5555/823453.823840openalex-snapshot
Combining ACL2 and a /spl nu/-calculus model-checker to verify system-level designs
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.