On the public citation graph
Verification of an implementation of Tomasulo's algorithm by compositional model checking
0 signed · 157 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-58179-0_44openalex-snapshot
Automatic verification of pipelined microprocessor control
inferredcites →https://doi.org/10.1007/3-540-59047-1_53openalex-snapshot
A tutorial on using PVS for hardware verification
inferredcites →https://doi.org/10.1007/3-540-63166-6_6openalex-snapshot
A compositional rule for hardware design refinement
inferredcites →https://doi.org/10.1007/978-0-387-35190-2_3openalex-snapshot
Verifying Out-of-Order Executions
inferredcites →https://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferredcites →https://doi.org/10.1007/bfb0031803openalex-snapshot
Verifying nondeterministic implementations of deterministic systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1109/cmpcon.1997.584667openalex-snapshot
The Alpha 21264: a 500 MHz out-of-order execution microprocessor
inferredcites →https://doi.org/10.1145/177492.177725openalex-snapshot
Model checking and modular verification
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1147/rd.111.0025openalex-snapshot
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
inferredcites →https://doi.org/10.1147/rd.391.0149openalex-snapshot
Verity—A formal verification program for custom CMOS circuits
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-34600-7openalex-snapshot
Abstraction Refinement for Large Scale Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_14openalex-snapshot
On the Completeness of Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/10722167_25openalex-snapshot
Induction in Compositional Model Checking
inferred← citeshttps://doi.org/10.1007/10722167_39openalex-snapshot
Verifying Advanced Microarchitectures that Support Speculation and Exceptions
inferred← citeshttps://doi.org/10.1007/10930755_2openalex-snapshot
Formal Specification and Verification of ARM6
inferred← citeshttps://doi.org/10.1007/11560548_17openalex-snapshot
Automatic Generation of Hints for Symbolic Traversal
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_9openalex-snapshot
Modeling and Verification of Out-of-Order Microprocessors in UCLID
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_22openalex-snapshot
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_11openalex-snapshot
Correctness of Pipelined Machines
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_5openalex-snapshot
Automated Refinement Checking for Asynchronous Processes
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_15openalex-snapshot
Verifying Network Protocol Implementations by Symbolic Refinement Checking
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_17openalex-snapshot
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_19openalex-snapshot
Parameterized Verification with Automatically Computed Inductive Assertions?
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_33openalex-snapshot
A Framework for Microprocessor Correctness Statements
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_7openalex-snapshot
Automatic Deductive Verification with Invisible Invariants
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_9openalex-snapshot
Liveness with (0,1, ∞)- Counter Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_33openalex-snapshot
A Comparison of Two Verification Methods for Speculative Instruction Execution
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_17openalex-snapshot
Verification of Infinite State Systems by Compositional Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_19openalex-snapshot
Hints to Accelerate Symbolic Traversal
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_3openalex-snapshot
A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_30openalex-snapshot
Circular Compositional Reasoning about Liveness
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_4openalex-snapshot
Formal Verification of Explicitly Parallel Microprocessors
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_20openalex-snapshot
Assume-Guarantee Refinement between Different Time Scales
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_7openalex-snapshot
Proof of Correctness of a Processor with Reorder Buffer Using the Completion Functions Approach
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_2openalex-snapshot
Reducing Manual Abstraction in Formal Verification of Out- of- Order Execution
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_23openalex-snapshot
Verification of Data-Insensitive Circuits: An In-Order-Retirement Case Study
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_24openalex-snapshot
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_5openalex-snapshot
The Formal Design of 1M-Gate ASICs
inferred← citeshttps://doi.org/10.1007/978-1-4419-1539-9_13openalex-snapshot
Model Checking Information Flow
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_8openalex-snapshot
Verifying Concurrent Protocols Using Refinements
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_46openalex-snapshot
Proving the Correctness of Processors with Delayed Branch Using Delayed PC
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_10openalex-snapshot
Synthesizing Environment Invariants for Modular Hardware Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-90636-8_1openalex-snapshot
Learning Assumptions for Verifying Cryptographic Protocols Compositionally
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_3openalex-snapshot
Automated Circular Assume-Guarantee Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_7openalex-snapshot
Modular Deductive Verification of Multiprocessor Hardware Designs
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_18openalex-snapshot
Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_3openalex-snapshot
End-to-End Verification of "Equation missing" Processors with ISA-Formal
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_5openalex-snapshot
Layered Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_19openalex-snapshot
Liveness with Invisible Ranking
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_36openalex-snapshot
Liveness with Incomprehensible Ranking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_10openalex-snapshot
Using Interface Refinement to Integrate Formal Verification into the Design Cycle
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_11openalex-snapshot
Indexed Predicate Discovery for Unbounded System Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_17openalex-snapshot
Compositional Specification and Model Checking in GSTE
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_9openalex-snapshot
Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_4openalex-snapshot
Live and Let Die: LSC-Based Verification of UML-Models
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_24openalex-snapshot
A Programming Language Based Analysis of Operand Forwarding
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_7openalex-snapshot
Instantiating Uninterpreted Functional Units and Memory System: Functional Verification of the VAMP
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_8openalex-snapshot
A Hazards-Based Correctness Statement for Pipelined Circuits
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_42openalex-snapshot
Functional Verification of Power Gated Designs by Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_4openalex-snapshot
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_9openalex-snapshot
Statistical Model Checking for Composite Actor Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_8openalex-snapshot
Parameterized Verification of Asynchronous Shared-Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-58322-3_24openalex-snapshot
Proving the Correctness of a Complete Microprocessor
inferred← citeshttps://doi.org/10.1007/bfb0028737openalex-snapshot
Formal verification of out-of-order execution using incremental flushing
inferred← citeshttps://doi.org/10.1007/bfb0028765openalex-snapshot
You assume, we guarantee: Methodology and case studies
inferred← citeshttps://doi.org/10.1007/s00165-017-0436-0openalex-snapshot
Automated circular assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1007/s00236-014-0203-0openalex-snapshot
Formal communication elimination and sequentialization equivalence proofs for distributed system models
inferred← citeshttps://doi.org/10.1007/s10009-002-0087-0openalex-snapshot
A framework for superscalar microprocessor correctness statements
inferred← citeshttps://doi.org/10.1007/s10009-005-0193-xopenalex-snapshot
Liveness with invisible ranking
inferred← citeshttps://doi.org/10.1007/s10009-006-0204-6openalex-snapshot
Putting it all together – Formal verification of the VAMP
inferred← citeshttps://doi.org/10.1007/s10703-009-0077-xopenalex-snapshot
Functional verification of power gated designs by compositional reasoning
inferred← citeshttps://doi.org/10.1007/s10703-011-0125-1openalex-snapshot
2010 CAV award announcement
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.scico.2004.05.013openalex-snapshot
Live and let die: LSC based verification of UML models
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00015-5openalex-snapshot
ESTEREL: a formal method applied to avionic software development
inferred← citeshttps://doi.org/10.1023/a:1008773308108openalex-snapshot
The Formal Design of 1M-gate ASICs
inferred← citeshttps://doi.org/10.1023/a:1014118529369openalex-snapshot
Formal Verification of Out-of-Order Execution with Incremental Flushing
inferred← citeshttps://doi.org/10.1023/a:1014122630277openalex-snapshot
Verification of FM9801: An Out-of-Order Microprocessor Model with Speculative Execution, Exceptions, and Program-Modifying Capability
inferred← citeshttps://doi.org/10.1023/a:1014170513439openalex-snapshot
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
inferred← citeshttps://doi.org/10.1023/a:1024716316140openalex-snapshot
Formal Verification of a Complex Pipelined Processor
inferred← citeshttps://doi.org/10.1023/b:form.0000040029.73127.85openalex-snapshot
Lessons Learned from Model Checking a NASA Robot Controller
inferred← citeshttps://doi.org/10.1109/40.768501openalex-snapshot
Using term rewriting systems to design and verify processors
inferred← citeshttps://doi.org/10.1109/40.768503openalex-snapshot
Verifying the FM9801 microarchitecture
inferred← citeshttps://doi.org/10.1109/43.945302openalex-snapshot
Theory of latency-insensitive design
inferred← citeshttps://doi.org/10.1109/92.894157openalex-snapshot
A compositional model for the functional verification of high-level synthesis results
inferred← citeshttps://doi.org/10.1109/acsd.2015.19openalex-snapshot
When Do We (Not) Need Complex Assume-Guarantee Rules?
inferred← citeshttps://doi.org/10.1109/asp-dac47756.2020.9045351openalex-snapshot
Formal Semantics of Predictable Pipelines: a Comparative Study
inferred← citeshttps://doi.org/10.1109/dac.1999.781346openalex-snapshot
Enhancing simulation with BDDs and ATPG
inferred← citeshttps://doi.org/10.1109/date.2004.1268844openalex-snapshot
Automatic verification of safety and liveness for XScale-like processor models using WEB refinements
inferred← citeshttps://doi.org/10.1109/date.2004.1268925openalex-snapshot
Automatic synthesis and simulation of continuous-time ΣΔ modulators
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/fmcad.2008.ecp.14openalex-snapshot
Going with the Flow: Parameterized Verification Using Message Flows
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.20openalex-snapshot
Word-Level Sequential Memory Abstraction for Model Checking
inferred← citeshttps://doi.org/10.1109/icasic.2005.1611464openalex-snapshot
Industrial Scale Formnal Verification Using Concurrent GSTE
inferred← citeshttps://doi.org/10.1109/iccad.1999.810700openalex-snapshot
Formal specification and verification of a dataflow processor array
inferred← citeshttps://doi.org/10.1109/iccad.2000.896481openalex-snapshot
Decomposing refinement proofs using assume-guarantee reasoning
inferred← citeshttps://doi.org/10.1109/iccd.2005.37openalex-snapshot
Challenges in the formal verification of complete state-of-the-art processors
inferred← citeshttps://doi.org/10.1109/iccms.2009.47openalex-snapshot
Formal Verification of Out-of-Order Processor
inferred← citeshttps://doi.org/10.1109/icstw.2011.44openalex-snapshot
Verifying Code and Its Optimizations: An Experience Report
inferred← citeshttps://doi.org/10.1109/icvd.1999.745165openalex-snapshot
Verifying Tomasulo's algorithm by refinement
inferred← citeshttps://doi.org/10.1109/icvd.2003.1183145openalex-snapshot
Automating formal modular verification of asynchronous real-time embedded systems
inferred← citeshttps://doi.org/10.1109/isqed.2002.996776openalex-snapshot
Promising directions in hardware design verification
inferred← citeshttps://doi.org/10.1109/iwv.1998.667118openalex-snapshot
A design methodology for highly-integrated wireless communications systems
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487914openalex-snapshot
A computationally ef~cient method based on commitment re~nement maps for verifying pipelined machines.
inferred← citeshttps://doi.org/10.1109/memcod.2011.5970511openalex-snapshot
Verification of microarchitectural refinements in rule-based systems
inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00023openalex-snapshot
A POP ⋆ is Born: Formal Predictable Out-of-Order Processor Model
inferred← citeshttps://doi.org/10.1109/sefm.2003.1236214openalex-snapshot
Component-based design and analysis: a case study
inferred← citeshttps://doi.org/10.1109/sp63933.2026.00203openalex-snapshot
Interplay of Efficient Model Checking and Secure Processor Design: A Case Study on Secure Speculation
inferred← citeshttps://doi.org/10.1109/tcad.2005.850814openalex-snapshot
An industrially effective environment for formal hardware verification
inferred← citeshttps://doi.org/10.1109/vlsi-soc57769.2023.10321874openalex-snapshot
Sparsity Controllable Hyperdimensional Computing for Genome Sequence Matching Acceleration
inferred← citeshttps://doi.org/10.1145/1080334.1080336openalex-snapshot
A framework for systematic validation and debugging of pipeline simulators
inferred← citeshttps://doi.org/10.1145/1081180.1081195openalex-snapshot
An approach to the pervasive formal specification and verification of an automotive system
inferred← citeshttps://doi.org/10.1145/1297658.1297662openalex-snapshot
Predicate abstraction with indexed predicates
inferred← citeshttps://doi.org/10.1145/1367045.1367054openalex-snapshot
Automatic verification of safety and liveness for pipelined machines using WEB refinement
inferred← citeshttps://doi.org/10.1145/1740582.1740584openalex-snapshot
On the completeness of compositional reasoning methods
inferred← citeshttps://doi.org/10.1145/2842603openalex-snapshot
Parameterized Verification of Asynchronous Shared-Memory Systems
inferred← citeshttps://doi.org/10.1145/3012280openalex-snapshot
When Do We Not Need Complex Assume-Guarantee Rules?
inferred← citeshttps://doi.org/10.1145/309847.309965openalex-snapshot
Enhancing simulation with BDDs and ATPG
inferred← citeshttps://doi.org/10.1145/3110268openalex-snapshot
Kami: a platform for high-level parametric hardware specification and its modular verification
inferred← citeshttps://doi.org/10.1145/368122.368141openalex-snapshot
Practical approaches to the verification of a telecom megacell using FormalCheck
inferred← citeshttps://doi.org/10.1145/3729331openalex-snapshot
Making Concurrent Hardware Verification Sequential
inferred← citeshttps://doi.org/10.1145/996566.996631openalex-snapshot
Verifying a gigabit ethernet switch using SMV
inferred← citeshttps://doi.org/10.1145/996566.996632openalex-snapshot
A general decomposition strategy for verifying register renaming
inferred← citeshttps://doi.org/10.1184/r1/6575960openalex-snapshot
Overview of ComFoRT: A Model Checking Reasoning Framework
inferred← citeshttps://doi.org/10.15479/at:ista:8332openalex-snapshot
Verifying concurrent programs: Refinement, synchronization, sequentialization
inferred← citeshttps://doi.org/10.1609/aaai.v38i19.30116openalex-snapshot
Assume-Guarantee Reinforcement Learning
inferred← citeshttps://doi.org/10.22028/d291-25787openalex-snapshot
A lattice-theoretic framework for circular assume-guarantee reasoning
inferred← citeshttps://doi.org/10.22028/d291-25849openalex-snapshot
Formal verification of a processor with memory management units
inferred← citeshttps://doi.org/10.25916/sut.26292130openalex-snapshot
Modular consistency analysis of component-based designs
inferred← citeshttps://doi.org/10.3390/electronics8091057openalex-snapshot
Model-Checking Speculation-Dependent Security Properties: Abstracting and Reducing Processor Models for Sound and Complete Verification
inferred← citeshttps://doi.org/10.34727/2020/isbn.978-3-85448-042-6_18openalex-snapshot
Automating Compositional Analysis of Authentication Protocols
inferred← citeshttps://doi.org/10.48456/tr-548openalex-snapshot
Formal verification of the ARM6 micro-architecture
inferred← citeshttps://doi.org/10.5555/1326073.1326139openalex-snapshot
Automated refinement checking of concurrent systems
inferred← citeshttps://doi.org/10.5555/2157654.2157658openalex-snapshot
Planning for end-to-end formal using simulation-based coverage: invited tutorial
inferred← citeshttps://doi.org/10.5555/339492.339554openalex-snapshot
Marsh: min-area retiming with setup and hold constraints
inferred← citeshttps://doi.org/10.5555/339492.340066openalex-snapshot
Formal specification and verification of a dataflow processor array
inferred← citeshttps://doi.org/10.5555/602902.602958openalex-snapshot
Decomposing refinement proofs using assume-guarantee reasoning
inferred← citeshttps://doi.org/10.5555/968878.969049openalex-snapshot
Automatic verification of safety and liveness for XScale-like processor models using WEB refinements
inferred← citeshttps://doi.org/10.6083/m4kh0kkxopenalex-snapshot
Structuring instruction-sets with higher-order functions
inferred← citeshttps://doi.org/10.70675/8640ad41zfb4fz40ecz8e27z200801a72369openalex-snapshot
Formal Specification and Verification of Security Mechanisms for RISC-V Processors
inferred← citeshttps://doi.org/10.7763/ijcte.2011.v3.373openalex-snapshot
Modified Architectural Support to Implement Tomasulo’s Algorithm on Tournament Branch Predictor
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.