Sciweavers

125 search results - page 24 / 25
» Bounded Model Checking of Compositional Processes
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 5 months ago
Efficient Approximation of Optimal Control for Markov Games
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
Markus Rabe, Sven Schewe, Lijun Zhang
ICMCS
2006
IEEE
118views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Spread-Spectrum Substitution watermarking Game
In the integrity checking context of multimedia contents, a malicious user aims at devising a forged content in order to fool a watermarker by making him use as a genuine content....
Jean-Philippe Boyer, Pierre Duhamel, Jacques Blanc...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 1 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
DAC
2002
ACM
14 years 6 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
SIGSOFT
2009
ACM
14 years 17 days ago
Automatic synthesis of behavior protocols for composable web-services
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...
Antonia Bertolino, Paola Inverardi, Patrizio Pelli...