2000 search results - page 189 / 400 » Program Transformation and Proof Transformation |
176
click to vote
NETWORKS
2011
14 years 6 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
127
click to vote
PLILP
1994
Springer
15 years 7 months ago
1994
Springer
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
140
Voted
DAGSTUHL
2003
15 years 5 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
159
Voted
CAD
2004
Springer
15 years 3 months ago
2004
Springer
: LOGO is a programming language incorporating turtle graphics, originally devised for teaching computing to young children in elementary and middle schools. Here we advocate the u...
139
click to vote
ACSD
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--The ANR project SPaCIFY develops a domainspecific programming environment, Synoptic, to engineer embedded software for space applications. Synoptic is an Eclipse-based mo...