6829 search results - page 40 / 1366 » Quantitative Generalizations of Languages |
102
Voted
ESOP
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
80
Voted
LREC
2010
15 years 2 months ago
2010
Transliteration is the rendering in one language of terms from another language (and, possibly, another writing system), approximating spelling and/or phonetic equivalents between...
88
Voted
SIGSOFT
2006
ACM
16 years 1 months ago
2006
ACM
It is usually assumed that the implementation of exception handling can be better modularized by the use of aspectoriented programming (AOP). However, the trade-offs involved in u...
95
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
133
click to vote
ACL
2010
14 years 10 months ago
2010
Probabilistic latent topic models have recently enjoyed much success in extracting and analyzing latent topics in text in an unsupervised way. One common deficiency of existing to...