390 search results - page 40 / 78 » Using Graph Transformations and Graph Abstractions for Softw... |
SIGSOFT
2006
ACM
14 years 9 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
DAC
1994
ACM
14 years 23 days ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
FASE
2009
Springer
14 years 16 days ago
2009
Springer
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....
DIAGRAMS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We present a brief description of the design of a diagrambased system that supports the development of thinking about mathematical generalisation. Within the software, th...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...