756 search results - page 135 / 152 » Using Logic Programs to Reason about Infinite Sets |
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
One of the main reasons behind unfruitful software development projects is that it is often too late to correct the problems by the time they are detected. It clearly indicates th...
CONCUR
1997
Springer
14 years 18 days ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
PEPM
2010
ACM
13 years 10 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
TACAS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....