CakeML
About CakeML is a functional programming language and an ecosystem of proofs and tools built around the language. The ecosystem includes a proven-correct compiler that can bootstrap itself. The CakeML project consists of the following components, all of which are free software. Language definition. The CakeML language is based on a substantial subset of Standard ML. Its formal semantics is specifi
Isabelle入門ã®å…¥é–€ - Qiita
最近Isabelle始ã‚ãŸã°ã‹ã‚Šãªã®ã§, åˆå¿ƒè€…çš„ãªè¦–点ã‹ã‚‰Isabelle入門以å‰ã®è©±ã‚’ã—ã¾ã™. ã“ã®è¨˜äº‹ã‚’èªã‚“ã§Isabelleã«èˆˆå‘³ã‚’æŒãŸã‚ŒãŸã‚‰, 是éžå…¬å¼turtorialã‹ã‚‰Isabelleã¸å…¥é–€ã—ã¦ã¿ã¦ãã ã•ã„. Isabelleã«ã¤ã„㦠Isabelleã¯è¨¼æ˜Žæ”¯æ´è¨€èªžã§ã™. 以下ã«ãã®ç‰¹å¾´ã‚’ã‚ã’ã¦ã¿ã¾ã™. 標準ã®jEdit環境ãŒãƒªãƒƒãƒ 強力ãªè‡ªå‹•è¨¼æ˜Žæ©Ÿæ§‹ (ã¨ã«ã‹ã自動証明コマンドãŒè±Šå¯Œã§, ã•ã‚‰ã«è¨¼æ˜Žã‚’Isabelleã«æŽ¢ç´¢ã•ã›ã‚‹ã“ã¨ã‚‚ã§ãã¾ã™) å…¬ç†ç³»ãŒé¸ã¹ã‚‹ (å…¬ç†ç³»ã¯ãƒ©ã‚¤ãƒ–ラリレベルã§ã‚µãƒãƒ¼ãƒˆã•ã‚Œã¦ã„ã¾ã™. importã™ã‚‹ãƒ©ã‚¤ãƒ–ラリを自分ã§é¸ã¶ã“ã¨ã§, HOL, ZF, Sequents, Cube ãªã©ãªã©ãŸãã•ã‚“ã®å…¬ç†ç³»ã‚’扱ã†ã“ã¨ãŒã§ãã¾ã™) Isabelle/Isarã«ã‚ˆã‚‹äººé–“ã«å„ªã—ã„証明 (Coqã®ã‚ˆã†ã«è¨¼æ˜Žå›³ã‚’コマンドã«ã‚ˆã£ã¦å¤‰å½¢ã—ã¦ã„ãã ã‘ã§ãªã, Is
Programming Language and Theorem Prover — Lean
Programming Language and Theorem Prover
#TPP2014 é«˜ä¿¡é ¼ãªç†è«–ã¨å®Ÿè£…ã®ãŸã‚ã®å®šç†è¨¼æ˜ŽãŠã‚ˆã³å®šç†è¨¼æ˜Žå™¨
ç ”ç©¶é›†ä¼š ã€Œé«˜ä¿¡é ¼ãªç†è«–ã¨å®Ÿè£…ã®ãŸã‚ã®å®šç†è¨¼æ˜ŽãŠã‚ˆã³å®šç†è¨¼æ˜Žå™¨ã€ é«˜ä¿¡é ¼ãªã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢é–‹ç™ºã®ãŸã‚ã«å¿…è¦ãªå½¢å¼æ‰‹æ³•, ソフトウェア検証, æ•°å¦ã®å½¢å¼åŒ–, ãŠã‚ˆã³, 証明ã®è¨ˆç®—æ©Ÿã«ã‚ˆã‚‹æ¤œè¨¼ã«é–¢ã™ã‚‹ç ”究集会をä¹å·žå¤§å¦è¥¿æ–°ãƒ—ラザã§é–‹å‚¬ã—ã¾ã™. 続ãã‚’èªã‚€
TPTP Services are Down
Why are you looking for the TPTP on this server? Try www.tptp.org
Mizar - Wikibooks
ã“ã®ãƒšãƒ¼ã‚¸ã€ŒMizarã€ã¯ã€ã¾ã 書ãã‹ã‘ã§ã™ã€‚åŠ ç†ãƒ»è¨‚æ£ãªã©ã€å”力ã„ãŸã ã‘る皆様ã®ç·¨é›†ã‚’心ã‹ã‚‰ãŠå¾…ã¡ã—ã¦ãŠã‚Šã¾ã™ã€‚ã¾ãŸã€ã”æ„見ãªã©ãŒã‚ã‚Šã¾ã—ãŸã‚‰ã€ãŠæ°—軽ã«ãƒˆãƒ¼ã‚¯ãƒšãƒ¼ã‚¸ã¸ã©ã†ãžã€‚
Mizar - Wikipedia
自動証明検証システムMizar（ミザーã€ãƒŸã‚¶ãƒ¼ãƒ«ï¼‰ã¯ã€ã¾ã£ãŸã厳密ã«å½¢å¼çš„ãªå½¢ã§æ•°å¦çš„ãªå®šç¾©ã‚„証明を記述ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿è¨˜è¿°è¨€èªžï¼ˆMizar-言語）ã€å®Ÿéš›ã«ãã®è¨€èªžã§è¨˜è¿°ã•ã‚ŒãŸè¨¼æ˜Žã®å†…容を検証ã™ã‚‹ã“ã¨ãŒã§ãる計算機プãƒã‚°ãƒ©ãƒ （証明検証プãƒã‚°ãƒ©ãƒ ）ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã‹ã‚‰å‚ç…§ã—ã¦æ–°ãŸãªè¨¼æ˜Žã®éš›ã«åˆ©ç”¨å¯èƒ½ãªå®šç¾©ã¨è¨¼æ˜Žæ¸ˆã¿ã®å®šç†ã‹ã‚‰ãªã‚‹ãƒ©ã‚¤ãƒ–ラリ (MML) ã®ä¸‰è€…ã‹ã‚‰æ§‹æˆã•ã‚Œã‚‹ã€‚ Mizar ã¨åŒæ§˜ã®ç›®çš„ã‚’æŒã¤ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã«ã€ãƒãƒãƒ¼ãƒˆãƒ»ãƒœã‚¤ãƒ¤ãƒ¼ã®QEDプãƒã‚¸ã‚§ã‚¯ãƒˆãŒã‚る。 システムã®é–‹ç™ºã¯1973å¹´ã«ã‚¢ãƒ³ã‚¸ã‚§ã‚¤ãƒ»ãƒˆãƒªãƒ–レッツã«ã‚ˆã£ã¦å§‹ã‚られã€ã‚·ã‚¹ãƒ†ãƒ ã®ä¿å®ˆã‚’ãƒãƒ¼ãƒ©ãƒ³ãƒ‰ã®ãƒ“アリストーク大å¦ï¼ˆè‹±èªžç‰ˆï¼‰ã€ã‚«ãƒŠãƒ€ã®ã‚¢ãƒ«ãƒãƒ¼ã‚¿å¤§å¦ã€æ—¥æœ¬ã®ä¿¡å·žå¤§å¦ã§è¡Œã£ã¦ã„る。 Mizar-言語ã§è¨˜ã•ã‚ŒãŸè¨¼æ˜Žæ–‡ï¼ˆä»¥ä¸‹ã€Mizar-論文）ã¯æ™®é€šã®ASCIIコードã§æ›¸ã‹ã‚Œã¦ã„る。Mizar-言語ã¯ã€æ•°å¦ã®é€šå¸¸ã®è¨€è‘‰é£ã„ã¨æ›¸å¼ãŒã‚ˆã
Prototype Verification System (PVS)
PVS is a mechanized environment for formal specification and verification. PVS consists of a specification language, a large number of predefined theories, a type checker, an interactive theorem prover that supports the use of several decision procedures and a symbolic model checker, various utilities including a code generator and a random tester, documentation, formalized libraries, and examples
ACL2 Version 2.9　ACL2 is both a programming language in which you can model systems and a tool to help you prove properties of those models.　lisp
Welcome to the ACL2 home page! We highlight a few aspects of ACL2: Libraries (Books). Libraries of books (files containing definitions and theorems) extend the code that we have written. In particular, the distribution tarball includes the community books, which are contributed and maintained by the members of the ACL2 community. Documentation. There is an extensive user's manual for the ACL2 syst
WebHome < Mizar < TWiki
Mizar TWiki The Mizar web is the main collaboration area for people using the Mizar proof checker and people involved in its implementation or implementation of related software. Please do not hesitate to add/edit as many pages as you can Hint: Subscribe to WebNotify to be automatically notified when something changes in the TWiki.Mizar web Mizar Questions and Hints InstallationAndFirstArticle: Mi
ProofCafe - Schedule/ProofSummit2014
#ProofSummit 2014 æ¦‚è¦ å®šç†è¨¼æ˜Žæ”¯æ´ç³»(Coq,Agda,Isabelle/HOL,ACL2ãªã©ãªã©)や自動証明器ãªã©ã‚’ä¸å¿ƒã«é›†ã¾ã‚‹ãŠç¥ã‚Šã§ã™ã€‚ 日時: 2014å¹´09月06æ—¥(土) å ´æ‰€: åå¤å±‹å¤§å¦ 多元数ç†ç§‘å¦æ£Ÿ 109 å‚åŠ è²»: ç„¡æ–™ å‚åŠ ç™»éŒ²: ProofSummit 2014 - Partake Twitterãƒãƒƒã‚·ãƒ¥ã‚¿ã‚°: #ProofSummit æŒã¡ç‰©: ãŠã‚„ã¤ã€(é›»æºã‚¿ãƒƒãƒ—)ã€(PC) プãƒã‚°ãƒ©ãƒ 時刻 発表者(敬称略) 所属 内容
ProVerif
ProVerif: Cryptographic protocol verifier in the formal model ProVerif is an automatic cryptographic protocol verifier, in the formal model (so called Dolev-Yao model). This protocol verifier is based on a representation of the protocol by Horn clauses. Its main features are: It can handle many different cryptographic primitives, including shared- and public-key cryptography (encryption and signat
miTLS - Home
miTLS is a verified reference implementation of the TLS protocol. Our code fully supports its wire formats, ciphersuites, sessions and connections, re-handshakes and resumptions, alerts and errors, and data fragmentation, as prescribed in the RFCs; it interoperates with mainstream web browsers and servers. At the same time, our code is carefully structured to enable its modular, automated verifica
Gabriel Gonzalez æ°ã® Equational Reasoning ã‚’èªã‚“ã メモ - relations -> transitive
自分も「プãƒã‚°ãƒ©ãƒžã®ãŸã‚ã®ç‰å¼æŽ¨è«–ã€çš„ãªè¨˜äº‹æ›¸ã„ã¦ã¿ãŸã„ã¨ã‹æ€ã£ã¦ã„ã¦ã€æ‰‹é ƒãªè¨˜äº‹ã‚’æ°ãŒæœ€è¿‘書ã‹ã‚Œã¦ã„ãŸã®ã‚’æ€ã„出ã—ã€æ³¨æ„æ·±ãèªã‚€ã“ã¨ã«ã—ãŸã€‚ç´ äººãŒã¡ã‚‡ã£ã¨åˆ†ã‹ã£ãŸã¤ã‚‚ã‚Šã«ãªã‚‹ã¨äººã«æ•™ãˆãŸãŒã‚‹ã‚¢ãƒ¬ãªç—…気を発症ã—ã¦ã‚‹ã®ã§ã™ã€‚ Haskell for all: Equational reasoning 手ã§å¼ã‚’ç½®ãæ›ãˆã‚‹ã“ã¨ã«ã‚ˆã£ã¦ Haskell ã®ã‚³ãƒ¼ãƒ‰ã¯è§£é‡ˆã§ãã‚‹ ç‰å¼ã‹ã‚‰ç‰å¼ã¸ç½®ãæ›ãˆã¦å¼ã‚’解釈ã™ã‚‹ã“ã¨ã‚’ç‰å¼æŽ¨è«– (equational reasoning) ã¨ã„ㆠHaskell ã§ã¯å·¦è¾ºã¨å³è¾ºã¯ç›¸äº’ã«ç½®æ›å¯èƒ½ x = 5 ã¨ã„ã†å®£è¨€ã‚’ã—ãŸã¨ã™ã‚‹ã€‚ã“ã®ã¨ãプãƒã‚°ãƒ©ãƒ ä¸ã« x を見ã¤ã‘ãŸã‚‰æ©Ÿæ¢°çš„ã« 5 ã«ç½®ãæ›ãˆã¦ã‚ˆã„ (substitution) 。åŒæ§˜ã« 5 を見ã¤ã‘ãŸã‚‰ x ã«ç½®ãæ›ãˆã¦ã‚ˆã„ Haskell ã§ã¯ã“ã®ã‚ˆã†ãªç½®ãæ›ãˆã‚’è¡Œã£ã¦ã‚‚プãƒã‚°ãƒ©ãƒ ã®ãµã‚‹ã¾ã„ã¯å¤‰ã‚らãªã„ (å‚ç…§
sbv
sbv: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving. Express properties about Haskell programs and automatically prove them using SMT (Satisfiability Modulo Theories) solvers. [Skip to Readme] DataData.SBVData.SBV.CharData.SBV.ControlData.SBV.DynamicData.SBV.EitherData.SBV.FloatData.SBV.InternalsData.SBV.ListData.SBV.MaybeData.SBV.RationalData.SBV.RegExpData.SBV.SetData.
Proof Market
This is a proof market for Coq. The list of all problems Create a new problem Recent answers How to get proofs done for bitcoins Create a new problem wait for somebody to solve the problem on recent entries pay bitcoins see the proof How to get bitcoins for proving find a problem on the list of all problems (optional) contact possible payers solve the problem post your solution with a price and yo
定ç†è¨¼æ˜Žç³» Haskell
ã“ã®è¨˜äº‹ã¯ Haskell Advent Calendar 2013 ãŠã‚ˆã³ Theorem Prover Advent Calendar 2013 二å日目ã®è¨˜äº‹ã§ã‚ã‚Šã€æ›´ã«TCUGã®æ–°åˆŠã€ŒCoqã«ã‚ˆã‚‹å®šç†è¨¼æ˜Žã€ã®è²©ä¿ƒè¨˜äº‹ã§ã‚‚ã‚る。 型システムå†è€ƒ Haskell ã¯é™çš„型付ã言語ã 。ãã‚Œã ã‘ã§ãªãã€å¼·åŠ›ãªåž‹æŽ¨è«–や表ç¾åŠ›ã®é«˜ã„型システムを備ãˆã¦ã„る。 åž‹ã¨ã¯ä½•ã ã‚ã†ã‹ã€‚ ã“ã†ã—ãŸè³ªå•ã«å¯¾ã—ã¦ã‚ˆãã‚ã‚‹ç”ãˆã¯ã€ã€Œå€¤ã®ç¨®é¡žã‚’区別ã™ã‚‹ãŸã‚ã®ã‚¿ã‚°ã€ã«ãªã‚‹ã ã‚ã†ã‹ã€‚Intåž‹ã¯æ•´æ•°ã ã—ã€Boolåž‹ã¯çœŸå½å€¤ã§ã€[Int]åž‹ã¯æ•´æ•°å€¤ãƒªã‚¹ãƒˆã‚’表ã™åž‹ã 。ãªã‚‹ã»ã©ã€å€¤ã®ç¨®é¡žã‚’区別ã™ã‚‹ã‚‚ã®ã«è¦‹ãˆã‚‹ã€‚ ã—ã‹ã—ã€ã“ã®ç”ãˆã¯é–“é•ã£ã¦ã¯ã„ãªã„ãŒã€ã‚‚ã£ã¨ç›¸å¿œã—ã„云ã„æ–¹ãŒå‡ºæ¥ã‚‹ã ã‚ã†ã€‚ãã‚Œã¯ã€ã€Œåž‹ã¯ä¸å¤‰æ¡ä»¶ã§ã‚ã‚‹ã€ã¨ã„ã†ã‚‚ã®ã 1。ã“ã®è¨€æ˜Žã¯åˆ¥ã«ç§å›ºæœ‰ã®è¦‹æ–¹ã¨ã„ã†ã‚ã‘ã§ã¯ãªãã€ã‚る程度ã®åž‹ãƒ¬ãƒ™ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ã‚„ã£ãŸäº‹ã®ã‚る人
Matita - Home Page
27 Dec 2017 The repository of Matita has now migrated to Git. See the download page for further infos. 18 May 2016 Matita release 0.99.3 available for download. 23 December 2014 Legacy matita release 0.5.9 available for download. 13 March 2012 The Matita web app is now publicly accessible online (go). 13 March 2012 Matita release 0.99.1 available for download. 1 February 2010 Project CerCo (Certif
プãƒã‚°ãƒ©ãƒ ã«è¨¼æ˜ŽãŒä»˜ãæ—¥ | RANDMAX
ã“ã®è¨˜äº‹ã¯ã€ŒTheorem Prover Advent Calendar 2013ã€6日目ã®è¨˜äº‹ã§ã™ã€‚ http://qiita.com/advent-calendar/2013/theorem_prover 神田「野らã¼ãƒ¼ã€ã«ã¦ã€åœ°ä¸‹ã®è–„æš—ã„店内ã§â€¦ 「ãã†è¨€ãˆã°ã“ãªã„ã 隣ã§èµ·ã“ã£ã¦ãŸãƒã‚¤ãƒ³ã‚¿ã‚ªãƒ¼ãƒãƒ¼ãƒ©ãƒ³ã€å¯¾å¿œå¤§å¤‰ãã†ã ã£ãŸã§ã™ã‘ã©ã¡ã‚ƒã‚“ã¨å®¶ã«å¸°ã‚Œã¦ãŸã‚“ã§ã—ょã†ã‹ãã€æ–°å©šãªã®ã«â€¦ã€ 「ヌルãƒã¨ã‹ãƒã‚¤ãƒ³ã‚¿ã‚ªãƒ¼ãƒãƒ¼ãƒ©ãƒ³ã¨ã‹ã€ã©ã†ã—ã¦ç„¡ããªã‚‰ãªã„ã‚“ã ã‚ã†ã。ãã®æ™‚ã¯ã¿ã‚“ãªæ‰‹ã‚’抜ã„ã¦ã‚‹ã¤ã‚‚ã‚Šãªã‚“ã¦æ¯›é ãªãã¦ã€ä¸€ç”Ÿæ‡¸å‘½è€ƒãˆã¦å¤§ä¸ˆå¤«ã ã¨æ€ã£ã¦ã‚‹ã¯ãšãªã‚“ã ã‘ã©ã。レビューもã—ã¦ã€ãã‚Œã§ã‚‚èµ·ã“ã£ãŸå¾Œã§ã¿ã‚“ãªã§ã‚½ãƒ¼ã‚¹è¦‹ã¦ã¿ã‚‹ã¨ã€ãªã‚“ã§æ°—ã¥ã‹ãªã‹ã£ãŸã‚“ã よï¼ã£ã¦ã“ã¨ã«ãªã‚‹ã€‚〠「人間ã£ã¦ã€ãã†ã„ã†ã®è‹¦æ‰‹ãªã‚“ã§ã—ょã†ããã£ã¨ã€‚ã»ã‚‰ã€ã€Žä½•ã‹ã»ã‹ã«ã‚ã‚Šã¾ã›ã‚“ã‹ã€ã£ã¦èžã‹ã‚Œã¦ã‚‚出ã¦ã“ãªã„ã˜ã‚ƒãªã„ã§ã™ã‹ã€‚é™çš„ãªè§£æžã£
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
ProofSummit2014 : VSTã§Cã®æ¤œè¨¼
{{#tags}}- {{label}}
{{/tags}}