Sciweavers

219 search results - page 43 / 44
» Combinatorial Complexity of Regular Languages
Sort
View
WWW
2005
ACM
14 years 6 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
SP
2006
IEEE
132views Security Privacy» more  SP 2006»
13 years 11 months ago
Towards Automatic Generation of Vulnerability-Based Signatures
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
David Brumley, James Newsome, Dawn Xiaodong Song, ...
HOTSWUP
2009
ACM
13 years 10 months ago
Automating Database Schema Evolution in Information System Upgrades
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
CONCUR
2001
Springer
13 years 10 months ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
INFORMS
1998
142views more  INFORMS 1998»
13 years 5 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol