264 search results - page 17 / 53 » entcs 2008 |
ENTCS
2008
13 years 6 months ago
2008
c Abstraction in Parameterized Verification Parosh Aziz Abdulla1 Department of Information Technology Uppsala University Sweden Giorgio Delzanno2 Dipartimento Informatica e Scienze...
ENTCS
2008
13 years 5 months ago
2008
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
ENTCS
2008
13 years 6 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
ENTCS
2008
13 years 6 months ago
2008
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
ENTCS
2008
13 years 6 months ago
2008
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...