1036 search results - page 66 / 208 » Verification Programs for Abduction |
SAC
2008
ACM
15 years 8 days ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
79
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
100
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
95
Voted
ENTCS
2006
15 years 24 days ago
2006
The Web poses novel and interesting problems for both programming language design and verification--and their intersection. This paper provides a personal outline of one thread of...
207
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...