31387 search results - page 369 / 6278 » Abstracts |
110
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...
190
click to vote
SYNASC
2008
IEEE
16 years 1 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
153
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
197
click to vote
ECBS
2006
IEEE
15 years 10 months ago
2006
IEEE
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
160
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...