Sciweavers

788 search results - page 88 / 158
» Symbolic Equivalence Checking
Sort
View
ECAI
2000
Springer
14 years 3 days ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
LREC
2008
115views Education» more  LREC 2008»
13 years 9 months ago
Generating Bilingual Dictionaries by Transitivity
Recently the LATL has undertaken the development of a multilingual translation system based on a symbolic parsing technology and on a transfer-based translation model. A crucial c...
Luka Nerima, Eric Wehrli
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
CAV
2003
Springer
166views Hardware» more  CAV 2003»
14 years 1 months ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli