691 search results - page 41 / 139 » Automatically Proving Linearizability |
IPL
2000
13 years 9 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
RTA
2011
Springer
13 years 22 days ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
FASE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Blast is an automatic verification tool for checking temporal safety properties of C programs. Given a C program and a temporal safety property, Blast statically proves ...
ENTCS
2008
13 years 10 months ago
2008
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
JDCTA
2010
13 years 4 months ago
2010
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...