Certification of Termination Proofs Using CeTA

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-03359-9_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Complexity Tradeoff in Ranking-Function Termination Proofs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2008English

Efficient Certification and Zero-Knowledge Proofs of Knowledge on Infrastructure Topology Graphs

2014English

Efficient Certification of Complexity Proofs: Formalizing the Perron–Frobenius Theorem (Invited Talk Paper)

2018English

Guaranteed Proofs Using Interval Arithmetic

English

Proofs About Lists Using Ellipsis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

L’exemple Du CETA Pour Les Rapports Futurs Union Européenne / Royaume-Uni – Et Le Report Du CETA ?

Quebec Journal of International Law
Law
2017English

CETA, an Innovative Agreement With Many Unsettled Trajectories

Open Journal of Political Science
2020English

Using Ontologies in Formal Developments Targeting Certification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy