An even faster solver for general systems of equations

Christian Fecht, Helmut Seidl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.

Original languageEnglish
Title of host publicationStatic Analysis - 3rd International Symposium, SAS 1996, Proceedings
EditorsRadhia Cousot, David A. Schmidt
PublisherSpringer Verlag
Pages189-204
Number of pages16
ISBN (Print)3540617396, 9783540617396
DOIs
StatePublished - 1996
Externally publishedYes
Event3rd International Static Analysis Symposium, SAS 1996 - Aachen, Germany
Duration: 24 Sep 199626 Sep 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1145
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Static Analysis Symposium, SAS 1996
Country/TerritoryGermany
CityAachen
Period24/09/9626/09/96

Fingerprint

Dive into the research topics of 'An even faster solver for general systems of equations'. Together they form a unique fingerprint.

Cite this