Sciweavers

181 search results - page 5 / 37
» Effective characterizations of tree logics
Sort
View
160
Voted
PE
2010
Springer
175views Optimization» more  PE 2010»
14 years 10 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
123
Voted
CSL
2006
Springer
15 years 7 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
127
Voted
CADE
2006
Springer
15 years 7 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
133
Voted
ICFP
2010
ACM
15 years 4 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
116
Voted
FOIS
2006
15 years 5 months ago
Simultaneous Events and the "Once-Only" Effect
Abstract. Some events recur, and some happen only once. Galton refers to the latter as "once-only" events [1]. In a first-order logic of events that makes a type-token di...
Haythem O. Ismail