4074 search results - page 456 / 815 » Abstract Graph Transformation |
193
click to vote
ESTIMEDIA
2003
Springer
16 years 1 days ago
2003
Springer
In order to extensively explore design space one has to specify a n a very abstract level. Transforming a specification into a correct implementation is usually an error prone tas...
177
Voted
PADO
2001
Springer
15 years 11 months ago
2001
Springer
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
187
click to vote
AMAST
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
185
click to vote
FM
1997
Springer
15 years 11 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
172
click to vote
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...