Sciweavers

4211 search results - page 241 / 843
» Types as Abstract Interpretations
Sort
View
POPL
1998
ACM
15 years 10 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
150
Voted
VMCAI
2009
Springer
16 years 24 days ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
ATVA
2009
Springer
158views Hardware» more  ATVA 2009»
16 years 18 days ago
Logahedra: A New Weakly Relational Domain
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
Jacob M. Howe, Andy King
CDC
2008
IEEE
121views Control Systems» more  CDC 2008»
16 years 15 days ago
Lossless scalar functions: Boundary interpolation, Schur algorithm and Ober's canonical form
Abstract— In [1] a balanced canonical form for continuoustime lossless systems was presented. This form has a tridiagonal dynamical matrix A and the useful property that the corr...
Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters
CIARP
2007
Springer
16 years 6 days ago
Learning in Computer Vision: Some Thoughts
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...
Maria Petrou