Sciweavers

738 search results - page 102 / 148
» Formal Methods: for All or for Chosen
Sort
View
MKM
2009
Springer
14 years 3 months ago
From Tessellations to Table Interpretation
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
Ramana C. Jandhyala, Mukkai S. Krishnamoorthy, Geo...
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
14 years 2 months ago
Estimating functional coverage in bounded model checking
Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all sp...
Daniel Große, Ulrich Kühne, Rolf Drechs...
CAV
2007
Springer
86views Hardware» more  CAV 2007»
14 years 2 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
PRDC
2006
IEEE
14 years 2 months ago
Detecting and Exploiting Symmetry in Discrete-state Markov Models
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
W. Douglas Obal II, Michael G. McQuinn, William H....
CODES
2003
IEEE
14 years 1 months ago
Synthesis of real-time embedded software with local and global deadlines
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
Pao-Ann Hsiung, Cheng-Yi Lin