An abstraction-based decision procedure for bit-vector arithmetic

2009 ◽  
Vol 11 (2) ◽  
pp. 95-104 ◽  
Author(s):  
Randal E. Bryant ◽  
Daniel Kroening ◽  
Joël Ouaknine ◽  
Sanjit A. Seshia ◽  
Ofer Strichman ◽  
...  
Keyword(s):  
Decision Procedure ◽  
Bit Vector

A Decision Procedure for Bit-Vector Arithmetic

1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt
Keyword(s):  
Decision Procedure ◽  
Bit Vector

On How Bit-Vector Logic Can Help Verify LTL-based Specifications

2020 ◽  
pp. 1-1
Author(s):  
Mohammad Mehdi Pourhashem Kallehbasti ◽  
Matteo Giovanni Rossi ◽  
Luciano Baresi
Keyword(s):  
Bit Vector

Multi-modal actuation with the activation bit vector machine

2021 ◽  
Vol 66 ◽  
pp. 162-175
Author(s):  
H.R. Schmidtke
Keyword(s):  
Bit Vector

An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until1

1992 ◽  
Vol 17 (3) ◽  
pp. 271-282
Author(s):  
Y.S. Ramakrishna ◽  
L.E. Moser ◽  
L.K. Dillon ◽  
P.M. Melliar-Smith ◽  
G. Kutty
Keyword(s):  
Temporal Logic ◽  
Decision Procedure ◽  
Linear Time ◽  
Computer Systems ◽  
Hierarchical Abstraction ◽  
Soundness And Completeness

We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and refinement and make reasoning about concurrency difficult. A proof of the soundness and completeness of the decision procedure is given, and its complexity is analyzed.

Deciding Clause Classes by Semantic Clash Resolution

1993 ◽  
Vol 18 (2-4) ◽  
pp. 163-182
Author(s):  
Alexander Leitsch
Keyword(s):  
Decision Procedure ◽  
Decision Procedures ◽  
General Concept ◽  
Complexity Measure ◽  
Syntactical Structure

It is investigated, how semantic clash resolution can be used to decide some classes of clause sets. Because semantic clash resolution is complete, the termination of the resolution procedure on a class Γ gives a decision procedure for Γ. Besides generalizing earlier results we investigate the relation between termination and clause complexity. For this purpose we define the general concept of atom complexity measure and show some general results about termination in terms of such measures. Moreover, rather than using fixed resolution refinements we define an algorithmic generator for decision procedures, which constructs appropriate semantic refinements out of the syntactical structure of the clause sets. This method is applied to the Bernays – Schönfinkel class, where it gives an efficient (resolution) decision procedure.

Sign in / Sign up

Export Citation Format

Share Document