Sciweavers

289 search results - page 54 / 58
» Formal Verification in a Commercial Setting
Sort
View
SIGSOFT
2003
ACM
15 years 10 months ago
Behaviour model elaboration using partial labelled transition systems
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
Sebastián Uchitel, Jeff Kramer, Jeff Magee
ICFP
2009
ACM
15 years 10 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
14 years 11 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
TCAD
2008
101views more  TCAD 2008»
14 years 9 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
KI
2002
Springer
14 years 9 months ago
Advantages, Opportunities and Limits of Empirical Evaluations: Evaluating Adaptive Systems
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this approach. This article outlines both the opportun...
Stephan Weibelzahl, Gerhard Weber