101 search results - page 2 / 21 » Proving correctness of compiler optimizations by temporal lo... |
ISSTA
2004
ACM
13 years 10 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
POPL
2004
ACM
14 years 5 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
CHARME
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
ENTCS
2007
13 years 4 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...