On the public citation graph

Automatic Verification of Parameterized Cache Coherence Protocols

https://doi.org/10.1007/10722167_8
0 signed · 168 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/3-540-48153-2_17openalex-snapshot
Verification of Infinite State Systems by Compositional Model Checking
inferredcites →https://doi.org/10.1007/3-540-48168-0_5openalex-snapshot
Constraint-Based Analysis of Broadcast Protocols
inferredcites →https://doi.org/10.1007/3-540-48683-6_14openalex-snapshot
Handling Global Conditions in Parametrized System Verification
inferredcites →https://doi.org/10.1007/3-540-48683-6_27openalex-snapshot
Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems
inferredcites →https://doi.org/10.1007/3-540-49059-0_16openalex-snapshot
Model Checking in CLP
inferredcites →https://doi.org/10.1007/3-540-56922-7_28openalex-snapshot
Delay analysis in synchronous programs
inferredcites →https://doi.org/10.1007/3-540-60472-3_13openalex-snapshot
A note on abstract interpretation strategies for hybrid automata
inferredcites →https://doi.org/10.1007/3-540-61474-5_60openalex-snapshot
Automatic verification of parameterized synchronous systems
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_39openalex-snapshot
Symbolic model checking of infinite state systems using presburger arithmetic
inferredcites →https://doi.org/10.1007/3-540-63166-6_48openalex-snapshot
HyTech: A model checker for hybrid systems
inferredcites →https://doi.org/10.1007/bfb0028736openalex-snapshot
Verifying systems with infinite but regular state spaces
inferredcites →https://doi.org/10.1007/bfb0028766openalex-snapshot
Verification of a parameterized bus arbitration protocol
inferredcites →https://doi.org/10.1016/0890-5401(89)90026-6openalex-snapshot
Reasoning about networks with many identical finite state processes
inferredcites →https://doi.org/10.1016/b978-0-444-81641-2.50007-1openalex-snapshot
Verification of the Futurebus+ Cache Coherence Protocol**This research was sponsored in part by the Avionics Laboratory, Wright Research and Development Center, Aeronautical Systems Division (AFSC), U.S. Air Force, Wright-Patterson AFB, Ohio 45433-6543 under Contract F33615-90-C-1465, ARPA Order…
inferredcites →https://doi.org/10.1016/s0304-3975(00)00102-xopenalex-snapshot
Well-structured transition systems everywhere!
inferredcites →https://doi.org/10.1016/s0304-3975(00)00105-5openalex-snapshot
Ensuring completeness of symbolic verification methods for infinite-state systems
inferredcites →https://doi.org/10.1023/a:1008723125149openalex-snapshot
Verifying Systems with Replicated Components in Murϕ
inferredcites →https://doi.org/10.1109/71.406955openalex-snapshot
A new approach for the verification of cache coherence protocols
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state systems
inferredcites →https://doi.org/10.1109/lics.1998.705644openalex-snapshot
On model checking for non-deterministic infinite-state systems
inferredcites →https://doi.org/10.1109/lics.1999.782630openalex-snapshot
On the verification of broadcast protocols
inferredcites →https://doi.org/10.1145/146637.146681openalex-snapshot
Reasoning about systems with many processes
inferredcites →https://doi.org/10.1145/225871.225880openalex-snapshot
Automatic generation of functional vectors using the extended finite state machine model
inferredcites →https://doi.org/10.1145/248621.248624openalex-snapshot
Verification techniques for cache coherence protocols
inferredcites →https://doi.org/10.1145/263699.263747openalex-snapshot
Automatic verification of parameterized linear networks of processes
inferredcites →https://doi.org/10.1145/265943.265960openalex-snapshot
Verifying parameterized networks
inferredcites →https://doi.org/10.1145/285930.285987openalex-snapshot
A low-overhead coherence solution for multiprocessors with private cache memories
inferredcites →https://doi.org/10.1145/6513.6514openalex-snapshot
Cache coherence protocols: evaluation using a multiprocessor simulation model
inferredcites →https://doi.org/10.1145/800015.808204openalex-snapshot
A low-overhead coherence solution for multiprocessors with private cache memories

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_40openalex-snapshot
Action Language Verifier, Extended
inferred← citeshttps://doi.org/10.1007/11609773_9openalex-snapshot
Environment Abstraction for Parameterized Verification
inferred← citeshttps://doi.org/10.1007/11691372_3openalex-snapshot
Parameterized Verification of π-Calculus Systems
inferred← citeshttps://doi.org/10.1007/3-540-32370-8_7openalex-snapshot
Automatic Proofs of Protocols via Program Transformation
inferred← citeshttps://doi.org/10.1007/3-540-36189-8_15openalex-snapshot
Formal Verification of e-Services and Workflows
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_11openalex-snapshot
Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_23openalex-snapshot
Compositional Analysis for Verification of Parameterized Systems
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-44585-4_28openalex-snapshot
Attacking Symbolic State Explosion
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_29openalex-snapshot
A Unifying Model Checking Approach for Safety Properties of Parameterized Systems
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_4openalex-snapshot
Automated Inductive Verification of Parameterized Protocols?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_42openalex-snapshot
Using Timestamping and History Variables to Verify Sequential Consistency
inferred← citeshttps://doi.org/10.1007/3-540-44743-1_2openalex-snapshot
Formal Verification of Coherence for a Shared Memory Multiprocessor Model
inferred← citeshttps://doi.org/10.1007/3-540-44898-5_14openalex-snapshot
A Logic for Analyzing Abstractions of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_4openalex-snapshot
Proofs of Correctness of Cache-Coherence Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_12openalex-snapshot
Parameterized Verification of Multithreaded Software Libraries
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_8openalex-snapshot
Verification of Systems with an Infinite State Space
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_20openalex-snapshot
Constraint-Based Verification of Client-Server Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_22openalex-snapshot
Algorithmic Verification of Invalidation-Based Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_32openalex-snapshot
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_16openalex-snapshot
Grammars as Processes
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_8openalex-snapshot
Automated Verification of Concurrent Linked Lists with Counters
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_7openalex-snapshot
Constraint-Based Model Checking for Parameterized Synchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_16openalex-snapshot
Beyond Parameterized Verification
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_27openalex-snapshot
Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_11openalex-snapshot
Verification of Consistency Protocols Via Infinite-State Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_16openalex-snapshot
Gradual Consistency Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_4openalex-snapshot
Liveness in Broadcast Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_13openalex-snapshot
Structural Invariants for the Verification of Systems with Parameterized Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_20openalex-snapshot
Boosting Sequential Consistency Checking Using Saturation
inferred← citeshttps://doi.org/10.1007/978-3-030-76983-3_8openalex-snapshot
Computing Parameterized Invariants of Parameterized Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_21openalex-snapshot
Model Checking Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_1openalex-snapshot
Block Me If You Can!
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-66197-1_13openalex-snapshot
On Run-Time Enforcement of Authorization Constraints in Security-Sensitive Workflows
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_14openalex-snapshot
Polynomial Time Image Computation with Interval-Definable Counters Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_9openalex-snapshot
Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_27openalex-snapshot
Regular Model Checking for LTL(MSO)
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_28openalex-snapshot
Image Computation in Infinite State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_33openalex-snapshot
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
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-31980-1_6openalex-snapshot
Empirically Efficient Verification for a Class of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_22openalex-snapshot
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_24openalex-snapshot
A Logical Reconstruction of Reachability
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_2openalex-snapshot
Bounded Model Checking and Induction: From Refutation to Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_1openalex-snapshot
Deciding Monotonic Games
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_46openalex-snapshot
Fast Infinite-State Model Checking in Integer-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_4openalex-snapshot
Theorem Proving for Verification (Invited Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_56openalex-snapshot
Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_17openalex-snapshot
Parameterized Verification of Infinite-State Processes with Global Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_25openalex-snapshot
A Note on Specialization of Interpreters
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_7openalex-snapshot
Handling Parameterized Systems with Non-atomic Global Conditions
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-540-85762-4_4openalex-snapshot
Monotonic Abstraction in Action
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_9openalex-snapshot
Fair Model Checking with Process Counter Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_16openalex-snapshot
A Java Supercompiler and Its Application to Verification of Cache-Coherence Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_43openalex-snapshot
Abstract Analysis of Symbolic Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_32openalex-snapshot
On Combining State Space Reductions with Global Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_2openalex-snapshot
A Small Model Theorem for Rectangular Hybrid Automata Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_28openalex-snapshot
All for the Price of Few
inferred← citeshttps://doi.org/10.1007/978-3-642-40213-5_13openalex-snapshot
Push-Down Automata with Gap-Order Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_7openalex-snapshot
Lazy Constrained Monotonic Abstraction
inferred← citeshttps://doi.org/10.1007/bf02973444openalex-snapshot
Automatic generation of symbolic model for parameterized synchronous systems
inferred← citeshttps://doi.org/10.1007/s00165-006-0017-0openalex-snapshot
Highly dependable concurrent programming using design for verification
inferred← citeshttps://doi.org/10.1007/s00236-007-0050-3openalex-snapshot
Well-structured languages
inferred← citeshttps://doi.org/10.1007/s10009-011-0212-zopenalex-snapshot
Regular model checking for LTL(MSO)
inferred← citeshttps://doi.org/10.1007/s10009-015-0406-xopenalex-snapshot
Parameterized verification through view abstraction
inferred← citeshttps://doi.org/10.1007/s10515-007-0008-2openalex-snapshot
Eliminating synchronization faults in air traffic control software via design for verification with concurrency controllers
inferred← citeshttps://doi.org/10.1007/s10703-008-0062-9openalex-snapshot
Approximated parameterized verification of infinite-state processes with global conditions
inferred← citeshttps://doi.org/10.1007/s10703-009-0081-1openalex-snapshot
Action Language verifier: an infinite-state model checker for reactive software specifications
inferred← citeshttps://doi.org/10.1007/s10703-010-0096-7openalex-snapshot
Context-aware counter abstraction
inferred← citeshttps://doi.org/10.1007/s11227-012-0755-0openalex-snapshot
State space reduction in modeling checking parameterized cache coherence protocol by two-dimensional abstraction
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.entcs.2004.04.032openalex-snapshot
Verifying Properties of Coordination by Well-Structured Transition Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.030openalex-snapshot
On the ω-language Expressive Power of Extended Petri Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.064openalex-snapshot
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.006openalex-snapshot
About Fast and TReX Accelerations
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.017openalex-snapshot
Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.027openalex-snapshot
Monotonic Abstraction in Parameterized Verification
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.019openalex-snapshot
Light-Weight SMT-based Model Checking
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.08.007openalex-snapshot
Model checking a cache coherence protocol of a Java DSM implementation
inferred← citeshttps://doi.org/10.1016/j.scico.2010.02.006openalex-snapshot
Verification of graph grammars using a logical approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.016openalex-snapshot
Compositional analysis for verification of parameterized systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.008openalex-snapshot
On the ω -language expressive power of extended Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115319openalex-snapshot
Monodic fragments of probabilistic first-order temporal logic with bounded semantics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00189-6openalex-snapshot
An Assertional Language for the Verification of Systems Parametric in Several Dimensions
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80786-2openalex-snapshot
An Overview of MSR( )
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80007-6openalex-snapshot
Interface-Based Specification and Verification of Concurrency Controllers
inferred← citeshttps://doi.org/10.1017/s1471068406002663openalex-snapshot
Parametric Verification of a Group Membership Algorithm
inferred← citeshttps://doi.org/10.1023/a:1026276129010openalex-snapshot
Constraint-Based Verification of Parameterized Cache Coherence Protocols
inferred← citeshttps://doi.org/10.1023/b:ause.0000017740.35552.88openalex-snapshot
Inductively Verifying Invariant Properties of Parameterized Systems
inferred← citeshttps://doi.org/10.1109/access.2017.2701406openalex-snapshot
Cache Coherence Scheme for HCS-Based CMP and Its System Reliability Analysis
inferred← citeshttps://doi.org/10.1109/ase.2004.1342742openalex-snapshot
Verifiable concurrent programming using concurrency controllers
inferred← citeshttps://doi.org/10.1109/ase.2004.75openalex-snapshot
Verifiable concurrent programming using concurrency controllers
inferred← citeshttps://doi.org/10.1109/cdc.2001.980714openalex-snapshot
Some lessons from the HYTECH experience
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351126openalex-snapshot
Protocol verification using flows: An industrial experience
inferred← citeshttps://doi.org/10.1109/fmcad.2015.7542247openalex-snapshot
Verification of cache coherence protocols wrt. trace filters
inferred← citeshttps://doi.org/10.1109/icis.2007.172openalex-snapshot
Split Private and Shared L2 Cache Architecture for Snooping-based CMP
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213433openalex-snapshot
Model checking a cache coherence protocol for a Java DSM implementation
inferred← citeshttps://doi.org/10.1109/lics.2000.855762openalex-snapshot
Better is better than well: on efficient verification of infinite-state systems
inferred← citeshttps://doi.org/10.1109/lics.2003.1210076openalex-snapshot
Model checking guarded protocols
inferred← citeshttps://doi.org/10.1109/lics.2004.26openalex-snapshot
Multi-clock timed networks
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487897openalex-snapshot
Verification of parameterized hierarchical state machines using action language verifier
inferred← citeshttps://doi.org/10.1109/memcod.2010.5558623openalex-snapshot
Modular verification of synchronization with reentrant locks
inferred← citeshttps://doi.org/10.1109/time.2008.15openalex-snapshot
Practical First-Order Temporal Reasoning
inferred← citeshttps://doi.org/10.1109/time.2012.20openalex-snapshot
Symmetric Temporal Theorem Proving
inferred← citeshttps://doi.org/10.1109/tpds.2003.1225053openalex-snapshot
Verifying sequential consistency on shared-memory multiprocessors by model checking
inferred← citeshttps://doi.org/10.1109/tse.2018.2878728openalex-snapshot
Symbolic Refinement of Extended State Machines with Applications to the Automatic Derivation of Sub-Components and Controllers
inferred← citeshttps://doi.org/10.1109/tse.2024.3440587openalex-snapshot
Parameterized Verification of Leader/Follower Systems via Arithmetic Constraints
inferred← citeshttps://doi.org/10.1134/s0361768807010033openalex-snapshot
Verification as a parameterized testing (experiments with the SCP4 supercompiler)
inferred← citeshttps://doi.org/10.1134/s0361768810030047openalex-snapshot
On one application of computations with oracle
inferred← citeshttps://doi.org/10.1142/s0129054108006066openalex-snapshot
REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
inferred← citeshttps://doi.org/10.1145/1287624.1287663openalex-snapshot
Symbolic message sequence charts
inferred← citeshttps://doi.org/10.1145/1531743.1531751openalex-snapshot
Core monitors
inferred← citeshttps://doi.org/10.1145/1538942.1538943openalex-snapshot
Interacting process classes
inferred← citeshttps://doi.org/10.1145/1556444.1556454openalex-snapshot
Model checking race-freeness
inferred← citeshttps://doi.org/10.1145/2089116.2089122openalex-snapshot
Symbolic Message Sequence Charts
inferred← citeshttps://doi.org/10.1145/2209291.2209293openalex-snapshot
Towards the formal verification of cache coherency at the architectural level
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/3306491openalex-snapshot
Formal Modeling and Verification of a Victim DRAM Cache
inferred← citeshttps://doi.org/10.1145/566171.566199openalex-snapshot
Specification, verification, and synthesis of concurrency control components
inferred← citeshttps://doi.org/10.1155/2014/702165openalex-snapshot
Counterexample-Preserving Reduction for Symbolic Model Checking
inferred← citeshttps://doi.org/10.14288/1.0051397openalex-snapshot
Model checking sequential consistency and parameterized protocols
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:10)2010openalex-snapshot
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
inferred← citeshttps://doi.org/10.2178/bsl/1294171129openalex-snapshot
Well (and Better) Quasi-Ordered Transition Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d93openalex-snapshot
Structural Invariants for the Verification of Systems with Parameterized Architectures
inferred← citeshttps://doi.org/10.29007/f3rpopenalex-snapshot
Reachability Modulo Theory Library
inferred← citeshttps://doi.org/10.3182/20140514-3-fr-4046.00080openalex-snapshot
Deadlock Analysis of Generalized Parameterized Discrete Event Systems with Ring Topology
inferred← citeshttps://doi.org/10.3233/fi-222137openalex-snapshot
Computing Parameterized Invariants of Parameterized Petri Nets
inferred← citeshttps://doi.org/10.3384/diss.diva-121776openalex-snapshot
Automatic Verification of Parameterized Systems by Over-Approximation
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.3390/robotics10020067openalex-snapshot
An Overview of Verification and Validation Challenges for Inspection Robots
inferred← citeshttps://doi.org/10.4204/eptcs.168.1openalex-snapshot
Monotonic Abstraction Techniques: from Parametric to Software Model Checking
inferred← citeshttps://doi.org/10.4204/eptcs.253.6openalex-snapshot
Verification of Programs via Intermediate Interpretation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702036openalex-snapshot
Efficient First-Order Temporal Logic for Infinite-State Systems
inferred← citeshttps://doi.org/10.5281/zenodo.209764openalex-snapshot
FIGURE 5. Mesocoelium burti—NHMUK 1980.11.12 4 in A reevaluation of specimens of Mesocoelium monas (Platyhelminthes: Digenea: Mesocoeliidae) from the Natural History Museum, UK and the United States National Parasite Collection, USA
inferred← citeshttps://doi.org/10.5555/2485288.2485479openalex-snapshot
Verifying safety and liveness for the FlexTM hybrid transactional memory
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.