Sciweavers

8132 search results - page 90 / 1627
» Dependability, Abstraction, and Programming
Sort
View
FAC
2008
100views more  FAC 2008»
14 years 10 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FMSD
2010
111views more  FMSD 2010»
14 years 7 months ago
Context-aware counter abstraction
aware counter abstraction G
Gérard Basler, Michele Mazzucchi, Thomas Wa...
FROCOS
2009
Springer
15 years 4 months ago
Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
d abstract) Takahito Aoto† Toshiyuki Yamada‡
Takahito Aoto, Toshiyuki Yamada
SIAMCO
2010
110views more  SIAMCO 2010»
14 years 4 months ago
Stabilization of Second Order Evolution Equations with Unbounded Feedback with Time-Dependent Delay
der abstract second order evolution equations with unbounded feedback with time-varying delay. Existence results are obtained under some realistic assumptions. We prove the expone...
Emilia Fridman, Serge Nicaise, Julie Valein
UM
2007
Springer
15 years 4 months ago
What's in a Step? Toward General, Abstract Representations of Tutoring System Log Data
Kurt VanLehn, Kenneth R. Koedinger, Alida Skogshol...