Sciweavers

62 search results - page 7 / 13
» EPR-Based Bounded Model Checking at Word Level
Sort
View
UMC
2000
13 years 11 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
ISCAPDCS
2003
13 years 8 months ago
Loop Transformation Techniques To Aid In Loop Unrolling and Multithreading
In modern computer systems loops present a great deal of opportunities for increasing Instruction Level and Thread Level Parallelism. Loop unrolling is a technique used to obtain ...
Litong Song, Yuhua Zhang, Krishna M. Kavi
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
13 years 11 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
JSS
2010
120views more  JSS 2010»
13 years 2 months ago
Handling communications in process algebraic architectural description languages: Modeling, verification, and implementation
Architectural description languages are a useful tool for modeling complex systems at a high level of abstraction. If based on formal methods, they can also serve for enabling the...
Marco Bernardo, Edoardo Bontà, Alessandro A...