Sciweavers

417 search results - page 36 / 84
» Orderings for Innermost Termination
Sort
View
ICALP
2005
Springer
15 years 5 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
PPDP
2005
Springer
15 years 5 months ago
Security policy in a declarative style
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...
Rachid Echahed, Frédéric Prost
IPPS
2002
IEEE
15 years 4 months ago
Disconnected Operations in Mobile Environments
The execution of distributed applications involving mobile terminals and fixed servers connected by wireless links raises the need for handling network disconnections, both invol...
Denis Conan, Sophie Chabridon, Guy Bernard
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 3 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
CONCUR
2006
Springer
15 years 3 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous