868 search results - page 101 / 174 » Debugging for Model Expansion |
117
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
104
click to vote
ENTCS
2007
15 years 18 days ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
106
Voted
ENTCS
2002
15 years 14 days ago
2002
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
107
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
104
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...