Sciweavers

1895 search results - page 132 / 379
» Using ATL for Checking Models
Sort
View
135
Voted
ISMVL
2010
IEEE
188views Hardware» more  ISMVL 2010»
15 years 10 months ago
MDGs Reduction Technique Based on the HOL Theorem Prover
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...
Sa'ed Abed, Otmane Aït Mohamed
BMCBI
2005
99views more  BMCBI 2005»
15 years 4 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
15 years 11 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun
WWW
2004
ACM
16 years 5 months ago
A combined approach to checking web ontologies
The understanding of Semantic Web documents is built upon ontologies that define concepts and relationships of data. Hence, the correctness of ontologies is vital. Ontology reason...
Jin Song Dong, Chew Hung Lee, Hian Beng Lee, Yuan-...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 9 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan