Sciweavers

SOFSEM
2009
Springer
14 years 9 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes
SOFSEM
2009
Springer
14 years 9 months ago
Epistemic Strategies and Games on Concurrent Processes
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
Konstantinos Chatzikokolakis, Sophia Knight, Praka...
SOFSEM
2009
Springer
14 years 9 months ago
Event-Clock Visibly Pushdown Automata
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
Nguyen Van Tang, Mizuhito Ogawa
SOFSEM
2009
Springer
14 years 9 months ago
Expressiveness of Multiple Heads in CHR
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...
SOFSEM
2009
Springer
14 years 9 months ago
Abstract Storage Devices
Storage Devices Robert K¨onig Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009
Robert König, Ueli M. Maurer, Stefano Tessaro
SOFSEM
2009
Springer
14 years 9 months ago
Automatic Bug Detection in Microcontroller Software by Static Program Analysis
Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and pla...
Ansgar Fehnker, Ralf Huuck, Bastian Schlich, Micha...
SOFSEM
2009
Springer
14 years 9 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach