• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 66,406
Next 10 →

Table 2. Running times (in minutes) and memory usage (in MBytes) of the model checker spin.

in Mechanizing the powerset construction for restricted classes of ω-automata
by Christian Dax, Jochen Eisinger, Felix Klaedtke 2007
"... In PAGE 14: ... Addition- ally, we used the system model described in [16], which we name giop and the system model described in [1], which we name signarch. Table2 lists the running times and the memory usage of some of our test cases. Most of the models have parameters, which can be instantiated to concrete values, e.... ..."
Cited by 1

Table 2. Running times (in minutes) and memory usage (in MBytes) of the model checker spin.

in Mechanizing the powerset construction for restricted classes of ω-automata
by Christian Dax, Jochen Eisinger, Felix Klaedtke 2007
"... In PAGE 14: ... Addition- ally, we used the system model described in [16], which we name giop and the system model described in [1], which we name signarch. Table2 lists the running times and the memory usage of some of our test cases. Most of the models have parameters, which can be instantiated to concrete values, e.... ..."
Cited by 1

Table 1 A Summary of the results ruining the tests in the models.

in Checking Java Concurrency Design Patterns Using Bandera
by Cleidson De Souza
"... In PAGE 13: ... The system generated a runtime exception during the model checking, which could be a result of an error in the conversion of the internal JJJT compiler to the formal language of the SPIN model checker. The main results of our experiments are presented in Table1 as follows: ... ..."

Table 1 A Summary of the results ruining the tests in the models.

in Checking Java Concurrency Design Patterns Using Bandera
by Cleidson R. B. de Souza, Roberto S. Silva Filho
"... In PAGE 13: ... The system generated a runtime exception during the model checking, which could be a result of an error in the conversion of the internal JJJT compiler to the formal language of the SPIN model checker. The main results of our experiments are presented in Table1 as follows: ... ..."

Table 1: Verifying SCR Speci#0Ccations with Model Checkers.

in Model checking complete requirements specifications using abstraction
by Ramesh Bharadwaj, Constance Heitmeyer 1999
"... In PAGE 16: ... In addition to uncovering all the seeded errors with other tools in our toolset, we also established by model checking that the original formulation of a presumed one-state invariant, #5CThe aircraft should not drop a bomb un- less the pilot has pressedrelease enable #28property P in Table 2#29, quot; does not hold for the corrected SCR speci#0Ccation. In consultation with Kirby, the creator of the speci#0Ccation, we reformulated the propertyasatwo-state invariant #28property Q in Table1 #29 and veri#0Ced the restated property using both Spin and SMV. We ran these experiments on a lightly loaded 167 MHz Sparc Ultra-1 with 130 MBytes of RAM.... In PAGE 16: ...#29 6.1 Discussion Table1 presents some of our veri#0Ccation results. In Table 1, AM1 and AM2 refer to the two abstraction methods.... ..."
Cited by 10

Table 1. Alternating bit protocol: pre x based analysis

in unknown title
by unknown authors 1998
"... In PAGE 13: ...eterminism is supported. Each atomic action can also be seen as a condition. We used pre x based algorithms (a special purpose deadlock-checker [22] and the model checker) as well as the Spin LTL veri er to check some properties of the alternating-bit protocol. Table1 and Table 2 summarise the results. We brie y mention some interesting observations: { Low-level Petri nets are not appropriate to model channels.... ..."
Cited by 2

Table 1. Alternating bit protocol: pre x based analysis

in Profiting from Spin in PEP
by Bernd Grahlmann, Carola Pohl
"... In PAGE 13: ...eterminism is supported. Each atomic action can also be seen as a condition. We used pre x based algorithms (a special purpose deadlock-checker [22] and the model checker) as well as the Spin LTL veri er to check some properties of the alternating-bit protocol. Table1 and Table 2 summarise the results. We brie y mention some interesting observations: { Low-level Petri nets are not appropriate to model channels.... ..."

Table 4: Runtimes of the model checker

in Truth -- A Platform for Verification of Distributed Systems
by Martin Leucker, Stephan Tobies 1998
Cited by 2

Table I. Statistics for the model checker

in Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
by E. A. Emerson, A. P. Sistla 1981
Cited by 1

Table I. Statistics for the model checker

in Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
by E.A. Emerson, A. P. Sistla 1981
Cited by 1
Next 10 →
Results 1 - 10 of 66,406
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University