SAT-Based Compositional Verification Using Lazy Learning

doi 10.1007/978-3-540-73368-3_8
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Construction and SAT-Based Verification of Contextual Unfoldings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Specification-Based Program Repair Using SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

SNNB: A Selective Neighborhood Based Naïve Bayes for Lazy Learning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Compositional and Contract-Based Verification for Autonomous Driving on Road Networks

Robotics Research
2019English

Compositional Verification of Multi-Station Interlocking Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Model-Based Compositional Verification Approaches and Tools Development for Cyber-Physical Systems

English

Set-Based SAT-solving

Facta universitatis - series: Electronics and Energetics
2007English

LEVER: A Tool for Learning Based Verification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy