Sciweavers

154 search results - page 7 / 31
» Formal Verification of Exact Computations Using Newton's Met...
Sort
View
SIGSOFT
2010
ACM
14 years 7 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan
FM
2006
Springer
146views Formal Methods» more  FM 2006»
15 years 1 months ago
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
Alastair F. Donaldson, Alice Miller
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
15 years 6 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker
CSEE
2000
Springer
15 years 2 months ago
Technology Transfer Issues for Formal Methods of Software Specification
Accurate and complete requirements specifications are crucial for the design and implementation of high-quality software. Unfortunately, the articulation and verification of softw...
Ken Abernethy, John C. Kelly, Ann E. Kelley Sobel,...
APN
2004
Springer
15 years 3 months ago
Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
Olivier H. Roux, Didier Lime