Sciweavers

314 search results - page 61 / 63
» An Imperative Object Calculus
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 12 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
IJSI
2008
91views more  IJSI 2008»
13 years 8 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
RTAS
2007
IEEE
14 years 2 months ago
Full Duplex Switched Ethernet for Next Generation "1553B"-Based Applications
Over the last thirty years, the MIL-STD 1553B data bus has been used in many embedded systems, like aircrafts, ships, missiles and satellites. However, the increasing number and c...
Ahlem Mifdaoui, Fabrice Frances, Christian Fraboul
CCA
2005
Springer
14 years 1 months ago
The Dedekind Reals in Abstract Stone Duality
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
Andrej Bauer, Paul Taylor 0002
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...