4469 search results - page 435 / 894 » Dynamic Program Slicing |
173
click to vote
ACL
2011
14 years 10 months ago
2011
We investigate full-scale shortest-derivation parsing (SDP), wherein the parser selects an analysis built from the fewest number of training fragments. Shortest derivation parsing...
204
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
205
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
255
click to vote
PEPM
2011
ACM
14 years 9 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
193
click to vote
ICLP
2005
Springer
16 years 16 days ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...