Sciweavers

1274 search results - page 109 / 255
» Graph lambda theories
Sort
View
CIIA
2009
13 years 10 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
SCP
2002
112views more  SCP 2002»
13 years 8 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
DAC
2005
ACM
14 years 10 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche