Sciweavers

4488 search results - page 199 / 898
» Properties of NP-Complete Sets
Sort
View
APSCC
2009
IEEE
14 years 3 months ago
Modeling and testing of cloud applications
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
W. K. Chan, Lijun Mei, Zhenyu Zhang
SPIN
2007
Springer
14 years 2 months ago
BEEM: Benchmarks for Explicit Model Checkers
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their corr...
Radek Pelánek
DATE
2005
IEEE
96views Hardware» more  DATE 2005»
14 years 2 months ago
Structural Testing Based on Minimum Kernels
Structural testing techniques, such as statement and branch coverage, play an important role in improving dependability of software systems. However, finding a set of tests which...
Elena Dubrova
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
14 years 1 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
FOSSACS
2004
Springer
14 years 1 months ago
A Game Semantics of Local Names and Good Variables
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
James Laird