Sciweavers

1449 search results - page 97 / 290
» Finiteness results for sigmoidal
Sort
View
SIGSOFT
2005
ACM
16 years 7 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ICCAD
2006
IEEE
111views Hardware» more  ICCAD 2006»
16 years 3 months ago
State re-encoding for peak current minimization
In a synchronous finite state machine (FSM), huge current peaks are often observed at the moment of state transition. Previous low power state encoding algorithms focus on the red...
Shih-Hsu Huang, Chia-Ming Chang, Yow-Tyng Nieh
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
15 years 7 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
APAL
2006
57views more  APAL 2006»
15 years 6 months ago
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...