2881 search results - page 171 / 577 » Model Checking for Programming Languages using Verisoft |
276
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
204
click to vote
ESOP
1992
Springer
15 years 10 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
148
click to vote
KBSE
2010
IEEE
15 years 4 months ago
2010
IEEE
During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because existing p...
150
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
170
Voted
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...