Sciweavers

16 search results - page 3 / 4
» Set-Based Failure Analysis for Logic Programs and Concurrent...
Sort
View
AADEBUG
2000
Springer
13 years 9 months ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
SAC
2010
ACM
13 years 11 months ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin
IJFCS
2006
119views more  IJFCS 2006»
13 years 4 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
CADE
2004
Springer
14 years 5 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
13 years 9 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...