3342 search results - page 357 / 669 » Automating Abstract Interpretation |
126
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
150
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 ...
147
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
127
Voted
KR
2010
Springer
15 years 9 months ago
2010
Springer
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
133
click to vote
FLOPS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...