144
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...
150
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
198
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
129
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
122
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
106
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
129
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
186
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
152
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...