Sciweavers

2540 search results - page 280 / 508
» Abstract Logics as Dialgebras
Sort
View
119
Voted
ICFP
2003
ACM
16 years 22 days ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
90
Voted
PERCOM
2005
ACM
16 years 11 days ago
Middleware for User Controlled Environments
In this paper, we describe the middleware that has evolved from our attempt to capture user descriptions of policies controlling devices and services from natural language. Descri...
Bill Keller, Tim Owen, Ian Wakeman, Julie Weeds, D...
LATA
2010
Springer
15 years 10 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
HIPEAC
2010
Springer
15 years 10 months ago
Scalable Shared-Cache Management by Containing Thrashing Workloads
Abstract. Multi-core processors with shared last-level caches are vulnerable to performance inefficiencies and fairness issues when the cache is not carefully managed between the m...
Yuejian Xie, Gabriel H. Loh
105
Voted
PADL
2010
Springer
15 years 9 months ago
Prospective Storytelling Agents
Abstract. Prospective Logic Programming is a declarative framework supporting the specification of autonomous agents capable of anticipating and reasoning about hypothetical futur...
Gonçalo Lopes, Luís Moniz Pereira