1916 search results - page 211 / 384 » Reasoning with class algebra |
HYBRID
2003
Springer
14 years 3 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
OOPSLA
1998
Springer
14 years 2 months ago
1998
Springer
Today, any large object-oriented software system is built using frameworks. Yet, designing frameworks and defining their interaction with clients remains a difficult task. A prima...
ACSAC
2004
IEEE
14 years 1 months ago
2004
IEEE
Combining an "anomaly" and a "misuse" IDSes offers the advantage of separating the monitored events between normal, intrusive or unqualified classes (ie not kn...
ARCS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract: We present a formal framework to talk and reason about dependable systems. The framework is based on three distinct classes of (system specification) properties we call s...
APLAS
2008
ACM
14 years 6 days ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...