104 search results - page 11 / 21 » Proving Termination Properties with mu-term |
85
Voted
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
165
Voted
POPL
2007
ACM
15 years 11 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
99
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
96
Voted
ICFEM
2009
Springer
15 years 5 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
102
Voted
EMSOFT
2005
Springer
15 years 4 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...