Sciweavers

DATE
2009
IEEE
90views Hardware» more  DATE 2009»
14 years 5 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...
CSE
2009
IEEE
14 years 5 months ago
Ceremonies Formal Analysis in PKI's Context
—Ceremonies are a useful tool to establish trust in scenarios where protocols operate. They describe a greater range of issues not taken into account by protocol designers. We ta...
Jean Everson Martina, Túlio Cicero Salvaro ...
SAS
2009
Springer
149views Formal Methods» more  SAS 2009»
14 years 5 months ago
Creating Transformations for Matrix Obfuscation
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
Stephen Drape, Irina Voiculescu
CAV
2009
Springer
128views Hardware» more  CAV 2009»
14 years 5 months ago
Modelling Epigenetic Information Maintenance: A Kappa Tutorial
Jean Krivine, Vincent Danos, Arndt Benecke
CAV
2009
Springer
156views Hardware» more  CAV 2009»
14 years 5 months ago
Towards Performance Prediction of Compositional Models in Industrial GALS Designs
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...
Nicolas Coste, Holger Hermanns, Etienne Lantreibec...
CAV
2009
Springer
168views Hardware» more  CAV 2009»
14 years 5 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
Thomas Gawlitza, Helmut Seidl
CAV
2009
Springer
138views Hardware» more  CAV 2009»
14 years 5 months ago
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
CAV
2009
Springer
182views Hardware» more  CAV 2009»
14 years 5 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...
VMCAI
2010
Springer
14 years 5 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker