Sciweavers

4767 search results - page 270 / 954
» Structures for Abstract Rewriting
Sort
View
ENTCS
2006
151views more  ENTCS 2006»
15 years 6 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
TSMC
2008
187views more  TSMC 2008»
15 years 6 months ago
A Position-Based Clustering Technique for Ad Hoc Intervehicle Communication
Abstract--Intervehicle communication is a key technique of intelligent transport systems. Recently, ad hoc networking in the vehicular environment was investigated intensively. Thi...
Zhigang Wang, Lichuan Liu, MengChu Zhou, N. Ansari
OTM
2010
Springer
15 years 5 months ago
A Hybrid Approach to Constructing Tag Hierarchies
Abstract. Folksonomies are becoming increasingly popular. They contain large amounts of data which can be mined and utilized for many tasks like visualization, browsing, informatio...
Geir Solskinnsbakk, Jon Atle Gulla
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
16 years 23 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&...
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...