Sciweavers

1138 search results - page 153 / 228
» First-Order Model Checking Problems Parameterized by the Mod...
Sort
View
152
Voted
SEBD
2001
145views Database» more  SEBD 2001»
15 years 4 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
101
Voted
FM
2001
Springer
118views Formal Methods» more  FM 2001»
15 years 7 months ago
Avoiding State Explosion for Distributed Systems with Timestamps
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking many distributed systems. Timestamps are often ...
Fabrice Derepas, Paul Gastin, David Plainfoss&eacu...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 6 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
111
Voted
SIGSOFT
2003
ACM
16 years 3 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
149
Voted
SIAMSC
2010
157views more  SIAMSC 2010»
15 years 1 months ago
Certified Reduced Basis Methods and Output Bounds for the Harmonic Maxwell's Equations
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
Yanlai Chen, Jan S. Hesthaven, Yvon Maday, Jer&oac...