Sciweavers

799 search results - page 125 / 160
» A Logic for Abstract State Machines
Sort
View
JUCS
2008
166views more  JUCS 2008»
14 years 9 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
ICFP
2006
ACM
15 years 9 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt
SECON
2007
IEEE
15 years 4 months ago
High-Level Application Development is Realistic for Wireless Sensor Networks
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
Marcin Karpinski, Vinny Cahill
ICES
2000
Springer
140views Hardware» more  ICES 2000»
15 years 1 months ago
Evolving Cellular Automata for Self-Testing Hardware
Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but requires efficient algori...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...
TPHOL
1999
IEEE
15 years 2 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme