Sciweavers

1356 search results - page 50 / 272
» The ideal of verified software
Sort
View
COMSIS
2006
129views more  COMSIS 2006»
14 years 12 months ago
Constraint-Based Knowledge Representation for Individualized Instruction
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
Stellan Ohlsson, Antonija Mitrovic
JAR
2008
77views more  JAR 2008»
14 years 11 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
JCT
2008
81views more  JCT 2008»
14 years 11 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
IGPL
2010
101views more  IGPL 2010»
14 years 10 months ago
Does collective rationality entail efficiency?
Collective rationality in its ordinary sense is rationality’s extension to groups. It does not entail efficiency by definition. Showing that it entails efficiency requires a nor...
Paul Weirich
METRICS
2003
IEEE
15 years 5 months ago
When Can We Test Less?
When it is impractical to rigorously assess all parts of complex systems, test engineers use defect detectors to focus their limited resources. In this article, we define some pr...
Tim Menzies, Justin S. Di Stefano, Kareem Ammar, K...