1382 search results - page 144 / 277 » Formal Analysis of Online Algorithms |
145
click to vote
APN
2001
Springer
15 years 11 months ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
172
click to vote
DAS
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a framework for understanding tables of contents (TOC) of books, journals, and magazines. We propose a universal logical structure representation in terms of a...
167
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
185
click to vote
SASN
2003
ACM
15 years 11 months ago
2003
ACM
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
157
click to vote
TACAS
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...