Sciweavers

570 search results - page 86 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
TPHOL
2005
IEEE
15 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
94
Voted
ICLP
2005
Springer
15 years 3 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
ISSTA
2010
ACM
15 years 1 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
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
15 years 11 months ago
Iconizer: A Framework to Identify and Create Effective Representations for Visual Information Encoding
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
Supriya Garg, Tamara Berg, Klaus Mueller
CSL
2004
Springer
15 years 3 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
Philipp Rohde