Sciweavers

324 search results - page 16 / 65
» Model Checking Software at Compile Time
Sort
View
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 6 months ago
LinBox founding scope allocation, parallel building blocks, and separate compilation
To maximize efficiency in time and space, allocations and deallocations, in the exact linear algebra library LinBox, must always occur in the founding scope. This provides a simpl...
Jean-Guillaume Dumas, Thierry Gautier, Clém...
SIGSOFT
2005
ACM
14 years 8 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
FORMATS
2004
Springer
14 years 1 months ago
Bounded Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
VMCAI
2009
Springer
14 years 2 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler