Sciweavers

116 search results - page 10 / 24
» Automatic Abstraction for Intervals Using Boolean Formulae
Sort
View
MOC
2000
91views more  MOC 2000»
14 years 9 months ago
A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
Dongwoo Sheen, Ian H. Sloan, Vidar Thomée
ASM
2010
ASM
15 years 1 days ago
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
David Déharbe
DAC
2006
ACM
15 years 10 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
CP
2008
Springer
14 years 11 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
CORR
2011
Springer
217views Education» more  CORR 2011»
14 years 4 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...