Sciweavers

1157 search results - page 133 / 232
» Descriptive Complexity and Model Checking
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 11 months ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
ICWS
2010
IEEE
14 years 18 days ago
Script-Based Generation of Dynamic Testbeds for SOA
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...
Lukasz Juszczyk, Schahram Dustdar
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
14 years 5 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen
ICALP
1994
Springer
14 years 3 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
HYBRID
2010
Springer
14 years 6 months ago
Compositional analysis for linear control systems
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
Florian Kerber, Arjan van der Schaft