499 search results - page 75 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
134
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
148
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
128
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
133
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
166
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...