Sciweavers

261 search results - page 9 / 53
» Can Flash Memory Help in Model Checking
Sort
View
ASPLOS
1996
ACM
15 years 6 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
SPIN
2007
Springer
15 years 8 months ago
Tutorial: Parallel Model Checking
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
Lubos Brim, Jiri Barnat
132
Voted
ATAL
2010
Springer
15 years 2 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
109
Voted
TACAS
2005
Springer
112views Algorithms» more  TACAS 2005»
15 years 8 months ago
Truly On-the-Fly LTL Model Checking
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
Moritz Hammer, Alexander Knapp, Stephan Merz
148
Voted
ENTCS
2007
156views more  ENTCS 2007»
15 years 2 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...