Sciweavers

Share
FSTTCS
2000
Springer
9 years 6 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz
FSTTCS
2000
Springer
9 years 6 months ago
Dynamically Ordered Probabilistic Choice Logic Programming
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
Marina De Vos, Dirk Vermeir
FSTTCS
2000
Springer
9 years 6 months ago
Formal Verification of the Ricart-Agrawala Algorithm
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ar...
FSTTCS
2000
Springer
9 years 6 months ago
Arithmetic Circuits and Polynomial Replacement Systems
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
FSTTCS
2000
Springer
9 years 6 months ago
Inheritance in the Join Calculus
We propose an object-oriented calculus with internal concurrency and class-based inheritance that is built upon the join calculus. Method calls, locks, and states are handled in a...
Cédric Fournet, Cosimo Laneve, Luc Maranget...
FSTTCS
2000
Springer
9 years 6 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
FSTTCS
2000
Springer
9 years 6 months ago
An Algebra for XML Query
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...
books