796 search results - page 38 / 160 » The Semantics of Abstract Program Slicing |
RTAS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
ESOP
2007
Springer
14 years 2 months ago
2007
Springer
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
FOIKS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
TPHOL
2002
IEEE
14 years 25 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
TYPES
2004
Springer
14 years 1 months ago
2004
Springer
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...