Sciweavers

6608 search results - page 250 / 1322
» On the Completeness of Model Checking
Sort
View
SIROCCO
2007
15 years 7 months ago
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
Rastislav Kralovic, Richard Královic
LICS
1999
IEEE
15 years 10 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
COLING
2002
15 years 5 months ago
A Complete Integrated NLG System Using AI and NLU Tools
A standard architecture for an NLG system has been defined in (Reiter and Dale, 2000). Their work describes the modularization of an NLG system and the tasks of each module. Howev...
Laurence Danlos, Adil El Ghali
ATAL
2007
Springer
16 years 2 days ago
Modular interpreted systems
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
Wojciech Jamroga, Thomas Ågotnes
ICASSP
2009
IEEE
16 years 19 days ago
Complete characterization of perfectly secure stego-systems with mutually independent embedding operation
Without any assumption on the cover source, this paper presents a complete characterization of all perfectly secure stego-systems that employ mutually independent embedding operat...
Tomás Filler, Jessica J. Fridrich