Sciweavers

1715 search results - page 81 / 343
» Domain-Specific Program Checking
Sort
View
CADE
2002
Springer
16 years 2 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ISSTA
2004
ACM
15 years 7 months ago
Model checking XML manipulating software
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...
Xiang Fu, Tevfik Bultan, Jianwen Su
CODES
2008
IEEE
15 years 4 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner
PPDP
2010
Springer
15 years 24 days ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
CGO
2011
IEEE
14 years 6 months ago
Practical memory checking with Dr. Memory
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
Derek Bruening, Qin Zhao