Sciweavers

4401 search results - page 785 / 881
» Computing with Default Logic
Sort
View
USENIX
2007
13 years 11 months ago
Wresting Control from BGP: Scalable Fine-Grained Route Control
Today’s Internet users and applications are placing increased demands on Internet service providers (ISPs) to deliver fine-grained, flexible route control. To assist network o...
Patrick Verkaik, Dan Pei, Tom Scholl, Aman Shaikh,...
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 11 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
AUSAI
2008
Springer
13 years 11 months ago
Working for Two: A Bidirectional Grammar for a Controlled Natural Language
This paper introduces the controlled natural language PENG Light together with a language processor that is based on a bidirectional grammar. The language processor has the followi...
Rolf Schwitter
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
13 years 11 months ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...
ISSTA
2010
ACM
13 years 11 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold