Sciweavers

1204 search results - page 122 / 241
» Termination of Polynomial Programs
Sort
View
HYBRID
2010
Springer
15 years 7 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
107
Voted
FASE
2009
Springer
15 years 7 months ago
Control Dependence for Extended Finite State Machines
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...
Kelly Androutsopoulos, David Clark, Mark Harman, Z...
FM
2009
Springer
92views Formal Methods» more  FM 2009»
15 years 7 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
95
Voted
PASTE
2004
ACM
15 years 6 months ago
An improved slicer for Java
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
Christian Hammer, Gregor Snelting
TPHOL
2003
IEEE
15 years 6 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd