Sciweavers

7049 search results - page 293 / 1410
» Data Abstraction for CSP-OZ
Sort
View
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
16 years 27 days ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
ARCS
2006
Springer
15 years 10 months ago
Prototypical Implementation of Location-Aware Services Based on Super-Distributed RFID Tags
Abstract. We provide evidence of the feasibility and effectiveness of a middleware architecture for mobile devices which employs dense distributions of small computerized entities ...
Jürgen Bohn
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 10 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...
161
Voted
ECIR
2007
Springer
15 years 8 months ago
A Parameterised Search System
This paper introduces the concept of a Parameterised Search System (PSS), which allows flexibility in user queries, and, more importantly, allows system engineers to easily defin...
Roberto Cornacchia, Arjen P. de Vries
WCRE
2000
IEEE
15 years 11 months ago
E/R Schema for the Datrix C/C++/Java Exchange Format
A SEF (software exchange format), such as GXL [6], TA [4] or RSF [7], is used to exchange data between tools that analyze software. Researchers at Bell Canada have specified the D...
Richard C. Holt, Ahmed E. Hassan, Bruno Laguë...