Sciweavers

945 search results - page 35 / 189
» Incremental Branching Programs
Sort
View
APLAS
2005
ACM
14 years 1 months ago
An Abstract Interpretation Perspective on Linear vs. Branching Time
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
Francesco Ranzato, Francesco Tapparo
PAMI
2002
175views more  PAMI 2002»
13 years 7 months ago
A Multiscale Method for the Reassembly of Two-Dimensional Fragmented Objects
Helena Cristina da Gama Leitão, Jorge Stolf...
SIGSOFT
2004
ACM
14 years 8 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
POPL
2004
ACM
14 years 8 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
CAI
2009
Springer
14 years 2 months ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump