Sciweavers

138
Voted
FSTTCS
2000
Springer
15 years 7 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
137
Voted
FSTTCS
2000
Springer
15 years 7 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
107
Voted
FSTTCS
2000
Springer
15 years 7 months ago
Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
Jan-Georg Smaus, François Fages, Pierre Der...
116
Voted
FSTTCS
2000
Springer
15 years 7 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...
101
Voted
FSTTCS
2000
Springer
15 years 7 months ago
Arithmetic Circuits and Polynomial Replacement Systems
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner