Sciweavers

2000 search results - page 209 / 400
» Program Transformation and Proof Transformation
Sort
View
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 7 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
ICMT
2009
Springer
15 years 10 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
CGO
2006
IEEE
15 years 10 months ago
BIRD: Binary Interpretation using Runtime Disassembly
The majority of security vulnerabilities published in the literature are due to software bugs. Many researchers have developed program transformation and analysis techniques to au...
Susanta Nanda, Wei Li, Lap-Chung Lam, Tzi-cker Chi...
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
15 years 10 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
CSL
2009
Springer
15 years 10 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux