Sciweavers

122 search results - page 1 / 25
» Computing Properties of Numerical Imperative Programs by Sym...
Sort
View
FUIN
2007
109views more  FUIN 2007»
13 years 4 months ago
Computing Properties of Numerical Imperative Programs by Symbolic Computation
We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implement...
Jacques Carette, Ryszard Janicki
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
13 years 10 months ago
Numerical optimization in hybrid symbolic-numeric computation
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Lihong Zhi
ISSTA
2006
ACM
13 years 10 months ago
Using model checking with symbolic execution to verify parallel numerical programs
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...
Stephen F. Siegel, Anastasia Mironova, George S. A...
CADE
2010
Springer
13 years 5 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
POPL
2009
ACM
14 years 5 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...