Sciweavers

2607 search results - page 55 / 522
» Complete Functional Synthesis
Sort
View
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 3 months ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
FMCAD
2009
Springer
15 years 10 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
TPDS
1998
124views more  TPDS 1998»
15 years 3 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ISPASS
2003
IEEE
15 years 8 months ago
Complete instrumentation requirements for performance analysis of Web based technologies
In this paper we present the eDragon environment, a research platform created to perform complete performance analysis of new Web-based technologies. eDragon enables the understan...
David Carrera, Jordi Guitart, Jordi Torres, Eduard...
IANDC
2010
151views more  IANDC 2010»
15 years 1 months ago
Complete sets of cooperations
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
Clemens Kupke, Jan J. M. M. Rutten