Amanote Research

Amanote Research

    RegisterSign In

Invariant and Type Inference for Matrices

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-11319-2_14
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2010

Authors
Thomas A. HenzingerThibaud HottelierLaura KovácsAndrei Voronkov
Publisher

Springer Berlin Heidelberg


Related search

Infinite Matrices and Invariant Means

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

From Invariant Checking to Invariant Inference Using Randomized Search

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Perturbation Bounds for Isotropic Invariant Subspaces of Skew-Hamiltonian Matrices

SIAM Journal on Matrix Analysis and Applications
Analysis
2005English

Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Hölder Type Inequalities for Matrices

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
1998English

Type Qualifier Inference for Java

2007English

The Space of Positive Definite Matrices and Gromov’s Invariant

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Type Inference and Type Checking for Queries on Execution Traces

Proceedings of the VLDB Endowment
Computer Science
2008English

Polymorphic Type Inference for Machine Code

ACM SIGPLAN Notices
Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy