1147 search results - page 69 / 230 » Termination in language-based systems |
FOSSACS
2010
Springer
14 years 4 months 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...
FROCOS
2007
Springer
14 years 4 months 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 ...
PPDP
2005
Springer
14 years 3 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...
CSL
2004
Springer
14 years 3 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...
TPHOL
2003
IEEE
14 years 3 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...