Sciweavers

2488 search results - page 458 / 498
» An improvement in formal verification
Sort
View
ENTCS
2007
144views more  ENTCS 2007»
15 years 1 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
JSC
2006
71views more  JSC 2006»
15 years 1 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
PR
2008
120views more  PR 2008»
15 years 1 months ago
Fuzzy integral based information fusion for classification of highly confusable non-speech sounds
Acoustic event classification may help to describe acoustic scenes and contribute to improve the robustness of speech technologies. In this work, fusion of different information s...
Andrey Temko, Dusan Macho, Climent Nadeu
PAAPP
2006
44views more  PAAPP 2006»
15 years 1 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner
IJAR
2007
86views more  IJAR 2007»
15 years 1 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron