Sciweavers

71 search results - page 6 / 15
» The Instruction-Set Extension Problem: A Survey
Sort
View
FMCO
2006
Springer
107views Formal Methods» more  FMCO 2006»
13 years 11 months ago
Learning Meets Verification
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
Martin Leucker
COMSUR
2011
230views Hardware» more  COMSUR 2011»
12 years 7 months ago
Low-Density Parity-Check Codes and Their Rateless Relatives
—This survey guides the reader through the extensive open literature that is covering the family of low-density paritycheck (LDPC) codes and their rateless relatives. In doing so...
Nicholas Bonello, Sheng Chen 0001, Lajos Hanzo
CN
2002
102views more  CN 2002»
13 years 7 months ago
Formal methods for communication services: meeting the industry expectations
We survey formal methods as they are applied to the development of communication services. We report on industrial and academic projects, consider di erent communication architect...
Falk Dietrich, Jean-Pierre Hubaux
IPPS
2005
IEEE
14 years 1 months ago
The Design of the OpenSTARS Adaptive Analyzer for Real-Time Distributed Systems
This paper describes the design of the OpenSTARS real-time analysis tool. The paper focuses on criteria for a good analysis tool including correctness, performance/scalability, fl...
Kevin Bryan, Tiegeng Ren, Jiangyin Zhang, Lisa Cin...
ENTCS
2008
103views more  ENTCS 2008»
13 years 7 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya