Sciweavers

1210 search results - page 182 / 242
» Specifying Precise Use Cases with Use Case Charts
Sort
View
MLQ
2008
63views more  MLQ 2008»
13 years 8 months ago
Generic cuts in models of arithmetic
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
Richard Kaye
LISP
2006
160views more  LISP 2006»
13 years 8 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 3 months ago
Saner: Composing Static and Dynamic Analysis to Validate Sanitization in Web Applications
Web applications are ubiquitous, perform missioncritical tasks, and handle sensitive user data. Unfortunately, web applications are often implemented by developers with limited se...
Davide Balzarotti, Marco Cova, Viktoria Felmetsger...
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 9 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu