Sciweavers

106 search results - page 14 / 22
» Light Logics and Optimal Reduction: Completeness and Complex...
Sort
View
CSL
2009
Springer
14 years 2 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
CHI
1998
ACM
13 years 11 months ago
Adapting User Interface Design Methods to the Design of Educational Activities
considered simply, but a more complex evaluation of the effects of performing the tasks. For example, an educational activity that learners complete quickly and accurately is of no...
Clayton Lewis, Cathy Brand, Gina Cherry, Cyndi Rad...
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
14 years 28 days ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong
FOIKS
2006
Springer
13 years 11 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh