442 search results - page 59 / 89 » Proof Abstraction for Imperative Languages |
APLAS
2003
ACM
14 years 9 days ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
ACTA
2010
13 years 8 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
GC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
CC
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
ERSHOV
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...