Sciweavers

258 search results - page 7 / 52
» Static Semantics as Program Transformation and Well-founded ...
Sort
View
ASP
2001
Springer
14 years 13 days ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
ESOP
2003
Springer
14 years 1 months ago
Finite Differencing of Logical Formulas for Static Analysis
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...
Thomas W. Reps, Shmuel Sagiv, Alexey Loginov
NMELP
1994
14 years 1 hour ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
RTA
2007
Springer
14 years 2 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 2 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto