1216 search results - page 85 / 244 » Hybrid type checking |
113
Voted
LCPC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Many parallel programs are written in a single-program, multipledata (SPMD) style, in which synchronization is provided using collective operations that all threads execu...
269
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We present a framework that unifies unit testing and runtime verification (as well as static verification and static debugging). A key contribution of our overall approac...
143
Voted
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 ...
119
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
This paper introduces GC assertions, a system interface that programmers can use to check for errors, such as data structure invariant violations, and to diagnose performance prob...
133
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...