Sciweavers

118 search results - page 20 / 24
» Constraint Functional Logic Programming over Finite Domains
Sort
View
DIMACS
1996
14 years 10 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
DAC
1995
ACM
15 years 1 months ago
Synthesis of Software Programs for Embedded Control Applications
— Software components for embedded reactive real-time applications must satisfy tight code size and runtime constraints. Cooperating finite state machines provide a convenient i...
Massimiliano Chiodo, Paolo Giusto, Attila Jurecska...
85
Voted
CP
2010
Springer
14 years 7 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
JAR
2008
89views more  JAR 2008»
14 years 9 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
ICCD
2007
IEEE
205views Hardware» more  ICCD 2007»
15 years 6 months ago
Hardware libraries: An architecture for economic acceleration in soft multi-core environments
In single processor architectures, computationallyintensive functions are typically accelerated using hardware accelerators, which exploit the concurrency in the function code to ...
David Meisner, Sherief Reda