Sciweavers

796 search results - page 121 / 160
» The Semantics of Abstract Program Slicing
Sort
View
ICFEM
2007
Springer
14 years 2 months ago
Model Checking with SAT-Based Characterization of ACTL Formulas
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
Wenhui Zhang
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
MPC
2004
Springer
116views Mathematics» more  MPC 2004»
14 years 1 months ago
An Injective Language for Reversible Computation
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi
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
ICCL
1992
IEEE
14 years 11 hour ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg