Sciweavers

4737 search results - page 678 / 948
» The LOGIC negotiation model
Sort
View
DAGSTUHL
2007
15 years 8 months ago
Parallelism through Digital Circuit Design
Abstract. Two ways to exploit chips with a very large number of transistors are multicore processors and programmable logic chips. Some data parallel algorithms can be executed e...
John O'Donnell
SFP
2004
15 years 8 months ago
Disjoint forms in graphical user interfaces
Abstract: Forms are parts of a graphical user interface (GUI) that show a (structured) value and allow the user to update it. Some forms express a choice between two or more (struc...
Sander Evers, Peter Achten, Rinus Plasmeijer
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 8 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
GG
2008
Springer
15 years 8 months ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto
APAL
2007
104views more  APAL 2007»
15 years 7 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi