6274 search results - page 165 / 1255 » Proofs, Programs, Processes |
305
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
280
click to vote
POPL
2008
ACM
16 years 6 months 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...
170
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
160
click to vote
JAR
2006
15 years 6 months ago
2006
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
147
click to vote
ISSTA
2009
ACM
16 years 27 days ago
2009
ACM
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...