Verifying safety properties of a PowerPC^TM microprocessor using symbolic model checking without BDDs
From MaRDI portal
Publication:4817533
Recommendations
- Using abstract specifications to verify \(\text{PowerPC}^{\text{TM}}\) custom memories by symbolic trajectory evaluation
- Model checking speculation-dependent security properties: abstracting and reducing processor models for sound and complete verification
- Formal verification of Pentium^4 components with symbolic simulation and inductive invariants
- A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
- Microarchitecture verification by compositional model checking
- Silicon debug of a powerPC microprocessor using model checking
- Model Checking Safety-Critical Systems Using Safecharts
- Accelerating bounded model checking of safety properties
Cited in
(34)- Equivalent literal propagation in the DLL procedure
- A satisfiability procedure for quantified Boolean formulae
- Spanning the spectrum from safety to liveness
- An explicit transition system construction approach to LTL satisfiability checking
- Formal verification based on Boolean expression diagrams
- Model-based safety assessment of a triple modular generator with xSAP
- PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
- Bounded model checking with parametric data structures
- Compressing BMC encodings with QBF
- Optimization modulo theories with linear rational costs
- Access nets: modeling access to physical spaces
- Linear completeness thresholds for bounded model checking
- Model checking data flows in concurrent network updates
- Evaluating CDCL variable scoring schemes
- Simulating circuit-level simplifications on CNF
- Solving μ-Calculus Parity Games by Symbolic Planning
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- SAT-solving in CSP trace refinement
- Using abstract specifications to verify \(\text{PowerPC}^{\text{TM}}\) custom memories by symbolic trajectory evaluation
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
- Implementing efficient All solutions SAT solvers
- Mining definitions in Kissat with Kittens
- Solving satisfiability problems with preferences
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver
- ACoRe: automated goal-conflict resolution
- AutoHyper: explicit-state model checking for HyperLTL
- Property directed reachability for generalized Petri nets
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Timed causal fanin analysis for symbolic simulation
- Silicon debug of a powerPC microprocessor using model checking
- SCIP: solving constraint integer programs
- Latticed \(k\)-induction with an application to probabilistic programs
- SAT-solving in practice, with a tutorial example from supervisory control
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
This page was built for publication: Verifying safety properties of a PowerPC\(^{TM}\) microprocessor using symbolic model checking without BDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4817533)