Sciweavers

1763 search results - page 144 / 353
» A Formalization of Polytime Functions
Sort
View
IWFM
2003
14 years 11 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
ENTCS
2010
107views more  ENTCS 2010»
14 years 10 months ago
PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems
In this paper, we present a formal model, named PobSAM (Policy-based Self-Adaptive Model), for modeling self-adaptive systems. In this model, policies are used as a mechanism to d...
Narges Khakpour, Saeed Jalili, Carolyn L. Talcott,...
ICFP
2003
ACM
15 years 10 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 7 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
ECAI
1998
Springer
15 years 1 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler