977 search results - page 92 / 196 » Logic programming with infinite sets |
194
Voted
POPL
2008
ACM
16 years 26 days ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
111
Voted
IFIP
2009
Springer
14 years 10 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
111
Voted
AIR
2004
15 years 13 days ago
2004
In this paper we describe an approach to the construction of adaptive tutoring systems, based on techniques from the research area of Reasoning about Actions and Change. This appro...
137
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
136
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...