Sciweavers

142 search results - page 18 / 29
» Program obfuscation: a quantitative approach
Sort
View
LCTRTS
2010
Springer
14 years 2 months ago
Contracts for modular discrete controller synthesis
We describe the extension of a reactive programming language with a behavioral contract construct. It is dedicated to the programming of reactive control of applications in embedd...
Gwenaël Delaval, Hervé Marchand, &Eacu...
DAC
2003
ACM
14 years 8 months ago
Automatic trace analysis for logic of constraints
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
PLDI
2010
ACM
14 years 5 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
ECML
2007
Springer
14 years 1 months ago
Statistical Debugging Using Latent Topic Models
Abstract. Statistical debugging uses machine learning to model program failures and help identify root causes of bugs. We approach this task using a novel Delta-Latent-Dirichlet-Al...
David Andrzejewski, Anne Mulhern, Ben Liblit, Xiao...
LPAR
2004
Springer
14 years 27 days ago
Weighted Answer Sets and Applications in Intelligence Analysis
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir