Sciweavers

1422 search results - page 80 / 285
» Complementation in Abstract Interpretation
Sort
View
FOSSACS
1998
Springer
15 years 8 months ago
Functor Categories and Two-Level Languages
Abstract. We propose a denotational semantics for the two-level language of [GJ91, Gom92], and prove its correctness w.r.t. a standard denotational semantics. Other researchers (se...
Eugenio Moggi
120
Voted
PLILP
1993
Springer
15 years 8 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
151
Voted
VMCAI
2010
Springer
16 years 1 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
DAC
2003
ACM
15 years 9 months ago
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
Mehrdad Reshadi, Prabhat Mishra, Nikil D. Dutt
143
Voted
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
15 years 11 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King