Sciweavers

294 search results - page 41 / 59
» Formal Verification of the Implementability of Timing Requir...
Sort
View
83
Voted
ACMSE
2005
ACM
15 years 4 months ago
Facilitating and automating empirical evaluation
Through the automation of empirical evaluation we hope to alleviate evaluation problems encountered by software designers who are relatively new to the process. Barriers to good e...
Laurian Hobby, John Booker, D. Scott McCrickard, C...
77
Voted
MEMOCODE
2007
IEEE
15 years 5 months ago
Towards Equivalence Checking Between TLM and RTL Models
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
Nicola Bombieri, Franco Fummi, Graziano Pravadelli...
104
Voted
SAC
2003
ACM
15 years 4 months ago
Comparing Semantic Frameworks for Coordination: On the Conformance Issue for Coordination Media
A fundamental issue in the engineering of coordination models is n coordination abstractions that are correct with respect to the specification of the coordination model they imp...
Mirko Viroli
96
Voted
DAC
2007
ACM
15 years 2 months ago
Side-Channel Attack Pitfalls
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
Kris Tiri
97
Voted
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
15 years 11 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...