Pages that link to "Item:Q2351144"
From MaRDI portal
The following pages link to A framework for the verification of certifying computations (Q2351144):
Displaying 14 items.
- Certifying algorithms (Q465678) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- Cyclability in graph classes (Q833007) (← links)
- A graph library for Isabelle (Q2018659) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Advances in Quantitative Verification for Ubiquitous Computing (Q2851899) (← links)
- Cogent: uniqueness types and certifying compilation (Q5019022) (← links)
- Generalising KAT to Verify Weighted Computations (Q5089610) (← links)
- (Q5158499) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- Verifiable certificates for predicate subtyping (Q6070793) (← links)