1278 search results - page 214 / 256 » On the Semantics of Logic Program Composition |
179
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
162
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
144
Voted
SIGSOFT
2002
ACM
16 years 5 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
142
click to vote
FTRTFT
1998
Springer
15 years 8 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
140
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...