Sciweavers

581 search results - page 108 / 117
» Race analysis for SystemC using model checking
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 5 days ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
SIGSOFT
2005
ACM
14 years 8 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 2 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...
APN
2004
Springer
13 years 11 months ago
Web Supported Enactment of Petri-Net Based Workflows with XRL/Flower
This paper describes concepts and features of a Web-based system called XRL/flower for carrying out Petri-net based workflows described with XRL (eXchangeable Routing Language). XR...
Alexander Norta