Sciweavers

ACTA
2010
91views more  ACTA 2010»
12 years 11 months ago
A theoretical comparison of LRU and LRU-K
The paging algorithm Least Recently Used Second Last Request (LRU-2) was proposed for use in database disk buffering and shown experimentally to perform better than Least Recently ...
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S...
ACTA
2010
109views more  ACTA 2010»
13 years 4 months ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
ACTA
2010
104views more  ACTA 2010»
13 years 4 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ACTA
2010
81views more  ACTA 2010»
13 years 4 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
ACTA
2010
87views more  ACTA 2010»
13 years 4 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
ACTA
2010
117views more  ACTA 2010»
13 years 4 months ago
Symmetry and partial order reduction techniques in model checking Rebeca
Mohammad Mahdi Jaghoori, Marjan Sirjani, Mohammad ...
ACTA
2010
191views more  ACTA 2010»
13 years 4 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar