12981 search results - page 417 / 2597 » Model Checking (Abstract) |
118
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
160
click to vote
FOIKS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
153
click to vote
ESOP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
162
click to vote
FROCOS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
129
click to vote
CPAIOR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...