On the public citation graph

TLA+ model checking made symbolic

0 signed · 124 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11532231_20openalex-snapshot
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
inferredcites →https://doi.org/10.1007/3-540-44798-9openalex-snapshot
Correct Hardware Design and Verification Methods
inferredcites →https://doi.org/10.1007/3-540-45657-0_29openalex-snapshot
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-48119-2_22openalex-snapshot
Météor: A Successful Application of B in a Large Project
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6_4openalex-snapshot
The SMV System
inferredcites →https://doi.org/10.1007/978-1-4842-3829-5openalex-snapshot
Practical TLA+
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_15openalex-snapshot
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_20openalex-snapshot
Communication-Closed Asynchronous Protocols
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_22openalex-snapshot
The nuXmv Symbolic Model Checker
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_10openalex-snapshot
A Decision Procedure for Sets, Binary Relations and Partial Functions
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_29openalex-snapshot
The Kind 2 Model Checker
inferredcites →https://doi.org/10.1007/978-3-319-63046-5_10openalex-snapshot
Relational Constraint Solving in SMT
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_7openalex-snapshot
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq
inferredcites →https://doi.org/10.1007/978-3-319-91271-4_6openalex-snapshot
A Translation from Alloy to B
inferredcites →https://doi.org/10.1007/978-3-319-91271-4_7openalex-snapshot
Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
inferredcites →https://doi.org/10.1007/978-3-540-30569-9_3openalex-snapshot
The Spec# Programming System: An Overview
inferredcites →https://doi.org/10.1007/978-3-540-71209-1_49openalex-snapshot
Kodkod: A Relational Model Finder
inferredcites →https://doi.org/10.1007/978-3-540-74591-4_18openalex-snapshot
Source-Level Proof Reconstruction for Interactive Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_2openalex-snapshot
VCC: A Practical System for Verifying Concurrent C
inferredcites →https://doi.org/10.1007/978-3-642-11319-2_27openalex-snapshot
Collections, Cardinalities, and Relations
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_12openalex-snapshot
Relational Reasoning via SMT Solving
inferredcites →https://doi.org/10.1007/978-3-642-28717-6_23openalex-snapshot
Automatic Verification of TLA + Proof Obligations with SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-30729-4_3openalex-snapshot
Translating TLA + to B for Validation with ProB
inferredcites →https://doi.org/10.1007/978-3-642-32759-9_31openalex-snapshot
Validating B,Z and TLA + Using ProB and Kodkod
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_48openalex-snapshot
The TAMARIN Prover for the Symbolic Analysis of Security Protocols
inferredcites →https://doi.org/10.1007/978-3-642-54013-4_10openalex-snapshot
A Logic-Based Framework for Verifying Consensus Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-43652-3_3openalex-snapshot
Why Amazon Chose TLA +
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0055631openalex-snapshot
Reduction in TLA
inferredcites →https://doi.org/10.1007/s00165-014-0302-2openalex-snapshot
A practical comparison of Alloy and Spin
inferredcites →https://doi.org/10.1007/s00446-002-0070-8openalex-snapshot
Disk Paxos
inferredcites →https://doi.org/10.1007/s10009-007-0063-9openalex-snapshot
ProB: an automated analysis toolset for the B method
inferredcites →https://doi.org/10.1007/s10703-017-0297-4openalex-snapshot
Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
inferredcites →https://doi.org/10.1007/s10817-013-9278-5openalex-snapshot
Extending Sledgehammer with SMT Solvers
inferredcites →https://doi.org/10.1016/0011-684x(86)90240-6openalex-snapshot
Systematic software development using VDM
inferredcites →https://doi.org/10.1016/0141-9331(94)90007-8openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1016/0890-5401(89)90066-7openalex-snapshot
A proof of the Kahn principle for input/output automata
inferredcites →https://doi.org/10.1016/j.scico.2017.05.009openalex-snapshot
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems
inferredcites →https://doi.org/10.1016/j.scico.2017.08.003openalex-snapshot
A machine-checked correctness proof for Pastry
inferredcites →https://doi.org/10.1016/j.scico.2017.09.004openalex-snapshot
Encoding TLA+ into unsorted and many-sorted first-order logic
inferredcites →https://doi.org/10.1016/j.tcs.2018.07.001openalex-snapshot
Theoretical aspects of computing
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/modre.2018.00008openalex-snapshot
A Comparison of the Declarative Modelling Languages B, Dash, and TLA+
inferredcites →https://doi.org/10.1145/1132863.1132867openalex-snapshot
Consensus on transaction commit
inferredcites →https://doi.org/10.1145/1755913.1755950openalex-snapshot
The next 700 BFT protocols
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions
inferredcites →https://doi.org/10.1145/2185376.2185383openalex-snapshot
Using lightweight modeling to understand chord
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/2517349.2517350openalex-snapshot
There is more consensus in Egalitarian parliaments
inferredcites →https://doi.org/10.1145/2699417openalex-snapshot
How Amazon web services uses formal methods
inferredcites →https://doi.org/10.1145/2737924.2737958openalex-snapshot
Verdi: a framework for implementing and formally verifying distributed systems
inferredcites →https://doi.org/10.1145/2837614.2837650openalex-snapshot
PSync: a partially synchronous language for fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2908080.2908129openalex-snapshot
Cardinalities and universal quantifiers for verifying parameterized systems
inferredcites →https://doi.org/10.1145/2914770.2837650openalex-snapshot
PSync: a partially synchronous language for fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/2933575.2935310openalex-snapshot
Proving Liveness of Parameterized Programs
inferredcites →https://doi.org/10.1145/2950290.2950318openalex-snapshot
Lightweight specification and analysis of dynamic systems with rich configurations
inferredcites →https://doi.org/10.1145/2980983.2908129openalex-snapshot
Cardinalities and universal quantifiers for verifying parameterized systems
inferredcites →https://doi.org/10.1145/3068608openalex-snapshot
IronFleet
inferredcites →https://doi.org/10.1145/3093333.3009860openalex-snapshot
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
inferredcites →https://doi.org/10.1145/3140568openalex-snapshot
Paxos made EPR: decidable reasoning about distributed protocols
inferredcites →https://doi.org/10.1145/3158116openalex-snapshot
Programming and proving with distributed protocols
inferredcites →https://doi.org/10.1145/3290372openalex-snapshot
Pretend synchrony: synchronous verification of asynchronous distributed programs
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.2200/s00236ed1v01y201004dct002openalex-snapshot
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
inferredcites →https://doi.org/10.23638/lmcs-14(4:12)2018openalex-snapshot
Reasoning with Finite Sets and Cardinality Constraints in SMT
inferredcites →https://doi.org/10.4204/eptcs.161.13openalex-snapshot
Model Checking Paxos in Spin
inferredcites →https://doi.org/10.48550/arxiv.1608.06696openalex-snapshot
Flexible Paxos: Quorum intersection revisited
inferredcites →https://doi.org/10.5860/choice.34-3906openalex-snapshot
The B-book: assigning programs to meanings
inferredcites →https://doi.org/10.5860/choice.44-2746openalex-snapshot
Software abstractions: logic, language and analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_11openalex-snapshot
Tutorial: Parameterized Verification with Byzantine Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-61362-4_27openalex-snapshot
Tendermint Blockchain Synchronization: Formal Specification and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_21openalex-snapshot
Cutoffs for Symmetric Point-to-Point Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_8openalex-snapshot
A Case Study on Parametric Verification of Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-030-85248-1_7openalex-snapshot
Improving SMT Solver Integrations for the Validation of B and Event-B Models
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_6openalex-snapshot
Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_7openalex-snapshot
Symbolic Model Checking for TLA+ Made Faster
inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_17openalex-snapshot
Extending PlusCal for Modeling Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_4openalex-snapshot
mypyvy: A Research Platform for Verification of Transition Systems in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_14openalex-snapshot
Specifications are Preferably Amenable to Proof and Animation
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_9openalex-snapshot
B2SAT: A Bare-Metal Reduction of B to SAT
inferred← citeshttps://doi.org/10.1007/978-3-031-77382-2_8openalex-snapshot
Validating Traces of Distributed Programs Against TLA+ Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-93706-4_9openalex-snapshot
Reusable Formal Verification of DAG-Based Consensus Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_2openalex-snapshot
Veil: A Framework for Automated and Interactive Verification of Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_5openalex-snapshot
Deciding Serializability in Network Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-26752-8_11openalex-snapshot
Identifying Design Flaws in a Lock-Free Task Pool with TLA+
inferred← citeshttps://doi.org/10.1007/978-3-032-26752-8_6openalex-snapshot
Verifying Properties of State-Based Models Using Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_12openalex-snapshot
Artificial Incorrectness: SMT and LLMs in Hardware Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-032-28187-6_6openalex-snapshot
Formal Modeling of Beefy, a Protocol for Supporting Light Clients
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_8openalex-snapshot
The TLA+ Model Checker Apalache
inferred← citeshttps://doi.org/10.1007/s10009-022-00682-yopenalex-snapshot
SMT solving for the validation of B and Event-B models
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102361openalex-snapshot
Extracting symbolic transitions from TLA+ specifications
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103178openalex-snapshot
Encoding TLA+ proof obligations safely for SMT
inferred← citeshttps://doi.org/10.1109/access.2023.3325349openalex-snapshot
A Model of Design for Computing Systems: A Categorical Approach
inferred← citeshttps://doi.org/10.1109/compsac51774.2021.00176openalex-snapshot
A Framework for the Composition of IoT and CPS Capabilities
inferred← citeshttps://doi.org/10.1109/e-tems53558.2022.9944422openalex-snapshot
Well-being as a Composite Capability in the Smart Building Domain: A Formal and Technical Study
inferred← citeshttps://doi.org/10.1109/formalise66629.2025.00020openalex-snapshot
Verifying Multiple TLA+ Configurations with Blast
inferred← citeshttps://doi.org/10.1109/icbc54727.2022.9805487openalex-snapshot
Verifying Payment Channels with TLA+
inferred← citeshttps://doi.org/10.1109/icbc64466.2025.11114615openalex-snapshot
Combating Reentrancy Bugs on Sharded Blockchains
inferred← citeshttps://doi.org/10.1109/icse-seip58684.2023.00006openalex-snapshot
Understanding Inconsistency in Azure Cosmos DB with TLA+
inferred← citeshttps://doi.org/10.1109/icst62969.2025.10989026openalex-snapshot
Accessible Smart Contracts Verification: Synthesizing Formal Models with Tamed LLMs
inferred← citeshttps://doi.org/10.1109/khpiweek53812.2021.9570055openalex-snapshot
Iterative Approach to TLC Model Checker Application
inferred← citeshttps://doi.org/10.1109/srds55811.2022.00018openalex-snapshot
Compositional Model Checking of Consensus Protocols via Interaction-Preserving Abstraction
inferred← citeshttps://doi.org/10.1134/s0361768822040053openalex-snapshot
Information Flow Control in Software DB Units Based on Formal Verification
inferred← citeshttps://doi.org/10.1134/s0361768823040114openalex-snapshot
Scenario of Information Flow Analysis Implementation in PL/SQL Program Units with PLIF Platform
inferred← citeshttps://doi.org/10.1145/3471871.3472963openalex-snapshot
Graft: general purpose raft consensus in Elixir
inferred← citeshttps://doi.org/10.1145/3490387openalex-snapshot
Verification of Distributed Systems via Sequential Emulation
inferred← citeshttps://doi.org/10.1145/3497775.3503688openalex-snapshot
Formal verification of a distributed dynamic reconfiguration protocol
inferred← citeshttps://doi.org/10.1145/3559744.3559747openalex-snapshot
Fully-Tested code generation from TLA+ specifications
inferred← citeshttps://doi.org/10.1145/3591247openalex-snapshot
Psym: Efficient Symbolic Exploration of Distributed Systems
inferred← citeshttps://doi.org/10.1145/3639257openalex-snapshot
Optimizing Distributed Protocols with Query Rewrites
inferred← citeshttps://doi.org/10.1145/3662158.3662783openalex-snapshot
TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
inferred← citeshttps://doi.org/10.1145/3830418.3843876openalex-snapshot
I3DP: Neuro-Symbolic Inductive Invariant Inference for Distributed Protocols
inferred← citeshttps://doi.org/10.14393/ufu.di.2022.596openalex-snapshot
Algoritmo multicast generalizado: formalização e validação
inferred← citeshttps://doi.org/10.19153/cleiej.26.1.6openalex-snapshot
On the specification and verification of the PCR parallel programming pattern in TLA+
inferred← citeshttps://doi.org/10.31857/s0132347423040118openalex-snapshot
SCENARIO OF INFORMATION FLOW ANALYSIS IMPLEMENTATION IN PL/SQL PROGRAM UNITS WITH PLIF PLATFORM
inferred← citeshttps://doi.org/10.4204/eptcs.310.6openalex-snapshot
The TLA+ Toolbox
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:17)2023openalex-snapshot
A case study on parametric verification of failure detectors
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:5)2023openalex-snapshot
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07031openalex-snapshot
A Tendermint Light Client
inferred← citeshttps://doi.org/10.70675/a2dffa62ze7f1z4c49z98d9zd40738eb4b81openalex-snapshot
Definitions and Detection Procedures of Timing Anomalies for the Formal Verification of Predictability in Real-Time Systems
inferred← citeshttps://doi.org/10.70675/a56b1bcez2a44z4e4az8e69zeec71287c91copenalex-snapshot
Toward a Framework for the Composition and Assessment of IoT and CPS Capabilities : Smart Cities Applications
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.