Model Checking With SAT-Based Characterization of ACTL Formulas

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-76650-6_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On-The-Fly Model Checking of RCTL Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Infinite-State Model Checking of LTLR Formulas Using Narrowing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Efficient Verified (UN)SAT Certificate Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

A Symbolic Model Checker for ACTL

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Certifying Unsatisfiability of Random 2k-Sat Formulas Using Approximation Techniques

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets

2007English

Checking Linear Temporal Formulas on Sequential Recursive Petri Nets

English

Set-Based SAT-solving

Facta universitatis - series: Electronics and Energetics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy