Sciweavers

1689 search results - page 3 / 338
» Refining abstract interpretations
Sort
View
DAC
2008
ACM
14 years 11 months ago
Optimizing automatic abstraction refinement for generalized symbolic trajectory evaluation
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
Yan Chen, Fei Xie, Jin Yang
VMCAI
2010
Springer
14 years 8 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 11 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
APLAS
2007
ACM
14 years 2 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan