Sciweavers

788 search results - page 112 / 158
» Symbolic Equivalence Checking
Sort
View
ECCC
2007
88views more  ECCC 2007»
13 years 7 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
STTT
2008
95views more  STTT 2008»
13 years 7 months ago
FAST: acceleration from theory to practice
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
Sébastien Bardin, Alain Finkel, Jér&...
SYNTHESE
2008
114views more  SYNTHESE 2008»
13 years 7 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
TSP
2008
95views more  TSP 2008»
13 years 7 months ago
Pilotless Frame Synchronization for LDPC-Coded Transmission Systems
Abstract--We present a pilotless frame synchronization approach that exploits feedback from a low-density parity-check (LDPC) code decoder. The synchronizer is based on syndrome ch...
Dong-U Lee, Hyungjin Kim, Christopher R. Jones, Jo...
ENTCS
2002
139views more  ENTCS 2002»
13 years 7 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman