On the public citation graph

Validity checking for combinations of theories with equality

https://doi.org/10.1007/bfb0031808
0 signed · 171 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-58179-0_44openalex-snapshot
Automatic verification of pipelined microprocessor control
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-60973-3_113openalex-snapshot
Experiments in theorem proving and model checking for protocol verification
inferredcites →https://doi.org/10.1007/3-540-61511-3_107openalex-snapshot
On Shostak's decision procedure for combinations of theories
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1093/comjnl/34.1.2openalex-snapshot
An Introduction to Knuth-Bendix Completion
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.1109/iccad.1995.479877openalex-snapshot
Efficient validity checking for processor verification
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/359545.359570openalex-snapshot
An algorithm for reasoning about equality
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.5555/224841.224849openalex-snapshot
Efficient validity checking for processor verification

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.556openalex-snapshot
C ON SIT: a fully automated conditioned program slicer
inferred← citeshttps://doi.org/10.1007/1-4020-2530-0_4openalex-snapshot
Application of Property Checking and Underlying Techniques
inferred← citeshttps://doi.org/10.1007/10720084_11openalex-snapshot
Combinations of Model Checking and Theorem Proving
inferred← citeshttps://doi.org/10.1007/10721959_6openalex-snapshot
A Framework for Cooperating Decision Procedures
inferred← citeshttps://doi.org/10.1007/11493853_24openalex-snapshot
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
inferred← citeshttps://doi.org/10.1007/11499107_18openalex-snapshot
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
inferred← citeshttps://doi.org/10.1007/11591191_23openalex-snapshot
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
inferred← citeshttps://doi.org/10.1007/11591191_3openalex-snapshot
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
inferred← citeshttps://doi.org/10.1007/11691372_9openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
inferred← citeshttps://doi.org/10.1007/11693024_19openalex-snapshot
Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferred← citeshttps://doi.org/10.1007/11916277_35openalex-snapshot
Splitting on Demand in SAT Modulo Theories
inferred← citeshttps://doi.org/10.1007/11944836_37openalex-snapshot
Validity Checking for Finite Automata over Linear Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_28openalex-snapshot
Automating Type Soundness Proofs via Decision Procedures and Guided Reductions
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_10openalex-snapshot
On Solving Presburger and Linear Arithmetic with SAT
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-40922-x_26openalex-snapshot
Sequential Equivalence Checking by Symbolic Simulation
inferred← citeshttps://doi.org/10.1007/3-540-40922-x_9openalex-snapshot
Combining Stream-Based and State-Based Verification Techniques
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_13openalex-snapshot
Finite Instantiations in Equivalence Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_22openalex-snapshot
ICS: Integrated Canonizer and Solver?
inferred← citeshttps://doi.org/10.1007/3-540-44614-1_84openalex-snapshot
Formal Verification of a Reconfigurable Microprocessor
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-45139-0_3openalex-snapshot
Model-checking in finite state-space systems with fine-grained abstractions using SPIN
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_27openalex-snapshot
Range Allocation for Equivalence Logic
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_1openalex-snapshot
Combining Shostak Theories
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_28openalex-snapshot
Shostak Light
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_18openalex-snapshot
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_40openalex-snapshot
CVC: A Cooperating Validity Checker
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_7openalex-snapshot
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_26openalex-snapshot
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/3-540-45800-x_19openalex-snapshot
Transformations and Software Modeling Languages: Automating Transformations in UML
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_11openalex-snapshot
A Generalization of Shostak#x2019;s Method for Combining Decision Procedures
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_8openalex-snapshot
A Rewrite Rule Based Framework for Combining Decision Procedures *
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_1openalex-snapshot
Software Construction and Analysis Tools for Future Space Missions
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-46419-0_7openalex-snapshot
The PROSPER Toolkit
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_26openalex-snapshot
Formal Verification of Descriptions with Distinct Order of Memory Operations
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_18openalex-snapshot
Formal Verification of Designs with Complex Control by Symbolic Simulation
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-48683-6_16openalex-snapshot
Experience with Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_33openalex-snapshot
Automatic Verification of Combinational and Pipelined FFT Circuits
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-48754-9_1openalex-snapshot
Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_13openalex-snapshot
A practical integration of first-order reasoning and decision procedures
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_9openalex-snapshot
An efficient decision procedure for the theory of fixed-sized bit-vectors
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_34openalex-snapshot
Reasoning about Infinite State Systems Using Boolean Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_56openalex-snapshot
A Proof System and a Decision Procedure for Equality Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_1openalex-snapshot
Revisiting Positive Equality
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_14openalex-snapshot
The ICS Decision Procedures for Embedded Deduction
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_13openalex-snapshot
An Experimental Evaluation of Ground Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_14openalex-snapshot
DPLL(T): Fast Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_40openalex-snapshot
The UCLID Decision Procedure
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_21openalex-snapshot
Towards Mechanized Program Verification with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_7openalex-snapshot
A Decision Procedure for Equality Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_9openalex-snapshot
Synchronization-at-Retirement for Pipeline Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_7openalex-snapshot
Testing Deadlock-Freeness in Real-Time Systems: A Formal Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_24openalex-snapshot
Combining Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_15openalex-snapshot
A Symbolic Approach to Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_33openalex-snapshot
Deductive Verification of Advanced Out-of-Order Microprocessors
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_16openalex-snapshot
Canonization for Disjoint Unions of Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_34openalex-snapshot
CVC3
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_52openalex-snapshot
A Decision Procedure for Bit-Vectors and Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_37openalex-snapshot
An Interpolation Method for CLP Traversal
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_6openalex-snapshot
Recursive Abstractions for Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_14openalex-snapshot
CVC4
inferred← citeshttps://doi.org/10.1007/978-3-642-57199-2_5openalex-snapshot
Machine Assisted Verification
inferred← citeshttps://doi.org/10.1007/b105236openalex-snapshot
Advanced Formal Verification
inferred← citeshttps://doi.org/10.1007/bfb0028737openalex-snapshot
Formal verification of out-of-order execution using incremental flushing
inferred← citeshttps://doi.org/10.1007/bfb0028739openalex-snapshot
Decomposing the proof of correctness of pipelined microprocessors
inferred← citeshttps://doi.org/10.1007/bfb0028749openalex-snapshot
BDD based procedures for a theory of equality with uninterpreted functions
inferred← citeshttps://doi.org/10.1007/bfb0031822openalex-snapshot
Automatic generation of invariants in processor verification
inferred← citeshttps://doi.org/10.1007/bfb0055343openalex-snapshot
Static analysis to identify invariants in RSML specifications
inferred← citeshttps://doi.org/10.1007/s10009-002-0080-7openalex-snapshot
inferred← citeshttps://doi.org/10.1007/s10472-012-9322-xopenalex-snapshot
Producing and verifying extremely large propositional refutations
inferred← citeshttps://doi.org/10.1007/s10766-005-0004-8openalex-snapshot
Embedded Software Verification Using Symbolic Execution and Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/s10817-006-9026-1openalex-snapshot
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)
inferred← citeshttps://doi.org/10.1007/s10817-012-9246-5openalex-snapshot
6 Years of SMT-COMP
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.005openalex-snapshot
Zero, successor and equality in BDDs
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.042openalex-snapshot
Combining SAT Methods with Non-Clausal Decision Heuristics
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.005openalex-snapshot
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.089openalex-snapshot
EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.006openalex-snapshot
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
inferred← citeshttps://doi.org/10.1016/j.ic.2004.11.001openalex-snapshot
Canonization for disjoint unions of theories
inferred← citeshttps://doi.org/10.1016/j.jss.2004.03.034openalex-snapshot
ConSUS: a light-weight program conditioner
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10014-7openalex-snapshot
Addressing the shortcomings of traditional formal reasoning methods for concurrent programs: New tools and techniques for source code correctness
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00018-0openalex-snapshot
On the analysis needs when verifying state-based software requirements: an experience report
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.1023/a:1008700623084openalex-snapshot
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
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:1015707001763openalex-snapshot
A General Setting for Flexibly Combining and Augmenting Decision Procedures
inferred← citeshttps://doi.org/10.1023/a:1022920129859openalex-snapshot
Model Checking Programs
inferred← citeshttps://doi.org/10.1023/a:1022988809947openalex-snapshot
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1109/asap.2000.862377openalex-snapshot
Formal verification for microprocessors with extendable instruction set
inferred← citeshttps://doi.org/10.1109/ase.2000.873645openalex-snapshot
Model checking programs
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594639openalex-snapshot
Refinement strategies for verification methods based on datapath abstraction
inferred← citeshttps://doi.org/10.1109/dac.2003.1219039openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferred← citeshttps://doi.org/10.1109/dac.2006.229207openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1109/date.2000.840892openalex-snapshot
Automatic equivalence check of circuit descriptions at clocked algorithmic and register transfer level
inferred← citeshttps://doi.org/10.1109/date.2005.127openalex-snapshot
Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972806openalex-snapshot
Symbolic simulation techniques-state-of-the-art and applications
inferred← citeshttps://doi.org/10.1109/hldvt.2001.972816openalex-snapshot
Experience with term level modeling and verification of the M*CORE/sup TM/ microprocessor core
inferred← citeshttps://doi.org/10.1109/hldvt.2002.1224443openalex-snapshot
An equivalence checking methodology for hardware oriented C-based specifications
inferred← citeshttps://doi.org/10.1109/icasic.2003.1277479openalex-snapshot
System level design methodologies from the viewpoint of formal verification
inferred← citeshttps://doi.org/10.1109/iccad.1997.643402openalex-snapshot
Verifying correct pipeline implementation for microprocessors
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560082openalex-snapshot
RTL SAT simplification by boolean and interval arithmetic reasoning
inferred← citeshttps://doi.org/10.1109/icccas.2008.4657976openalex-snapshot
Constraints partitioning for RTL Satis ability solving by YICES
inferred← citeshttps://doi.org/10.1109/iccd.1999.808581openalex-snapshot
Verification of scheduling in the presence of loops using uninterpreted symbolic simulation
inferred← citeshttps://doi.org/10.1109/iccms.2009.47openalex-snapshot
Formal Verification of Out-of-Order Processor
inferred← citeshttps://doi.org/10.1109/icfem.1997.630421openalex-snapshot
Systematic formal verification of interpreters
inferred← citeshttps://doi.org/10.1109/icsm.2000.883049openalex-snapshot
ConSIT: a conditioned program slicer
inferred← citeshttps://doi.org/10.1109/icsm.2001.972724openalex-snapshot
Pre/post conditioned slicing
inferred← citeshttps://doi.org/10.1109/icvd.2004.1260908openalex-snapshot
Formal verification of C language based VLSI designs
inferred← citeshttps://doi.org/10.1109/iscas.1999.777794openalex-snapshot
Synthesis of checker EFSMs from timing diagram specifications
inferred← citeshttps://doi.org/10.1109/isss.1998.730597openalex-snapshot
False path analysis based on a hierarchical control representation
inferred← citeshttps://doi.org/10.1109/lics.2001.932479openalex-snapshot
Deconstructing Shostak
inferred← citeshttps://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
inferred← citeshttps://doi.org/10.1109/wpc.2001.921717openalex-snapshot
Backward conditioning: a new program specialisation technique and its application to program comprehension
inferred← citeshttps://doi.org/10.1109/wpc.2004.1311051openalex-snapshot
Building executable union slices using conditioned slicing
inferred← citeshttps://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferred← citeshttps://doi.org/10.1145/1086228.1086284openalex-snapshot
Cutpoints for formal equivalence verification of embedded software
inferred← citeshttps://doi.org/10.1145/1118299.1118306openalex-snapshot
Refinement strategies for verification methods based on datapath abstraction
inferred← citeshttps://doi.org/10.1145/1146909.1146971openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferred← citeshttps://doi.org/10.1145/1233501.1233664openalex-snapshot
Accelerating high-level bounded model checking
inferred← citeshttps://doi.org/10.1145/1278480.1278629openalex-snapshot
EHSAT
inferred← citeshttps://doi.org/10.1145/1292597.1292602openalex-snapshot
Refined typechecking with Stardust
inferred← citeshttps://doi.org/10.1145/277044.277186openalex-snapshot
A decision procedure for bit-vector arithmetic
inferred← citeshttps://doi.org/10.1145/298595.298603openalex-snapshot
Checking properties of safety critical specifications using efficient decision procedures
inferred← citeshttps://doi.org/10.1145/307988.307989openalex-snapshot
Formal verification in hardware design
inferred← citeshttps://doi.org/10.1145/343647.344347openalex-snapshot
Automatic equivalence check of circuit descriptions at clocked algorithmic and register transfer level (poster paper)
inferred← citeshttps://doi.org/10.1145/349360.351125openalex-snapshot
Using predicate abstraction to reduce object-oriented programs for model checking
inferred← citeshttps://doi.org/10.1145/371282.371364openalex-snapshot
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
inferred← citeshttps://doi.org/10.1145/378239.378265openalex-snapshot
Scalable hybrid verification of complex microprocessors
inferred← citeshttps://doi.org/10.1145/513829.513844openalex-snapshot
Automatic formal verification for scheduled VLIW code
inferred← citeshttps://doi.org/10.1145/775832.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferred← citeshttps://doi.org/10.1145/996566.996628openalex-snapshot
An efficient finite-domain constraint solver for circuits
inferred← citeshttps://doi.org/10.1145/996566.996629openalex-snapshot
Automatic abstraction and verification of verilog models
inferred← citeshttps://doi.org/10.1201/9781420036336.ch86openalex-snapshot
Verification Languages
inferred← citeshttps://doi.org/10.14288/1.0051649openalex-snapshot
Formal equivalence checking of software specifications vs. hardware implementations
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070179openalex-snapshot
Verification of Statecharts Using Data Abstraction
inferred← citeshttps://doi.org/10.1504/ijes.2005.008815openalex-snapshot
TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories
inferred← citeshttps://doi.org/10.1631/jzus.a0820812openalex-snapshot
Equality detection for linear arithmetic constraints
inferred← citeshttps://doi.org/10.21236/ada461197openalex-snapshot
Reducing Separation Formulas to Propositional Logic
inferred← citeshttps://doi.org/10.26083/tuprints-00000113openalex-snapshot
Formal Sequential Equivalence Checking of Digital Systems by Symbolic Simulation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0402002openalex-snapshot
Deciding Disjunctive Linear Arithmetic with SAT
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910014openalex-snapshot
Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic
inferred← citeshttps://doi.org/10.5555/266388.266456openalex-snapshot
Verifying correct pipeline implementation for microprocessors
inferred← citeshttps://doi.org/10.5555/380921.380927openalex-snapshot
Model-checking infinite state-space systems with fine-grained abstractions using SPIN
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.6083/m4kh0kkxopenalex-snapshot
Structuring instruction-sets with higher-order functions
inferred← citeshttps://doi.org/10.70675/6a3585eez5df3z474dzb64ez12a39e82b99dopenalex-snapshot
Formal Guaranties for Safety Critical Code Generation : the Case of Highly Variable Languages
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.