4126 search results - page 616 / 826 » Set based logic programming |
127
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
125
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...
109
click to vote
COR
2007
15 years 3 months ago
2007
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
106
click to vote
VMCAI
2005
Springer
15 years 8 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
160
click to vote
ICSM
2002
IEEE
15 years 8 months ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...