212 search results - page 30 / 43 » Completeness and Complexity of Bounded Model Checking |
112
Voted
ICFEM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
102
click to vote
ACSAC
2010
IEEE
14 years 12 months ago
2010
IEEE
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...
114
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
153
click to vote
FOSSACS
2001
Springer
15 years 6 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
124
click to vote
IANDC
2007
15 years 1 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...