3190 search results - page 143 / 638 » cans 2011 |
117
click to vote
ISQED
2011
IEEE
14 years 4 months ago
2011
IEEE
Due to the dramatic increase in design complexity, verifying the functional correctness of a circuit is becoming more difficult. Therefore, bugs may escape all verification effo...
130
Voted
FASE
2011
Springer
14 years 4 months ago
2011
Springer
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
349
Voted
BPM
2011
Springer
14 years 24 days ago
2011
Springer
As order dependencies between process tasks can get complex, it is easy to make mistakes in process model design, especially behavioral ones such as deadlocks. Notions such as soun...
175
click to vote
CP
2011
Springer
14 years 19 days ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
92
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...