Amanote Research

Amanote Research

    RegisterSign In

Extending Coq With Imperative Features and Its Application to SAT Verification

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14052-5_8
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2010

Authors
Michaël ArmandBenjamin GrégoireArnaud SpiwackLaurent Théry
Publisher

Springer Berlin Heidelberg


Related search

Generalized Quantum Turing Machine and Its Application to the Sat Chaos Algorithm

2006English

Modular Verification of Programs With Effects and Effect Handlers in Coq

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Formalization and Verification of PLC Timers in Coq

2009English

Extending DIVINE With Symbolic Verification Using SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Construction and SAT-Based Verification of Contextual Unfoldings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

SAT-Based Compositional Verification Using Lazy Learning

English

Automatic Speechreading With Application to Speaker Verification

2002English

Tilting at Windmills With Coq: Formal Verification of a Compilation Algorithm for Parallel Moves

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Learning Additive Kernel for Feature Transformation and Its Application to CNN Features

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy