Sciweavers

571 search results - page 79 / 115
» Domain Theory in Logical Form
Sort
View
MICRO
2006
IEEE
159views Hardware» more  MICRO 2006»
14 years 9 months ago
MRF Reinforcer: A Probabilistic Element for Space Redundancy in Nanoscale Circuits
Shrinking devices to the nanoscale, increasing integration densities, and reducing of voltage levels down to the thermal limit, all conspire to produce faulty systems. Frequent oc...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
ICFP
2008
ACM
15 years 9 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
LATA
2010
Springer
15 years 7 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
MKM
2007
Springer
15 years 3 months ago
Narrative Structure of Mathematical Texts
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
Fairouz Kamareddine, Manuel Maarek, Krzysztof Rete...
CADE
2010
Springer
14 years 10 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer