Sciweavers

506 search results - page 19 / 102
» Where Is the Value in a Program Verifier
Sort
View
92
Voted
PADL
2010
Springer
15 years 9 months ago
First-Order Interactive Programming
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
Roly Perera
NIPS
1993
15 years 1 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
SIGSOFT
2004
ACM
16 years 1 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 5 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
ICFP
2000
ACM
15 years 4 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning