Sciweavers

TOCL
2008
102views more  TOCL 2008»
13 years 11 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
TOCL
2008
46views more  TOCL 2008»
13 years 11 months ago
Program termination and well partial orderings
Andreas Blass, Yuri Gurevich
TOCL
2008
46views more  TOCL 2008»
13 years 11 months ago
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
Agostino Dovier, Carla Piazza, Gianfranco Rossi
TOCL
2008
86views more  TOCL 2008»
13 years 11 months ago
Conjunctive query containment and answering under description logic constraints
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
TOCL
2008
78views more  TOCL 2008»
13 years 11 months ago
Contextual modal type theory
Aleksandar Nanevski, Frank Pfenning, Brigitte Pien...
TOCL
2008
113views more  TOCL 2008»
13 years 11 months ago
Abstract state machines capture parallel algorithms: Correction and extension
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
Andreas Blass, Yuri Gurevich
TOCL
2008
52views more  TOCL 2008»
13 years 11 months ago
Durations and parametric model-checking in timed automata
Véronique Bruyère, Emmanuel Dall'Oli...