Sciweavers

1532 search results - page 239 / 307
» The Symbol Grounding Problem
Sort
View
127
Voted
CP
1998
Springer
15 years 8 months ago
Error-Correcting Source Code
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho
134
Voted
ISSTA
2010
ACM
15 years 8 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
RTA
1995
Springer
15 years 7 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
SEMWIKI
2008
154views Data Mining» more  SEMWIKI 2008»
15 years 5 months ago
Flyspeck in a Semantic Wiki
Abstract. Semantic wikis have been successfully applied to many problems in knowledge management and collaborative authoring. They are particularly appropriate for scientific and m...
Christoph Lange 0002, Sean McLaughlin, Florian Rab...
DLOG
2003
15 years 5 months ago
Conceptual Modeling with Description Logics
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...
Alexander Borgida, Ronald J. Brachman