Sciweavers

788 search results - page 41 / 158
» Symbolic Equivalence Checking
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 9 months ago
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Tsung-H...
FROCOS
2000
Springer
14 years 13 days ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
RTSS
2008
IEEE
14 years 3 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
CAV
2007
Springer
108views Hardware» more  CAV 2007»
14 years 3 months ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena
CONCUR
2004
Springer
14 years 18 days ago
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Antonín Kucera, Ph. Schnoebelen