Sciweavers

3552 search results - page 103 / 711
» Proof theory in the abstract
Sort
View
IPL
2008
118views more  IPL 2008»
15 years 6 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
JCB
2007
78views more  JCB 2007»
15 years 6 months ago
Sorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
Michal Ozery-Flato, Ron Shamir
AMC
1999
128views more  AMC 1999»
15 years 6 months ago
An elementary result in the stability theory of time-invariant nonlinear discrete dynamical systems
The stability of the equilibria of time-invariant nonlinear dynamical systems with discrete time scale is investigated. We present an elementary proof showing that in the case of ...
Weiye Li, Ferenc Szidarovszky
FMCAD
2008
Springer
15 years 7 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
ICFP
2009
ACM
16 years 7 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...