122 search results - page 12 / 25 » Computing Properties of Numerical Imperative Programs by Sym... |
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
ENTCS
2010
14 years 9 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
JVA
2006
IEEE
15 years 5 months ago
2006
IEEE
History repeats itself. Since the invention of the programmable computer, numerous computer scientists keep dedicating their professional lives to the design of “the single, bes...
TEC
2008
14 years 11 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
115
click to vote
TAP
2010
Springer
14 years 9 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...