Sciweavers

2540 search results - page 18 / 508
» Abstract Logics as Dialgebras
Sort
View
VMCAI
2010
Springer
14 years 7 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
STACS
2009
Springer
14 years 4 months ago
Weak MSO with the Unbounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Mikolaj Bojanczyk
ISCAS
2006
IEEE
122views Hardware» more  ISCAS 2006»
14 years 4 months ago
A new look at reversible memory elements
Abstract— Although many researchers are investigating techniques to synthesize reversible combinational logic, there is little work in the area of sequential reversible logic. We...
Jacqueline E. Rice
IPPS
2006
IEEE
14 years 4 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
CSCW
2000
ACM
14 years 2 months ago
Composable collaboration infrastructures based on programming patterns
In general, collaboration infrastructures have supported sharing of an object based on its logical structure. However, current implementations assume an implicit binding between t...
Vassil Roussev, Prasun Dewan, Vibhor V. Jain