1895 search results - page 246 / 379 » Using ATL for Checking Models |
261
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
138
click to vote
KBSE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
142
Voted
COMPULOG
1999
Springer
15 years 9 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
263
click to vote
ACL2
2006
ACM
15 years 8 months ago
2006
ACM
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...
130
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...