4469 search results - page 150 / 894 » Dynamic Program Slicing |
IPL
2007
13 years 7 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
PASTE
2004
ACM
14 years 1 months ago
2004
ACM
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...