Sciweavers

160 search results - page 24 / 32
» Homomorphism preservation theorems
Sort
View
QUESTA
2008
382views more  QUESTA 2008»
14 years 9 months ago
A note on stable flow-equivalent aggregation in closed networks
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...
Giuliano Casale
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Twisting q-holonomic sequences by complex roots of unity
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
Stavros Garoufalidis, Christoph Koutschan
POPL
2006
ACM
15 years 10 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
IANDC
2008
81views more  IANDC 2008»
14 years 10 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
JSYML
2008
72views more  JSYML 2008»
14 years 10 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson