Document Search Results

Newest Citations Relevance

Satisfiability modulo bounded checking. (English) Zbl 1494.68283

de Moura, Leonardo (ed.), Automated deduction – CADE 26. 26th international conference on automated deduction, Gothenburg, Sweden, August 6–11, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10395, 114-129 (2017).

MSC: 68V15 03B16 68Q60 68T20

Cite Review PDF

Full Text: DOI HAL

Blanchette, Jasmin Christian; Böhme, Sascha; Fleury, Mathias; Smolka, Steffen Juilf; Steckermeier, Albert

Semi-intelligible Isar proofs from machine-generated proofs. (English) Zbl 1356.68178

J. Autom. Reasoning 56, No. 2, 155-200 (2016).

MSC: 68T15 03B35

Cite Review PDF

Full Text: DOI HAL

Merz, Stephan; Vanzetto, Hernán

Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers. (English) Zbl 1352.68159

Bjørner, Nikolaj (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 18th international conference, LPAR-18, Mérida, Venezuela, March 11–15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28716-9/pbk). Lecture Notes in Computer Science 7180, 289-303 (2012).

MSC: 68Q60 03B44 68T15

Cite Review PDF

Full Text: DOI HAL

Filter Results by …

Year of Publication

2017 (1)
2016 (1)
2012 (1)

Main Field

03-XX (3)
68-XX (3)

Found 3 Documents (Results 1–3)

Satisfiability modulo bounded checking. (English) Zbl 1494.68283

Semi-intelligible Isar proofs from machine-generated proofs. (English) Zbl 1356.68178

Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers. (English) Zbl 1352.68159

Filter Results by …

Document Type

Author

Year of Publication

Main Field

Software