Sciweavers

1205 search results - page 50 / 241
» Program Extraction from Large Proof Developments
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
MSCS
2006
89views more  MSCS 2006»
13 years 11 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden
CIE
2009
Springer
14 years 5 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
IAW
2003
IEEE
14 years 4 months ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
CIA
2006
Springer
14 years 2 months ago
Coverage Density as a Dominant Property of Large-Scale Sensor Networks
Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar ...
Osher Yadgar, Sarit Kraus