1023 search results - page 48 / 205 » A Formal Method for Program Slicing |
130
click to vote
MEMOCODE
2010
IEEE
14 years 11 months ago
2010
IEEE
To overcome over-synchronization in synchronous programs, we recently introduced clock refinement to our synchronous programming language Quartz. This extension basically allows p...
SAS
2007
Springer
15 years 7 months ago
2007
Springer
abstraction on real-valued programs David Monniaux Laboratoire d’informatique de l’´Ecole normale sup´erieure 45, rue d’Ulm, 75230 Paris cedex 5, France June 30, 2007 In t...
103
click to vote
MEMOCODE
2003
IEEE
15 years 6 months ago
2003
IEEE
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
111
click to vote
SAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
122
click to vote
SAS
2001
Springer
15 years 6 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...