Amanote Research

Amanote Research

    RegisterSign In

Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-10936-7_3
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Alexey BakhirkinJosh BerdineNir Piterman
Publisher

Springer International Publishing


Related search

Approximate Shape Fitting via Linearization

2001English

Approximate Forward–backward Algorithm for a Switching Linear Gaussian Model

Computational Statistics and Data Analysis
StatisticsProbabilityApplied MathematicsComputational TheoryComputational MathematicsMathematics
2011English

Fast Approximate Energy Minimization via Graph Cuts

1999English

18) Approximate Analysis of the Rectangular Frames Under the Horizontal Forces.

Transactions of the Institute of Japanese Architects
1936English

Adaptive Optimal Observer Design via Approximate Dynamic Programming

2017English

Approximate Maxima

Fundamenta Mathematicae
Number TheoryAlgebra
1977English

Approximate Inference

2017English

Correction To: New Algorithms for Fixed-Length Approximate String Matching and Approximate Circular String Matching Under the Hamming Distance

Journal of Supercomputing
HardwareInformation SystemsTheoretical Computer ScienceArchitectureSoftware
2018English

Mitigation of Coincident Peak Charges via Approximate Dynamic Programming

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy