Sciweavers

92 search results - page 3 / 19
» A Formal Approach To The Protocol Converter Problem
Sort
View
ICFEM
2003
Springer
14 years 25 days ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
AAAI
2008
13 years 10 months ago
On the Enactability of Business Protocols
Protocols specifying business interactions among autonomous parties enable reuse and promote interoperability. A protocol is specified from a global viewpoint, but enacted in a di...
Nirmit Desai, Munindar P. Singh
DAC
2006
ACM
14 years 8 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
12 years 3 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
IJCAI
2007
13 years 9 months ago
From Sampling to Model Counting
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...