Sciweavers

2000 search results - page 267 / 400
» Program Transformation and Proof Transformation
Sort
View
129
Voted
WORDS
2003
IEEE
15 years 9 months ago
Input-Dependency Analysis for Hard Real-Time Software
The execution time of software for hard real-time systems must be predictable. Further, safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be com...
Jan Gustafsson, Björn Lisper, Raimund Kirner,...
ESOP
2003
Springer
15 years 9 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
129
Voted
GPCE
2003
Springer
15 years 9 months ago
ANEMIC: Automatic Interface Enabler for Model Integrated Computing
A domain-specific language provides domain experts with a abstraction for creating computer programs. As more and more domains embrace computers, programmers are tapping into this...
Steven Nordstrom, Shweta Shetty, Kumar Gaurav Chho...
118
Voted
SCAM
2002
IEEE
15 years 8 months ago
Parallel Support for Source Code Analysis and Modification
Tools that analyze and enhance large-scale software systems using symbolic reasoning are computationally expensive, and yet processors are cheap. We believe that enabling tools wi...
Ira D. Baxter
GI
2009
Springer
15 years 8 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...