1710 search results - page 76 / 342 » High-Level Programs and Program Conditions |
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
IFM
2005
Springer
14 years 1 months ago
2005
Springer
We provide an automatic method for calculating the path condition for programs with real time constraints. This method can be used for the semiautomatic verification of a unit of ...
NETCOOP
2007
Springer
14 years 2 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment...
ENTCS
2008
13 years 8 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...