Sciweavers

500 search results - page 9 / 100
» Quantified Conditionals and Compositionality
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 6 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 3 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
MASCOTS
2003
13 years 8 months ago
Quantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
Mingwei Gong, Carey L. Williamson
FSEN
2007
Springer
13 years 10 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
SICHERHEIT
2010
13 years 4 months ago
Quantifying the Attack Surface of a Web Application
Abstract: The attack surface of a system represents the exposure of application objects to attackers and is affected primarily by architecture and design decisions. Given otherwise...
Thomas Heumann, Sven Türpe, Jörg Keller