Sciweavers

793 search results - page 116 / 159
» Argumentation and standards of proof
Sort
View
69
Voted
SCP
2010
88views more  SCP 2010»
14 years 11 months ago
Incompleteness of relational simulations in the blocking paradigm
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard meth...
Eerke A. Boiten, John Derrick
109
Voted
MEMOCODE
2010
IEEE
14 years 10 months ago
Monitoring temporal SystemC properties
Monitoring temporal SystemC properties is crucial for the validation of functional and transaction-level models, yet the current SystemC standard provides no support for temporal s...
Deian Tabakov, Moshe Y. Vardi
115
Voted
IANDC
2010
132views more  IANDC 2010»
14 years 10 months ago
The expressive power of the shuffle product
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Er...
112
Voted
DASIP
2010
14 years 7 months ago
RVC-CAL dataflow implementations of MPEG AVC/H.264 CABAC decoding
This paper describes the implementation of the MPEG AVC CABAC entropy decoder using the RVC-CAL dataflow programming language. CABAC is the Context based Adaptive Binary Arithmeti...
Endri Bezati, Marco Mattavelli, Mickaël Raule...
109
Voted
TCS
2010
14 years 7 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet