Sciweavers

1073 search results - page 5 / 215
» Formal Program Development with Approximations
Sort
View
AIPS
2007
13 years 9 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
TPHOL
2003
IEEE
14 years 22 days ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
ZUM
1994
Springer
147views Formal Methods» more  ZUM 1994»
13 years 11 months ago
Integrating Formal Methods into a Professional Master of Software Engineering Program
A critical issuein the designof aprofessionalsoftware engineeringdegreeprogram is the way in which formal methods are integrated into the curriculum. The approach taken by most pr...
David Garlan
WCRE
1995
IEEE
13 years 11 months ago
Strongest Postcondition Semantics as the Formal Basis for Reverse Engineering
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng
ICPR
2008
IEEE
14 years 1 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov