Sciweavers

1216 search results - page 10 / 244
» Hybrid type checking
Sort
View
PLDI
2010
ACM
15 years 2 months ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...
KBSE
2005
IEEE
15 years 3 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 3 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
JAPLL
2007
101views more  JAPLL 2007»
14 years 9 months ago
Data-driven type checking in open domain question answering
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...
Stefan Schlobach, David Ahn, Maarten de Rijke, Val...
PPDP
2010
Springer
14 years 8 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch