Sciweavers

4767 search results - page 44 / 954
» Structures for Abstract Rewriting
Sort
View
VMCAI
2012
Springer
12 years 4 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
BIRTHDAY
2004
Springer
14 years 2 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
13 years 3 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
TIT
2010
94views Education» more  TIT 2010»
13 years 3 months ago
Rewriting codes for joint information storage in flash memories
Abstract--Memories whose storage cells transit irreversibly between states have been common since the start of the data storage technology. In recent years, flash memories have bec...
Anxiao Jiang, Vasken Bohossian, Jehoshua Bruck
ICDM
2009
IEEE
131views Data Mining» more  ICDM 2009»
14 years 3 months ago
Combining Super-Structuring and Abstraction on Sequence Classification
Adrian Silvescu, Cornelia Caragea, Vasant Honavar