Sciweavers

2777 search results - page 469 / 556
» Example centric programming
Sort
View
SIGSOFT
2003
ACM
14 years 10 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
ESORICS
2009
Springer
14 years 10 months ago
Reliable Evidence: Auditability by Typing
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
Nataliya Guts, Cédric Fournet, Francesco Za...
HPCA
2006
IEEE
14 years 10 months ago
Phase characterization for power: evaluating control-flow-based and event-counter-based techniques
Computer systems increasingly rely on dynamic, phasebased system management techniques, in which system hardware and software parameters may be altered or tuned at runtime for dif...
Canturk Isci, Margaret Martonosi
ICALP
2009
Springer
14 years 10 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner