Sciweavers

16 search results - page 3 / 4
» Automated Refinement Checking for Asynchronous Processes
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 5 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
14 years 6 days ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
BMCBI
2005
92views more  BMCBI 2005»
13 years 5 months ago
FIGENIX: Intelligent automation of genomic annotation: expertise integration in a new software platform
Background: Two of the main objectives of the genomic and post-genomic era are to structurally and functionally annotate genomes which consists of detecting genes' position a...
Philippe Gouret, Vérane Vitiello, Nathalie ...
TCAD
2010
121views more  TCAD 2010»
13 years 11 days ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
ICFEM
2009
Springer
14 years 6 days ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...