Sciweavers

5863 search results - page 437 / 1173
» On Model-Checking of P Systems
Sort
View
NC
2011
201views Neural Networks» more  NC 2011»
15 years 2 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
HUC
2007
Springer
16 years 1 months ago
Exploiting Social Interactions in Mobile Systems
Abstract. The popularity of handheld devices has created a flurry of research activity into new protocols and applications that can handle and exploit the defining characteristic...
Andrew G. Miklas, Kiran K. Gollu, Kelvin K. W. Cha...
206
Voted
WWW
2005
ACM
16 years 8 months ago
Design for verification for asynchronously communicating Web services
We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal...
Aysu Betin-Can, Tevfik Bultan, Xiang Fu
ICCAD
2004
IEEE
191views Hardware» more  ICCAD 2004»
16 years 4 months ago
Checking consistency of C and Verilog using predicate abstraction and induction
edicate Abstraction and Induction Edmund Clarke Daniel Kroening June 25, 2004 CMU-CS-04-131 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 It is common...
Daniel Kroening, Edmund M. Clarke
PLDI
2009
ACM
16 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...