Search results
From MaRDI portal
- From informal to formal proofs in Euclidean geometry 2019-05-16 Paper Automated generation of machine verifiable and readable proofs: a case study of Tarski's...10 bytes (18 words) - 09:50, 25 September 2023
- 2015-09-14 Paper Formal security proofs with minimal fuss: implicit computational complexity at work 2015-05-04 Paper Certifying assembly with formal security...10 bytes (18 words) - 14:53, 28 January 2024
- Geometry Software With a Proof Assistant for Interactive Formal Proofs 2014-07-22 Paper Inductive and Coinductive Components of Corecursive Functions in...10 bytes (17 words) - 09:51, 6 October 2023
- generation of machine verifiable and readable proofs: a case study of Tarski's geometry 2015-07-27 Paper Formal SOS-Proofs for the Lambda-Calculus 2015-03-18 Paper...10 bytes (16 words) - 11:36, 6 October 2023
- Scalable LCF-Style Proof Translation 2013-08-07 Paper Communicating Formal Proofs: The Case of Flyspeck 2013-08-07 Paper PRocH: Proof Reconstruction for...10 bytes (17 words) - 11:19, 6 October 2023
- Automating Event-B invariant proofs by rippling and proof patching 2019-03-13 Paper Automating change of representation for proofs in discrete mathematics (extended...10 bytes (16 words) - 06:51, 7 October 2023
- Automated Proofs for Asymmetric Encryption 2010-03-09 Paper Automated Security Proof for Symmetric Encryption Modes 2010-01-14 Paper Formal Indistinguishability...10 bytes (17 words) - 15:53, 10 December 2023
- 2006-01-18 Paper Fuzzy Horn logic. I. Proof theory. 2006-01-10 Paper Formal Concept Analysis 2005-12-02 Paper Formal Concept Analysis 2005-12-02 Paper https://portal...10 bytes (16 words) - 01:32, 9 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q4433996 2003-11-03 Paper Formal proofs about rewriting using ACL2 2002-08-19 Paper...10 bytes (18 words) - 20:54, 11 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q4433996 2003-11-03 Paper Formal proofs about rewriting using ACL2 2002-08-19 Paper...10 bytes (20 words) - 00:42, 12 December 2023
- Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics 2009-03-12 Paper Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics...10 bytes (19 words) - 18:41, 11 December 2023
- 2014-09-08 Paper Formal specification and proofs for the topology and classification of combinatorial surfaces 2014-08-13 Paper Formal Proof in Coq and Derivation...10 bytes (18 words) - 18:56, 11 December 2023
- significance of consistency proofs 1959-01-01 Paper A remark on free choice sequences and the topological completeness proofs 1959-01-01 Paper https://portal...10 bytes (17 words) - 11:39, 12 December 2023
- Paper https://portal.mardi4nfdi.de/entity/Q4433996 2003-11-03 Paper Formal proofs about rewriting using ACL2 2002-08-19 Paper...10 bytes (18 words) - 00:42, 12 December 2023
- Automated proofs for asymmetric encryption 2011-06-03 Paper Automated Proofs for Asymmetric Encryption 2010-03-09 Paper Automated Security Proof for Symmetric...10 bytes (17 words) - 15:53, 10 December 2023
- 2017-11-17 Paper Formal verification of numerical programs: from C annotated programs to mechanical proofs 2013-05-16 Paper Hardware-Dependent Proofs of Numerical...10 bytes (16 words) - 12:26, 12 December 2023
- 1927-01-01 Paper Notes on formal modular protomorphs. 1927-01-01 Paper Ideals for any linear associative algebra. 1927-01-01 Paper On formal modular invariants...10 bytes (19 words) - 14:52, 13 December 2023
- data 2014-06-27 Paper Closure-based constraints in formal concept analysis 2014-04-22 Paper Formal concept analysis and linguistic hedges 2014-01-06 Paper...10 bytes (16 words) - 20:55, 9 December 2023
- in Program Explanation 1981-01-01 Paper Proofs of Networks of Processes 1981-01-01 Paper Deadlock absence proofs for networks of communicating processes...10 bytes (16 words) - 14:29, 28 January 2024
- reasoning for differential privacy 2015-09-11 Paper Formal certification of code-based cryptographic proofs 2015-07-03 Paper Proving the TLS Handshake Secure...10 bytes (18 words) - 12:52, 6 October 2023
