5084 search results - page 154 / 1017 » Proving Possibility Properties |
189
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
157
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in P...
174
click to vote
CAISE
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we present a heuristic approach for finding errors and possible improvements in business process models. First, we translate the information that is included in a m...
179
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
159
click to vote
VSTTE
2005
Springer
15 years 11 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...