Sciweavers

4488 search results - page 536 / 898
» Properties of NP-Complete Sets
Sort
View
SEFM
2003
IEEE
16 years 25 days ago
From Requirements to Design: Formalizing the Key Steps
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
R. Geoff Dromey
CONCUR
2003
Springer
16 years 24 days ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
EMSOFT
2003
Springer
16 years 23 days ago
Rate Monotonic vs. EDF: Judgment Day
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...
Giorgio C. Buttazzo
FM
2003
Springer
108views Formal Methods» more  FM 2003»
16 years 23 days ago
Correctness of Source-Level Safety Policies
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
Ewen Denney, Bernd Fischer 0002
ACSAC
2009
IEEE
16 years 20 days ago
A Guided Tour Puzzle for Denial of Service Prevention
Abstract—Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a l...
Mehmud Abliz, Taieb Znati