Sciweavers

662 search results - page 40 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
116
Voted
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
15 years 6 months ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert
SPIN
2007
Springer
15 years 8 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
114
Voted
CEC
2008
IEEE
15 years 9 months ago
Finding liveness errors with ACO
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...
J. Francisco Chicano, Enrique Alba
LICS
2003
IEEE
15 years 7 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
144
Voted
FMCAD
2008
Springer
15 years 4 months ago
Word-Level Sequential Memory Abstraction for Model Checking
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
Per Bjesse