Amanote Research

Amanote Research

    RegisterSign In

Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02658-4_44
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
Sven VerdoolaegeGerda JanssensMaurice Bruynooghe
Publisher

Springer Berlin Heidelberg


Related search

Equivalence Checking of Arithmetic Expressions Using Fast Evaluation

2005English

Client-Specific Equivalence Checking

2018English

An Efficient Equivalence-Checking Algorithm for a Model of Programs With Commutative and Absorptive Statements

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2016English

Model Checking Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets

2007English

Verification of Concurrent Quantum Protocols by Equivalence Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Equivalence Checking for High-Assurance Behavioral Synthesis

2000English

Tightening Test Coverage Metrics: A Case Study in Equivalence Checking Using K-Induction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Static Checking of Interprocess Communication in ECSP

ACM SIGPLAN Notices
1984English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy