1147 search results - page 69 / 230 » Termination in language-based systems |
121
click to vote
FOSSACS
2010
Springer
16 years 24 days ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
155
click to vote
FROCOS
2007
Springer
16 years 4 days ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
130
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...
158
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
125
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...