328 search results - page 35 / 66 » Proving Termination of Communicating Programs |
AISC
2004
Springer
14 years 1 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
FASE
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
ACSD
2001
IEEE
13 years 11 months ago
2001
IEEE
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
CTRS
1987
13 years 11 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
ORL
2008
13 years 7 months ago
2008
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...