×

Found 8 Documents (Results 1–8)

A formal proof of the minor-exclusion property for treewidth-two graphs. (English) Zbl 1468.68319

Avigad, Jeremy (ed.) et al., Interactive theorem proving. 9th international conference, ITP 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 9–12, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10895, 178-195 (2018).
PDFBibTeX XMLCite
Full Text: DOI HAL

Verifying B proof rules using deep embedding and automated theorem proving. (English) Zbl 1350.68236

Barthe, Gilles (ed.) et al., Software engineering and formal methods. 9th international conference, SEFM 2011, Montevideo, Uruguay, November 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24689-0/pbk). Lecture Notes in Computer Science 7041, 253-268 (2011).
MSC:  68T15 68N30 68Q60
PDFBibTeX XMLCite
Full Text: DOI

PVS embedding of cCSP semantic models and their relationship. (English) Zbl 1335.68129

Miller, Alice (ed.) et al., Proceedings of the 8th international workshop on automated verification of critical systems (AVoCS 2008), Glasgow, UK, September 30 – October 1, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 250, No. 2, 103-118 (2009).
MSC:  68Q55 68Q60 68Q85
PDFBibTeX XMLCite
Full Text: DOI

Why would you trust \(B\)? (English) Zbl 1137.68355

Dershowitz, Nachum (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 14th international conference, LPAR 2007, Yerevan, Armenia, October 15–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75558-6/pbk). Lecture Notes in Computer Science 4790. Lecture Notes in Artificial Intelligence, 288-302 (2007).
MSC:  68N30 03B70 68Q60 68T15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field