169 search results - page 16 / 34 » Implementing fault-tolerance in real-time programs by automa... |
164
click to vote
RTA
2011
Springer
14 years 2 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
112
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
105
click to vote
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
SCAM
2008
IEEE
15 years 6 months ago
2008
IEEE
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...