570 search results - page 53 / 114 » From Program Verification to Program Synthesis |
211
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
138
Voted
GECCO
1999
Springer
15 years 6 months ago
1999
Springer
This paper describes the innovative use of genetic programming (GP) to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a Ò...
222
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, t...
148
click to vote
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
137
click to vote
PPDP
2010
Springer
15 years 12 days ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...