Sciweavers

1461 search results - page 89 / 293
» Analysis of Constraint Logic Programs
Sort
View
JUCS
2006
175views more  JUCS 2006»
14 years 9 months ago
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
Anderson Faustino da Silva, Vítor Santos Co...
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
SIGSOFT
2000
ACM
15 years 2 months ago
Automating first-order relational logic
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
Daniel Jackson
TOOLS
1999
IEEE
15 years 2 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent
CSL
2004
Springer
15 years 3 months ago
Set Constraints on Regular Terms
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
Pawel Rychlikowski, Tomasz Truderung