Sciweavers

231 search results - page 6 / 47
» Improvements to combinational equivalence checking
Sort
View
MEMOCODE
2008
IEEE
15 years 4 months ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot
DKE
2008
104views more  DKE 2008»
14 years 9 months ago
Improving the performance of question answering with semantically equivalent answer patterns
In this paper, we discuss a novel technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we ...
Leila Kosseim, Jamileh Yousefi
TVLSI
2008
151views more  TVLSI 2008»
14 years 9 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
ACL
2012
13 years 2 days ago
Detecting Semantic Equivalence and Information Disparity in Cross-lingual Documents
We address a core aspect of the multilingual content synchronization task: the identification of novel, more informative or semantically equivalent pieces of information in two d...
Yashar Mehdad, Matteo Negri, Marcello Federico
83
Voted
CSL
2006
Springer
15 years 1 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba