Results 241 to 250 of about 3,768,784 (298)
Some of the next articles are maybe not open access.

Related searches:

Safraless Decision Procedures

46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the tree-model property is satisfiable, one constructs an automaton that accepts all (or enough) tree models of the formula and then checks that the language of this automaton is
Orna Kupferman, Moshe Y. Vardi
openaire   +2 more sources

Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems, 1979
A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectives, the equality predicate =, the conditional function
Greg Nelson, Derek C. Oppen
openaire   +3 more sources

Combining Decision Procedures

2003
We give a detailed survey of the current state-of-the-art methods for combining decision procedures. We review the Nelson-Oppen combination method, Shostak method, and some very recent results on the combination of theories over non-disjoint signatures.
Zohar Manna, Calogero G. Zarba
openaire   +1 more source

Decision Procedures for Simulatability

2012
We address the question of automatically proving security theorems in the universally composable (UC) model for ideal and real functionalities composed of if-then-else programs with uniform random number generation and data objects from the additive group of \({\mathbb F}_{2^m}\). We prove that for this restricted yet powerful language framework, there
Charanjit S. Jutla, Arnab Roy 0001
openaire   +1 more source

Home - About - Disclaimer - Privacy